./PaxHeaders.5405/madp-0.40000644000000000000000000000013212717644321012037 xustar0030 mtime=1463765201.225551447 30 atime=1463765202.453541638 30 ctime=1463765201.225551447 madp-0.4/0000775000372100037210000000000012717644321012613 5ustar00fransfrans00000000000000madp-0.4/PaxHeaders.5405/configure.ac0000644000000000000000000000007412717644140014251 xustar0030 atime=1463765191.797626747 30 ctime=1463765201.009553172 madp-0.4/configure.ac0000664000372100037210000001367212717644140015111 0ustar00fransfrans00000000000000# Process this file with autoconf to produce a configure script. AC_PREREQ(2.61) AC_INIT([MADP],[0.4],[madp-users@omni.isr.ist.utl.pt]) # subdir-objects is used in src/libpomdp-solve AM_INIT_AUTOMAKE([1.9 tar-pax subdir-objects]) AC_CONFIG_SRCDIR([config.h.in]) AC_CONFIG_HEADER([config.h]) AC_CONFIG_MACRO_DIR([m4]) # Checks for programs. AC_PROG_CXX AC_PROG_CC AC_PROG_CPP AC_PROG_INSTALL AC_PROG_LN_S AC_PROG_MAKE_SET #CSTANDARD: #See https://gcc.gnu.org/onlinedocs/gcc/C-Dialect-Options.html#C-Dialect-Options # #'c++11' #The 2011 ISO C++ standard plus amendments. The name ‘c++0x’ is deprecated. #Important: GCC's support for C++11 is still experimental. Some features were implemented based on early proposals, and no attempt will be made to maintain backward compatibility when they are updated to match the final C++11 standard. CSTD11="-std=c++11" AC_SUBST(CSTD11) #--leads to problems compiling boost 1.49 # (problems occur when including the file needed for the ERF function...) # #'gnu++11' #GNU dialect of -std=c++11. The name ‘gnu++0x’ is deprecated. CSTDGNU11="-std=gnu++11" AC_SUBST(CSTDGNU11) # #‘gnu++98’, ‘gnu++03’ #GNU dialect of -std=c++98. This is the default for C++ code. #(i.e. default, if no C++ language dialect options are given, is -std=gnu++98.) CSTDGNU="-std=gnu++03" AC_SUBST(CSTDGNU) # #‘c++98’, ‘c++03’ #The 1998 ISO C++ standard plus the 2003 technical corrigendum and some additional defect reports. Same as -ansi for C++ code. #CSTANDARD="-std=c++03" CSTD="-std=c++98" AC_SUBST(CSTD) # #overall standard we want to use: AC_SUBST(CSTANDARD,"-std=c++98") #specified the flags in src/Makefile.am # You can turn off shared libraries during beta-testing, since they # make the build process take too long. # AC_DISABLE_SHARED # AC_DISABLE_STATIC AC_PROG_LIBTOOL #CHECK for standard c++ libs (and include the linkind directives...) AC_CHECK_LIB([stdc++],[__cxa_free_exception]) # defining the libs doesn't work... # Don't check nor include lp-solve anymore until Tony Cassandra's code # has been updated for using the system-wide lp-solve #AC_CHECK_HEADER( # [lpsolve/lp_types.h], # [AC_DEFINE([HAVE_LPSOLVE], [],[lpsolve available])]) # [AC_DEFINE([HAVE_LPSOLVE], [],[lpsolve available]) LPSOLVE_LIB="/usr/lib/liblpsolve55_pic.a" LPSOLVE_LD="-lcolamd -ldl"]) # IMPORTANT; check for math lib before lpsolve, otherwise lpsolve will fail (it needs '-lm') AC_CHECK_LIB([m], [main]) # check for lpsolve AC_CHECK_HEADER( [lpsolve/lp_lib.h], [], [AC_MSG_WARN([lpsolve not installed, required for pruning POMDP value functions])]) AC_CHECK_LIB(dl, dlopen) AC_CHECK_LIB(colamd, colamd) AC_CHECK_LIB([lpsolve55_pic], [make_lp], [], [AC_MSG_WARN([lpsolve not installed, required for pruning POMDP value functions])]) # Checks for header files. AC_HEADER_STDC AC_HEADER_STDBOOL AC_CHECK_HEADERS([float.h limits.h stdlib.h]) # Checks for typedefs, structures, and compiler characteristics. AC_C_CONST AC_C_INLINE AC_TYPE_SIZE_T #check for cplex: AC_CPLEX # Checks for library functions. AC_FUNC_ERROR_AT_LINE AC_CHECK_FUNCS([pow strtoull]) ## Option for using compile -g flag for debugging symbols ## AM_CONDITIONAL(DEBUG, true) AC_ARG_ENABLE(debug, [ --enable-debug enable debugging symbols], [ if test "x$enableval" = "xyes" ; then AM_CONDITIONAL(DEBUG, true) fi ] ) ## Option for using compile -pg flag for profiling ## AM_CONDITIONAL(PROFILE, false) AC_ARG_ENABLE(profile, [ --enable-profile enable debugging symbols and profiling], [ if test "x$enableval" = "xyes" ; then AM_CONDITIONAL(PROFILE, true) fi ] ) ## Option for using dmalloc memory leak checking library ## AM_CONDITIONAL(DMALLOC, false) AC_ARG_ENABLE(dmalloc, [ --enable-dmalloc enable using dmalloc memory checker], [ if test "x$enableval" = "xyes" ; then AM_CONDITIONAL(DMALLOC, true) fi ] ) # Checks for programs. AC_PROG_CC #AC_PROG_YACC #AM_PROG_LEX # Checks for libraries. # FIXME: Replace `main' with a function in `-lcplex': #AC_CHECK_LIB([cplex], [main]) # Checks for header files. AC_HEADER_STDC AC_CHECK_HEADERS([float.h limits.h stddef.h stdlib.h string.h sys/time.h unistd.h]) # Checks for typedefs, structures, and compiler characteristics. AC_C_CONST AC_TYPE_SIZE_T AC_HEADER_TIME # Checks for library functions. AC_FUNC_ERROR_AT_LINE AC_FUNC_MALLOC AC_FUNC_REALLOC AC_TYPE_SIGNAL AC_FUNC_STRTOD AC_FUNC_VPRINTF AC_CHECK_FUNCS([bzero floor gettimeofday memset pow sqrt strstr]) #---------------end of stuff required for pomdp-solve ------------------------------------ #For OS-dependent compilation AC_CANONICAL_HOST case $host_os in *darwin*) HOST_OS=darwin AC_MSG_WARN("Compiling on OSX. Some functionalities will not be available.") ;; #Other os-specific instructions can go here. esac AM_CONDITIONAL([DARWIN], [test x$HOST_OS = xdarwin]) #Small check for OSX systems where glibc ports may leave argp_parse undefined AC_SEARCH_LIBS([argp_parse], [argp], [], [ AC_MSG_ERROR([unable to find the argp_parse() function]) ]) #Check for libxml2 (required for ParserProbModelXML) AC_CHECK_LIB([xml2], [xmlInitParser]) AC_CHECK_HEADER([libxml2/libxml/xmlexports.h]) AM_CONDITIONAL(FOUND_LIBXML2, [test "x$ac_cv_header_libxml2_libxml_xmlexports_h" == xyes]) AC_CONFIG_FILES([Makefile src/Makefile src/parser/Makefile src/base/Makefile src/support/Makefile src/planning/Makefile src/madp/Makefile src/utils/Makefile src/examples/Makefile src/libDAI/Makefile src/solvers/Makefile ]) #avoid ": compiling `test_gsl.c' with per-target flags requires `AM_PROG_CC_C_O' in `configure.ac'" AM_PROG_CC_C_O AC_OUTPUT madp-0.4/PaxHeaders.5405/COPYING0000644000000000000000000000007312717644140013015 xustar0029 atime=1463765180.05772051 30 ctime=1463765201.009553172 madp-0.4/COPYING0000664000372100037210000010622312717644140013651 0ustar00fransfrans00000000000000The Multiagent Decision Process Toolbox Copyright (C) 2007,2008,2014,2015,2016 The MADP Toolbox is released under a GNU GPL v3 license, which is found below. Note that the MADP distribution includes other software which is distributed under its own license. To avoid any confusion, we explicitly list the components included in this distribution here. MADP Toolbox components (all under GPL v3): src/base src/example src/include src/parser src/planning src/solvers src/support src/utils Included other software: src/libDAI - libDAI http://staff.science.uva.nl/~jmooij1/libDAI/ libDAI is licensed under the BSD 2-clause license (also known as the FreeBSD license). src/boost - boost libraries http://www.boost.org/ Licensed under the Boost Software License. ---------------------------------------------------------------------- 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. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively state the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) This program 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. This program 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 this program. If not, see . Also add information on how to contact you by electronic and paper mail. If the program does terminal interaction, make it output a short notice like this when it starts in an interactive mode: Copyright (C) This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, your program's commands might be different; for a GUI interface, you would use an "about box". You should also get your employer (if you work as a programmer) or school, if any, to sign a "copyright disclaimer" for the program, if necessary. For more information on this, and how to apply and follow the GNU GPL, see . The GNU General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this License. But first, please read . madp-0.4/PaxHeaders.5405/compile0000644000000000000000000000013212717644307013336 xustar0030 mtime=1463765191.861626236 30 atime=1463765191.861626236 30 ctime=1463765201.009553172 madp-0.4/compile0000755000372100037210000001624512717644307014203 0ustar00fransfrans00000000000000#! /bin/sh # Wrapper for compilers which do not understand '-c -o'. scriptversion=2012-10-14.11; # UTC # Copyright (C) 1999-2013 Free Software Foundation, Inc. # Written by Tom Tromey . # # This program 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 2, or (at your option) # any later version. # # This program 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 this program. If not, see . # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # This file is maintained in Automake, please report # bugs to or send patches to # . nl=' ' # We need space, tab and new line, in precisely that order. Quoting is # there to prevent tools from complaining about whitespace usage. IFS=" "" $nl" file_conv= # func_file_conv build_file lazy # Convert a $build file to $host form and store it in $file # Currently only supports Windows hosts. If the determined conversion # type is listed in (the comma separated) LAZY, no conversion will # take place. func_file_conv () { file=$1 case $file in / | /[!/]*) # absolute file, and not a UNC file if test -z "$file_conv"; then # lazily determine how to convert abs files case `uname -s` in MINGW*) file_conv=mingw ;; CYGWIN*) file_conv=cygwin ;; *) file_conv=wine ;; esac fi case $file_conv/,$2, in *,$file_conv,*) ;; mingw/*) file=`cmd //C echo "$file " | sed -e 's/"\(.*\) " *$/\1/'` ;; cygwin/*) file=`cygpath -m "$file" || echo "$file"` ;; wine/*) file=`winepath -w "$file" || echo "$file"` ;; esac ;; esac } # func_cl_dashL linkdir # Make cl look for libraries in LINKDIR func_cl_dashL () { func_file_conv "$1" if test -z "$lib_path"; then lib_path=$file else lib_path="$lib_path;$file" fi linker_opts="$linker_opts -LIBPATH:$file" } # func_cl_dashl library # Do a library search-path lookup for cl func_cl_dashl () { lib=$1 found=no save_IFS=$IFS IFS=';' for dir in $lib_path $LIB do IFS=$save_IFS if $shared && test -f "$dir/$lib.dll.lib"; then found=yes lib=$dir/$lib.dll.lib break fi if test -f "$dir/$lib.lib"; then found=yes lib=$dir/$lib.lib break fi if test -f "$dir/lib$lib.a"; then found=yes lib=$dir/lib$lib.a break fi done IFS=$save_IFS if test "$found" != yes; then lib=$lib.lib fi } # func_cl_wrapper cl arg... # Adjust compile command to suit cl func_cl_wrapper () { # Assume a capable shell lib_path= shared=: linker_opts= for arg do if test -n "$eat"; then eat= else case $1 in -o) # configure might choose to run compile as 'compile cc -o foo foo.c'. eat=1 case $2 in *.o | *.[oO][bB][jJ]) func_file_conv "$2" set x "$@" -Fo"$file" shift ;; *) func_file_conv "$2" set x "$@" -Fe"$file" shift ;; esac ;; -I) eat=1 func_file_conv "$2" mingw set x "$@" -I"$file" shift ;; -I*) func_file_conv "${1#-I}" mingw set x "$@" -I"$file" shift ;; -l) eat=1 func_cl_dashl "$2" set x "$@" "$lib" shift ;; -l*) func_cl_dashl "${1#-l}" set x "$@" "$lib" shift ;; -L) eat=1 func_cl_dashL "$2" ;; -L*) func_cl_dashL "${1#-L}" ;; -static) shared=false ;; -Wl,*) arg=${1#-Wl,} save_ifs="$IFS"; IFS=',' for flag in $arg; do IFS="$save_ifs" linker_opts="$linker_opts $flag" done IFS="$save_ifs" ;; -Xlinker) eat=1 linker_opts="$linker_opts $2" ;; -*) set x "$@" "$1" shift ;; *.cc | *.CC | *.cxx | *.CXX | *.[cC]++) func_file_conv "$1" set x "$@" -Tp"$file" shift ;; *.c | *.cpp | *.CPP | *.lib | *.LIB | *.Lib | *.OBJ | *.obj | *.[oO]) func_file_conv "$1" mingw set x "$@" "$file" shift ;; *) set x "$@" "$1" shift ;; esac fi shift done if test -n "$linker_opts"; then linker_opts="-link$linker_opts" fi exec "$@" $linker_opts exit 1 } eat= case $1 in '') echo "$0: No command. Try '$0 --help' for more information." 1>&2 exit 1; ;; -h | --h*) cat <<\EOF Usage: compile [--help] [--version] PROGRAM [ARGS] Wrapper for compilers which do not understand '-c -o'. Remove '-o dest.o' from ARGS, run PROGRAM with the remaining arguments, and rename the output as expected. If you are trying to build a whole package this is not the right script to run: please start by reading the file 'INSTALL'. Report bugs to . EOF exit $? ;; -v | --v*) echo "compile $scriptversion" exit $? ;; cl | *[/\\]cl | cl.exe | *[/\\]cl.exe ) func_cl_wrapper "$@" # Doesn't return... ;; esac ofile= cfile= for arg do if test -n "$eat"; then eat= else case $1 in -o) # configure might choose to run compile as 'compile cc -o foo foo.c'. # So we strip '-o arg' only if arg is an object. eat=1 case $2 in *.o | *.obj) ofile=$2 ;; *) set x "$@" -o "$2" shift ;; esac ;; *.c) cfile=$1 set x "$@" "$1" shift ;; *) set x "$@" "$1" shift ;; esac fi shift done if test -z "$ofile" || test -z "$cfile"; then # If no '-o' option was seen then we might have been invoked from a # pattern rule where we don't need one. That is ok -- this is a # normal compilation that the losing compiler can handle. If no # '.c' file was seen then we are probably linking. That is also # ok. exec "$@" fi # Name of file we expect compiler to create. cofile=`echo "$cfile" | sed 's|^.*[\\/]||; s|^[a-zA-Z]:||; s/\.c$/.o/'` # Create the lock directory. # Note: use '[/\\:.-]' here to ensure that we don't use the same name # that we are using for the .o file. Also, base the name on the expected # object file name, since that is what matters with a parallel build. lockdir=`echo "$cofile" | sed -e 's|[/\\:.-]|_|g'`.d while true; do if mkdir "$lockdir" >/dev/null 2>&1; then break fi sleep 1 done # FIXME: race condition here if user kills between mkdir and trap. trap "rmdir '$lockdir'; exit 1" 1 2 15 # Run the compile. "$@" ret=$? if test -f "$cofile"; then test "$cofile" = "$ofile" || mv "$cofile" "$ofile" elif test -f "${cofile}bj"; then test "${cofile}bj" = "$ofile" || mv "${cofile}bj" "$ofile" fi rmdir "$lockdir" exit $ret # Local Variables: # mode: shell-script # sh-indentation: 2 # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-time-zone: "UTC" # time-stamp-end: "; # UTC" # End: madp-0.4/PaxHeaders.5405/AUTHORS0000644000000000000000000000007312717644140013032 xustar0029 atime=1463765180.05772051 30 ctime=1463765200.997553268 madp-0.4/AUTHORS0000664000372100037210000000221612717644140013663 0ustar00fransfrans00000000000000Frans Oliehoek Department of Computer Science, University of Liverpool Liverpool, United Kingdom Intelligent Systems Lab Amsterdam, University of Amsterdam Amsterdam, The Netherlands Matthijs Spaan Delft University of Technology Delft, The Netherlands João Messias Institute for Systems and Robotics (ISR), Instituto Superior Técnico (IST) Lisbon, Portugal Philipp Robbel Media Lab, Massachusetts Institute of Technology Cambridge, MA, USA F.O. is funded by NWO Innovational Research Incentives Scheme Veni \#639.021.336. Previous development efforts were funded (in part) by AFOSR MURI project \#FA9550-09-1-0538, and the Interactive Collaborative Information Systems (ICIS) project, supported by the Dutch Ministry of Economic Affairs, grant nr: BSIK03024. M.S. was funded by the FP7 Marie Curie Actions Individual Fellowship #275217 (FP7-PEOPLE-2010-IEF) and was previously supported by Fundacao para a Ciencia e a Tecnologia (ISR/IST pluriannual funding) through the POS_Conhecimento Program that includes FEDER funds and through grant PTDC/EEA-ACR/73266/2006. madp-0.4/PaxHeaders.5405/doc0000644000000000000000000000007412717644140012453 xustar0030 atime=1463765202.453541638 30 ctime=1463765201.029553013 madp-0.4/doc/0000775000372100037210000000000012717644140013357 5ustar00fransfrans00000000000000madp-0.4/doc/PaxHeaders.5405/doxygen.conf0000644000000000000000000000007412717644140015054 xustar0030 atime=1463765180.065720446 30 ctime=1463765201.029553013 madp-0.4/doc/doxygen.conf0000664000372100037210000022510612717644140015711 0ustar00fransfrans00000000000000# Doxyfile 1.8.1.2 # This file describes the settings to be used by the documentation system # doxygen (www.doxygen.org) for a project. # # All text after a hash (#) is considered a comment and will be ignored. # The format is: # TAG = value [value, ...] # For lists items can also be appended using: # TAG += value [value, ...] # Values that contain spaces should be placed between quotes (" "). #--------------------------------------------------------------------------- # Project related configuration options #--------------------------------------------------------------------------- # This tag specifies the encoding used for all characters in the config file # that follow. The default is UTF-8 which is also the encoding used for all # text before the first occurrence of this tag. Doxygen uses libiconv (or the # iconv built into libc) for the transcoding. See # http://www.gnu.org/software/libiconv for the list of possible encodings. DOXYFILE_ENCODING = UTF-8 # The PROJECT_NAME tag is a single word (or sequence of words) that should # identify the project. Note that if you do not use Doxywizard you need # to put quotes around the project name if it contains spaces. PROJECT_NAME = MultiAgentDecisionProcess # The PROJECT_NUMBER tag can be used to enter a project or revision number. # This could be handy for archiving the generated documentation or # if some version control system is used. PROJECT_NUMBER = "Release 0.4" # Using the PROJECT_BRIEF tag one can provide an optional one line description # for a project that appears at the top of each page and should give viewer # a quick idea about the purpose of the project. Keep the description short. PROJECT_BRIEF = # With the PROJECT_LOGO tag one can specify an logo or icon that is # included in the documentation. The maximum height of the logo should not # exceed 55 pixels and the maximum width should not exceed 200 pixels. # Doxygen will copy the logo to the output directory. PROJECT_LOGO = # The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) # base path where the generated documentation will be put. # If a relative path is entered, it will be relative to the location # where doxygen was started. If left blank the current directory will be used. OUTPUT_DIRECTORY = doc # If the CREATE_SUBDIRS tag is set to YES, then doxygen will create # 4096 sub-directories (in 2 levels) under the output directory of each output # format and will distribute the generated files over these directories. # Enabling this option can be useful when feeding doxygen a huge amount of # source files, where putting all generated files in the same directory would # otherwise cause performance problems for the file system. CREATE_SUBDIRS = NO # The OUTPUT_LANGUAGE tag is used to specify the language in which all # documentation generated by doxygen is written. Doxygen will use this # information to generate all constant output in the proper language. # The default language is English, other supported languages are: # Afrikaans, Arabic, Brazilian, Catalan, Chinese, Chinese-Traditional, # Croatian, Czech, Danish, Dutch, Esperanto, Farsi, Finnish, French, German, # Greek, Hungarian, Italian, Japanese, Japanese-en (Japanese with English # messages), Korean, Korean-en, Lithuanian, Norwegian, Macedonian, Persian, # Polish, Portuguese, Romanian, Russian, Serbian, Serbian-Cyrillic, Slovak, # Slovene, Spanish, Swedish, Ukrainian, and Vietnamese. OUTPUT_LANGUAGE = English # If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will # include brief member descriptions after the members that are listed in # the file and class documentation (similar to JavaDoc). # Set to NO to disable this. BRIEF_MEMBER_DESC = YES # If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend # the brief description of a member or function before the detailed description. # Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the # brief descriptions will be completely suppressed. REPEAT_BRIEF = YES # This tag implements a quasi-intelligent brief description abbreviator # that is used to form the text in various listings. Each string # in this list, if found as the leading text of the brief description, will be # stripped from the text and the result after processing the whole list, is # used as the annotated text. Otherwise, the brief description is used as-is. # If left blank, the following values are used ("$name" is automatically # replaced with the name of the entity): "The $name class" "The $name widget" # "The $name file" "is" "provides" "specifies" "contains" # "represents" "a" "an" "the" ABBREVIATE_BRIEF = # If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then # Doxygen will generate a detailed section even if there is only a brief # description. ALWAYS_DETAILED_SEC = NO # If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all # inherited members of a class in the documentation of that class as if those # members were ordinary class members. Constructors, destructors and assignment # operators of the base classes will not be shown. INLINE_INHERITED_MEMB = NO # If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full # path before files name in the file list and in the header files. If set # to NO the shortest path that makes the file name unique will be used. FULL_PATH_NAMES = YES # If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag # can be used to strip a user-defined part of the path. Stripping is # only done if one of the specified strings matches the left-hand part of # the path. The tag can be used to show relative paths in the file list. # If left blank the directory from which doxygen is run is used as the # path to strip. STRIP_FROM_PATH = # The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of # the path mentioned in the documentation of a class, which tells # the reader which header file to include in order to use a class. # If left blank only the name of the header file containing the class # definition is used. Otherwise one should specify the include paths that # are normally passed to the compiler using the -I flag. STRIP_FROM_INC_PATH = # If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter # (but less readable) file names. This can be useful if your file system # doesn't support long names like on DOS, Mac, or CD-ROM. SHORT_NAMES = NO # If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen # will interpret the first line (until the first dot) of a JavaDoc-style # comment as the brief description. If set to NO, the JavaDoc # comments will behave just like regular Qt-style comments # (thus requiring an explicit @brief command for a brief description.) JAVADOC_AUTOBRIEF = YES # If the QT_AUTOBRIEF tag is set to YES then Doxygen will # interpret the first line (until the first dot) of a Qt-style # comment as the brief description. If set to NO, the comments # will behave just like regular Qt-style comments (thus requiring # an explicit \brief command for a brief description.) QT_AUTOBRIEF = YES # The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen # treat a multi-line C++ special comment block (i.e. a block of //! or /// # comments) as a brief description. This used to be the default behaviour. # The new default is to treat a multi-line C++ comment block as a detailed # description. Set this tag to YES if you prefer the old behaviour instead. MULTILINE_CPP_IS_BRIEF = YES # If the INHERIT_DOCS tag is set to YES (the default) then an undocumented # member inherits the documentation from any documented member that it # re-implements. INHERIT_DOCS = YES # If the SEPARATE_MEMBER_PAGES tag is set to YES, then doxygen will produce # a new page for each member. If set to NO, the documentation of a member will # be part of the file/class/namespace that contains it. SEPARATE_MEMBER_PAGES = NO # The TAB_SIZE tag can be used to set the number of spaces in a tab. # Doxygen uses this value to replace tabs by spaces in code fragments. TAB_SIZE = 4 # This tag can be used to specify a number of aliases that acts # as commands in the documentation. An alias has the form "name=value". # For example adding "sideeffect=\par Side Effects:\n" will allow you to # put the command \sideeffect (or @sideeffect) in the documentation, which # will result in a user-defined paragraph with heading "Side Effects:". # You can put \n's in the value part of an alias to insert newlines. ALIASES = # This tag can be used to specify a number of word-keyword mappings (TCL only). # A mapping has the form "name=value". For example adding # "class=itcl::class" will allow you to use the command class in the # itcl::class meaning. TCL_SUBST = # Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C # sources only. Doxygen will then generate output that is more tailored for C. # For instance, some of the names that are used will be different. The list # of all members will be omitted, etc. OPTIMIZE_OUTPUT_FOR_C = NO # Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java # sources only. Doxygen will then generate output that is more tailored for # Java. For instance, namespaces will be presented as packages, qualified # scopes will look different, etc. OPTIMIZE_OUTPUT_JAVA = NO # Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran # sources only. Doxygen will then generate output that is more tailored for # Fortran. OPTIMIZE_FOR_FORTRAN = NO # Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL # sources. Doxygen will then generate output that is tailored for # VHDL. OPTIMIZE_OUTPUT_VHDL = NO # Doxygen selects the parser to use depending on the extension of the files it # parses. With this tag you can assign which parser to use for a given extension. # Doxygen has a built-in mapping, but you can override or extend it using this # tag. The format is ext=language, where ext is a file extension, and language # is one of the parsers supported by doxygen: IDL, Java, Javascript, CSharp, C, # C++, D, PHP, Objective-C, Python, Fortran, VHDL, C, C++. For instance to make # doxygen treat .inc files as Fortran files (default is PHP), and .f files as C # (default is Fortran), use: inc=Fortran f=C. Note that for custom extensions # you also need to set FILE_PATTERNS otherwise the files are not read by doxygen. EXTENSION_MAPPING = # If MARKDOWN_SUPPORT is enabled (the default) then doxygen pre-processes all # comments according to the Markdown format, which allows for more readable # documentation. See http://daringfireball.net/projects/markdown/ for details. # The output of markdown processing is further processed by doxygen, so you # can mix doxygen, HTML, and XML commands with Markdown formatting. # Disable only in case of backward compatibilities issues. MARKDOWN_SUPPORT = YES # If you use STL classes (i.e. std::string, std::vector, etc.) but do not want # to include (a tag file for) the STL sources as input, then you should # set this tag to YES in order to let doxygen match functions declarations and # definitions whose arguments contain STL classes (e.g. func(std::string); v.s. # func(std::string) {}). This also makes the inheritance and collaboration # diagrams that involve STL classes more complete and accurate. BUILTIN_STL_SUPPORT = YES # If you use Microsoft's C++/CLI language, you should set this option to YES to # enable parsing support. CPP_CLI_SUPPORT = NO # Set the SIP_SUPPORT tag to YES if your project consists of sip sources only. # Doxygen will parse them like normal C++ but will assume all classes use public # instead of private inheritance when no explicit protection keyword is present. SIP_SUPPORT = NO # For Microsoft's IDL there are propget and propput attributes to indicate getter # and setter methods for a property. Setting this option to YES (the default) # will make doxygen replace the get and set methods by a property in the # documentation. This will only work if the methods are indeed getting or # setting a simple type. If this is not the case, or you want to show the # methods anyway, you should set this option to NO. IDL_PROPERTY_SUPPORT = YES # If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC # tag is set to YES, then doxygen will reuse the documentation of the first # member in the group (if any) for the other members of the group. By default # all members of a group must be documented explicitly. DISTRIBUTE_GROUP_DOC = NO # Set the SUBGROUPING tag to YES (the default) to allow class member groups of # the same type (for instance a group of public functions) to be put as a # subgroup of that type (e.g. under the Public Functions section). Set it to # NO to prevent subgrouping. Alternatively, this can be done per class using # the \nosubgrouping command. SUBGROUPING = YES # When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and # unions are shown inside the group in which they are included (e.g. using # @ingroup) instead of on a separate page (for HTML and Man pages) or # section (for LaTeX and RTF). INLINE_GROUPED_CLASSES = NO # When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and # unions with only public data fields will be shown inline in the documentation # of the scope in which they are defined (i.e. file, namespace, or group # documentation), provided this scope is documented. If set to NO (the default), # structs, classes, and unions are shown on a separate page (for HTML and Man # pages) or section (for LaTeX and RTF). INLINE_SIMPLE_STRUCTS = YES # When TYPEDEF_HIDES_STRUCT is enabled, a typedef of a struct, union, or enum # is documented as struct, union, or enum with the name of the typedef. So # typedef struct TypeS {} TypeT, will appear in the documentation as a struct # with name TypeT. When disabled the typedef will appear as a member of a file, # namespace, or class. And the struct will be named TypeS. This can typically # be useful for C code in case the coding convention dictates that all compound # types are typedef'ed and only the typedef is referenced, never the tag name. TYPEDEF_HIDES_STRUCT = NO # Similar to the SYMBOL_CACHE_SIZE the size of the symbol lookup cache can be # set using LOOKUP_CACHE_SIZE. This cache is used to resolve symbols given # their name and scope. Since this can be an expensive process and often the # same symbol appear multiple times in the code, doxygen keeps a cache of # pre-resolved symbols. If the cache is too small doxygen will become slower. # If the cache is too large, memory is wasted. The cache size is given by this # formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range is 0..9, the default is 0, # corresponding to a cache size of 2^16 = 65536 symbols. LOOKUP_CACHE_SIZE = 0 #--------------------------------------------------------------------------- # Build related configuration options #--------------------------------------------------------------------------- # If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in # documentation are documented, even if no documentation was available. # Private class members and static file members will be hidden unless # the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES EXTRACT_ALL = YES # If the EXTRACT_PRIVATE tag is set to YES all private members of a class # will be included in the documentation. EXTRACT_PRIVATE = YES # If the EXTRACT_PACKAGE tag is set to YES all members with package or internal scope will be included in the documentation. EXTRACT_PACKAGE = NO # If the EXTRACT_STATIC tag is set to YES all static members of a file # will be included in the documentation. EXTRACT_STATIC = YES # If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs) # defined locally in source files will be included in the documentation. # If set to NO only classes defined in header files are included. EXTRACT_LOCAL_CLASSES = YES # This flag is only useful for Objective-C code. When set to YES local # methods, which are defined in the implementation section but not in # the interface are included in the documentation. # If set to NO (the default) only methods in the interface are included. EXTRACT_LOCAL_METHODS = NO # If this flag is set to YES, the members of anonymous namespaces will be # extracted and appear in the documentation as a namespace called # 'anonymous_namespace{file}', where file will be replaced with the base # name of the file that contains the anonymous namespace. By default # anonymous namespaces are hidden. EXTRACT_ANON_NSPACES = NO # If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all # undocumented members of documented classes, files or namespaces. # If set to NO (the default) these members will be included in the # various overviews, but no documentation section is generated. # This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_MEMBERS = NO # If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all # undocumented classes that are normally visible in the class hierarchy. # If set to NO (the default) these classes will be included in the various # overviews. This option has no effect if EXTRACT_ALL is enabled. HIDE_UNDOC_CLASSES = NO # If the HIDE_FRIEND_COMPOUNDS tag is set to YES, Doxygen will hide all # friend (class|struct|union) declarations. # If set to NO (the default) these declarations will be included in the # documentation. HIDE_FRIEND_COMPOUNDS = NO # If the HIDE_IN_BODY_DOCS tag is set to YES, Doxygen will hide any # documentation blocks found inside the body of a function. # If set to NO (the default) these blocks will be appended to the # function's detailed documentation block. HIDE_IN_BODY_DOCS = NO # The INTERNAL_DOCS tag determines if documentation # that is typed after a \internal command is included. If the tag is set # to NO (the default) then the documentation will be excluded. # Set it to YES to include the internal documentation. INTERNAL_DOCS = NO # If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate # file names in lower-case letters. If set to YES upper-case letters are also # allowed. This is useful if you have classes or files whose names only differ # in case and if your file system supports case sensitive file names. Windows # and Mac users are advised to set this option to NO. CASE_SENSE_NAMES = YES # If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen # will show members with their full class and namespace scopes in the # documentation. If set to YES the scope will be hidden. HIDE_SCOPE_NAMES = NO # If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen # will put a list of the files that are included by a file in the documentation # of that file. SHOW_INCLUDE_FILES = YES # If the FORCE_LOCAL_INCLUDES tag is set to YES then Doxygen # will list include files with double quotes in the documentation # rather than with sharp brackets. FORCE_LOCAL_INCLUDES = NO # If the INLINE_INFO tag is set to YES (the default) then a tag [inline] # is inserted in the documentation for inline members. INLINE_INFO = YES # If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen # will sort the (detailed) documentation of file and class members # alphabetically by member name. If set to NO the members will appear in # declaration order. SORT_MEMBER_DOCS = YES # If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the # brief documentation of file, namespace and class members alphabetically # by member name. If set to NO (the default) the members will appear in # declaration order. SORT_BRIEF_DOCS = YES # If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen # will sort the (brief and detailed) documentation of class members so that # constructors and destructors are listed first. If set to NO (the default) # the constructors will appear in the respective orders defined by # SORT_MEMBER_DOCS and SORT_BRIEF_DOCS. # This tag will be ignored for brief docs if SORT_BRIEF_DOCS is set to NO # and ignored for detailed docs if SORT_MEMBER_DOCS is set to NO. SORT_MEMBERS_CTORS_1ST = NO # If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the # hierarchy of group names into alphabetical order. If set to NO (the default) # the group names will appear in their defined order. SORT_GROUP_NAMES = NO # If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be # sorted by fully-qualified names, including namespaces. If set to # NO (the default), the class list will be sorted only by class name, # not including the namespace part. # Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES. # Note: This option applies only to the class list, not to the # alphabetical list. SORT_BY_SCOPE_NAME = NO # If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to # do proper type resolution of all parameters of a function it will reject a # match between the prototype and the implementation of a member function even # if there is only one candidate or it is obvious which candidate to choose # by doing a simple string match. By disabling STRICT_PROTO_MATCHING doxygen # will still accept a match between prototype and implementation in such cases. STRICT_PROTO_MATCHING = NO # The GENERATE_TODOLIST tag can be used to enable (YES) or # disable (NO) the todo list. This list is created by putting \todo # commands in the documentation. GENERATE_TODOLIST = NO # The GENERATE_TESTLIST tag can be used to enable (YES) or # disable (NO) the test list. This list is created by putting \test # commands in the documentation. GENERATE_TESTLIST = NO # The GENERATE_BUGLIST tag can be used to enable (YES) or # disable (NO) the bug list. This list is created by putting \bug # commands in the documentation. GENERATE_BUGLIST = NO # The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or # disable (NO) the deprecated list. This list is created by putting # \deprecated commands in the documentation. GENERATE_DEPRECATEDLIST= NO # The ENABLED_SECTIONS tag can be used to enable conditional # documentation sections, marked by \if sectionname ... \endif. ENABLED_SECTIONS = # The MAX_INITIALIZER_LINES tag determines the maximum number of lines # the initial value of a variable or macro consists of for it to appear in # the documentation. If the initializer consists of more lines than specified # here it will be hidden. Use a value of 0 to hide initializers completely. # The appearance of the initializer of individual variables and macros in the # documentation can be controlled using \showinitializer or \hideinitializer # command in the documentation regardless of this setting. MAX_INITIALIZER_LINES = 30 # Set the SHOW_USED_FILES tag to NO to disable the list of files generated # at the bottom of the documentation of classes and structs. If set to YES the # list will mention the files that were used to generate the documentation. SHOW_USED_FILES = NO # Set the SHOW_FILES tag to NO to disable the generation of the Files page. # This will remove the Files entry from the Quick Index and from the # Folder Tree View (if specified). The default is YES. SHOW_FILES = YES # Set the SHOW_NAMESPACES tag to NO to disable the generation of the # Namespaces page. # This will remove the Namespaces entry from the Quick Index # and from the Folder Tree View (if specified). The default is YES. SHOW_NAMESPACES = YES # The FILE_VERSION_FILTER tag can be used to specify a program or script that # doxygen should invoke to get the current version for each file (typically from # the version control system). Doxygen will invoke the program by executing (via # popen()) the command , where is the value of # the FILE_VERSION_FILTER tag, and is the name of an input file # provided by doxygen. Whatever the program writes to standard output # is used as the file version. See the manual for examples. FILE_VERSION_FILTER = # The LAYOUT_FILE tag can be used to specify a layout file which will be parsed # by doxygen. The layout file controls the global structure of the generated # output files in an output format independent way. To create the layout file # that represents doxygen's defaults, run doxygen with the -l option. # You can optionally specify a file name after the option, if omitted # DoxygenLayout.xml will be used as the name of the layout file. LAYOUT_FILE = # The CITE_BIB_FILES tag can be used to specify one or more bib files # containing the references data. This must be a list of .bib files. The # .bib extension is automatically appended if omitted. Using this command # requires the bibtex tool to be installed. See also # http://en.wikipedia.org/wiki/BibTeX for more info. For LaTeX the style # of the bibliography can be controlled using LATEX_BIB_STYLE. To use this # feature you need bibtex and perl available in the search path. CITE_BIB_FILES = #--------------------------------------------------------------------------- # configuration options related to warning and progress messages #--------------------------------------------------------------------------- # The QUIET tag can be used to turn on/off the messages that are generated # by doxygen. Possible values are YES and NO. If left blank NO is used. QUIET = NO # The WARNINGS tag can be used to turn on/off the warning messages that are # generated by doxygen. Possible values are YES and NO. If left blank # NO is used. WARNINGS = YES # If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings # for undocumented members. If EXTRACT_ALL is set to YES then this flag will # automatically be disabled. WARN_IF_UNDOCUMENTED = YES # If WARN_IF_DOC_ERROR is set to YES, doxygen will generate warnings for # potential errors in the documentation, such as not documenting some # parameters in a documented function, or documenting parameters that # don't exist or using markup commands wrongly. WARN_IF_DOC_ERROR = YES # The WARN_NO_PARAMDOC option can be enabled to get warnings for # functions that are documented, but have no documentation for their parameters # or return value. If set to NO (the default) doxygen will only warn about # wrong or incomplete parameter documentation, but not about the absence of # documentation. WARN_NO_PARAMDOC = NO # The WARN_FORMAT tag determines the format of the warning messages that # doxygen can produce. The string should contain the $file, $line, and $text # tags, which will be replaced by the file and line number from which the # warning originated and the warning text. Optionally the format may contain # $version, which will be replaced by the version of the file (if it could # be obtained via FILE_VERSION_FILTER) WARN_FORMAT = "$file:$line: $text " # The WARN_LOGFILE tag can be used to specify a file to which warning # and error messages should be written. If left blank the output is written # to stderr. WARN_LOGFILE = #--------------------------------------------------------------------------- # configuration options related to the input files #--------------------------------------------------------------------------- # The INPUT tag can be used to specify the files and/or directories that contain # documented source files. You may enter file names like "myfile.cpp" or # directories like "/usr/src/myproject". Separate the files or directories # with spaces. INPUT = src/base \ src/support \ src/planning \ src/parser \ doc \ src/parser/dpomdp.spirit \ src/parser/pomdp.spirit \ problems/example.dpomdp \ problems/dectiger.dpomdp # This tag can be used to specify the character encoding of the source files # that doxygen parses. Internally doxygen uses the UTF-8 encoding, which is # also the default input encoding. Doxygen uses libiconv (or the iconv built # into libc) for the transcoding. See http://www.gnu.org/software/libiconv for # the list of possible encodings. INPUT_ENCODING = UTF-8 # If the value of the INPUT tag contains directories, you can use the # FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank the following patterns are tested: # *.c *.cc *.cxx *.cpp *.c++ *.d *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh # *.hxx *.hpp *.h++ *.idl *.odl *.cs *.php *.php3 *.inc *.m *.mm *.dox *.py # *.f90 *.f *.for *.vhd *.vhdl FILE_PATTERNS = *.cpp \ *.h # The RECURSIVE tag can be used to turn specify whether or not subdirectories # should be searched for input files as well. Possible values are YES and NO. # If left blank NO is used. RECURSIVE = NO # The EXCLUDE tag can be used to specify files and/or directories that should be # excluded from the INPUT source files. This way you can easily exclude a # subdirectory from a directory tree whose root is specified with the INPUT tag. # Note that relative paths are relative to the directory from which doxygen is # run. EXCLUDE = # The EXCLUDE_SYMLINKS tag can be used to select whether or not files or # directories that are symbolic links (a Unix file system feature) are excluded # from the input. EXCLUDE_SYMLINKS = YES # If the value of the INPUT tag contains directories, you can use the # EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude # certain files from those directories. Note that the wildcards are matched # against the file with absolute path, so to exclude all test directories # for example use the pattern */test/* EXCLUDE_PATTERNS = *ParserDecPOMDPDiscrete* \ *CommentOrBlankParser* \ *sub_grammar* # The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names # (namespaces, classes, functions, etc.) that should be excluded from the # output. The symbol name can be a fully qualified name, a word, or if the # wildcard * is used, a substring. Examples: ANamespace, AClass, # AClass::ANamespace, ANamespace::*Test EXCLUDE_SYMBOLS = # The EXAMPLE_PATH tag can be used to specify one or more files or # directories that contain example code fragments that are included (see # the \include command). EXAMPLE_PATH = . # If the value of the EXAMPLE_PATH tag contains directories, you can use the # EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp # and *.h) to filter out the source-files in the directories. If left # blank all files are included. EXAMPLE_PATTERNS = # If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be # searched for input files to be used with the \include or \dontinclude # commands irrespective of the value of the RECURSIVE tag. # Possible values are YES and NO. If left blank NO is used. EXAMPLE_RECURSIVE = NO # The IMAGE_PATH tag can be used to specify one or more files or # directories that contain image that are included in the documentation (see # the \image command). IMAGE_PATH = # The INPUT_FILTER tag can be used to specify a program that doxygen should # invoke to filter for each input file. Doxygen will invoke the filter program # by executing (via popen()) the command , where # is the value of the INPUT_FILTER tag, and is the name of an # input file. Doxygen will then use the output that the filter program writes # to standard output. # If FILTER_PATTERNS is specified, this tag will be # ignored. INPUT_FILTER = # The FILTER_PATTERNS tag can be used to specify filters on a per file pattern # basis. # Doxygen will compare the file name with each pattern and apply the # filter if there is a match. # The filters are a list of the form: # pattern=filter (like *.cpp=my_cpp_filter). See INPUT_FILTER for further # info on how filters are used. If FILTER_PATTERNS is empty or if # non of the patterns match the file name, INPUT_FILTER is applied. FILTER_PATTERNS = # If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using # INPUT_FILTER) will be used to filter the input files when producing source # files to browse (i.e. when SOURCE_BROWSER is set to YES). FILTER_SOURCE_FILES = NO # The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file # pattern. A pattern will override the setting for FILTER_PATTERN (if any) # and it is also possible to disable source filtering for a specific pattern # using *.ext= (so without naming a filter). This option only has effect when # FILTER_SOURCE_FILES is enabled. FILTER_SOURCE_PATTERNS = #--------------------------------------------------------------------------- # configuration options related to source browsing #--------------------------------------------------------------------------- # If the SOURCE_BROWSER tag is set to YES then a list of source files will # be generated. Documented entities will be cross-referenced with these sources. # Note: To get rid of all source code in the generated output, make sure also # VERBATIM_HEADERS is set to NO. SOURCE_BROWSER = NO # Setting the INLINE_SOURCES tag to YES will include the body # of functions and classes directly in the documentation. INLINE_SOURCES = NO # Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct # doxygen to hide any special comment blocks from generated source code # fragments. Normal C, C++ and Fortran comments will always remain visible. STRIP_CODE_COMMENTS = YES # If the REFERENCED_BY_RELATION tag is set to YES # then for each documented function all documented # functions referencing it will be listed. REFERENCED_BY_RELATION = YES # If the REFERENCES_RELATION tag is set to YES # then for each documented function all documented entities # called/used by that function will be listed. REFERENCES_RELATION = YES # If the REFERENCES_LINK_SOURCE tag is set to YES (the default) # and SOURCE_BROWSER tag is set to YES, then the hyperlinks from # functions in REFERENCES_RELATION and REFERENCED_BY_RELATION lists will # link to the source code. # Otherwise they will link to the documentation. REFERENCES_LINK_SOURCE = YES # If the USE_HTAGS tag is set to YES then the references to source code # will point to the HTML generated by the htags(1) tool instead of doxygen # built-in source browser. The htags tool is part of GNU's global source # tagging system (see http://www.gnu.org/software/global/global.html). You # will need version 4.8.6 or higher. USE_HTAGS = NO # If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen # will generate a verbatim copy of the header file for each class for # which an include is specified. Set to NO to disable this. VERBATIM_HEADERS = NO #--------------------------------------------------------------------------- # configuration options related to the alphabetical class index #--------------------------------------------------------------------------- # If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index # of all compounds will be generated. Enable this if the project # contains a lot of classes, structs, unions or interfaces. ALPHABETICAL_INDEX = YES # If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then # the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns # in which this list will be split (can be a number in the range [1..20]) COLS_IN_ALPHA_INDEX = 5 # In case all classes in a project start with a common prefix, all # classes will be put under the same header in the alphabetical index. # The IGNORE_PREFIX tag can be used to specify one or more prefixes that # should be ignored while generating the index headers. IGNORE_PREFIX = #--------------------------------------------------------------------------- # configuration options related to the HTML output #--------------------------------------------------------------------------- # If the GENERATE_HTML tag is set to YES (the default) Doxygen will # generate HTML output. GENERATE_HTML = YES # The HTML_OUTPUT tag is used to specify where the HTML docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `html' will be used as the default path. HTML_OUTPUT = html # The HTML_FILE_EXTENSION tag can be used to specify the file extension for # each generated HTML page (for example: .htm,.php,.asp). If it is left blank # doxygen will generate files with .html extension. HTML_FILE_EXTENSION = .html # The HTML_HEADER tag can be used to specify a personal HTML header for # each generated HTML page. If it is left blank doxygen will generate a # standard header. Note that when using a custom header you are responsible # for the proper inclusion of any scripts and style sheets that doxygen # needs, which is dependent on the configuration options used. # It is advised to generate a default header using "doxygen -w html # header.html footer.html stylesheet.css YourConfigFile" and then modify # that header. Note that the header is subject to change so you typically # have to redo this when upgrading to a newer version of doxygen or when # changing the value of configuration settings such as GENERATE_TREEVIEW! HTML_HEADER = # The HTML_FOOTER tag can be used to specify a personal HTML footer for # each generated HTML page. If it is left blank doxygen will generate a # standard footer. HTML_FOOTER = # The HTML_STYLESHEET tag can be used to specify a user-defined cascading # style sheet that is used by each HTML page. It can be used to # fine-tune the look of the HTML output. If the tag is left blank doxygen # will generate a default style sheet. Note that doxygen will try to copy # the style sheet file to the HTML output directory, so don't put your own # style sheet in the HTML output directory as well, or it will be erased! HTML_STYLESHEET = # The HTML_EXTRA_FILES tag can be used to specify one or more extra images or # other source files which should be copied to the HTML output directory. Note # that these files will be copied to the base HTML output directory. Use the # $relpath$ marker in the HTML_HEADER and/or HTML_FOOTER files to load these # files. In the HTML_STYLESHEET file, use the file name only. Also note that # the files will be copied as-is; there are no commands or markers available. HTML_EXTRA_FILES = # The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. # Doxygen will adjust the colors in the style sheet and background images # according to this color. Hue is specified as an angle on a colorwheel, # see http://en.wikipedia.org/wiki/Hue for more information. # For instance the value 0 represents red, 60 is yellow, 120 is green, # 180 is cyan, 240 is blue, 300 purple, and 360 is red again. # The allowed range is 0 to 359. HTML_COLORSTYLE_HUE = 220 # The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of # the colors in the HTML output. For a value of 0 the output will use # grayscales only. A value of 255 will produce the most vivid colors. HTML_COLORSTYLE_SAT = 100 # The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to # the luminance component of the colors in the HTML output. Values below # 100 gradually make the output lighter, whereas values above 100 make # the output darker. The value divided by 100 is the actual gamma applied, # so 80 represents a gamma of 0.8, The value 220 represents a gamma of 2.2, # and 100 does not change the gamma. HTML_COLORSTYLE_GAMMA = 80 # If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML # page will contain the date and time when the page was generated. Setting # this to NO can help when comparing the output of multiple runs. HTML_TIMESTAMP = YES # If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML # documentation will contain sections that can be hidden and shown after the # page has loaded. HTML_DYNAMIC_SECTIONS = NO # With HTML_INDEX_NUM_ENTRIES one can control the preferred number of # entries shown in the various tree structured indices initially; the user # can expand and collapse entries dynamically later on. Doxygen will expand # the tree to such a level that at most the specified number of entries are # visible (unless a fully collapsed tree already exceeds this amount). # So setting the number of entries 1 will produce a full collapsed tree by # default. 0 is a special value representing an infinite number of entries # and will result in a full expanded tree by default. HTML_INDEX_NUM_ENTRIES = 100 # If the GENERATE_DOCSET tag is set to YES, additional index files # will be generated that can be used as input for Apple's Xcode 3 # integrated development environment, introduced with OSX 10.5 (Leopard). # To create a documentation set, doxygen will generate a Makefile in the # HTML output directory. Running make will produce the docset in that # directory and running "make install" will install the docset in # ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find # it at startup. # See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html # for more information. GENERATE_DOCSET = NO # When GENERATE_DOCSET tag is set to YES, this tag determines the name of the # feed. A documentation feed provides an umbrella under which multiple # documentation sets from a single provider (such as a company or product suite) # can be grouped. DOCSET_FEEDNAME = "Doxygen generated docs" # When GENERATE_DOCSET tag is set to YES, this tag specifies a string that # should uniquely identify the documentation set bundle. This should be a # reverse domain-name style string, e.g. com.mycompany.MyDocSet. Doxygen # will append .docset to the name. DOCSET_BUNDLE_ID = org.doxygen.Project # When GENERATE_PUBLISHER_ID tag specifies a string that should uniquely identify # the documentation publisher. This should be a reverse domain-name style # string, e.g. com.mycompany.MyDocSet.documentation. DOCSET_PUBLISHER_ID = org.doxygen.Publisher # The GENERATE_PUBLISHER_NAME tag identifies the documentation publisher. DOCSET_PUBLISHER_NAME = Publisher # If the GENERATE_HTMLHELP tag is set to YES, additional index files # will be generated that can be used as input for tools like the # Microsoft HTML help workshop to generate a compiled HTML help file (.chm) # of the generated HTML documentation. GENERATE_HTMLHELP = NO # If the GENERATE_HTMLHELP tag is set to YES, the CHM_FILE tag can # be used to specify the file name of the resulting .chm file. You # can add a path in front of the file if the result should not be # written to the html output directory. CHM_FILE = # If the GENERATE_HTMLHELP tag is set to YES, the HHC_LOCATION tag can # be used to specify the location (absolute path including file name) of # the HTML help compiler (hhc.exe). If non-empty doxygen will try to run # the HTML help compiler on the generated index.hhp. HHC_LOCATION = # If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag # controls if a separate .chi index file is generated (YES) or that # it should be included in the master .chm file (NO). GENERATE_CHI = NO # If the GENERATE_HTMLHELP tag is set to YES, the CHM_INDEX_ENCODING # is used to encode HtmlHelp index (hhk), content (hhc) and project file # content. CHM_INDEX_ENCODING = # If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag # controls whether a binary table of contents is generated (YES) or a # normal table of contents (NO) in the .chm file. BINARY_TOC = NO # The TOC_EXPAND flag can be set to YES to add extra items for group members # to the contents of the HTML help documentation and to the tree view. TOC_EXPAND = NO # If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and # QHP_VIRTUAL_FOLDER are set, an additional index file will be generated # that can be used as input for Qt's qhelpgenerator to generate a # Qt Compressed Help (.qch) of the generated HTML documentation. GENERATE_QHP = NO # If the QHG_LOCATION tag is specified, the QCH_FILE tag can # be used to specify the file name of the resulting .qch file. # The path specified is relative to the HTML output folder. QCH_FILE = # The QHP_NAMESPACE tag specifies the namespace to use when generating # Qt Help Project output. For more information please see # http://doc.trolltech.com/qthelpproject.html#namespace QHP_NAMESPACE = org.doxygen.Project # The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating # Qt Help Project output. For more information please see # http://doc.trolltech.com/qthelpproject.html#virtual-folders QHP_VIRTUAL_FOLDER = doc # If QHP_CUST_FILTER_NAME is set, it specifies the name of a custom filter to # add. For more information please see # http://doc.trolltech.com/qthelpproject.html#custom-filters QHP_CUST_FILTER_NAME = # The QHP_CUST_FILT_ATTRS tag specifies the list of the attributes of the # custom filter to add. For more information please see # # Qt Help Project / Custom Filters. QHP_CUST_FILTER_ATTRS = # The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this # project's # filter section matches. # # Qt Help Project / Filter Attributes. QHP_SECT_FILTER_ATTRS = # If the GENERATE_QHP tag is set to YES, the QHG_LOCATION tag can # be used to specify the location of Qt's qhelpgenerator. # If non-empty doxygen will try to run qhelpgenerator on the generated # .qhp file. QHG_LOCATION = # If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files # will be generated, which together with the HTML files, form an Eclipse help # plugin. To install this plugin and make it available under the help contents # menu in Eclipse, the contents of the directory containing the HTML and XML # files needs to be copied into the plugins directory of eclipse. The name of # the directory within the plugins directory should be the same as # the ECLIPSE_DOC_ID value. After copying Eclipse needs to be restarted before # the help appears. GENERATE_ECLIPSEHELP = NO # A unique identifier for the eclipse help plugin. When installing the plugin # the directory name containing the HTML and XML files should also have # this name. ECLIPSE_DOC_ID = org.doxygen.Project # The DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) # at top of each HTML page. The value NO (the default) enables the index and # the value YES disables it. Since the tabs have the same information as the # navigation tree you can set this option to NO if you already set # GENERATE_TREEVIEW to YES. DISABLE_INDEX = NO # The GENERATE_TREEVIEW tag is used to specify whether a tree-like index # structure should be generated to display hierarchical information. # If the tag value is set to YES, a side panel will be generated # containing a tree-like index structure (just like the one that # is generated for HTML Help). For this to work a browser that supports # JavaScript, DHTML, CSS and frames is required (i.e. any modern browser). # Windows users are probably better off using the HTML help feature. # Since the tree basically has the same information as the tab index you # could consider to set DISABLE_INDEX to NO when enabling this option. GENERATE_TREEVIEW = YES # The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values # (range [0,1..20]) that doxygen will group on one line in the generated HTML # documentation. Note that a value of 0 will completely suppress the enum # values from appearing in the overview section. ENUM_VALUES_PER_LINE = 4 # If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be # used to set the initial width (in pixels) of the frame in which the tree # is shown. TREEVIEW_WIDTH = 250 # When the EXT_LINKS_IN_WINDOW option is set to YES doxygen will open # links to external symbols imported via tag files in a separate window. EXT_LINKS_IN_WINDOW = NO # Use this tag to change the font size of Latex formulas included # as images in the HTML documentation. The default is 10. Note that # when you change the font size after a successful doxygen run you need # to manually remove any form_*.png images from the HTML output directory # to force them to be regenerated. FORMULA_FONTSIZE = 10 # Use the FORMULA_TRANPARENT tag to determine whether or not the images # generated for formulas are transparent PNGs. Transparent PNGs are # not supported properly for IE 6.0, but are supported on all modern browsers. # Note that when changing this option you need to delete any form_*.png files # in the HTML output before the changes have effect. FORMULA_TRANSPARENT = YES # Enable the USE_MATHJAX option to render LaTeX formulas using MathJax # (see http://www.mathjax.org) which uses client side Javascript for the # rendering instead of using prerendered bitmaps. Use this if you do not # have LaTeX installed or if you want to formulas look prettier in the HTML # output. When enabled you may also need to install MathJax separately and # configure the path to it using the MATHJAX_RELPATH option. USE_MATHJAX = NO # When MathJax is enabled you need to specify the location relative to the # HTML output directory using the MATHJAX_RELPATH option. The destination # directory should contain the MathJax.js script. For instance, if the mathjax # directory is located at the same level as the HTML output directory, then # MATHJAX_RELPATH should be ../mathjax. The default value points to # the MathJax Content Delivery Network so you can quickly see the result without # installing MathJax. # However, it is strongly recommended to install a local # copy of MathJax from http://www.mathjax.org before deployment. MATHJAX_RELPATH = http://cdn.mathjax.org/mathjax/latest # The MATHJAX_EXTENSIONS tag can be used to specify one or MathJax extension # names that should be enabled during MathJax rendering. MATHJAX_EXTENSIONS = # When the SEARCHENGINE tag is enabled doxygen will generate a search box # for the HTML output. The underlying search engine uses javascript # and DHTML and should work on any modern browser. Note that when using # HTML help (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets # (GENERATE_DOCSET) there is already a search function so this one should # typically be disabled. For large projects the javascript based search engine # can be slow, then enabling SERVER_BASED_SEARCH may provide a better solution. SEARCHENGINE = NO # When the SERVER_BASED_SEARCH tag is enabled the search engine will be # implemented using a PHP enabled web server instead of at the web client # using Javascript. Doxygen will generate the search PHP script and index # file to put on the web server. The advantage of the server # based approach is that it scales better to large projects and allows # full text search. The disadvantages are that it is more difficult to setup # and does not have live searching capabilities. SERVER_BASED_SEARCH = NO #--------------------------------------------------------------------------- # configuration options related to the LaTeX output #--------------------------------------------------------------------------- # If the GENERATE_LATEX tag is set to YES (the default) Doxygen will # generate Latex output. GENERATE_LATEX = NO # The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `latex' will be used as the default path. LATEX_OUTPUT = latex # The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be # invoked. If left blank `latex' will be used as the default command name. # Note that when enabling USE_PDFLATEX this option is only used for # generating bitmaps for formulas in the HTML output, but not in the # Makefile that is written to the output directory. LATEX_CMD_NAME = latex # The MAKEINDEX_CMD_NAME tag can be used to specify the command name to # generate index for LaTeX. If left blank `makeindex' will be used as the # default command name. MAKEINDEX_CMD_NAME = makeindex # If the COMPACT_LATEX tag is set to YES Doxygen generates more compact # LaTeX documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_LATEX = NO # The PAPER_TYPE tag can be used to set the paper type that is used # by the printer. Possible values are: a4, letter, legal and # executive. If left blank a4wide will be used. PAPER_TYPE = a4wide # The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX # packages that should be included in the LaTeX output. EXTRA_PACKAGES = # The LATEX_HEADER tag can be used to specify a personal LaTeX header for # the generated latex document. The header should contain everything until # the first chapter. If it is left blank doxygen will generate a # standard header. Notice: only use this tag if you know what you are doing! LATEX_HEADER = # The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for # the generated latex document. The footer should contain everything after # the last chapter. If it is left blank doxygen will generate a # standard footer. Notice: only use this tag if you know what you are doing! LATEX_FOOTER = # If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated # is prepared for conversion to pdf (using ps2pdf). The pdf file will # contain links (just like the HTML output) instead of page references # This makes the output suitable for online browsing using a pdf viewer. PDF_HYPERLINKS = NO # If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of # plain latex in the generated Makefile. Set this option to YES to get a # higher quality PDF documentation. USE_PDFLATEX = NO # If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode. # command to the generated LaTeX files. This will instruct LaTeX to keep # running if errors occur, instead of asking the user for help. # This option is also used when generating formulas in HTML. LATEX_BATCHMODE = NO # If LATEX_HIDE_INDICES is set to YES then doxygen will not # include the index chapters (such as File Index, Compound Index, etc.) # in the output. LATEX_HIDE_INDICES = NO # If LATEX_SOURCE_CODE is set to YES then doxygen will include # source code with syntax highlighting in the LaTeX output. # Note that which sources are shown also depends on other settings # such as SOURCE_BROWSER. LATEX_SOURCE_CODE = NO # The LATEX_BIB_STYLE tag can be used to specify the style to use for the # bibliography, e.g. plainnat, or ieeetr. The default style is "plain". See # http://en.wikipedia.org/wiki/BibTeX for more info. LATEX_BIB_STYLE = plain #--------------------------------------------------------------------------- # configuration options related to the RTF output #--------------------------------------------------------------------------- # If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output # The RTF output is optimized for Word 97 and may not look very pretty with # other RTF readers or editors. GENERATE_RTF = NO # The RTF_OUTPUT tag is used to specify where the RTF docs will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `rtf' will be used as the default path. RTF_OUTPUT = rtf # If the COMPACT_RTF tag is set to YES Doxygen generates more compact # RTF documents. This may be useful for small projects and may help to # save some trees in general. COMPACT_RTF = NO # If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated # will contain hyperlink fields. The RTF file will # contain links (just like the HTML output) instead of page references. # This makes the output suitable for online browsing using WORD or other # programs which support those fields. # Note: wordpad (write) and others do not support links. RTF_HYPERLINKS = NO # Load style sheet definitions from file. Syntax is similar to doxygen's # config file, i.e. a series of assignments. You only have to provide # replacements, missing definitions are set to their default value. RTF_STYLESHEET_FILE = # Set optional variables used in the generation of an rtf document. # Syntax is similar to doxygen's config file. RTF_EXTENSIONS_FILE = #--------------------------------------------------------------------------- # configuration options related to the man page output #--------------------------------------------------------------------------- # If the GENERATE_MAN tag is set to YES (the default) Doxygen will # generate man pages GENERATE_MAN = NO # The MAN_OUTPUT tag is used to specify where the man pages will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `man' will be used as the default path. MAN_OUTPUT = man # The MAN_EXTENSION tag determines the extension that is added to # the generated man pages (default is the subroutine's section .3) MAN_EXTENSION = .3 # If the MAN_LINKS tag is set to YES and Doxygen generates man output, # then it will generate one additional man file for each entity # documented in the real man page(s). These additional files # only source the real man page, but without them the man command # would be unable to find the correct page. The default is NO. MAN_LINKS = NO #--------------------------------------------------------------------------- # configuration options related to the XML output #--------------------------------------------------------------------------- # If the GENERATE_XML tag is set to YES Doxygen will # generate an XML file that captures the structure of # the code including all documentation. GENERATE_XML = NO # The XML_OUTPUT tag is used to specify where the XML pages will be put. # If a relative path is entered the value of OUTPUT_DIRECTORY will be # put in front of it. If left blank `xml' will be used as the default path. XML_OUTPUT = xml # If the XML_PROGRAMLISTING tag is set to YES Doxygen will # dump the program listings (including syntax highlighting # and cross-referencing information) to the XML output. Note that # enabling this will significantly increase the size of the XML output. XML_PROGRAMLISTING = YES #--------------------------------------------------------------------------- # configuration options for the AutoGen Definitions output #--------------------------------------------------------------------------- # If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will # generate an AutoGen Definitions (see autogen.sf.net) file # that captures the structure of the code including all # documentation. Note that this feature is still experimental # and incomplete at the moment. GENERATE_AUTOGEN_DEF = NO #--------------------------------------------------------------------------- # configuration options related to the Perl module output #--------------------------------------------------------------------------- # If the GENERATE_PERLMOD tag is set to YES Doxygen will # generate a Perl module file that captures the structure of # the code including all documentation. Note that this # feature is still experimental and incomplete at the # moment. GENERATE_PERLMOD = NO # If the PERLMOD_LATEX tag is set to YES Doxygen will generate # the necessary Makefile rules, Perl scripts and LaTeX code to be able # to generate PDF and DVI output from the Perl module output. PERLMOD_LATEX = NO # If the PERLMOD_PRETTY tag is set to YES the Perl module output will be # nicely formatted so it can be parsed by a human reader. # This is useful # if you want to understand what is going on. # On the other hand, if this # tag is set to NO the size of the Perl module output will be much smaller # and Perl will parse it just the same. PERLMOD_PRETTY = YES # The names of the make variables in the generated doxyrules.make file # are prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. # This is useful so different doxyrules.make files included by the same # Makefile don't overwrite each other's variables. PERLMOD_MAKEVAR_PREFIX = #--------------------------------------------------------------------------- # Configuration options related to the preprocessor #--------------------------------------------------------------------------- # If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will # evaluate all C-preprocessor directives found in the sources and include # files. ENABLE_PREPROCESSING = YES # If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro # names in the source code. If set to NO (the default) only conditional # compilation will be performed. Macro expansion can be done in a controlled # way by setting EXPAND_ONLY_PREDEF to YES. MACRO_EXPANSION = NO # If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES # then the macro expansion is limited to the macros specified with the # PREDEFINED and EXPAND_AS_DEFINED tags. EXPAND_ONLY_PREDEF = NO # If the SEARCH_INCLUDES tag is set to YES (the default) the includes files # pointed to by INCLUDE_PATH will be searched when a #include is found. SEARCH_INCLUDES = NO # The INCLUDE_PATH tag can be used to specify one or more directories that # contain include files that are not input files but should be processed by # the preprocessor. INCLUDE_PATH = # You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard # patterns (like *.h and *.hpp) to filter out the header-files in the # directories. If left blank, the patterns specified with FILE_PATTERNS will # be used. INCLUDE_FILE_PATTERNS = # The PREDEFINED tag can be used to specify one or more macro names that # are defined before the preprocessor is started (similar to the -D option of # gcc). The argument of the tag is a list of macros of the form: name # or name=definition (no spaces). If the definition and the = are # omitted =1 is assumed. To prevent a macro definition from being # undefined via #undef or recursively expanded use the := operator # instead of the = operator. PREDEFINED = # If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then # this tag can be used to specify a list of macro names that should be expanded. # The macro definition that is found in the sources will be used. # Use the PREDEFINED tag if you want to use a different macro definition that # overrules the definition found in the source code. EXPAND_AS_DEFINED = # If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then # doxygen's preprocessor will remove all references to function-like macros # that are alone on a line, have an all uppercase name, and do not end with a # semicolon, because these will confuse the parser if not removed. SKIP_FUNCTION_MACROS = YES #--------------------------------------------------------------------------- # Configuration::additions related to external references #--------------------------------------------------------------------------- # The TAGFILES option can be used to specify one or more tagfiles. For each # tag file the location of the external documentation should be added. The # format of a tag file without this location is as follows: # # TAGFILES = file1 file2 ... # Adding location for the tag files is done as follows: # # TAGFILES = file1=loc1 "file2 = loc2" ... # where "loc1" and "loc2" can be relative or absolute paths # or URLs. Note that each tag file must have a unique name (where the name does # NOT include the path). If a tag file is not located in the directory in which # doxygen is run, you must also specify the path to the tagfile here. TAGFILES = # When a file name is specified after GENERATE_TAGFILE, doxygen will create # a tag file that is based on the input files it reads. GENERATE_TAGFILE = # If the ALLEXTERNALS tag is set to YES all external classes will be listed # in the class index. If set to NO only the inherited external classes # will be listed. ALLEXTERNALS = NO # If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed # in the modules index. If set to NO, only the current project's groups will # be listed. EXTERNAL_GROUPS = YES # The PERL_PATH should be the absolute path and name of the perl script # interpreter (i.e. the result of `which perl'). PERL_PATH = /usr/bin/perl #--------------------------------------------------------------------------- # Configuration options related to the dot tool #--------------------------------------------------------------------------- # If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will # generate a inheritance diagram (in HTML, RTF and LaTeX) for classes with base # or super classes. Setting the tag to NO turns the diagrams off. Note that # this option also works with HAVE_DOT disabled, but it is recommended to # install and use dot, since it yields more powerful graphs. CLASS_DIAGRAMS = YES # You can define message sequence charts within doxygen comments using the \msc # command. Doxygen will then run the mscgen tool (see # http://www.mcternan.me.uk/mscgen/) to produce the chart and insert it in the # documentation. The MSCGEN_PATH tag allows you to specify the directory where # the mscgen tool resides. If left empty the tool is assumed to be found in the # default search path. MSCGEN_PATH = # If set to YES, the inheritance and collaboration graphs will hide # inheritance and usage relations if the target is undocumented # or is not a class. HIDE_UNDOC_RELATIONS = YES # If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is # available from the path. This tool is part of Graphviz, a graph visualization # toolkit from AT&T and Lucent Bell Labs. The other options in this section # have no effect if this option is set to NO (the default) HAVE_DOT = YES # The DOT_NUM_THREADS specifies the number of dot invocations doxygen is # allowed to run in parallel. When set to 0 (the default) doxygen will # base this on the number of processors available in the system. You can set it # explicitly to a value larger than 0 to get control over the balance # between CPU load and processing speed. DOT_NUM_THREADS = 0 # By default doxygen will use the Helvetica font for all dot files that # doxygen generates. When you want a differently looking font you can specify # the font name using DOT_FONTNAME. You need to make sure dot is able to find # the font, which can be done by putting it in a standard location or by setting # the DOTFONTPATH environment variable or by setting DOT_FONTPATH to the # directory containing the font. DOT_FONTNAME = Helvetica # The DOT_FONTSIZE tag can be used to set the size of the font of dot graphs. # The default size is 10pt. DOT_FONTSIZE = 10 # By default doxygen will tell dot to use the Helvetica font. # If you specify a different font using DOT_FONTNAME you can use DOT_FONTPATH to # set the path where dot can find it. DOT_FONTPATH = # If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect inheritance relations. Setting this tag to YES will force the # CLASS_DIAGRAMS tag to NO. CLASS_GRAPH = YES # If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen # will generate a graph for each documented class showing the direct and # indirect implementation dependencies (inheritance, containment, and # class references variables) of the class with other documented classes. COLLABORATION_GRAPH = NO # If the GROUP_GRAPHS and HAVE_DOT tags are set to YES then doxygen # will generate a graph for groups, showing the direct groups dependencies GROUP_GRAPHS = NO # If the UML_LOOK tag is set to YES doxygen will generate inheritance and # collaboration diagrams in a style similar to the OMG's Unified Modeling # Language. UML_LOOK = NO # If the UML_LOOK tag is enabled, the fields and methods are shown inside # the class node. If there are many fields or methods and many nodes the # graph may become too big to be useful. The UML_LIMIT_NUM_FIELDS # threshold limits the number of items for each type to make the size more # managable. Set this to 0 for no limit. Note that the threshold may be # exceeded by 50% before the limit is enforced. UML_LIMIT_NUM_FIELDS = 10 # If set to YES, the inheritance and collaboration graphs will show the # relations between templates and their instances. TEMPLATE_RELATIONS = YES # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT # tags are set to YES then doxygen will generate a graph for each documented # file showing the direct and indirect include dependencies of the file with # other documented files. INCLUDE_GRAPH = NO # If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and # HAVE_DOT tags are set to YES then doxygen will generate a graph for each # documented header file showing the documented files that directly or # indirectly include this file. INCLUDED_BY_GRAPH = NO # If the CALL_GRAPH and HAVE_DOT options are set to YES then # doxygen will generate a call dependency graph for every global function # or class method. Note that enabling this option will significantly increase # the time of a run. So in most cases it will be better to enable call graphs # for selected functions only using the \callgraph command. CALL_GRAPH = NO # If the CALLER_GRAPH and HAVE_DOT tags are set to YES then # doxygen will generate a caller dependency graph for every global function # or class method. Note that enabling this option will significantly increase # the time of a run. So in most cases it will be better to enable caller # graphs for selected functions only using the \callergraph command. CALLER_GRAPH = NO # If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen # will generate a graphical hierarchy of all classes instead of a textual one. GRAPHICAL_HIERARCHY = YES # If the DIRECTORY_GRAPH and HAVE_DOT tags are set to YES # then doxygen will show the dependencies a directory has on other directories # in a graphical way. The dependency relations are determined by the #include # relations between the files in the directories. DIRECTORY_GRAPH = NO # The DOT_IMAGE_FORMAT tag can be used to set the image format of the images # generated by dot. Possible values are svg, png, jpg, or gif. # If left blank png will be used. If you choose svg you need to set # HTML_FILE_EXTENSION to xhtml in order to make the SVG files # visible in IE 9+ (other browsers do not have this requirement). DOT_IMAGE_FORMAT = svg # If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to # enable generation of interactive SVG images that allow zooming and panning. # Note that this requires a modern browser other than Internet Explorer. # Tested and working are Firefox, Chrome, Safari, and Opera. For IE 9+ you # need to set HTML_FILE_EXTENSION to xhtml in order to make the SVG files # visible. Older versions of IE do not have SVG support. INTERACTIVE_SVG = NO # The tag DOT_PATH can be used to specify the path where the dot tool can be # found. If left blank, it is assumed the dot tool can be found in the path. DOT_PATH = # The DOTFILE_DIRS tag can be used to specify one or more directories that # contain dot files that are included in the documentation (see the # \dotfile command). DOTFILE_DIRS = # The MSCFILE_DIRS tag can be used to specify one or more directories that # contain msc files that are included in the documentation (see the # \mscfile command). MSCFILE_DIRS = # The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of # nodes that will be shown in the graph. If the number of nodes in a graph # becomes larger than this value, doxygen will truncate the graph, which is # visualized by representing a node as a red box. Note that doxygen if the # number of direct children of the root node in a graph is already larger than # DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note # that the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH. DOT_GRAPH_MAX_NODES = 50 # The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the # graphs generated by dot. A depth value of 3 means that only nodes reachable # from the root by following a path via at most 3 edges will be shown. Nodes # that lay further from the root node will be omitted. Note that setting this # option to 1 or 2 may greatly reduce the computation time needed for large # code bases. Also note that the size of a graph can be further restricted by # DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction. MAX_DOT_GRAPH_DEPTH = 0 # Set the DOT_TRANSPARENT tag to YES to generate images with a transparent # background. This is disabled by default, because dot on Windows does not # seem to support this out of the box. Warning: Depending on the platform used, # enabling this option may lead to badly anti-aliased labels on the edges of # a graph (i.e. they become hard to read). DOT_TRANSPARENT = NO # Set the DOT_MULTI_TARGETS tag to YES allow dot to generate multiple output # files in one run (i.e. multiple -o and -T options on the command line). This # makes dot run faster, but since only newer versions of dot (>1.8.10) # support this, this feature is disabled by default. DOT_MULTI_TARGETS = YES # If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will # generate a legend page explaining the meaning of the various boxes and # arrows in the dot generated graphs. GENERATE_LEGEND = YES # If the DOT_CLEANUP tag is set to YES (the default) Doxygen will # remove the intermediate dot files that are used to generate # the various graphs. DOT_CLEANUP = YES #--------------------------------------------------------------------------- # Configuration::additions related to the search engine #--------------------------------------------------------------------------- # The SEARCHENGINE tag specifies whether or not a search engine should be # used. If set to NO the values of all tags below this one will be ignored. SEARCHENGINE = NO #--------------------------------------------------------------------------- # Generate help files for Qt Creator #--------------------------------------------------------------------------- GENERATE_QHP = YES QCH_FILE = "./madp.qch" QHP_NAMESPACE = "madp" QHP_VIRTUAL_FOLDER = "doc" QHG_LOCATION = "/usr/bin/qhelpgenerator" madp-0.4/doc/PaxHeaders.5405/MainPage.h0000644000000000000000000000007412717644140014362 xustar0030 atime=1463765180.065720446 30 ctime=1463765201.029553013 madp-0.4/doc/MainPage.h0000664000372100037210000001372612717644140015222 0ustar00fransfrans00000000000000// This file contains the text of the first page of the // Doxygen-generated documentation. The file is called .h so doxygen // will process it. /** \mainpage MultiAgentDecisionProcess Reference Documentation \section intro Introduction %MultiAgentDecisionProcess (MADP) is a toolbox for scientific research in decision-theoretic planning and learning in multiagent systems. It is designed to be rather general, but most effort has been put in planning algorithms for discrete Dec-POMDPs. The PDF \c doc/MADPToolbox.pdf provides more general background about MADP models, and documents general design principles and details about indices and history representations. Authors: Frans Oliehoek, Matthijs Spaan, Philipp Robbel, João Messias \section libs MADP Libraries The framework consists of several parts, grouped in different libraries. The base library (libMADPBase) contains: \li A representation of the basic elements in a decision process such as states, (joint) actions and observations. See State, StateDiscrete, Action, ActionDiscrete, Observation, ObservationDiscrete, JointAction, JointActionDiscrete, JointObservation, JointObservationDiscrete, Agent. \li A representation of the transition, observation and reward models in a multiagent decision process. These models can also be stored in a sparse fashion. See TransitionModelMapping, TransitionModelMappingSparse, ObservationModelMapping, ObservationModelMappingSparse, RewardModelMapping. \li A uniform representation for MADP problems, which provides an interface to a problem's model parameters. See MultiAgentDecisionProcessInterface, MultiAgentDecisionProcessDiscreteInterface, DecPOMDPDiscreteInterface, POSGDiscreteInterface, TransitionObservationIndependentMADPDiscrete, TOIDecMDPDiscrete, TOIDecPOMDPDiscrete, TOIFactoredRewardDecPOMDPDiscrete, TOICompactRewardDecPOMDPDiscrete. \li Auxiliary functionality regarding manipulating indices, exception handling and printing: E, IndexTools, PrintTools. Some project-wide definitions are stored in the Globals namespace. The parser library (libMADPParser) only requires the base library, and contains: \li A parser for \c dpomdp problem specifications, which is a fileformat for discrete Dec-POMDPs. A set of benchmark problem files can be found in the \c problems/ directory, and the \c dpomdp syntax is documented in \link example.dpomdp \endlink. The format is based on Tony's POMDP file format, and the formal specification is found in dpomdp.spirit. The parser uses the Boost Spirit library. See MADPParser. \li Parsers ParserTOIDecMDPDiscrete, ParserTOIDecPOMDPDiscrete, ParserTOIFactoredRewardDecPOMDPDiscrete, and ParserTOICompactRewardDecPOMDPDiscrete, which are all derived from the .dpomdp parser. These can be accessed in a uniform way by using MADPParser. The support library (libMADPSupport) contains basic data types and support useful for planning: \li A representation for (joint) histories, for storing and manipulating observation, action and action-observation histories. See ActionHistory, ObservationHistory, ActionObservationHistory, JointActionHistory, JointObservationHistory, JointActionObservationHistory. \li A representation for (joint) beliefs, both stored as a full vector as well as a sparse one. See JointBeliefInterface, JointBelief, JointBeliefSparse. \li Functionality for representing (joint) policies, as mappings from histories to actions. See JointPolicyPureVector, JointPolicyDiscretePure, JointPolicyDiscrete. \li An implementation of the DecTiger problem which does not use \link dectiger.dpomdp \endlink, see ProblemDecTiger. Also an implementation of ProblemFireFighting. \li Shared functionality for discrete MADP planning algorithms, collect in PlanningUnitMADPDiscrete and PlanningUnitDecPOMDPDiscrete. Computes (joint) history trees, joint beliefs, and value functions. \li Functionality for handling command-line arguments is provided by ArgumentHandlers. Finally, the planning library (libMADPplanning) contains functionality for planning algorithms, as well as some solution methods. \li Dec-POMDP solution algorithms: BruteForceSearchPlanner, JESPExhaustivePlanner, JESPDynamicProgrammingPlanner, DICEPSPlanner, GMAA_kGMAA, and GMAA_MAAstar. \li POMDP solution techniques: Perseus. \li Functionality for building and solving Bayesian Games: see BayesianGame and BayesianGameIdenticalPayoffInterface. \li Heuristic Q-functions: QMDP, QPOMDP, and QBG. \li A simple simulator to empirically test the control quality of a solution, see SimulationDecPOMDPDiscrete. \section programs Programs using the MADP libraries In the \c src/examples/ and \c src/utils/ directories are a number of programs included that use the MADP libraries. Running each binary with as argument \c --help will display a short summary of usage. \li \c JESP runs the JESPDynamicProgrammingPlanner on a \c dpomdp problem specification, for instance \verbatim JESP -h 3 /dectiger.dpomdp \endverbatim or \verbatim JESP -h 3 DT \endverbatim runs JESP for horizon 3 on the DecTiger problem. First one parses the dectiger.dpomdp file, the second one uses the ProblemDecTiger class. Many more problem files are provided in the \c problems/ directory. \li \c BFS runs the BruteForceSearchPlanner, \c JESP the JESPExhaustivePlanner or JESPDynamicProgrammingPlanner, \c DICEPS the DICEPSPlanner, and \c GMAA runs the GMAA variations (MAAstar or Forward Search %Policy Sweep). \li \c %Perseus runs the Perseus POMDP or BG planner. \li \c printProblem loads a \c dpomdp problem description and prints it to standard out. \c printJointPolicyPureVector prints out a particular joint policy given its index. \li \c evaluateJointPolicyPureVector simulates a particular joint policy for a problem. \c evaluateRandomPolicy uses a policy that chooses actions uniformly at random. \li \c analyzeRewardResults and \c getAvgReward print information about the expected reward of simulation runs, saved using SimulationResult::Save(). \section acks Author Info and Acknowledgments \htmlonly \endhtmlonly \verbinclude "AUTHORS" */ madp-0.4/doc/PaxHeaders.5405/MADPToolbox-0.4.pdf0000644000000000000000000000007312717644140015611 xustar0029 atime=1463765180.05772051 30 ctime=1463765201.029553013 madp-0.4/doc/MADPToolbox-0.4.pdf0000664000372100037210000447411312717644140016457 0ustar00fransfrans00000000000000%PDF-1.5 % 5 0 obj << /Type /ObjStm /N 100 /First 835 /Length 1815 /Filter /FlateDecode >> stream xZ[O9~ϯc+-o˪]>ҔF M-~?3cxnZ0;>>>N81,\10Li)`ƠfVT 0)y*F dପԚUdA2 9OpT`fd5D\)sZ0ς @ n24r!vI%H+& kHh``-H<1*,>ưPj|^ xj7Pi,LNj.` B95 4PA }xl\{H`x}8l-cj Px 1 0QT9 tAe cQ-l iiKcA-᭤@^ZRV q`YLn @^e e*9x2_43J/13*~^e@f7 hY_J9@V!NjE=!>uauAޢZPah੷~hURgbьwFՈB8zd0LuSmNS5D>{:1_JE7tuLi$F>wbQvx',$Ň锫FCF(LZME| 4ӑønnJ J,ꃄs/n'i'D˂YX? rmK6Y+W)Z}WIg5]dz:Tk$vg4^w4QqIӫ}y-n':sﻛP]Sm4bX$6,frH2.M/>] v鰮n#U?cQhƇeOezQ]4+/[Ý({/øکLx ޯTR;m&Kܡ02sXʚ1~0Bc' $cfG67,3E)ʼKRS|RRg/!]s9€usM. ȖpNFaZ.]*SR 9ƬD?9,ŏ״%Vź]ދG*\$0aH@̋C0HJKAw-׉[J-#wU{Iy 8+Ne".v1ex? z4X8$yR"lXfOpF4K[qr %耗gUvOrR _r>4zZp/SjڱnE9r_#e٘߮uݷrxuC[u)ե2 UyrœT&@#QwE%?Ec[ӊ"{ ]rS +EsL 87_߯UvZ&^v]:x.vlC0VS2е(%ڥY:eTK~~}+ɣgs0~z2pkC endstream endobj 284 0 obj << /Length 1814 /Filter /FlateDecode >> stream xYs6~_ 5D8%Wמڹ`pH I%Q&ӹ}1(pw]f޾`O?\ӌ+9e峜u5%^Bp^ܓz{Kɺ\Wh~[ǭOnXMՇkȗ-z&:.m1}*oU] 1in 9rna=>Bw!LJ.N]};}dC9DbJ|jں]6&SLO022`D4/W )Pk_lԹ{K>m!"?l!Yjm(vj~O<:!r {yBr[B`H73VE.GثkF|w&YH%XЄdM?t>\TJ5/ {,"2Q$ ' M~Tn)HH&˭\/v-x})0yй9O(q1BփKL1"-@*eƤ(=*O.;Ly)%FN3T*C˪j;b ZAd ';q=`{_O"Sxd#[@JN}_v.t[ǵ_GR\*7 M~;ly_ L>3""~c,d !S6x)lIDG27џjkH)#p%(y 'XKَ&c41:N:Ĥ&cM+zgPCDMsHk'+2ߙHR#vuUo,J+=R#9Ԯ gpƌΞeu?4Ԯ_otNpWX\^c̳(2_krȉG Ʌ,ާr(Vq>n ՙ&y\_v,ܰA]F0Ue=[]kP'%o\m%7N::oްÅ~>qKQȲ/=hjWЊ]owMs7pck>ulr wpQ7/TOwjAA ל㜾-᧍mg7T~nVo+z߁#/cEdl +v:g nu9SZ4.Zjozg/ϥ"`ʼx X(4ԞumWTɞ\2!7L@'Lvg_'|2=M* endstream endobj 343 0 obj << /Length 2183 /Filter /FlateDecode >> stream xZKs8WHVE*j*wbeUOPYplJXA#P۸~}>>:RdeX%EUSđjW7,bQgX{" .vb/Am֫iXwJ/٢tCF\0$}At ~63Z?NDA2DPs >Kc[TD 8=(o"|bMȃni'4oƏ*xý ?Wn- 証ꢽ= _;LDXp4 -MEp*btB^`g4{2U> ] emcqQHc'Գ~2XkhSIL]3UcNc)] m2I_lpIBqQȎ):Veޮ]Sy @mj8h`L"Ħ]K|OAZ9bJy͎dO#Ti)ur15Xc),\g+“AEG;6ёk. fӺU`x7ض5@`5" WLBvЂj5VfnC,_#z"rSC&sԮSiMu_BIU11So\貉頁O3,~c2R+R,3pj)>YKDW?s޾IY`tȎD+qPq7T7ӝza}SNiUf > stream xڽ[mo7_-pGqf N{עArMqԞPC^[ݶK;|8/Rq]1 37"m2 l|=&;`Rs4=.& 芘7$Cĉ1:QWFCҌ}O.f(3 P !KOɁrT@9@yD#_Ea(C/j3|>HtJ=>Or'01OJ't7+J'EtR2>{ >} x;p3qNa d`B.L.Tiq&zeb8Y Up-x,Λ%)KLn 2)lRV(hSpgFdeIC'c&i}MQ  CB@K, 5ԋ9Tۂ*9)L50@f*Rr.Zr\ e&z>cUUhHTgtQW /Q-;"v:_7mٳgf~f/of_\n%%Eι\e^zYNonצb}/}9^8ˏzЍ`W/MeS[Gq  }Q=u\>GîN^ݧ> ws_0o\w@ݳ>{jPW݋m_m/ fS$?uRZ7F.‚gtwaK}=պ} wԂ}P6˳$|_ŧQjGb?BBԬFe7g-Zj-VZ[Z[QG5zQG5zQG7zqǍ7zqǍ7zI'4zI'4zI Lpm&Ԗ̤]AEE"( @oH ]#"<&ME%֝J$Hif-# Y,EGu#.1zЭ_ąPW&yTBb>/:z_+'zZSLiK{SAV4tGbO rZ_<GͲ4eN;8 e:GT+"e1YXx-PY0nRԁ4JUk$3Cd-pMTL\Vzq `RO> stream xڽr6_[S-;y⊧W&! S\4 ٶy(JVwMFs <x`YtWY-׋"xȓ/bq_-߂4궇qbWRQ V]8 Quzm\j0Dě_r?Dr`B2e4CwWS^,86=r#>t%P9LUo(=׽zi1XT9I17P,".<` ڞ-$w|XA`q/C۶,ϋgm==DʃpG$!b8 S95Ye@ @kMϛT[e=M01^/Zv5:` :8c/Wg"=ErzlIEȺ2d_8f V Pʼn5|>ϾtV.j08~ZտgаUo,U Jvʣz9FKmEvNB&O9.T[jrΡȉ 7pA?}c ';z zTʖ^+!7 (g0pLsR+Tz1ҀLq) g5( ]T;wOi Tl!."1)@c'M[0?V] p795)2y%KXCd'H8pҧ,Ύ$2X]p]#,@욆G{/k1X;t.&+3 rzеkDfg,Eq+Zzޠޏe'yUW3?E$F4T\j+2KHI/:zu-CGxPF,[FR<p%gMMxfͺn!Ko䏑vX(+7?܂]|\[hK0_0|l i/[xXܟ5e2\j(AAznS8ǹ#TJPA!/߷+DQvf&{]}٘Nle?B}Ʃr:qQ#yEW(PGGA=շ4Nѩag*EK{-r܉_#>>m7TD;>R:ER厠{QzwS2Ln:f7q^ u_S/]fڣ"vSKͿ}ﴘ */Cs%R%]Ʊٻ0;fP_J(bJH\;J[j7 rAra|pJVX0{,|j*Ȣ(a٭<%,3{LH[)"pR:㍀di=ur*ag)[y*zTIWsxn%( ֪1T%H} ?zV&cpd\Ɨ%)4,ݠ\lM'?XA.,R/F?} "Ңklwj"atYNj^vAsV[lP b])Iy)/@Xy#&.V^ʽܪh]QoDk sibACL#AT sTb# cc--fG%>,)%bѧ 9[A|(ihgJǔ5Z~#iM߸EZVW>:8"e(q@ѢU ̻X? B|M_{ri}& YHZ?y"le)**y[]]O1d /`qS;#Cd ;Hq2׷̦HcҵL QS_lC! 'WSzҊ8 P"XBu}dO(p.GQ6?G%p%> stream xڭY[ܶ~ϯGkmK-&n"( 3>e/{ɯ?HyƳNˎLQERG.gX=;WB(XnI(<*I,V,]m{~Sxb=^ݠqʹhX" C:~OGJ)  _*C4Ȇ1ӕMNXՠ~N3&MVaYYBP4KߩiAa%MS`عĽ1i.Cف_>e toӠ=zB sndg)C;k| 5AQ ZߡhuN_`{#pr$~]`g Q($ơ ܸ7Цk l=Ď fGS+f|~90 3JMW3㪦M떃v{XMx'U{.#o8SwLgվԝ@~}q~]ۧFݮؠ;:MioהKJj8E軦-ac} / lt%98<3:<80rRoVP*~(-#Ro5. &aszo~?O(Ԥvt!ǞC_V71{u"u.ven:k7$Vw3or?,6אԛj{> Xi|G*DTDhKb07ۂ`:UhVPB|X/睿]` , j7߉voe=<<ܙ0tdK!'gz1c8A-dZv"s}_TOz Asl4: 'mʬf mGtZ\jQp lPlӈ1L!L R9 TP(:.>0 Go0 B4؞1V+SmuOtrx7> 1)ix~18!y]5fL$@]ΪC!v{4a7Um 9G?$(~?$5&N^d4鏮#б/^QcćXMaE%?1[sA Ih:v1Ԏnn Htwo:w2 U&FJlehyB\v st)eLTf˴n_!40"ԍi5t5 IwM%0=֙ymkh#ֲ09t "B0V8 M@+ϸb|ɧ/E&\TT\f:Nj&4Vj.^3P ҄SBAOf;[Kt]B(; <@,he˫ JnS΁-J٠aa f6rДVQ6)7܀r(oH"At >:/αj˩Q2vZ?.QفELj"=}Cy^O1 endstream endobj 404 0 obj << /Length 3866 /Filter /FlateDecode >> stream xڽ[s6_3J|;}p/H2]|Τ}%f#(o Ivһ@`.nf勯PٌsVh-f3Y&Q9.WsقsnvB=7I\~EeL\4g !r>yQK{|mzUm nQҿr7IHn΄oyW+\.evOݮmH`69lmcةdvPY1SW%t[77l!uƸQ {Αܮe][؞h<"ɲݭ˦3O,Sqvw[;ZZ׏ nK%ٰB 0J .V ݑRoV#;.vy#ebikEL-Gei%bǻzY׏@3P-#:/)y\m yf6 oa5cYr> f"Ŕԕ'fP {=R4㜏e<,,Z 0KS'Tl! (ƛATDU]UE:UA;fdd^*v^ѫ;ZUwho=%фIpvt d>N'l68G&cJ׹a(ǣxUZV'l@ 5S7S/^uә` &-rMhǚ|#C?3?5u:; Sm >+hr2:8M|*7CcmHE0Pf`>hnrygC/6dP?ں8ͼ7~^nMAo_z/nb;OȮMa3=q vL놚a8V jS"ՏB*;2+/{huc[sؕoEfdShD>`X \QBk?  $s`jxͫwx^[]n{b;t`S}ntn+aUyUkt@G=]$=11pa9mمߕ]$Nn^yۀ@$c{{EM>\8_=ݯw5uо BXulBR;Lwl]tGL@qm<^xZ.R*W{raljR\dL!ԸN!X'Bs]{,֤,6ݛӫ+N2;@̒4z!lSJ H .hдFpxL^~)@Fכhh{) zr_3ٗpb_j ݣ 403. *N .SIM+TNR ҁ^R fF~ G ;@%x~PxXw[U@OM[: dnzgñOzCP DmSԢhAómξ6ga8Tgr)(ai& 6*RLuh_ 1*cN =>R*ZHzQxdB {\%LbJ6JJBͲI,d!% 4'J3Z-> wm*!%Nh2:edx)fEGW^ܥ""Ba 5B]z q|e=;e(٩3;&҇f#X9 R|X >`b(:s:hF\ʓ0b4[i6ĆδC*z $Y2o($)哇*-xb>TXOR xQ՘՘DE_j J>X)]ǖ܄r#3\L!>gWzř骋/*Ⱦ`Imm=q`ҖlJi|bx7 WQGpngh(Ź0yB2-9^xL&ҕ'˕HI7v(|jFcd0T>#w)="٢"ٴ 哋(18:r&OS6IpIslCnm99׏S{SR󌠶 s@?dF&J! @u| ΑؖHSMkNUwoMŀ\!u/TÁnؽ; px]Z*{^;[--G;6iIZjqPC Sŷu" F)>L̝LSDr8}Ҋ7tra٨&w&af lPŴ9Y- n|ozu'#8늆4*}DL胻d#S4i& {_=CL@#P0 B!hŀ=az_!:z(!,l'D! sL(6DY- s6`B</zn0QMi̎y: b;G0[Qr3A6LO3r|ROSrU$o>j˞<ڃ< !kQQloyTwouEL\T{g: w׏/䮧LH9 R'E~Zh2f5DV-Ux)~BzxoCkxg^'m?_EX] |> stream x;kƑ+ p+nns\ 9 `1Ks$񯿪j>dp.v7R_󷷟+aVEVXiWoWd*VN{ݭ>H>5C]WFzWmn;+uiҳӡ}MC0=ͩ{0xc̺|~#!:C׆۪%_C Վ:5ܶMSm# *Ԁ:y- :]rO!;Һ[?|8C t!<]?lRmWQϤ^[GرUGEs#VBgK$~ )g#:

TDP=$5&\6`L4LBc#|\^<b)yf'(t%4,dVf&r%3m/xg@Y" yYg†Ӽ&&΁'SPmm177aQ]XdҸXvB~:l'9/Vb gR Fbdb)D+L !c]C(1"A% H"kw/vpp;(p(CUJ))G ]<fy+hCk Gb4@bV3c[%e0Bsضsc;!uث2f`QPt6mQ}ڦsMHS)V9NOEϹƛao ĔC3sE 0;8%+5^zetW9^Yde~ U/eZxx#Rv_H5PK"g,e܌bV0z`g2,zJlg30V]elBUτaTI1a Z?CUJ 5WCscL"67ΫIv 9)=g2[ 0{@+`30*up>𞅖s7WH\ ZW]bme`DhTfi)6} b&S{qgzB$|"h+b@h5sX32nr@+C{fr(&CE̒]fy 3uOpU ٿnB/DK$ $p]G2HlR#u)RO2@ Z\"L`@ҬwM 6 jX)U1m* Q1}g"Đ]F}r~kVxL[v'y3'~9}&Fpo>c* ^nBӎڬmO{5,=F ~ՇXoYe\?z|()Cז$"@˳kQ O7dqӺ>2_B5ዻ%>zjhgx5?۱R消hxcxZgUu#r &w:[<άQkCg׻ja6eOl0*̥ hUui]U+M0a)́U;jرJR lǗvO uG C 2GC\8w8̃'}ffq[NyD_@߾nxsP/L03P̊=>g IjR=T=؆?Ԥ Y#i?YeG==P v* BX26ͤgC yfid\z!Yn􆠥y>2y7K]] lYŐ~͉`zcunYuņ 8kjc,LPP06Ud]c;UeSLI1s6e e1"D#mށQC^>ԈQD˅4:Ds dz_ W/Jp_`Z <壄Gl;.4s36m3ț]ts*`gIa 镓^ {/<G#+*==q{9xW u2G2RX?cN|*̯pRy,%UU$K$Y 3q~֮k7{-˘Y87K挐= vaJ\VHwUBUI~I,>$lՒ4&4F6&Ø2VP_(<9}Kcqi/͎&йn~⨙R1*6^ӷܪ4!@iV(vEj^b(Ҏ',yqkzG;AA|Tb}xr=TB^X_2(~c] C8& DSN4׍jrbo6t)iID&%BdPVN&xjy 'cr=VqrsUՎJ'3FPy>N,uHؕXS,v!RIum3v?9sOTfZLy·);t?)BRDH6 TP|4WQW}TOVeB >jBn[- ]AQ+/G F¿"Qa*;.AZfc?d\i\Z2SƇlK ߏ(3 Ŏe|ޮ'F] N?4,6p@qV>láCW] e̶h8E"16{q K1ޗSlп—8e> stream xڵrF`E0x#-'*WkesS1"g,o~E$A<==xs닫*ZdnvFd$4MwGM.Wʜo^O;~=YT^Vkmyf'۩SMq}+t}BSvsr(\>@Ev7%t}߱Z4_-ri\h_)fQVM)t\.Wa;oa(?ET*ŽO_A: w;`閖r_״M]q[|$ܛǢ(`5 .oWGLqg@ ?2H:)LD sy@S'pnl:/˜;dB ;! 4P4kJ5i |e^(Ή%0X1RLԠw2ԈZvBvﶦll c6 \;}!v1DV:^oenj:9nۦA ȂpƁ4\nt^- 0j<ݞ lƈ#4$NTa죃bBTצ.0q\oi)jm_+ӂexmоrS1߶fS2!C;iWH0i\"gwgu^Oa `]RToG9@,m65Q0S4,u#GD,,ISS!_rtQ[ 4j^1عkMW 8O.[EHEnNjuuޢ98dVV]|hMpQ)u,g~0H ^&l ]eʋ ,u=m5;2J=)D}GZ0$X$nxH^߀9yuFzO9/)wh=9ُ(rfkh%vt>TQgs^wt\Ã\inLnPߙ= MuHc()MJ:F{9wajF8 Q&;<6*TWݡNŸ6ѡ8rRYtFѭ!%%<\L?^'j bQ9iAV~(q)IQM# iۗ`w}w:nχ B8ꀙX"- ` l9;\ X+i.9́0qh<ѥ=(Ք*DeJn^U^Zٌ K>@YpKl8hch긜I9W;9Qz5X׆Wtcjl]ʩ{C.ZƘ'ѻnk\UWuRB!+X-'tYG,Y -?EmmuoE YCpn_iv*ňI30o?$6ЪuZ)| a=y .C\6ܲ ^f,X4G )HF[<%O9f- BZD'HSLOz }x6*A`e׭X} u5 y/:A@Pךy}g JڙJ[ajV m=?INHV 4~>Ɠ lBTq%X-US97# :ll꿧 7v>Ss8:ַ0 ;#$4gFXs-r/b0$& A!XVMq<[;O"F]]s0iIһ(g :-e6ccHKEv̝1d&%!~B B7΢a1ۉ(CF< ?Kyyz{'1p3rZ5wCrわ>rG_U8IC,D CxK7 endstream endobj 442 0 obj << /Length 3003 /Filter /FlateDecode >> stream xڽZYs~[-}lHYV֪ו@D  `Y@׻ Ɯ}~Cw[gss[eNvJ# UNr#c.8{ah2Gq73O-QTA(ԙ[5ݝym_>p+n` q+.W싮pLj\VRW)E4J[پdn=xFyj:YBlAhp`;3~&0odA2gn)l7Oq77 n6p7K@Bk:>4-ẃMy]?ghp/N}ugmy۾;ɜZ8_ϫxΫ}+SxOW';n뎳% t4{3L(@~:Zz8t (ѻZfDN?>Žs<8ߔ( j@_s>} \x+_oB=ISe0G pjv0O+Qo^_/ŅN}]akOJll@C <dP3i%4jy~uEϲi!6CBzzgi-W=hjCrلEȀkQYYF^ALmOrط=pK;VdV[O+jyy^ Y?*t,3 9w:Ep6ڭ s^&ffcWzx:nj.aYȼVlw 5T[vnXAgzEf>mR4B}F5h3:I6\:%*iMɠg[ @ jN,ѫVhI0%}ൢ`nP c{kka0 ha$H4l7Ju%MR"pO{*Ghgg y17 -nmɼ&Ǘpҡ-4qK L{M KtKz똚qQMQߵ -t`6\F\iՀ:1N`; ] v-mz[u_&*>\ l0373lޗ 0vp0sܣPvN!E{k"2K y=vLs: ; 3 vB/Dl''Niʃ(Q$?bpp +KK n? ks7ozy1;CSdZ/H1xKڛ:i2@V.L#%pH 0m@̘+:# r@iO2*mnM~@Io`hz{kiG%OmQҸޜ/C yo41>tRAʍw @ ct-UM#یf@e\ItG\Dr7)Uusv4Ը;T %p|@lt 8͍*"J4 ӫñISc&tM@UйLNlXp64UfxB޽f;٦TfI@XX>PݗQ,DmR E@ JUJSocs;L!dO#ςK =WvA5+C qh5HU!4ԅIǐ3{Jr-5‰F7 -`8i6`@v@+2օ):ҙ 5z)0YyݨB!^C!$|#+21jdcNNɠɛbXېuyRNI©=zi^71}_-& endstream endobj 459 0 obj << /Length 3293 /Filter /FlateDecode >> stream xڕZYs6~ϯPU&ت}$Nirڂf b9!Y@rL΃5ݍ7p᧟lSU盫MaRm4ʲ\6nl3?Iϟ} %tSUAmAZ:E'h^(] n4םj{_c<8?G M/˅b&Zn]s8α=Gr4: ;8x%u((B O[UoZ Y1k Dq4_8^;DdCة[5ᜮ=pkgt} ` ~)< $ C>Kr+ n\ @(;G0<.%qY{oG{~UUNapJ` -ġ@F(.ao;[RxSkiBs\'AGXֽ%jgh/:>FJΪ&Mݸ #)n}b Hv)3 "_ `}s'>czhtQϛ)f䣪;6PQ8pPA\,0񋠈ҥ6B&R| c3g"=Eˏ =4`>mffs3HJʧTo޽~JMEđScݚAQ[![Rh;S)[o~>W?^Ċ\ $z^rqnvvu˿r@dUݛBloe0zX $  Xʉ=ɵyD;ƃ&ŮT"u'?$Gn!1{tm@akp>! 9}[R\MHBhF+0 }ġZ̟_ Y_ų 32iha$ UUx+(*UL]Ur3+}wP $}pQ."IA)BmFڭxR4NWy 4ܰv"(K,H`P; 1(Ac{;փ! R&oa9%F =A$>,+92yDVj"N0;m13\| H)mۨj~gkag}%0Zj/_8KN0>A C&}DSi6}&fpBCD]d)rB랮&=)3&HN(e "G?g:'}!"86@B0Z o6WI{d0J-Y [Fy9.]<9$=̿jd*:w%S(E@w%$Xi2+#D¥fbM~kX ʩ`HM33B60i.g-'lwb.^TVHbNHa-(NMϵq610 yPA\ČiɨڂNagTq|,wk$^Xq%F"?yW$gu[s:BV;p*B}rKOpj!Cy:v-TVALjvgb,Xܧĕ2haq৯{ Pצ6gٓ#1ve|rnm"Opco^j mU2u{z4'[Rf ]]P"V4x-&U%v:+$@T㞅ؖPls,TeTh{Ccl2߾BcQ@PwP}GQc+@1B ?Z6-&*pǒ8( ysί~?y^w endstream endobj 471 0 obj << /Length 2193 /Filter /FlateDecode >> stream xYYo8~ϯ>ؘ&EIzHoofl'H&LY̏*#Vit.@?s2TgDҎp%IqB ͺRDDipxIݾXp^GCG|MO08%0+;ʹq@A;rS+e۬i{}cO X 8EҜ,d1g:W(e!ԁ&+ъ".bJ0R`WU0B9"g "ډBL%A]paDÍ'Їӽ\ѩ>M`C .}%G`Q.s}1M 8A!69@`8-ue&30Aq[6[6l}oVY[1,q!Yd {CFHVNljZЗ_0\k5Q ߸hcfQB+[]wg9|41/tK$EV{ K9gCtb,ʴގE׽wp G<X GRMh# Sf̀QՄY)oZФԴ᪱B+rT ( mSK@pOݸFgBs%~3c*jVP 9[mb$@9}Q n)Hj!:K!+A\@ +nd045uWj 7Ҵ3kd%.f֫0]''@YW4 #ZBژc$pGCdUYRO'=ktm9eo1=j:e3 s^R%7 …dp*CE­`?ɗY F @44 ЀB4&)ģKеDr>d@(%S7ˍXV C[0fNwQԁѬm RLr-:+Z75>E#4 D͐ ,/债 K,]čGݎ{Wӟuqݳ,޼yU W, /Krΰ7}{{ ϲqgR{ʬm.Шy?_<^Cl_V]c7O=wY~Z^tp^g>ׂM[Js-_ :\p7.pN<\Go]r+\gߊ)C~r^6[?oʱ H-4 X&Ϣt*0ER Ef4w;kH}p+& &6̈́Ul9iL~<=9NOvڼ GSA (qI,~aҙY7^z\ꉴ0׷cU^Z6|\=iSemݹpة@CÁ/EH B8,xw~oG}]!\xyut}ý́LwoWV=NwqtN{xʾSBX$29 w=K)&$J\lːsA#+MCӘɦb,H 6 `bݲc'ܑ Ny>ă+fRlvfc*&%QS2#!7N)VP¬$eC1L) MHT-FDT+DH~#SAO?@Cq͒>30x.ORo 0p/|޾j*`o"""w ֍j ?5}!Ȗ6b 6!lZyPpjǰ`B5Xa* U _:iN󶌁 &aPwCTIz4Lz0pyBU1pTz) }SjW7+ĐF=A.Fa endstream endobj 482 0 obj << /Length 2697 /Filter /FlateDecode >> stream xZn8}WaiY)Qn' oZMw+VK=ؓbjIē̾4"Ud{`GO^Dl/8N/XyII.μ(ʮN>_Da %yI)dUz˶?Z>uz5ƍuN/("@\٩ua[QŹQAho=4_ SE'kyɳIcMU*߾y~|Q *:MT~V_r(-%tEmYO )출sX=OCYWaݘ"ڵj]kmi  0TDuE74C?qU\̈=_Vn|JZSd2tH>{ vIxI/Ec>=DX;.~p#@vA!#1֛\.tZa AdU īJ (Cd>W`KЩvyU.F׀ T/MޮmyKqj*ZkmeYh" ҳ& 6/TUNje,DDlH ):u0s yiwg/Eq *hVf@\VA$i*2pM%Xʍۘ! 1VCh_048MgLU5PK8OzDF"XAo\Gmt1p@4 P&W`wzo̒HߤÅu MI.E>lFk&=?bi 3ưsaw2~P2 s>\U_ xtTR5uw֐0$4chu]yTŗ5l2~8xK*f[[mѷ!|H`K6yf{ժVjgBjţ&SkC0@x'D9vwd( 'ՌW~H+bVʚڨ+9 wPɋ:_ZISVv>9e2yM3O[2?3(glb3#`蜈u] Dk26 q`VmkiYh9~xD&4 `]vefƳ0D6D KG/b1?|XHiݬ}Cߜ(2; wFnz\R(sk9@8خ\c b ED`Nlk$b]P a\dW"+dm9 MLQb 8d1Pxd ac,.0Q)]P*x.܌cDNv;;*.\׾>qͨ)ݫ2;3bifT.,CQy4k066\Y~Ry`Uمрf.vX׿# .U9'C. f(aw%wAsmEV+FlUڪkcą3 a@=SdU"0VEcmk[j LC툘9T#dpV]Y**TUcq5'eN߿=Et y Ԍ&zv^o#9AbY#oYA'o&KlhM7`ayp st(J9]ޫ*{{]k0tA,;ezIIG$v8]sSچfXT$Ь,g~` q Nsp\(:_%Зqp nr8pFGzdiXVxΖEZD7=[+UPKjwFŏMQ WWY)(/V绦s`i-x5H2b/ݱ$/p\f(UK^L!CZ̉a1H,u}hiN  E}0kGX@_VGRsO-}VnHeWH D3ճQ AMpB`cōݧm?^nE5>\pg`T|//?_OrKƳ#5e]mI&/.:dO 'x\S ejdJW+ =рHJsbn_);9쟑Mk{§/ CÑ:fʐÈsqqtʾz1p,8G`9 ^:_EPnjB}*ہAv饿^a> #<7q4ڜ`p\H= 磛OB>K.]ԏݘ8UZ-'V o<++jֲs7=,cJ'Fho?5U#IۗRa|rd xU @jۖy 鎯(SgPP,[@>>}? endstream endobj 346 0 obj << /Type /ObjStm /N 100 /First 896 /Length 2848 /Filter /FlateDecode >> stream x[koI_Qwrݪ[/ d00} 2 `#Ǒ{N $N /nwu[qb )ބPXp&;bVS'bħoBT1Ŝ[x 'xXWIrGR4>b?G!ydBr,&M(q?7V?N'0g ?V(`ń@#PpR1aD[,<Ey+ؼ.$1cVPAUQ+eȌә gft^V 7?~ZtgFF}d^VzR_m>Y,EhsXڱݏ~vQ1cj6_l6_w;\uw|n4~\/#\KBT-3k ]E"MU<1㟖ϗftهXlpʕw&$`+EM ~7d29cb鶥@5\d7t/e#Rm<=pH<, ҢVnҝV.bd2N.V;BSxmp~?]޹2i-u2G°xT\g[<[2ۗ~Gd`}`x}vFԢjYdHuV80JKudT>}} ϗ1L _raaiEbX6z04 y@d FZH4KnQ.xOj<_(u`q˝cc7VJB, Ɛtd)oxw. >צSK㧥ii4~Z?m0#:|&U(d4VS]IǏ';P3R$p4Hsg b]D)<fe^(VD"DOԑZjgݢ|$Ċp!#%""Lzb!ޘ8!6` 瘿cr+~}\3dpODRҫK+zc7"Pt#U?dXUc:r.H uGb+0u)İNxPaX0dn5VvmV ko562$[ dfz/4]701 coF_ҺX\y f KtH[{3%tڊèKnX0#kyo8wUv|~?'>L>V::a*er#h RIՍ"ԛHz\t^{cP[s䠧E)k\/`FS~b:¶߾twUר~f Ԯ\)_v%PV:3VKH.ii~̰uzc6[QAu*b cnҎuH?)%A 2n0߃o _r+;{\8v}(+vӸ'Dȅ! ,7In@?~/F/%t%WF:56bZgR;Cu^^=gׇodoϓ|'ZZ[Z[Z[Z[Z[Z[Z[Z[Z[z ` .e:Rh Ҋ{䱆,6FXF.5w5M/ot:dG%B.ֳWMM>_撎 e>p/FY`i.цU:_ٯno^{B'̝nZLXAsr[Iq~[=:xΧ wtSN6},7+g= {ӹAȘOYکYTurh߶6"zc3`oƲ]wE~ }J8|+?rz ?H-ۗh ZMP,"SiE&^8_Xܪ-K-Plv>YEw)w{[t^uLa],w!,ӆ`8ic1eeߓXFuΧ7qހ5n_-]Nċ Eoqj5ZͧrˁU bqBLP\@#*RMx &$\4 ^?Ok:·eQ;lQXAdPH?*L٣Pl endstream endobj 494 0 obj << /Length 2957 /Filter /FlateDecode >> stream xZYܸ~na2ʶi uml7^.CˌݥWu.>H;v_6؉t!VF5rǞ5;8m{\?=,>p%)yr4r@,^wR ghJp(x^hj2vv/n,;b6|~g+pVD6}MY*Hk? e%J-@@! ӆCYI2JjޫB^SG~$Q@hy!$=й_|V@<{bmbz3⅑~U0aDz{vq=E*%svFmAf)~=RʾuZ~ٲvmz ۺb jF{·$nfDɩֻ͚1Z8g8} àzANJ*ĩQYhsfZdo,HB3(w/fO3fxH@v WWc;ӯY&@W :?|U[ӫ/}P C%4' Ñ>A7䠌.#/(eɛc|l䷈yp*C & +V0XΎ^?%!dK`r 0#0HXxeJc{*GS<ܣrO ;E"(f*oAX,5DQPfar G_O4L&b7'@l۸ۋe t5>Ǒ)ދ%qJx,%JjgG =;egJm+{hތnٯ*(caLj Gcbh՜B9: Ȁpmf"~~-o#!0\&՝QXV{0KS(M0qe,γN,M˄Yz]F @i щ &[=S ǃ0')⇃! 1ȱ+ol5C`u6α?:Geyt7]adN~.r~  }6>taĿLtMC 螊%_)2VGtd(+e ͗Bovp5] Ԕp~b>%oكB3qHH4bR6zY}'!ƅ \ED0X$m"$@L$ҹ%-@A!>8j4z0H9".ԕ#HELR6Z xu{m/(BrPXD=̧\~2kHs_Ri Ts2ȴ$\C)RF/%-Id@AlzMuWo?\(/7yC2tOٞhW^[AЌf7"K%~Ք"sҧQb"-Y\ R9c !߂Ɓʢ).@rUĩT*jT w?_wX 7}y1 +]bHxO Rq|E:)O2nϮUw0S]:On7krA:?=,ru r𥈸q}a e*O";ϔz,䚵Dpuns7Rl;HЏ_(P8NXfGCFPj!ϖJ.X;D-&y/i endstream endobj 501 0 obj << /Length 3958 /Filter /FlateDecode >> stream xڥZKsWP\+oʩ*W49X+ | 9[̐Mh_%WW"Muq{Q8(?0T~/t!*X)RjEE+P$r=-νg5Myzg%3x=.7&Ij HiLIqx]l" l? QJ$&:ϖknaD;D Z6X8S [ZQ`ӆzYпt"mwJ-eLBqr 8 I03 =)Ȉ莹qDSQ-C!O )M[ `/_RDO1ML;%p 8%#\svkw@/:7A yͦSpyas.4wi/: )ȸRٸԓT߾KL!(9 q̀cc0l 3([Dn4F'o$2Zr;(J|fʥ0]E"24a~Ob0@|Cuª,P &?V"6s k)۹$i9P"˾!etB%1t!yU) yJ2:wSGl%fC ˞,#[a$=@s+`u ge 5;bNCKhEaVP"mn0"0 WA]D͠)t$}AXw .AOeӳKE`QPG>т2WD->D_|@bs|2{"]0HG=e7`>/5gFLe\ ;vUg ~*RiZ1)V{5E?RPI8?,2Z@5FAsky*RWj̕~@y\]=P#͹gCHHu3V]H+'fK]dX>|W׼V';@o%cWOj-.t^vĭ :ʕ 8 .ZFBz![ς-U1Iي&]3)2EER3uo:@C'"m7_H%^r@㧓eC^$|Ȱ<&ǁXc~D*N%906VerȪj/( *a(؜))ݮ'@1#7ט-~7T`r?|p 9D1ڡai۵!LT',VjOv 9e;aDsN.TN~>eF7E*o hwO`^س"{fdw XE~CA|~-6utQvPv9 U&aB|p\Sz"E*$a屨ɸLi4pB``Jc՟0m̲%/3}`C}R("&T"{lAJIgu\b0/;1ɯ]2N8e{HB-]M(y 9ƋDry!g߹Sjb+3y}'Ã'-rԛ$yQH9dG@OTNU3P7z֏.rpFp>~x2ڴ_?w֝`s ?@;zGC!=W8\0/RHԢ*aTLi-}Bּswu3z# Ca6m]PheuT}x'GOq="g I{.ErGR Iܪ 8'5 " 3)|9l4~S[)Us sBz-?>{4kp 4IB f /ݭK: {}  .SQC2_:aE&,;l;:Ӓ8l/p`;71ÞQH|H^(<>N  oȕ.HH=AaqSXK󪖾TiA[?@ڭ[LS{9c?]`dO YA٢b*bpzNoz5ۯ~ endstream endobj 510 0 obj << /Length 608 /Filter /FlateDecode >> stream xWˎ0+$SᱍͣJMnFص]$H DLտa^3Ю{=1gx~w =ۦ?AdyA"ĀFp?MFA?2zU0ʏ-%0¼WY2;B,a":̌'|EϤ ͗[D0p)?8(MrmX';DQR*YxWWγ`X҅Ya&-R2ߴ/P9n6?UMH)PY$$=Ir''iVUf/qCБHBTNjːHLme4x24vH$D+J7=jUТ70kLMDL/Sۘ>44$:+Sj`24I[{G;!WcW2dYM{@_9[hظI |VH#I@8VI> stream xڝn! ʬsrqcqq z@e=oۊe  U^})_}F JHA i V+Yɔ }%ɴz^>W?9ߜ\𷇫;2&^=ٮ% -y/#wNwmfƘhJ<6k^sizDM'YcAsgFE=-j]EWrv0IT}% D,$" 3[xϼIbmuCZ/HwPS)SpG֛Ȅd"'(HEqnnn^^^T{Ϫ7co^}@NSe!bC{QU88DO/GSy^GoE-F@ onɊ6& T1%\:'Tlv(*E&ZyM;B?tU1o}'))-PƉ4)>):IGO@H7Y6Ւ3и%ip0vr[ (A?`-Ũ}d}8$祡 D~ܳawQ YR$)O$(-أI(qЖHimwyd V0CG\ `}B{$ Sj $ala~Ȼ2w8` _a':G%+BPkCe׳iNq1So$Apw0J6$awj i00ltjCrt;znxAێ}.#% hTϲ+2#16p3Aa I\0ȳ :;)c|uŚG"o H:CXqpCa@21~^IZyi6/y4q Yl/ _%Q "i$CJ3Bq3d" j "s XZU\b:s3w"($r.+KR S2+Y &%fp?:7\Fo Tf71rd3& B 4 [ fԈ'gc4F[PQAhAN9/ ykQ&7K ,܁nh* {pm U%tfrݧ ,Gkِ-?bؕʾ}PDzqqUo^Qy\OKAk] .c=;<**XGڳ ,Ɓ6.a]yB+|+m]sآLH\A a!KG^1GYG4-)H7sP]v Zbtc( F_?PXV IE6Z[Pyw\"6$̙L8u=+T3C2 N* {%!8\R 8D,p\cGC ;?($Zp0Rdþ'., }tI2mGSi0S-E<|3zM4wzHYg Z2Y<}]?2EEFulSNX3Z3}Rc0a GzTx &^JrzdcPʫBj 2x. 4<..@F:> stream xya'x>vgfv=dr=1uZ"@$!oHBı'I|qql|9 1!Pu ! %Eu[ou~~y_UGQ 禈GRDDDDDDTHIVG}/Z'ۺ' ro{f}%sDDDD$_LK7<}eC+4' j^GFrђcrO8}Z/<0|XrxdlxVo8%r?L[ 2|l]Q %""""*d%G7B{oG74 7:riKVkϢ؃s.\id ֺ,<2zdSr|׌m^is'j֗S!EDDD$k2ͣ\sp+F[X<쩃s,#[>ڽP0ki3zL+W_ܼ~ 9k/x.0 oV{F>^^(G^]ҶnqQ%7}=4>\a.<ƾ6jC5r/z#Pa1o|šKoaj'N{d컅c=?:Α8Sad쮡G[-74lf!gkFkם=D|4kTȡߞHG*ёM}`m|J+dB~\dJ7v,n̽{s&Ő{呱/NɺGn?G~rؗky_ιxemƷn?;S#plB?5{ه'F7ٍWȈ[ݤ 9_Wȭ#s:+7lF\VB>1:8ZϊW!C~\dݖVUh'o}F]:4PY97᭣<~hG7}67px1wnCzэ-xlnm5TG VWxB+,!f-o{SB::r?;1wʗ6o֞~pnhq?pF*dn<=z_^pP.74븅{'GG~p1ӆ|VTȐ+v('s3mܻGңcwͮCM#侱 *?c#~yƞ<=4Yu=!@onw^v\n޲57otM>տnȧJweZ|lnPnx y4Knp._g_͏ݴ鈈H+埿o޼iɎg}6=aёrWY:3'4͏P~>nذuˆM|2jʥŸغٚVT/j_1s\޼w_m6ܹY($kC=wnXw[L|ݪ*MGOn~?q`!Yumwozroƿ|yODDDD^!E$ax2O 4kYۆ <ORDDDDg!EDDDDRDDDDDDTHRDDDDDD )""""""*""""""BH*7 In"vvVq UH#EDDV! HR! HwRDTHQ!EDDe/sm;= vx(UHQ!EDDf];Ӧ wqZ;nꗿ;76<ݻ_􀪐"B )ˋ/|';ytݑx_)F?>u7&lyn }W<*""Bf0[rhWٹ}?yOv}/v0߁GSgg|(RDDTқL֢-=YzWh\sMkU! y7Zz^xE?:, wRBt}qp?w'Һ]VH,{G&kJ4r?_; h҆  _E BӏupO }§X![B+|ǷvIn,TȂb7,d,TWȃ; Gpza>?~m翎h!ۂtmlp[8bO.Uɏ{++n|5`K 1ӦUHIVl⡑BƸϊ7p]N'[~T8ց .\<{⋮RrksK wn }0&/ mL|굉 W nIHld_?Z>~?]8WMmrtYȦO} _Bo?do&Q,>͚KcY Y쏭kQN""~?\^ YB;_;Iݪޟ= P ͨP QY^!{N.Wל5wg]s5/!~}<޸_;;ok_ / ߫z8S`WwRBRq]yϞwGmwro7gz)Kv+d6X! Pտ,K Y7LR٦<5^lBi1`>\#)-2?k-e -RT+j֬BFyL]pZY,&(GjU!?`[kssby9;j\~l./rc]?uywn:xW_=T %-'>xBI Y6J5J Ყ>ۗ[o;gGy_ŽdlztƲEB^SE쳐OGu>X?K?^RV$*T[d*d?>wnwZ"*dBcBׯVWȠ娬?ȗWo\er/N-~_<{r7L\_ /zֳ_{۷_b7|e3˅_yy_>+TFF{7Y~ow?yn_Bkm&,\! 8 o]PcŎ1bzK6X!c٢ 93Q!o|"-'!,W!juU;,dЌn2PV!$m$'꼓f^zo\2+^9yp'8J>JMyFww2r_*d,ds;Zͳ{"kVh,[׬jx`^6oû{;Q!z_z1 _|gF׬Ys饗[-__!Hc nI cDϞ:GMkV6]9y_kYzc=bN Jb0>Mb]Ȧu+d )"": R![Z֭ ' g(mχ_ .x۴Տ~9_x]®/ڱk+bv1qa/P$Ԕ.y25ջw>/M=e Y[}td?VB+d$F,DS!zĻ )""hg-#v߱&7熧<uy87פi-ܽW _wà3عs{ضs"Oo~ꅝwؾk /dl7 nZ2(5+/o+M=w!P![w(v yKODb*ّBH7WȦM+gVC 9>֟yiǟryKsSo}J_ڵ+膻vص}vٱ]۷;o_mw[dpNU-G'է4}YZ򃔾kY: _)g!=[Uye1[Z!K[d )""][!vj =J_ص#_wl۱?7(|Wd¹Į>tնMuLұSB6O"6ϕД{h*N{V]R!W^y9|<\!'bq[Hn{ndEضkw nI#uζ#x͋۟mGX!ELϒEDDfU=_lvȿqɫ;煞cH'ܞjk=I*d֐vjRDDD( *?ySOtB>^ٷ/* '^ ;[SX@2w׎eedӣ_S!UHQ!EDDV];6?>|;U!}'/ݛϾ=翽DžL\w[w#+/{LUHQ!EDDe=/=?y-7kcQRDDTHQ!EDWHIn*VH/""҆ 9$"""m"""""""*""""""B )""""""Iù)""""""")TȣgWDDDDDD$< 9m{`H9>EDDDDD2(5:<8-H=mr?׹?qi*H8%OOHU! wɿљ}橧?z㗬^UHUc`q'`',}Gz p rbpy55EFS'ΫU71k||7>cϾwZtIRDDDDD$b\޿ .>[wЉWV'8ڭ|(-2b,`m7?{׋{w]w~nh2RDDDDD$^%'UtN{kMjBN8= 8-^S6̏RDDDDD$^Y޿( SVO>iA[񵆧4BwuO+Vȅg< -]Գ~3WȾI//$780;o`*"""""8Ws.f 3{z[~rnY |{_;T3A1fݪ c 뙾`ɹ^W|%|hqSOe_PmYϚibL ,7x?34P[-(9qך?o;B 7زG\3.Ŷ3??C߸޷ko{W]rƪ蝹ҫ/X2VQCӏ{ꙹ)A??hǃXWUȡޙV|A+蕃}==C^TB;;[zծ_?+|U+^} <嘞C_}hJ_>5W\}Օkg-29{[b+V_l1 ?pV]yˮ8oqAS띵u :p}w9+-EBOzQB'GA,ުk:s3Z Y%3NwZ}S/>rosNN/Ϻ*dQ{{/YrNPrK`OO_K/Y1u,7ۿK[VN+^;:{=3r+Ξ3048<ߓ{ڵ6oPQ\k9i{Ton.7#G朶bS{ӿ• ?𩗮p~OpNDDDDDz_ \XKoZŋVUX"_g!?׾\{?t;__~ Y9!+zzro-YxϜ1Q6ٻ`SM__qxhppgW;|7ǮZy嬞ށi[ Tׯ=7 }jsUjS""""")> Wxѓ_:9u3XVs?xүu͟7x͠?e_ g!?_7>wZ%[ʏ~]9_lY&,{Д N=f>8?% W.xbSd'_?),ׯ8OW]9䛙\!g9ׯ]Q|JmOOW3 ;yOEDDDDR"'өKNjY^;GFϊ+//&[Q!̾xEC/Tz)C{zf_{Q 'j/NrC MZ9]f=}dhJrY|Ui_tio5Yt򂊷 .>;qy Y" yw߻~W[R!sSp-]x@QG M-\9胳O.}eo 9cYZW!'930g^zګV^}/?sN߷C^ukWN;\ Y+ZbW]x9}}S( N܋/Yf՗\qk#VW^G=L9X|f(P"""""hQU34VBP6"OmK_ӡ)}}/Gxj Za > j?u|> 濑ޞ_,_oE?WpI@CDDDDD*d&R9Ǚgf_ϑGN}kObDDDDD$Q!cWȁ?׭YyU䜳͚k*BNj菕?57!?v`?74`DDDDD$Q!EDDDDDDRDDDDDDTHQ!EDDDDD$5C+8TBBBBBBB BBBBBBB *$*$*$*$*$*$* *$*$*$*$*$*$*@@@@@@THTHTHTHTHTHTHTHTHTHTHTHTHTHP!P!P!P!P!I#h`5bߴB84[- C7=[{bE$ѳEH660|kE"Q!|kET!Q!|kE"Azƪ0ߚo* X[- IƗ4? Wc_ڧ߹% `mdR5m_ %M"4'&򐅍% `mdr[?8 1* %Mmb/iĒ2;ܵͷ5Bґ}XV*$*$*d]Kg+\R̐ԝRL ێTH}mRD$2)KDTH/S+Wͷ[uN* I*d5-Q* tpZ^5ߪt` y2;يϞ _G%BdH-w EBBFlȪ8 $,d[g!IYȦWH.*$*d%M\@w.Sͷ*$ݿo{-$tBn+^K]HH2|YIоYo􎬨*o2?Sd>*u6H2|{y[Zo6^!Cc'-mB2 K% `5ߒ4[41[TH,ik}--i|k5ߢBꏨX҈% `5ߢEꏨXՈ `5ߢEBbUc=hF yGRDDb̷[H-Rg(2;ÈTHyci 9\|?B%QV`4b-dF 3|HLNTH P@ c}.Ohh@#AP!N tIgoj*рdv֍qP!6c :=.5AP!v.,ڶ\sBV3v7qC`TH23 X3F<@]`&k69TIܶdTH*twF5"_SSm e6d[&[Zo6^!.l[THW!Sߨ0ٚlINacEĪ&Ax̪0ٚlQ!GTHj(ld?Bba#4dBBba#4d ?B% `5B[ ϥdkET!Q!I:o?hӂWȺ~lNݢB%ؐ{ x1@g5jr| D_4 0D)>+a&P!]uúfFB֖F2kW{/˳( 44q/xmT@kQk*HYggd60@sרFRZ$ yj(#.ܶ7*$KB:ckq3*$ҵрneixHewF BKB*kcR-@ұfdm\m~( td9m(% x_B$tsghvk"P!zWˆnmD5G-~FgE6Bݹ73 $6ڞi4*$`O7F t 3JHTH@DgME@6`TH P3vkKc&aTH@Dg-y"TH Mhx<@h*$͆b(3vbkAP!1 8@`g+Z]B1Y(~{ Bc]>n\H h$3jh*$3 ۃ  hܟ(њH[, [ &3Z Bt0kWkoT!m*$@W5tTIkUiZZ`BBV]1l-j]M@HG48*$@S*יH)}* K fV$  T\&eAS(ۀ^2 m?@ev8h!Ajץ#_– A7Ï+Uڈأ UHTHq=V<; RYˊڡPD7[tlCʦ6BFPBB9n *$*$*$นfʝBPBB,vOUBkFT{fe3X+Tf?BfPBBIuOD)huUňOLmBT~PK߅l[xY ]~B&hkC BF921 =N$ubT/'b/UTvn-]x(lʳdUHTHi]qٵguI2;ūMLB:&P*$8nYA7kq3A\";R!ꃱQVt(T!Q!,7;rZsLotBpl/{]i:h#*$ffT4WTHҡPp܌x *tIHѡPp܌xQ%Iߖhu(T!Q!t^"<:P*$@K;QV ( * ?Zᐦi@TH BusTmT!TH k®ZvHJy@VXz,@P!:L "  (& ZzȠ-ҰeV! fg7\: 4,4J76?#4J=m,Q0aTH Mhh$# h=Ե'ˍFE8>- @4G4ƿa6tGev[5*$`Fi+EP!AM7#ۡAP!Z~ R(mi XiQ0E5eߕ(qAP!g4JQ)BY 4J; , &[AP!Í. 8jv.ҷ6dQHhNalݨd6JTHݹ6l6JpceTH4wBmXaIl6;I@R(nrX D_ NvvD%#*$dsi( 25AT+}uUH! / :&#*$ ]օ)dkŊf IɃ֜5*ͷt[/*$ '-BZ9oHTHG+| BB?U `5ߢ?jXψU `5boH"Q!|kET!Q!쒦ڻ@tCD犐UT#[mI|KwVȊo~-Kn^T[B64xa|KGcNnTZ$*$4][azK\Zs6UH:'WȊԼ J!?!*3B:.@*|ۑ i%mRD$k2)KҚ jŕ|K=twѩBxE I*d5-Q*1\wxP!-PKW[nCMGUzyV\w mG*$DToHTHT-iBV5 'I< YHRsꏨMYxΕ t|B=tůT!Q!Q!n+^?)ҽ@5zGV"kV. I*d}*7,Z Tm.ͷzmBǎ󏨐dB2 K% `5ߒ]wiElXt&>̷[THKi ʆ[1ߢEꏨXՈ `5ߢEXՈ `5ߢBꏨ*$V53@+fԐ?`5ߢEꏨhb=T| BBeEHs{Ц*d5J-Z I?k̢!"1bEd3F,\ӽ4%@գlvzXWLHTHUр 5+avfP!xMC)嚧M-B 3V(~F`P!Nunjxoٙ Lz*$жE&THS+O㝱  B\ hbmL=k5*iŎclHhP@;;_3*$ж^ІbHTHHBP nEBBFG8@ކF;KfB$v -fFg -&O]qP! {2iu6ڶS-5 fEBFTlZ$*$mP05mY $; vHB BgɡE1P5GHj_g摢bTH@$SfC[AP!am!h*$@ePuP"TH5hd3jm3*$d(ƀor@"hEڇ$E2TH ;MC-ӆ BI,Iʆ:9 I>[uu8Inm*$`e?U7i6f{YZlBBZ.ꌉ.кh#P!نR &EH\vZEKTH/21 *$Psǧ%R6hhAu/v-'ZM8xtĞhΣ!f~FGEGCP!z?5YіO&TDz"v4T!Q!4n>9?f!qGCplA e* 8h&6B6hBB]~,VOUBkFT{fK :ͭeX+Tf?Bfh(BB;hV;I!΄4UFhz*^~ɟva7"3u4,^0BBvЌr\rX\ăfN8BТ YoUȮZh UHTH@LA3딐&Bv֢B BTK)e;K{*d'ݹtPD2U!# BBsKA^ uTm-v4T!Q!LUn> dG6BB11ne%sWgBz-dn;@*dK}];2ޚBhBB.dWMTNw]H;.<@+dģXWԼ(/w$*5Ey诸x1N}MZhXY*$*$i]q =ΩI]!Gt4LR4:6y-=hvse%";[!ꃱQVt4T!Q!4;rr;sj2ݱk;f~ӫh#*$făf7HrjRDpЬ²StIHPpЬeZeiڤZ*$*$БQFC2,H*< qoK6Q6w@rs(6ЩhP!/;5ΐhcP!l.yjkˣ @2L#]" {u :X! uɗen*$@e%TH@s(xpi4NQ*ITH@}(m -@(m!*$@H/0͆vn?@T($6cTHjօBi*#Blw뱣t0*$` Oe7?ʶCƝ|P!uTvwP!8@uAB8[AP!Yr R(m#*$ ֞84eKR6B&;Y/GTHoá?B=(qۀqP!6,*鏸AP!.q }M@F(퀭[B] Fil`F,4J&GEрd5J;o2*$` o16k@Y HexY Lz*$cIi( S2:/;5605FYJR9%(\P#*$h@FeVi>P!AӋ^?qaP!.6$0L&I-E6fTHR3CG %M.iX%M! K||Dm 'ĐkFZ$*$4Z#(X@fҚ7BXT+V $Ow%R4 ێTH-u-TzQ$*$*deIOEyhĻ _tUqHҴ)2;m*z:E'JxRD$؋xOjݕUH)K5V+BF I+d{*|+.@o;R!.{.DDDڜϤB2 󭳐,d͎Yo]BB{SoB艬@[d-x-dg!mƨBn=+]HH|YI~ZolC B ne&u}V&_)Je[6^!kDOaE$k2i],iM+bFĒ4>’0ߚoQ!GTH,iu+(o|?BbU#3|BBbU#3| ?BXX[-tOBbU#3| BBy2;K ڴ-RD$ kaC̷[6fTHTHP!P!P!P!P!P!P!UHTHTHTHTHTHTHP!P!P!P!P!P!P!@@@@@@@T!P!P!P!P!P!P!@@@@@@@4BBBBBBB BBBBBBB *$*$*$*$*$*$BBBBBBB{gՕf,=>IzIg̜Ntә3v+;w F%[Ĩ V@TPl%qEd{uˣ6 ~:n֫_Y˫"$DH"$DH! B@ B@ "$DH! B@ "$ "$DH?:B!o! V SM R3"A#ו!v? CNoЧ4̥p7 <4 tdO 2'{jԠ9(ƌPh>1I=vS8'~doȜ2aԏd>/;[0R8}iQow[FF{XvdTp]Zvu82Bpby^܀C_OBs<`1sz?m{'}awɞ8F{'邏كww:T@4驧^37󺧞(mڦO=u:%wS`w$&X1dEH *a;޻zz)!B!8"$Gʆe<`8vtحA!BUr~ܼ4r֎>߆rδ; B!!)!~?DϿ-܄b݈/,I oB!Bo9-g}Mѯ}_}a1swn ? ~B!B}GH{-\("B!B+#dî&;_ݺw6x ŭߟSb07kJsc>)j˧. ̶\veib9㝝onV\6[_̏Sy~7n'/U+~vAWDgt+W/ioޒ8+2PDZ~O~јɘ:=TTԠ]cTT䈐B!jLII{[iK_1)]:ʵx?h)?\;`LiycF6_hA뷰h4}¶h,5ю3v1&.gtq HkuwT;^ihfCֽZT Wn>y $H*o*r*uA!{r׮]FO24~3?N^AQѩ70q(XXqC ˜9^ذ@J frړ;JtcOE˫|CmʪԐX4=,M|NGlbxO TK?r5W-ꯦ Dolhל G6/ Ҩ44G [`,a^Le'Ѻ ?O#DMC&+|4Aq?^3r3g *2܍n;xjyZrH-߅^ yǯe:c'z擌MmIjuFhОJ|וb.YO,5j+,kZezd2JNŤU61(o!?rcc VO6 S1 }l2*/xn|o|E$MbzT+LOTKˊ䍛V0མ3%DeNvgu+)qE'n:]=d6)o9RTvU cZŤÊk\K놗*z$$v0] &!-n.9}p$6 ɺ̃(aCG$"y;{#!!!BgϞ:ymM'+'ܶfgb aZ|OS +DSe^ ?7 Ň1hrhfLPyS{kNFc-kw0th5Q+gҔrktL0 v8cv3X4.S& XfS7%VU':03b8c#6heCYsƮWxtuu%|uukcN: #]Q}0!'l=T`u!G1vnMnk3)ubSu@OVj+;]j7{{`VT `%I*f¿IE#dFFÇo޼):I8?%+lcwj:gu?"cp&gu=署V]mqywo70۱F,\^QC ^m='Z̓.v*NXC5L@$679"$B!jkkM&g_|T?N_O~G}JsQ>/;oó5Cc g)6d(f,;mpZʞL eyk閱yX~`9t1bgV XW1LJ W ߁VTI[?ͮٗ4/LRC@;:ƒe }R33kF湣+r=W{[oQ.d<jX?Pϔ"RS|wСׯӔ3sqFq^QNֱ#zڭNf]XՓ[[H_[[TV ۭj\6iQ:&qQ\ş;xq7cDH!z3B۷GH28Qg>zu(?}Eߓ ~ T tVnPE4rk,L ɮ68n-eO?IoZJm@Jڲ0*}3O1e.ˆFfW p+yNWfU;ݙo.-*q:`ƖWga"KrSPYҊ&@+!߿OR|~݊c䛞T=?HfY8.RX-5&JlHrur2Q^y*zENӘ9+O^")BRa?xJovB!^ܿ8 ɿ_^}&$MxνLq3rV{juc{Vǰ4tTJW-:gFxVoc1ȷtEٹb-;=Fcl!o{s.huz= DfSTKO6[$iT*KrSiEy͂v|ѳXqHͮ\yN_UKiqNWYHȭ/GEigi xRu\mojj̚fl<5[, &CX2Pr]-NT."Ѭ;\^8gS2I8P`ҕ䤉ۍզ&`V;cY EG',[l)уH*N*l*o*r*uA!{55_Iso܄/Zta5yiIGJ: l⍩y[i~A\F%Mr'S̛2O#1I0)vFݽ`ƦTU9IUUc+fFІ~1S e9CY,M?"^H[7;_-fK+r_ebbH;ѺңPˏ"(fJ72QI~>J7o cawPЃ]\<@JYq7ڣgDGKdo.̕PJiRSd|y K僒lF THjD֟kٳz~\=WQS%l7Y>;6WE`X,jur%R3w6)f8-a|.oh$*`wzp$-9`S17A%--5L8Dg¾{DH!z3B)73+/:@9) fο竾4 Ɩ1[ y'ZLG2--W^6( ?H)Ku].z6Y܄Yl{M,+[~DC>o&_DH!z3B:tHDHugx?~_%MZ;'o_EťJm3Gv.6[).Er }IdwY)B?0b_}Ugg'mmmeAw|RRe? W7f]3,j%ybe"GBW#dFFͷGŧ+8~coe4'.,_boR۳86"$Ϗ`}I~S*r!{+WO*S$ec1bd;e[JqI8Kn"S#B|h'{c0{7#? IL%M֭[)l!!BiP:A2"\T0:(S|GH^")B>yܿ{7n8FH8~B%Ouȩf!BEȬ,rCKe` "?ȿhAVVȭ~u!'Yvd߅$:;;ȩf!BEl~9HF!<3mF,r[뽔M&9)))4t-6x[w8DiB!ދwUPp46'cg!(BVTT<jiq% «QYGa [eee⻐B!^wvsٳhiiyqGAAŶG4~WScؿv0LTTxB"l_o|ǣ#2}O@8ΤE~BCB!BDHj@!B!c n endstream endobj 524 0 obj << /Type /XObject /Subtype /Image /Width 1217 /Height 778 /BitsPerComponent 8 /ColorSpace /DeviceGray /Length 1859 /Filter /FlateDecode >> stream x | S endstream endobj 534 0 obj << /Length 2967 /Filter /FlateDecode >> stream xڽ]s۸=B} 5A֗:%K( 1ᇎ⸿ ʴNϘ `XBI6~޾٦K-nSdq\(qs4<6[YDwThF$@h׻; ~dڭ̣Ql+#vLcd$"4~۝ȋH0b"u xX푀/<d1 LDkdoGkdm-&SϺr 'L'FԚ?sm8S@RRW(Ǯ#a=]z&`o>)ZwpȬaRimx['zӶH#)|Jl豈 QZi&6ob%Ҵtr3?FnnW?Oudwg3R2V1l'dyi>ib'ti']oEp=> T`t << SG)5 M޶vtc 5Vd?Pr9paQ}՞Dar#Dw.ƱkvM7Wkwz]r+ŒiEݒX.JIBu4v~-09g=4 )dm=4@YX.C [Pa$ѥ @Zmmɸ&k~+E/1zⰕYyU uճw .cw/+b` oܰW.%D)8w7dN)P79jOBΜv\aL4}O#*Utwք,Ph %.pnÞZOgs [."6yz0-sIIL/W oIEK4"E1)U%X}u`ra4k^mOT3n\|N | @@UA׮^l8 o㑷CD%E虆R2 S1SpЋNbK*WJ4La3G _%z5Yaȁ@L3ϔ:ܽz$(p.-Jjl:8w2S[e{ kݠ;g=OU`;GGӷ.6V-BI 9\*ylX5\pLԏ |olN;K15Dv TLf%LEPC *{m  BpI Ӈ1C;jNj[gƖQ@l2)-:|D|zooe+YV-΢ٹR)GgU3sp+sE'ߛ]TmBT{e ;Ȏ 33e&   3rpѢXs\ I,t* _jœOC݅9t2e5yjŏ. )8 YMQto@\pQA4L|h%j6duXVT]&-E>]SNjE99VzLtM >2rv!F%YRxG+l"0,8 KSE ^XlF_?0YQ,xL5g m@%U#-_iřfoIn:ĸF׍j XqW02:Zfzyq&șY6A!t$NlK)^4ʷ*X5 S܌Lvœ0,i9r;w]ʕ ŢTMU΂ ӿhG 9Xaj8V"qd1ӯk?Ј8 U[z͑Y22[JuqaCE7w6Yb}>|"fD_5J]rwki&Ώ!KCƅxLna㇛O, # ϼ>S&S 3m̭k=g[MIE XIm[}Tl䄓Ʌa}=59$cqJ%;d\ 2-]Mf,RW} 9SJEoV%rN/HBJcq$D!=ͣJY_Ni2es-xhv8FzbſS( D_vn>>Uc`R1WK9ʔx+4aݍK|l1]mOզK$?|<#DsZNw*-5?ˎ|y:&WΧM9,s!d,@i#׵ endstream endobj 527 0 obj << /Type /XObject /Subtype /Image /Width 720 /Height 475 /BitsPerComponent 8 /ColorSpace /DeviceRGB /SMask 537 0 R /Length 26249 /Filter /FlateDecode >> stream x읉WWx (j֥^wm *w;* L}eS~̛ C(jt2L&>!CAyo7xt?Wu7:;PiA۬Ϟ=~<5߫iQ27;n~P:+inl[u?,Cm4kfRvY ot hhyf1G",#k P!6LЙnDt_DWfD|#,?CCC =1ә7| ],&}} %^:h?G}#3I/t>xo.G#`__$Hh?΋D,/t>xo~1%8+ʽoؾ믩K"`_$|CA|~ Wwj]ܺW|Cayz SLmSvmăƏ?ivoM 7l}_WHGt,NIar:VCG'X''}惃HAx:}]Gnn[Q>2_)߻5wWGP{vWd;<8fڳJ 7nhϾ՚k-|wl讗!0C&U+G2!p74j-^ a}$q͔oBUhOvbM~ZޚU=u:l[MTTk[>B}&|DC 7(Eh#xmnYt~=._ò ?X -|de{]=*i\`Ѻ_R6Βyyb)6pGay75\QTX*K6v7FCC]aWWl,: I@@:Mvo2ۋ>TI7M*-ś?ˉ{6X9]oXR\T/WTe;[]˞훊6~秓ziy-3R Y+`޶fOʯi>>si~Y}P-mP[Wgר]MsqOM3'i[ӥ [onnn7l޵1z4NglPB?nH&f)*Wظؽ.绛oV0c%4њ̼lԫ+,9hD~/Ũoy`C*[f)IF3|nGHEu~cړW"Yqr-v |Jfnv>yj0Ѷ]UFzHgd6[zmvҦ$I+[ .mqMaa<^MP.$Ֆd27ح7Z,TVս_n.4OxDIix;7STkuK6~%{R; noo8V5ZV-'q+K-X17s܂q}cf&Ӷ~u4^é ?&ߔ㶗y5? mqha]QIAW@YN/6Mx/Bv^8&Τ j6I׋n2,|uQ7l~WaayR+- JuKvjxE;&2} \:9Hp2͓6nRߐ/|}f|Qɖ;ܽ#G>xۦ&ߔ㶗 7}_wZ qwnG}c-,5~=i=j TQv^% 3{ |崛yo2mEMcҒdJ=Z?Q}CcP9\J,2cyH79Sݢ1 =wRhm?l/,{Z#_N|#n7|2Sm~dUHexS;)DÕdʷb98{ |aFo?ֳ ?ǭ3c%aaa{~u~ˤWTrg-36k Wkn]nD0v׋5z{Zu'~(No\\}x&TԪ 'm&1\v45fi_EKhoۢGc}r|c*0vIJeX=ѣ/BvRڱ/9v&=xoج^Z1<}_oLtk7]=F}^qMXKbQwNw⍿h5hn-3&Oׯ|gႼ\.`ѻkKǽ:U\o;gk.x{&'G\%ＷaG/c)UK\,)wCgh45fjQm4t5SQQDvQWO_*]Ii UJES7iqÁ *qNv,?3{ |f1v}SIIQa-ONjꑯ@/-K 6m$ e{?P\ecц}{zLd"Hs|#ƾj C}ѱpǞOhʱtnt}ѻvF3Zm훊7l/'5z! a_~-~G8ANv,Kh;7,fAדPgY< m&mԛv^{ -|A]YFV*godf3nG}#-_8{NyEt hvkx8'p2}#prffOVyEt AՙF&)GL%eC 6^'>- m&mY_f|Hk꬟?p;ג{@`0< m&mY_f|H05YG|#ӠD|#,?,&;|#CvF֗Y:7/z"pF3@suMG =vxz$}cAAt~F{۠Ӿo`Х{ Wa'yov:o| o|cz\NjYx^t/ #x=IKΜ:3._8VV&Dž_`vkzđCϞ HM?{&g xig(?1|vߗ4ȴce$  _ }Sb 6f~~/D'ofϜ:q"cj1G zDX9/V8ՖՋ/]ᾊ:D`;wEyy ~<|rer_._~T†OΔ}CZ[>xwѿޚ5sFμUǬ3tHsWEccCn߆5cּGl7'ge7?ESd:7?gVsin7gU)*my0?v&z>^]^I}ioA| 6b31~򐁁~|;m\ȭ?]\>:[1qq$xn]>=;ovYo[Z[ A׋J⿓F[Cj⛸uJJ[gI xqkڕ $ @~>ϫj{yټySggXN c吝7rumWpw#v6/YY( |#ɇZ[=5;:W07pű ~A73vIϘ̳L{" ŜI}cBg2 Ew-W+WQL?ﶭZ7w-zŞtqR_ 1|_7<^i~U*tӦMO%u*}|ݾk[#o,O֩6h$"w渖.>ܻOhFmL:yW5v M2}^XsЎY%'mŚzOdştsMܺv/ 1nIz="ݻ}㏿[Awy=O)M, f-۾[u9$o$jR[lḞѶ~xr |øCzd5"dE[7/bDPx{|RsMܾqjk]uÔo$xH8wʷp~p܏;6a pUF]N^Ѡ{fG9w27wo.W1JuUqt-WɮPMY^o\?4q~ kwÃυ+Mm< uO'ي]C}{qkέdH0"p9lNfnuZSsom5;lMXYC刄lkxdo\S{ʯ~,?_bmɇ'~c{K󸼂e?Qש: >84i/)}î]mS~ /m'dCkVgʅs/py=7/;sܥNI u]sWy+oOmć+P̜fס&ܔ+fPwnO:sMܫ 4Yn%ۭvn5 v[n8b fⴓDAak @FsXNä2S)wnBAr9H6jv,4Zx*lZYKVC8 5XN7|le޷|yWE xN^adfAa0G DV)[q|H[hJ+Av: U B a qd*(0a8k97hk |7< lG|CЉf!d,h#dV8a5" u5i3D/0&fq0"xnoPi`PqVHS'ѫ0AS$x!p&7xa$ 7aS޺zY=80>w:aダ~'Lr%Ҽ1'-$!` zmOt̩`:aJhkyl1o'o94G"`ZfS@7߀o 7o| 7߀o| 7o| 7o|7|κl]4?/`ɚM{~77n,֟nҙ͠z̖o^]_783vynnn[H~MLO߸vS?EHi%>I+-\^*sLi| nk9[uhk pԔ^b.@Ǹ]*:yՅҚi~_sJepzNC{gcw}qe{˪Wtu՞ۿ)~y=Ik~]jٜ^:T.Zu7vo|.^3rpK xIܡN+|>aSHKl}]"ݹ3%C7x;+W^f+ۥ?\mS~ /m'KW~e\^kK>=њŸ7 +X]ell ~=%1cƌvV'l2Ս~[6ߏ7R F0pʕ@ @[G q"ͻl[xSB!;YY@ƒwo7/.] ÒKȥt)2W$$!jodoP(L TFŋU޿PKSdZY&M%jj&ofRnvΌY\ZŎuͣ3_9ՆUssf漕huGK8s͢99ssWofZn\n8< ԧvֿЌMuLlH6fl+gX=HA" | F1*V(@ZQGg7zՏ?X..Ny7Ftv?7&Z2s%A|ܹs`pfXb1͖ʶ^F-ARX37~> EDbyMpcQ~mFBuJwW2LsgΜa!k#)gK aW̯2g#SDcuwJ# ~ӱz`.|j& xZJlY^Kf~|XPĝ.Q(澌o$A|2ϰh4Lb/ osk{ݪr [+iȔM=#he  i慳׽ Sd6͆57 6#Yjʁo&P(R#KwwwTDp|_тvE7H}h9q.n{˨=w Fs%*.tw帍8nKlƩi#%)O6AuBB5xm1%|B o7?zy,tuuQ%FtM]ZTyCըo(eͻK,zgBܚM;UpJ+'If4&[5v;Fߜ&8{VqqF Ě~* !FF󅖆6F-'> MF$:z㡏ԡORTLgg'NI{Swɷu.{ڮP4H+]SZB}}Z=]o-FYg%5R7D7'G@x?67^uf/&DB5oooϝ;S8O.ҋ?!A9r7(1c45߻dKK{|n}UǸw%Ifs ͍#wu4lw;ݜtW}mĔ)ՉʁodxӾ.++s:l؜lCL[Mm4R=wp9*P.'uG,JݬD]*[.HjZRyMjkiJ~k 6:yOnlU6>;?oGj椻T~MTEIj厘0dAAFJuBB5C߀o@qan0la kD=P/?qYުU%jkcn|w.?,r,Zj]Gl9q۔/ir KG.T`#IPݶՋ?ghw?ܜtW[忽ηLKd Չ᠚oߘ 7ikk h4===T-T3 o@JVU1ߠO쳭PE~ZfrY(U2 XM%|g_+*}Ǘy$"_J} EFv Lǫٗ}ﯖH6EK:87^o}93r濽-ܳ}ʙ1sµ߹o3wʭ#3W-7[x~c 7\hnN[~M(hW9RSS~##.Aul}44-ojj:qD{{{0oL#=ƛV:zcQk/GwEk3L~X?n0kSḅ׫~y7Ftv֏\rψCMA&KYY٣GU|:I; bxrbV( 71Gq(أMo7*G8DH I(ـo${(T(rd7C Ŭ輡tϖyo͜=/q}cBwE\ ${g~$W1kD7*V65FS|cBql·V(kR\Sf#ΠPc/( n7 `h;dÚS򍣳+u.iN:.7b2OfEu[Od5Aw33;|W_>k"gμ\-78myg Xwm 罕C-Y _|~ ހo`0 0q |V߿AGww{#d:h4|CԘLH$/|M8j555z67o{wP'x|>Ͱ)[f%HFľX.Fܙ!|0]|#rJ -#͸c]H6-gH˩NBL}c Hf"߸tR8\B.NMi`%! U |FŋU޿PKSdZY&M%jj&o7 y8< ԧvֿЌMuLlH6fl+gX=HA" |#C|.^3rpK5\7Ν c5l gE/pWچ5TR1Hk)V'l2Ս~[6~^ z}# 9s9^߹F]il文sQT3aF E.7{xQYYgXh4L^1ƬŒC޹[Ӛx5+CMO5@3T4CS6AB5ߘP`7ӧ~D```!dtڽ[’\`h^-3V6'<$/pWچ57 6#Yjʁo.7g9s4K?g[+v|=oYk|cݲEf̘9oBc;,37wi*ЩS&&1L6Xb 7\_߰f%QG/7Z;Ѫ NR]-u3/T-T3T9On1b25)T=99T68ӆoLfuxt~cWHpy7Ftv֏7Oɓ'~zK1KitZ1=b^^xOni=U՚Mw ubs orR_(VˮجݐoucQ~GB5<S'N|}.G ӌP<";&EcJe! knI $ޕAaZ[ M U |M|ɢ }\x =x+u(<ɦ7Y|.wtg]$uj|ewһ2%Rs֗TYUdj775|ʬ/( n77¡#G\. 4F꬈Qq:dKT_sy’$l&],H907Nn7 U|߸{}gSiísf~22OfEu[Od5y7eeeN YW!=#FtMUVj2a櫅\/[TZ:ߕZC S 2R a/NsG?^a Xwm 罕ș-Y _8|n7 L6ذ5B*sU&p)na[/'orM/r,Z/ܕa -K:YA5@JqAͦ7aClX"u@I[[d XF!ߠjo7 %(--Z:}emއɓ6-wdk`ANPP7o(JZt2EK+E>dS2N6Ulo7 y苄O47CYy˕Cv*ꄪj*}#F@ra\w>E~Zfr7f!d`&}_ntKl~+ )Uf7A20_ ?~}jW[KdS1D .8~ ovȑ#55572~T7AC򦦦'N|A$Iߠ>#556>|,eee= CT9  H# E"}}$$ Nl7L+M߀o @o|A| ||A롷}`RVao7AR TCө_[{mSWS A}k-fs8D"}"pXӉ7$¡Ak|d  HaZz xhqGr،'vd!qM,{de ݤ:k =|A$i߰Ywb.K@65yQ?<]VO(o7AR{wMtF솜p"$GƗJB jo7AR{-,O.r zGlL %q5 |j@I7j`t4}6b8@6"C˒3l胪j@I70p>ҎtC6Y,wXsKzM]RP7 )F]mm $:A fZTC=uHReG*^YeI򱥥CϳPm1ۤfnj@I7ܯ NQ6΅u4bcXXO3 \枖setI>椫>v(CRc/!ߠo7AR%oHNV NJyi` cBaT7f A|As:ةhb1)C萖d4Oʕa+n[]n7x~&XMʤ+qeM<&)8cQ7 )FÃooEoJ!0zn[ 2w,=tn@IWx崲Y toP7 )Fc}=FttLCeb?HSF{-I+~/< -Mzp?ͷRXχn7ʪAsc\mҕs Hzvf.i0ӡĠylI`|#b20j!ozTV?Je*{lMGlh+˚MB j!ߠjo7AR򍇍ԃ\1)OEYreyp?S*qMrIWNXCˇ>!Z"pըT3  HJxORn_{aKlɀ|QJn>:<{Jy V+W*"iknũEaoP7 &- t#}csok{ԭO:[‹5v^/WihiꍽCF{Y6zīW*X#f+ڏOr:lD`xf A|QC7(s٠ѲCJe顲׶"^ZG~\wrZ:v\f彏n^9[Q~!j*:]͔xkkA3$01oT3  HJvm_Mp$u:z 4^p\?=.˘Wju#lCC[nh5蹰;6h{Yٔ76|A$%hyr`'FܘFrLD֗<|0Öc4`RP7 )Fǂo$A2*$8V6 Ѧge@!N-)T3  HJtF}C~]&*}exL94b - G6xq7N|A$5hm~z(bd1&2#ϛb4[ſ_E5߀o $vYTm4lπZd Қ 6tY=_ J`<팄 Ad} ^tG1f|1 N  A$}xnPHF[,p7 I@(D$Cp*F6 AoFo7o߀o 7| @| z|۾0)vQ7 )CT߯s6hx\  Hrڵ]]M9G">H8,LDdTPȠ5>x`2BA|A$I߰[-Muuz<4q\l &=2nRچz^|A$y߰Ywb.K@65yQ?<]VO(o7AR{wMtF솜3^4񥒐FBZf A}}bu=K.u3vTCHCtZLX07Zf A|: FG3gho#n_d#8ı,y;c>Zf A|~M #H7d葧{Ě[Kglj@I7jku%ѡ nH7l6ʦdiHiii 3ֲlfu].|A$%xp6;E:шbab=Qְ{$$@jq1toP7 )F}} W 7N'|d~HR9o{!R!ߠo7ARu>`l iCZ0`Igj1+O+?DWv_ec"/kQ7I9~j@I7<|NG}#.R6TľA3Noph?i:<|g,t:7f A||#:A!2f^4i`Y$+r$xS7Ltl=2cjʰ#&ʲfS&*ji7AR􍦆6JgylPOdbмpS$-4L@R)dCKTV ?sd7ʲfS0ۭ |A$%xH=elC&C>ƤR*=%&Z<5,.d!K<><<5|Cn}j@I7IحbG@^f q12eg*; ezxo}Vyexx0sknũEaoP7 &- t􁝌czQsJsKG`t6߭T?1hڻzAVw+s{lD`xf A|QC7(s٠`$WN.-=T~jwo7o;vTyh'A!CkkA3$01oT3  HJvm_MxI$a2z z|nWj5D̦nQP7 )FˣG.};Y74l#IJ@6_) ["uД ]2JB5߀o  !~p^_&z aȢ8'Q^4[h0D8ToP7 )Ɠ v!}5NcTH4b - G6xq7N|A$5hm~릏 hj>| oH$ @2bd@do|A  |7  A7 7|^,<b] | ox=N;oΎv߀o $.]T_o1p$TLND&I% :]&co(o7A T_k0x^CS;f< kbq#+&Չ^m7A {' zZx\.6r:l^dXs#aA|A$%ߨw7]Dgn ?L8Z_* i$j@I7'VسD?R7cO:D9L%q5 |j@I7j`t4}6b8@6"C˒3l胪j@I70p>ҎtC6yG%tƦ.HZf A|6PWʠtfYl*@!2Ξ:~pi#g/߬kdLֲlfu].|A$%xp6;E:шbab=Q{t&]4?08lp?2T+-Ԡ˔*Z\jw{L8e<T3  HJQ_w|DC ,!$}^t]O*KicBaT7f A|As:ةhb1)C萖'q17Oʕa+n.T*=T^qYQ*x^*eylW*h3-;TZ,=|䅪LeM<&)8cQ7 )FÃooEFTT^ K]i:!Pu` kJe?ffu ]ZTy=<v??044K*-Cʣff7IA5߀o  2 1"M>T$_! )=FBޤW* |AY}xyc#Cƈ/+K&Z\s]Ty1<2EO&&ڶZTّӭfS&*ji7AR􍦆6p%ΦD& 7eK i#ƄƨRY9<+gc.b7V*;] i]Y,7Z%J; GxcS&Rypx8^Plh+˚MB j!ߠjo7AR򍇍ԃ\1)o21iX%d nġgx)aHq|xx7ʦahj:d(S 9FmK0>yzClrWA5߀o M^$EVi4ΧL>e! l>6ǎRyexxP<,K7|{^TVi u)qb쒴5@"^7f A|axA>G=:YG\}t顳ս/jcw^}O{ÕC:#-ʊ 𰯷ثP*+'h mӛɾ!Ѳ:ox<|A$%xM!Ft\kF6Bl$feQOUCe'*/\mE4C*;M5߀o =n&Ux 5RC]O L>E HĿdzNk DN.#M# GdKьQ$}0MOE,3&RRFB5߀o -\.d=܈ȸQWJirɔ3|0Öc4`RP7 )Fǂo$A22*@=^F! 4ĩE<|j@I7ΨooDʑ0ӈ50+^Ł/ p:f A|UE &;x$7<ϾҜj@I7ڞ:vVYG%腣KLADXx릏 hj>| oH$ @2bd@do|A  |7  A7 ߀o 7o7A@o| ||A A   Ao7A7 ߀o 7|@|   ||A  |7  Ao7A߀o @o|A| |Fd(| o7|o7| 7߀o 7o| 7߀o| 7o| 7o| 7o| o| o7|o7| 7| 7߀o 7o| 7߀o| 7o| 7o`:@28vp =],kIY]N-y X&qDAJ4!&#Ùq8/P]{}*~=[}cxpbˏ枮>yL!R>~twpC7k&By Ϟ_e B!!BBoB!7!B B}B!A!!BBoB!A!B B}B! B!!BBoB~+6nP?Ww5! B40]1ܴ7ym6,FOfl!APVc+thms>[Y젨 ك]/֑v= 900:40`*! B v*NYs䑃GN#&'gl.'O'?)%(?q5Ο;y\ td+GdGYPjb:^ 8q!v<-u%l:0մ_Јv6M9&vڊahEڨ#eXWĉ6 cjth &Fu1Q@~!AƷRav4ey&M=#[Ad>l.,'j‹HH#jx4G(s6qqө^*9*4!A(A}y {g?L ;٘9u(sa>c!S.چtlzĈ[oU/pv{9$y۫nvLϡLQ&{5;'kǏڅ:h5BLWB d}辤3U,d.cJ ܦuhӵA緾O-(j{=So}mp9$KGnrӭnAl֣/A<@ DfLǘ=z$'ktx`Y(PI A<ƑĩF1/ 6qqV[o]*/hgpzOqqv Q1q`$ )FҤ&K4{NWѣGv^3jwԸ^mB!4CnF }M9j BNi w]KLֻ]ݮ]jZvR]UJ>팖?@0ޕh ='a8hL_mʠkVצ%7qj2ެjOU;5ޑ*{T@(ohFД9~q"=/.^jS|l DH}2 Ḅo4f$LP pT74*ULvw*w:T*U|=F?j@OoqDVò${˾+5ۢoLC7E=Gת9';*eU"| 42gMMM6M.ȉ^9őjmG/0[]6y;wܻw%Vr@I A~(=nDnXfT%;+$gEBvcT$9*I|z^6$7՗GVUF>^H;]bTYfHb"lt);C K7Do~dtV/Z:.6J;JHC(1)KӐ35aM9*oTt ߙVo pe RoLWB d|ѐ;]v*E,)|L(K%8ʁVِx}}M9`~?ڥrx}ctIW7 >M.7w ƇqU*bpP[w^P {5! B7Lˇo8v;ʜo[VEYDX^s@ۥ/r%_gvڮdt{~`iPnso͟Nmk/2[,7ZR`׆Ԑ 27O0펞6]Y)nR81Y8Vc*%^ ٿ&'0 hzO{|EN+ʓhA`+ޮ(RQBNpXO+8(XNE(s6a24a R~,}Lf*Si>_+T*ǵ0sre?lfS6āP ʤoB dp95)#2lsvAaDQ(rkaDo«%0 iq*r}C;]ˌJ&t)F7}dH~0("71f+(i6R(OtU&@7걱wbvz====jh#˕׺_S嫒 *ZG msZK~pVenhfl7`(޽{(e77p:#Dʆ[Gnٵ`zzLZ/em9" $*OݫJ˸9BhXOƝ(eXWh4>yΝ;~etuuuvvv9|uL /}x1=䝠qRi-\Eґy3E @{萏l^QQ&}!,N&T4&0ySuZWc>|E^M؅WD>4rfoR9T:^ IE((..wދc\gWP {5! B7\%vCâ❔q;)1<"j$SUeoCEvFe2D~FQQݻwoO[ho<#𹟢=D( 7C(^o)|C<~p#b"?B}V} W_>] w`{ >GB8MT$FAAaOi/1}}C կA5P&}!ِrh7Jb`mQxCE' V Z$>TE6)EQ})p9kkk/\ ?!~wş2}Vڈe(uu&>A}yau]2̎+M'wIX2vt]l^ΎVG|le -Ч0~jBr\NǵjLɏ\FR'Nj\ikyCh4^~}6WB dn鰻].F,W^ B}B! B!7!BBoB!A!B B}B!A!!B``0 % endstream endobj 537 0 obj << /Type /XObject /Subtype /Image /Width 720 /Height 475 /BitsPerComponent 8 /ColorSpace /DeviceGray /Length 687 /Filter /FlateDecode >> stream x! Q4 endstream endobj 546 0 obj << /Length 1856 /Filter /FlateDecode >> stream xڵXr8)x[v sKlUv2>lMj$R!H'~Fe+lj@~H=deU2KVu&MɌYwz*S pCK>6io*/w7Wo>pf}&JL2 HW6?y\)T͗fڬ$XuaDZ5\$7"aB$˧kaK}.+i*i/~ߜ\.ֈ`\X5o‡PzrcB2JԌCD_[_KUޏÁ><pͧ_?a$=H\iXR0m48SnH%NyfRK>փ^Jv\?ÝF<ڀܨOYOp0Gwmv-2%fK-7/ޑKGI ivrC[bomf%(Eu΃0C8xk=*wô#ִwüB'OkQ;_vuɢzm0E=PS<s=N_2n|7{1v1z}i:%\R UN!L 4 ʅʯwZ7Sq=GlO܏ 儖4jbF)xVt!ME^CbvDH d}|{\{JU Ɇd|شiwB[K1 %͒a@FTУCtԡm"X< CB@^"=?35r:D @;2~!YVfMe ŷiL&7;KBŀ!n=\rYt_ (<MGO!HU'CNEҤ"j+$(RR"aθFqKLQq %'goC1-E]gIݿ>eb0y&[Zk-%\dA/5R|7E-m + 2µ ,6=ۡnkǀ" 8ƣ'W8]P}B,ʤ/1p.ҢȜV϶4 " ˡ#&O;qhޅ".׬-7N=}SI50N(Ë;<,#lL*L6L7xy3RoαeQ#< w6-i5Ӭ*\`^6LAB'7.L%ƕ (L3P.Y !3nYL+ԫZd Zo{ ny@pĉZ* xȍc't@s8"+zKƵa‹"DlH&(@vqs]nBOax"8i#@UDs^@L]5k&EULx:{l+LxKmɾCO|#5@kOCSHҌVW5ui8(Dx\kHZF" #@"+Dġ=TS\B XYVRI%n`b`ʘt8BDߖ_.WU-T&REuCRwCؙ!FP>`N> stream x[SW)|933I%rOBhQG,iǂgh^NOmu)EguN)Xڃ ZZk\@!.IvB^[{^kZX6#AA,q`a A A U{Xk*,v :z*#JX V]޻ֶrkMo{k_/~5 ,L(_{Cî1?;ΆBɈp(33<611q?:GGXZ,84NL5~ 0s5S? El_aa j[DKK xLqͧvF`"Qe??3J&Ug᪪pƿhOا1Ov<:1ۼtxXVV&0A: ⲌbVՔh14,L`abuf,|cK7^Z"~o='5oT1 O5<+b}}cO4,L`abb-bP]^î L22\jժNr59K!ځv Ȳg*__Q[2ʰ\Fc2W[&b|*}ra,1J&14 \Ã=]-HEgN,:;O^b˼%F㉍O8fUc" w~'{ʠ ++5fIwlK)>6:c ?GZiXZxڕwDNDK³$m΍ݮ? ͰW?aޘX\.LZxJӡ{ S?hJ&V{E㫎_ٿu xFHvN^`R Nݫƙ|Fw<Õ;FŐx'yV5yuF&mg˶hEjxwym`?Yd,|j_Fߏxlo~k[_e|<6U]QcݸPgߛ9)Ijz Ϳ^{lraVh<Ϩ=}=9J&VD^}kotgt'&ezҰ0 bqblYWX 'LZ?zjn&{b1wR}QGpfa4,L`aX- /Xϼ^OLJvJ.{:tfa}~ǣ ,LU/֖=gC3=iđxrz21:XZxrZk~ZiX,}+:Ⲍ {dvpX $s=^+m2&1,L`aX5v8}_K/%_ {pb3S#îG޵jjz0 bX8{*q֜ķoz=u`a ptA@|>bv(M^6N&nabMm A&  A&  A&  A& ,LA& `[  FGX_V0`-Yj , X KoAXz ?8Gaa}=4X`i,šCN-'snA)6x6H8^ʫR3q!m!S zfmd_, X ^_ҁNU-|o?μiqڿca, X8î^/o|hhv?zoךX`,|r |QGKs ΕˡS|f:a?$jv 9sgNs': Z6߯i=iaM}/,Z,vE-wRCѡpoOoG]>FN,󾤴  [7?&蔴viF>Yϑ3^ֹ#ep(}pl,#Y':#0`a, X caXJ!Q&}_;QYj1XV]%][8u|Q3VX  DZ0v ;vl : ӛ]Wj{kE=cuA߰}<ie,X9iQhV-kX c%#˧g-٬6o;pR{0}ź-0 ^yE+6φyS)2PmwWs"&, 7otC>׏M;n9jpodbb^Ej3nb4 "1uE)ꏅ:ȬkZ)N_a1[~Rə#ݶmCMcGL[wdUuQIbwNTXi"y#pM\Y0#&ᜣ(BT -0^Wgُ)6Dxmk>aV٧|y^wCPL-G'BaS|"_|au܁Q-Nw lHCW噷:-<ϮqMzOU䔵[ZYp[kvLQ~]߈? >~9,a w5ՖmRVԥu[m <݅&mw};KmU \YIGfq$5(KuvZLM%=zNDKQ09+?rD8.r|9Zų0^fW`xUwC}9+z~w׏)OppQ# JpSk \~S[ 6b޲@;K6o?X`00`aX € ca, Xxڂ.,Z,˺ ^z ǚ`%p\:w^‹ttżpΏ1^ `D 0sxV]EYL).zp>-:=0ι3튽)k ' MXx-z.7EʬGTe=όp.w)b, WӒ¶ڳzܪ_X d !-,-NF,U\ ;DuPHcfJLA>|"s3hݜ4ԥmN g|, XplT9cS4K%m{ U+j EK`c "jچggaplagr3 84߃b1Vu_w[u5<; o>,c m9;ߴ9>[c7pߌʤonLfu5<; o>,/ُ)6Dxmk>aVoW#P$<^HI)ei/vpq>-GX;݁"]hggap|rՠ9|%ѯkn7 isg?z2 U('kڧI >~HYѶB-t5ՖmRVԥ]N,XpHHV, , X ca, ,T0/0`ap!X ca%p<X`-̌4eaf0X. `y-V`Ye9:`af0,yډRɠO] kHhXx2狢:o>2u,WdP$"3Vj}w5`a,Z,tqQK[a ,sgaokCMyY14zS;bV_b4>xr]EfET\^}3w_RG:-:>JՁ]%Q1mZ~wd]xYguxTMeYE3o-;CpWb>lsC~upHP(06do|Zzn)Y%`Ο]`({;>u_ڮ󗉶#Zz<:; m '#*U\UZR1XV\ %& RAzY)&] ,*,V*✱)R8[_Q=ߪ5ˀ"楴pV"jڮu^KeQE|)J=hn.c廞xQsWu^n3͙5݉-FO-ȾtbYX8i]]3,-S'm|¬??ʁۻGH(y-G'Baˏw{"_|a[Ec]3,-[.SԂ=/$L3ucm&A1m.GO6\~qwjDyMCHa1+ڶ_\MNYY8k«K,0Xx1,S ca,te:+¼x66l ca0X , `a, X0, 0`aX0]Ԧy_;QYj1}Y!,, /RŨp(c,H.cY,WXוڽFc+V+Ef:Ը.,Wߞ..[1GXLLkHM*A$פ 5Ef\T^MtZ}`|u%eSqyVϜ[}I5i봰HVwK#3 WϓG_(/-dR y:ɽO-hk;B{upgL]U?m$f{TMeYE3o-;Ӱ0`5k:|n[qUJoz|P`l>Sj6?~YggRBէ^'b^筧Ș?3y"m6o"{$w9ZvLod)B;hrxtv,e%pG*W*QimR)},Y~Q:-\ ^͜us!ZDKXJjz9Ẻ4, Xx퍅KEuS&[_Q=ߪ5K"%p ̽"y "Ʃ{M'ʶd&]w,,3SAsCu+ċQHedy9kdKyS} &Fda = HTM[};f)}[N ͸:LfN1#=o=uZHdd^ħNמ#cD=pۚOc[U9~{? >xrt" x6<7-RN_ =·Z8Kc;pw6Zڡ8Sa>5i6鯊vkCYYXaak‘=A-sBK2_7ܖo2<dlwQO4O;RbVm;P G"]Me[6u,$μiӿ]hvW-O#p_fQ,-Ӱ0`UgUr ca, c5lJX0^, X ,0`aX0`a,0€ cᘅ7Z+8:`a, + 8Jp5xWC7dz?㕥UY>EVKaQ*O}3?}IElZ8/JqSfo z} oO[AXXO  Gף>} )9-J=Ԗ[D2Xә۟m_gWM"ծ+{ ƂW%)gTYZiO8$ݢ@&>0^ X7i1\ rZ *<BbQͬgKý{ Nʡ ͝=n'mՆm/ \WߑXxY8)-(Ҝ91PS^dVE5 NدW O?{)g\WQYQ6W_h9ݗTfN ?#H]xvIn)TZ;?5YJkba,i,|^|lSmHc;U7۴Qmk>*u]-\// ۧ{J-=B~O7쓵-%/4X}L<-K>:&ȫxD-]O׊-N=&MQvDX /Awa'a`H̜ɈeJ+qW%5+Ef:czlg&v실k^ۍ-P0Cd C"Dʎvۖ8S5e%5ϐl,1ohE;˫j_FL1 Y w)6?wۚJ]Wz ׋4~? cC)MRK߶:E=;>>:UՅXCvL܉qyǃ1I/&S}#rt1Es,ba[fZRX8 wTr%՚&"MDzj(1z~L^ ^͜u5y2Y-RκӰ0`e)SYKET&[_Q=ߪ5K"%ޱĽUe ͊R7DwW6fda = Lnau{P],w=p3uY[b)ojĨ3 &7-űw,,f3#mz|4z7miDDm:-72)ꛛ9ՌH|HdD[y!zژw,,S'm|¬??ʁۻGH(yǏHI)ei/vpq>-GX;݁"]yU䔵[j0s״ݩێ)я֏hcFiXp$npxOjP Вx׍ Ŵx3=p݅A5 W\?wbŬh w?|qDj˶m)mYHp_fQᛧФU[ L Xx XxơW3W9!,})>0^?̎|UEr /ݞH*ZLd+gqP5Դx Mx{ڪp",}P8}OHi|U"i: AŒl:lIʇ+{ ƂWW_/Sei=9*p3/",3 "g>OR0moOeP"of5?dGXLLkHM=eTn?zڰmV kHal)G̉ֆ"b.*ihw:~rh0o}K >床͊Bgqﾤ4uZ8u7E HVwKqS2%S_Mt2,2E?Ն:>ӻf6PmU+EB!{9zOo\Pf}O =uEyDWDӛ"SOfG[GVlit">>0^2 ~ONKŭr9pG*WحJTkZ W4YruƜ"٤LIdK[<`|yѓHٱnےg/9ZO)뺎'7_'ooؼA>0iQLwڦ=jyQZ̜/uV}W_mķjERy -Oqy霬p3Cfy}#`hqP=\`t%Wdwq ܱpv&:gsFi b|/ ?5NO}R8= LR4AOOE.LB'O8/ [8T+y&RS'm|¬??ʁۻGH(y-G'BaSy"_|a[: 7qHGbitFT?>V3G&a?R]yqGy -0yp4nHp9-)P jZ.|=珞mB K;RbVm;T osЙ]Me[6M],Qy/,i m1*'>q@, XxE哲j|6OԸOJYΚoGsȜb| X /1PXrH5buf=:'\s^`88(ϑXxxFŞuJM{*n,;zvp{qOv!,plUJkW 6l caX ca, `a,0, 0X0X cųAQ pFrW)s8_1}Hm `i/9dbڼKRh,[{RdsJX0^Es߼7 \?6픒i*Ký{ _VD‹P,,ֆ"b.*ihw:~rh0o}K > ml*.IS!+(R'_:b6*[ˏNؚ:?;j*J,j!/kٌ cK]uxݶRו"Bؐ}Jm.(wtNQϦ{b8uDkVW3 A*Q^mCw<ѺɨXpZRX8 wTr%՚A"MDzj(1zpJ-kN#Opnӄ& iᬛ " !psHiZo՗J~E@|V,7l23}X8Xxf¸YX0`a,[ؙ\F )XzEW[}=z*,v>O4 Y9fyU=EBAeo?:<D^R)og/۬+oWGX;݁"]ӣ z ?𤆣vh}ճ-[.SԂ=/$RGn=-d0(;y؆/.T (ih&)#;,fEVcO}|rӴj-ےKgtY8UócaZZxձ`H`aX-D-wLH۱0K5YX ,ew`JN%, hz0`a f0`aEyaor0<=y ,XP`xF;zu XL OI k, s4`aEpYO ΁yGb, X`,ִ~,WǼ}rhoϝyz|yamx<0?9>w]'Fz\; W׋}}s;aР]g=X#b&5}_~qGsVg9?>r  `D ,ŷ~7KϝՖ;}ߊ , xNksxV]EYL).zp>-:=03튽)k ' MXx-z.7EʬGTe=όp.w)b, WӒ¶ڳzܪ_X d !-0/XlذNX € ca, X ,0X0`a, 0€ cEŐBLxeEUrQ;ZY&>uqwfS]mRZyCXxae, R ^7狢:o>2u?iRUNZUXxuX8p뀈Ίu][`4쭽(Vljh)2PmwWs"&, *Ez+Ký{ ϸ9lA$Mi-g, ptokCMyY14zS;bV_b4>xr]EfET\^}3w_RG:-(RXORu`WlT yyŝ3Y?$5twNTX¹kX8 w)6?wۚJ]Wz ׋4~? cC)MRK߶:E=;>>:U -ٞ A*Q^=h =.x0ǣ7KbFZ}}<67 `gzڜ^-_c^&[pZ]ćpZRX8 wTr%՚#Ri5V\q 5 QSlהZ87sdK[6ԥZHo$ҙŶ)\[8H֥My7ۇ}phbԹHN"k0™Ȯ4g&bLe-1K{MuZoYeR77s煳윕Qo$R.V")h0FvcD=pۚOc[U9~{? > rt" x6<7-RN_ =·Z8Kc;pw6ZڡdyR^sVޘyTa>5i6鯊vkCY˹nQX8E=A-sBK'_7ܖo2<dlwQO4O;RbVm;P G"]Me[6u,$ ꇬ7~ymnyT#7O~wI]u3`a,Zj /R|Q3VX  #]Ʋ*p *$ҷRdsJ,Wߞ..ʠb/}+ "ap,mm)/2+Vo}S+wXc֧^(٬(˫/zwKH_S'_:b6*[ˏݒMɺ"JΩʲgZvVg`um:|n[qUJoz|P`l>xs)m ]?ݬSԳJh)y?HO? k{}P8wv|T%뾴]/mFNqxtv^NF,U\ ;D5NHcfJLA~!S43y9M"uiB!XxUX8-IT9cS4qK%m{ U+jEKi&EԴ]3,-`Nߙ\=/Ei b|/~*TY8m9Ӱ;ߴ9>[cU, g5#+pFס#cD=pۚOc[U9~{? >3~D(8S5e%5ϐl,1ohE;˫j_FL1 Y w)6?wۚJ]Wz ׋4~? cC)MRK߶:E=;>>:UՅXCvL܉qyǃ1I/&S}#rt1Es,bakᴤp2bRJU%5M*Ee5Pb":,@7)9Ek)d<[k-uaa+¥"z*MkRɯ|oՊBXXXx^ɪmfd)ٛŒe"ɻ+m3Nמw&:ÀsJ=hn.c廞xQuW8麬-y7ۇ}phbԙŒDw̛X; ^{n3͙6=>a=4"bwRXquV͜jFZ$>[$2ό-bl=m; ^{؏)6Dxmk>aVoW#P$oб(5lc$*S"R]e*Z(( R #I&pWIr ſv\{mR~vXvoUi#x15a^_dߩK2nG>pR8ܼX06kX,!`QO%8eOwXn.`qŷZ:ӎvca,fcfչIQsµܚ-<xƧ{1JF2u)|7ۑΩ޼ɢU4m=]ƖN#]H__By泌Z6r6 +"v -X[2&_Bvlƒ: mܩҦ4zt %iZFKŜxaY_cӷƮ^9ƶwxs$EZb, m.v -|%4m{;PNYxP`½ҼK4J?cW;'8_8=rukJ;#:9g-n^VE|bYZz%ၴ&d֢kcV ѨC`N#`6|`a , ƭ?0, |t܁*£caPꫯpaa0, aa0, aa0, aa0, e /CNX -MnGhcE?,, pb6j [:eajuز> K~kaaǽ{ۣߝXeDFx2ss2 ɯaom:4 GX`ᱷp /S5m%n`Q}7ZA9@rBM@̨,]l7.RڈI)&',\vp_s ׅ1R˘ىf/uXyr´ASm55Қb6I*jԿi3Xl=6̅M ijkjo7_Ƙp׍^䞚PU~^K5 ++˷,)L[1>^dL ,QX9L,rEzpYxcJ-m, xp{3dH~3YQ,C"]bomHƚaaǭ3k`_O.6 6oe!5:UWS¶6+:poNjo:,=VsJ,|şmۺ;[j`aǛ3Ƣ .?0va(}y.%*4 4*K½=$^=1～[7GRi&F,Pؾ? , 0,쓦U/޵%?\}m* -<:SxK™aAL 55?, kX`aX `aX `aXQ[+ 97n#|ك6£oa><%3t YXVx,1 ~煕;u«nF R JdA}JXxDa XoV$x, *, C b/PXxt\ #`1g  4JQX0~ _}N, 0, , X`aXX0°0, 0, `aaaX`aXxwC&/%, Wi=yj5t Ce-o6Y{l޲EJX`֛1))e)_r tn0-2"#9WutuuT凰䷣Z?c=#pXX rp'?9:BFD'1xٷbj¼:xE=qTA[]Fz[E#XTkߍ%,yP޿#)fZ0}f: wjKNejzXѧhnhtw[ڞ]ߣdu:tvb~Y$}c;( o f[w͢$:dY!hj3tz5 `>baO kXRmILSA kvr-T/~TƘp׍Tr/pr0\702`M c |:r3u K-hҡTȘv,}.<1‡faXe`@JF2u)|=faEˇ0,e.fϣ5eloײي?Lo;+Eqx0W>4 +/°ոSM+iutJҴ5\ 9Sm-^O{ҧ#!,fѷl@ 6oe!5:UWS¶6+:z)|hV^>, aa+ۼ4L [95{)sU#/_}?_QaIƟ3+ߓd-n^VE|C-\JTh@@hTʹ   `a|d\} `aX:, #bW/#&&, `aWXnZZ|:Q8#rfN , `aJk;. `a YXH-xJ, |`f  ȇFAXAA`aAA`aA,A 2Adt`e `aX9[xyķCX5\w1rw:dVΘ:UEP4#i8kY&M𛬊?45 a~=QilEu„ CX5Իgt A w nm fCQ0Nzzzfƪg/ۺÿ,HJI[.?`᱃v<<Gz<2v3 !º 6o5U VvҼ)Kʾ9[NzdbGуNO{ EMz޺[:w;Ig]p=c=\iv98T5o¤EƤ]78uh{t(<멡K8*' ^3?L$ ~SCTyPҢ`5?Y/Ctw G.MN:ߓ-L'e Q^ 1 #Mz"B3?)DGlLH +j&!j{ ]A7_lK5*p'o n)vWӞaGnֿlW&vy]&%XlvwZ-,}vğ)(y.ܑwzǪq{_0,757 eLV56󛲃~N}fn.Ϝ$}{εalYw SD?T^mza5=<#}o#n8uˏ;`aW{QֽB{5eJ,<`Xʦ(ZRY9MX_\~SJ/{ h* ;!7o *CrwX šii0^ODCc! 7qX>ɹ?W_P=Z9f~K==+ » Bؠ-,*\. [h"/om/ 6Oֵ/UY;vVꛉ͑Bx8U.vJpoAPܝVoBafߺXXآ'yyظb-lfP46q]i?v;n}x@JSWׅC=j,fݭൾVqIR?}_٭¡ ,|]-+~ftw!Mp|/\$<*O7 yp)I &?POJކ|L'L6G/j~z$ ߔi3jpֶF'L&mïO4aߤй++&-6OjVwg>=&-6y"=1=)*d?*d7ߠh[my&NQψv=^;nhߪJ]ĉ߄,/RP|qZZ $:}i#Ht=>],7U3%sJuץڛ<\{#0 m\(Ԟ=bNrn{x縊}`{mRlⰩ"|ʤb}K.zr{6 x߇n7wr?f4LgA`a ۻs!9RrrWW.Zn9BQҳ޳Kz 6ZH'PT _pd2ɆuTmKK _̫5MR0 #8 M:ήˉ]E;,'ˢtR$?~ Uq|h~G%>fmN* 2Xg4UtT;jwMZ+@L_gA`a ٝdGh]adB1rIsˎ )Nc7;b'{,I[0j4Kqy:0/A62( #0 ޙh#Ķd4r΂[[y\ZJ?$\k~SNif1"> #`8$S${ i:bKe*3g ||Lol6Q{3ϟvi#υjOf1"Pꅳg'u\x6!hɚ5&i0Qft|'wPTɗwhSNq J”Ry%{aZ*`%kvf^mnG(C'R-Le`aFq`;Z/G2NosFsszszS\)yU%pIG]0iO\LK—D,|֥]qG Yv/>fGkׯ Z?4 a>Q|AlҨ@*Sz=ɓ'IR*_/2ڋ/d7J8=z6=ŋQtw@^R-Le< #[XzPgJ.ubG5fQĶBJ%-Oɿn÷}Tٜ:uR -Z8k5A cWLU6LYkMY$b)8Gy| HeRFQ ^Ips'Ŕ5ͻeKg>ľ厤ب5*6|QsU 9oG`J==|A\_{ȦeZJhmڅ]b~ 2} d,\5)o4\'-scf!3AOˣbRh.|e.& K">uZ߿1ܔ_&S?YXޝ':)(Ʀ6IjΛe\f1#8wY*SO8V\uuukuu^6{~哺ʛKJ.~ZWIݫyjXSYu'o_8;͊ں?m[C4r:Z @*F`a.u.&SxD L0YmcHg(R2!ﲂ/=lEL% /o" ykIsW1$ƴl\#r4H6ST $Wp]Ns:_zNϞ1TUmA,澛]ò>۞'c['t4,ʡ4*ʄXAƃ7:*^IgG GkqR)z޿d[nƵ2I<\*NbƂx[qfR&{-9-ъKyzJ8@嘲4*Tbׯ_eO>%}*ͅQ[imm#1"CUꠈT)j3sY@.4ljSa* 2aaF1h<1r;S٣vK[%PLj\;”C]_&v|4 ˻h_83qԐ,x9-{L*kmm% Id uV{q:J~Pl E̡Yq'$b,Ly6F)wvLeċId%rt莴i<\K"+u *㻦e ˻˩XB.m\ￋ4`h Hn}?''c~ivq+'|9V|E;s1g=HeR>FNNNKKKcc#8 TUU=~Jq3W69twWT>(+\޾|U-;~"R/7d$4.ߒ+CUb ROJq:^X[ezjAQTϳ 0s[v G鱢$ 5\j,kO[־oYG=~Ca7k9~_ hywzhsssCC _嗝i-\9yTOeں:0He, Yk 3w:\a[&-M -5Jkd^2lV_tzEG6 pMh`I 8Mg2X833͛7ϟ?e>|=1hxR/S94He, ™kǷ2c7B,_F{/fhii_6tnៜ0>S:_KoB k[2Xȑ#_痣e ;pl9NOOhLXdi6IXb{hauX+;>$}r+ڥO'+?$~vxXUx*#;Tb̒Vÿ}cϘcx&*ww<2aaF]l*ڵ8G g(<'X,El7ɡf*\72VSQk+%ua)??eIc%$TZiiiaa^F`a Sێ5d%}Je%>=hǺ{x\Yyر7n/^vƗq㐼ݻWPPcgA`a/bXs6I&o\3Tq}(999Wr6Fh4-d4ѠP:8 #  # ,  ,  0 8  # ,  ,  0  #aa (b endstream endobj 550 0 obj << /Type /XObject /Subtype /Image /Width 642 /Height 669 /BitsPerComponent 8 /ColorSpace /DeviceGray /Length 8992 /Filter /FlateDecode >> stream xwTqQcATHb!B (E JDETt "HHAQ#(ҤBSPD"4 HYs?s9~?k3{=wyޙY W%%mzWgsE) BP(ʿ/{$O_ ;oB0y44˘m3+ꏯI UUq9Tmd1b#}9ܫ44WZQY1L7x5롗+S/\ȵ?yP˒Y_;~ j1'g蜱/CԤ(LtN{#Xf:W$+Ɏemv7-U0OYb_ jgt/ {؞m.}a_"_Ym~2õDiY9mDV`Uж o˧)ꗮjV\h)N X,U,#yA*uKDv~?5ik[};GG\9Vxc/on4JfMeάlj}]?8Ź{hW:duoooM]'ey9|8077e N[1l̗8ҢJ[䔵%X;mnkA9qŁ!%#Ãjl_U=w|FS6}C6L1?sfʱ'K? [^V|_=Z\RrWW&ީ G |za}C%!+ ,2?m* ]"gN+s5u]b񳳪LOxl>/ӽhW}ٕʲM) n7 1Vf?)̫M@sqDzln!c508^Ę\bomWoi[e'5Z~lnl'W=&|ga[2y lSZ`wIZ3&MiݽH(9?~ bIvtnϘyh°UBcK{nj뿋իv(=9{$bѝoCCe}NPn*HJܫ:n[eӐ*d~jܗF˾]z ,{tSrΒpWRyQV/>_0.q대3V=kphLb7U۸74hq"iӯs? *2{[a3ߖ9ʿ-۴@1%茧G@zђǮgRyoZ.u.?{#u07kuݧ[#guXGYJ#}r-c*]{?5;hV\9 m=غнvȿ7.8a&Ȩ"[^DL0u~#+|]K+j]{QQFW7+c~VtU_XУacszͰR=k糢XruQfݶZy Vz%(j.a+1gJO2m~YNu_h ;uop]N 6Zb/e3Wm\~?--zK>̗8V'# {IUU.Hesf;>'yi콢'HoЂ5/?vh TƨV<Ójk[!=TK+sdg>i6 rv?=㗎hsf>O36lL'[C GhZU~ 4EMS{tIlwN^q}UPDB̏M/|c8Octn#KdJʢ?^z"ߞЂܖM!OS--Gr}'+iihZҖo6KҶu–^1VޤhdvG[Oi^sJ *x7X70fDRWjݒz^8N%MF\_.+**zzYg΋}ʭkmto~*~ݝ뢋gmuHu !Rt~GepRQu6(8aEUbyC~Z+f8ZOpꔚ+&K8N!j3;ʛŊاFή~5Bu\ ݷMwDYIդ6g @^=˷sMē8ZWߖI;OIl3Q8ZHCb!jLSm(Ȉ_xuU\ԯ#d80E!*㨆 h倇Mͷ/rg7}T"=5HP6@I'yK#+bη1,HV\&2RQûV:&:ї z=uAUgm5W^΋q3Vln,VyabɅf̿T;{E䐌nَa#{R7hŔ- 2t  ls󘖜;f:D֮G6П&_BUIz6r=:i7*\v9#'Dը*JXsGkDu;lNՋysSesAS-t0>oSn; @X$tg&2vY Zcpƞ5":Ӟԥ M\?X'{Oئ9nOzVlY3 >8C7my}ւA3<~ S5T w;KCY͉#?\sLT/OPJ/)5"w+?9PQ#՞Oޙw+:fc5~(2k]_|`Lu3+ԦW8}k7zږ'ޛ{QBfo~TـK/Ԍ[\9}'ᛮŌqPxޑ t>\0;,BMطiÍ㒁iOSٹ$Hwzݡarqtᥬ-=[쓸\աpSxrLtĞCl~n]Qx[v*5LZvcҽ3 N>N-lT;ڤ'ѠcggDW֘jUt~midGߣ\Ӎ]y2Uwx?}l,"@XpԴ%iK7J~+X\eqTކg[}mtU'?&*Kvy#ݻ{fUxF'P1bϘ#?ENx]Xc ?.VK8} mբF߻8V{Ot8WҔqbgq Ғ5`MKz^V>+t/ì!ws%f`-7>]].,*{ĵĿK6?eqLV]5A;_I>x]$UN=kڮ}Cm_WӾ&W/wKiZ9B׿MVRtu~(YzNo~W=vƤUOs?=zpwb'יVN!҅:1Q*ñ]omfqqt2]eKO_7mM,mr>5YK|INEM&{P$nf#lo~E߮Mpo[Bv^ĸS[rdk8rfVRkh`ۢ`eswIӬ)  kyӬ0ߔiVmwYq͏2kwDiSTUƗWZ~%cYh,WoS>3߈k;>^)&-Z8Y[Qr^\ԝvɸ^hVrO`W =E c;Ml[HFlZ =6ۈ(M(7rlB;[GCio^Gi&p4TR]l#8EvQ}ʤ6IgͥKύ=5iV /\њqKI<fMTO0䘽ƍcUP7eԉ܊MrK}yYg0*Rt}b9~<(󇪋M\Kq%w4gy"AKvpdG]E o|o~d7l|Sr{HCC6Cg$nmJFٿHL.:UthKzݰ߲WeGMXGEctyLg6ArriG% }kv<^8_?_xTUg-mnGox{EF¥|[-+Vr%H?''^햤pOJ럜;csѻg̞[`3'.43`hy,.M>xiyMoEfo9&h{ͽM smrji7쌜{偮; 3kNd$q_K#_Om.]&K79oUxEßyf8鳃[ːm^)VқƈorGنE_WZ=lYo?Ҙ(YQuaM$=_jn!񓯝 Äpp JO]Pd\;\3XI;SH}CcBV}&=DNPJPS~_^QQܻPcyN؛c5*4bdE \϶2l=%RVmպӯkIش[i߶nXp뒊xuZ""]m%χK*;-.8]u{lՁ.d{M5O3A%+ C5^ym];Uө%fS[ W&(̫nVqkDYZ2ulu_+e׎U]?WuR_k>pKpz痮.JknzV2쿻N cZc||rZ⥫KVgы{[\Hnm5x5% aA.ƍ{ &<+gyckw?x9JCצ€.f}[o4UA SKt$]KZ*RyZNw쁚*J;뺞I[j17U7*hnh겒BYqd%DW[㒮%7} ɁWGԬy;I[c8ڵ{ތsCf3bQ*<)5:hUwk;n / rrjSUq:B]zK=5:͉ӧ7IYpCMU&d.zP4:OI|,&u(4}Ƴ}MYfOR\DEEׅH((l[# fRl_K%^:ny+3e/Jz^ˌ}V#R%@xˍ;{E|I}9~Қo{`/W Hh H ƋM_?G46lEj?  3Mkf74G03s_ 4طܳ| endstream endobj 531 0 obj << /Type /XObject /Subtype /Image /Width 718 /Height 256 /BitsPerComponent 8 /ColorSpace /DeviceRGB /SMask 551 0 R /Length 22599 /Filter /FlateDecode >> stream x P6ow}˗kRƛT_5Vb%QʥX KT\}pFcpŅEEQ\DQd_Ms=4l 2ϯӧO9n`0 kG(/:4JJ( ..K`TVՕJA**p.4h[^VZ\TP&M(-*m'zO޻wÍ]؀4J eo\ܻn^;v\pIRbii)<6&!V]]ؼ(.*HGܼnڲwevm`oxи[]4OMVWWT\̨R*{wxW[iiiyy9#[cfM(ݹi ( }QеkVe˖gH.ՒZB-烵¹$3^h( ueXXXee%}%&JM ,+5fb( ( +`qPmX:e{ǜH!Rx1=wfJi\rEV 7m\76l+f{C'֧XP.Ҁ:kLw4vxck,zx 2oMYgi 6mf83G͟] MU'0(@|X5|Z'QnFFZ}%Ai7m"&[kQl䶏QO$ 뼻99W#ۺ~:;9:usMOCĞI\^zuRufM,'51qNkiZ4a_nJm衃 zRc*Mҹ?0yΦ+ =&L  $ueE5sihɒJ&4(7J*((HӠ5oԆ_4,;^U߲d8'lUdg6-p`ӡPxצs:y~!R~r\GXqXM|lN1Y޷xDJ<~꽗3MFO=p'3Wl;TL{geˎ߾l_9| > U>>ЩJCʲa~9>QE%E/dw97:īsJʊrSbLb=䯊J s78R4铬W9%e%+Yy*8W`['zTHSȽ'?;-ozYi[TifV6Ⱥ1]&)fkWc}92sY% 5Ïj k7B֑ ue!\%LݔH]]-fJi?F=nY=}zev{T$˹l9H|xZ |:T>⯛9̧Jţs[ƺob rLB0AJ*\t(+Ɍ'-ƲKuʒXm,;En|KqPvewZ4foIieF.a]ȱ}iJ$㌧,Y-Pt d7u4nB  (P^&OMYbŒb UP iZ͔ ?'MG WN)gi$na.*Ρ'+Y0!,kac5:uӘ |i[XNjnET?SDSLc4g3JJAƲ bjn,;4HQ}̘4eߌ+ыuose!e],_]Wg/g>7egj4{WϘ4rȰ1) $Ɇ&K$zϳH$#!k7BkkjoꢼT+-@iR?<~܇˗/xeR)5͔8{lYYYNNwzcssRT6Ht=jLFT& !LTM/n3?aOoea JnUIV߱rԉ.NήS执#Xx)vF /Ԟ"x u֣c3´U;U>JJ9򲢻[YVfb>]|>N*M%JcJOC ȧ&sQih9;Β9OK5 ֩ L+7FDh97jj4.EYI1I pwZf֯߳gw:TVJ dgyi r344UUO.--iN133FI322233i;e# cFu)4 aM/1qӘ |~#F.n<{rYxa>b(qF^7ڒH<`cɤ4HoP~*\Ҁ:oٕ״ bDzM( -m'kZm >k>=(+>Ȏ)zXZj;6E֚U")3@?e|C2ȁ8PFCIqaqQ!)@ EiӦ+VT)3KH8)n;h)7J* EA##$Ee ޮS+gvEBӡU!L%qaD5GLc' i+U ܯ=}"&nc)Q X!7bOBꙔU{II >Й+B Cq7 T'}nE9B,~ƫ|n/ J*]ZZ#9)4?;)[_ҤpUqi"tӎR( .󎎻sϙ(Ǣ8,k~ePɵaeO5 󮡦BWiW48+bh<)H$^jHZP]]CmEsYu4ܾEڀ&1IBP0 @[fIE\|.1̆Z͘Ҩ+**z0/G4Lvi]켿.D=NSeqQiɣ69xF&$˓"=]6EɅC[Zs1]wpCY*OOkwn>nܻb)gvəO c̜(aſvhٹ֫⟤>уkQOUwBxt]RHQUj'#pه:QiJf.d1&ubNO/;e .N\Orqd\&Ldgfur;su\o/tsqtq[~vjQvۅu|eq^\\A3&8Zٓ5Ӝ 8 3nB>%Ǎ 2iW3=>>o˜CՍc& q4qކڽp;4F ?A DAA^A\nEzZ1I Hh\n&oAA/Av J:x0uG_yr׺ߦRע;mF?wxMn`0gQoe]'^nxOG(ǩM1>ČyK֙G1uugOvu/'o \ݻnWg'YjM4urq@hzFFU5U8U;\mDyQ)/|˵iD߹]U..*,..~[yoryyyo\񒃻RTVSnɓ'󳳳i& JCkjkxɑxE!AO.Ҁƛ좒3ӝ(ovE S=Ror HE}M G[.|K 'Eܝ*u%fJi8q"//Ҡ?i4F*o)))2:]!L!nP 44:wUsoN#..4 yd) ^T!i79oxlj nrlҠL)Ǐdee ND'6RPHӓœU5U8)\r80A=RMJ<I^ (PWVRnFFرc_6Tz1=!>BNNO. G:]BioƜF7ӈ,/*']+"y;On7SHn҃S74Pn&ѣ^az_op k: ': ϟS Ai+ Vn]I'c~eE9(+7Aoh&p 35B2F΋穲GjJ«A_*i Tu„ho0bgOF.ҀWE%=Sۮ}𠲼|I9P @E1\^V:5EFJ]idٳk&ۅ1tkLMxIU{\\ܹsX4V(R^]qbU*{jJG\#|Ch(e,02SoVW:64qD] dE"C]IØn;Aꪄx__߿an~~~?& 4XCci`PWU!344JJ( 44J-J#^$!*rs@AAA JAAA`t-i:G $J%3/|@ߐvBMі7oOv#w Ax;4TmFξan+ UDdm0ÄX쁳~Փ23Q 5!Of%d[WHU/#zH]B32ʇ! [nB~r-;wdTpe,1=S}$d$[&ƒ <vCiya}u~/Puʋna}Ck2oƯq o#k> ?.q܄w~X&OPy#=a[?/S}DPQvFm <ƒ`{{N;m@AAm   `S[hB   4Є@AA4P    hE1`0̪9 AAA9 0   v3aϡ{7C7nA뚅A>oHu!y~;pwÃ]q nU[uJC(|${U{[-5`y4}mM[S-Л]]iT2 f֩_~X~rLr25̿͋U&iB$ԗ)aŔ46Fw`Sq.4&1?A32C]J#K% <|2F+J#3(^{*_)#z57S>dxTxJڅ?w>_x?صNa3cn҆Y}k)ȇsG_K듰F6}HxJꅸ#>IǎL=!umcN"إ=( ?QfoO9 C_4%o{ fmqTVA8hh`j-!SΑ? MS{};ϐeτ6jg[7ĘJ1m;k_7hLz8oz~T>N5pMS֋N2wञaꞝo.Qqizՠh=?f/qٯԮWH78qԍ/Y~Sf̿Ak)1=lU,MJ~y1aR1,U^Li|R`J$MUP* g|;uU#YzRH"(].W)`)g? ?BT%!_=ʐgѲRE`PЯ'E$γΌjVM|8,'$+2UJE,Z쯆OߕɹiICIJsQFgy-:!gϘpD"+I! ܊QB֘-it4TOƛW*|IZSn.+u1IisUq/D7VtYi4JuYj;Jc#jBt^Ռ`25Xz0wVZ)UY6Ӄ51RZ4 )񳓲qV,ZAix`gEs:uLo.&nŧs5x{(k{_fm<庋gPL[{q~ᏒJ"7fyGPY2-)䑖QLfTVFpR)Y y\JR⒕JmRq%4#C|h$ݗ UI.SܾjkJzPegveڣy!tVm=#AXlЅ*8E=*+a%W_֮L vʴBgȓ|wDMNmʰy|QE,d j,]pK7uvĨ"_MKJ xK7;˃mW^t`D'p ྊy p&iϞ8yWT;fR^ܾaLo3T*N:q~d`JU lMO(o?6{1GrmkJCy1́{J:^؅~)D0vLP;oF7-fo1Rϯ;ٚ|5/C27Ou Ύ͞kStC2yTl>ba986I0Z ƞ^̌/+Jٟr4mMio -Væ(4ToU3D7'R\Z֯cPM`nr_XnL/Yi'OAټ?+NMif>~uڿa?pETKNML{0<(4"dz]WQMmkxJ#W`ښhR玾޷'a?l q3G}l'd cs_AW6&=nÌ)i|$N[F HOOY[yq%44C,oc 4i ߏa?ܳǰ_M?ܠzMTVLz1 OۅDmh*)?f+ĮOO6n#6/5Kӣ絯E뵊̰%.7 7{b{8Ɨ}~?D)6k)Hw?G0vM㽩7JG)F;Q..\= A;Z2; 5rilۃϨI9j we롸*GXKieJfo~f7 z3&x*U̲Y1KJ"E0UG(ҕ#3bG 2S8ZQj(ӺUQ=#dJ<✿0ߨ&,Sp_'%͌lARE{l8CH9cUYG) afZ%㛾wuΉ3u>PFթʐ+"F0˛H&:!CR*23]-c?c=N5(It+Ŝ?ިl9 18K;$%?2Umtwhxڪ?uh ) Six?YS&HQ >qZzUCZEiT!07T*8#DX4>cyҐ364F1]q/D^JN]%KR=`;%x]U" R>0!mҬfgz04u˳ڌTcxb>YfO?c7Sތ4Nb%mlM˳\itzӋa_9vc9wUZGi3֦yɌ}pWwc4Gczs j5JaU #у`?`&gMy0L4->2>lF*a4PafH,TJSCidt=;22L%mlM˳\itzӋqHRY4rr8ۋѷ^Oi` MJ̴Y05~LȨ9sI#MْGڒUB*ыi"t/t#?`[B Fלy{ח:m0[j8/竫UYp8Jud*2qZGCe*TuF惰 HfbTQvvQ%-QM-MTŊ}w[P2n`6Mۣ[L4NwfbT!=z_˝=Gyooi>aCb,oTD\ΓvKbS5Rmqwۛh{SG*+(wcP>cvmf1F>1h**~Sb+*.a%؉opj?D\&M~R]0AUHힿvB&W2I2i!{(D4l%L{5Q=v \/Y^o)Dh':{Wz:xڳ{.?/<MWIilAAAA( 4!AA4`0 Y>9    A( 4!AA4F>  P5~TmyvJ}AA?`]۠4F 63߆ѻ2iU[oBm/R   E3l_RImmIҾϘ9&oW &at&d"  ]uG }=?j*=O7@8e('&˾{Қ>.lZ]iqoa>?=/@ig+] YBH  `W'h]AD'*"%1Půq:2?t_Uݡ)AAҰPigx˔C41L\^,oбf7V:)AA;Li1l\)qu`zJW 3ƛPZ  vu4T_IJW*Ro_o8Ѓq }? I\g3Օ|F/hyJCHSHՏƛ%dۏ  vu4d3GfP5fc4 cdg7w֛N-گW~Cz&FZ4WOm^=?]dۏ  vu. fMAAAÔ=Gܻ62ӓ>H@AAA( VOOC/RO( AAtCAAAҀ@AA4`0 Y0   'P#   k{egߡ4G@AAJj83bSL(9  BiXQif_1bG46޽_uV8}IϞ=r޾M-g7ɶ)AA;]i`ۮș|/$ig̜\#In~͌8$OV8`$Rdҕdۏ  vu4R/l9|!>@֨.T^m*_'0ia43̕.Ԅ,!~@AA^h?`DbRp ;UrK>jJc9oڻ0+ Ӽm޷2k(\1Dy㑕 م%dۏ  vu4.3^J&fNU_0LӲKI;Mu3LOÞ&dv#  ]`(C+ ن~ck_C{[)˒E<SHAAA( Kn˭]Qi,c8Ynf;;7#=03l YBH  `W'~JCח,U"ԁuӞa~2 &d #  ]`)Yg|$y&0#fy_f 23]SJ@%IR0$Vr|v@VZWW*;3;G&!d/zihzy6>8Y]CM*ʫ37!ȶ)AAOi(/npsNOPd^6[g?wSJCaL>f}sשCoSHfϻfc)с'S-a7߄, ~@AAֺ    A( 4!AAA( ( AAҀ@AAA@AAAx1`0̪4`0 k9  `0(  `P0 `P0 4`0 uu`uJ JGidEE9q0ߺ &4J##n;sXک+ZCUjkĝ;uMUi\^^PZZRk55br ż^ r2.XQiDFM-+-hk-mmcX JmBYS]ӻk;ryycO @vZ ĄxFS]UUYhqW*5PF!SZۍy{I]勸`+W޾aҸ?NYdncEUU*u%]J>PYŁb>]?F@7mu:B-vp>z}Qac`%X4r^"ᡧ4N;]SYQYAV^I񴭨@%p ]0e6Q^wo*y4/&7%PNrؕaPWK֥W44h ӊ[$t0ɲȧ\5T4JhqY5 |fԹ#uiW4rh}-2|#٢n+8Dh6F+L14L73Jèa0 Jf3־/jߝ `0uM]\Pt !a0 JJB8d[/)0 `0 J`0 `0( C`* kJUeVP@i@iP@i@i@\TWvSп PFA*A;%"f&Ī++,O޻wV75T*- 4*J#;]wuKoc/\wmzE-B쫧}D?6ݹCcqoBcltKUh1ܤ͝;(  ݿ9NE\.x_}.vo=^['6m5[.|I(?M(p<$-FXXXee%%&JM یX1ZUUl6( >φh\ S{qO]:^CZa^ڵ-P9TBQI 1{xu8.$9.I%J#44ZTrHھY`!J"H44J:DiyS.z_ ]{~W]Ю;mNڭ bD0?iA(y&mT\.P ^DM"bmП4Yaa!ŭ훠7twi+j'"l6(+{o4jU?8N1@ݭG̬?]wф)_rO K(%dV@PT6a"iUsvEfuKc+%t钠4Qirx\&sI㜜~? ^'sm2C(hTĂpѬ( qqkIR[kH`xh<55Wu4?IZI goFسx:E<]b ;yF؞5'է6=ۻdvbNi46.\<:[UB@sړSJD'p;Q#D\YY)LC6mu+31Gsy_~|JOvɫ/_~*(P$P4v9 Q^^ڗ۪6W|ݫ|).` id˙.lҠ%.@}ЍufN\ړ4P YՔҷT\V\]"H4lqEi840FӨ QlM7l^Ύxs (IPDJ4vv6M'79 ֧6UPurƪS.myl !@4RK1֦lg6Jt쬿6E.˅04Nmzu͒0.rSէHl2Rsf$D 4hP~͛ 3ӝ hN`<6`]^r6.ՋfO?W'Gql>(Mn$ns&ur?yޚb2%S99`w@q~CBfXEi۾.)9M~bc U'֫OI.}f=}IJS0Qn~zpWvc#^˞R=mLOɲ۞"r!RDM( Qgruⷙ 8^}5<8pQ-H6N#!l^(mJt ) DDhj4J:@iTWXQw+dƪ+9ZQA5AiN5&h7ѴDixB 9 &5jS]0uei= cŬ Ύ,w`Ƽ%xṇKQnN.n3}6Յs0me ٷ~TW'RIZaa!ф( yΪS*|VpMHf34/.{1m λv ]!lu}}φ6rt++"TTBn+h 9F9gQ#M ɓ'󳳳iP>H!yKMM0"RQ*Ϟ=#A&@i@(Skwp4|p+/Ne1"H]8%4[!<{BɄ/h7*Aț,778gmɍDi8qD^^!(qT hkرc_6Tzi6R "EԈ l6k( ϺUrϛi7ajGpۃbaQ('2X :FMJ߃hkѣ^ INCNDhX@iUƱ5+}Nc5VOϐvyH@x{v7=ʽ[c9ǂWűDםhZ4>,9R|IrFº1nwxqBxsވ&@i@GTSi8PNۣk<56 Tԣ+ө|ɹW uDJ}rA{=[^>{ltt."Ou dznBytK%ƈ&ŝ;u*ueze֖ߨ>Y}jSwBũͪCvmJOS+[4111‡Bia+X͘n̔Z 4FS]yoC+gwKl_^Duu6|}}cKj( بRh455DJmJ( 44JoIw=)Q8 i8 4$I^Ka endstream endobj 551 0 obj << /Type /XObject /Subtype /Image /Width 718 /Height 256 /BitsPerComponent 8 /ColorSpace /DeviceGray /Length 379 /Filter /FlateDecode >> stream x  o endstream endobj 558 0 obj << /Length 2089 /Filter /FlateDecode >> stream xڅXo6B藓ѵBJE@ra[dJrvs͋Uzp8 _nը򴗙@Egt*͟7A&/4#_i;Ccw-~-׳~~}y&JJ^ ͌TzuE~j: ç?aR6m*|ۮ}i,e[ӭ0_ږ̩d#@i zV=zkQ{HY(7k`{voQġ苕z0V[v6 |,zɩ!+k؄8ͳ~}iv`Be/8 vwy2z{ bUm5@L⏪3SLDVr̗C`=kDMEӝj C6-5P`3-"%ۺ8r 0=h`ukjɫn="@@ʌc",o0Rh0vūKb/j[ FLhZA*i"E.PoF-:8m#K/u= a;#:bS[Kڜ֋܉P̹ xH9D ҮY>DBN8XYhɘ3U{No( " C.򺥋_:NJ8gs`؅1c%T%BXY$%u,;8-RrHXa眎e?a'  AK8Y2qϼ Ul8 CYAEO %̯TXJa!q0z5P[˟hI^MT5'FU]k/OKO0jOԧRD5+u4T$V :S121g%p^Wucꯖ3h(y8tdՋĂ:qx4Ah98'a`sy7gL!:|13t45F]IFڒnx M|(]j4" é]ckh,6v,5uXAk-[Qֽp @vDw<\'y@3N=@o;H(NB z/L4U^8!"/TAC S#`B /F.2˩*YBn㘂=%.( 89?IoG P?qR2?Ig뎵=OIgC*'-> 4*ʹ.V\iI-V<<Ɏǽ+e |?Wpw<]#g ON햣djn ACց~_VJq"pQ ROxUr"5:q)@NJSS 2RL벋+Q -eqkKXu$ * U$XBDrp޶/FƆa$}ٻ_ES > stream xesy{}v9 װ2LOO3 9 **sF(*** H(H! 42( 00PP]]OS~Vȸ_?tؒB!B!‘)?"977o;wj٣[=B!B!D8r9鿽_Wy7h^إS=uҺsJB!B!Gu[[~su(-Nݡ%!B!B}cAzv\ٱ}!B!BҹcܜaC ЮB!B!ҩ4oؐ۶PHe%y9ff57;$mvB!B1<:Tm]6tpvmGJ̌I[-;p#~|x'vHk^0;#]ƍNyI*ֽs9#&jڶ(,\tN!B!6IVC6E9m ' 8ĐS;`*k_<3m-ivMS6Neܴofier/Xirլ@USɥ\jf+rkYSTZ|ׇ:30ն,;;aMS2Dߔ+rʛ6KKwsҼLW{CEXyыŒjY&33M^ߤ\Q!B!iY^4O!Ar-WrhX!y"+{eݲ{x/^Ur^b1?7vVF iD!ˏ=:10KY2|kt*+>nkiSၷfzmx{x"]i7WQv}5뵑mJsZ& _سnk֦4]rW¬̶ϮiWde*_>yndv%9Yy5keޱ왮~}HsW<&ѽvdCo1S;=]r'.ۧw/tgz \uB!B &$:(] s.㰂uv-NeJySnd˽053\#7ѣFNa="҈Bw Q!$t9iZpe~r7ev|kCNpOjYUtۋ|]6m_Ϻƕ-OEnxkVzXnwN׿vEƏ{rNiމ|8$;ݝ|['[g4 ҹURV rRs +]L(.O;ʗ:JF-a3Zʌ[B!BH4/ۻ{de>ewe^%ZV(^o{aOrGӻ6@9b1d, 4B\#sɘwҼ¢2䓷eޘ U4Bn}Mzf ?4It6+A22NFOlk0z_IAow~ڄ;ԗ0ܶ _wlMj# ~=>켢zW<<7/I!B!MYI^݄D%?7¦uỎ֕[};U+WzS%i~^Æ7se{5;d7zd5K/5Ͻ]4ݭ9?굾=ݻm-_۳K^|aӥܾlklEi튳n1B!B!aSZۻWҒfRVǾkwݾ_wYtomhVR|e Wj]5H}{쒑iđ#M#&"t{k>}Nn/•Q+|f'<Э$YyQX1uOuOW!B!0m]DMN2K+ixÒ+;bVs=o*r[.r?;wj'4_Xr4,- ;׫;oH-/ʔ-,,pg54%5ynR*Rsii)e9eͼæOZXɴK).iڴa:y=Z廊 \҉eJm^]vAi1m1B!B!A),rZT)y9n+>,o*ߝs螛V1լ0mB{{t,^\݌5$,AQNB!BH¤ ?KiaAB09nw3WzjzZxug.v1s˜cO!B!$1ٽ['B!B\wnDB!B!$Rrs2u($B!B!ڥhB!B!DJvVzr3!B!)Y;tB!B!D!3!B!>B!B!3!B!bO}^nKٹ]]'8ӶM{vmھ9v eQY^E!B[s;7\:•*sPf4ô_Tykxbwffnَ_T.,>_zֶb|OLY3Wz>Լ07m;nibGW4-\B! o,8}uXa3Z᩾d45AVU׾L܅jkG*iw_kkZk^}Ш١τB!$>[?נFW3OuhgEGWVlTOjSk7Z;\K-3L!BH=h]z箪]UKM\)zj55Ul[rUnY|fݚ{?Uǡڸm7/;_;g* s)h͆ei>@~A|0uyvVEoN#B!$^ǪBMǖEEY陙>E"MMa][efeRuH3uZS[,(-q{VWsiu2qU`(;t]Urw=э6za7ST -ypwoO;zgfV3jnTCVAy8_^ә~mheQfznqyYy }YV;5ϭlxC*!B!sݰzOMs|}k=3A^2UY۵xHSSX)=tꥭˆvxەSpH[d)3߭5߽lAkj7wwznfV)Ͻsgi53U>j]YpoMʀUhImpVAA]#WWtVx[L^{Qm!B!qi}z6fn(lTsYٵMRz}mO[:t`nm͈-ink޳սƳ.xgE;B!b>oT4^ :ʽVJ.UҶ=fKxk'|QsTr֛յS}v[<׫kL>7VIkڹ3'{78v͑]U*(đY>{{m+/ү*}n>B!b>TH}{G^Qy:Ԧ +s`KQ]]7zwu=9Ҕݮ{<3[T=NmqϻeUlj[g0W&|ss枚'*s+z?Bď8|z&Xr{=Q뙣_>_;LVn>QgnF!BuyK V5re}>ڶqSrUQ{XސG?bU6lZ7ٵjfJ8Kȧ3jN-zpT1w2S#QabȹeW-{ug-ږ{1gXOuQq(ޟƾh:gӎ5O[| zWA#Vo^+m{Ոtmˠ yoS~w_+B!QB!BH%)Sap؞3!B!>Bh}&B!}&B!BgB!B!}&B!BgB!B!DʙӧN!FrmBHBX+l< !9Vf!( $O!|WBgBG:!>'s9|!^#@ !3!>;B~zŲE?7fM_ӖM?}&τBLLlw>zvfڹС'P#֭|cGnRΧ>BgB!}Nٽyӏ.Zow/7r)A/^ؼ&ا>9gB!}&vI:üqYv>B!sW0q9cIKD׮2Ȉ5>M򫘈I[g75]0F8X'%onӬ:0Op}4"f 3GQ}VZ{#ּr.3!SCc uz^5Iy.[wNDWX&g 1I[I=oj.}Sڛ}G_Oy YFgB!f=Fc+茶 $TagϞvpC5a:eW@OnPi%>{EU~3]LĤ_=!i@iE{.dTIN}Tӱ>˯:Y/\VY~#wwF_1F}sDMlAi"G !Z꣎ajY@B^tXS 5f$ePVBuު5'Yz0k? n ZͨSr/~gY/ܸ,sG/_lu7w˗/J}L[Ig=оM"k)}Ysۮ߿cjl}볼4}4La_C:Yh^&}6ĠYAAlAτBeF]2f>-VY rg'ǤS*[fff^.ą 'M+u9{})(7Y/[KdY,r3]LDVƴtO t,r&K﯎9d^֨+#̾謧8Y |9X [6CksOS$A}5΁]$:&֣ A=[ü>6ՠ՜=>B!gٝþJb> b$o]k c`Kw#<}O}Nau3,ZШBdce΋4A_hU狲>tkaǚ^s>Ҝ5ߖ<5Ȃ*8~}yr`L>˯Z_-,+s8kdrXۣu곞/Mg;繡 k7!9ϡ :&}vW`볰yj4 Hv7^krwiRK+z ?Ynh 6m4,{h1ʭ$~+rg+YZze'kWN9ltn gq^,Fgfv>7󁹍lAL!ض٨cY#i>^ ۋk}jͭaOwеρW:[l>< >MfsLτB=[ TT +}>xOi!"~+|mܴʥ#ގ;έ+rΝs=Ϟ=~$_=^-^EGXbt1zgOst.*}iߘqu.)k}V=>UC[u|ζwPS6 wF?'o39gB!ĆigN6&) N`JE8I;R9w|tq_ys/ kgD~>sg՗ݞ]#|QĈbt1!'o7Ktywߟ<~S6ܠ-v2=T]0Y^`m'vs\Ic3d} gC`[3L!ذp9Ug}6&)7KƤnr+#;ӏg]xۦ,|˧O;{˗-6lg.{CΜb"&m%Ce'֟kTCs}e=vf>kPS٠ρ$>2UFG ![flި,]:}ɋO^P2u3Z̯o+v̛ Fg!^_>qܻǏn﷾?{B!ِ{15S4V Y}4g=ޓ:շY3/\pF'DN?&ǎʯ¦E_ }mbt1~g߾kNFAzs/kYP4nH볶3ֿbS9Р3!S pnMResd>DžwBiœy#4Qٚ;rabHokSDLJ?5/_!U}6֗-!Jn"ٌ8B <`[ L!YTG3g8M||O9zQD_1{p };/&bO N8~Slf=z$}r ?3O}&τBLL7͞7xedŲ|3!}&Bgbj|N>s8O}&τBLA !3!L! τ< ! r ?!>B!B!}&B!BgB!B!}&B!BgB!B!uD{}ٹo!9[,xoݺuΝ$`~},HY#⿉̞={͚5555~j#m#^t:JXʣ@2mBO7+crPPPPP1Œ[Nn|n맧 =`+!!YܽٸDf̘r]v8pఏСC?cǎ8ȑ#+VYϞzzvLoF)rÆ 2dǦAF)G}0X$aL]RNdsꫯvY[[xlO*}={۷o?@R%ulذM6֏%9s"aCϜ>u&_ 追>?}Jч:K/lY]Su3$<ݺu[?V}~ᓏt;Pg#d}~O.oͿݭg<'+Vؼy_8V&M:… 3f[NNlb|+*ҿ_g-ywko:/wYbc^)//WKΉJϽQs;IvqvEoOVgN|g?z_^}Տ?XQ3rnɻaO׮]utQJnXB9tٳgZթScN/<%i[xs9p×N}]y䜘o1)7Lj#gv߻Ԍ2bOtZshq]?tCc?8]h~4L՗O|~*>8q䉚*ݫ%݀^R^a KuE}߽Шw8"ޱ&>xW^:6Ǐ#stE@gTqbT<ʡeǥ/nBOkyS_~=u10¯5??S7 ^p+֭[fHbڴi#e d ;^?Q ;|Xŋ81Hw fXHK;eM.n;jȧxS˾?yq>$I ߛ/׍Y$If{}$P_-JKL9p<]óUu=pQ:7ʸ.>vO&DN.HGdQBTon_']~tlfTߟd8pC=>.I:~ҙL"]ohzzPğnmt V3'D_ž7|٠ i{ǭu*J{7+l;rԱF4zKرcyc?0h\%C.kgkn̼…b.C3:|Be}M©]#%g1=K>⌴fPIik _%Tl:IF45K~==` wZئ XϠ,u#a>p}œBo-0h$-{ixY(,78pX Ϣ3ɋRg)l-B\߻ qw hO| #8y3g.Zh iu#aEX%n ;DK弦M&yܸqAn-+Z[;~*-sƊԫcnFy,9߈4LgCt=\~7 Vɽ 6g${hB'++`R]>x}+,<]5lY'I \Q4 SzjRs/IRIL? r &Y>7ԩSgϞ2\t%KFD/r$BIFVi^Bi{+ c%p,/a˞ E7/mM;6>HӼ~~ 7c^ 1a:zЫ;L{|Yjcw_!nx`$'C:ٚz]pN~b؁WU#Ս4]ꦤCROIj7YL K$v࠱"G/zK25c|?^E)K?1qĻ]מ| *zĈO:.}?@r26\fRY+'={¥#R}}AKzyC.xj4L/.J>;VOT7t_r[?|q]*DZ%6\y3WK[:_/gsIߝn!wSt-,0rׇ/nA)=CR/Oʻ^D˯{[kLuBE)>`Z˛^l~"D[r_駟@V"+c9РCNJtN)󻤊q͍u[sO|[ 0h@1Yy,9%T.|y$o<޻BHoDOEkt~>rĆ7V7N6Rw'ů}zЙ.ںmzs{~.7W(r^޷ܹR}GN}ez/6jQ# s>pK :NR|Gxv, aWtK'Ʒ oYqʮ?R}3:DoȌkx≗^zW_}o }SN}wD{]BJkXҥKxdz'2h_kYV[2E+r7Wg%k;h>OOsr_0W^y孷ޚ DQQQff>]/= bO/_3sV[T뙚=1R5|L}tg94GT_tܹC yoO>5H4hرc'M$j,p`„ 'O~WXȪUWZ3" +oFf\[t/w>lذ߭}|dtWOӧȑ#Aߞ侂ѣG?cSLyBvرnݺ|ZBJ~ѱcǾ}4My͡t<4W F{ƌ3B~7&ѣ6m {0w՗K!B!$Ǐo޼YA%$}@g}@g}@g}@g 4hg@j]{9x4Dk&O̓v0u4lۉRnF0h@w&H }ܙ=RnF0h@w&H }ܙRyO CorYG=s ˯gg@8EjM92;n73c }JHMPwe>'3ԒjO}M' r"u5+]^MT*:-[4D}Fj%5sLRcƞ"ʫ|Dzm3կ FgTN*SJ,g}g>Rc>*5&PcԞm9({D4Ji6i}F}g>R3 Ai,m{jbEi6#5N΍td `g@'JYoʣ\erG:G6\}Fj%5=}VJk{LW+hF|{i9i<gHB}Fj$5Qe>>6g@Ld4\O> 3Ajӈy;65>v6; 4Aj 3`Є%5lw0h԰g RcΦV$oGi 38 b4}hdc)NGy.ބ.@3 McKN9Akh<g@Akm jD&>@_}dВ x43@ZJ}"0!G ^UIbUc2hI߹x4InA4) ӯ: ڌvw 0T [z p)ggY ӏ @}lKI}0U-`ػxYϒFgh@Ϛ 5 cVmeЦJ. 3@[wgIU }lH4 3@|9Wvg)3-y.7 3@\cF%/CVs 2ţ}0϶0,,kUih<gg6ύt\HSx,<gdf)Hӝyţ}1\Ӷ%koeAQh@l"J6qg@q.7 3@y gk :G iVd\nPƣ}ق6g)>ފG )]ÇY;p)%Tm7̠m(с* 38HgԳp_k+ ڞ>twLNfYz1mYȪlƣ}ًdo,nvD3 InI;PhВƣg5 W Nێ>[fR<}F@He3ĝmϒhqNG3$Jᭁnz?YA%>@s/-hz>ur6C3@yj;KĠ-x4 8/;;WmeВ3ƣg@w{d ,Ҳg;s :@ IqD6o QlCNƣgH`qNeV)dF` >,eNg Z@k[)1="9ٌ%OHl% q\~m1.,e;tJtJS@@<9!-%x4 6K%ϒ Mc /x4 T+1aDs @eۚIBwzm$W9m7MQ0VwN0}vA'3*x4M3hKS,Yl}AKIt7 }qCӳdӒ o`Dr}OІM61A4AXsWX; 9YA#і3 >$[81ꧭ5)mA[Ix_n }V Ě4Hm~N7hC‘ -*};źW2A isgS)*I܋J@-q& mzoelUh8ݠ%MOڢ$H4D}Zu`!zhBBS3t;'>'A_PE%$>Ɲ BΞMϒ-o{eAG)*  >τC$jbwFMZr+ZA)* >;TqgA΄jadׇ.%AE%g Z[5b%+gm.R/=D!~.yFʠ JJ=E"}@qg>'F3uBZh}PBVmlggJJ=E2@tgla3տAY`#-Ga HO{J\jhv9M5̾]s>'A;E%E_u>Bjs6yuB"$)k;kN u*S ܞoꜵ9lA{o@(*)*(*gA>g g5kg>e%> S/ZU& W!kPpc9^>[on&4DgS#Ԙ)k8K9 *=4ƴvaϑ :j }S1Suj*FO1&jg=;9&$J}v;Wz) {'_HT5/RԵS?hQTI1:s Il!fAP۬6}@g=+{k*jAcHSJ>S'UgT hVѰf^'FΒmvDsil}DggJ}Vs굲K?kZ>:YyO&WVI9TUt>Z1>&;'>ezsf3,VP=M g!ԈjZ%m ; l:29b5}hs"托qmJJ}v>.f>t{É |s"r EsL#jki,ww55PRQr_rhXIuBv;;KbjsJJEeԋg9FUzLgSs45]Q_xG?'È\RQ';ωMQIQE%>>X>J>]aVjhrE,kuƯrj!uB wC2o ^1hBQ;j&wCR'tF0IǜD}N搤tVQ 3>FIbP}A(* >τ$;S'$NǝgG$38}Ơ A9VoJwv>cЄ3Lp3hjW23MQI&3M6;'>֠)* >}!e*\>z}Ơ)*nE%4!W\Hl6uI?_D'imωa6܌ `>CbWpeXp';N|̠-^$}pkv;%ACgP~TYxk,>;e](a~[0D5h53s3_ #њ帗H&d3Tm҂)hrT3lҡpvU`l+NVs= >jBpAm`3mmUfeU@$g'hI*UBk}ƠU +}Fg #'R7=z0d({}FĝOb80P&ΎD-1hw͊n}F%+ !%&9OqM %VٚL}F#3ߕ tw}ؠ rlt>>j~^ 1*>vm_ lm}16 3m11ET(BgvU$D=V\$Fj@NSIHƒ]DR 8ȝg &ߨH4:>oIHSCYƝ0hk>L g0+TV5ݝg777. }B·*@QQ5KwN29 <Դ>-> ǵwVs~M}NB#b=b=U6C>|$br+<1KfwF̠_ItA4π>$l= h3Am:Ml`w= M@6Iy9ibtLe6|Xh: V$H2QLcw3m,L=Q$&7cg6jn=~ӚfxXw}vAx꼢3jnؓJr\U*g ؅4V4:Yw3>Lu|^ű}Ơ=dLgл0 >䄋VwfMo ,QD\ gg69Dϳ{83Tm6s+7Szxb>πAJFMz de&*({meQRÌ+&`}A-QҼlj'j3}Œ'@ԁ-ޥDg9xň!uDmzԵWwW3YfM}F{P4/IMϔ3y*'oC6  >u0I <*z+c=Wϓs۝)rbFic7;h=@g*T@e pvo1cQ5E%π>b+XCcrIJ֚/25BQIXTrڪkEķr+} :8Z͋J@YUbl&BHU- 2dpgټm@g>S6BX-v A3gܙ`и3ZӠ{S[6jDg^}ϱI0h}&$ !qYܱz4ugܙ`vH7&&m٣N*J*{)b>T$99Y) v*JJ=E"}@qgA ]'TP34.ܱ꒣qڶ!WSTRT)*FGgY.vwO KuETҰ3uB -:aL]@u|nٹ(QER/QM賚bsy`u c=W-ja>ywϲ @6Q8PoL MY5 |ROVbH2NQIQ4U)g >,jN*_5> *6<8ha?2+֢ 5lsʭ*=TMId(*)* )*ggS^Ùjz58|S# R'N\͟+oh9j }V׊ɼb8zVslؘ?Yi賃Y)MAQIQ>ώXϹU}0R/mTS*V?)װnyXρZ>S'O0G3}D瘮U)eZi @׎:wKUɶg ޤgڹYgsGZlȶ4Dg3IWUwDk8N д>S'Nh+}|s'g KMNQIQ>ϴ>'msLvR5l[>k_%>k]{?j'cRЌ(O:az5AI^IP$ه)*)*6>;WL<^gs$NB}{혶IOc1Ni&& xVS1k!I[IY41AnFQIQsg~5I@VFgj.vck簗jk*Y4F]q5{vwT/નyHSj;$v4FT'4S4EO$+*}`$!`Ðl;v=Gt|%:J'3)*CJ@1hQdZH_! =;32uu4&g$g)k|Iϖaȳ)* >;B1h;cww,;-+oWؗ/-E%gG3Mpg $aPsjfAc7lTLQIpg}&}[rHrZ¨n V Ջs=ا&M<l ƠI!Sq g)zoQ 3Lg:fvKqE3]'Tvltpn?>~$ZMuܚv陎=M"982|g0T$&Sj,ٵ~a cO QZ4J[sִ˷<F8=%CЉ$6/0CmB`F}Hc\a!ƞ=kgB \Xd{ &s\@|K"S6='{&qf1imYz@Zq%x;t,Ǧ (n[qɝXz@A;B0 2VS 8ŝ$qs1 ߁v:n&>, X4XFR}ۿ2b}*n_3g5 |8ݝ o9hC*p8맆XʍAϐ̗;@"f[T+3cN踜HR#ncw?[mCdgР ߯W>dsoǢׇZNlޮAϐbŠҝCKC9։~w ?qik{CN?  >Y* U.jMSYĝ5V?tcU)7gg8^ a- >Էm4HLO|2ۭ\(-4*VW5vy]ϐ, quQԙZV8Hv4آV:}mgu;Dž)f&V\ͩ-f޼G\m >4@ҺdqҸo,qq0$ }D8~w\sbaHOv8ǥʯB }Dg  9b=)9֖Lys@ACV_|ǬMcMmR(K,Ȇw?3{~|Ϡ_%tpGAByt4Z*ORs0=?^ >1h9f?ZWD'O3^l3-ǠgH}ƠpgC% ZlsƊ斬ݺe3ŠgptS9w>ciB@l6F֬5m.i Z 9b@g4lb)CqtWId$A;I3ا)Ά/ QosCigsd;P}Ơpg+m ~#Ʒ賲W'y4 3L]]7 ;Zeg\':YivDdׇg;I8(}Fk3bwv;r\,o3Chc6A>SiM4wc;4=8jBIm[$ Rg lDJr@zdh pgʢƶdʈK<[&.l+m>T ƠpgSz>=Jt,xz:>w?}9aYY(ΞY[y1{ӡ>;H 3~D`7-{6kRפ{[KT}=Ru`!FoźWݢrha j3IOv!v;˂gܙ`Р@a|¹SfiqMJg@0ɫf Vx:ʓ#nt¬E% 3L0hܙZVW MzڶRU6jo3O]QTb>Ɲ_%|К;J<8 &]oo.MA;w&]-4 s9K*<*.=l;{STb>[Α,J x U[>pnvgKZ1MˢMc؉e&OLì)*-+*53L+6AGg rMCM]fhxgS,hi5hJkJG >瘚$Yڙ<:1u>`ge6za dSTZKcԾ3>lU>W6A5g)GJ:uze>G5hkszKPA{fY :qmTsr`-5O%6jbRc6^@mPAQiMQi>S7@9H-UʳpcZXIͦP?֠#]_F_}P)ԯ*W" fB*g+1YmpNa5#3 YNYzvf=W3;+_GZ mz7$-pauN5CSXV{jbPaCgq>]NQiAQ>@B곆sn z +Y g;o!I9T hƤ3i4 O0a(*Dg9yiV`ƍem>lx@uƍu īMj1q8T0 +lvNk}ϭg}N$}u5/j\+IV{([dg^޿rVԲ_5 jD}̠H]b} qYhXom5rME6W\̝R#uQgr|ڸ?9PwvmkS)*6Ϧ:L哘N* |Sqm*'uu׼bQ>;NNi>yih6y*Mr6=G28y[amAe][ps =&Eeԫ΍**}A-[ey9hK`>0O3i^:N8wVi.:صdl}1- Ee>cj.ƝMZVS({g%Gq'hݷ;;^2Ǟzzg/$$$ @ q͍la@ܧ:@0 hhԭ0QݥRwUV~Wʪʌ}s uK_+_2UDwp;Z*g}Y,bwmq@&QagUaJ+*LO=WW9Jk>c i3h¸gƤEA.T%X7hw@gw 0ȝS$#+í  ᤴrDw&;N$`;G ]ѩ B2Ѵb9Q]8M*s@{>vk<־S<JD fwC\\l&v }ٯA'AAE pt\.9Dز> }Ơ}&5alïVR07n p@!R}eɞmgcSrݾQfVIՆqT1v#<>C œEm;)PNJ=^ѭU awsĹ}0 v"@熭ó<'8GԪza xvI(  >_3iocЀ;O8?Ez'N._[D#7V }suz}&9*{/0VGT=# gX]ƃaRH;Oqٶ_d9rv[I48AƠgC1hY>06]RKu~].KǠgC'tPҠFg+W+vt=Y!4 J?j4G _O͝M<[g@|ƠzİMJ+\MS< rFtMh RMU o_GO[( >Aπ;S`*[=έ1٥? )|z5g@@gPbZ Ai¤n6w=5Py=,g V}o !kJ+/j;a}ݙީO~O3L2J1hYU|,;6q0 V\CL|$s΀> 9 MVČI:*C۲{#jgIw(rwĵ+nnvVe]<9>ثgέ\ DBmG<ej}na]<v@gr{lA<@D%)wiOǣctJc)ԶJ&ZW }ܝcPIP|=I?S[ %s1_e/>Ϡʠ{P, s RiYs6G__WZ'pK6}<z yĦ$-T$CtV:ᾍh_.gbg اtp8= Rj,q?3(LYKA&CVf ?٥~΂t 6g s"@_\F)@ܹbQPv,kuREV>|̓ ,3O(zFMCR>2}%GyD̩]qB 3L34$Κl;{48E/uQ3CwJhGP`%@4 }Jnҹ#xd+$=tgbAƠ}J&[``sv~Hvn*$=S/ݻAP0uIg W;8mRW:!Mt=+,sN=CkXb#uj?qT_ϐ*PA4CP}Kr3=„|Ҥ8w@/-nqg@C&]4!?H s+ܰNԪ>_t'}9|eAsEәyvDm#!'h@AR4xRÔD.\W{-q,M$ _cqR$ϐBH1h 5oQ_׆x#K֣M@0h@}6נg0ċ~d%~D3IgH>cЀ;j5tVvܫD'1h@V8j+ 4׽ sq'(h]ADvh8`qg@#Ǭ1hNq339RiaB.al+6rrWٲqRqb>N s) B9R *~_`ing.{h[yKpl1 F8]gH\1h }vϽ;˵!S>YCqNvMU=JcQ"Us7t=sD}s Zi)*O ].~n {rgCgGu2]NKn}3π>'>0^<}̳4ir{,Ok\9N>AC@opD} :f}Ơ0*siaG:sXrCiq& g}g }J&9jfe1!UȽ3 3(OƠgIN5_Dk'g@}Ơ!:}v> <: ykkپK,1<:5J1<پd9>CyZRMMrw@:}36qҸ$π>4_2C_FcPRTTi$fqR$π>c4iYnljV-!Wg-t+Z'}YC}Ơ1h"11w׋kGP9N>>nМI z_ʍ ]]]c_8> 3 d)zoxV!!Lh8; :D]!d\lL|ԝ*8qg#:6h$F$=N`뢉:M >CNDC`th)YU6泉*u5c`P+Ylztj"g9g 5L%3J4 >C ns,hli30e06F-ָ3"h  #Y‡_Ϊ`6zO}SY"ZVlyxJ:yQ!u[q}M Zq;yK UKgHE>;m=>,;π>c`Jz/LsDkghF Y4 >AAls6wNÑAs3]]g=34>+/vtSud֣,u P`A3Dw~7%Ӌg_wN>N`:7>C)b4`Imuux4Ŭ8π>cд^CK*v#vJ:jJMWmIhl>řԬQn 2htaC.{Yv^aJ[V>c$0賒bk8 xf}F!ڬ3/M5t=i(<:jg5iu>π>ed/7t=CP̣7U>B}Py"nEۮI5YSU\N34bbJΟ;ۺ&nV{tय़p<TgJ0h }b-Ng ה#e4 ~)MZyb[Y RNhSjw9π>c$0t8' +J'+!ag@1hTL5ә}wFs@$P[ HI¬KDU/]G>S4(_M: j:xڭPn:wC}F}Ơ1SEaWf;P;V*uVi>π>ed/tg%yu|bOdg՝h_ I@gyҴR1hYqD9Dǚ]Ώ92 < %AΚQ=.`ŬinxWxytm 3lA'{+$lmWI@]T:(_( gUAcCkNM܁>Zqԣcn@n}Q3YIQ@?⬛G)'g﹜ocиkqFv9λݕ,LB} h0>Ϛ륪EG>(g$f]TW.fڕѫ\xg^:> >KI>ۺR{􈔴C|D-ճ3o('c10h@Z: q0p$֤x5QfU "K>Gwܠ\!q_. >5@xtEU=}@oS{ 7$L+dMJ` @x_4 gA WMUY0QPKW݂O 5 3 ʓt3LMcMD!O>π>cКW.@r@Ӷ:5@qgg#rݔsGE%_l#qF}cǠYä́8W\Yh'ٛgbRAd35z'e'}\gh3e3yt82>LrƝ -qƝ9N 3 H’7*Oz|+Z9-iPz95q2$ϠA죃AV yfb7G:-,[t䐎lԽ5S-'Mt.I@}Ơ>_$!B9R *޿QCrjBW}8'qg@1hp/e(-tϽ;˵JQșfq.^_~v3`SR>cZӒ:_ 3ʑ3\RKz4Ig,g :٭q UՎ>cDop>'g@}Ơ6h \OZqD٘L$ 3Xt hzt ϺhE 'xs )wq!- 19֙9;xg3`w8{^xsj&E9N> )1KQxPz Ab=޷q>jBvLV =,W^f> fxs :p7vDH r3kI=>>cкt#SV7HrBM[̦_68cЦ'}F!tt٦c%,Ԏݓg8 3 5I>p'a9km1hgiA+(V-и=C+53JޠΊ-Р=4%DF$ 3'ͣ:=EG6aXl)9s-$ez&neCkBF_SD#:dqgrf :HC%ڮ,#qgٚ9Ncb1[<6Ma3s+hT &3eAAo_u[ket&3>\gir`=YfO3 3lJ%Fg}a+%(Ѡ4gjU+fSLM7tX[[7e9qڻ3 v{qlGB:OdѴD.6uSRW u>}j)>DZm4[0 7ѹ6sS*3}2נ|տK{i`qV2Eg Cm2h]Tقjh02Eg C5h6\RKۚZh01T5z gHy`a( llD6nfd-feƚgLxjd񋏶5f"|Mef+MʗYh)%? 8CuKgͽR[a:DQ?춉+3>D\=6}Myf}ƠDMPk6bv8kX3 ]Ɖ ,Ya1DCR[Q\ެ}@c'Rqt )+ N2 >ϠUۦ.4ImJ sx4[ۀLm3tMÆ|fD dlA{O,>[fg_]lL%3h$z4W&JQ'B2π>CECVK"Ngf7Gf@D&uJ>9%/Ռ8W< R +˳}XNC`"iv%jeᫎ:Tb(3π>Z |ͭ1 P6F Ӱsũ!`>jeaF|o &r+Yn[S-u@Qf@n&I\?oȦ{8JS[zf@}E :[5kC }as{}&xteaT]`8k4!k`>c%^­᳒y0gG 32K*-ס8:L(X7 ݔk}ss֠u+dIgXi~1AVUZw^g2wՠ5uJkҶ}P rn֧ݬF dDRucoC)^g9=lAkRHꊴI+_2s  l6hLPHͷWb|Ѫle}Ɲ0/@~${*thN9W:X33ϸm\JmiBЪ-0xg>> ?$ Kóq(s"(jF\QEuUe@g*!D5 ^wNAkېNG3 g Z[Qe<8X'usK4j=e@}m5hS}Sn6Ek@h&>41hq [f 2s@}bcH1 r~CoàMi?'yr@} ͞ҫڎ5qOk~rb >Afq5m@gHAfMAu lXFSL?g@AO/ WkYlz6Q{Gfg0"2h>kaX7T&2ϐfC͕2mhR AkQќ}6&=( NT5qHe@g9A\$M%{bPf}@s;zcFi?g,g9A|}6}1z"uG9.2Eh;54tĝ[LabS0< 3I)(7Et:>n703@}&8PX|!mjSǣ}@vr-4Ժ;зw jj g9%-vtoIf7GB%?d0˲` [#ڬJYxǩݑ}("mY >Vӷ~"lVU͒B3}@Ԧ^tՠ-xbTD-a"^ٚi 3am%봐rdhFg)"?<{\M;nDIg5bsk-d~^ۣƪZkFg_ѸuW^ w<飬->>kUZ :)zWl%xUf+ ŠS:eJˠ +m#F4FgYaQ}]kY)lXsc53lMDl2c4{˳g@>-{L :ۺ{9Ag.cϐ*FttJܹ4;j\G}@ ugnAGT*@첍Tu~*>YIr<gAG:o2C_6>^sG `igq3X4C igH.+=U%ۦOdKO3thYEkk6 H)P}@u΍uʋA[ITkR<# V8+_G6x>3F+ ZOw6f9~kNdkɠ >xOg {x{r&J5U YW3lS>lJŖ|q+;9>nU4s:@ҩZ e0J>}=?9%ǠgWhvaR7AEys"SĠgWhG>)&10 jl>e܍>حem#Q(slsSe3 >_e>"3; 3XfܮKnAGv5thz9lh<Nܠ͹~Ttbk2+l[gܙ;ve..֜Fg4s#*.i9f6RQoV.NA3@`@ɷ4`W+3Wا4 >Xω5m.M% kl%BZѾ>3DF$I3eAǦrJZsۃ{5 `>_”w:c%gRKWSn64}@ω3-$8X޴]fka}661h%=+X13 #R;nv'8"og`9oV*)X񲍂`flipg6sLcPk{r^ص D3>Oy(%=s0<Fg96wZfA'n3 8L>ǰ".c#A" F4 >g}R6J[g}Ц: c[lH>ۗyD `J>G1 HY'>s m">賶>>y2L4 >$4(~~=KwB&a]֨[Nyg@sN7#rī43}\v 3Ϛ !31\ >nl8}(b_/${[>\hxzf=}٠g@6T5tT]ңoA,Y<zp/0ZfCJgh +9opD ϩ5h6 `>Zn!:j}BZ}F}ߝuφ A9؋-$}F<6}V2m;U_P> }Ơc^6 $_H}kl@IVwgj2^qF F;p`C:sy>Ͼ\8Wg U'P3Rqn Mtg}֠3elhsI} >De.-sD58r}Ag&*`dGxlr@g(Չ9o4Sqĝg Le3>GavI_.>9cl2WLH)}H*MA`Mf.Fį>{}(sK_OBvej :X@U;'{eө5Yg@4o.%kEbS31}HM2 gBprJ @Z1h !pgBprxW3d83pr!8T<4d83:C諄V*da"euʽlpr~Ƕ yӴ[g-[˭KU%';|p}O.Q\8Ow9prPΪ\h}.7eA p O)`%aU*3ļS[Ywp}jC\ɣtVRr% ꣙>ʹ Sqf /u.nɹ-ǫg0e2Qzf83ϐ6}v9z<AKa>δKuCů[”qީp|ݘfb> 볗³y}(.Ng_>e_o^_M`NmeDupg@>}vH}p첕'"}vYP++^}> >zrx¥g!ʦ g2}t%gN.L{g>ϐNm_:2gH>'>FPŋse>CK~LW>e;uj3=A}9 ?`~~LvO:3d8>Ϝ\N.4;A>sr!8D0:Mp2@ &g !p}Cwpq}i'h h3 >3LE>3 >3>3 >3 >3 >3 >3 >z3AAAA<\~Sg}!_Aq<;x/_PN ~wwrʇ~X|]"{o{X| H$'XdE]$_^_~W^yU%}vwg-vxmM uَlg>r/:AFdno;m  ":}n~W_wjMQn:@|UDq+--|#jijtZ|~g{kw?=}=N8|t,o}EwWowWwgǻl9  ""}޵kWST@}. ϴ{?lnn7448<<4"CC)xȦ82qJ -Vhmn  " !|- "(1ȝ־eΎ.)GrB25 t Y_:F8 F9  ""};pQ{מd#wZ^loK84s׿B?lw߿Sɽ,Q:87koڷijK~XID-zo틮 ĺq3932G[Ǐ8\quh[,DŚcy@;-㾗+S# Wt-_}ٜ>wteh L-{iw hyHslb]F!M9]QOybEee:/Nhz!MwlC$c5=9\r+׀{e#GA>)}iEnm! &f_ ͯ8j3O3łZ=7_q dNZtު{^?Rɡ=Ovɒy^o'vM+rΒkUz kM5o|2weB+Ϛ.TYplճf?u9%op9׾j-9 ]|L|Lǖ2>W ϥ-Wu/yٙ fW͞KtXns_[|R&3{uq!^=~Z,oe/_zr,+|\m [8-_~l+7Օ{ޞ^-koBzO ?zKW,!e}rb1]"qJtY΋O_Yrݣ0hڼ 3 Z0k/]~ճ2 ]ow-﬽Seh67vVj뻊ֺ!ָ|e./Xpn&3z/ۮ3IK~}Յ͟%zު_-ûͺT:߾.3ے, ;7\3k]s# HشB݂n; \?0|ӝ鷫 zʼn[?\*Çgp^!.s^˄wxt}b1ɯnfƆ5[Vg 7xhlltWW=Z+9,Y'Ç?X66!;V}r#/ vܘ=<62mu/Xg֢nuf[k{dž{jYY]]"RwRKTҺTB\ҙlͿHtWMGLmmsμw;_13&9={l)*.p)UW ąo[R0⋺Fܝִ˕gs?o +8_]{XJ-]NY8VN얎ޑoÝ=vJwF9  ""}>Ok[_^=Kn~u㻅O;R_cǦM !y?*zbűo}"U?' B[/ȼ|ESW,O3_ćC}wg2[TJQ+"0 *P_uKdLɉVbcVr'ʕ}ky"N-L6K>:Vs煳Ͽk[[blel#.ws,牓*7'ީJmOr/Zo _Έ[\>R/VʶE(7zKK+Nm)DRmospnTl')98  yӆW=Pu]xŚ{٢${\zǟլg=?7_;qll8=4m=B\꼖)ot^%ĴA}[[ǝ]B'^%C\۟/6!fO~ehs\y f_r^aL"sGӦhSёDG_⁑R૴.U1gy|;CٖXnrYZRTm\ٺsњbS^ψ_:_ݴ*V2]m̈Fs[6r?R;Z;[RIZmuqds6-'N ο_{ӴɦEh;x-?el:V ·Z[[ײ2gS ;O3g{5m-v⌒hWh6MSmrwYKb_Ѻ[m rWfo㫗ŋe5nHihbg[wSzl  "׿_7￸a9*?w&|'u^i_}Hq|6O,=83fV-MEHK~rom{܎#Uꑦ/R*ħϭirok3+)K^8MƖ&eʿSs/[:Z߮\l  "^y/FtHK;}C?Nϟ~;sдRT?T?4xġŪɉ2<ݶzz{8mVǤItN-a9}T{׋h/*Xgo>WpĜN-wIbePļ^_uc['.˭֌adezZqcv({-*K%?٥zs8Zhi~mKI6竄h.M]JjF\䇧}[7\7{Mo64oz[4*e:u[s^[ke#GA>G=tHJz_)oL_}]=տ3my{W_w[;_vG$=ن}VWϹyk=l(noO[g;5mA)1da qQsĊ?j=-u9{hN|3շoӶՙ?;]$Ϋ)Ly3䱴.UQƇ==JS^2*1ŝ=r#|co_nq\,XT{ qKi;gV[ $qڷ7wŵ<[m A``~JCev:gòMˆ-l~bmsc}[sS[d^VM -J4+X_r͍VνX'?tz*7EV3峵/_S=O">= =VWeo|qښ\zg}ÿzeǵ?x7TϹuO}LmIJ_y7ƺwq`Eke;|:!nݴ:^;U(WWe2W>uw};7?^(osL]wX|2{4 M us|ђo)ZrޖmosAADD=z$'9wrd'ߙ}/RYbˣ^~΢2ꓗ5$~|YUs柹'g3"S W=Rִ*E}%K2c!N|ݼ+Y8Jd? V\Sq9yKmYܓT9Uk/=V3䱴.UZT/>ꇶL,ʹ-?=cYsO 1r+jUreoi;".!of5pg~e sK\v5wxrhTlْ.[6rg<"5$oN^A& u͍KNWIxٛJ~q,VcyB,/ !ܠB)r꒥qMkwLͶt(̶8>{闗%Ԝg]vKUR}Ғ}hSM[3qj/W<,{ȏ⸢|㦻3GO:CRF~oyg@_oIfʣ]!V}(oӲ%&-l޲;rRu4KqnjҜ24t^+r{M{iÙ\ׄ>7;\sM9? nomsAADDsO92~hdq~Ҫz??.wo|W~'L5Qy'[:MxɏTr4݁|lزynj8ؒk?T/$ uyIq^6* {SQtU]/nܾ{g55 ߹iݪ̂>MNk?T<4W7ߦƃ͹ c-Ͳs# H_xfݑ!Xzetzw}t*8֮S̝%2ϸ`]ϼ2oEz4|8=eЃa-ȯ>7;w  q$o('IՎEQ0ss˽eO_ujμ%/m_$^fyIwܿ/98  ?<<4(]Gb46M4V#[lޅ'})};l;ؘד9Cˋ|]/_DNw\@kp@1e#GA>?y} ]ww{B ݹK6\]=4(lNk4\c u|8Oϩt-A$Ͳ6{N݁sWG>whu@464F9  ""}~,Ϲr[ HoDzCq.n2i(A8miV㠧[6m;'um*4eSXIDC>_ν_4کsM:Sg|$98  ywt97NF˨MWԭ\hr {k~o_~-7?shnb]WL 5N&Z)/[g  "ޞ /?{cc166ĴlLkZlon(wvw=o5p3:ߋWW -!kO;;+/>#7'8  YF۟'>D6Ŷޘ;[>澻¦ؼi=g7         ի_    \o{ endstream endobj 560 0 obj << /Type /XObject /Subtype /Image /Width 1301 /Height 744 /BitsPerComponent 8 /ColorSpace /DeviceGray /Length 1900 /Filter /FlateDecode >> stream x k endstream endobj 571 0 obj << /Length 3097 /Filter /FlateDecode >> stream xڵZs6_ogHJtrL}cͤy%ګV+IڹZ븝RD >~7oOB}w7ln6i,BmL4M77sзwÅJ e[-ӠjXڒy]Iv|چ&aGt9M쫦=ͷwjvF: nvwmg_kk[LBײ=\|;RdqLҴHBt}ZѾZ6(Pu\¨+=Cw,cgq! 7B-–ʀyT A`?W]U~qq*iW {Ȼ<2hFQz\TEUo(4N#dP_ȡbfzT)"YTGk(QnE`vk<>6+E"3^ݨZ}bH`"#`Sm} )S||#*az \Ȣ؆){9f.,W[8La9JN(:9p f**U?.uZ'pa{&~,o{[[.}yq8yzLDGmLf#;{_tyWH,U]tBDL29TZں?*\P*瓢dp7bD}~VOcž,hg4ټA^-[?!jZ>ʓrd8׾0+ `ΜQs l44<;-U2;dNl<入)03:iV-{:lRh-[X{+zq};{fY5Aj>`p(9N>Zx=c7+T'TyN\ P*WcKelJxӶZfqWܢȲq+b?u=bgouS"#Kˡ ۽% \+-DJ(yD[["I(PT 9WEg񧺽W%јgG{k xg+ԓ1QQBC B Ur7`=(`P"'  Mkf2} a,ë9졙t2L-{B1"YݡݗD*gQm"DdaE>`5`WEr|9:(1gɒ)nhn"902봆N1\&49ٓpm ~"5R,۫_>rleT.v"[xS!L.@ ٺKh$s`ޮ{Jh W ޡĤ7SR['t+K-0iwN^8qW#%f I"ET8yrCeZ\Ua"rK+'8e[oyTHb:W'ƎcWoi!cr\l v4E| |ѩSR"tE"Yɚ Ԍ * uw1&"=1X&t(?q{.(|hhv,xiW) 9[Dp}j_:mr΅+0uS7p%<ɜWm~DjWB)Q=Kv[u $!ϧybg̽ȿ 37 rz%$mAmQ?Ґ/N^)&|uy;A}3~ؼl~H(Gft]m=9fP'6 eOX ˄S';HjNIzIayI(PTӎd퀎*@K^^hB%^D.Wb![^wFux (Kuo"3V*+"2XQ =Ҧ Ju"Ay(2'EfWJx,BM")$5 5tNE~x㤉՘fcux )}W\R$5 4F k"Yia =567GV:rڋ1u|DIϛ;b[ҘLf}2q3/Kj(_;B1x a c9XӗELMt%&xFmΘ?^c!"X_ &"C&Y{ Q+P7YK55$żV 24sD(EvqmWlt@gclDlhus,Rgvt%j޼B#H"uRZSNPb W 3wcaacN+iƽ~>p]}eONG3wzR#~sp$9u&;pڛ i_8?b^LkdGSNk>?55: ue&)i838EIc9'fMϧ r='W-zc0uJDh 6D={~|}o]n.wgZKO/{䞸r ܿAa}"»iiSUT!O8#r,W+P.lp;!#2%n8_gQ}Ouq85n(WL x)5 e7qEi1/D\G߇￯}j`u4UQ+%N"#rT=zPRs|Ab"K'cǍ޸Jg >|:u>6@cVTW<6)gQl/ޮh(PPV'dsx?F!4WAʧGHBՃ2ԛW?6A2)`R؆ܼygHF!Rɠqwgo./'hsi6ŖZ7۞hm!}}q:'1ێj endstream endobj 599 0 obj << /Length 2061 /Filter /FlateDecode >> stream xڽY[s~߿o3A]S[i}[ʘL1MY&$$uq0YMէsve& I"Mn&QBpH)'ɝkOݾϗ4o H$Ů>-js.=Ugmmrʤר&|56 \:é|;r߶ZA S xB$s9Ϟe7 HC ja$+ wbO)I@Yv.ǃJJgK3ޣݯk':?}.ۓ_AXO}A 33!IDIDz2{QgL3XV=YLY Tv= .kSˑ}1aiQQDE'fN_r {|9Rua)`9n\oeDU.}k 0'(6p{t(KMBpg|@vGc61o|h251 uy4A)Yxi3C ڵWEyYL?KD-, #%dOGCaDS(z"`1 L81w:`^Da5_hpphH3~/nN9/%<K|UOٌog3c>-7\8cMo98y/)l#5 `6#b+=X3U^%yz.R fj]ӅM֬++&S_]etBiGN4؇n8ns7ܫKdq] r vYk^;G$ӈ$4e9=uOc."N&$i H1[bCιO\w/Hm>*d`uTF&H[k"t x seJn"YX}tn! w 58iMlUUx5^@XkZWEΐmwX/lYv\u$a4`z u{#_&g?+[3J߷X5.X(d ԆM<\q6os؃: #DNsU^h5h+TuűC2#dKҏG>#)nc="A(㕺ŀ./ mߥ FOP %^%sBҕd {So1+d.!cJW]&y ťƅYu7a:LC4hWWۦ[3&8KgJԬE f- e^gDsͮc:rAү3H lSHk[YŘArVX[9i=/mXjs. <:vs^ 6HJBKX0XuqY endstream endobj 486 0 obj << /Type /ObjStm /N 100 /First 890 /Length 2909 /Filter /FlateDecode >> stream x[moI__Nh%fVI<,{j<;I2} 3鮮z&dg Oބ k6ADb0M*hrp&9s0)By ȈsN nkƋv[10nKdO*r9 `k)gdB);=RD⽡)C>R| }0LF_Ѱ`>98b:Bp7PB ť1b E GB1 FLTA,F7*mb`?lHo'h` KX^WT3X R2E btUf( 7hPwNT[}ȡ8dԀKI,\°&[ݓZZgah0Oas̏&ǵa3S=,|fhO'Gɲ6aT=nfKsò j=T>?xA U.^+ꓟ~UOQ4/!ģǦz^ZW#jm=Գe=[. YhǵDAɼT"↷h9t=g=l1HER Z]K{$I~T^ϿNgGՃf~Rzxɑ6(ICE˰ ɣݸ4S=2?O=:_.L˦{&,2Ub6ږY7vJvj|6فrymه}moE=_wHCmjo_DlT&>"Y Uڢni]US,?s0JɓVVm%Zg*}zL%m)Y8F;2П.FM/;\'o`We//nw];/+W^{8XVFbÜ3omg͇юj|3=\v1q,6pcB1CLߞkK[A= zEMRlK-߂{eG۱{E8wkASc *nG43xn!6yO6 d#@l~]zwЃZ\_˦"|V$Z,Zo1ڊIbFH˗pD0caQ.!d8!lURTԩNS7s}' ֔Iy._Ӧ׭35u՟SSX֐WWv` b%Rc#caX20>. nz isUM0֛2l_\*g(t55]!Wۘثm0SW[ I)mP`/ znS[6t3nk>uL&w!SwCC]NHwz@F -tV0;P $Fa\X,%0 EP<u3%EBmL^}pFN!wJKyh`N7;3Y =0?; 1 !n#nfwYdS2PgYB _b2;OJcG,AK2 0' ST0 ddXbD؞x,)JUj`n<1NMۻڽϽ|`,Ǔ ␞zCI^FܱbN`=>4i'A%@9 0>6M@@F0"=hU{@4$)j.*AB={HT)J"GKz;yWX?#݄Hʷ$)Yw``*4MO\dABܥz~`P2S{/SiS;ν6rVҰށ 8> stream xڵ[[~ R",>lNl6bt[oJ\ %=g.r-J}\sh%/GpM"QHL"Jh~/IDu%m}x54LH"FR-!!T/7*Q7H"-1D觘^r!'iL+'yIjI2O!y-4ꦮ|*^h\,󚬾:fkIl kkaDrqMI>Ļn^?i&>7e+MA1J $uqSsPt7ICAuB 5W2nv5t %EȦ(+B"oum @R(|)ԏuK$TMֽ[$'!NSx|CM䋃&O抙8_1v%U-O ^U-Tр! :Su8dBtPN<3JR} /U"7 _/>W|:ߠF1[>cpcFp U)$ISzծ,&O6Fd>-r944B`w?0k-㼾j_s3mfg;\?}cRfNر LzM 7Nz-I4MOp@y]5qfB X%.+P[7!&R],EĎݘg1,*!LT.S ɠo`}TiG`F|>OQ[ g䡺+fj~uVd!%QaD|v aaOi/A>'cѴ>#5hk:+w!V)^ts{ʖ{<8c{JV/*O#?}hvEmQbˮu'dtI3<#Kh}~#7hL%1J=QCb׫on"aA3~3Ѥ[^/Psڮ u-滪Wտ?v]gD@0ۖ](t1HbUYf>9ԘB#ZcJa,l*Y\|9104EIGt>kIL'˵!=+fuV:P|a%T+$G<6"+Y$023nzAH~؎\"7?cC8/A2{m(7 ma;)SnmPC v }U$F[ P^^OZ,;~7 ;*N'p\f9x}m樮ِe%+^P#.kmͱiHv~:P(Ap@w>04~se@jGٕ@L:f@o977b /lY܈% = k-}FK5QxwxSK4QPjtJoJ=EU endstream endobj 632 0 obj << /Length 2868 /Filter /FlateDecode >> stream xr-`ʀ/I8Y$&MI"lBAIHtnt}{p/n_{&. ؿ]$ c'MӋŽ+\׺[t*rU N[zZݮƋ.2's/lsR/W+; #;-byWSK.feU7٧-NM<[qWjN7WSSSz'x!kCOr@a0<9D#dQd~^_.rO</Ah1'}32t/Pp2DF&R#cOȺyGqA})` 0Mtbڵ ᆖnSd:2|;܅#E{ +E%{u$!ίEwr@%v6il5z|f?E`B2E% {>$)H'alxbn =J܄)q9VhFhjjmFyZ164I`k'f81c߁2US۽tv*Ktǜf!/LÙQF(]SOY8:lu)GdNiۡsdR-f[{U7GU;x<%hpè0o;q54.j;7$X,ORk}z H=wNXpp4 FWH3ݲ' BA4uY RRJDvZ[ngE.+ n1I _\F5OF=ъIf$"0jQ pypMOj \g \:Vy,gc_J;XsS1겾c ;ռFZ$bUCevP'gQ7|iO}U"v-IdKUI r_7 c덪w7.`M*)|JrnX4/"Z_JMS 'ýٶA q\l.ʂT-M l0Hˈu6!,0HMgJ:0ޏK ;&ևB-DRjHAy}Fk(;ӌ9y8!vt(rjrY0jDЗ]q itEia saoJoa W= 5QYdQ2eGthB)@aF@gBAS#Q 9k±]V[ 4øi@H긐%ab6tHJ PTn]M`0xF#ZSrNS3I$Ujub !ڌnmRnq恔ɱa_m EBUN;[Kk. A]ʳV1?E1#\8^@ae2?~-A*_b,e.ʑ>p§|'%,VL֥ÝI?f-KSd^Y:F7O+ΓyoǛec\rQZ?q{&'N)c'_3MRq 3l٧˳/ω 'o ^ԍh"\yn@&j[웟{P6 JwBxVoy2= c4'S-NRH /RRy L1,xq41|/zL|I!t#9 F<~}FӒdt`LUx5|l98i z]@01lϻW# endstream endobj 644 0 obj << /Length 250 /Filter /FlateDecode >> stream xej0z=JZY?Vo-K t+=W MLз!n 5Hx"b;a5`B Վ,Z.kdhi7;yq睅MG,A|iZC Yh 0 P)+|;-G> >> stream xw\SWsC- Pj[X+X*jmVUԶZEdhY8"h{Ȇ0צ)  |?|ܜ{sO͓spG`8 ``#ܟYSSԛ1c x0y{{:u tRh#(dɒxh0 àp0       q\H$_㸭-aiii*z*a+_z5a֭t:76ZUKKK͞3gN^^<G)Nu+VXbڵkSWW-uP@ ϏE%''www#p_hqWjj*aLJ7dX 6ӧO3 'NX[[o۶b>>BPqwGaee)ﱢ\'B뮮,kW\Aq|ݖL&ͭH^PVV̙3l;6P*NI$D"!ʯ[(&&FB<Ѫ\ @ ``bٳgBw)--ʆM6;;;z-MMͅ NjbPAA믿w7f0,""?$$d߾}D=>sLbb޽{ڝeII *,++sss044|7߿/6!!!,,, AAA5WUUk::: LHHP$(*****[v+qWJJʉ'+TcQCF)24s΍0aP6tqq!555錞h``~… 8p:220bOTTTGG͛TsrrOڲeKiiixx|w*0XPYgMMI$CBBb*C駟 F\\F[|yQQwء$Q>--̘BL2%""fw۷o޼y7oVE9›7o*˲e˔U()BD" {R@ЋxGG7#G&;;{$P(H]]>iwX$I$2ML;44H,]]\&BJ`0h!Jh`h"h4&!dd!GN.WF/55O=}||V\0P1L6ڢBk׮9y JJJk-!T*CN6M^XOOXO¢1VTTSOOƆGIXre{{}}}]]]'jx4ioo)5AY*$G*+dFGG+h)x[[W{{P+z|~P% EBH fWHM\.D8:Dbd2ɤ 6n`V)CG$ bIOOBI Ȉ!"2`C( ŢdbX,:Eghdhl6ɤX4.fY,p+ .|w˒oo{{{{B"h(+.]_gl  <?qðj1c666) :wSu9s&55ػP( p8/_x?wAArwyXLRBDaDO B Uh˕W:88 H9P*lmuweL+nESdҘLe0TNr5L:Bb$6=4Ge}}R>-%AO_W" =55Aogg ) :ɩip8y}zsssЖ-[.]zIK>cvΝBL#_zGZj$/]dIEEņ vE DR&Y(((d633 AsժU~w̙cǎM^__oiiY[[Kuuu- ڵkwnnnJJ5 #0aD"hWHD"ki鬫hnw46  ζ6a_T^F#kk3ut::,]]q::LKWd0hZZ؜1T2Jr =ft@jILL7رcٳsδ4 +4^__͍Xyĉɓ'ʋ͞=[[[6%%O?_/^n```ll|`}};w~YYY*v#.^xE"UٳrEe_>&&!%%J %i|9}}2^w尰`ss#G,YDeCB"O9ZTF;j kojlܿojwNy!DK_ch!- KGdҠ12"?rB:w\jj}0 q?ݰ_ >*RaK.  zxtvVWVUVUE" QNq 9Z&&Z##!ȈK#_}ՔjJj(FEgF+Tv>E1E04䘛ZXNlafc`16qz1FFF~嗻vIJJ222f0 8^WQZXTPY R[FLB-,,,t]\xM%2/t: +VXC)#T*i+.n()i,.n,.n(-m".ެô6 :y ]CC.4 ݻWW\XTP\P]ZW.44HFs]RJO.0*,ݺwk *+[jΛ7֐фH^2^Yrnm~~]~~ݻts玷331=`iiiٶm۠{0jnn͛q.u>_C81b!dR *+[33˲++[(_}–-^..l6^cǎݻqF33ŋl4Cw0BRl.jxQxjHB--„[!!..[fO˛.^a֯|{ȿ牕gbb"BL&>}`8{nKKK&VTTD~+ŚxYZZ^|Y1i&cǎk׮-Yދ}7)))'Npvv5kKDDDIIIHHX,Ș6mڦMV\ """"""ܸq-ZhΜ9ۺu˸qcPEUUk~С۷ol_ Olٲk^p!))iٶ ,HHHx7x [ZZ͕[ʾmNx3)Z54HTbG 议n::$.Wbp\&ѕFp4 pk]EEKY-fͲ 6\.P0Z =<<\]]kkkB466>~8D?~HHHuu5Q~߾}͋ؼy3J?~|NNN\\|@dyLMMU R0xd^^^l6;77w׮]1L}:...))ԩS?o{=T˖-Sn'ͦ/_7ڵǯ?G"+a`< {{ !R35 wZZ yHhii*e? `ffWEE6sLm͜i7fxaUTT*&bV\޾~z___WW׵k"JJJlllH$BHOO/** !255EN6M^P F$͘1֖X2@!Xx<dN"I& H]]]III111RŋW9s|smmm8=j-dH̙v3gUV8/ׅ^Lkh8PISts$8.SC$k)+k"_hjR9MyvF[fut::2CS(`<%%/(.Je6~~goo@UUչs)K._*** ~Goo T1  H[ ƌبQv9^paƌ2d"T&ߊ?^,STPii);%1`999D8Hӧkhh S0*Up<<~8'>>ȑVTP)0LK@Hw(BwQ*,-mjkjo7Lm%hlffF麺V:|;3gΜĔ;v455ɷ/}}},YRQQaÆ]v͞=ð;w,1sT*J7nPO"((h׮]~~~޹)))ժaӧOHKK+((0112eʂ VZeii?7_Vܣ8-ZE"r Ѓg(>z4cdh,T{В2M,Zrsͦd̓::L]] Hx8R,+….ܭn52zxtu.^xE믿g6X 44f޽ΝOMM]~}LLCJJb ի;w1 ?s޽{w͚5:::~~~//(@,˗‚͏9dɒALLLܸqcrrYڨTmvɺ:33ymذ`(1$$D9zGקO0W_y^G& e-)I::Ѵuwuuttw?)3&褫fy<Rxh 0I-.]b( ionmu ۻR܄ɤ0X]]2Ԁd6Jg9s'#H&_}a˖樧ǂeb.(hl7++[rs}}\s!АC\Ȉc`!.dh51тIj/,Hh"23o={}}Gc`eU+HpVUb⭔Fر&kָ-\bf -Y~  %DjI@xjn&5FA[[WO?s kjRXlbWO14 , Z0*3 `$i;}S7˛].dkk-`RZZT[,lku55 ZZmm]ܩimXGOede 9l##L#QK066+>fqq &Ax.1Tss]ssuW(#棑OL(wIPW.<Jfp CC!G>7clСO``JeW:u…RlΜឳg :baka:Momjh44**Z23˚;E" QDXlcc>XK_el61c.`@ F?{JʝΞ_ݷ}NN3f@F~kQIkMM\!Ą16sLLzzl-]]$h R0,I:qϫW \Wx8:CW!w74 &%F9hdb@9ePR0lW?|[{33:P? 0rEII=Μcd].^L]QeeMRhT5kܦN44SNa xH!wwH>T]ZU՚Wo[{{l27% < 38OPyy^LLecc2w|gOFMx گ_/qߋZI$lx)S,N6555f̘aff^L"V]э0=f18&bvacc.dx O̽{u_}>-M7lX0s zz_}g{;C٤ƍ7*Z)ͧN5n$  O@[SZSV]V]M,VUeRBRӷLL M HPVϞ`~9c7%0zGG75uJ26^X] "()SXΚe7ef F~6!˰е37"2YY@2)x,uumh =. Fg:w.ÐL ҥOMeգ+n߮jir "1ѮdGuLK .85= H ݵLM?l$|XTԟ۶%}bTRCynUuu^~fT)S,ml :rpH0ֶ{ #ubAb2Ak4iӬOvt4 Ҧ"!2llml ml ,- x:rr*bJ"R`P\.ɉ4FKTVT^\ZTZtv9==bimocchkkhcc`ggdn G KOۿѿ PHyy5m~~m^^:9Y3фͦ?h N(ykVV۶-zW&R0ੑ/e Hݻ}||BxL8u7JKJJ! Ez^- J`20tttDmmggsg1&&Z*`xB 22O57w[U5ҥK<_44z,,:bD¨T2!DG M R0<8h iiϚe/_'(.n(.n(*jHKС+Dg&;;#9пF/!GBh>ǘ umْx &nehrx7O7B(>>)44:MM &AMM[SSgsА A$6}d&##.SH|#ʎ}X*H}{0?*dO?7اOj mo&igzn14/66<GǍ37Δ})F&eeii:.Z[RM8(}B8Bؿ\z{G0`O>}jժ֭)&`P8wGpwwȏyѢE!-ZDܕaXmm-qsaaa Y,B(00pÆ d2 ĉ۶mcX'Oor%mmŋ+˗/Gxzzr\8a]\\8P(TܝQXYYyzz{(׉~+Ś{,BΝ;C0##!iӦ_q}gggrr[opxX*((xם;|>֬YEDD۷СCgΜILLܻw@,))q\eeeennno&$$8p6((H檪^{MGGСC *$VEEEEEE}wk׮566vuu%JII9qℳr*#Ty,*U|$aǎCVyCJ`iiiι~~~6lp8#Umȣ\c ȊxtttIٳwobFQs΍0aP6tqq!555錞h``~… 8p:220bOTTTGG͛TsrrOڲeKiiixx|w*RYgMMI$CBBb*C駟 F\\F[|yQQ/0$ʧg eʔ)l6k߾}ۼyr...޼ySX-[Cýf 5M!rpp޽{7n8/^=mڴ3f$%%tڵk XYYccc.\H,+UG>Z 'ޒr P(twwJ?Czzznn,,,dXiii-277Һv횯ozzC $2&fØ__߄//'Ռ= ɩtw&+رwgt_>>>gϞ쌏_t@d2Pj"Ns-Z"H%%%#!*BŽӦM4iҤIΞ=[RRB#?=ҕ***UYRRbccC Ӌ6m|ە+Wn޼y:::AAAjx4ڃG޾\Mk֬! k׮M8Q~?RYUh(KMM4i1cl2Ј~@)hr(hRRWssxmH"MHHo !00pҤIjF@U1*ql:8䳼|ܹsmO)>B5 c&1$H^̻^^^ ww7Jd…8%%%ʣz{{B"h(+.]_ LJJ <8#:3FWWW"Ӊ R2UUUΝ#~QYEee%wPsE/_xwޝ:uwaa^WUUE B R~B<Ѫ? .""Bq͛7[ZZ-Zdffmݺ5%%EHqjf-_yᓙ^^^ƍۻw˗󑇔`0ƍק3aSNϗ`j4FjFHbBY%18t{`0 kl|/7/ 9/{Ù7o_looK777Gmٲeҥ'OTa؝;wd2ooիW=ztժUgNNNnnn&H_~%K***6lذk.b 21QQQ2fff!!!!uZΜ9sSRRvDԜ^__oiiY[[Kuuu忓ڵ;777%%EGBGGG'L|,"H9ڤ$: xd^^^l6;77w׮]#"'Or%10h<|֭[cǎ0, ''g8aH1`H$"4M(_v4nԌ}ײe֮]{…ٳg|2@ (Gd"Bm޽D2/(,O9sٳDs۶m̬W߰_sӦM<oǎAAA׮]#Q1#"ٯ#gNU@ EzzчF1&N4'11OcǎݳgΝ;|||}^__:qɓmmmfϞMY駟믋/vww700066zjhhhppΝ;?㬬,- B/^$z{!N|U։aXjjcbbRRR)PkggsU._lnn~ȑ%K rTV2B)G (#f̘QWW'V8SN@KI&zzzd2ёE"TƩ}DŽe˖-[X8q|}hhhhhh ޽{݊+oܸѯ0J%&?w\jjj~~>aĄ'vׯ+刋;bx@$A7ohGwxk׆@cWPe*J*Gr% ȑ#~ f̘!ɘL&B"55Z(˓7ϋb*=0'222zzzsrrjq/))Q913g(7w܁q…ׯ&|CINN8vbw}W>g #|(*7 -(( T>G} +V;hILHbSO#=H"HӘ <ۻ~pCFu޿-[\nݺjJj#FE ' Riuuu||T*q㆗Wee;s04((H(~g)))įr7..nΝg.((Xz{ !Ǐ߲e˴i*׳j* DOO~HNN>}#""|}}{4ۯ"ԠXbΝʖQ|*,"?vttdeeO<.b7eaa(p yy-\POOoY$"*S3@>O1iaj- V\Ӌ8K๓W3eɓdehJFZT֚&L8wc &xQL ۷_}Ueii{nLxbb 8orJ}BovkkTǏ8q$s@@@ZZL ^tfYYY__a!!!t:}111)>\.;66ŷ~KtX|/o#fϞM<Ν/;vl͆VVV`zSL_i4ɓ[d2WqvvV~ ᠯ67?Owc=ko:sܹ 9h< bcc.] M㜡!&&,>Dd2٩Skf̰y>%7oV܉!_IMMjY<'ڃ#++[~9sB8:;{SS5?JR֐̘첲& EOpPoo߈ U,E"iOX%==}"G'Ib?:i'< SNڸqAzzQrrٳwD> 'R0kwL_}|%\GoNyrߝy@ȁ?~…ŷG_fX%}ğH$j  `(I#5LBb0hI1OJvw>/={霬r lXozv<7oӞ=˘L4Kt\^R파bLaXKa}|ՙ얖N2$H"̲.#n&nLY/?蜢~4Nd:BQt F)ihȡRɚTI!T&F#kjR) J *ϲz{ --kC?99ԩ-ô/HF1Dysc x(8(듑HKY \eeKdd'B&HvO rT*YW!)Dnȳd:JG32\ʕTW.UU~ɩ vw ݾ]]^ܬy1RsBoܘa}r8vahd2I}[2ė eH$Z؃!z6N, x< -~W  0#ŷygBufHFƷ>ApaLòg2Eda&B̫P"VU {@3赿~à /C\>|$f9r,/C ` 2 LYy: x\::ۧOGIrԻ]]"K`-H)s_ȋ#ZZtH$"-,,ܾgR\coo_XXYlYKKKZZP(ܾ}{|||]]ʕ+W^M&GĉΜy2#Տ=nݺիWo߾}p4 9v⽘r EC,*BBm9h#̠Y!#I-Q vc`У{61J5OphjRiD{{ӋΟOMzT;A 0DFys;y.A}θI~!===77f&$$xyy=}I$ b 5z-M.w>䓖m۶ a aϟT\.{sNF#;q'H/1-`- o' |xժUh$'''---//fPgg'B(??_"ym?知Ri=*9QrDǏwqqp8>>>BpjT[[[$!!!Cȯ}aK/Y~8~y&?5&No<ڎ=C>qL׭x헡) Q>%%ĉʬY0  ٷo_FFBhӦM>W.@)yfKKˢE̾{??[AqUUUΡC<<< 233kܸq{Լ|2BvV:uꔖoA&2AZe +;tPtt3g;$ٳ %<<|ڵCoL5>24{؃ߺ{ˈX,:F"`? O DtM~~tk̴A;&bZ[[:x𠱱I$CBB7o^DDDGG͛Tsrr>"cjjG\0<O"߿ˋfڵ:==]9ɓ'wyfGі/_^TT;v֭[cǎ0, ''hӧO%%%:u~`2|{"cCCrzٲe-l˖-...ꫝ>}HB$\e*͛=F.Z/7S c876 *+[Z[++[ʚ ǎ)>jootXPFڿP***lmm1+Wloo_~ڵkB%%%666tzzzQQQL)Bwڴizw\0"lƌuuuJ1 h?u&H2HDrttJJJJ/^\z̙3kkk+9Qlaeyy444R*RƌV Szر{Λ7ѣQ``wq5oϽ}7[JUB$"jTF[Fcl#Kh$QDh۞V-.?̝nZ}v>ŻvJII޽{mwT ȶm |||_PP $$r ի={*((>}z…{fa%Xo/ji.+k(-mk Ąb1dA琂_Y;wYDo _GEEEll,Z[&11WKKKQT C$]\\\\\xxxs3}tAAz4_@׮];wǏ ( ''' t`llL ?zA<ߗ :6KR%$$XlXXSPPhooRS0t9Fxj|g̡O}0?7.lhh011QUUMNN=|͛UŮ}}}L@t1&Ş={h+F/^{OOOMMMeeeccckk[\chc2eef`a"ݝՕ Q xxp8^ S?zHK=w[C Fpf9:yyYpP A$???((B]tIRRr\Zj666AA-[\tiƍ/>qDCCm/GGǏ[[[z{{/ZdggԔn'D"L #NNNC*C8;;{{{;88deeEGGln~g==='''SSӄ| SS9s昛oٲEFFիsxDd<ޡ͹c,z5TUU9oj2-ݻmllik++(+(-mR!!6YY9sLy PSDmm׽{eee J19qN700 J/&8|ExA.]zYnnUUUttt Ź(**FGGL?EXXɓv`0nnn/_>p Ν;o. ࠭};v a!"%%u5kk봴;qС(###G;vݻ555˖-;x #gmm-Qȿk7;p_џ#`1&[MTrZZYyyVYy7h ruE Z5;p/666[ٳgbL¸1srr6;)gN T*57ŋt۷Dιs̑ё5k̏ }/&? hA89Y;;{̑QS&* `H?y׮؜K֭X0ebL0ͩ))ů^ֶlٲ@N]}:,KCٳJ{ϟbX7gailU]u㶶.66fee 55)uD)xA$np-7:4t,`1&`ǶWJ^*¤)mo7o433BF oE%54tgaH$ܲe˖׷TTTd56v01aeeE$92R  0.|x%8x;,D?,D; 3cgZTyaAAVMmܹs͙#c D/Ϙ!232--8a55I9sdWy``1&PojYPFefV8:^חre=330!TU<|a۷ܬ&&*[,02R'I0*|Wơ':ȿ￉ɩ05U`.3 ~f˗_[PŵO M,uruwwyS_ R0ŋ43S񩠠.$$̖ιs||ؘ!2|%H2gJgϮ ]666#nC"a!\륦A߻&(uNN/uk9< `\ff5W,P pbb`ӧOf sUV01QzX* |%===}}}A>} Nq#u[6-\6`A m::^15Uu_t뇇] z\|gg֭ 0V˛g0[7`TS*[y…k!JKUO?i߿\\bc73ŲspXV?}0GZZpօVVZli-V*.]KM{(㪡!1 -44tD&'=yRƴ}v!!68;S˗~~O Ԧ_vru,a;Y0o"'6@GG?a犉>|Ao/U&(2rnڙ3I$R(j||o»wرH)+-mㅃppupDxx<06*/oڴiƼ?(իIuu۶+)CX`!`UUL.p&ȿ|_Lvm((;r$+ed!&SG{{իI7o7ϟ>]`luښ6 K՟,-}EEyrsjn&8p?::kW@&S!!iQQ!&SG}}4,iѺu󄄸ѱ\]]!;w;ΐȿ| ֭zzV z{I׮%>e_b:LU:jj>}ݴi 7=-D_P.{K8&8x+;d4TKO;WyGn rޛ'c;:z~e3eHO/ .Yր)] qd:oQk]csS~<7%/88ƍee3yѢYi!HV_zuv|F%7z@*zv--<WhEˋBLysuXXzssٳutd!,[| v7;2<|;/wwμpmJ=ޏnJ jh8b2? ze??'҂9Hѣ冄lUUhB<tǎEf0C (7n:CCCgggA322xyy} 888䲲+W$%%eeeqs6iqniip႙YAAWBB%j*ˬp21$$c /`_"::ȑ_5Ԅhrs3޽3gA@|v/ʜ3GCWObxء?|xժUWbbbD"zs9k,H666Av}usss33A())}bFfff>HkΜ9ֱM6%''~ ͚5 EEEC}Q[YY꺸 wdeJKVؘVVVDlɅ;vm<۶vYYuv>|_H;͛@S9YV:@[%;w.~htNpJ=s挌 ''qaa!1x]*tC)wUXq[K<1.[ۋDbOh6aanE&S^}$e$qZ>g"#ߚDEx'srr888s1c0ܡ͛&KKKII˗/;88xzzFGGϘ1_TTtʕuuu>|x۶m .055ݰaÃCDGG߹sgFFF 󩩩>>>쉉ݸqcΝuuu۶mCmP;K.} h T*ʕ+h`DDD 222T*uh7Ο?O7J|/Ds…ݻwdYZZ=|A쒒 ;t޽{ua DT|X k\QVuj#"{׬_;a>UgdAA o7〘L&ȬbvveYjh8s*TVebb`dee%C I$77wVVweeeRR[X]]]+++[iӦ9r#,,u͚5hy/[߿ȑ#,,,***aaao߾5kVpp0qrr̤$)))))* AAAC={Ç?oNNNucZ`vjhIHH@ 233ϙ3ߟ{4'ɒ%666᪪JJJ .A=hvD())WWW#ršcDgpwATn )w޽zuG`FxA?zee;M㇀,~EF@0d(/o{8͛r&&…Jk,Qfcc:APSSkoo///zVV졵`z{{KKK jjjЕ,BBBAAA<ʊ~p=ӦMCGWW+,ى~ڵkP( {{{,[ '%%رӧ h~~#ط1@@HDBBBCھ}ߗ,;;͛7wtt;991h=dp ͛?}noo{ᮄT'zFB$h ;:z6qqB@Ft_YY!!D Fo_ؒ%[Z:~|y_&G/zו+UT$~yJ)AdժUBBB#QQQɛ6mM ׮];wիW[[[Лmiirt^HC,))nA[>} DRT*5)))((HFFmJӹbuuu)t;wSZ[[-Zdll|5V;}M7ED#FN֪UTNjBBwD<O tttlll @  Umh3A;WWRh^SCϞyxϼy 7::_hh yۣfih8s,rJTTdaaaoo?pD"L&WVVّ䌌 7޽{%::ZNNA ]PPL$BCC=qtt$Haaa'O\hQ~~?{'' 6+...t v177URR311nDt#???((֭[GՕDƖ-[F+OϲeN:0z8w]~ɓ'sssGp'v W߻q&EEH(ٳO) ׯϞ= m.R9uQ[[׮]&Ά,#>>ɓ/^Hd}}97%&&҂KK˷o9rqu ]DΝ;o. ࠭};vŹ(**FGGLvss|"%%u5kk봴4Zϟ?wsssqq>y]0LDDġC<<w^(D.^}ѣGT*[455yxxD"J=s挌 ''qaa! LLLBdÆ  HZZ!77͛7kO< T*رc}}}t Hqq//ŋiGܳg??5k-Ѐ 22RMM¢qIKK{yyIKKKII;vB0?|M]ILt7Kȿ|ϜKqqo'?%'vi8݊bժِ|0 )͛)+(mkb Qb'~E|;w̚5KWWwnnn߿A$ 88DUUu֬Y{=|0?qℳsJJ d]]Ço޼kb…&&&޽۰a777:dPT0NTTyWWWttc©S0̜9sHSS߿յOOOݻw?~|޽nvvP nݺ&KKAA MX `W޽{Ǐ###-ZDLLL^ظq#p#}`oxdlhhhh6CÙoDUTV_ًaEUU%/WSUTV ˋĄ'R]"o^*?-[G___ nn,ooJ4sQEEEEEEMM͒ djj_]]=5MMMAdddMFKX\~#,,u͚5h=A211 -0ʊNA$$$dƌtuu]tILLlhZ[[9¢fjhhܸq#66*((RDDn̾fDC>hYfc0'' ŋgϞuVVF- Gz5/w6 3H꼼^33͹Z5[MMr, vv `R Aӧmpeg|Cw5557>pl޼ӧOwdzC{m\MM\FFf` YYY =QHEEuPzzztuui- vHHzjjo8_<mP^^fXRggp`0ӧOG_p#f 1Muu۷of [Dbon.p˫))'(,JJjjz**JJ,,pS `|{ffc(-mHHxrt, ȵkΝ;c oA'111W3>Q__ %%%x11q޽...RRR׮]NKKKK˷o9rիׯ__n277WPP`ee=|?4?<EXXɓvtDe˖M7_9"tuu#"":edd"..>8ݻ_ebbq{ <=…?Lq洴 Bz:Lpji<<`ckkMokJK+KO'ddH::::2p8x/00tF bccCFU9J%O!G^^oz}Y aaavvv@ ̝;w5C8޽{{zzsl?wwAH7^#N.} 3c^[ebh^( xQTQьbTT$̑ёё`Y0`GNcX#J޸R/ߓDj|| +4N ?֓'-eӦ۷q@LF베˗E))%oZZ:98X44/WԔsB@]]}e))%_TH3DgπQ`r S˼}[Q\\#&ڣG#_(27׸ys0Ą/^,NI)nj" q͛7sSmm%% #^*II)ʪ'ɉm4_Oov`ܹ* hرcǎ&ǣ+SYyZxs &élNN.z뒦&"//} gJK B| T*5?.9(90-O^^@POONDB&1Hg {8BUOOӀgN+V˫y('../?ŨJ^kd#w`/޾앒42ioo?oRbb~LLvB‡n%% gyKJBp $%=,11?!CQG^^ 6m2ZPI@fH7H@II}JΜ9ɓ'/.\X\\,'Ǩ?{3g|γ666>}*_[[...]]ݳgϪM+L<{Vpn שSts組ߢE &fɓrr" gBLH3::e\],] Ap 9O 66ڋ+ ) ZVZ~URR2I$33s``CBB}oee55k R\\lff+''wE*`nݺcggG$n(dee"""/ ȫW={ T*̙3222ƅ HZZ!77͛7$7,Ang11 !ݱ-GD|xUUU;::WZ’tRGGG77dGGǶ6###MMMbWW׾>===ALLLTUUndddTj{{6͍nrʢ"ھ<ػwÇx'SRRh߭XpI@@w6l͍ΎI4=TXX HKKs玴ՇcXĄ%t7kiɩ'wu!MP:>}ok{b"J%uw#MPJn*CKځ0 ye%Kb\Aq[ 0UU?=gLLRS999Us8b<}csss??3fb0;;;4z̰04sQEEEEEEMM͒ 6oݺb/_ZYYI۷())&_ʺf͚B__'N $}BBBBB sU9eˎ92AMM͡=|б^zhoa~r||W. Haaҥga($662388Xa`0,,))ɏbXXY2$%%:4I&ŒXbA$ETn/jLS-3hnPsB/DDop11Qhks'͔֥KU]7.0TQ۷_߿{\ ؘ!2@ `ggy掎p''6P(i {n+w577/..G%,,,x<A]]]BB?YVe| >6eABBBh'SSS 6o'www{{{}}G[ c۷$? 77 29&i=82BP^ZZ 0p# Uņb :Bʤb\bA$ETn/jE?Dʪx8903li )0Qɔ>>$yefMh/?訷~ߨذaCdd$H񥥥茋~tI$qRRz@jXt۔.//GN$i'&&xcccSPP@.C,))AGI0tCc[ChhHutÇՕ0X,/d8//// TT4B!^XB W/iAE^N$k! *]4 ѠLt/M쪋mm/{\y̙ǩed&& \`BHH`l|رHKKׯnh4e/7xUo9xn ܷ/lLѸ1KHxxx-[v)uuuRRR=z4**jC䳳ꇄP(;;;+666]]]QQQ?saa-[BCCׯ_؈bI$}XXɓ'-Z q0pAAAn:z+ tܲeKyyƍ޽-''7kO<[]]&(oYggg";v|M6HtB$ƍF9p K_2M]}: {! hM^ڵkihdddiI PPPЅ vލV͎?5)--5661cʕ+E722`0ϟONNF۶mC+: `rG*Eљ3qVV3f/[v?bSRd2\FH.{089]UT,9`(j\\U׷_!9yڵXPAA.=kjz&3UYYN٪',DS]DDĠ)0f:{ɓ'윝e`bbrss|0wҒmh"~~}_VVV&&&"""ϟ?wsssqq>y]d8܁GgHII-]ٳh mb08wwEEhYYنq77*uuXaaRx<>11q޽...RRR׮]Q "2t,C{Kw+~~N966sZZ:bcs d `3Ϣg`2*4\$M iŠa ]xq2Ih",$Zh>t*(+,lme T+1LP(pكqQHHxXضyfN8H4_߄V RV$7Wod֩S6v[L`A)C+P@qqqϟ`0T*U^^~ΝvqZ0w ɡ衡m@$&&f%%y^􌌊JM=8&;0DO>m޼AKKiŊgFdɒ'O >88A66[оeiiYYY ߚ5kVbcjj~nnɓ'_^YY ^rewwdggڵ… +$$TWWG+KwƉ.|CM wK 7;8 9ܹrR܂\BB\<\\tW.]zz ++m,3@Pcbϝ{\RҰj]L5`!G󰔔$6lr;DfM/X ::rz%$$$4!:XWXRDJnGGϝ;w\<7ƪU6mD+ݍNVQA944H$VBѶ=; _z&??_ZZ:..Jb0"ÃSk-HT__֜NNN5G|CC}}07/^555\hRFDGPKPSTGH[@KD[H >oJ޻?bۻ]]M6l0DO䋏O|IIO?i],## (/֭w$C@ oB__?00rrrbbb8/aad= cJ,eeeӭSB]tVhD#Q[[+##C+e˖K.mܸq'NCދ-f8l7[77..7!/Ҫ\in}}O:[[?~lkknk몯olɩjhhmX_CT]LWD]T}ETWBҝsyzFVm*&;@RcbOzTS(4t0l8e,CV\9 "`<֯_O{h.zz::_Fn%pEF4t  3( _\i`mLŠ3707HO/p!ٳ;.?,,L b ~ں[[?~lok**X_A[OvCTGTڠAS6PMGD-TV^gɊdT@@ ??*ѹo 2{)~\0k؋Whi)1`t?~g&QۢKߣ Tgϊddė/iRazd2ǎC:88-YDZZӧ...}ZHKK?년çO1~#6-$$b t˴iVZ`X/^8rHܾ}76rɒ%… RRRێŲegϞ˓Rvvv2hkk]TT4x ;#""\\\bbb.\/` TUUEEE}_\.LʘrrֶvC77sx" 7c4zFm-^_O*MML % ee%%t QIIZUUfLhhh;y^DDRdiӴGxΝ78$"}dČȸ~yyyԩZ-;WXUtpp@?$$$0L}رolٲ%88ښWlذaʔ)[NWW7n"}=Y&--ݻ_Cihhwر<3uuuO>wޏ= booibb)=z4Z>22'DGGkaa1@EUUU{{{ee/̯ xG.)94|& ^NΑL$=6/!PxY Ӆ]伉a: Hx 𢵵=/6--ڵg>>ots8g>*J&{o35=`/Žɩk"b1aިL;bOhUU**^{b0:pܴ|jj[ǎ;蠟]xu'L8q̛7Ad@rrr!!!ϟO:URRrܸq/_r/^矚>{,B>|0 ~~~jjjjjjF:x A޽{r<}TBB(%%AB?AEEEwwRʊ@ 3& @ l۶ Aׯ_,Y HCCĉHOOG%,O$mmm-,,fΜZyf 4!B$7nk$&&pOYnn.NBBݥiggHJJwg޼yr}||(/cg{΂˫߀_<|K$/]zdΚu-^|*x<^`A @SUV=Z^]doo/ ;ɓFT2M6^[]^[Z]ݒSY[bq2$$,M&KȐD2*K&doA7^?~}F-ŅGr'O#cc4IFKK{Xbڴis33~Z\\|ܸq}2eJ\\\߿YsΌ/^Zr$%%]xq޽3gLII~޽{,YxYlllyyի%%%f͚ݻ7aݺu ,(((HKK311ٷojFQQQhh(fgee֮_@ӧOnddPXX3wܤ$@JJ ?  466򛡠~… lr۷oϜ9S544 666]#|;ͧO&fff)KHHs玣cNNNQQѡCP1e` y"oKLL̶mGP;jժO-:3ϯ3#J0G2>yRl6w޼ ׯ RRhl69?tzGnn ,\h03Uw6m9q?WŪgTT4BTU5ge6ueDDJJD559^4 "tꌌoT5L'ukDNNs={%K.\(%%}ɊT2|U,;o <`*0ޜ9s̪SG<̀~lڴw~ -(/o Mɪi0a޽ ,0$Ġg8DxloԲ\e\gq~{uuqX0ȧQUU 0RWSW볝66fTUKK<)lhhp,#/O5JVEEZEEFEEFUUf(Y./oڷ/&)靉;w< G ȕ+ϼƌQHH?^ϑ~8oE IJ('L0`ihgWvvAl]]]@^^={۷ rDGG F^^|=Ï5 ^^^.%%U\\lnn^]]*,,běҧ;AAAtyllKAAAWW $DbeeezzzX^{{@'jiia0fH$lܸNG[[[ttÀgLEGKKˎ;\\\̶l{9ϙ=@,% "^^LLxS)3_A4*jft.LpvvFg]i6'@ KVAprr80NёGA HTTlhꖚ֚[hVdh^m^; FɓW>UQre帑𪪖-["22m~w |޾zil?boot„Q#;wܱcGXXoK\\\ZZڕ+Wz_TTT=zmTCaX/_VRR" ޽{===" eP7hTy-D 믿߿onnr%$$Pu&11])d2yˠb&&&JJJYYY...FG-OKK씓駟N8:sL R4mPPYYYI F[^^~={ߵٳg)]fwaacggg X1%%B^x177W#>M`rrrP肗Kz{{888ٳɓs̱,--oݺE"LMML& ބ LMM̙CRsssyLnnnhh(-))9*dFk׮صO;eh1`eeu ލg`7oܹFCCJTTTNNN`i4@̜9w~;>aq==츸WSQ4頿?{QSbl|`Ԩd։{{wu>Y҆⊜ {?'쩯g~ 6|vܩXvWWW)))uu]v>|X[[;33JQT[l8rHbbbzjƌhP1A"/@3Ξ= h4#@?Ν;=<wЌH^pP{ƍ bbbO}U3ϯ ;2©hv-=::j&g[llN75yeBC54779mneغA^(ϡRߕ7)*7106 @8U(X7O*+KLIC\C \?O'&!Vռw$+lsϼ.֑# 78~QZZ\`˃rsk wﾦRߧ0&Qll --g@ ! ޵yUӾjzFeeSeeKeesEESeeseesuu dUFF]ʤ.GI,u#GMMHp ;X,֭Sj/^<2W>ljjj6 H7`HP,kמEFfѦMvu5;WN{F Lqޛ[ʿƾgON7 933MKqVV**2DC ! zh޽ >X:W\Lsq1ٺuz"uutThj.-m,-mhhh d)Ugmݳk6Xa NGں/yф [O{CCӟ>-pv6YԔB!4/A @nnMHȓ8u„Q-31ҟ4m[E;vXo`P_O_Reest}}-.URһAf=~q̱04 ~V.iJ]yy>~\`awrmpŠMLԔ.+k,-m(+k,)ix*.4 0f2=]IO/zu̙c/,+k~]m*˗޸FcL_A A%ȏQ~PPjjj>$1c23.GE^^ʕ/v~097̒Udi*uw;wrQQ!++}?ӧkA !ΟލG/X`0jld8q7""CSS12riC~IIUx(.XZPZXTD{- FTT=Z~hyMM/#muuґ y S^\|[[7AĥKiN9SҞ=+"Ė,1uv2ft`,ȈGQQ==lG+VL;VeA-XpdtTԆoxY>)]AAٳǙY@ LBBڵWz. TTZ\]Ͷn+'㇘;˛ L.HVVQRW#V$--;λ|W>۽xX0DVVٳDnn?KA@_ڦM~0 s>( /^$%hRR"Λgp℣1Q!#3dko/R!~ 'LB>?ѣ+W\ #$W|.YKKQSSQDo9zιs)xI --&Q  ?֭K~]_.tKnn!]LLF?߹5~~_>ellpYUUszzqpc&@$kk+;YfX0uh؁&u+%7kBwA O>BeL?)ujn?:}넄'O X&QfϞ=NMMcrs;iolNffir{neֈ۷޹4 r0eD mhkcwnUU{ `0X,ApE8nBBI8)/S\UUu8 A&"% 2H`8^𣾞 Kzx 3(}# gghI* `(i""H|A&$䤥sȌ,,@ ?wժK))yBBx6"ƩܿBHܹ޺ؘ ϱͅuEEڢ"Z[[X p@~mxiX$=\.Azr = Hvq8t.+Dy٤͛g鑿ՠ^SR[KimgXBV x!? -g$EE^vƊSjFX~a VwuƍcɞnjQ_ogw6.k0$SaYĉųfX@ {ܢRߣo0 &&fszz%%*cutȚ PIK?v΁jjrjjrԴ^ |Q:e3I))y88L UVP_Ϩg7 :-#$SVVSST$L2Z]]NQHPW#oܸ1p (@~~۷_HR{ظ|Z0%#dǎhܹ:0+OΠ>Bq1^2(,l]yy]VVܹ6͜:UKLLpԩtoOuTYٿq8DBGB).Β`w^WMlbffoldnnm=aժi_Yeei"င<~\pTbFF)Eֶ~B; FgYYcWHHȠʔ)Duu9H[楆@ <%PY()uq1#VwK`0 (Y,`0}bh`{SPPG ͞=nӦӦi0| ӟ?njj ]-ioJJYœޣ7n8::~= fǎ(11Sȗd%գY&ЅX,_ V˛ERRDYSt033z2J0K^^I g:W;6ttNRVָbEPII#Aܹ֬OϰgfeP˛ 8hlLx@03HDDƃn N˅|A׮=G55-VU54"յVWaqh1!! L#()d<NC (@"S~Ǐ &NT _;ddeKĻw598ιs) c8 ͛ ,|}理 i|CK˱&ic׮ad"p#eSb 2eAIkw! ` CONEzdz(@cb/*!nu#,,ü\ANw_@ d}Dںut쑐x+&pB&KKpp>r@ Oڞut   3dnG8$+<6opȊ&+S/@z/(,qv69w.] @ [*08a颢l3lܦvQ RP@)P||ٲ X+WVGF2e4t P[ۺb%~EXNZ63o ܽDaa#8$}9H]qc(/R@ ѳ{M{ISj}_K( F]]]%%%K.Ԕ244?>YTTWBZ,#%%5k֬ׯ_gL^^!ݼhiia0*A 87ǮYsSSɓ&8zHQb1StX\d8"A'oVo /K*9EGGϳgE?&w˚5IkΜpATT\]]GVVcۑgIIISNM0RRRwތfcccwwwggg@^^@h""^v.**JJJ5kp/յ/jBBiҥK[nݰaѣGѐg?R^^~HHH`2{{رco߾-** زeKppuFƎS uuuO>wޏ5FOOB411qwwϘѣɓ` lZXX PQUU^YY| $$$--O.RR\ x/^ff<{V_W[K%ßd"A5U;9ZYb2"#GGoLsfQMCz]x<*c+(H$Rlvf7d2QQ(!!"))ֵ0iH^BG2, Zti||ɓ> Y[[ TAvv%KC \\\֯_ϫ)w*FDD`0/F6`._Zؽ{y܆x22kTTTʕ+'Nx̙=ښ7 DsEϞ=333466~ ,1... Htt -W7oGWCCCBB"??-ϟc0[*))EDD{wr={AQ0CvT02` ߎ޹3~vdjj`#/^_#GCϞ]  ;⛽ t:}ڴi}X;uyeeG ׯ_7/)S>X]CC#%%A1}t##BOOϞ uEFF.XL&CCCͧO&fff1vvv wqtt)**:tPLL-D <{U۶m۷oB9vتU>}Z\\G||| =fbbo>:_Kb x@5p [PVָvӏ4߻A"'O.qer{ d8ᣅ;|W'''&z ##ݽ~z411qĉbbbF:pg N.@ҝ;oǪU 9_䜝M򷠻a2bhhhkkǏogg7{쨨sΑW._իhy*lٲe˖m۶L&߽{WJJj0̞=;227 8`*0… <gΜqvvNII򨨨t>C p RWG?u~dd\`ۼygڃ@#3fΙ3Ӧi嗜?;o?000,,FYZZSSS a…[n]~}ccݬY޽{wA##qB\\L.(+kqEXXF]r\Vaa[Yg,P30a(++*l1.--EtuuOo"H$ISS I$:tQ6ni899yxxEGGpm;;vmٲPXXGt @gz ` B}=7122SEE/at@o@ wǏʊDocyyzzVTT JE M<9 c;::~;|"Μ9fffUUU;}D˟9s* 36m_`~FFFEEE;wTAm`Xuuu55:?? JIIegg>::J  񯀭Ν;w{vʕ떗߽{4j(99zHKKLHHHLLDD&>{4v͚5ޅX1%%B^x177W]]"۟gz7J0yLRxsyy) p-aƍuaPHx@> A3jCodddͫЍ{ 9ϳ+X *Ko܁V}[st" dw,iԆ_777r|YF$ZۗݝapY\;;{zoYW @Onٿŋ[[[ /_.=x55s:u E&=z.//͛7c0;vDDDR1NNN|Weeӧ ޽+/////Lw_^!` _ ]XXcҥbbC¼<===@DDDxhEEEIIIfѣ_~}7C-[~ EEE}Ϧnaa#++ݽ*--Mϒ&&&N0a°̢Bfwכֿ-wC- a2:**x͍7 Ir8L @ ?{N\\PZp-$q|[SJI6, :3-qF-cǎ/Md5@!gΜ>[[[h?ctuuyym;@ESSS^ػJ ,@ a_֎ﶶ{.Xݘ$ ZXXb!!!bbb2ݨfHzAKKːݻwHѣG3j?DEHHHHHJ[[Acbrx׮h@ F˛x{_z5c III ___. J566722RKƍ;ʻw(3BBBЦПx%=.ge` 8Q{ƍ bbbh^}U3[l8rH ͛O?|ЧH`` RRRv:|vff3%а^[.^L7/eeQxɞkc7 `0ȻvFFq]]+2O\耎.*5oy o]>Ay}FFZ͋m6Çyfb!!C}T}H0n޼ HNNmh---NAʕ]2%Pɓ'ⱶTk뿔ԶbX, ^*ƖC f=,o#=sr* |O̟?nZZMMݹq>3o&vvvqqqMtt+11%ǏGU*ʕ+كo޼)..~1c:$))EINN622]]]Q5ښH$jjj;wAϟc0W'''&p=zull,'gϞIJJBlA|}}544$$$,,,й;1m4))_r?# Cl֭["""hV/œD'@ O? SUTdV~gJ6B!DEа$H<\ȑٳ X/JϞ.Z䯥obzzQO@.@/0 (ήpq1ti aggpGGǜC|bZZɾ}<<<*++yv!&&fkk',,;wܥKzyyƦ-]NO>( ӳ]F,--{N=sߦúu"##,XPPPm۶}Q(cǎZӧ򋥥e``WV\)%%fc$*磹*O>M&޽{~:EMMځErs3r֭saTi?\buwXt:+H::нܭ[&$d߼UQğ:>>ܹeco"p?.HK+x(//Ax,˛o0 C"` #b?.1uVv]={vddctt`*‡Jo &&&@ *((̘ܿ1!!! 0BCC[[[/,,<~(T9pQQQΝ;yh/6+++dիWXy<==+**xu0ޜ9sxPţDDD\]]Ј}DST* WZr--s _a 7*M6ߨ_*''H H$)99C (@ F_rpc%%bH#[[5kx{{:::vvvދf1ĊÇ"Z*22dR(4>lPOOB}}}tww[{m_c̘K"I޼s6&@*&?ٜ]AW@ gi9.3Gy8)1CO*34Aw~]Y_Ϩ3{("WR"*( EE"HST$*+Kw^^^p /z?pA c>g>YVMñ7;ԩSǏRNNNV⭻x//[^^xuccc---^3gȄ%$$nݲTPP ɏ=rww?~͛322|3{nf``p]yybt/BIIIٶmZPP@#Z V`%1u+ J0C658A_N?p8(TL ۷W<=q‘Hހ|{L}GnnM@@ۯXbqy% F%**kGFC123Kkk[ں5Wjzk4**2?RUUc2`)WBF پWyÆ_ddETL:&ݽ{711̙3 A--_uXSSSZZ:| #^0N_DٳȌg6ff,\藚SKK^b"0L TLU2̕>/,׈rrrwp5 Al۾jӦ_䠽5zF}=FcΚ։DqTѠ䤆F_F|g@Glׯ{@|2222~~~2223f̈v{dXQ3_\̛;iTb^a8F1>sLPA*&ei|w_  1m^TK^e<T;{k4_WhV^<()z{"p8  m _|BBBO?Q|=޽߾`d ''u ,"#_hkIQQ!uu9u~k4脚ׯ+T H !@ fCw>x+WV +VXb$7688-&UWW.r޷(ϙ3޸񲵵CZA",@ 7qc7"&EEE x bbGFLLxŊ| *=7Q/!!O ^G.,ڵg'N,vpB~x::zn ~W?@=YYq?WbBwʤDH'..=P]ryx 3GVVQLfF[[:c; ˖}Iy,("eG{7H}d$Jɖ,,3s癯Bk{Y9YY88Lߣ(qT* ,_>KVvgccqSNN+*z 6 PNbg'7gff lqLfhlG"Tm Qɓ'e;R}yS]SٻNv)::662 Bi`MWWoSSGssgK rssgSSGEE˳g͝}􅹹YyxX[Z> р2 ;x |zz#''gffCzzzhhBLLLTjyyٳgsssؾ9rGGGrr%gnnnYY7dhhtR@kkkPPЂ XYYY122!66j#B!.]Y`R]a&( iXY{ee\(:oڊ|%nCCUCCy/ye^UTddVwvvO2sƍfZZRR|p8aH$a:=؀掖%#$&&d,j'3fܺu sEWWW   (DAAnpuu ܱcwfTT=3x:7$//OD"dggM~L$999 C0#GeJIEFחmL!XXYXQ(/_V&$%$65u8*K FWWJ=^1glIk>>>#Yӧe5u]]S0LNWQQQg9ν{r×b"z߂zK ?NOrMC..ήx񢲫WXKWWrǎE2äҀ h|}NLL/˗8qbp?  a 6dffYA'O~ZVV6 `ܹغ]]](X[[ƎdCp8B~EpME?Ԥ*++ \լ,===##;Y|yYYپ}l&S|J]800o:*8mm mm ˜7oԴ8*!>>6''` WUTdgW46v "-ͯ"lg%.)&II;w|#yf(`"p~]vvţG%}}Tiz#[AO̬fED[[;>>?xEю R//^ CCC[[իWGEE-ZILL}]^^^YYٞ={!,Q\\hmm R?Sgbcc7nܸsNt+Vdff{KUMHHv횪ٹs{{{`0R_=weKonsYX xΝ X,͛ϟ{/<}:իjhUU}.ϯɩ.S\z&"VVƳg].\x{w=f yyQhSSmxpsǥXn:E=< ut$ASOO@YL&\ bxxx[[ۮ]^x]SS# ͽ988\\\͋QVVɆLMMMD--/kϟ?_OOpԩUŖ?qℙYHH\nr&[^>hV;](,|qx< Yi<=;JJ'O†ݗS].8"%ů-ꪯ"saL>(* ]0cPǝ/dff͵-;?xx>6u*KH҅ UFĚ[KغuW zeϯϯ˫nj%%a}}Cmm $ ~ބ 2(@DVmsҥ,Ѳn,o׬ SVxq''(Eׯ=:;IGGYO__F^^H Aٳgtuu/^ٳpl i4Zyyӧ6NNNsppؾ}ѣGWZui777cc㸸;.ȑ##W}uׯ_o޼^\\{Ȫ655r+**r 457w:9ЇK({-Yr17盬auhooח3rr2 r}[7w. AsZRHa]Jf[r{ZKH J{YI7'"22ĉ{ǎ57W]lWKyOBp) ?^U }ѣWZZȜ2F B094M&/_ܵk׹s.^y;%%%%% **jjjzq, @ZZ+//Ç7l؀ Hrr_dd\BB} >..n]SS٩;C0_Aoo3gnݺuO"hb119**+ ߳Mlmmmmma7lKKK E>} x5F  Hs-**–eaacpВ333vvvIIɐUʶmPҮ\ƶdɒίп lܹ$,,k.lsKUQQQ?XȲe֬ B4B?~JIypgɒS22DE}-:}?`A.WR! UQ<>DGg[Y x͛o%nOp;?eӗQRR~^W>)*zO x_3hu TꀗTZLLUsdeۼnMMM&&&_-AWW^vvv+++__5kִX[[{{{޽[CCCQQq^033O RR Aw fwueՕܴLEEXIIsB --7'`gegUQ|mnkirlii~bk^}-$dwKQ]MϽbb2Xn8h 9`HLN~ip8dհ~6FYY͛/ `up8111QQц'OZYY=z:==}^<|M8'++BDŋz2*bbmBa~~Jc۽y޴,::ٴ3LM8qo,4s{{WFF :*UVws3g5AC0_ttNha룥?zT/oѓ`GXV޽{7cƌ:iii!"""bM8'%G ! OrG} 1 *ʭ-na-3B;;e3^?jVVOOc__ӑ?| ?yRvy EQ,E|uu0}5A4̄Y9y"GEDPCEE6ׯ5ufzaJsݻ3f̠h,,,!bRN8')ɇ HYY# @ӧeo?}ab"*+ /\-@abOeeM4^s8802񻷦5=>{4AGGBU[[B]] oA.JK]\h4&&bo/FC 4EEAEE!!vv&VʄmHd*Z]]]WWMRsrr-[6x/'߄s )sz{)v22TT촴%%-Fa9GLa>쬧"*M4 'kll?t()&&G]]{Z{z$]qC"s/= ِEjkkaӌmT**(g\9ۺogguuL=[џ>?=s&'K0g- A0 4Q=KKKK?6~iiN^^8"e>,ڸ1A˗UÇ`|.wuWQaWhAQ49͑#IFF iiŧN=RQ'חffaa\jΊqq/;ʕLKKu__S,@AAc `1uLMLM\ޗ6~x))~E`C??ݻ&~[LK+%~tiII#6ctvvEyyBb>f%.//@XbbZXY Lfa""ogee p  @rǓGG]aa(ۻ򂲲Ε&#ÏFuBO0mSYY$l '<XTno6R=+FV77wp!}B}}Tf>ff޼"; ٲ2={4=)QQ>>M9b 1C0Ши{ķth(a$!\,,\ ג{NTś6EFDPMMh顰088hj44ĸYaA˗U7F;")7򵊋atխ@]] ,,ԘGgh"쬷xˏOzrk̅ QC0HH=p FؽY"_TP~0MtRR|eeeˍ۷xJ⋜gb"c=}:IFf7]]ݾx=+>׵X䥱}<|8KVaaKgơ|?n q]eՇd..3S*)iɩ`eeZdc|鏅q77˗?|dsxx4!hrqheqdKKKܲHPDK\\\"##bccQQQ#Gms3&&&T*ٳ鹹llߐYs@a.]`"VۍeĤ|<J x{ ::4OZzڜ9r22$oB`UՇ2wӧO?Ex-TZNNlO>%>>>zzz?\II*ѿ٣{{)ϞggcaOz$d77__=s4SXX=<uOzdFS[ &'L"9A͘1I6Pʨ(z&&&;J{nkkƍ=z4gΜ|Rc\]]wW!//OD644Ğinn&"QggߦMQ8(Brϟ{ϞSNN\DQQEz Qᚚ7nc7QPǏLdr 'H}}[OOAHp}}b;:G2 #>} b7na!E]G/{ZZ:O(.n.cёܲ\OORB/#8<,,66ӝtNqql۶Q;^^ׯ]ڶm8<4qC/ ,,,>}BQFIIIY[[ݻwG?ÇK۶m&~[^RRݝTuuuNNŋ899(ZRRbff.))BѰҮ\ƶdɒCQqÆ wRCC{pΚu@J/;wxi]䔠_^{o'>UCC;">ղe7 _NIyKo;XZ~YP{ɒSo#A}cmmxm;;={`eddܹݽ_NJx??)SXZZĜ~m/F!!MחחٻEќNAoyӥΜ33l8S+V{ypp0A}pqq͛7/**.&&FYYY^^~$+jhh`!!!ϟ?}ݻ.]B aڵAIIŋX_NNNNNNCCl [aCYSS# ͽ""//?|==%_x9::ٹɓ\"BPs 33]v .PCCcp ?>x_~33SnkKsPXX_Tڏ4 11T+)i42R4hQTzlcg0ր \PYI- ))o֯mo<}:xAA 3gJlw`ثWY3w:cFF8eA4!{gggLL̲e˾FIiX3ׯ_(--% $ PRRݭC_{@O2lXC#%%?Jfeea AOO屒I$}$7GppGC6e q3} EE޿}[_PPURsNhAxx6l[[oQGvv..Fvv" q5Kp ~s 4Na` PT*g9s"uyy&&s]p'" `^ g`,--W\o߾R;;ϟ?ՎݻXbETTL&H?FQAj999nnF,A7}VUU%%%adld2Օ[$ܹsvvvX DsNoo/ }k%Xep}僟󁉉*ҿ|kΟs*gee÷2EèɧOc!VV]6SZ(FR?Qm4'*J% 8l(ee^JQ{eeax@[Xi]RR*Ehtٱc…zD…k%F ~i#+9rDUUUVV(?>>ťsE8 yyyEEEg"##i4ZKh;;kZ***ť999Q(Ç} 0aaa///eZ뮮 RRR_~rׯ_211qso +dcTTԖ-[֭[# >dCp}:EVvO8cbb`bQHdbgmjza6t&ޡxn2GGG*Z^^~Yvv\z^_7jjj.]DPXYYSSSEEEmll899333իWa9,--^zepw5fjjj‰CVBK.dw}c6Gn~#FxD&[iz(z\?n8 h jٓ b bXYiw A4HuI..9s$$$TWW0几`7ӄ$[?_G Bh GG]KQܲe3l|8 P(E#f'N(cmm=~iB$,,LCCޞL&c/_fZӦMYf D,99Y]]}ʔ)"""4ː 8*_/Vio!MB(4cʕ}}M tr->~CFƖWv9$>||lG,IJΟ_ѭ 0!KYYYWWW~~, WTܶzuXEE oV"n>۷󍌎ŽmA 1 DARS4@\ܫO:Κ%=urᐍG˔#(螡--u댌uN1m( #,7uxxx[[ۮ]^x]SS# ͽXO"C >FFF2w..yEEE(++cY-ZC̐FYY͛KP!!{ 8qvÉ64477WUU~hoolٲpF4b,ݻ3fg+--,_*v䲳bc_~"ؔ+0J+Aefl|cÎ۷/bgg-A{& hŋ5#,Xߨ_0s ի20&֖r޽ 3g?>_Jl**"Ls*)) ""MPf*++[d2>%%e---yxx'XrePݷo_iiC' ӑj=yܹsmmmϞ=Y)vWǎ%ϘdXX&TNy J`\;$'6083   hff7Fp :;mF?!$.]:cK AAN6=~'tu5dU pjHȃmD$84`''}988VTTl߾ѣV:}q\\\BB)ٳ/xYxxҥK̎9*++; A򊊊Sl `d2JVWWEGGSԜe˖ neeΟ?*ut|nldnjb5 `]wիOgA?ݟ3vvZ+=yl|IA0Ao}ʬYҏb~Pn/Kg˰ O[Dd޽.]ztӧCg9BB\?ll,?dffps3xx6/^T]J~~Ͻ*Ӻ{Mss'a@Mz6p*… [ng f֌Z}6slm{x\lWUed$8;efny>S㦦cbr_`tYYipr24ؒ5~:GGv)ɑ~[||lgyۋf  {,BMni/ ˗G֭[Ϳ:#M2fI!;RWW806qRLuQQٽ1(wp '~6ӓ<|aa+UY hB31Q|v-7lmC޽kmA4i&^sss[[[{{lw ##9믍;u3gJ?ym,[ojhߟ>v[ttmi!߾! N--(L\ M\llL{ZƮkmdbpX2 CM+IYYYihhۓdVVV˷o(--]`ԩSP6mWOOϚ5kէL"""]>yDOOUSSÇئ O8hpaŽ{s=ĸޱ|,}_+)imr[[k?~Fosg2R]QQ6Mtӧl|˗UM h!=NeЈ&ee匌 ;whhhzyy]neef͚kkkcccooݻwkhh(**ڮ^:**jѢE%%%̃ł84iiesgx*77[R )ˌ<==|v9y2ux׳`|##Mv-[v@A 7m̙3[nMKKvuu=| ={6䊞o޼:uӯ^nݺd??H99 b'MvuQ+ϯ˫yBoQ$~5ijvص+NUUd(}}}_y+W(\9{ (czZZKKIrl's犮\ S{{WGG7Jq(Qg͒٧>lgm9g{`@M8Ȁ111u+**fΜ y31S(CQJ|Z 8oIIqqw/h4g募܉KܿOgiicJʛ/ܬY;v,21Q6 q|O)AЯ!߾} /gR(ٳe/#&-&G =*(ٶ_QĸeLL d֯`b"n۶p|E/g04j<<<|IHHPQQA"k)++{ ǂ&%%62YRRݭwyyyu<e@0Riii%D/Cߗ)S b Vaʄ!D"~cQC@.3%% %%l-~iXay@?Apphsr:5Yocx,M̛7uaae KKu77i8zℛۥ7}\Q511۵Wcbcm/| ǿy˗U||lVVZJJB h$|y.. 5 5}RPPl2&& pؘ͐]bnqc'Gq0,AXѣvvv QQQ{{WTTOo>[[ۊ۷=z4Z=͗]… V222onn& H^^^QQ( C04 ׷ tRcWW/80IJrGKXJ _;{eǶٙ V, vU^^6'']Y/wXYz"ҥ(,M"ؖEADTWPte^WbaJQA DRAd?f7/MT@='Sܙ 3geKK]{A"q͘1D#a@8JL&;-86cllۑ6ceUMLT gj鯿n89G=z~zWWW99 ;;9s権mڴBرcÆ "^^^\nݫWzTnKM0!&&?~y,--%%;oH"N>-!!90 hoo!ϟ?cmMf '>-X|T|#/244944ae5v"#~~CߢNG,Ri!!I|`1kqvvLї/ ϞeS? ߹s޽{ð1cƬY'N~:S'`4CЩN2EE,u 턅=ۿypw:ySKƏmd|өSOr&Y~ׯ u=111Ng)_'|P?zu,==Í ەI&ر4&&ϯ@JJ !:2HeRVy C֭CB]MG0((ƍ7\L&)ۂ?pq]^wkii}"71FRSD dh |O&9I'q8a0O]9={JJJTTT<8cƌaINN6443okh S(,nn77Ba+ի<ӕNTῲNɍ&:XlsϟDEА'I~ $76pqL…#RQQ oSVVOёԲ;za[-YYel+ Y 9 P bŃXsy9oq`lnn&P(,nn6;;ѣE}':NgARj&PHRRxPFUUJMMJNNLFFӎB5..3K,??͵$!rS(\MM CX@/TbTZb"mϞ;ŌUUNUV2f۷NݼjbbCED W OV0`jmeq>2H X,6w B`e5.(hT=^Srs+[PL6eܓMM7JH FT*-((4))e˦88X OVrsZ&O8x2Tzg*YZj/s׬ mnf;hf@U D$0]\%$d2<uPcpHe*-W_qqUá6Ù3ϟhhru5;WK3==/߽x$ɓ,IIA;;%K& v ౘDZmmӈ'16V6M]FFt8@]]˶m׮]{b} 7 b{xܾ".ja0?׶k2C"ĮJq N  ՗ss+ǹw1޹3…V66^]򼴴@>}Xb?8JӦi W$"HYY0|@f* mD7Q9t,m!)3F+e*ZoGRUjQP8^ϟ0s'~Pϝ?iiiut4\TV+/Tžo|u1'O: >{t{11huQvv[p]]zz˗#"Rjk-X``bb?RiT*-!!E\\HXBSJJx,>zɓqsL8xpp |TNfggg{1qb`nB0`4 C$Ī]\LF&:7+w̘}]gv>p~ɒINq㍬OOKߑT_[۴fMhb"mٮ&xhu^+ϩT/V3ޏ܎cȑ{zzǎ-k{bb],5HUUqq8TU5>}E=J/)T_ni1L悃8 [Ҷ7 IMMUURURTܧA"@U@ :m0D"a~ŋ'!Z[YѯAqqĵk-UT:s~Tj|^l F{zNf))9a%%5YZe}|MMӭ[.^|C1h=OQYِMJKkuuLLT--TU׾={b'80̕ITF+-+CzkO{{WBdd0,..7|== LQz}VZZeL6GTJJւfcAFE3fܯo MҌ7n?e2?9t莘fB•欫}‹a„2&Ó7?]ffi\D9 S^^XXuT^[ܽ6rP` i8WXVVV_.e_\(-RRFEkB8٤IdeZ`s}*zy_GL99 Ke5J4#3BͳƏ$) @OM-ڳ'JM y,cͭش*Jbcc͜,G\κ)99U0473^d*--AT\\}-L deO\rs+8Drrbx-ߗO!ЉG~.fֆ@ #R^g2aT&9vB>|՗ >>V:|&wٱc\A7 OjjDELcljj.++:``0ho˾}v||TYِ^h$QIIb> `@JNz|+UU+vӣ8gB͛gUU533Dqs/&ݶWStdܹsT Ak;_~dԧm 0XXTZb"-9Sk+dj.(8K<=/ >II9m|"(:ɒ%IP-O}\ck' @v̓dWKe˫kAHDvqEE︅o9q".8*(c?pn  B0 FMMWiiR)ciii5vmΗ/ kք>{mHJntffg\,34/`"/' zٳ.=tw7]Ȉ N^^HXtT*6TѣGtz;`0ϞM |d׬1wq1h?@|`P4*YW,&&0i@(!aci I{jh.H|0 ! O M8;Ovw7dАS1wIUUKܿ5Ɉ`~\ۮLVVYs3u4z7oWV6xx J CFLl&g*YZjnwx,謫+kPm>??ES5߬…'g$\˖Mqs3̛篭=^ɀ4˫w nn}!U`Hn|$JgUMLTUǍY&MJru5 ]7liw;6H^^LUuȑPc"TUL X,5k,$%Z@{m zZxJ'3͌%?88zSa`QDNZ2{v d.۶]75߽+Hٳ'ԩeeN=fDD{WPS,hz eoo:ѯO35=`n~qP9+/Ztfժ]YcrYf Q($55)55;2Q 訋T&eeG9[[[nݾ}ݻw8^bb; 9o޼qF^^^ȓ'Orss[[[;99yyyEGG'&&:99֚geeyzz2 CCCP``˗---ǍvsGQQ[u\9s~_FqZ~;SηӦM |Ͳe1 m6PfffHHBFFF?~DĄw\vu99~ÙW47tnO:d9 VzgseeCzzI~C|).f2ٜ|"{_~s$ AB0O1aѣYXh[gٱ # U#/r؏sL8UQQ~ =Oe*({x4INnķ3!**:}p{{q|eLLTTTssPttduu̙秬L FHHHMMΝ;ǎի<k.uuuuuuM6q6iy8;: /^H$g͚YPPY@ hhhXYY]s"""(ʢE233O<珋Cd===N53fعsgt,˗/;˂ :] gχz8,ʕ߭j{o'-x3充Ul6Ǎ8i AYY.@Df\\o7l2E*==E< qQÇ^TYY2"b9Ə?~tۉ yyxP&/2%%?!$!!('' X 988GFF.YlvOֆ7Lrʜ9sƌJB4}?曛uDx!ݫ7nhddԶ8PjjjW^~~~uBAA%|r}鴴A$&w*1ˎkk%$NU3f `)`ieisW6Є?'G0ι:;cc$X'@@{[;k m'673|˫ϯRPPu,_|Ϟ=YYYmmiiA4(--}ݻKxxxCC“'O0 #G+++Co???Ν;F;][ݻoUH1Y=z~Y{{{ݻw 777B(;;}k!Bxw,aiisrr:NTWW "MM<+.h1 sv=* URx5""|K3}ј0 :nSpΝZ[Y}8Пޘ;Wɓ- KWxy54ƮXao]h5kzЌ3:ƙ.''ڵk͛7.]Z__nAݻ Δ06bootUVeffX"<<|ҥD"ɉd:::FDD(hTC?NOlڳ'fʔ}AA--P3hi\F+u=77'Ơ t6oDEEO=##@  tx@ cu_n[ )>be5n߾[=zjPaa՞=1ՍAII}*7TK222  5kV\\܍7Z`  rrrXO3glhh@ikk}v…۶mrtt\r%g{q잗v`XX@jd2}TF$((Ϛh-C~OFFtnu,/\xrLBpe˦ A倮0̓'KH^ড1j[ۓ~ҥK.] &ꪮ~۷z4448QPP7o^JJInܸÃ>w9s8s;&Ou_Nkff͂kYUTTd8s}ZB\\:)i۲eSzzmU^^5:JL̜6퐟UoԒrw:`Z"b2==/_jCIIi̙!YYY3gVQQ ;{왑Ǐ;~ BL&3**ȑ#xlٲ'yfSSBðH[[v DvaGUTT733gGJJ*,,c໶m۶zB0``1ŋ13&ͤI{o*-'jϟk,8(Fk8bׯnme뉜 +:z`ǎ(m""^64@'ËbVVa&&&ӧOfff#G_?/r oooiii##iii@OMMikk`0n߾z]vvvq*a7ɂ/Yϯ!>ĄN:c$&&"vرrNN!&""p;  D77 /_NxtSV P9~r]!! ,-:###z%AfpU__ PJJNL̻7TVsss1,77 i'$$fΝcǎ}UDDDaaŋDY<== Bqqqxd2YOO_PPNHOP N>=<<>22rܸq=)!dAPQQ@а222***BtG|~__3fwիWQNgk JSIIIǏn{ !0pq8;O~N=`c3qZKIիMhkZZee|aaXqP{`˫vss+dVB\|@"b``J\\\\\\EE |nmǏSTTl;۷ڜ{}}}dd%KzXnۓB7nttt422Feeeud BӚi#Z[Y !!^8WC%aD$0Б\z qxsPjj0Hߵ+$m/n/8^^`~Y+Wp`-,LĉJja.??Ν;BhbbbL&0 BBB+ bŊSNYXXDGG߿9spܹϟ? qtt\x1[!!3f:tH[[[MM۷=)wGjjMJJJxxx:rR֌9@x]FFF3XYY}qͭo߼)0@ 7@H$XZjYXhťΞ}\OOq)STr͛>|dmۜhK n=rЮ]ѥu[#8 R"JJBB|^'l6PJ^^VPo :Gz8VrrrǎRruu8xu½{6nX+_޹sٳgkjj&Lp9ggv=888DGGw~qxyy?~^[[Ν;m:}Ė-[:c`02cc?>x𡼼DbXx'x0`50x=zJ)^mna9 zX,S{ ##rvyՅ 5/#"" ?DFFVW7޾>,7$bI6XC1/b/hoy*`0I ә0A* *h1}}))9.GSsڵgkC fzpÆҵk-VPzhǥϟkS:733;rȈ#fz(EFW߽zrrFgɄNaPkk)/^DpqX, !U!^fc I@B! @50d@ zJJii%N=^K\9VDަFw.\x-wt/|ƌqo{.^|v!!22P… Y,VNNΙ3g޾}+((2vdKJus3qs3y:?:ut^^2sS'55xQ7!BPH<<<<$2B!B!Lxx<<#d.8"HDD, ```pرSrrro*]]]WW  222444)_ bkaakn @?uӪUf||Žjd$nn8͛VU5gd44Fݾhٳ_6~hD\]]Տ?}vYYy5;YQQA&EDDzёё߹&))׷n:F ѯϟVB&su]g[I$.:@ә -MMVάknnn[kkkjtfmmSK 2" @sssxyy YH R(d^^/77[@B! P(il'N̜93##C@@ ..VNNn…"""O>uttLHH w Ϸofgg]sW.[?K8~ٳ{Ĝ9nh*g`a˖k11og޽{ȑB}#׬Xqa<ŖZP̙3oN"]k. Î;W^^n``z왏Ojjڑ#GMldd}qssu=}TBB{ʕ}ɲe˲Q0LrSNz]uu#x?(x~/ß773j(FJJWn\[ZZ9q&:Ҋk}Z]ݔNomiijfL= $"‡75?mk!!ޡgWCC}PPP7o^JJInܸÃ>w9s8\sB0v5U7533C~ B0?99ݻmԩ}n8Q?!IL@蕎B<3kjjv=vW^EDD^t:p (Ҝ9̙UޥKI7na0Z)Ҁzdqv̮ AUUU?~\ZZh|||ZZZnro޼֭[o߶]vv_UyM!n9S`C>>..QO;8Yc!))S`{M 5J?nn&ܛ6]k>|x>4@3ݧ{uuƍ0,8~ Ah6 @UU/_=xaqܨf}zxx}ddq444Puݞ,`>>+VL {wJ4Wyya/^4Gsrr?]~~;wmvGrssϞ=koo.//=EPCC-ѣʸBmW$$ijtdH"Cf :Y[یtx@Ng673_@5{xx8~}*=y $5J$*jS`,^988ŋzyyyxx?~ťΝ;cǎw޻wܲcbb8 थ+**\]]O>}u֑H$//g^~plj9s͛_do舏$1cơCq_S]xq׮]_Su .]mo幹]r5&&FEERNNNL&1"":01̈c}22^K}w1,?8E ?|(dGܕܶ: 6螝Kp@_q {xxtǏDDDLMMl6ax`"&&ð+W كa؛7oBQ(/_znLJJ/t:CRRð8]]]>>>3yT@@@QQѣx{{ݻζa=|v" u,utZ~V}pw7Ǎo).%ppp6膽=B(228^ D$,-,,4|}cg>a)P9ðsݖ~}iL\ܹ~ϻʊ¡fFMMHn`65|suucMMSC٥p_RR+%%)^mnaq,7Ѝj/+IIV2\=OreXY=yL(իp1b @nnlib[ى$""bE"Ib@0 #" V-0`H__)<|eJJKvpUu߾[**А{ ~/>bcǯ? \U}ܲzzcNJR(}绹uZ˗_@D[$ #-=z4& ]WWJK+9uʕ[ji$pG^RRϟkž>\rP-(ҡC7oZt))aQ 0ݻcl,363L>]i4zg^RWdspt0(5uS\܆ce||Œ%2a[!/54m7Xf#zwz4YXNHȄ0`Xa=Dzyscl\lLVV/nT=!aԩ404y84 שK8 ={bL:!/rӦ̲}b8oxCl01cF޺ilp{o1>0 jc*,6c0XgXqQSsڵY,vlQLLҥǏ/!wJZPgҤEz7+zHNNlnۧOXY۷_Gޫo&rq9d‚qqi?LvÇWo:~qL沵9rAYY";߈W{Ք)&"RiT*-!!E^^XXuT5!!^8p qA=ϝQY,5S;P N\HQDm3{9╕ Tw*0۷9Y]XUX]XYPUPUKcEEmeecuuSs3!D"qedz g898kH }U.UV62)RF~ 'L&;-J=xի<%cljbjh 0Bhyȃ~>>+VL {wJ=/dV54 #...b,8>|(~Zd?>H$HD,]0A/!f4ٳ'ܿڶqq.^\ާv 7nrڵ&t H$Ǐa^]IJq㵿C>>n]]Uccak& % @qs3ylۦMn~g`{мʡw]YOWss+׻wχ`M~$:51vvT#@" ( f'd.SS54гw\ v" #qM ɓNg,;W3ϙ3С));߉qnjGDLۚ&8 % f<9:?:ĵk-UT$~$&fv<^rtOTT$o<|!8`ߟM """s2vUBj`M !$!!cǯ7F"!O秸_pr2ܳg.7w>}GѢEFm3._NL% ʊ~}d\NNɩ8`! b8`dɤy3׮  X2vL_oϘ螝]ddds3cT"<<䀀%S@65ﴴZZkIXٳKA*qUUӧYT*궙J8}zOP}B0ӎZdan *?δv3R||F}}ȑp"4? kJ\\ozz6XO:(JkWsO 0 CjjR暖:: >bO?|ر2ǎ93 -u#44H$6!oh˗y4*CQJ vǏ?01QkNgn~=44y*Mfw'xRlشBc¥w={ ̟?X/`6IIIߺa?bʖ/?__r挳 6KM-JL̤R^mii9R !=B(22rcNNyԨ>kM XWTTZuIX70pI~fFW]+Q(Ї! `z4C0؏[^kYzٲ)0j5b_E\\M d."P_߲aCĝ;֭ݐ=}IӧYU**ꓓ?Q*>>n]]V 0#%)8$))8v9?ӧYϞe?{]ZZ+(c`cƍp ! `z4lB0[Qsu7QQ~8о}$QLL`$R^^eѣ-BHiiUJJQrrQJJG/ddmltl=;;=++/lVo ))'9sfرW^ׯqtt_8p… VVV{5kҢE:3gii)//iY~}PP>V ٳgjjjg'mxB''UOG@UUEODD0t--m8pcX͛bh*58-$=䙨0eggggkTP@Fak.9҄!mmmgϞ-++۶m B6mՎ;^|Imkk_?Cx<^\\\^^ަMBQpTqkkk99Zb!pĈw(^+00PMMW^sY`!$66JRRRKKkt699AFFڵk;YZjGDiY3|%KNU!,()xxXn2%kBC'Xgd_Əz)YȺu!!ccsB>|(޾ۛ76(7bCdej֬ÿ8Z|*< #TWW;88[NJJԴ f;w#44ٳFrsssss5j!ݻӫUVVҏ_xq{9~ӧO͓V\9sAY[[.Xޞs1991cΙ3瞞yyyk֬655uqq={vDDѣ :K'q ƈC""v;q"믭]TU<<,=<,Iq|wayee}uL֜9Gܶ];1y8={/z/4(+XYL[[7B O mnn8 x}}=!ӑѧNڷomfϞ`0ڰaCbb"ߟfVի.]Ja2} YjYVVVdd$ٱc !BBB:::O<ٵkט1cdeesrrnZVV~!!#G.X,33cHXD{;vĹleΛ7KGGIGaD8AAgttlmlk?55y >5& t驨;&KҚ1cPk+)OK+IK+ MiK]][[vAO::O_0Ū{!l|NNŹs?񊊊\2w\'''sssݻgeeE~:n[kHAFN2O>-ܫWbGGGO>ǏSnnv:eϟd髡'jHSSkF7) =$::#*}$\?dyœ7oiܹ.ETdfrOH \3_WKK/R0]믿^t%K?.jܹsIII 622(Ǯ+VWLHH(--tCoTYYIggPzeGGG>ODKQ{K СfC=뾾z;i54$$Dm_j}VرT!!Lv| ϛe<Ɲ}+##5##ɓ !٥%Nәuu22t%Kf" @RVV޷o7|#//3iҤV[[[Yf1̪0@JJj߾}^^^RQQsѣG{ywܹ}||\+nJwD꨾㕕=z(22eddL|ǎ~4&Mr1@SQ8/=ΠANN暸8.nE^^ӧ;yE@fDBHIɳ̇L3Y|>п(#x/ބ'O~.~10`@w<1ƍ#P:풚Z*,,%drsaV9( II e >{ƍtnJJQ}}s޲} 55{!D<|i--Ői WmmCfì۷KsrJDEӰ֡32L2r@ |v)n}b0mCBBڵYYvi@51q)"ދsΜz(VcҎDpl'IUJM-nm 8РW/i8>---zҪ?/Z4l!!d>Z)OOff>lll35biXvvzJt_@H`>/yVDD`0 >OG:ӧΜrddhj*BX`c/BYYq|ss+(j7|VU&BB EEiAFYYFXQQwoY/~zZbx/ZZ~kvT7oΝ{a3pիW8wFܰa 5ddl=6[oƌA,Z"++alfLkk7}4g?~|zH t{}پkc.|Fb]%L^^j._oE aŊ,?TULvY۳'Da4--he맱u%KF>|s&BO+*Jw\EBBTBB^UU-67ԼimmYPPYYY[UU#ш((HUU9yy)[[ dt+KݺuF/5鵷-!ӗ99eYY[^zIVVBF+QiVD >ծ@,8l֬i%VTT:M qqUHBZLmm#ݠFgiiUmm'uuWyK:Y(#**ǒQ. **..z^[R0 ݎߠiӜ._gOBfCEOۉZBBTGGIGmS4tr8 ϟ׷TnP#-h^SEEb_0;;EtsK8[@snDHahfh6~<=8' t͇߯7pʻCwDޡAִ͟KX} Dͭ…..hs!<}ZI-=r0Oӹ Ϟ¡ulP&"GwzJ*((ҏeddobgJJJҪmll[7য়F9(a>WoOĿEHHҥK?yoll KZZ\ZZ\[miZ[ytvŋWϟzU]*55]711;vlzzctt4EpyxxXYY={v޽f͢W(jk֬x}ɕ+W !311 >}!_~-ijj;VCC3QQQ"]Z'''cc U}|/_dɄVQEX>;oJWySKضm yѦMO>=qďG UEEEdd$ϟ7UW7b7nB,-ee\?`1\Cqhkk;{lYY6mZHHȎ;vEmkk;M̟?ٙ%&&ҿi.]kF$""rիWS}Oٳ͙kddm۶:88,\088844tȐ!?í[zp9sW?ӦM+**Z~}aak HvࢢÇo/!--MP>O3gccc-[v}eee??UV1}G^DGg:Y]*'g .Ï#x_7{gpa…Cg,,,|F:MĻt}Miw/ˋ~pzAi7oD)Ljj`0JHCCJEovﾷ{=ii1g֕x*wq/Kn|/^v˖qzzϑ ZjѢE999:::/,Sv}B&NHEʲ/_Λ7O^^~555+VXiz>|xhhhMMͪU̲"##͛G:ӧO tzjcccccckk뢢K:Cׁ~ɮ]ƌ#++uֲĎ"33]*vϟGEݎ]&$)x< {88 --v?F8;qڵkر}阽{:^1,,cʛN,^XWWwܸq7nLOPPPYYY)Cewc &$$o߾d0Ǐ/:-U t{?N'<ed 믿^t%K?."ܹsIII 622(Ǯ+VWLHHtP}BHiiŋ_k7r흟KQ󓓓#RRRS'III3Q?.eJGo)zeGGG>OxNJŵ+Z|eCCg.4 K^aDE{8 !!ĉo;u%KF`D{{oF^^>---,,gҤIfb2UUU7550`Ծ}奢rΝG0>_RRw^MMz1.]L&BBBBIIi֬Y{1ckTTTLL̦M>!}}}ׯ_rWXu!C0;wܿ}%v:xeee=x'O.߫b|>u-yy׌g?77#@8>qKWW9"bɓkD_Yj1gNm^tELLRTTD,x<^qq1=ݻwUUUg>Vʻ}2ϟ?1;/hS͛Zeeeu %M\!Chh,_8"9#V!$""ռ|xzz]~!SLJII7677HJJӽ)o @vv _.\PZZzÆ oZbȑK0`)S߳gEQ^8qβe֭[ghh]bܶ풵juڋ^;LMWpqajkW8pذ_K.7} ?r\ cdž/]`DFFSY[[:t?_vnccyyyooYDD_ dggSKIII'\v:tѣG>j*UUU===ACˎe抈L>ƍ,..cu|SBBB}]xx !&M׾ewuc Lrr2-%8:n(ѣwйÒ=k{}{<?-/X)GxGGZbřFJP(--mbb'Nxxx,ZHMMMGGg<O:Kyc Miz iN=CQԅ LMMfΜH*| 0( @yfO""CENLLNFW]]a;1n8|--m/\c0 FQQ]M0 pTu焄?-A:wQާOMMͮŋcccw`0(200??w`Kih(=;޼6ޘ1V:cƠ3V;IG[zzF^#&&ffns9Ne޾]+_ mlaĈ'׭d2qQ` k׮]zrvv)++?~<>qJ:p. Tݸڵ%G[>5pFg͡W++CήLCZZвe#1wo g{y _jFX988%##(Դϙ3V<{dƜ9HH"2ZM\\tNuM\)S~?y2#gϵ!C"&R0s1klGY(<44 D.ꅅ22V̜yhĈ_JnK#''mm[[pJw-X䤓QFYHJ!J ؒ0=ép++%nԩltZO%D@ XRt.!..;KruXTTQ*+ko.޾]T46HIXZ^^66:#G:2QQ߾*6ol֭;7dȖٳϚ,++tHOA\LyyuLLNtt)++ 9ࠏ\ !=ᔧs)kf&Lg(1|\\LW9oԩ0R/)Au;/rMVPrw715hpVLIIg S\QqS,࠿hpKLSJJ ѧSQQ8WDEM`;BB/[DDĸqNx*3az:7=?_lbl&*+yyyjZt`AKK[ZZɕ+yѷ?s1j'RQ"%ép54IX,v$oݿ gd E"SC ]57%&޿psJ^mmn6l;w22t:!!*ʹeXZ*heeKmm!&R0ﭵ\tZmm%wwCݕV3Fgdpz_NhJ J]#3/XXh͛7dpZ|dHߐqqy119%$D4ps36\YYxMSS+= ÈnbfikˤvQBCٓu[MM~Lg__{II1cA 㨪OHo?СÇ0|/dET3FsKJe鴋iiiq [)+ڿ?),,YFFb~~)L0+yuujnnnnlmzƴé){쥘f3l&&,Vޝ.-->mɓ`(t)Oge=w"}֧OLEEbM]=x|--E;;=:bb}3UYYwcRZZxcX͘Y Tvvil˗s*)ɸ99JI5|jj22Nyz:7'& QssM6[fXh%iii޳kΘ1hkR0]Yllwuq12Ĥo_3>{1:#[ZZE14Tѵex%qEIӦ9)*J#,)FCC˭[qqy sw7D|;}4=^YRR4ҲƠ=ӽ{=,᯿0ZaGH虭RS|Դ[?77SssM ]]TTV1 U6ikdU!><<4.ر6; FMc^Ϛ޽e$={ZL0{Т EfYZjbpRn76::O0|8 S:B zI||^RRAjj1EQVV:C:9i K--m99e\:RYY'$03]tt%x_ Og?z}UƏgc @ {k U WFvvzP IYYUZZ (?qk+OIIZaԯ_qD >Scb52nj=`>#mmLnBB~BB~~¶NNFNN,&FZ\8 6f3l&&Oϧ23NeFGgzlcai$@ gի۷K n(pyj 2DOJztnIӶ6f/{,if)%fS/_΍T ""})..bizl6DS>_DE:; ffI@ SwVܸQTVҦdd8h!&M]=x|CC5Kaԯ_@\mmCRRA\\^llnCC[WApˆ %3!S)7BHajڇ鉉 D .S){wf3Y,-KKUUQ˗M׮___linbbj^EB WZZ )yy)``d8c555~tk&zh OҳXZ} |IZZn*tɓZUU!CL\\L 2œ}%A Nōnff>lll~/FVDDĸqf[կsK7K㹰zrr؁'KL|33tr2tsgkD!CxG܌ nb⃺Fq++zZ%33M!v`02euNN.jhhqu巶K32UBB 33M[[&= &!1ի׮?^_]} aH_7 ӹ/_6))X[̏2y~͚3gm}ޱSRFyyZmltFA[k|j?8+< %%%88;d?0#aa!z`Wƿw=Ҷm6[޾-H Wǎ]{,ҖSTsUV։ [ZjXZ':z::JNH-CQmVC5bc|ٔV\xVх w|o_}UU{Zp.\NK!xQ]JQQZLyyujj1vʣsXCX,M33M))1f=J!7puGuR[ېZrVaJJ|>OTWZ3οBEJ32t:qqK00Н쁹*)x'RffƖ܊ nRRSm**vv_fg%K]\SS+EQmm ϝ{UQQZgʔ66ڲR0$%l=6[`tu^l1L6o=xd∬RQ dƎo._ǎr5s&Nt| 1Æm0`c``?'uuup8WKJJ|}}//_@JJlΝmmmWʦNjdd$++f=}1gwt"$$DFF'_`0>>N>} etjLsa07oޤq tTqݎ/=xoUTT6lXVVֿC Fk;tDOB\\޾}_B1]V111:ujcرvvv~~~ 8pٳ{5k"EQw^f LLL\"--M7oIPPӍT >[.2+*KK˫(G`۷K\\\&MD޹s#߿1e&LJJJۗ#++%l۶)ѣM6ϟ>}zĉgϞ3ḟ֭[>d2+WB._>>gϞ5jWk%%%5xΜ9'N4hPZZ̿.#膄!mmmgϞ-++;<M6-$$dǎv"涵Bϟ ե FFj\''q<77WWTTWTr*0;:...3Ϟ=UPPOP???ccࠠw/ˋ~pzAi7o;vٳgVVV[n1⒒yyuBUTTŋw Ǜ;w.;t钨(!dƫW>uTMwGн.qq@7;w.\P]]HII_`\PYf:uJAAaԨQ"""tӫŅ;wŋĉK xBݺ|H||wt3jjjiiiNNNfff;PvZMMMMMͥK/pĈw(*33`l޼@MMmvb2zZ~}1bDTTԛʤs222666׮]{˻9}!իֽz;vW_}5qNoRqq[nїIbbb6lzEQ))) C%ѴiVXAW **TVVۻ>111//ot"%%uСQF. >N{llիۏ0l055b~&)--hD+. !"""U>}:222::ԩS퓖޶mٳ 0 l6cU[TTXII@w@!TWWwt!111ǎy$00‚nZ#A#i u8qk@@@^^ޚ5k==={̙E\RWWwӦMӧOR0߿o,NQY ''ܹsǏxEEEW\;w9EQݣ^~^QWWRuzG~iǎÇ_jTddĉ66(Q__'h&7oޤjmm-++366~KJKK]VEEbB m6ҫc7N)0x>}lܸ1::hkkCگi~_ˎ|>t qqqO&L0z脄]]].~oo|:8}6ܿ+8p1!&&vҥ &8q߾}Æ z*=4ݨQ222ݻrʇ&$$\ӆL>~„ ˖-7o>zꐐ*mmm>>>7o2dH~~;n.???,,ȑ#W\`ʜ5kÇg̘q ??:%vs}Y"""N3!!w!͍N 8zm s;tHH=̶mBCC󃃃_[Ӻx'O?eddTVVBdeeĉ-RSSY~=ǣ'$*,,(*;;YFFd/|>?##MQTnn.!$%%(.KvEQNmm)STUU jձLmllۿcu.\`jj4sL77N-Emٲr!3#G׶pBii 6V833C]]]QQ%99ӏc^z5qDYYYe˖[pܹV$%%fIII{{{zx㏲tFy>1n8>@dd?_EGSSkx;v0 ϟ?`Ƃ8 Ff@^vիW/gg瘘0 ǎ9rd|||tt= glԩSNE?䐂䐂䐂䐂䐂䐂䐂D)))dH@WFB >9 5`[stt@sIO 3"|rH|rH|r= endstream endobj 654 0 obj << /Length 2574 /Filter /FlateDecode >> stream xڕXo8_aK<"WrH"齴ExĨǞ=e=q #Q4EQi}kYZilxeiQ~dIzqx7[D?oO>Tw{陋aűUQhۍP>[Zi~"jq&rێg= _w5>Df3&Eߴns]]\_Ezx "etle~(͎wm^#(zָH6FeQĒ;>A EG:Ὠγ+PGeǿV掅6wNTyŔ"+2(Pws^yǴDz"yfEB< }e\V? l:XexؾSw]P˂CGcvɐ=ڐf6zv:xqEz[7ILz6 TFG.2\?.o{5do֙I68uuY?|~}Xd-Xcڼ-2)|Vi/[hu'*@U꜂hT: u>3GmbܣOb)2o_yzl*ԃBwpje04̅A7 "pz/k rmG+zSÐ]1^xA8A_dM frE k=ɞk`'W}g"*ItuZr\ٛ,^/xgBpщOv}q,yeLDloygZ>87f3pmH;I[\pq϶Kkdk!3O0 If-:?'K7- &J@NL0Z*վ^` GtX]d0lebE.vU{hj uf5Lzu~k3|P̎0Ͻ <:ÿ=` ;^C,Vͽ 굁R**MD*Ts&0R *U."0BUnA 8ԅ4xq ~A8Y %x,mQcP0J1\~I<ݸm!qHߡ#^_'.j'-d ,nMWZN9T -JdCfQI8sëj&6iBT:|@rR?|x> >> stream xy\?3 ! A( \)mkk]*Vi^w+ViYk]@kjl^H EԂ $Ms!T3Ϝgdr2C4MEBPJ|@(PJ|@(%>J|@(YPBEQK!X___;B鏷w||< J|j*WWW{!]?a' 58߅cʠ`< C!q``_e0%>ŢA/;;ܹs܊)nkkiz]"(>pKёUSS-??9S)*++{)SQQ`mm=l0ww۷o.odd$;ׯ_occ6rȽ{J'hŋE $g'!D$}QQQOZ&M4o<}_W,s8G~ޱΜ9577 L K$fddjjjvݻãymiŘ??Yff>`C<)6{l /##oa `jʶ[.^8..׮]{-[\;.`j8HA8ӧO166̜?~aavtëf}}=yBg돵#dgg{==='M`Eijj"Ԁ{<|0((h„ III***իW9r$((hƌcƌ!H*))9r!֭[ Xx1'g1w\[A8}i,,l…81Q`JMM=z͛;W_pUCCcر !9!` 6Bx MM͑#G;vi35kĔzxxhkk[[[߿i6))QGGg֬Y>̞=;999|͞=[. #11QъbWTRR:uꔚM;w&M*))a^#%rC?\x`Lc[lx</44]tEQ۷o166 z +La,X`{]R"Ǐ'455B coD"_/ɥBȹsƌ9qY&11ASSۻYvvnjܬA{yJ׮Ն[Ao={?ضmS3VXblHT----,,l"ӥO2h8In8999***c>c楱|ӦMШ"lܸJUUދZz5EQN$׮]366ڸq#ٵkܹs=:w\Bɓ!Ǐp84M_zrIBٳg{]i.rJٍ]jfgg'MnnnQQQQQQ{&&&㰭|„ 7o޴~8kmm|ګefKee%r̯fffׯkUC<Ųt__E555v| Ȫd.#=DFFF%D]V$,Z?\nի{ ŋG@z]@›BaWW*Y:C}*SL`{{l6-!#Glhh~$ ̺]~V2<:991#GvJq<<Ȉ mΜ9Roo]uӧO?p䮘+++ HAdul;S_}۔)_EE]k$0 lOcO"HzBݓ3g[NMNN_?3yl6Ŋe>gٶ...4M>Vls|>3!='m/U`>u?8jԦ>K4-wsH/qLLL6l!S]]3ԯ_.ݕ; SCRssD"D7oތH$999SRRO)+..^p;sssSRR |R~~~^^^6lرcǒ%K\\\NVTT$ִiӾK'''[[.]U@QQQtttgggEEŁx<^'bAAAhhhmm@ QQQ[xqݹsGq&O,NS?KK*64`Ο i,]tiiv䎽:B+*++###i_0 \\\̙7o<'LѣCYYYM2A1cƌŋ {:t;rK,/^gC/_/%\ 9zllNjjAg'bQIzm'?.13'đ,8𜘚|~SRrcc/ݸqOY.ApΓB CWW7""BWWJIIDO1MMMM333ABE.LN=9Ӈfy_x^yx͚w23?[BQQQ§ЅѣGO81}$ccAࡥ=>*~4$ !\R?Mo$ΐIL D@]::$㕟.عs.&Q6!ʏ?^7Z4& *:a3s ZZ=jG@'LрJ|BMMYMMqwEC偹(%>(%>g Q>j#˖ؘ^ DQX80n砣CRTTwWRrK,TQa[Xh"J/0!皚 .` 7a7xy WJkkG~;Iacy掎<##m J|~.Ik;bq5=$?]UU#͘RTg']ZZ'~sZÇm\9S;:nkUJ|A鋊j۔PJ|!^vvSӗzf n,?^hnee(@0H7护X;f\ P R?|J(~3 `jll^ !b,LT(@0H=z^PPSNN̵,̵p7Y@0XvJ__chKv P W5=s)]]q%> {۩ʢڎ5=J|vJUUyH3m lv %><5;W3i))-NqJ,J|x$/|OܫW7?ֺNegW46(++99xBJ<˗BBׯߦiaݻ wʕuvxyst42p,J|xn344ܹkl6קAի54TvyKNvt98V(aഷ#"""1$+?0ɩή{@Q5&n% LPoW76rQ"ݼ tvO14jhhik;:̝,MMu:QGFܾ~ѣvB+򊱭"f氺 uuΝsG2_zE6qYY]Yٝ:_y !X9occdmmdkkH:/.%zu3nA0%~,WII8=K{qCYTKmǀBM?tɭ_Bs' @Ѵ{.޿1 {y45uܻznݻm޽vp(butH:;iBM]2m9/8PVZ8QffݻxK|Г֎"ѽ{UU6ŒMA?\]]%>%>**;;;;;;۷mB|PËŢLMup}L,A/;;ܞs纹BTTT] .4#mGSS-??_׊kkaÆ0S&]izMP<zSUVVZd EQk֬c/^(;_4iҼyjk?mMb19z|/H***<x{zxxkhh͞=_GGo3;;^ 0aBRR !dG 1cP(qqqC;i$+x|߾}FFFޭ[~WBƍVWWÆ oN`)RRRN81q7|}ZjϞ=/^5kݻUUU{@ (--i{;rǬXRRwիW竩988>EQ~"啕y{{+ /+BBBB###kjj.\HQ ",GNccɓ̉7n֭)7ϟaƌ '''Ғe˖ ڵkӦM2{qrܹg%%%Y&,,ԔUk45&%] \fN`1BnbzzzBbbbΔ2e{ !k׮>>>_|ʕ+_XXH$JHHx葖Vbb?Ϙ1C#GtطocǎUUU= awJ>|„ 7o޴a,--ffGGGyRYY\.󫭭m||<󳙙!뭭t}}}%%%{{{eX>J6r=ҥK##!qtt|AUU@ }<77IZs.Z)...00Pq$=T}YhѢ?sݺu~~~Wi\xQqe萤ddŝ,EӴX~)f̨)1l;'#Glhh`('̺]~7 0Õ?Ȗ Ψ2o^d.ÇwuС,b6779sFv->_]]-\,!\OOO,4MtFFFtt@ (..N.--ۥӧO3'k9sudߥ$''}b4M*#"wt>_YYYXX]\\`DX^~qŊ32J::$4MK$H~t`$D")//g,,,422qBn߾}ܹ[Y`ARRC_B/ ghssD"D7oތH$999SRR)+..^p;sssSRRkIyyyUVVnذaǎK,qqq :ujZZZQQz2EEEѝx̔,^XnzA???9shkkgeeEGG͛7OV--iӦ}NNN^bAAAhhhmm@ QQQӓwQɓ'KN*4M===$$$((^^^YYYfMLLΟ?d``}+WRoJu,;_3g{jGn={+W6mĜ)5jԑ#GϟefobbS=W|ƍݻw755999>}6ʖ=EFvu_NRpόK Z=-f"#GNOBpƌ\.wƍk׮e@R=Ɖ'Ǝ+;fɺ'O Q٣⣐H$B/ 1%iK<(P}ReJJ^\\΃bq 'Mfff<o`{kk @KZZ;:--75̚ ,ll6##$99:l9>loEd PuF]VWr8,55.VWvː (++;;l:NUfSoVoo!:޾ݘSUua!elhE&D kE`aa (%>u4]Wnu=^U;FFǎ}ćAM\]--UT)/sVCGG'!DIbQBر| `P4Mw|||Y,.cllQQKK"2PQz Mb8pѣk߅Bs'!`,~\\3zX}ȩmh( Gj۶&&j'L>BAx9Q8e}wqbeTTqGO߳'3 uuÇmz ySUUFPUUuwKX,VggqeeIyy7T8NNNNֆl6 fΝ;M|x1eko뛔XVV<Qʘ֯~^1?dpÞ/_! yV p%> egW)_X^QήlllQWaʜwt41{kٳ_=VH:0~~›khp_y{@CXY^wşMbkk"mm(0$utH**nCsv8:;9Yj"P(aHjii/,/+줍'G@%>vMi_ZZGSUG%>Akqq~6!Dwvhk!P`Hjllϯή~f ^}@J|!IbWT߻冻NN\.n (~şSҥ5BY?vvevv[[ 0pt9;[/ w%>P冻չ#F}]T`r][*vvpW( ?T2anbkwokk@J|!ö?Pt-'' CCM P IMMEEn5f(?ssEyy7nxͲ6tr2wr2wtpp0UQ P`0Uq8cbݿVЁP(y90>5/uvuu srKeq(#> @0 XJ|@(%>J|xttthjjeH w= V'}_Wȋ&/233Ocll9۷c~coo/-"|gvvIG9΀oyzzJQܫXx<ޓ޽'G œX,裏Ϝ9NYl}XX… mmm1^$0hb^Ͼ׬Ycllohjj9رc4MBh޲e xMzxxhkk[[[߿K.Q}vcc@4ҩSԺS!ܹscƌ8q,̜ࠩ]` tcƌmnnVЦ\GVUU577߼y3 .jhh;_~!v}%III:::fͪqrvg͊@^ /+/Ξ=l۶+VbX]6{DFFZZZ~疖[lOP(KrikkEEEEEEٳG sL_d7$//{0rJBBΝ;i9YH_9΄ ^J4yi7nܨʬ2}zy-++c\zNzz:SDFFdee]zիӧOwuueJ3g4KINNi/"&M:*K%JS’%Klmm;;;inkkӓ2 ̶8::uttB=*̒...ϗfO=u֡C[[[sW/v@.51b1Dbccd%~SSkTԅwmf63 61Yeb2yxؼy3EQҠM8QKnLa[UUŬi&KKKD0`.>@Ztidd?B*++|>e'l+++#G644H?~zkkk&mJ__YRg w +OR!|>_t[TUUGL:鹂6|„ 7o޴ښ L .P %%%{{{c,Ç}Ԃfuv҄ ūJkFM9<32=S!E3?[ZZVWW3~ dWjⲲ2X"3ijj2b}|FFSc)|>3!4Lҗ6;|]:А<%sb{̙.O!w(@ (.. ^ZZ ~qŊ#Fl?gdttH:; 2yyfbbaFzzzuuug)H~4;.\cooܔPXWWG]bEeeedd-[yyyUVVnذaǎz?JSL:UZK,/^?===$$$((^^^Bpƌ\.wƍk׮_ULLLΟ?d``}+W^|{%)z]kԨQ)))?nhh(H/mB/_^XXtaÆ7.**jٲe֭KIIafH;~⣂hPo޿_P<{-+(x#eevq˓o?sff"/0/}ݜ78p@,;6===++˥f !fO:544f|駗.]Q`phFWllH.x<޳~ӧOٳ(mll/_ޗH~ls% /]LIɋآWVVځ@^< immq gg^w%gJWW7""BWWJIIDOܚifff?9HXUX،ܟ~kk`xI!ѣ'N>}zZZZRR lsPVVrwwzuW_Ţl ȋ7/O*0Q 0ȽM`kLN=uw**#/0Q`02裉}4Q$h@O0Q`豰C%>J|@(%>@(` EQ`4M# … < &x<`J|/@(%>@(%>(%> endstream endobj 646 0 obj << /Type /XObject /Subtype /Image /Width 1443 /Height 456 /BitsPerComponent 8 /ColorSpace /DeviceRGB /Length 51774 /Filter /FlateDecode >> stream xXg?p1A$-4)j@TPc?jirxv)JQ kIPi* DT(APTDX(R 96<<>Swٽ{ysy @[t+,rt6m*d֫Ats8KSRRRQQr6oϭU'Uaa!ه{s ԎjjAĐΞ=5Ak Aș7 :_>vӧӽ{.ۻwGQ[;99POmxxxfׯ]ի&L$E%۳g˗FߨZVq~\%???!!(uN/ZeKV;}dZuaaa~i߾}mmmIiRgJ=f{t4 :$ѽ{CC :͛7?~>={vDDcǎԬʤî#Y݅ TTT.]JR y LѣGjNJ]TUUuܹaaadǏjjRšCЃ :OR``ՙ߾};%%O>43 ͂z-[|3glhh:ԉ_ޖ2|t}ZZZKs̱x.m'}A*ʓ'Ob2M'w֪ 8p )H u}rLR;)SII)((US+R;'|7:%`2;uU˥Δz{+P̠Cr҃&s=Ju׈4 :,Xn];7GWѣG\duͣ$8[[[ꙔƜ;w*))eggK]aƍ&&&Ƀ%W ƍGR̡]~ZytlCh3:Adαc$Gंj y۷ooРAT!))) RM6@ >ZYY}gխY/jjjlmmO>-xٖ.<==IJJ>WQQ!( Ɂ{t f=xmu͂f3Bk#"T_SM/fffC P߼yz_~%%%%GG۷o^ ߧhܿ_UUȑ#7n$DGGKVG%%\öjjjyyyRdo߾~ظNDxxCVdW:@!;Ç[Su{iݺu+W x [ɓ'kjj鑥ߺjiiI>|D꒓GMgԨQd)2KC QQQ_fMqqqk-[o߾:::nnn<hΝnwіdRA nҥKmtAСtAСtAСtAСtAСtܨ?s榲` AhUUII}fsY,X A8MMM0 Ԝ9;l.8a67ӧxtE!>!G&& #СC2:D"QSSӔ)SLfeee=oXBa#ѣ(dqkA\~}L&?5kVzzzPPP@@dI}||$1cƌ=Z(@0`9sX$; SSS?}vA@~liuHϤlNttЎ@]uمȢӁ2s{Ҙ7@UT-_O[)88/Eeo@u1c35rZt9=Wtu,YTT@eo@%6F3/^$A@gpC=|X>c߰agBkӁ27x񎱱ԩ?ܿ_@eo@'kiqׯ? BktFCEE+:::+V(//̙3xbڀfΜy5zF***Ȣs455MEmUSSf``fll(DչsȜw 8w=7@a 6Dܟ~J;d;ӡ2cƌ}}2Aя'$$P[J28y򤩩*jjjr Y駟ֶFLynnY맯k.zs.ۻw={tӧolUYYx'Ac߾}*#((ɓi9F>tL>=@===Q]]M7oYd=zR2tΝ;7,,Օ<~8T߾};%%O><OLRG}4{lR͛wAihhYPP2@6BC/iiq׮=(`wtp8A)MrҖAG1:ӑ~(++[ZZfffRBmllHB(Zۊ:KKK^D%N 177_|ԙ|>_UU5---%rԚ,#oC,nc29;wAk۠c-]IHH ]|YrM???--o -..֖JTsrrvܩ-c+:hhhظq:OɠǏf3׭[Sk/AgYssE̞ kEH"4|!C\OxAG~~~>}ZFZ[[btcc#H(QtǓ=r ='==IJJjKΟ?ICC{G`$f3 DNJJʩSC^ϛbᨣv/\.Y陑N?<""",,o[kUVVSLݻ7}=ѣG2" @`ff6x`}uuum :|}}C͟?̴kcQXXH! EEсCq4ɗp41y,+!-7x-&l{  mm˗K!t׮]7o8pԩSSSSE-#%dDDYYٺu BvC__͚5Ԣuuu˖-۷322ڹsg29ydMMM==+:^iiMppU 16<'7em?#FxΜI5Z]򭠠ҥKm:zt[l6`ڵ11tsn.[smmZ3 l:zgvvNd">>^y溺F76AGgC͉D⤤kNC@ڳno=MFA=555幸D}heRXXbq(嵗.%MMtC34tӇ<:ƌ\&l>,G@'܎jk;\Ck3gn 65b #so_ŋwJKkJgCMg Xss)B@\\tt@k~c+M%d|駤3gnJ::wO#=X2Ba}+W5ڢADlͤdrHnڃ)dQM_U!x'kɷ*_p5.S_/\!ZCsn\xFQWy<^S7*ߴ@ AGW7Ww.Y7**-]ښolqcFKuuw:G`8nې>ZP6#l:ؼ9O61yXZZfW]]?NSSbM$_v ik;1[7lֱo@ttK}|W|ppJ;k(55 41tv!Z+ٿRLM֮=^PPI5"l::5̙k2vB+@җw"@ JJvqd:>> jGtt |5ut 7o ^ӧ3f{b@UUÇ3'nݚp.QAGt"7'OX,΢EȫbU1}cK9=z/mlvkk;?2_CBnUU/ϝp0a[PPr=>/RssJ9+S zux\\zhzDv756I=UUϚ}(Kxa4ɗpM0 ׯ?rq6̝g "4 tOϞ 7}QQQwGjUXbzv`U˗ mI+A@wVW'xrr۳XC kLJhMc89Ua::~B2"-o*,,ؾر[ ǹs:| ^ К<CGThD"ʕ 7dd?hՃe''LF2o_E%H,nZKw?~uk&6l'Nd 8RUV9W{<*o^DtҼ=F[)))[n(;C鯍$КG &?::d"&ڳg3yH"l!(NR! 45-RXY+5*oAGgC=drIB:hfaᣥ%]8-UUGGoU AGgC=Nh%&o_J>:?3;==W輼Yf=$&^_:`͵~GΆzÇ0?=?|~HOccee58kI[b!,/BB.T!l:9wӆ =tz!llab)""RI ƵkgVVa"l:q㱡Uº#[ G6̝L pBH|Oc<t3&sWF^Aǃ/_nddiff.۷o@d``@9szj2,\"I]YWB=B^^ǒ%{{]:zС䚚MKھ@ JJ^ ^3}ɬ=1|Sm :RSS `hhW_)))GAͤ@0p@2b566[]LW%j!!!:@TfY)Ac㋈c-C$<}ZS rI$`w>fUճt;``29VV)e \ :HҲ?<lCK,5 Ggggs$˗ j{QRRRQQz:YǎR\\Ճv;--춖É|)#ȫf `o׮R),N $hk;GG+0 ::))yTUUUDDDnn.>,\PCC&Գ$ddxb}}gϞijjK%cԠ"ꪫO2%''TQQɓl6ˋlr޽{ٳAP">=7CL{r,88EGIK`8YK.\t&%ec?#Y WҨ!<<\YY9::2ɜÇCuu7^t6E^WLL |044|"Nf>~TUUuܹaaadǩYPPz((]]WzޖՐv7/0#Nȱʺ+3TAX'OEǍDh6JJJ&M>$$$̙3ښ>rH*‡02}XCd,j-FFF>}TA#JQQQpppii)iW#11-doJ:q|~affߑoh<ldAN&ƌ#\HzӠ!##|ɠ#<<\UUАI3fW 2::zooommm2ѣ͂7MLL$,CEG3KW3--l={cA56Y,kr?63iPotTUU1ٳg BzٳgAVSQQɡÇ޽{xTwy tܸqAD))9Nq|?{bgLw|sR8oVV?I8!C\{;[A$$$'|e˖{^ZSS> :j , &&&_q̙;v\4jtCX$;غ|}}Ķm"##UUUKJJD"#ϟOVC=͛FF׬9؝ihq1/5^j(7wD_ߕH9^q.\߱ :ׯ/Xd~ᇳfJOO  "##ɴd0f̘ѣGK% 0g^tt`]doFr544nZWWlٲ}踹x<##;w"z-sT_/;ǧz{DG8-Z ͔3#/Wzyh7}y-,|k>~.丸DUTv^7hsnr̘oer~kkMm(/ZZ|h2tàc177-o 16xH$ q8q[{VLcw>z(C At\µkӦ'@:;! 6?L&+m[ΝtZA1y{u99Ev!T:xcN05}lڴ^<cԩ!/萊jjjtPؘ_Fߘy>*c&FF'MMߘn3CЁ/to?BF7괒~emm-=CNNeS%%%2/Z[[uTбdz[#>>|tvv&},GBq޽jNNN jjjj{A5B111dgvMډxknMʋ}cI7fXS3g1>?9::…;oyc[ 68:;s]3uJWoK511RRRک%YfO__׮]kIXXا~ڷo_[[ۚkr޽{ٳɓl6ˋ@5oܸNfō9ϟ:u*t,\PCC[!s$ŋr={ioo,0iΝ;dsqQEEO/j~YK>}Z2hfmkR.72\zc+uc5'}cFqqPح:t!@ntxxtEEs t㏤@eDRRR+iii}ٳ͛7+++ر5߾};%%O><OƚYYY>w\1wuu%?2?D]]}ԩbXF_~eHHLAGxx8Y'::Qff&sa:訮VSS&K.0`@ EMMM#%0L{{G]6!D擽zqiiiclO>j@===A꥛BF!ڼ}'C;kׇУtNc;ɚIߘrOR uc5'}cF[DЁ46mlv]Z~u h/_\ƚd`ҋ'u]zT2ʬ#SYH-믿㏩[;b1AGBBYښ,rww9r$wPAGXX޾}{ll,!T2 ƒP#xhhhPFH>"%_#UVV$\)4k7fH&%eϙTmCj bbV-VlhA'۶㜑pɤoE:S+YhKAlúu=H2x`|ujǓ5nƍ MLLdg0Zĉ(bee%t~uu5I3fhV=GklmmP^NNΝ;!dggKRQC2 i;mf'RdAw/ w%{Chk;=o^?iӱݻvjrf:A!͋FBr=l6H$Vі`̞=[(hgϞ4h򑔔SN5_vM>ryR˿{R&Rd"p;;;ccc*| >\2 Eɡ޽{x<+VXDPJv^N$%%IRYs6hK!AǛ^3_||y̾#b2|1+5gU)24tCRR>O>YmHO>ٲe޽{W^xaa!DEEׯ]~СvvvGit 6{JjW^%k.[,""H , &&&_q!YPñH  =))V5!>,:HWVzDСOtZ @ g>mڏ QdrRtZ "I2ΝjA f:PRR6ɉ5^>ni\3rϵkvMu|~wŊhwiWCmˆ***&:::+V(//oߟ.GSSsڴiYYYҼJ__ӧO߾}߯_z妦&2̙3Cvԡ5#46. 8q[mmCg_ g8|~2霢m1u ǎkc1c }eʔWWxcln-[~RãkF(lķ z'O?d7""R/߇A9Ul=??_MM*""ЕbbbadddAAA4ѱo߾c^YYG͞=lyfee;vܻwltPґ,,,ӧG`0]\\bq^jY :Id~ff&saA2ꕽ!tPw;piKKKcl[nl4ǏKmf *щ_es-_o(Ok; AG1:JKKI{РA8s̙렠_oiiI6!׭[ׯ_W OjuY?!!nmmM滻9;Z :=Q #00PII)22ӧoߦjz&e$]B']3bqӭ[!!V 1“pd29KJ||-j߾--yU̟S__@wà+_ѣ鏤Mu%_M, X`|Ǻu%2xyM>4{DG6Wg}6aꎎpUUjCCC';PF7zooo,䣅ѣGR(nR[F2萺B^3uII>> goqf0ן OK˩ b 7oΎΫΝ" 3n*@cӦM-VVV}ǗӇoРA!%%ԩSk֬100h-p(--%`cc#Ǐ'FUUUdO\]]ǜAQ!!'N de2cl7-#tH]rF3o l.e0 79q" 2q녓&ΝH$* 7,\T^^AAUUU9qF%%A~kaaamll|}};v ʕ+>lkk';p8ve[n_5ٓ%K455A[iFꠃAGkҍ@Ll۶-224i(nR[F$rtt$%u?Baĉvk G*|gin(IIYY;I*AB fs^33l"*;9JKŭ+Vu+H||fpp Ro!5[A;VAut%nMOA:,vvuu)/?٩.'%PHw0w2,o! ߨ:AhhMÜ9;:1y wV9fȯV~~YZZ^[AyCPdkoAСt(~Hs)2E"s Vi\3]@bcw͛cW ;vdbhdݺC'!@!'ˬ_d! /bssy[,_HSS,<<\,~qs۷I_~ MMMd3g虫W&s\ne,ԕuCNNŋutt 0sk׮Qϝ;Gj{.< -Y?*vÇ_r-N+)Jjj*zxx}WJJJt@gddP3A  8aXXLW%j!!!mlƔ}3F]]ƍtDFFrbcct@K^^FF=zQ痍u8޽{Oмy :HҲȆ999tdz[!>>|tvv&d2ttA]m:JJJHM6M(R3괴;0x")0-- A4z:t LK>*͋N+#11q"""rssa…wճ$ddxb}}gϞijjK%cԠ"ꪫO2%''TQQɓl6ˋlr޽{ؐgJE>R9dѲKIH%resssFt(چqx˖Q&$lg^#N+à$PJZZ>+++GGG233ɜÇCuu7^t`XZuĐ7o|CCCKK/4jǏKKKUUUΝJ?~]%OH:#v3޽{***BCCg͚YXX@a ^\\!]fx,: g RWV=~'YY&ymJJJ&M>$$$̙3zR}ȑTA_Oopt||_Vttx]###>}Jʑ|t(884իWAAAT쐘HV#岃H]L:r`Kt(sLο`8hwn:Ν=v1cqqrpXr5&L6jF-YXqk6.h6_GGG2WUU644xÌ3z=ȆE2[[[̱8zhaƍ.uuuɠ#++[˗%OKK:#v3c޼yӧO@.4}!o_Pظ~!--#ihw'v]0땔6JJbL_kUg0gϦG|rfwtTTT'2rrr𡨨w<vŊ_SS#c젣c:qDhhX,^~=)T$t|RI 444{tAQ[[b̙CɅilllff\H]L5kPo #okk{i %jHϲ,A7tt3Ѫ]Vf_ 9:j \xCr|O6z߿Ty~gt[^/@z|ɖ-[ݻzjMM>@2 -XL<5zƙ3gvA&rssҨM:$c젣c%۶mVUU-))DJJJRNV?>Y...:Xeee ???>?eʔ޽{SxArh.u蠃 \öjjjyyy:ͥKwLNL̵h/Z:twѪ]"88v 9VV|~rNNZRyy_`ȸh|Ӗ~ L~8k֬ɴd0f̘ѣGK% 0g^tt`]d9.uֺe˖WGG͍ܹS2 ]6o<1pSRCj9.]jY]$99QkO9SW'07\-).dAزaŕ.…;@ B{v[ NMGzz.˗;r$_!<(5kݵu=$%e]{pЍ24dVÞx:XS]‰Y::Ύ ]C(l:~y,--m ݐH$=fs}"{Mr˘\&ر[Wt(rAg/^}%$&^qvvBOm4DGۇNozo>G>cڃ񙵵 0t(r更۷cz{ǵ;'QpOTuf8PehPPtۡt(=ݍ?|}y&'%ԟv#;6K ./lR!_n:M(l>ݏt(܌p℆^BK]QQ}) ^b#GҞ>E_KA B&_|rだC H[[֭vl*_~9Oݟod!Ϟ 2!_Wl`66/ۻt(=׃eC| ō@3ʖ[Lhb /Ohu-..QCnDZywaEZ>^ Vbqn:'%e [s(aj7|eC tI=ՂC Nb29h&WhmmhÖ||^^7:Iuuѣ#j,ߘk],E'75ݼ~7ڪiÆhҧ8s&PRZZqx 㧟":uG}^--G×.o/FN1ѣ(x\'G|7}A鹤؇7Ǝ`8ZXz|Ndrwwq"!w ݨۢ@6\'ڵ|sHR7̾󍜜"\WģGOdswXMKr_h.&Nf7鰷q"?/{x @D7W uqېl@G g~<Ylrv8=eWb \!Uhm&DH̘0L1dm2dɒBdЈ5FQ(D,-ҞW7v^=ٞ<<mWǙ-` yVzxDy>?cw>YYygҏzğ`ȣ}dI %%D*ǽ{9|)ZQ\`mfXVVfhhs;w nS9~-#4΃O9}cV?,6G+G/?U`%cMժ*wphhCnaV*GLL;W9cML|NLhEЃB:8vw5jgehM}Bnn!C_~XBPV9Ȋ MKKJ~mV.tp$%|\[ۉz Kp*{&L:5))7 {n׼^j`1c 1ÇOUUn=Wor<{ LcI[?Jh+Bz %% @S Tzoooeeeyy:)P4@JaiZ0aѢ3CYܹ[ KBB,K#˅-e~@+m yyEAAoZ MhJ޽.]}=v:w\c /^;wn||I tp@愌z_VoLWPEE배qZJyy9치v-ڨq#Gp񬌍N<*5PJuiA#22RGGGJJJAAaժUUUU/_5jTϞ= E޸qCYٳҧO>lĉ梅ѥt֍-qrr@=\Q6rߙ37q^$:!ʳgo.YnOb_h1mڴj|||TUUy<^AA'tJII۷ޞO<Ʉ]]ݔخ]䄎goݺեK ~gALRѣG@y?z\t4GD$鋍Owv>fج<~BGSxXZX`ܖ@:8gzzzo YYY%%%W\زe X& . 5ZZZUUU{BG]` 4/7o>S"/ Ihy^W;?Bo#G=z/^RXXࠡ!--CCA7QPVV^hѳgZICv{zoBGqqYXXm)PGU)> XJJJV\ٽ{w ׯ_g?#Nm 5 "XQFqBG]@? 0a]YY8۶Ys]ݓ'g'M|<)o:8oLO?_~֭ ڵ+/::h@vrtt߿ZAAsBכjNu{Q/yyE㱂J0PWaJJJ:w 7n6:jftP9p!M^lll8R t@3p]̙"w<߆@ 2(.\]Qѱv~|GC"33ܾ};BtYYY6/::~GTzz5k.ڌ6hXF:iv/tpde=k6p||:*o+txxxt%00gϦ 8qQN:}w7oEꫯ;:شiӨQiiiVVV))):)  '4OyyGD 6E\E[ĖcXB۷)O:-WyAxx8Z_BACѣGӁ7)$((.ݪ9tssۼyJ>}xҥKtuTtLLWmښF8۶mrʄ dddYZ{T W$Mﵞ߹sȨW^[ns,[R7fjgx70Py+h>RVVvppw(BDDDЫ_VVM۠w>A{oXdz-Pdڵ:) l{~n]NdfV~!pᶥ!Cff~!! yyE?42]YSϚ5ȑ#yyyC~х VVV4& i("))O/} |PBݪ3YwttS޻wqzz:7HKKj@8L233ET% 61184>8vPO삩PaH|k== 4қ1cJtӦMcuYMA%@w.N`C˻.N]%u\D]ϝdcgw5ONJѫ:00}u5|t=z*++ۿi~(.B>τL 6GbС|:< udh_qXX1Y,`mmRYfeB?e",S,wYYY*g̙'O]0U*,u{OhQ/Y`TVVmFpa|f TZ8lLL ]JV>;m`L⡡/*#G۷kؗ//YHVx-993fl$[`pgGcW }vl``Pҕ'NHMMݼy3Yɯ\*T3g[BϘ1? _xu˅UgcJU0YMVnuU%d[|WcƌNY[[+)) .a/_, j||WFOe:{KKK>\L龩ۇFb<nju`55;sجdY)(G^h:rqz]m;WJsTy ˖?wVy9놏Ȫ%>i$BGXXgw3 <ڵ+tΝ_5 $kZVnŗ-[/,,433cCD ...d}g' .a~[CLMSVV⿝FlllTTT:ޖdKjjݚ BGj߹}իO̜I]ݎF<_Aj„uh1@F GN//o6[6m- Gt|GQ984WUc{2y)K,۰aEΟGFFYƍ#i׮]ׯ.**W>}:eo߾UV 8Pp{٧Ov҅*IBMinW1e/^fffb 5ܹs:rJ S5(tgffR౬8:ޝb5 ut@"@hW^ia JJJd?{L0zC[u???1eۑ3{GcծQ8===jC޽M]0U*B:7o&%Nrrj/dsŔ)({q?Q>hYmӧkde_r%##ߪFh,"]o^|ړ~}MjbϘs!6nΝ{VP+*Z:Goz\\\vt(/ScFl*/?/~!AAi7s1|<)oܻv?~HLL8~xjj1BlIK{ti љ=991MMۇl[Tԍw`#fG!e Vm}իR\YV]r CV?jHJJ6,t1 hfBǓ'FFO6JK{>fj 6?63.80~0!t<`oӧoL_Q1yٖ?x4::a~pqNHMjxdh'NP{F{x^޻#믿wpT!CCәD:X0PbOeeFXV~9cH:uԏRAg͚6 s/Ֆ8erűcW)CKiStii9 W><t>eeAAq{+Kރ~8; \p%^yɐ\l?7ׂy۽wd{YUTP]@8>?7ڱ(Ç .w`Y)AAFFmcc#NFFFzoݺF۶mHz[Z綻-**r?U VVVXD8:yz澮YbcP-cNٰa?7lݺ}v 8`[yJy۫w}VftԟzyE^yW[r]`bCg)ŤwDtt2fj 6P&,Ać@IIɐH!ćiiիWӱy߾}KK;&q.:v%wuuݳgҥGJII۷ޞO<ɤfKMͺp6e{EϤIC8 榥@ff~c) % BњիWKHHp?'MM*[t)gΜVj8::>IL|طooܸ144qXXMĩF/LJ.088TGpHVVnn.5•+W(-[p)IϞ=kQo龾RRRе?^t^-LHwPuy4^&C:hիRQVk& x\vFHxAA```PcdC)BGU\\zj%%% ?~#GjH %%%+Ww>rHA#))"PҥKTTTϯK:tM/_F/X:F/Ъ :Nرcnj#Uiii߾}gΜ)TBG#EK.뒖Սa{vڢSYYm7o!5\zu֬Y<_~qqq,\p{ٍ7f/tv'OQUU$ܮ+:B?󤰰…FF%*g֬_bw:@ucGѣVZZzѻwp6pow={^p`ǍV0ݻwcbb)ˋ d3$MMMKJJr-3p@##zۭބ:eлwoeddN| CaK}'8fCC÷ͪ[n)++/Z.' k%Fzzy;mڴ`׫W/B44487tk(ƺ4Ors rr:6qrr|jw|wmE- ]]]2QF~ üNj,ŅqsskR+k6咋sN dٓ>w1vXܜ^</""BtN؀%w(C__o5d26&놆6"u׮]h4@Jt{aÆ3I>3 ĉ']9CD E+"a\̛5l'ϟr|$99 wmE:} sᾮY~XB͛'Nm۶&:R SNb:֮]K_ KW-(t̝;z.],ZHtN؀ 0<<BgJ/]vc:U/^ߤBWJm䢥CEXK%%ӧsgwMg#""8CpABU hs/^4!H~@nnnSPX~F׮]{ｅ lݺΒö;#FL6M!nAJIIEEEqV(DP2eE666K >#*TtNՓjdɒA7jԨ@wذaTadTBB}tTg+++G)~"t=5sBGhh(:}C@?Ϋ=={433+,,x g)szJ)O>}ĉE Kt899Vٳg=߹sȨW^x0ҥKXR4Z]D \~]ʇ6}t&t|駔[QQ֭PH]BGU\kPqTQQǘ~,fkdI;um۶-Sa6ڟAc5<OVV6"":N8ѵk;88]֮]ˬo2pҥŋErBG;w&K2gBG]#;r:(gߟB9Lh@ɎKbA]&:!WO6iooOf6E;pj\?>z(KBq\\\GPJKE%믵#Бci<}-LYzjj1PUU[PPP RRRP#Sɓ']L2򱱱`䄎goݺEmKh`` [!QW)t#j=d 4hƌtQ=!ddffh%;;;z +++k4<$$?<(Bj(\ `3@藢W- FM2 +` t.7 ndq :#%ĉ~~~˗/g X&Æ #kND 't8;{lEEE&իW/1Jteݺud]N8[QSScr:؄~NSSS&%tPAChNҒZ%,,*CcSSSP$H"۶m󯆮d tNFPRfSV%tpO N0feeQ 斔\rZ{˖-.bPc&":jFKKb u"z +%%E{b53g?~ .蒩2t"Z~[=©[n)sz)qƂk(\ VkdIN:EB[FaFy t@:`ppBGttyBQWW:}F}Nm 5Ύ;l A5:,X XMM?:*E@DD]ŋ?Czń ZRcr<}_=`zj:K 5r^6y@(/Yh’s}J\ %%%+WdF)(tpK6>#Nm 5 "XQFqBG]+twЯ-߿Y#~+ڵ޻wFĉYe3: D \ E+:!PRR?9r Fm"eVh'Bt@2p;u d UD5Βӧ2t,''GV?W2WJNݐ ǎ#w\Ad!m"W:tH3RB`BdӅ FO?T^^aɞՋgÆ ,4BBDg&o((X7ڢKeee%%%;w2 "gC {gnnN&&&\e vZ :Ka1j\MMM\.ɓ9䄎| [*B[  ֠l@@@eeerr2E@klU-#ذB#<@: d$:888;;uFӧOwwwo_BBuԩ,s:K!Ad1ijjR=8 A~aBSAdr:(g: Ã9vuttk'o߾5!tԕ'*|...'N$[/44©'O&{Q*Nme.AFqϜ9; dz֧ Towѻ t+tHٳ'N4A&NC͛7"|Wtvǎ_/hԨQTϴ4qVVVd35~d=[9p@nLԔ]#D90g5IKK?N3fڵT着*Nx]=݂GOQW :Jȵ/788xܹRRR999BQU` @(tDEEtޝLPPPli ***z266;v,C52d3r( [AŅACKKk?ӳgO]]]WpS @nr(y>}6l`ACU@MMM:}Tyj?%Af1RRj3gY)+ۈ Ə_ԟ.]QTT4|nnn԰7on"""eee-,,¦mTUUQ?A}g7od LbmmMڵk=BJJJٳg5&&&N| @訋J@# \e/jCO鯘j@mZ4l-V{>>gr۰aN/8a >_qO?RJQ;#G@:BǥyyEaaǧN3rr|OB t:uRTT涳gO=#lΆQp.4B@Z'%%˗o~E" drs n tBBh nϛQ꺙XX8;=wvv^{uX @YHN~t&CII[I[ܹ7F^ti<_P>^^Q.>r?UB)ܹ' sPIW'޽ނ=t:uְlt{~{ )ʚʚ7oY}=='Чs^zV={5dJ~lBu!! vpv>MZY{B5&翂 t/^tm۶mMwQd-]z1޹sjTyGsjiicͅVŋy||<<AumuʶU44 踲4l4 :QV5M3&ڳ{~ybYׯՀw 7Ω=J<_M\WJ@=ٹ)..wD||z !Z !QjEEr!t@4qeo߾QF̬A;99Q;wK]]}֭UUU,uN_Ə?H###uttVZ'{۳cUU;} ~R}?q~~1lr3?h=*rKR(CYvժvӤ"4'XXL䡩 !J&C:hN,خ]O=4hЌ3HIIM6TrʇH ɓiiidDYLBa?N6-UUUWPP X8iiiCıc~cǎݽ{3]Փ3ӄցُd9::ԩSݻGBB.]DͅƯm? m:glbڵke:Z:Xp{B .^ 2y<&/}03MhM/: {f4:&O(t5(Ȅe[:t7|ӈB+:{wm--zl}>X? I?t Hv]}쥘E_**v&x. ɎK;~ϝ;ϻYZmS}gڵ+Ol iĎ{Q5 _Caa j[j"amgx꺺&&t\~G5˗Rq!g?ArJMMݻS~5kִijT@h"z*y5UVj̘1)Ν;s@ٳgY&~dVtLg}]E\hЦ#g̘R/vj~P}"#3v 7==w/EEk55:l۬Ys}>N a+ o̚K |;CiiO)%9ȑ˿)"}єUdfvv :8tO?ׯߺummmv[rE.":x s~^AC \T~vj}}}eeedKFܲe444G݋ӧf0U:mdĉ\WFfMhf? -]DͅƯm? m::޹s_.ЂLU[А盛X44 &x~[TTTp.Ճ͒%ة۷"Ǎ c_ڽqmʓNqUo߾?c͛l<6l0i!S䶩ֶp///ݻO2%558X%%%sss6776lx]NP]C ~;AS.n7vS'OKUUۛ׶ϟO=xNHH r̘1})G,Ul~$Cݽ{7e tRd '￣kCo+Wp=s3}t}}FZЁ=x11)n:jh ւۯkߥĽ{WPR_␐33?*KGp:QåѣG٩׏L\0)),}YY9s01bĈoFwB ~yJJʙ3g^+AgDWWuE\'tPBq1GhAz :VA/V^Tm/KnXqt<:r 7CNj\_ew)T?zef=4Ƀss qޥ+'N033crDEEEjj͛՜Z|N>:hGUT~7u^C:tMqqի9RAcǎ޽K!Lo|]W Bk(@qc >]bEڮAKж9sSI֓'yͬ&t(*Z;81WR(..k&%|\[IAKZrv4i$Ѻ-ne$$$p7L8{lN444Ǝ[VV]&tu΄,{iccPYY?R)))Jo|B ]+-4P7aFe9:@>ml9Ϛ $TVVMI,$${}gcM99Vd %%!Cǧ1%K۰aEt GFFFiiqk׮khhhkk+t077WNNFq\]]::~ss'O~tlccC1`ݺusΥ t8/'O:wL_gV\]~:ĉb ǘe>}ތhB .^TEEk]];CC"\flիRTNnj gfزĉ?]Zvﾀ]Z>??믿۷/sppR;ӧ˗/WSS֭e˲Y*BG fϞMY=Gmֹs+W:rqƁP/^]ZZJ0`nLWfqkollܥKvWZ͛7)t ><@-",TVRfcsHCc|A:@mW`Qkixũr0^(;WSsř37[wd{yE~Fr1$A UUUvv55Wxڎ t/}@>r}slkc<@o={.TOM^]~ɒ@ 'y@' LX{{+ /tG</}xKvsD;;j:3'UU,,x` 0$h<{򣏾ANh]}O63kχ.W|}*+&'?'fonk*$$a0 _`:Izxb5e[ZBgZX4GOk/}@{}'Msk颯ѣcML|h`0vOǯ_`:Iz`KE22sVfCN-1}6uuZ$%||5lnn!2cIi``w]v9::_MMN56bq'^ BEEVV54y<>7BG+|zoooeeeyyy=^j}::?w֪*_߳|;啭hm+BB Kp1NRK侦KJJY/^8wd 5())H=l+ݻҥKǎ$ΝkXx@j؟/V^Zia@UU Q cIoig=z4\|ƍUUU^^^***ݻw2eJjj*y%]]=zP.uNmv##^zoݺ*899~f-tp$@hm_ #44>}:2222 N[[ƦfCN!u+SWmxV~y۷fhY::Kĭ0dUϞ=F,MOmWW={hjjQ4Jknn@ƝLff&KBqoݺ5hР3fQZIIM6dz=zW;B::l}Z׻wiӦU㣪 D"JKUB54VܻvGx̏FD Lw><كdz9߅`:I&ϯai'!!ASRRΜ9CѬUTT*+߼Usssr Krԩo"23g?^p::⏟3RIII===:K"%IiiY|rr|[Yf>zmMK5rL'B5,9sX;P\\zj%%%Jۑ#GYMV#7R|/hi -XQC:t('t(/}hfRSTTl7m:݀Ǐɜ`~aaU)c t<ڵ+YSRR-[>}KBu%hi # -tܽlIIIϞ=9CDx@sFIƍG HKƎi„uiiO߻yӽx<+mm'[ÿϥ: tBӃ۷jժr{rF[.88xܹRRR999ޥKŋ--C:ƦF?'\:dNQRU-Ã<tL.\3v3JKK0`l ٳcƌ޽ѣX0 8ydUUUooowkk=z]::bƍY|ŋ)8%B''`H'aKKml)(XmMː lTTl ((.7>A[z 8B: :힘9mV?k;ýg^^Sff~;vOK{ :P t6@G#%%SM-Qr #ӆBC@m7<Əwwt<.^* t@mȡCrrF-)>X3vO׮=쀍{OIFAćbh@B:+ZZ6Jnϟv&}(,,*1@B &蘔xohUUUg_*m[^^dzX`YxBh@tXdq7nd8qϷneçC sajgjuӦ @ qaŵ*;Bzr@G\-dk7zΏ={3y7IO=44V̛}s+**>\p[AlFϹ+R^w{_ɓYIlyq |%S"~?|~[9t( x<+EEk#voRUUea0l?k33_̙fK@heI|| VxV#G1P8zFeM?[Ƣ`pᮧO HEEejjVPPcML|ãPHOZikۄQzzkn켰Dgㆆ|I<$dd}.7]%dxVJNVVɓלx*(X'O=L֭@bSʶ qu7njtj:b g%΅N={VsZA t@KQ\\'^,iBZI޺[aY=_S@ѣÇ;/Z97)Xp{x"@k{`"#{z1j*JApMBݻw).SN+oFI(!w@{?P$-D:e{ʶ6jBݳ碆 CCoLhĤnS 6L[|aa!O>yRhnLh눳t ݻw۷ovv6 lбtR.αcԹsGy8:5`k{XSsEL K6i$kFE:o޷o/rBGdd$`666tӂq(7)))UVUUU]|۷oԨQ={433+,,HܹcddԫW/uu[rɭ;um6W Zeesl7'O o#/fCW!K:BCCwM :MT*+((JII۷ޞO<ɔ ]]ݔخ] 4hЌ3(WWWIIM6?m)Sx6&,UUUW؆,ׯgvWn)S &tpH%%%_ s-))r劄Ė-[R]p@___))jfΜ9~x)@ÇOGp17Q^^"ꫝ֫Wh4:^W ֭۲e:*.NIIʕ+555w>rHA,G} ޝEYORSKKYA\R)Z>nӴ0KQ` z< eţQ%qCrrˍ$ 0yy`Fw~oq =<<ߚ5kl|K:ߗ[3o'؆;˟v#b5/S~СD666:BCCykZ9O?'OT6:J,\tiӦMIII%4M|֬Izm- wt8˗sVCպ%8}<0aB\\رcq%Kԭ[722rÆ #G'O51̔S=Z.J9`Vx6ĉ+Cn='8xV[ĸ "99Jz?CӦM XБ;qDVZ͝;700]v+V01kԨ4Ch[ZĿ򵰰8,,e΀c:bL :JFFơCLYX` ǎKO22<Ɯ={mĈ|yZt0~ܻS\[/u` GҥSC{mm+Ϟ}`RR.9;n1&8qeذeݿ=Y:YJбEEE^Xtу3g2@ǎo;yrBR1dqtPD3F@JI~&#/Ok$LA8s&sg7XulI _;p?<[H?/w3lA` 0F6k4nM1t ctY5Ġ{5z~'Y˒ U  u6dȐG=Գ>־}'8(?t,&@t];߱cγWuVk޽UU\*9s¸84BJ椤Y%֞9snݺSLT[abQY'|r]xQ "9>RH 1B:Jj:ulݺU9o۶mZZhKz-[l0vp- :<==ݻcyFںpϜ9S6Ps9xL{jj,ٸqCmQ&ru֭իlfa12u :._Z|w><&Lڲ۷+/㉏pQL322vtu+ge:8p"|K)5ױ_v-,,LʊcǎIirJ_Ax2ejQb{׾}{v.((hڴAGYg)3:B ^T=NNNJ2 JhRHO6lX~ܹSJ%UUCAϞ='MԱcGRLtxyy)il𰵵-zY.gjN)~F~~~JQVСyRW޾}[^#T [|C0gtH1;;bAG>?2A7YLZx޼^AAź'҆uE2Rʿ;w_ȨݻZ\%4hitmСjQYLWo 88Ѥؑ橫h4y(͚5{W$A1bĈ7|Syl[f/X޷o>}(舏NJ`@AB#5:Lyyy ,?J!eYka12AGVaÖm[~7De֬Ye:t0+U`pݜg1Aj#3"rs ,7 *iZV~Z-db56 :J>}Y &c&H%nkk+~\IئM%999cƌo/%OAAZW1K.mڴiQڝɓ'wI95tׯ__N1<#wMiѣԅqqqʇ$Aǽ{%+Ϟ=k$o#;ݕQ\\|)XJ ^c=?F7(w ԩSB'Leَގ% K:ŋԩ#H?P 666:*`pJliSrrK/ٯ޲Рcɒ%u֍ܰaȑ#e?66JOiӦ&M_y`ٲennn΋/tHA)sY%+ڳg,6mƍ>jذaZZ.]ԠAQFIS}}}eyLL~c233GWN!-?vl0qĨ(igt  yw}Z_qqqʇNT8!3%0YLZ+3Οұ㼃GvTUБ+·iժܹs۵kbŊ* :ABBBN6m:cƌA)/ېb\߽{Fh]J3er[*#* ^? URnݬv*vȑ^z;tvZP6NMMׯ9$$Dlmm.\oF.!++KmlAgrrrjܸ0<<\9~-JFZh<(kG d^xAJ=z_"SMa12Avp+F!CwH}?6QkZ6mUłJ>?2Ss gFj=tTCڄ>@}M_|QSS>C&wߝ_tmo]1+x~t ~ߏ>3>Ў9|}իw5ޞ`ݻ/|OrR*+P9hQ|n &N"PZVm꣈j|:A`rN|9"PV{ʔ5wV):StPD1uЅ^ONP.]9hR9[jLPޛ<==7Ta :St1CbɎʧ))Ur@`jy}e˖u<A` 0F@),,׌VCt cTC.t@~?[t c<99>>1yrM"X[okzΟ4?8x`Ѯ]}{_ z6},Zvvޗ_mik8wV\;p܌-[z,]o۶r>-7 *ȟbg٫ע[t h] `o5bw-=Uz^׼ y r5_yzzn.7l 7)HMjpA$`6 e^s_ )W@Aʼ@AP2Pk+D e^ R=sOQFO?$˿{Yr…B9u@@nݺ 2䑎ӪU KKK?~K&MչsaÆ)yu/9ԩS*pEeuϲm~~NkӦ,߽{w-4rު4 R32meݢ.#7@Y]?'Oa+vR?"CNNNU2Rqo^Aze_Yed-Z!11Q;%.cРA˚5k5kֺu ;YV޽(AUuqetiٱCf*BxnݺJPOa+vǭ[^{ZFJNN֠C=ZVo^y|}F3x༼9~/Ux s_۷o[Zf׮]]tiРc@@N;z]~͘1crrr,СCmmm]\\VZM=zxge}dQzKȒ-,wT;SN$%sϞ=lY]=Sb\ v] ߶paAlz&M;%βʕ+N:͞=۔ʟ %JNavzhvvvj-sMb.Eʜ9sda\\RH+xRRR,TkϜ9Sn)SDFF*?71(,O>zG0sLrOOO)Ӥ{n-^u79]z-[vEE.!""BʷFeffdQ9xLL,OMM%7n4t-4r^;\ݺuڶm۫W/5*62{F\ v]e Ҵw5G+tT듃;A^Ȩ&jgС~ğRJ5@׮] &??رcuYrR$&&*eʔ)FAG/JU^PPдiSR[W<<Uh]v) ܠK7wS0'CF :/U~ t3uJem۶T޽{jQbAfA~{܆eܠc͚5/RzۧO形7T!UUoh֬o1p@;xcWtGFFJ=(B``CmQ̼ h4T[lQEJ=?.70 q#;,,ז*qt:<|oY ::t`[W/U~ tkP)߯jyZFjaiӧK矟0aul, IQP ܠ܂N11?ղ7: :ŋԩ#3H?P 666:*`N(e%0A@QYdIݺu###7l0rHY8y* :f>}MƏ/L4I~uȃe˖I;/^hJ!5$m6κuh"䌲˸qD1xਨ()7o~kff4I-ay0mڴ73aÆiii#Q_n!m5(ev\<29::ZA7n0xbgFnќ1c4o`tn=6cmG :Z,QӧO++..nرAG% 4 :ҵLnnĉmllZj5wvڭXJyЩSMΘ1cРA6`w޽QF-ZpwwLٱ/~g*JRj~ɩq W_"P_ThDYYYARSSe_isHHr={HemmݵkWy\n`1AGtt< *ti񠣬,((_xᅆ CXbP ȍ 8ak9FؑZ~G :Drry<<> stream xڭ]sݿ}fp3Nč{g2x_: yd[}1^]ՏOb~ ry޾_Fũ[,WEQnVF:VJ/Z8z+n/iFێ%sٵo.$.~{LWk]4{ؒgQ?Mzo[lpNɡ/OPZ L Ѓ.&-p$[;WNQ[(@MoI&"r0w|rZqeE) qq7 megm]-wdŶ<9ن+Ǝᮣp|{|@GG^''-PgqԷPbB7OkQ Ҁ6лC=Ot23lcqi D3>A0G('FM d#rwv3r YfYԴ7e7qBuO8wE.胞@{r$ѫz K|HEձ nnqYShj,D^=rw/ߕtwuie]lbB1)d[0yl6 G[d5H?$^M-ZNTsĐ NyBzDR1,^|"&,`$h$D&K}jɬ*(Xί~ROH?k6n[?;cR<%VZE17ǦBZ6mC!@h K_e- T: { I{W.ї^LĊrSwٓUb hxʞޒdwM+DxO\Lhb1n~(q]@~vl*"M)q.a |Th {F= lhW/L%UceQ͛} L+Wd='0*WΦ,TTZ/pՓ>S!0E,YU'60l,Vrޭ<FB0R!*Qpw P8AQT2)Y.r\f` eE g0t Xٙ8PYb']u?-%ߴـBaN]*X.fQ7^N]FF~]́f9igWqdg' ^c 5?@aH;(=gtHėd Z"M\HRf|jHxq,QY}^L"7n?DH)Dq.`'5IUfoBg7rٝ-MZTűs;nXe C $1~:s,tQiIǨQ\gW<.;EBCZ1@|9m60*kQXRI&cS"iusK{rŜGZ0Wʾ=cixMxA5 %yH=3JC#r91Vrwq3bWe/XgYI`O=D:*+R by+qטUm:J] j? W(H;JfBI<6>CKg!_ _]dh[Bv? iDc9,H0sgZWъUER1i6FUJ&1xQ-3x+θu< )62]fc T LCy,M ׿ph?b?X=WFL ZRÙ<ؤs('<:$q2>(e:n!FS=Ok$0Wb?܏pCVp9C :.,X|-a,,&#~+r9b9Egf˕k׵O_7xd$wCNe?&b,?ꊄdIlEK:A$oM])+DCbU" C(^]PhꮮN&{}`<X:m=^.9j _AlVJ T-(pQ0vN%EַC&AMۢ J' RonB?|"k|cpÝ *"^j ~}7"a$y߈5d|ܸ>o8vMptjbb;r W, Sdp|T=^s3zZYQoy)⛺kB֓6u#aMoV ]-/-UJ,} ?䏜ʲq; ((DF8Ȅȏ9o`4"3V\ R2̈ᱢG9p4r} eRn%a.,鸞^IՎ~Zp6D4ٜ+ԛMM {K̈nזB!ƀM{CƗ8 Y}y`ϗ2^;1JLf)<`jj N&D*`9H֐]vmߧǞvDS!aF9-qVjlIGJl9rF'8x' D}~3C܏[,2he_' z9ȠI;Bƒs))a)댆yV7<>vIrEa+En3es7|GmǧET4}di:-M|6V1aRSe ]\ɕJZNDa^YXk\)a aEwK-%%Rnbȼ;:t`{0'AX_Ք9;&񜮣hO7M%t1d$ؽ"|S!}}x* fg Fl09^BK U_{1' '8T̞ƗL*|̵3RO̹x9 endstream endobj 677 0 obj << /Length 2581 /Filter /FlateDecode >> stream xڍYYܶ~_1oTx~(V*hS~\6!'ק/R[5h_wcSߨojBEK,U7 fݗNns{|k0_޼|2(("H4Ko8zq{?IR4\@9lH ?TWGLگ|}Tx'y'Qe8 B2 N"ώ릲{?,N}3E4{= I$3RO(H@9aiS@,Avq˞=.-7NtJ'mgc{@I{0_Ty C;21އvb-vMEysQNof8j-=!afYQBvSoxgb7ial3IX%™ا6MGV\W`Js2Db #^ Xălo:8<:x6ݏT0ifN<\!nֽц ܇}%t8tZuM;exЙ.t$9늨[A_yݝ Z3]r޴EV0CQ j:TN 4(ʘׅ*ZOϠ8"SW=JA \ L* &p{?{Yq]B,ݪK٢6UEV&pثoܹyxKvKkwfkLveL,J{+bvaC s^yR:{1NV@ܾ0\$q4x8C\qt}5嬇SGB,D;(nYaqmӜ/ *;X&A G\j*f$9C;eAr|&[XPUw#{p3W 8p D$ Ԇp(" v1{(~u%̃9؟PB\r-i wIHlLBb)1ǶK]+7}?O@NL8a3 lΟvso^tjȻk8޵n7cIB,I0OgC4%7\ WଭꭦcB742D@ìWVK]L?ewHK`vLh^)WHd+upPСcx=j׋p]zv lYqoDF_LۃESHϺ5f9[&,ʤ={9k$ȶ)bmli3`pq V䖟$+s _E+f%9EKR ;sv g7ɔY%޺ȡʴ_ehFO9`39n_廤vݔ2}طlKB8״]01ck;cPAK`?CUM&smKPk`.~h]rٰ(VAOٙiz dp'j1qa?q1 i-C"v`^fi؟0TWSUAOk^DmgO"}dNyUQ* "YF)t!ITnlM-͑d0:ET$sIGTrH$BZjJ(W.#;QbVVXh`Dh f3 bmLi+@dƙl0k?*\F,筀ִp[G+a7e]>swgn6_cKA,z]ɺ`e$c,OW-LW>8ŵ$䠬,dT?E+ظodIujˊNF+މcn>R=g ɠ ,Xɖpﻦau6|C>c0?J{Ş YUJ}CvAOG&h$sd@hdGEp-߅|rh$!kƞ{̷[XkAzQcnV e(:B0I)Uqy,]hYm~I{TrW;ƩnL3)#1THC % .?b!;Zp15†"Y/Aܹtݛ)EaY k/r;~=`p J偰f]T+oHڱ43D > G7q~OSՙRMÅ5[`W[=hz`xĜ_ 1'liAIf%tCO'͂E\m-J[fq(l^Uv (=SΕBBewL(*v]i3)lEۛ-i endstream endobj 663 0 obj << /Type /XObject /Subtype /Image /Width 848 /Height 379 /BitsPerComponent 8 /ColorSpace /DeviceRGB /Length 28822 /Filter /FlateDecode >> stream x \MEI$[4$KBJȘ"PF$cW4H&j2$"оW_vE[}ޯuzs>~<[)5V>erkgh{{=|{=ŋSfƨFFFyݻw?W O<7o^޽ \YY h(+--ҥ eVTThMSAAA͙3'ݻwӆf̘rjiiرcbbb+W4SN'''{F=r9]{{N:l:::#F(((III=YfihhIKKpу ܹnj3gJLNN4i sΪׯӆ>)OZZZ))͛BV{R[:uޞ)}ɒ%UUUoo𓓓# h߾=Xb5ÇgwyV Y6lн{'g[wر.]P311qʊqL¶|v|֭[,ȑ#{2O8A gZ{dbmڴRϟ/%%`>}{eeeݺu#۲e77&&n߾]w߻r ڵkMw=^\\PҥK"w=!)){YQ;@=}Oā{=EEE? l!I{-˗5k*yy;55/.) hTVVݼ400kIǎvv>QQQs99QQw"x?>% :p5$xʎ'_{@VV>ĉdwx}~t=O !!;;c-5D+hW7F @'Űa/%[mD **N^^QQw>tG[ncs 00ܯMмmhOGװ-@?B[:/A4;G[7ڂ=4#G[E4;G[3ͧeeh"慐Z j 0Qcj19"p{@mTԝ<4@Ő!mmx@-@i?F[|B:h}0@xW_rt jD⤠`7|{PSsf-^[&bcdϜWG[ =-Dׯ - !STG}.*G[Zi]ݫ#gz쥢hB3~lt99h7ٳVV]!{/ѣ7-Y[B-@3- ZEʼn^S|eeh.@Ԉ;@l4t}oح?{ )/  f̘jARw 8smK칼C [DO2C}@;!=|2669,,3jԦ޽]8٫0nuڄ '|{U0%%ڵmp |{n6 6h8/^LߴTvqk̟?իWB_|r>xa1k֬B~~yy9_~{onDJJٳ544dee=wѡC |ݣeddJJJĪ*:X(ŋ=;uĽ+--M͛=WZZڥKUTThf>QAAAп{]zu׮]>M6vyӦMNNNk֬iߣIAo߾E__ӧ-Z|"SNDheG>}D{FFFAP'!/,|Z YKHb ݔqq 6|KOOwͥ;::UUU}effy󦎛.((PVV0aBqq1־}h {u'kaaYk죕=+++.k r8-]{ĉ/O{"EEE666\zttA:w<}1c̙3'M$##CܹsR;ZZZoy Nǖs 8}JJJ#غ?!!!ˡӧOR -tݿVĮ/OOϾ}RkPu`9ڴik׮:nIkݺu)(35I YjUii)㣪Jo7.))FZ}^DVVV۶m7o,pGx?)^ݽqƨQttt8P][{{}2ߛ6m(,,|\Jj5|ԩS { }///ORRrݺuL1BVV޽K0o޼`v͑ٳɓ[֮]K?X100H#!!AO'--M`pCD`QZr%%9sf픍ڸq#SPP n_}UPPe.)ShYAA"i]V+>O`XN--GR[qE5> ˓Q6}}}SK#Tis五_β*}7d9 2|R~RS077I Ĩ?hՃ55|ʡaaaTxbb"9rDq3=ccjԨo yM{;v֭3ޞ)}ɒ% bE2՘>Eϳ)P~=m!L222ITJJJnܸAARN S>};f5̝;o߾l/ȲHHMteee9s&Cv|T:gϞM/_\FF%BTÇY"VΝmF[${5bp|J,j;IqG>q}*PMzF&8ZYωzj]]]f}w8$֭K |? oҹk)ܵkWAk#G}29#pqq!Y0`SZheѣG077':}4MIII$ZT;wؾp F'9{һ=)3fԨQTg})sffu딕ikbS6´{$s# k$k`ż<0};]ϭ;=h$hӦ }s)'_`A>}{u֍"Ȗ-[Q111ϟ1ơ.*!!nX&{+W+C#..7hhhJ ,ZGGe`'ITm> Uc_ oκo:++b̙3[3gΰ[\n YV="##8PYYI:JmH("x訮ή f'VdT-z9Z9ͥ®o"!{8@}Ϗ`gRÇ띂 őٳgSܹs˜t۶mAX1a„nerRJSND/^dggS:Eܸq|״i4fȐ!3nnn{455 :>}YMS'ORk 4|aDVű).]doo/..Ν&$&&D#GɭZ 2|m"G+|DM{n6| =A{p ||m&=AܦiMvu=޶mg|{b(+t鞣c%${=^s'/8,,:PM͹W/Z KOGáǀhܦ4"⯅ jiRT77+ϞvvvW#|? qn]Lku;i WZZ~%K55W))9̘9=Bxp͚ʎÇ{EFDOHaa)wі$-пEh(..95U++&PVVu<%>R8=uN|hIuٚ5'\+/ogdǏ,@=~_*(bhb23vLG7|ז-@,k@_~=1 41%!!qHJ CnnAQQw )z޽]W[QQ>}VkkпhddguЛ=㧟dfY$<|MӧJJ^y~ŋ\[C[bcA@P^^hi#u<]]ws 4%^^+\AӐcG^v~eh 4CSsU@@4OMݻNZZV }; m4`EE{gc9hШW%L+/o7n\ZZf K)NͧhШ~]snl,F|| h<󝝏)+;A=꤭GJiiy@@矯=$$'ƣ~MXZ`?z&o%hQoxxUT"rr02h,JcY[b= ff~lG2 ߺk, 'hy9ɖkA@#z+s|cF'/͟>7=%7a?4,ԝGu`|}zv ...CMldYAL7{oIIWhЀ# ٴw>o:|ʡO;wOr 4h(JK= c0^ޙ^R'|oŔꓒ2{l YYYccG |eσ>n[:u⦞?~͛7_l}wmZFF俳TUUijjRŋvqVQQ?W޻S=<գ#7cdЀWQy'O?m}{]t̊ 3dyy9%!E۷5k|}}ON.Z轾GZH NP322 6GDPbG>}K?Y"{&&&T{^k׮yyyw 5±9 KĠ 0U9r} ʎvvGRR2EVupDɈ 'LP\\eطoe{{K.=q/4}D8߳]]]kފ+wSRR7l |{ {72)_AA 4Tx99>f͚QTT$--mccåGGG4sӧO3f̜9s޾{&HIdddh;wVUU]~6tAܱcGKK|Ҥ[HH-ܺuw"' :'f۷o &>jt)Z… wܹo^IIã(VM|oڴi:t(,,|\JS =n{@ܸlߠA@’/j5IJJ[IKdeeKK=ݻm۶7o^pp0Jsɤpk׮cc``@J#!!O'--YJJ .zmW#05266_MM6D{EgffFrJJ^S=@%7͟l`u ʐ!C1=^}? ̸l&i!Ck׮y˵#G{{G1cF%p|F6yw铃+4EKKKJJjWcBk|/885//)ڮQVVݧjmmmЫgϚ{mڴ!RϟO `>}3Keeeݺu#iٲe77&&{YYYa3gΤDnCgΜaw \6߫M`}{$WW\]#8߫ tҦE䤤$!*!!Qx 8rF'_ɠxgzl>=2O_5(Orr2rYJ9|0y Khhٳ)qܹddnTw۶m}OLLΎ<O>eڴvg믧wG{lڵk/]doo/..h[ PSs9WXX6 Y[ |{DPPٳgCi4(O諨h|,## ϭ[,-$ӛ>}GB£S=2Ӧy)ԟL &\ڢy|LYqp/̟ l2=EE#7'?{4Dj8̟ ϋ烁'^K=@bUT=͛B4'99ܘ{SR2 箩;272|"˳g&&[]{? TVv\dVV~+qDb/uCoσ&uѣ7G߶{{)zhi .*ɠ=45SP9Ak|2|CtczGҿxA}{97yv@w/3nzWlJ=#-lcufC!!G|z7r^ވˠTVv:tC R#|ObbIH(HKw2G˫}-))y7;OM_Kbb||[Yv!:b\C: TUU%g'`dP^ʎ33&TVVݼ400kI;f4 &Oު`ok{(-5ԓO2şzԂAgAx-"##ZEFGRXx'O[`IPܽa>HJ Kpv>FG /%f}4yyżcdPO230q~0hk֐$9GCG: F200FGǭwoBu!MU :!++~:Ϩ}9ްaM2ZmhzIIɁҫWhP*+Hf֩9ݯ1BE -|B̝'9ԓ_}0q7dsr 5G[`<[C5U2}7읭JJ CD$F[JJ}|ihl7VB;h mmWZh "?YOoS+ 4oMU-+iia-HhƎF[TTƍI?7h^}^[ܠہ5>>Dlk@\SnOL|u=-Ug+._omѯ;mqS<0[O60𤈆u$##GWwJK˹ 6(cڴF[hUDZ[%00(@)1b#W/_o vv>FÇ{}Ymѿ@3#<u?=RQqܺ<{ʎ+O]gmrN̙.x%|UUU TRrdk"rr >?xIEIAnpm/_#Ьy"͟<~X̟ >ԅxeoHi&'A^.F[hhmQPPB"݀k*+v,_EedCu-ReB2y37Q[^^M[?WV<-O<w |c#5-tm[C]^n=C?h={>PPcGOvɵ1cƌ@LVִgϥrrdd tŻ}֔5ݣNz\!/oT밑4d) 5&za Od;x "C-~8...{ellrXXЙ3zϨQzv=ŋhXnN1#͟ﵶHJ*H=ڵ&-g^)(؛lMFI|b7J}ቘ?H {CEEeHHZZ02|K-_~;v1< H {Ľ{閖?YX`z1")")|ВgdCCWA/^L_T:ԘK[[[`˗/ӻ<2{l YYYccG;vn.{H*s:3geeѦ{NIɻ]s M{]t/mEEŊir*0((=## N}syɒ%=@ˠ*,,A_WDNONNNN|oҥuYWPPv߾}JdddC^ff7oD8z5|#^c B:sDDDCuZ o=25SP9qSެY444mllAuycƌ3g%&''O4IFFVٹs' cǎڵcmjsQɛ:::7b333ǔR -ܺuP(nzIII_^UVһ>>>ָq㒒Z푃LK۶m7o*?p+))yxxZ7{ݹ>hǷCo$kάgll\ Nݒmڴ7oM֮]{ɓl6)'))n:Z%++KBw%̮.ѻ999={wwwˉ'X߯EI9z7|CQb=e /_L!,Bʕ+)3gn hߣG[^>ܫjw{Mp֙-Zԭ[L~!ݒ3CFM{<P򊽼"Ԝ( +mGnz){{{Z%Khkk3 (155>|8 ϟgR4 (68@ӧw}G/_.##(}!Ktppܹmۨ__xwEpٳg߾0~gkHPRRr *vG5t P#97r&^N۩S'lkkK]H ܐnۙ佇G*N***cttzv ...C8feeҹ)Q`k׮,4pWF){=\N[䊓'O?(%66RKˏ=Q1cFEa>)3u)++2EǏP[ݼyO-I5DfO]\\ F٭_ 1|G[)(|Q} ֙SS{իWԑRx=WvK,&u9{:rc|ɹh񽌌6mxzzr)ϧ``0f/eeeݺupe999nbLLYh}3: U;v#..7hhh*Q4sLW3gIT7JGsΊ+(ý{G۷nڵr ՜4;Wc^ܐOTRQTy/|CBkŊbb:%[?v@!ݒwkR:Dvv{9?JN~)ߣ B\ٳg)É(Ξ=ΝީS',zn۶-w8#(Ӿ+Zi[ OD.GEY4DEʼn~C|1| Ǐ'jhC@>ŝ^'MZUMXXTUH JJ|.]n51j{$Gk=":fޭd߱&9@ =Z6{9ŝ~xMԬ} Аխ #GVZ ?D!455ˆ@{^ =@_cC~Sl'h{YD[_zh&=es=)*}=R@4uug45]^.@+")|Lyu~z96)D^kמBC51EE/bbBC}};93'=DRC/|yyņʎ§0%LMFs58eM Kغʕas12Ws4bF [CcZI|Pw*fY̞3{n=MжmQ>/rn|acsSEʼnkv}-wє9>>(\E$K={v 42SEGhhF6"CY;zv62Z7gfg瀭[9*o!Z &)(u:mmW:k@gc$uaa W'+..V{{)A"RB8칸kWNKH(iӮT^HIHxdeՋ9 'ssHꢢđO\)u=DR߃Sh=BVl<*+^SW_t~&+uZZO{>9oJEE%֘1Pbk+'?$))$Mij;֛I||QNOk~݇ﵘoZiy۶E=ѣ7YYF{{@yy%9zyy{ќԑ~X)jR' pi3" '1{Cuݺ};979-~@?=|yIIy``̠A%!4z&L;o^7;wr7nN:qHKK?ܻ͛)))gА566>z(Kw嗑)))2SNN/^|o lv~~]@qc?;㧬.))ٗW@(***lFz{G;|lܸiA<.<O׽4M6K.6m vrrXf SOǾ =RJz7((>*--Ӻ s\V^I wիWwU]]=//#|(___+3BLo߾]ӧS-Zqi?%r'B+dz2=@}onnz:ȝ;i[j\ML|«)dz66sg'ǎ& Kxϳ)QNN*66">>}7N_ڜ(^|Ա>Mn$E+VMII߰aGҥKO8A[_ 'LP\\̽o>z722=+++]WW'mW9d233߼yWǏ J Dyut3x٤y''Ne8pZkhB߿Oy(qpSSS#""ׯ[oh[SSG۷oWUUܹ3-*Ν ܓduttHy}2 8}JJJ$E1777nCƍFB8@9ٻ4hPǎ---ib֬YEEEƆ۩hL՛>}1c̙Cɓ&MUvY[ɼ_=z{~75AՐ"bԩzzzlLJ_ :t@.]$лN:EpBHH-ܺuwTU$޴iӨ·^̥|F kۮLcDJJjܸqIII,'>Uڴik.Ѱ}'%%soff~u\%?>>]4dቯ^UA=SLl ?4kǏW^MǏ-,2=3332+WR3giaڵiii܆H5%%%)S;q{$ &yyyyݺuLf"++[Znݻw۶m;o޼`vޥٳɓdڨy+~OWpO;{i7~)#9&̇*E|t]!.8;;JUVּl…F鉉r!Pvdv>nZZZ#FlBy=J6Vn;wVTT&%e;֛]f#>cn|ZYwg:4sLvOWv{QQQ_rxx8_삠p $+))qY܎;xRq&''cojjjhh=s_ 5TKt|iڍ_h[LIz m7AzCDPeddnQ:mĉGDDPNStuu{\ lW\O&E~N kOEV9{,% lކ@}m6tԻ>>(=7MZ>}ҒŸ۷SsN cez[} >}ԀܹsՍ⣲2{r7rH{&&&5f7kQWH4F] ,#|իUhjG?'4/E_~%))S׶uU{Ҋ=>f̘QF{{$Hyyy<==WC!"ד׭[G%%;~8+p*lmX{4ee7o>A_܈Tح lއUcǎ@!ʕ+eeeg}VYHS潻6mڰ O/X,m[n-[lƢĜ?^`u=fhNmdOI lFPz !$$_m &kR*!!5,sٲelT nͻ̜9w3gΰ 9ͥ跌\DFF8p~7QfJ* G2 +0|FB<4/#2dN77{ttt {7݋W_}E˼ݶmÇO:(r۷ooaaBڅ%&''s;rYJMP=Ii^ٳgSܹs)Pp{ W1!V^^m[T Sğ~ޛ&k7 &}yxxуD`T-|G!LII]'O j{}M6=z3Lۘ[afPWLjМ|^|9, d˖-{[-oݺG5TE4___H;zzz;!!CyC^\\܈#(O>'.y2q555HRV999O Ԩz:2{VG{߾䟵\mv㝔XYY2NJ_T7)))===Z~wCcƌl8Ċ=6' p߫mEeUiݻpÍFc lކ@SGCƍm{Mϯ]&$I- v۶m R?>>)T]ݙ'B=@+wćZZxF|86ťK322̯JJ "STn}kvE;CW戏$||7$AAAl/MgbEh P OĈN]×[z{F"?L|HF|dg磉盵f=P\\v/xFQa#>a{Q^̋q/|zgטY&D=|4@eeս{.]fL^**Nh1>!{=BBJH0k֏,|O^CG :`{ZYг:>fڴ4IAF| j"0켟Emۢ]{QfII9ٳc5њ#>9gcs#F|ة'M  |P qk{**Nց_~}0OeeG?lVyǎ٢v-)h=`#>||YZȍ07B;'=5 Ktu>zr r]z?,,! )ĉ.*Y <)BSpy'QoV۫/l2#/>A*Ȑ vc7~n]ʬM{~ n2G| n@{ ÅC}KqHM~~A{:tT4+I]or A֧Mg')LJ $9G*H7v*!*Hi8gxdg_p3|jjY }5zhbtW0ӶGݻϓ5DFf)~kJH֦TVV?l'{i Xɩ矯Jw)%pϺSʂAC=go?I^**NxϞ+g$~󪠗W!R>6R { 46μ^'Eyrs\u㬸Ǐ}EWց[ttxNcʔmH' 4IIj譵kOⲔL2? +W@Oh<<2d}mʧh+ĬŋSfƨIVV׀e^||7%%eGe;vС>kLG+++kYf?h(^;{X0~[D!fv҅2+**VTT4)QAAAM{/^۷5k|}}ONo-ZSﾓySDa7zjٳ`zw=H[djꧤTSƍffNO91+<}̘1s̡I&*;w~:mcǎڵcj7n56s*W4==K.Ν8p`핔<<<('{!!!p-ޒ)U$|OJJjլZQUUƍ֪mؾ`۶m[vnJ}tU>uEEellChޮ۷_\קOoCC`Ӻ:u:u=>oޚiOO۷So}e@8%%ցl6{%%qo IZZH -d1+//ORRrݺuLQIVV޽KJ3o޼`vٳɓɲ֮]+..N Iڽ{bbb$$$(.S"IKK{]sss*JLLĉ>`GCPzz:ŇBʕ+3gpL^TYY,\P^^|۷ݝBbuۿֈ#޾]ԵkOܽz9*)ѱ|oر!-[ԋ1+*2>|ǫWf9=zDrJJ | Q\UXXZʪW*(xDzUFkEmݺԩSNK,f(Q"ϡB&SSÇPryV t～K,)gh*А*7Zxƍ@2ӿ8[| '/ޱc۷S6HHSܶmB k/^d Wۮ={2PNZ>ZZZ҂;{W`W>kjwks5c-x ~2Ν۷o_V%:wY>|/**R/n 5km<|́~{vkԘE?kD+++nffelp933sݺu9Z{q懵͛73f̠R"0u{W`WÇ/`S񏋇5c^%U#kӦ͑#Gj~=zW%sss=}wܦe*?~ | PPPgdE}i M1+##bm9ϧؑ`>}0S*++֭Ŭ-[qcbbΟ?{Z}o͚5/Ж-[6JupB@@@v\BՠG{T83sL*Μ9nabsi[(Q􌌌^cGݛʩ>}7nP_M'{Oȋ9>>sgc:߯>y/輭HVVԔ###uttlllLLL) jjjxLС9ō1g߾}3*III2Rر'Ż͛7g̘FRXiLSLqrrٳ'UYYItݻOp߻kE،ƒ [BB%z?k1t\))9Ы|ۼW_QxY/ϕ>LvFISPPrƽ;~YBe XUuqu 킆ȸ6&D.*. f nFjf(GFSCLEqcYLg-2t~=<<=q߹ Fz,(e}ﮫ/NLtuWy;MNy"G߾I>y@SMdi`k;u>i%+78x𠯯ҥQQi/܉E{r֐8w(UXX\K##ܸ-\fXFܓw{ y@t[۹-\:C3U]ZEEeZZXs4W_4n,fq`I}ԗZ},~נ?{[^xaYdr55OB}nL8S y, Oh>|mnR'y9r3㭬CBvfSS߾}ȡ[υ 7"# TyߊU@TVVffn=_Lhʌ;ƌYWHh &*3&)Xqq=eJJ;fLJ% ~V\$Ν>=no+ܰq>03󵱙y-z@''gy{o-H˙3 )**7cF\$9;/H=y=e*+?bŧ|g/>UUJK}SS_fΛoFor:@HƓ'yORd?I'N$&ʇwѥ\~eN~:PСnҗ_f9ڤ<<>771""<<С36uTb^hg ~t9wZ||F~NNa Y%===~[l_o_`SS_ !C}-O?qR:=x4?Uiшv,[AKI夸?u?{=A?@Psxޣ8j.y{@5DZ K@%q{8j.{{rϲڙy988YΝ;~7|[|^z%e:''gĉxذa۶mS?SsфyAJ?z_;9ȏ?>ZߡUUUrJJvکk~z#˱~+++{'ϲYEEEl]✬066VqܸqKΟ?=eRz![puu-N6c޽{7yO;C8$w :49%ɶu%$uǎSռ,رMaaoncEKNN_|EҥK2GTUUG˻yf#ޭ[,,,^RR>#ݳgOSFRꫯ2228w;=SI]3gTݹs<7|yo„ ͫfϞ>x↷K$i4۷oxyyӧ'M$gϞ9r,n:5mڴIfСׯ^ 9sLHPsΥȏʲaaa=z+|駽{~.\nϯM6ׯTRRc:T^||,uĉWf](yO__w5gܹeee+_|1;;[Y'.kPW޸q⻿\̕o߾u=u=hyPOOoѢE2-eX2L>}ZBԩS Ch~~~ΝG%eU"$5%--MWWW[FF4<.\+ȏRw!Q,+[lP% H...R̙#|2ݶmdۍ_=66V˴@E5;ӥK{2[cbbBCCeσ.d6l 0@o+oJB/3GFF W\T5I˜1cd [n-Qgֹ{]s Jops['1Ot55%g{ Ϛ5kHM7|+yOv@6(YYYҲu򞏏N埩Kf$+W?쾾2,3f޽^ʖ)I2`e3z{N)R ZIiq|ʻڷo~z5o`[oFEEIX*--=z fʜ{UUݘ֯_?)RR;jܱcGHE*))IR5***%hIh9y򤲬:g''((H~^=e:wcРAJ!S3F^tt<ƳQ%\ϕzjϞ=7n8*OfZ٘'f666e:Hyo?%Jcܽu$u[$ǧUklp*5>ռWPP Ǥϫw9]]kUV_gϪ-{-[H!%j'Nɓ'_tIKM?˖-k۶Eu>>>Rh$<3RBBB}[[[fu=eqqqcǎ$%%%sֹGxx{2]oɒ%YȎM0Aꯒ+ j…Rݖ#K.ݶmD<+WH{Oi\pAu ?lH6'$3$&&ٱu^ÿ;S) d_6zզޣp*58ռj'ӽz˻Լ7|p9}$ Ը yi߿ˈwｿx2gIe&&&^^^J2duDDD{(EJy}Rzdڵkf͒!5Eo|ZS@m:t7o^XXXnݔکsލ544tqqԤtXf2])ܹʏu>Lg!==}nooS_ַ{Ys׮ݸbŧ{y)%2rcXo1~{C,rt W>dL{xj{{ctkdǎIwj̫k^weAj{o{^UUUvvA|.^I4GWΘ'Nz[gϐ ڿT xkW=C^xaY``Bbbfvv.=ܾ]bf+yŊԤc!!;GP0`ɬY[>}Ree\@ѭF|wRF*#>ΝFhG|ڣ{`~66qZ]M܈4H#^-"ϐ(/8vǨwاB~ff/~``S"&G|XZ"ϐsu%ϐyhyfZ{p3i$Fcllj``K/?~{'xB’YEEElΝ;XGmCCC#""\]]3fyO$%%;vLiT󞳳-:::88cǎ666j:th=r D{HNNd ߿&{nݲ>|xII:CLL̐ &Λ7Fޛ={hNNŋռ7sLѝ;wʂ9yF}~>}{POOoѢE2-ظLO>ݶm۩S)_Ν;5J"܂ tttVZ='''Iniiiaaa(\p!00P__ƦM֩S'ِ)[%&&J{VVlݺ#R$7߳fkk.]W{{M6IZrݻ}}}e:99Yg̘ѽ{w%PI411cI˺g=RSSJXzY$)H{)))6777ivttTR_}yOvzSkHh0`,T󞳳s_SG'...l'ɭ;vTz矯eܹsڮ_.QM빒$Lم5^}6m4뼗ۦM Wj~QQomooV^^ީS'{˗/711Q𦥥*yo/]zUbS ׿ j+((\7g1;;'QWW=@SZJ2ٳgՖ{J˖-[$nIԷ}'Jɓ/]$=!!aٲem۶U߿W;nG4ڵK2[.]vZYԴD{wj'ӽz˻Լ7|p 6mZpSO=U~,=@ޫ~Uo)++366=zLٳ_aC 100P{2׾}%K(NחD/W{۶myOlaa!qe ^]Ѭ^1 ^xÍsǎi4P:::MZh4zzz{3y ?g3 ?> stream xZKܶW̑@ț)dR\v 9&9տO?>fڵrR _?8n"vo_fU"M*7"V*ө|uY_$ydwEṬaky`.dT60,z%"joz}0&*qg͆YTvo/ְ:-r w~r8Yvcqveڍf[?R>bY r|VJEUCwj\+utu혮liagu7wϝa kfҿ7*WWFCű~ifgolu]َ',/P̤d"L+>rtky!W$vr.'-4ʥP*3~}`]h.יޕH vt u 5,H&0Gr܁/}Sε lN(t1Nv;ݥ5vWݱs1b|Gר*K2oZk'yke`i [<1)p.q⬆&=N{'ŝ]G# j{۠`?7C eNL^zKٰWq߱bb,,n4X(nú)+ })MEfǗ;sʶQqt;犘G\z24pxSwrpxB3vDƅ0")ΔW|;?.Df K#2MSlm]ֶ XU,Eñs-yٞxDDe72"1yk8e&'_k9؏\#Aq8!3ٶѢҶOHLƈOK+9pr7$[7n!pIx,妶Meн7D~[[45uGPO7(I~;gpxdÓP ^ң8̫{\3yZ7+#%w>#Z1&a ;Ts $\#giǴ.Pi%î}a6lRMϣi/"p$N7C`}OҧtkPbjHT+%R@A03*Pcaī^ z~f9pYJEp琱5@ QQu 26cZ" eKpaKz%G"3|$.:;xINʈo2 j>ǚ%CkɜeVLph~&Z @0-zG`&AL$v8'yOMH&~*tؓ|ûU{!oĭGDr~"TzǍ-T*cNN6%sx#Dl!1ك5t2(D`%h !VbHR"?uWuB]ҥAʸ \9]؞TZd2[N<nxŦ _ß-`$=vtkHE=(N XB8ٴnrr;53 IH,-EvߺH&^FspK%g)#9~XSnrjE!pݹY (O8g.kB-y&z@ ̻v\mi <5¡08My2 ӝkRUWF\8S(E̪M(|`@2H o6H0Ԃ1M]gH3WHhi-Ox@!]i ngﶈ{ң!N9pe,ه6ajN]eiwCL\*#ÙpWA佀{Ty~V\^XA'Hg=ϸg*iF|QN)G27-/T򦽊̜2Bm7dT/KLr jo0o s?ԕ+V䲩G,fsQ{0tSub ڼ@PƽΥdTL1 oYTlj 끉3@Fcbt,x9<7)#v/C`p8\Aae^,ar/јRtXHEB 23]sq[rfL.r${m8ۃ;WU^ߟ_k'rprqd5(<+Wg1mS/JivQ,]gdlV1"RЅvpB&?-~Zg-$M/7CRsu(0gjF9jDo[r9:Ec DSx=ߘASNjezsbOqO&gb씁~AEf}"/-ZjaaC_S1Z$@DX*&L`,aΒ5g7gSOգPeٳwC)_x<@,Is0} *S*؜+, I q@*`,TH_B?kPᏻ\dE0;C1D)8y\ 91l| Fxb.Xj 2 $gDaֳ3"o o̾G4bOl˾>Q6O@xbR(T!}wI%Dŏ?ǫ [WD_,sË_ 1pԌŘ :%aw1\m=b{Ϸȥb"Ș"lP!/v_V8 X%L )o+ 車*H~􅧈$S+0LZ, a=j:fJ7 vBGXb[@E_;@NU@bfbPm#;ŌEMjM\Gfך *_8)!fD8jRY+Z+6c29Ufe_ N6/4tq? tq'C@\M5~fH31[}xG̿⦓bT6c-)5 WLsoe+Gą\͐$ 2\/,;wRߗ>3 WaOI|qCX x! J%pAQm,nn+'Z>z\d/M{`{=b;H|s{vČ^,hsGog @':,\dߡDN endstream endobj 696 0 obj << /Length 2147 /Filter /FlateDecode >> stream xڝXYo~УئCW&;; Iyմ[jWR:HJj$0`(I%_I$".4KE>q'2]CLwdTDcStnoTK^4?ujjGftrĶ۩"LNƎ$M~`"vi/qƎbUN ۼw9|R)Pkc$O+[6$k1A00x2FD{ 2MJ `':`CM#oLȳܟe7t`?_vfQ ;Y;y=WR赛Ay`vV5[ Mw/<+۫o*'g;ztVBi .6N=VdU*]D\CBnMS~VTMb8owzqN6E\灞t?-+sM ǟ)۪NrC e|?@82[ 5Qh35lR-LG tlU*Llr2#}%dA5qʂ*t+]G ƄRc9 Nz8SW 6qΡQzJoT \ xS)֞ZN\+K54ɇ1&/1cEV[z& s`Qm|;pn58جz \Q깿;4A˿2K⟥(;<c#F}ߪ ղP“е;8^b=RЍv\=A g'BRuxĺv}U5[Dm_<'k +ig12[-È8gZ"},\T7+m?w  UTysm58RIqbI@z։R6u}^{5]!{Kpp-c~6Ƶίen !tLrAZ~{<7TsЃH̓Z1%% U8r;`^,Qiེ<7t}:sקQj⣿U O,z+.b;@;,/*S"dj;WG`@#t^SUC dPxgnr&pL\ e3\w\d\wdR")RPNEZhG "@R? d a4,3r".1K+p{_0!ϣDpg|Pmȷ:;Fk`7Fgg+zjR0P{WP"buێH endstream endobj 690 0 obj << /Type /XObject /Subtype /Form /FormType 1 /PTEX.FileName (./9_home_frans_git_MADP_CoreDev_doc_manually_maintained_v0_4_figs_Indices_for_ObservationHistory.pdf) /PTEX.PageNumber 1 /PTEX.InfoDict 700 0 R /BBox [0 0 666 299] /Resources << /ProcSet [ /PDF ] /ExtGState << /R7 701 0 R >>>> /Length 25916 /Filter /FlateDecode >> stream x;l,V}ll=5a ++C#u2j9'A׃ok|_k|Uk֯7WA*kxur^-9jy_]a^ϊϕcFw坽8^3?/_XΙw0kq0+ͷ*|t5b=2Fz(e[Yb 1ofʫ NXe^ ϮE2{vШ9 <]rȯ"Od_ Β^}E,͙̯/j~/W~"O)!W>b`C`! Z cߧ_+\IXJՃ}QVè}#׃źi7><yX*e7Jj ] AyuHD^U?_%JʽV/UYx=&MDƽW˞I}//ʞݕ> _]'1êw`ezjCz r=Oe/c# 92+e|FgH@zWjU{ 4b6b!ǘ#͎W/}rubu D,k|c=mrLƮz*Qb1 U]hBL-U`af1T#!8 W-H*c7̴g3:RG*+{oԮ5?Aywz8ث ݱjq#%.7Kk+%+âcrnXQ2Fo0;*,+p <\*;nGZ(kWǞ, -XdAb'NW !tAN덲K縊‰ڛJ,[Zf s?<+9Y0G^iZ&bS[91ܒ⠧c735MG.pj{C-1]N^䩻 SG 9j<-dx_,rVTkW*~8q.(˖ ~8r Fr(q!|׌$U ;>}^A3&o3YNؑ4SÄ9Zج?]D+b}lݝۋ+E=Z:kk;ǔ"ݩ)9M:7Ki1 7$zWž aw9d<%V:3X|q(=;8:Jc2vQ 1K{wzߘP3%fJQGo6_iu/*横DzWEL_[(cs𴽏Bʕ ʖq:**֤\H Gj܏^ =uFZϛ -5iY n'5@۰ZlÖ]09o>lȾgs *d:kP&-qұWB,瓄F!{#lsˎW1_뢉6щX}oŵl_`rJE|W~FUjmd GC`1(z}Eg̰Uk&"|{s'އl\h.8K{xɝa3-B!6% sR{8ɘιti(ӁV[sMej`7q 9}_jS*wN| :نֵ6eq ػo=kDߪ|F`HOn8;o=_-PJ|05rc6wV-1 \YpHE/=є>$F! nzRB -B>'8_-gKm/ >QeV>:)[pT櫅>zi85-a @E8cҩ&>}'S PޑTb٘.lx]5W &f8;:kD(rCkN /T荈q6}m@ul; /@ _jNnW`|A_2u&qJ"u̶}%fkztUK\:wz[e(G KjcNjtҮ; mFY qq۽pw |}W*s.FKԧfIzXXs:Rd@ 4Uޓfcici):#$ f UUl^K. ^4͆-.&g3QmOib6i@TE8ա%Zyozں/pA엞"Ssx)vX,JIspypK:XY+|0K6AVdCgE|fPpǍ,3>)V? ~-8x&Xe}rv&횮6GlOX>>8p(X/j!@tlW]65WVz2$C\6Zq΀8cb/4Wj_VGP^q[14CW's8lƕ7~{y7?훏_?UGH.Q]ܣ{#mtv8 bm\>Ҹhڌ vk9:%@xg> _ԛ/̵wZP/]1y`_@fX{PSKv@nUx̵VH)sK+zUVzdj&DQ p.v)f!@bk;aqN28}3O?_;W?ngs+SκE͂Ѽy4t{՛c<ڸ(Ee)jl3ڲd~t1uߡnɮ\mE7{OG+\Rp%T2/C')P[RŸ6pπ0 pt< F%ʽRJr(@@;vH}jDys<; e5TݸWm)y~t1ܝnUn$}P/8*hG8:ɛ"ǴbQ}JXtSAH|E]3uHmEnHUe1y |>?͓h&/E[9y GH_C\ou^ͮZOw+7-Xz,g\=q5(<$oo5ooE٬pxW`W㭊Նn `_Cd AwYyi޳=Z]j)zX k9{SlKxc 缍'gB 18 αVOcMVp !RMq~ V&/v9?)q6(\Pў[TE_FxQOJ+/]?)Q;D:y E!d\|=-&#(\3_~x^+F9u!a(m\ak͹W7_σ^_(}zK|9KfW+rM|IqiK:*g(;N\3ޞOɅRJ >)g6 ߷'l I9G{QE6B]N(0 Y~Fy ΣV'%XCNϣBL[+|N޴2[Nח;ҭi0֝^zV;=@W)UY}*('i>]LD֝4E./'閵C_+}S~NkmMfbIr~Rh֐U6ίiP}mTNwȯuW+Z;iiG['M8=Y.Ťtj̇r6N֓< Э5a=J7 GEGh]b7Vg-yy!5V,rl=[[n>kJYV\Rp!%ظpjv)ћbF5̃H]Gx( DJp#y;:ŽKGf̈́3`vyGGgrt"J=W$=.%IPIثϹ0R$5atyv]y}Y9E?#ProhJCq%!\JB鮇XKI l$dϞy) ;$id@LΛp/v+ .%IP$^JJB.%ar( BIH!RÕ\d$Ժ=JŽKIsvyl؇֪- \2H6TfHBӸ[yJ3gF f: 0i2<ܭts7lS@S ^'kA 50}*䜕s4 Nd#)C^v-=>.yҧ_FqOh/=Kpokoek[?D]I6v(ioQ)'%Dj (!{OB?ZS!{0$ڗ" F(kS 2a~቙BԍkAc|HR!EyuQl/rXӓ|nh.4AJk &pr,IRoUvu(=H4[10&|Y8D ;90`EGpw6 &`2i}?!&f$gy" TQcQ֤}X/$vDI9R6>3+N0J9^>pmr7JzmJϪnA4BvbXfwp4CQ:J".B 'P[;N,3΀hG9B/[x ~AAn=Ih Вn ;!rjGע/2B M Ⱦ?Wc#wQ Fw-Z7O32 N#M6 .f&R<`|V5(>jXI޶bj.|z+%N7*g*0BYĔ)K }3Ei`25_RC.5J;%d#BV@._d8H+<&3=Ki@El:>aܳrd{)F3P UYP}}:q޸gT\lYOٛbBymE|~o~#䛋$>::iJ/'eb,? mUh+%(`xՈ+p42ލXG:p7G%%rc^cma#>yK4-A\x"U2ƕ. Jn,ne֥o󡤸/PDa 6v;V@*ᑎAiTFF:(!_)st1Ö!+P,);ɗkΫQ-fC]lܫȍҺM4XEOe3CGZѤVFzi)Ic%,F6ZAǃ;X&JG6QUfG[>(dҕᕇ2R)W9R:6)dJ$AS+fU2GԥX_(WS֔Bt-I9C۞(S kK* 7is b&|mY|{|Q=} `O=m4\"Tw W C26Yt{FML ?}%N^"5(Utq~ Z?<No{lGPp{t{NgiV|x|( MnjffiunnB+ (RIŎ;Ƞn_N,`,Š*fxkD[#=}eeg4q4S/ ]&c۳V^ol4&S^Y|{|(NL .\c_'YM6nҢNJD(QE rאlքGhOG($ |84z (o c@/X !ȼۀVj(W3,cd#Q,}z1ԛbE@2/@T1Lm #]M4ÓOn/k 7@!Ч.mtҿA|N>ފxkDlv^bq Ee+|G,oC hI*UoJS4r~(ޠyNlx$m gal:.QAdvb&Ъ<6!~ݱ"Ӳņ7`WMq!u W~b/Wlx [cÛa)f $/tbÉ'&a wrbn: r~( g Ćqdž7`7<'6OlxJsl->L k5^^+k52}6ȶ0whCm%8GoK+\0K\Ӱjh:6ߚFݖf#  %$oMgR5Kg:ڕ[ӆoN/jIoENsioN25S_ȷJ2\kiᎃr'pi\á&KsMLF8Js|kvբ[J[fq:[f9,p/!b܋|kX[ij8yorɀkXyݵPZx R҆ǵ ykMVܳa9 J5 GrQ'旹4~hra4xcfM|q܅0ħ߱w4=/iNiu|65 e>K ?|T^[|3[ڂï`KOS%Xx <;C{s/VF/zONW?vSE o;åk!2i:CD|/*-he{+X輚J'oo%ܶ_?a3A J8!(~4@`-6<|^s5LIotq0 iWCK;0cE|!_`]om/7WXf@p )gAZpKӇj _My̭WɗShS3*4bg(﻾D4X?s14Xh?Rпiv.Xcnɼr̗#`zh?TߪtާG7{Z:KĠ38+!"zB0 e,xj|)5@3W%wSY{yI r$-m# c|of}"@ fjru fi00}VagSwSFƥ᷏=uQ;{Uܒ{ šOh!qQɒOG` I#x~qq4 /u}{pq8G(+ls. .p8l&< Ju=4.%=8V8Xq0cnlӇQG98|$Eg(jѓN/Y7x<#gn8{YO_d<_JWKDy8bx_?w}6iPb#?{ELUlw`g#]:5J1:.˶N)P0Gႀ SjwOnHÛJha AIu '8jsnN|Fy{ ދ?jeoVpl _L'j'vcNw{Q?XyMFt)A'N X{bC7,JzBnqS^.*C:o'B3'<w.U0 xWCHC=X k nwyI}yzg|AeQ\u_[/ x8M=Xxq}xvlQxlO^ېCM#Ry>)@#@JX:w"E὚@pDxe§/wkg7f3pZ Pq dd4e nߣLy A]{,/0ݾ3+h4M3t!a UຑN;d Q\hpDSeF@?27XBE QP+% 1^&2U3@_S%J(#g <!lģLPz?<)3 } T(hߑJEf)Z)M8 "Obi`ke`oލ!U'!bpZBrN끜wzD9Mϴ_FD`׍#.$ x+FsHߣ 9-=%e|rA-\H!%jGBNdN0)M]HS񗐦CFSJH`REShD*шF8 Zt%d(d"dhhicS/eÜ I= a:vheP%$N=vWzF^(n*:uֈ(h9q]}EPy(NAoC6X?koA٤† q:8F l3qA&5za0l&^|#1‘2'j cE׊|ve`AF9 [J@$!Bb_)9j9b{搜qŮ_wP THAbR@6۪Y39BdI _r;{' zɛys꣝+Ը^tjTgo6|ᨉW=>tUr QhE:w;B Ⱥ"J<1rB4ehK(;/EXtaloM($&Wzn2Q;p2 :]w=?@ғz.\\G)Z՗ecxH'Ds7Em<ǻL1U{|WuWzQEFgiwQ Gs լ==TeRaoUe0cqbZ[ ce|O1 @ kbCY$` ћ (ZI}KTnҽ%!opjA-U!9G@7hsS&Ƙ?4</x%B&4vf("/caco +ע)1ԇݬ.{"\JZ,V|_?uku̹4黢uaئi{nN}nYpo6 >-ֲzY^!Y;_ - 6%G1`l5C<)6mŠ^mS{p4:N\nûɲ3#_jd5Vc8ptI A]L-ڟn͗ؐ9/RLj'nL;mqG:mfxzJMӂӴ$:n["HQI6fmFmoM랮m%k6/uPbg|}XaRǥ]Qjs Mb0? OOz0(a;q$}UHОnn< 5#FFrsVeiK Z*lSg,.M]аB6 ]t]*y0F`t<>F\,'e %L=eKʈN;rr ܹrH^Q8% Бr٤FkqQ0nܶ iiQ9( ͰoJ TͰpNđx0pGϢGiaȈ N Q80px̾Mq9lnnHsVzi3̦_#tPZH_3Y,Da{Vu[:uDl(ǾO : 1 O_(nܾu"3hJˇ>A0ί>ӑԑa jb;@_m :vڀܯ#Z2W)ktuto~N9s}R↔aM:vR,UL_GzXi"28/[GErȐ)ȭ#:~ )g'l .ŒMt,lb}G֖0xbF|.ñZ`alw_-?VVKGȴ g\Cf>)w.D%auJrK&GVH)COOK?',Dž #ו!3r\*rMYmPvd01eʱ.S.' _%-,Lv !T$´ӂG Sc+,L-,L|5rDĘ\"[2؟faiX){X2+["HO vKЮy)Xä0<:KEB˟uK.'͸ٗv:,})H20%,LC'#_>C:/_56JOXt! $dnuKU9A,LA k,L-L')W7 E!0e>5LLG!&!y84)KV*̾La_0I)(fb0׏&(.S7ec>>@o'DSC%R Ȉ!᝱A - rnJbwLL㥙,o$ \9/M0f$k{" ,aXj\B_3pI||430Ҍt\r A~P!\Pcxpޮ°\ W~ZUxSzeW ?s#U8 ~aWa6!sfw0fOS8 F_8m~n+#'Nů^_s6U؛>lnnHv]Q鸮 ]*L;uS*%U8WakE\qY?c5_#~QB UG6ъ,k{%Hxgg43An!F q~;p<FM%Œ~AoB|Kv랂LJ1na.K;qi3E^ԭp,'\SRǦ2e 7/Ú6{ b%y_ -wAʹv17ʅ/ҴfȺ2{rin#`w'0ŧNHSN!ayS udDni}͎09ozt]aK黪F]"pٲ$skd#P`l+7X<ў@=)j\;Q K>7H7eH-SN+Z'Ni-j]K$kӒ/1_L`_R|.=d%GKR&vmP&Q8嚍>)XO?K&A[G:zSvIVѓ j]6|K!S@ș&Y݀BM*MMjKNW= ᬩ@"PF10MGθN7mͽ1u9hS k?vl|t7/򀋭ˏySQTb~Q9YG07moϬwLw|ˇo1v`c٨Gs| Y;>;m4!l9Ť)+ľFMq/8k։hcnbQB]&XtC4јRt"Vt3Ql:l 6LݱS^ 8<)מ\;Q쉒vJ4r= !G:2WaA 93]b [16=8. mxB|)ضSWB5"-*SO1BbYeN.#Nu]>j+8{{_Hd2>Vٞ2fO>c. mv2lŪaN$lUu~ Ϝ(_pz}K#4x n]JQz6񄁡zD0Ў59F`?\b&zSMhb3}4P8 ev//j7CPlw vtd0ػ.%;|uB+- ӗ{K<< $SS\<4A lb>,@k,=nT@kUus 0іLsf.=<_]<\#.A1l*R|K۸`Fr-we /Yg? vAS;|,ANΗp&Ek m}e\G!_ůw8:,BYEq3 O/l/ePG2O 0+ssfʗq2 .=+Jԯ/z6j[M:0:4IEZ8~jJר[v3݅*\1} rY8(= qDd+N2#dA/L"!n뫆"S\)Kfqw FAu}z qpw3ĕRS *01*qwQSēԏ{w+\35ߤ @TBsb,qRL!$3X}s0vMq3@jWr)2\&jkݏL˰cq[Y y}%.,q'햸%nJVX qMU~P4mbY6^y:P0gwTD KZGxk.:Ī@3q*vUGHȬTW(t>LKGQQl©CHǩfdS cԕQ(zJ8;ěSRt:,38u5pOGHn9Nh! SǗ8u 2::!>/>f㳺XsB@>/t:oAK+q:O::wMHS hԕ.R>l&ᣁMxxm|0Nsh`s!^R,o?ROlAk:pK#mx!-;J\3xp:l5@W9H.0|b<sh`msAi1ga WFWVp(VHRWk)W]@Ғ sh~@DS`9@߃YE6q7=L놧HSKpSCy+[̜b=l$3V Lodٸ0ks踳yr -#^ٻQQo/'FwJ|i8'XvS`@ $c%@֍sP| ,|G [gA ys:oy&@|KcLzit31Q'|Phh;Ù 0uXf9 OMi0ug9L]|a0uhS: e+zzX7L_©;w_(IwME pé}0ɆSW #`@Hz) tTBb! UW$.#r@<`#y}IypGy;q\s8H"wdCǙm8t.]F:Ϡ%u ph"H#U;K璺Qq\w: DQB%XdUq.$]X~9U7N)S粚Յ8u.j# &NiTrԹ8u.yp AĹ rGLs9ŴH_]0iQiQGi Ӽg1!q&Y8=e΅Gs%WnjbP`qD(o YH¼GLsN \P袕>pJJPX1jٸaSǵO5ո5Kmk;mF6 8[ xօ/wJ]`N+uZi3|NI2F `] VkeBǵO )F3Za|&F:QNW%V,b/36JQ[, {; B{$U-F!P57Hf(r1U+zȔ]δ/u(l96O/k5z O k-N9}R.r}R|z(ǺVjvF:Z] s3kZBhu(Ǹա4 |Xhd谇 R'!_g kWxah^î|Rpuyl\oWcHX)":q`CK$`]=-d!"u>euϪZw* g Nu, bZwvi|QhJ$BJSGH[~:OuIlf+'Hi.aZQM=`zdǰ1JkNuXT3:|GyC㚜CGK34K0m5 hÉ@$í ~ou׉`u ѬK­C:POhE]uQ,]H!vuZπ- } + BEguײ4barݵ]{àbRݹ w߁$} \gaבptJ0캋vBu8 (:taסlAӑqKc q_4:ɂsO DZbvݵ. |!:8 xhu`5ޗy#`Ídó|x^0vjt Cx].>;uCy#tf硋&xA׹TuՌQ]0身]wtNH]}_s:>'P9Wy8[q% p鍼OJk^bׅN͑ .pCku6ErJsW! o~սݣ!:;to^w^CyF^G!0:yLu $¦c@=Kt(%?|]Zq: {AXZ0\1 0:Z%:mY'5#;K_Wy> +]|.N܉_Nj_ǫDn6Sy$2p&jօ_S>~$ @^EKYQ+CT#!aess+`YD` ``kR}Q27EJ}G6a}mKaLT1 jv5 hv= ivq5ĺsIy.@C 9P.I`B4`kcw5/cfG;{';.ӖzEa. S30_(DŽ>)]X [ .,@IwIְk["$] 2] `.@>F \$_(g='嘂~L fw~0wO(8XOʝKd\!+,Q6^;ڱ8]m  bPua9m fFC;s38#ŝ/$VG;VǢs+cչ$ы$J0+HVkA>?#9qLo@sGPtw:7 DQ̼%8 o0~z7`860e1(0T]A<}2Kp#qAnF~~8lhߏٹsGdhvb24܄fgfw??b?"NzjuޢOJܘ??88]̦ٝt8E/;g1tsJ8}\f>)w.Q)~uř|PN xtq/s\-*8~En_@B["/5"V_0\: rwKEYE|3fEȍrP[/{vOYy#y7"e{*c#j5"NN{۲MR gRy-r_ , x N"栵_(0Z_(qw0@'܌nDʫ-rvUv 7)@ާ#qdE|cF&m>GS%*ԫE՛i&ܺwP]dsM>veɵKLgͱg6m?UdnθV,[C/AIZ^@m檢j oϬ8s$:[FŮC#uFP{ߧs8P:hIr:qkS{]|r>(o'N 5;(aޔ"Vbn΋c  ZTKO`o][R\ NS[bU K[;]9;D0qIxY^Ţ1j,,26-~@G\F ʎ[?풏3ۘ'YSlsBu,$n3Ԛenx_K.SFO$~cX VFwTXcE9y`k51FIdu40!6 fKlPolݜSSTq,$SvirJ(~nna/A #he̢;=efLKA̢nq_wڲ{ev( zE uE˛Es_vNʒ2p±2Kae2(an(R N?qƭe=n LJapߔ]to,E}F%)(.鰋,!Yt'<-.9]tO֛+Et{vѝ^]4Ӧ. ?!Sg[FI,;M$ 49"IGdۡ~t`^ Dv(W]0eۜ eg]S)ֺ_ )6cqCl vw5@OܢjxdQk䑵)\ih##+(E<#kUxdeV#kEY(CVAk82P!+ŕ9d!㐕a*92(!P䐵puoaH)C.1ۙ_Dydq2F<VxdpFd]>Y EuJ͂*0cK7焙 ͿE1rʰ|9eq)+cIwrydA&Y\ tM 1\w67,BuP."d푤.Y  %.Y1p:iK"gwv F V,ˀ;V94c;KppLAnk8ӱstD">ƾZ/M ;LC0jb/c2Vy!BɄ o /ZILI4W܆ Wۡ|_L^)m7%3~<gɔ29A'O ҅-($r^`'Л:K1YvN*.# < NY!]90dqU_''8@4rd!0mc'xΐD.*EL H%\LSvt3wb V : ;^Ihj='E˪B/Azm`ԡ BoD|oL+2$h5PZE]*1vIT+>- eYpR֢+o| 9N8S`ǵ*)xQ 3;b idJGBhڪDu@_Bom^}0E/-=uc56U7ZHEu3 (D 1LhϙLCPlY F&^R=a,_!Ƞ]  `e{DId9)aHԁv*_J%xz?,`~y]pMPrA@9;ĚU^^PSF"ꈱVhF+mo=F%ٓN&[MU(tP[_XqM/JGԉ| >7o}=M#@0U>j2$j7t֝Pn#E l >?7/w|="7j*(Er#sfdn<K<'%u w W0=)M{(){00^eŞ`bcNUT♐}@W a+7 4 `U4_ `nIc,Uu4`"d 8װ(??gVr¸*(ǒ:70jQ4#zG0=G RL9<?'VQՊz 8_Z51ڒGNR&<7bэl/ 3K0GO\*HǺI{P՜{%Ҏ^WB} ª\1X6ǏmFßE| ,=HZux=T(̗ ՜DUz~WsSU!crC[Iz|B;2`ǀp"5s8=~(s`0FT&?àSը".->}+QR. /r]_4a7jМLJTjtݫmQτXi1;,$nnw2#r7Dmeu+T|1uB8+/?`C0^IFY4^\oKMؓScmN@g#Q7$l6f'᷍}Q2q (lp# C,)"rIDxIBؕ)%_* Yf(* `O㾄A]j7w4*H>Zǯ L,i*n0rʽ )3s@s7U-62դ_Ð['(얱eTtta ^n+fc_NSQX]ŊnjHPbS$j7N 'G7DN/$*Mć♆? *xLo!K$}d:xtO9#@oS. R)zy #Y{wAL?ft?lwrHz(`v,냗wZߊ`,5C7W-mP4rk*?:bfg*;>q(T,t.mHزTƚX2F-UMG 4+Ҧt) ^2s[lxiQInzQ @գ/»B톻Ӕ%xS-y gS8EE7SnQGvۏV6 `Z ӷ)!)|+Z~>Z~z%Hxg>G;3"Z(h)e$Q6\~hrA@U:}ҧcNѕ+)ECy |icLÛ@5tѕ|? B`y@yhkk CtzS)Bz%I\-IgҍU)Pf#J]׶,Đ#Y^ǩW#BDR/%ZGU"'|p}kFS }B"<.SfC|%*Qk*6\طȇR_4{M2dD2)Ig9a'ڡQ԰#!tsI952s:a4C\|6LVx)`9XÔ`!8wr^QTI8҅@ގ7aWh"R 9=ۉ.Oͼ?`8.0q@b5ia`OָRUb>S4oCj endstream endobj 706 0 obj << /Length 4003 /Filter /FlateDecode >> stream x\[~PHI .Im+ٕ6֎{\r(iwI eE3sn߹p̈́LzB_/|%*&'FVۉM.?Ff?^~#ӡr2"/(2Q(QU1?Fk(!MX%HX16C&sQ)-U\H_!lN.e*C]b]"}V;?2*+hpʎ [1 BWBiL%W*?n9zbykfRMj߮vtl~}6j3cf~~g{^۫ڏYaW95n΋[UF18dw:^moOJ6' G?+YQ)ӊ1^bI2>BJl $@85p -0{2泡8`N栥+%=^B$J9lBAr]0e++Nuzb?tNybӃDDFmd( F!t>ؠJwg9l#G}SxbēVCx,%~t+zglzx,*|ܪHw.`%07}H@Y{F3ʘݾl:Q:u#j!GJDO}L/ pεjÕ~lW?!of!oծELOfea]3//qQF*eW7qܥӚH=c=mG밋, ?xxj+ps.\IВ{(bKY4Q!1Pbh)@STa3)v])Is1i0"ũӌ0ڴ Q fe$h-za.O~yB gGISi'H&Kx J qPw0 yjO56E_5-_0cCWKHZO06Eyx2i@ίL"/Ӏq,'';2I4`ۼl7QaKз(E9\a@3CHc)!fTa 5|a)LiJe*bmr9ZžIU 3 &X2Y\Bc/8ЃsVj*AaCyo0*Gr*ɠϼcCy8Q4%ށ(]*b$;|g!O HvV/+1pzJJ6~Hw cJPD 0sT+ChX`~f4vYJ+Ȋ sQldBFocpظ][co҉]E}Gt7vKU K'eX`;.r/n_eD[%68+1MG c;i-ӥ̆>_NL߬ ~׵P^ۥ\[ͽ2fqY4K@vdm=ۃڵ"4P;}\Z3b l,:B 0؂9 m)A V&7NYRC&@nf%(I`dF* tO@r&%1^gRMx[l֛}L/o6U3@ˋbTgEPf⬊ lq`@_0 a~N@ {4.P1F~ᮾW*ތIzwF4nD&`43m miYs.|ϕ͠Ejn {T Wa0&uÒ.;qlxW{S*tX>3J)v8| @m74}2n&IBPOղ"dXlRBuu(5HC !L!dilSCTTu<̒Szu:)f'Wƪ׌pBҝ܋0*!rR>tkE)XZW22l| D|PD8$V 4w8@~ëjX\5~Dt/:[$DDv}Yap G:8:߻@XloV Xݕ$ktfs!'ZwPz&;wӶLhow42ɇ^FeuuF%1+ A+p(KӊrZaq2~Du8VU2g'tܰp-qHCϊsE2`*{fdlLtd)T`gP:w~o`F׍#gdRYmOcP))QM61:pEt:]wE]X.-,O!;vM]8#L5\ [;WK2=Z-qppmQ >8P$G~dY1$?Mo b+oW(I0p-.\di^ P2z^~_?^:9:!K4I:€su:")< sD̃6809YW 5Auqbe@T˶AXEx ~◺d4T8U8}O@,d!ZgMf5x/4ݿwٶ8_wޗ+BgM5Dَ_&0KrYuD$oU (3%2ʤb= hCXMujcILJJ(FP(դ"!5i XZ-ŠpE 8Ŷ9)c ٸ*Xe"c|CIN\m  mCps]&^poGtR\td"1CKWdA,{JaN# iPs}1;nKbj?rLe 0TMI dvy0i,āJ)4- D Vbg0E4dsrj#7dJE6= `e@Ɉr H,aSO͘9g5iNfL+E,ddz羹"}]U"ƽ59x%r8y2pS8u`E52`ahG> stream xZmo_.A{ėm|16\آ!ч%1"I.̐>{eT0F|xRpT4'8J\PÈQ9|Q!&J+^Fhd'/&E9˭*Q̉GIca>dXő=NtNr+)K,[ecz딵XܲNxa4"uAlpSAv &aUJ`H'pVd.BTA9Fᖏ"D<)x {EbrNP\/'HD*g=6')<oݔ8NzT~WQ]wII Q񦼨;N[qH.8mY"'OTqJŤ.I*c#;nz6tOoo -BҪYuUoGu]Φ|_㺔-b`Tycs,[C?j0{m#rt!j 0kćsZUdqͪ|/7ٿ9(fmZ]։|q;+uZYIR}mCK!(lxi&hN-G% A6,*ٟ '7}GM~d94&O=.@=G6#G}ӠDk%[|ν%ݓVx:~_ۺTk9XNxɤ)jv='زHQ)^; /7"HU|@`]kEs;ut2 Is^U˒,".k*guyUFCU}PGPHhȾɤY*l=p?>hYV~`/N=ĠĻ5]8#vl^jbbmI;`/ۈqdc7 S)" ijn&hsYꏹ: ha(–~b/ZGm~0B;ܷU"^,/'pE *H>Mz>sn]Z]z];[04ۍ Ph2XрIF9TSMn@M(I"Ʉ" |l]\4SP31##kDd^ku2ti}l*6ZW8e[/t' 4 w2bw}3@v=ܐ^ZBy+4tqV%#q!+BMDA.-I@;#/aRG"ky҇GzZ'~X܋5G ./DNJ+Grl;vZ֓$o9eףOϏO=)J+X)yi4ؼM'MԋZϙS Xf~B v6pj4hrhl9@QZDN^5w٨SG@,6 aN/3n2mH ۇšN]/Znڻ!5 w;z( ;N(r9}w7rb*tt7se[s_N2lÒ3 rYq @n_]^3+S5Mlʱ EᏎΆP"f'c~iuA.f<7Mq= g/euqǯ,NCfy9ad^WoY2\aCǓh$mIF>ΨGSE(];Ŷow @t2AlMc6$,O\% Yx>dЙZq(q/ZrHwO;;1m5t'Y>苘h6b$cbՀF*dsq,ܾא(˜GHLW/i; :WzkPl/ZdaJ ? endstream endobj 719 0 obj << /Length 2330 /Filter /FlateDecode >> stream x[o)7}.iw-oA蘩-Kj%іEao;KCF? 3P^dRьgӇ?ψhG[c›__޼PLe׷PCev=~V֋r4fA\F~\-&[=B |L~(ST賓 It/Ot\,瑔y(wr4FbyU%gW~~H!0sL̞&˟o+zf9X.O1"L9^u}$w -Ohz` duMgaL4B&>Wnhb#hrq^ڋJ-5;=6,ה\ʦcPɍ)4'@Ubbs:R'ƫYX N͠^ wG?cjQWWY5/L')rv^n)@iQ;sOzEzsUpX;Gge)Hn WͽsiaB^䊔<06aA4NgK,S" O2ш)'FJaU?YnF'w'D&|M4P &Z5/UbƌnBFs "gm J%8#`iGJX;A4R^1AlAaS>Ƿ VF <J2]e~,eq]2ąp^\L[TPĈMQCCP"ʠ΢N-v0l`E?2lo-vZ]\\lADچ@SSNڕ Њ&0W{z?d0hDcÒ[m))iRJ_&s:YaD" 4$yІcQs o<ᤅ|a0ٳ TXb8Pfg\ٚܢK nn Gt7I!3D: ft- xvp|Xto5Soj@t]rT@BV,Z3ބ;ac<$e 說b?c.Ҿ1x~ʧRt~˴40%ǫr_w RrHĈLGQ|l. 11 `-h\70A YHێ3*/L>ݗK1/xe纜ODr=\Rh\η1R3|A'c@eQp&hkǻjjCn e耢v*~3[rk{| 'gX\aSq%tgG(&f%f lD$$kcCP67 c~Z|LH 1-lQwnդ+DF t:] -`Y"59=:a`z`l`p$v5S5uG MP.At&?i}xp7ܸ+.Wb.8.0LzYH6.!S+@C4@ (cV-k Z (K9:o^w' h1 ]c0 1?N5h}An J}LK秋^.W F~k{ȾPv߃09[*~ c|O^kJuiuD4AĀm *Q qAq *$qY\\Gs3=ҞkF_D Kx KLHX!ԒK|+,Zr lazYRv\Ak(vLzE̸plϋ'27 :gn"eӤpFvIwu5|>␯Fcnx:uqʋwfy}j{;v^dפ5 Xmڰtۮ2ʻ eܬ\֓04 q^mﵯyn]k;cch+[l?H\DER̼yO<$zV&?D7YALcN;D>͸6 endstream endobj 703 0 obj << /Type /XObject /Subtype /Form /FormType 1 /PTEX.FileName (./10_home_frans_git_MADP_CoreDev_doc_manually_mai___4_figs_Indices_for_ActionObservationHistory.pdf) /PTEX.PageNumber 1 /PTEX.InfoDict 722 0 R /BBox [0 0 674 341] /Resources << /ProcSet [ /PDF /Text ] /ExtGState << /R7 723 0 R >>/Font << /R8 724 0 R>> >> /Length 1360 /Filter /FlateDecode >> stream xXMo6Wue9( $ݛC|A#qТo]6@b+f yC~y>:~z;|hz>܏?G .'0E(.2~Y'vnsbGx/r٫y.c_k{9.^ƺJ5l2WA$y'jűCqCM.  0Iv%TNŒ5iDK‹˛;ݢ$U J]R@P\ZwّM* _<L 96, ި‚/Tx'S huT%N.P%Py' E4<9ô0\JU*v9IamX=I]zoGiZʊyI!HC(9Iụ2tdIǸHHHФ՚%&*ߝRF>RUuΪȶ}LoSD'Oͦ)îI+rҾ`$ =`l6G/V'$klK6 m(lݳab;s۰P&xLTgTҦO pR eJ T|Q0?ɫ.1]{ _$dqa|FJ2N,@C}rYFoFz+ż,ټq`I:!nK)ʁ%!2MkжqL /}_&N΅b`^ @}:81>,ˉx@(b8mx`{ IS)3)e P3z<%vbiₚ(6,W8imF5Zt[EұX`*$Hfl&э_'ϖ~if hƆ06^Rg245a[ ґ8)/)o# j7"b.*: @t۸RhR(2 p']k.#W.З6t8\n:T{#ޟt۬md%Ox9D\gs񠑼 ; v̍Lmxv`xlPӰ(;{)$/쒌5L%_:3}xuw6@RSaTFetqm1-p=ՠ-hgÿ ^ endstream endobj 726 0 obj << /Filter /FlateDecode /Subtype /Type1C /Length 2383 >> stream xUUkTSWͭI#*D*" b7H#C(<"PB hZK%:UUUA$-.qf_3sNg]瞳ߡ)iMӃN-#ћIr1u2;wOKǃi^dlaK.NR)z|3dÇ@5 %mc'hXc'R>W؎X (1# yx\0g!*x#[/uoMw2$WkbNl'>GK:ufc0X=rfS DZUQ mMN"+Д;-|;0 / c2Q3nT~ o[R )W5K"5_CC,Ԧ RNF 7Mtp+:8BRNuJ݈Um;Z/kN,Z#ߒ*<,aҨA`kfd ݁I/ Vơ@Vf?nvv_ E}YmUT}?Z,F>,jx*<n a3 %eM\ԉCm[ũhg`?ů.sD][xbD!Ɣy`٘aAxJ)^qb"-o^߫Ҿ'KjuUh3zKyo V - :7Gx܎Ae2LVZ0<{IaG~B#}rG2e·7k-c,~h1hATh- Um_k%w c!_Lx~o\Xɓv8/] 'ᰞJR?Wb:+dFB:ux>sʩfϺgCWs.%$DQPzrhb2_Veڶ;&Ⓩ)hdA;9Ue!' # Fti0Sd]܅$Dy«6WK 接v(>Y]睹`j[a52lWg*:^sb5b 2Ir>WYWξnɉ S=5q0M=f Ӏ<-Y. Ә(,_;\M2= ~o:;ϸ3yᰪLg7+ ngbJ2% k pqMUjF&-RۘB2Ho wAX߬i$BV@DZ?2+Z!˿>G?Y2O]BW}﹦#/IT\-8aGgd.1`  p7n{7SE:#pD$`F2zlӁW#Lu2gltk©S-nb|8ҿpc4Y@r9bQ@I~\ܨǢA/oⷖ$(짿R4 .Rcp4I&yAL2kok03{p̜ *]~ endstream endobj 734 0 obj << /Length 3858 /Filter /FlateDecode >> stream xYs#5=Nz(j-U[8=Α=z:&n`yBě{` RMSmT $%-L{JE2@efkATe io5AQOBO Z #TmV8skaփhb1I@K쇖- Z@ G1)%PQ#P ʴ#N؆J it8PD Qm>~-4*Ftt**O3%+^Rņ[ h"{ tj0^#qm4^F+TZ;\<,J0Hqx۹ }1*`EM[/QH f0f:{W&(`[@ޖR#֬Z&@4'f͢^>Iu/$'R+F80)OQ;:#4,pjN,gxF,(@wR]VK걤@(m`/S Ah'pf(\]}usgt@t1ytp/C蚾E#7 Z57+u=?IP@QgI $' 4x܂LCk]Z/"o:w\v-P侜'mȽuz2vrWsb9x{Q}r~7ηlz6p8Ь]_V/6D ǫ qzٻx8g) kR]t6.qK0wIr+lf_j9@ryAurÂ@<,{u6AܮBCu1!Xʢ?㩿x&I8-Ry^h';wu3[XzCjj1y}@ b7\H`xǷ0Sʑo9Ía4(u>*߸z~Ӏ^oǷմZUQ,)*1]ݿ_7H; ?VөZ9#⡚ѬD"u//Hќ;x&xF14O1Lpr=t"75b 3B4%pDm6aӻc`g䉍 q;e$j͢.i1@P4:@З~ ʉ&||[ ۶""`!M_q I l'"׋e48ܠJ)p F6% >K4QDszss&mDcg']$fedzq ]m;0sE5:n2^3mJDݰE5ˉ:ݼkX oL!EWNrlbع[:]`"9m\Pl'hՂy'wYVgw2N|cCr[f ؄i6#6 g[%8~ |,PI˲D!sS&T:ԇ%TKjrO0B(Ϥ2N6PgWgբ|X2f=LDƍjQݮCM M.sE VM,3 lJm/-uX/\~>&p^p\)чVx.tChHnMUjNBAbfܕo ?)[@(csL1R *T8zuVsw5V4fM/ۗgTT'X[DކZ|Qrq͈¯9]ry*b}YĊ8g:1J $,`aZǖ|9jHQ] ay`pl`I2st \dsS`v8=G|F;_#TLVF(ϔ>fc%b:h7eII˶o[M}!Q0/܅9Ynd, _:M먑燴[j\ 开u;/4p^޿SYrRiɨJGOG]JǨ§ r_$ۏ5tgfU}I1*?*6Q\ endstream endobj 747 0 obj << /Length 4080 /Filter /FlateDecode >> stream xr}o*&g[X*W[ DBl`лkW4]QGe_D`3(]ѷg ~Y҉T|4]d| N'u@%P+O7@1ܼ-u T~˺h")h܀Q2\n6.Q\wewjux<6-l5kY`YWP=ؚm Qm1?6']s_5'0gխ&YͲ&P'N^ Nߍcշ7$;=ϳ=F~;|^W~Y yҳF઻*Vq rFDWSW%x!;3awR5]q';كUlhGtau3*gwަ}GQa;]J[a[a ;9bA|,(qOӫM۝&D1mrz}CU}B?%ߒXGc: ÀD:5X"V{`Vr$OGuMo w uZn8؋>AY],:|?pw];ӬM490tDqF  @fb5Hq5x*)B*S,t<-ubǨN{UIIE4Z5uޜ"*j"{8hVi9<2&n :PwR* h:@Owwҁ:pP I]Che>h88sNj̻w4Z{e]`( 9.1]ҢgMp R9:0~J$O>EevMPw %dнK}u}|AϠJ%؆}  9]X o8d5~!D bNs. 莢4W!:PuqVuxVb.j'C'@6ˁ„ ` _"ZIxDK,$D6.n#%W`'?-$W$Oʽ׳ 6&*7a)CG.Ż.f|g7d3e1E/ B]rg,[e`%jtIƴdFOtaGfc2W&<|M[C,*u';e bF 8ka}xm@F~!9H$5;:RA^b1"oK_(~;%md.if\H-$ڧݸǿ{mus A C9dW^ XgOɑIV ;% eܳN: )YQOuM7u`)ϫW2pAV.ҏf!%', %~X8  K2Uxx2ֽAw (Ow8Ɨj{}_iC@MqKtI}9n^ؑc\OkMoxKcѝ ^E,Q:6忶Ò~3_4uf㵐}vNKiu^BW +;v(.V,ɑ{iH` efp3+  ۄ;ot |2æy#*_N3؆AjI( X,m Wh8K"-3Lm.uQ ~Cqu-퇧U8|Bߒ@*<%R}*μ nC2_uCyUpT‘~H&jhutV.bI=<2ަS?/Yi`3揄K:r8WTrSg '8iUە*Z+ZKضރ#r?̈"if99 m#0 ^yUSzdjұ py D*+@%#1L7XቨGwbD:~l5dpt)+̓_pCe/*rڋs"s}4ÓahL#SYdܤ> ' >/ @Hx"{EA):սآO^A=_am[z{#4N1ٯ\E"U V<#%dWXo1۬h&jx?0s4gӊP޴Ⳮp0I T1@T)x10 F0"oϿnGC$[7oor{iy!Q8#9F 43\MZ8@1x|Np qky:rQМ³S%3(zUı$Ǎ河(I>*h&V Ύ4=mKQcE!:!*|3AT9Kۧq)?y>VGcdvIf}ӃRz2_x\2"d[=n$'l^ݴj GMkMI  ilݦ4jWt†&tDeFYMPs-N!emx>1mAM`Xk 5~G0$֊mg|Su1eenxjҿ"SqJ endstream endobj 766 0 obj << /Length 2275 /Filter /FlateDecode >> stream xڽYYo8~ϯ`FD[fᅳ1&=,&Anܨ;~X-;/nX" ,_"I膋vE"*[ab[Ve|i{gttckرUҖ֞i#LqF Q~7eQ7UihOH"6\o}KQCjrN-?y&#-H4(UmӍretܯʫr)-<\כJ5ꪭx!e ?`G 0."=b=yu湱;VgsgԮdvmyV6<kX6E4٢"+ҤUCCͮ >8_lXuLQm],n'yHc{ ʻn) J@ZM=o /-Fe[%mR2&p}ĦTAL% tDNy_\`[>An0JYGL+ݨz#!Sױ-:FV+VY}RR}Dm,+g\pXھXI4P˜/M?hLHC6֌Vh~=+s B+-]e O=‘Qx7B'ტɶ. >0>Gہ0bjHMaMIX=+mR6͉=a3wbq@QՓp<6I|j~`XĶsr.9I йE^1A"Q@o;0>053^(y_ Gf.o3.Kzt9bpL5mϖHDx{vY׽~y wٳNȢF'bwzQ#QKSrV qVvC*#oڮrR5vx؍F7\B sg LA#}\eY]>iuFm]Mזx]~-l,~d9@XV((i~إ=aMCK7x/x60磸MƲ=eK{]!щYKN:qTQ>/κ$F0F #T4K 0:PrKM+N53={FpMVZb }u2ipp& ZZ kSVsEʸӇT8TABIsH]mN%|Q#ѭ`2E]krk|f)sj5Q  }E2[iuIV;tpH]Fv4;@> Xnd'pWkVl:@*^~=]z<hKB ]po>,u*ʽ 3h00;&3%B`ޓFYCY/!lxk|A.*u&!6ӦoipT߾"`1D!d?9s`3?}ۼξ "rіP} a&/ľkŤYJ#0 aDşTQ?Q<*r 7Ӌ^Wt%w4DW66%[HU*}<;@Qy1@Nz:&o3]>l: 2xMTEC/r$5/kLe%k͎@WMB)GPzK4ˎ6C ,:m̞/~=_:3&sB~ bsN^;Ӊ(zsi^b~w)JOyNE4X~`2Oz9- 68$"u(ܯw"?H#lCN_Mb6D>6r1*o}҄W@D^<zc/ʃ%G0256".!*z[)pI\J1"i=jinsHZ*k'RL 8AJ3C8J}šg`Cmu9HkbڍJIKe_&EXZ U Q2t*9dax͎s~45!u9W H9?gAyL4@Nأ1>i Dz/Mx^Ym endstream endobj 771 0 obj << /Length 2749 /Filter /FlateDecode >> stream xڭY[o~ϯyex 6IG$FZ-`s8999#w\yY5"m&VÓ&at%?|'.?089[zF\儉H,L|=|^́0w3 S #"J P唏31AzƗKɧt[{~yq1Nj~4es  ;⤟2WxmYTN7nO0VʉU_ڴ0L6hœ_$w>ސ-OSgY A˓>:9]DۋOQ3r7"a<鈰{:9r"RceCi8r CJki boLv*a/ZZj ?ZZ0 !47-\Y+gAz`ڄy`qYܒ_ ]],89<4cuܤO &|q0lJ%݇q4K|_`OZX%|c08ugrQ v]1u4dL %+7vWԸ#Nbu欝PF5|qJ$dZ,!0ɘ]AX'xTQRQ_kgvUvH>&wSl!`l>uuM;'`e~zߴ!a?nNhm@`U {;P³bF/F?us'jOb"K4܅Ƌ4L=8":+Ȍ_Fb m"H ~n;ok{`L ~dS+YAA. 2aW:Ӛm}!b>r4ߩ}>uCcZ(G)8?GKj@ȇf֚pA7B8n@sPPjD?L=C*]t`~I"|Qir @Euө%M I׺jB);P}$]5;Xk  F=!] kjaꬹOA/q66izQw%6,C%ȗwH* $ƻZkK<˿5Dg JmL;"bQn TSY'[^_76AbҖSf,Xz]oOt*+LVyYZE@fw*H_6Ђкeku 5@PƝDHN+(hbn+i\h:7x"~/7s`{wpY^![=Z#\тnG3wA]/[NiƟ~Gs~9*(.U&ŁtBbk,ߊUoprzБGP8I|/:[<LG endstream endobj 780 0 obj << /Length 3252 /Filter /FlateDecode >> stream xZYsF~ϯۂ fpMmDz)D9;#p$".f~1/0}>`4 F~? ӑP~"9%@Odt}죭mfuBR?d+&~"R^Ev`e㉌RM {d:jmt\[z;i/c&˫DazU[X+}= ܊|b1y7mᗌUG!Tkʧڬyf |wi {< ]vkUݲ ˛,`I _͛E/AyK7 8ѡ'YDҝԔ#ԛ|}mi-BJzZ:*Lx?uqnlxZYp7@֣E_ۏނw`k$1 tHH@OA?BU~@ SZ[Dg{^_DXCf|H"}&Wހ,`JMhҌpY ݚ w@ -5/{2#[;20=}NpޗiS j6'[IZEAMn>n|f,n9wv_lK~nsQ8n!DƹPl)ti&1Fݚ#ѶK ?u",MC`g) }sΘ!L (p8nx62Y=h¬8E6ȏl"f9WK?L1QnҸ0DY]h..ΚlzK+D?dU3Є059 RX%Ai}/r32#)6w2x(w) һGKAMH^/fM3NmT*ؖy!D.uhY۸}w=@[ CY}O`]~dW*sd DoN5 "E5EF/J*0 羣k]ަmHv[׬xs cOEJCb#4@Ŗ?=@:6HWS6 )'־&P ]kb܁Jr PrQrx:A 4p.A4pD55wH _Lw%n9Sp*| T'P*GIW=&(@1fYU?ܤܹl|(Pk`Ç> 2(]K^DY(nHJvCřW.̀{ip6"H=8TzіR~bݑۻ_4D^S=,zor4rz.LhWA΁D' qI-RZ-vIxD$E0lFwj vuQC|޻^T]I~mwsי .}0 Dmɏ%Ú{:9k####< .m04RGw~mUKW9c-~5HЀQW}J]cJ#Fc]ԳԲZUaki[W8D 9<2BiPÉ%FwCU'ER0#ۂW<6{O@f CȐE*RPgvllcn];Pizl0|:ccС,d&窡a/i(XsTf y <>wAyP5 FMyAaj6vSx9~MsXSWACT}>6uهMCٔ-sJ I)/F X_8Hd' ?NpW2ɿ|aRv.wsu6\ -eG!}ݾ܏ [ vmɱ[ڸwm)yy6D\dMS9Øf XgIQs2 st5s ѓo"4+fYshHü4L PvЧeߔ BR}W,whBf K!:*X4c -mXިSgf3+e —n,R5@A, Y@R/YljF-?S{GvJt?.0=Qwl4G "1̔ +.-kYޗ.L/qVI_;ɵ@pYK#9e"RWdslJcB;@/YE0E=_|y%Qſ{f(o3CW?7]M3 Edmd]'Uaj]o 5vl0ߕ 5uq!Er;jӦi;z(ckCLe$o+֊ endstream endobj 786 0 obj << /Length 3170 /Filter /FlateDecode >> stream xڕZ[w6~#uEw0oJƍVҳ'-ԒT H/ \<^$ 1uƩbpaUH[k/ˋ/f52UIf2~\u U&vŒ+l36L3oX6% KjћlMm"瘆>2kVaƬͻ&[4N3t$,yWILcEg,!K ,2=\T@H^#*HA7GGM2Y];n3~"{ 8lG) 66 ¤Ũ/HfvGcADY}WZ`nL&540 p$uڪ@OJUQL5# ܽAf݄33TSe9p N\*׻CG ŷ80H M!)tz0z̽ʠyQu=mI$-Ve@T04>D<>`\>H̋ݭ;B\`'.ט J9CWBz `wr{s'Y/Gjr,i'Pb$Cym͋ eC5h}fGWòYЉ.46{J='+TnGMAu 2 !T|$(wQAAnj4`1Odx-цƂG}QhYl5Od 1[wdklH%~uϛػ.[BHrXu h,+~;X4\6FֈdZ+TY`f@rI"7d-̮)rS궭Q!to2$rT>98MiF1Fz\ǦcNЗ0GȜ/:2-ۑD-hćy6]dj>=ab0AhĎmf#x-aZLlc_TErg"A !8MG$@A:A2e[-!ӡyMHηKt5OӾBABy?0ӺqW7˘K98J tv\ \&d$ǀ~Zdfeq:} 3M= z|p ?5ʤtJ4lTo.[<$%wbb31((LIJJ$=dGaCMKK~{bjtelסgcPhs#n]}t O%}b/b)?aA/wtx'!_Fd+Ï@6j`Q}"ؤf/1ljyƐ*-< >+Ir\ݪGkPYT TJg4Ȯg.~jzy55Eq_mEFyMk UIx%$H":'n5'GH`I۷oi PmF6lyXWwnnN=&OG hXNc ?6_K endstream endobj 714 0 obj << /Type /ObjStm /N 100 /First 893 /Length 2545 /Filter /FlateDecode >> stream xڽZko_ߚ辟Q@4A %b#.E9 )bM[%yvvvv -,Ȍ,hlHWǔ @ #dǀb*4 M Ă1x*=fyu;+0mYqL;b*БQ`0+4xhh3Ja+Vc 8,X]z` fZI&NʀlbVd'1ZF `v`ƪV֐g03 L$;ZCf>iOd !1$$FNOsNEqPS,%4<#tH\42a +Ux# `hef p J*$' x/c<-@>ҡA#IMZXe $eh 3P#(K`(`1K`j:ǂj:WF֑C' 9連=FvEŨ%\F+;Mgh^ LBa&1Z`t4L&L'Uٰ#&]Tceg܎ong i;@A;`)p$2Gw|^R1QډI;xf{Cov78-Of'yÆOxi؇ ^{O`fMND'M6,G{2٣ {O6rq D>`Ӳ }Kk5{ tQ.NgMQty锑N*㾗;)e5?y[4KĢZckq\6+ڭb*2vErzZ̫Xe&[.wxY\φqrpm^6P(o}optXQ(dor`keaW 9CXM8;a9lA*#4XcJYC48}< k"xGjTr}{wX{=H/hd5Y\]~>S kQB:4~:MbztԮ ʼns{h3_Ey|Vf-NHب;><JG)aEDpFK. U(}굇(w'׻PC:ϘCW4zڈ9qX@v? endstream endobj 792 0 obj << /Length 1263 /Filter /FlateDecode >> stream xڕVr6}WXM=Uvvh PSʋ[뻋%eI۞sv!F}z'ޟK;Jyh4% b$IFiee~6X!X%㉊ u~?+aۚhWU7|<&fİd9M [y,*ٲ䫲zScYQc;Ll,_r7k_xv47ٓ/VbN W5e0gHNJMd!BaXEm.I# cV+]1kOvf}%V(8JNߤL A^(ƒYٕ ?rH :.NAgYӬpx-#xR&4{g8QvS~˳5L0"ac"k05rC@C`dQyl# C79Xo~}5;@4),۪@Rj GxZV5^hdE8h7];e~!Pɍ{j2 X*я aTVr'' m$RTfUVt*nM"uOkNוoɚYD2CvKr {^f6~&p˪aH/>Fm8p /fSq{\e@lp;?7kG u 6QYx n'OхMi@tWH4G|Ll̵IXV.TܧI? G C( 08:t; a?^8o o?Tz\.g%}$21k[Sw'lHF+y!;&$+JWQ*q핂#(N_;jfj:1Hd8kx9̤"ed~_C;T=_yd5`/_m82@1$JhlA_vKAo <_xۊD62tmrt+ =?aW[9x (j| ^mJR}Yxe % i͔w endstream endobj 839 0 obj << /Length1 1383 /Length2 7168 /Length3 0 /Length 8114 /Filter /FlateDecode >> stream xڍtT6!% %twwt 13C(" ]"HIIwHw# ~{y}kz{_}훉^[SfVA\m.?S*Bmavv 8s;[I]G;o\Pm.q~MTHV- ܠ?zᷫ-k0l3= T\ڋs}Hri5+4fkYElRo;ܪ"ˉ ݵn}5fhCNUz#Η]yU48e6 :ף1e{h璜yu({Wu\(Rǽ*24Z)&c.ޡ7{Y?qL'|K)M)hO 2mR#+|(9)3#~Bݐ!PS2-HakmvX `~DWTl𞱷*5#^16ֽ}6 1ި!WSI@%Qe ${ru{Qy~f?stBw t5_!ѮJ8zkVSNzB?K %89ȺBa񆻲-ə^o|tk"2ܧP s;&$VE7dX$L,38jS€ݢ^#K~B/B %k>O>clQ8MJjzWH;p'Iu Uؚ[hfv$##85;'5lG=`iȈ^a&350kȆ8lXltzr!ȊL\r؅rqp7Oc0+R__-Se!5ƛS?cn t,hj#B!%.ܵh~b"H90Gd&]?iW풰u):ՓW`^U(t'mb83zGx ; G RK*Yٍ֨јMOuԲqVjǢ{'sM7q" +F7.gaL:: VIJϟ_y z˻30C!gFS l39D?ćZ* Kd>FJM^ͺBExS.8Cg_ţ~tԜY}|cYƅ.Dnެg҄su{%t;twRm R,@m.0)!aQY)q0h~|%1_rDuŬ ?*n 'a_SAleY3E{e?9J R[zv^JEU0™gtkEV48F-l~ry(~?*Q.P嗆;䅄fROUHg?y9w_u6y/{O8!><=@Lb>0 26BKpG0l>x:>+iib9Ljm|4?B:>*7мYfv䰚+>XDrroeT!JTo5u]oAڽSj+kNt A;4̵ _^ hȣ:Am԰.4:cNZUjdKGJr$Ww"V%r9gWo`VPSz0/2F9x1;UejrhBJi(#gNha 1Z !2L tƼX70hcq@zGP`] a a H Ė?̏\튷n⠾vbf)Uw$OS .vR|Fu0!ETeղCr.6q,,l ڦs%J [iTܓnZc{!ͬZ >\c]YZ Uשt}}jxb TE}@<&Kq׫=(c]P=Xiu7 =w5. ^cV|%Çk,в8Lҹh.PSP?7:5s07`+-!I,ynС|evGPRނj鸟9&sOwi;uu2VSUZt5y?`.%b[[H?빮ն5 ^|jv(GsgdNdJc 5 fo$ ,]2J^ 'S3%0/f tl2SWf<Չ·\GYf1,&`mv0HHxJ:K'8ɔj?p>D D/o RۺY< LhYm{_Ʃ~/#SCXhR4VEVQB@Sw X'Q&E2tOGi t}LsO#P[d@8ٸZ[jUtw>/ OW)S, R[Ø$L}Ê5 3Z9z̿L|_0 6%{'-lu}5z@sZѸB2>@DSg(5<^)>2mqG ۃ{{ޖcsZRK㜄0ULn3TfyY#7[S-0ZM,:.#v@!|ߧ\{/)BCdeh;NKhTI+ 4 XbY]Wn*k:=!pQ4t~9N>2*͒}_ruWv\ #Q}}xQ8#\I@H͜zm;<){fyw1B#p[O'q lWzh[; {= t_5|n_NJGXp%mims>4 o8baz*YfxSǶxٔGivtDw>U.tN?f "㣣G|8l{==uQzSWKwi N0|bd3?+F[5<˳;z7^ZGD4uQLTRg8.CSfn&>U澎{oP.%Zcd "Z͈'2ةw_$@!bEi7_ZW~XoPlYw9=Wfwj$v=K1QO{A܍o6;N& jCLr:XaYYd|égѰ)!~1er0N|V9MZPprko\R+M"G#0Fdlutܡv, >)GNa j1w澫掻i*L%Myw4D&h ID K^LwcCtr: ~'0BZ ,+l&˛{VPM/&C+Vq/A!HLACH25&}-U tz 1G;< x$,G հ>" XHM%kXX7{Zy=ȋ**d1[5]k6Q1BtLYQ[+OȿJX#lЌ_xq9M2\V'YK(/NhP3o"OL7/_;M]=9%1:?{x?#W3 ,.U֭ oB!M7hVG6-US֡z 57fA#䢒'F3%_*xُPOFpRZW _L&z3uf5nRϪ}}d֞ӻr,`nEuJqwbSvw|]3k:̝2d%?l+xc/ Rs6_ !2 b%ͶBM(F5G5Yf\(7A1;u4i1[} +Hfq ΋lnGptBQ4kqV]`B{3,3KUG.p{ u7+l.EQs_쫅3_;mxhؙv._Zv;}Tط޹-jj*n{P>@7Zq>yc~痟Mr)7k[dܙr->Y{`㢈m|E^0znKS`DҶuhIH ).-&~Wyd 2gV!F[!{Vº o/u&|P3"{EPfMฐe=u(љMʇ̯> P,澻 (Tov33 ]r_MpTǞuIXjB|`eS'^,$_s"6:-o(:fen'?xBPY*B̿~,,_N!#pe($ T&{_ Ѳڞ1Se1~GhV^3E4-ACu2LD.oXk={8WɴHْaS:1}lƮ}h JclS`lxKJn`:͊MU&<̺JX:Kv+D x*݃LUi%]Ъ[`-r"հ<;ݥv{^]HI'yBf Yq|g+VtF;>ne=kU38b]a]l ?ˬP+NeJ)<I }/#窇/FQXcfVY$a`9Q z0ugגԼw w<du}TIe=aq1o;MRDnwq*^@%=e6'j m!̱y9Y̋;d>=n|7u#BJTm'if7cAtV;T}'XbK/_ag=Iׁ23A*Rfd5SB3ϳ4vG{;+±o3EUBp,*M@ޙc 6i q]br,> ̝" 7l`4UAi=]rYpO*(}vXkԘF74ȹR:%ݙfYޚNHivsM=yr1`A!@ `~6uMg-R~Jl"G:j#3S5:e|0)8<oi󎄕ǏkUr>>AsA{.3`4ز.feo4{E̷I=fc+[h endstream endobj 841 0 obj << /Length1 1376 /Length2 6077 /Length3 0 /Length 7027 /Filter /FlateDecode >> stream xڍwPS. "HCt)J @@ 4w"MH MA@:X}o939{LؙuH 5=`a~0Xn8AF0D_E NܝAa@P쮠]0%DJ8ԐĮtB0m8mAIIq适  M #m0?JpJ;`0w<==!.h~$^c=A_Z؟A쀁ǯxBP0ph\; C}U @ /r#~'Clm.aa? / C< pg s @pmbh~2tq!0hЯ(-ؽܬkP_C@] p7w_D`s`X[_ \aܸ |\n{|A|wHPm1 : c.f`+ HWD@Iטݻ>|(q сO* HwL/8 g--$0?$7mq?Tc*/wC*οÜGw &'CaD{ *߇G0c+4 Gth 'W ',['܇# nEB LHT P/q(#S"Ma@Rp~u%#]lQ(~¿ߚ0[8V*ı:'Jc.>)T1)a*WeV<@!;%e}i3ׯuN|OV@;7j:ȯ:῾Ԧƞ.Awг>Soj:i0_ay`({1j>k߱7FF(.y@~_c |LƼg ohhL)z[KS).|;:Vkiywk H#KS@:J53|05:/"`b4ɰ z-Pg{Vw~7hf\YDTX74h; ,'ݗI޽7)3~#R S7+ME*F>]1!+ѥCzLA¹^8GZ^Gсw[!{,~r=B ЇIr'i2hyT#01bP_1-eξ-uؖ>lOWWz['jTy,YFISwDzc[FlMYeQJDΔSx>Ռ$ҿ.б)&BR;5n9Zd޹KUү>`K[H69` r+ "צsb]6rmdUРO*s O?9~u5u 4%Mńs&?ջu=PW*l{h%It|}5a]{Oz%s<'Jm ^*nkNŒKC[IfW"hҾ|} ΓJ5H+2qI\uy3ޡ)ixC tđT 7< Q=0BL#3- M,^5Ff^9qjO>` ֐CᶘwNX^LrPu.+./]18-{FATT9HhTpk'Kg*.,XmM{G?^[g)Lhw^r   \zr!?u틖s] 2$fe̻!֗'ުbeheFoӮ?!R־('CUxʹKGaWĻ]Y t+9nF{7j{Ocuq Dh쒙l<r_$wn@9!Uӛ(O`11 pNB5ۭdI=etVϙsv?>488P&WzfE42ٲ, ZsOXn{q|& c4$X÷eS[ߘX9МN?OwC\;T0ϥ#=\/:^Ђoܬs{fz$|Cp!SS9WQQZu $c6 lLtA/Lj vX8YkؔhǶr͟T|:)~6#mFh0= JZ(R\iɫer\<\lLc^"U7泠" f7ү\|z:0ua(Ug߼ʹ)EeBy% IΪLY)\X+>}K*pGUζ'Į֗W|>yx04aYju|Wúo]~l@V/=p,z;GJn|]?Q|f~4}%L{9//3|!ҬT_lxiwA>RJ}S-~S"GZ;Y  7P~齠 ?*B K(_DVeAiDA%دrGx%J< 0).j\H>HN s]~2 MΓ1Etn~I8&8i̳ԛAnf 9IF]:3mT%HWu@iI^*6OF=I+'~~j|=nRx/i s)EVî~șt`ڴt28[i DS } a!F4HmhcJTZJM29߿Cnſ]^N8NRկ[s#jb3-w{'Zқ#(P[&dLq(8mn?z1]˱N^ۖe5x}%`>fT#D HGaӣRdRPZϹoy ;z\Yڥ}_QJo4΅;? Z`[wkDfh-~j>FR!xAK--@LS7*lKi)e??f*/U0<Ư0MY[tP*ډc%qy6}~uwzgPOsg^[tqj)I2=8W:9#U"^vՠNNZ<{(MD<{,42cr{MO).^9@j˽U8#lX:lj7"T'B)} ѴH]Е~ds)eRVcy+J4 T F|iNmj[Ôxp !-ؙi3ȦG !*9Ytr;]o1Mtq>j7,bL 5~ACT^FsY'ĿFPX/j9>*v&Yc;i~|i'ͭ=m֓%em'b\]$:&pDA@'OsnNJt㫴>\Żn__xv~<@;*ӔR;< ̧72egF.e[$4v ]kbycdz71dǨDRWQL$@0k8\þ;Q9Yp8Zu IE;sq[V\%5 ʁ(m/"ٗ޾+lEfrUDUAv|i)֪WRGVuO oP˖"8{F&5hD<8'ɛ/+?U‘t"O⑶%SvY\ܝ^^%Mr>FMyO ozB>0<-6'N!̟Wl^4K8nIkǶii&eX:9@y^V&?1M@饆fG϶켍_P]ӽ_}m%{| )b^;{4O+:6:=e97#Ƅt&-a[d2"&'CiN$O!UtR׀H'A_ `)Y4fŴ)tgm]9 (?Œq qsW cJ+4Um Li^Jl9Y(pNM"ZZL'g rU׌8?6 i//fNM7͗'|xO.M~M1[dqW{WFx7\$Tbn(R'rG=*!PC9y] ]iaZx3T k>W{z6 _ y*YD)g[/Feb?UUm)ӴKR:M F߁o,_˭c>X9F2ӂCޟ˔j|̹`%|yt4b cЕW5ߓ?㲟ף1M|KkOi3 0) 4EAP[M%TzNJJrgk#oBT /`Ⴔ2&Li?kNfh .4+*z}y-4<2>is=,>)ObIĬM#Z/lZ#l hpIve#qm ZNØ Os11$EcAXae6L< ̷-J Ɗ*-)dzzxi6s{}mдi0r\xB{ETP6S~)v; 3g&?ѺwbMxW[[>|FxR{KqF\|J{[m;󔨫17CI׋?zJ5,>mt8=اf-dʊ#LDl}NuZ+~"[KSSL4Z]K]3?(W{o9H۬['A'-a|̓eKY׎<}%܏'^hXHeҜGn$VvGEUUhѺsT~|L 5V + a|d̻ qήSOUPմ(׻$gh}&̴A;,e`!]95:o&+Ru[8P~_5xFUDDrԐSEV }VWd{]kgO]~?-2߃+OpDySmBst~n9Y b#/xT˚6PWjU3TrȒ_S_4 W8y txF6jlÛNNºfյe92!9m!˟߈q`U<]&ݒw ZP^CHܯRq\?ݪWƃON!eYsͱd s:w%qF?WӰ"7)'D K5S HCfh1 ǫwm FtG>짐́ulVI:yš_)sQorj"73؊%'w!4zCUǟ}| }~͝Id`L`]Fw^^K<%IOTFx5P}*X-l8$y5 ҫSyuv"?)y endstream endobj 843 0 obj << /Length1 1855 /Length2 8177 /Length3 0 /Length 9275 /Filter /FlateDecode >> stream xڍT[)AK:;[a!f`ZS).iR AC5kDE@@[yT\@>PP($ȁܠVu. qa;y"6yy@!_iG  -vF0C!H?R"N\ G.81hC\ 7g #ҸpPB@(s qYA:jM'/g8oO&~` ~:\ 7dyk ¿s#NH.fy,C\'߇küYCaV?˰ruփA]!rܚpk <"B394wXߖZCnp]@n 9VP0` p k|{V~@nf9xsk] BB?i/`e5 zo75-ֿ; g. t!*ݔG|f*+RpupYrr:xq+]WmooW_:*#A qFB]+-(lb5( w]@ . 00g @oGomGZA<~ #oCg*( l, ="F@m~R NG{/ϿoYoOGNߪp;^ o߳nd""E·::z5YA]@Щ`ٍ+6^=+u~HmLE~B~[f3Ywq|}Ӎɩn5EBO 6lU)N&iWΓ8^~@Q, {rYu+U̦FތnmB- x|&}!B|}Y̮f2*b܂k7$hB*( wd^$x=*4tusOŏ. =a*׻'c0.[\ݣYg2CdK,b*b%U.ZP>vKTP?;;[nb-߸V<0vMlعQFAsT1mK6'$ˎ 72;9}#w\74%.p7Jc~p$N)aQ&KIP6o᪜O,4ee:%=gdbSӪmYt,1;郠v; rډ:x;KaMi_䉱Z:&t:-D [L)טE/uA:; SC^ߕBJ==D?]a7,̗Aueq{"528?s_d͗{DӪzǧOi\ |*DGv$&iwMMa Q/E{&ϥ͓?\pk=ފK$`d+S/)K?XƖcO[nKZCad%5VΎe͞5SgNM ^0lu3B0][ ?Oś370ù(c,".zB*ѝ]inVbiܡF.V-6DOG!/l}2yeVxux]bC^s[/gqDSFGeپ;}hkWnC }]s`Mr>9:ts搸OIg$;u؟_^d-r~wxUtF~_f6Yv44j[Ƽ/xDdlV5EeWɽ.pj`?_7\Ӌ39NitKabՂ\|vL^!w#FT˅0R?=;6M٭K$zs݄?NʃλbB/!h:[?%흗xG_j鿯͕^LA$> ~T <9'x#}) H+nE`Z'WsدY8Mx~="[VWfu٦۪>oئwX N#J~MLWBrmrA<.|Tx(=a&{񐎈nQk2Cb]@V"_$Gt1B bՍ!}~f%ƁJ~s10:m;57S~!oZb.j-+խ4g@7{R֣6Tp4zsyLA9w($,FXI-eM/G^_UjԚpy\` xG}ȀB*vѥYYKz(8Fɐ.Nb3˕PsL//#QP3":9g7|gʒc49*~XP$8l-֎KQ'37SH1`ObC}J̿"NR)F{q`o~Nr,g]݇7z$uF$r&oU]r7 uI W93wVK wǩW ߂ԝHC_B?~g7w26nkp;<;}z_5oI+%̌HeN!\ ~ Fڠ.Zv}{ԪU xi\%A!;jj9 rn=uXNEE?h 44|I2o;I//{ȹ*6S[_d[΍wL;diBl/ɭIKD@ybX'xT }8fOk(JTXZ[#lDD^SeXMPHFd3*V`)<$z޻R;q(p[DN0( ݓ|cx̋Y`ɪ`$AT-Jg؛橗扈-5 [40I"UlF174bͩ|<͵uxtxqNnrIVK9K=n@nD^͊=!5mIn5m(۶RJO^ A#ԭzIo(¡RI6ӟ<1ӲԘ-w0"ٯVX" 9~jnzdc" !ega9`PMkcxC2~iēgy> ycgŹ>b+ykj^OH&uy) @KDE>qO38GrX4WD ֨JLsy~%hII9רZgvٺv]4TE/YsW0}0+!QY݋w@پkL bYt2Elǩy97R/}~>[ͦxu,uax) I=ED aClaH[jwE |6ExDFInmgӁqȌ06C4ڿ8vII6m9IO:ZQ#.Po-6rVSbez})RYSLԵ:݋MWzd!}5Q xÄz^,0X[XSQ6y^; y0<6Cњvj@X~pM- kNVI_s/Qk;); rR8z d3rby"kD/!mU$egԳ45/vsz#f-լ,(DDz$ Gxɭz~case;gȬfRk}݌Fec? iB61mXb@0NoŽ E:f7#=\.| aEw8d)`ҨcNw. oӤ Ƣv+5TժbU3\v/M-vw|(a'G'T,d=zp _*/j=ޡ?^B<ś䧲t~C\[KҲ5c= YEqpw2D9ќWxeL1 ]),k5NqT[/1E*Z.aڟ\"g%w^60tzNPi]lUc4YڶfW+%l|10!+ۻo:''w3yGXG Lzɐ8D]9gUS1ĥ|Q4cՊ >*xWu4ՉójVyJ58bZ gv aQK*R`t=( 7o,[r D6o/4cz=W{eh3KH{muu‡ҕ7G~&t}l1dsI3[z˸tqmݙ7y㭔5K6_T{k)wBT^SNln|ۀHC?E~;}Slz!duQ3=WP_aيoÃVϸ6vdi H`˖}&2d&붡kѱ 7zHˑr|ƢƲł޾1 &Ξ'u %Uw<Ԙ\1$B "}9->*'0bܗSۓ,i [|2vqeq@"Ql1J5):gPqu8꣏Q"Abx4q _Y|7m̧Uk 0i7-}_{&%¯Q5fS&Th~Q]S]Uf@P2.\KZLj14؂QQGmd!vhU{F笿t_KvN9"^D)#U&rϏl㲳²y\/Bk>-}eB;*u֏^Q{KB.UGjz =wM_<.;eJL^"KM%/9b wЄYDuN~C9Wbh_:lLX te&՝T;:G*Pxn菒/O:2[zp{kg_1vxU4a>=݈]LF UJdVO_^HX]|`G-\%NIF+B؋Q>AEǍ-(乡gEywo҃ɋbRVLs媢uMrgUt Ɓ;+ǜXh, \A8Vlml1ohQ~$qa*˳)c=va 7& [ $l*qL9~ϱš{o CnoejxRߤWh ʵY;EbRiOXiPDpX#DESg6ָ& &qݯ3:/vb?77Ӗ6)6 NSBR&*G:s7!Km?9UǮ` W!Y"8%|]EAbB3ø4ؔԪBEfFeQMsIuJ>nڣ!njq' __diJFv"H?rξ6RxڿMT`E/m:ЛEX7ėeMGHX/lc@0G) 7tmg \rA)%̯kU?o$[Y.b0pf?v #y`SB&`{ZߛwsV2s(#4 YNQ=%ޘm$}y~q-Lj2!5l#8s= y%}9J9}Q"PB H++BV+#iWӬͲ*sf=ӺJݭG\0)>AH?<~vjhxJp1'5_RՈ0oni?Up`:` 4|Sšq+S%?!j~넇#ZZԃ:MbR  -wiaGbCg8)ZU8>jGHEitndTPW"py rEo nx@4ђPWP03xp$%OSU+y5T9"^u^Tn}h5BxD:^Vt 8={ |Aq&fDODGKwGs]r#r3X^Hd2b7?qQO>f^օutPQ猘n?' BUy>cyIi]"νYԫchZPـ_8I h\bL,f$Bj0ۏ_@3b(1n NɮEۺUxύ0;ڥ#(|yP|HV%oҧ|T' endstream endobj 845 0 obj << /Length1 1450 /Length2 6330 /Length3 0 /Length 7302 /Filter /FlateDecode >> stream xڍtTk6% CCww7H 3 300tKIHt !-) y9}Yy{_jh¯A:@Ց/~!4@EO$89Ma^p39 C"APAAA^6U5Oh!4""QU7 h#PO"N u_0/@HJJ;@ Av# 0߿B:{yK <('y^>` ς 780v\00yF@(-];s6!3 #A? C^^|{"A pM9d]k¢/b ,>1xȞ}y^gs2pU]Z8i٦.\GUIJ-O]gϭE'ڽ6!C׼t|korhr՞8sl `'KJ`Et+v*+yy8vKY+a/*0a+YL:/u'9?P#$ZҲGj.ɒ7i3F]<ʦXd).7f鲉 ;=s plGzy_+}D6))u//_fH('eGV<\`Lg *q\`K90_x2,:Ek(ÆRHM6 T5%\/.}12y ŚQj+Y 5>M=*c[)7]K7t7Xʲ.]{)CD=G X]|ڽi-q2f@u`Nd3qE9?oγoV!f`rڱx>K2ܣ6Ghc; #Cࣧ9!/;y?q4oX9aS6W8D WLz8iVQL/-zdoB(H>,1~5wDjvE,@bGjh$oD{HUƳdz"rsR֍mTl .*^Ct z4J?E+뷬LJ^?Q3DϡìJ)f'lATixھḥSԣύQ#SXj"3 aɱĻ ` 4J| ws*]Ocn?s:#v  O,|)CbE62󲀽sd#/G͝+#OIHtX cOħVi4T/ `C<D:>`ή);V"T`<d%֧wՌdR>yé&YXɜ`@7)Kl N!Ӳ%\.Jku5mˎ#d%zXY-Vs,r:X)ix׉Dfv;^ڜhʝ[L0~3J0.V1,1ʗTt {ֵ<9t`|){C+l+ccn;GxFf]RcFILh"k8;)-kQz5xI1 KǮ]ܷοk9ՖΌ' F=m[,8ɛ!ؤYw8c7ܬiR*쉍Xj;tp0;/٘Yv,W!ӅfSF)d쾅tI9 =(+"(C9Ы=V$hb[fYU>[ i-m ?W<)2.ֹ$q[mD]]Cػ9LuiNB3r&yc5dxwA,={g(wG$><;$eˑ7⿹i<63vw{CD!ks0cƪ T``BIՍ:cw JaqMT!u6妕~X-&"]N mzLY垍WfS ;z['.`\CƬm7s){cl>r<L\ .I H_I/rgaxO˘荵i'MF9rL{G rxObW%ĂBsAQi;* "f j~1NZf۾XvLb=7X&lD^xY{'\4"[$ 9zvo"#l l2ff UrpG"0?XcX"m7@b#Y05upj$eXy1ؒ۷c(EuCCg ݐ5}Zu+deOߛU#7:z !㻫R4TlV xNq Mqpģ]σy97Rnfg-Sރ,|h2hf9_lb.6Y=ʼ:ט;9\:~bD \.oa͸UJP\-mFfDH{R+3ѯ2)丝Ɗр2We_OSu"_'I n/em٭dľxڐRuvA3 h,uYvVRW=~FE.Rqy܀I#NBcYBz6+UX'Qk<¬i?*LTwAEAޯ<*7aX6+Ab3ϭYo~bbȾvHnғE4ZN@dB};&TK7]ҢKo^~uRy 3\R.f|tw+Dohջ|R7P堙ڍ݋k+F^s2`$(4?s l H uU&J<|,,3ne`&љJq/'J+"7Ip>T%2hq|Ozt:ugC)72>mߋ8(5S簿 6NsHMzQ]6\GϡhUb1۱"𙞷hۇD%lcߚXTе渔TfZU {(I䣿#X&\㋟t? *lX5\D)Y:_ڲ6%Ijp 9=|k"ьtO#d &P&βrn7e՜d/Dd*ˀrkh23בuy]bMܤaL׼Rܖ^(1ԑ hf)؇<)êz*ݿg`xd}ww?J=zmwЧ h!yrT.P[Tn͹$ϐ)yw#$W(1O~z-WF~C'=q1;U3h Sm?pPն9@5E9)` v~Ζ7jl+Ks݁{NIb8aqeH#1~9綺ڼcvҞ3;'ս&qߌ0v?DžMӾɨzJ1g=ZwwB؄Wu!2 5LJ;Q U[^_ TCGQW&k9EJtkXgFr 8EJXçz&3|M䙉}b]Ɂz& }- C"ygiɞH #|,{uƈ&gZ!Bdؔȕ}Sy^i؉2f̋CID\;W-[` gʯfO11A6%K[5v{3n(;Ud3,Ƭj>w*ٞslX]x AL-𜾇HlX3Rǧ{Sk+s(5}:rVԑ](u`e)e6V~KeK|Zr|^pE)7e7|s 7MNG{xG6kKOݨ{?^0c>nG砪k'^9O/"ۺ|5壳Ûy#eھ'|$cEK(T^Qet[sh_ԇ3]X!bOZb! >s*F*ރ./O8BUL(z_CK4Xn@I.0>*&ƺ6ZQxxiePsJсV novn(҅G|M v0+5W'B Ck$?aDuR%'CJ<>{T1 0%~a![6I'aq**,~+oNJý+IK|a|J>V}yG.[OKVn8`i޲(lw &)jˌaլecSdžɅxttaaS\W⍑dr,e]ՙG[G/F뵟!}~eB<TA[j0BU2W.ƠzDY֥Wg+Ew_MKa=!kAIx+M[Na;}+3[V > stream xڍT[k.{o ZCq h$ $mqE )..=|]Y+3g<&a)k 3+HN^.1 /Aڃcc;! 0ؿN`ަB5`P{/?WHWX#"I rX40(,9Am%Ղ +**G8@A  {.FW V $.r@p8. @;9-[hƅ @:taVHpoX7PK]u 'r߉ ?A08Z `:A-A}<(P;?Dp! {1+B-a`(>q5\;(dZZn [ q|VQsof FyDE`G† npN<08  |9H7`/;,!H9'l'`s/?^W A1b5T4^=忝rr0W'?O# )ED)):# kAs.uEKhk1?x$?n-MjTs,Ѝd;YG۳wk$A7# kZ26^ɴb"[dN#ƫh&Z%pDof[PgH>3l33>:_Į?2`ۣB[L:چVBhe Lg>;jrX6,uuz3UÖ*^yۚ2T? An̼| { \ M` FA"M2iYh&b lZ򐚈)x/[\f.ʅRXnzؐ Hc(ʀO,v FMdq~qj?&'}' ejxx'R>F%iI?^N3IRiAվ|(3h%^=ླྀWDb5u`CY 3$qJ6[acީ6]itU in?{]wׇBl!PK-C4Xt|^j<#g:xB{o\^H(pu&i%]SdJgH7'gsS1G=ܶoδ_Ӥ:(L=YeO7 PUZ)>W@.PnEFKE͢dWee0eJ^JKIy6W7_}WŹJ/ x ْK)NUVӿPm{\y *CnһzwAs ~aOc:@q{߼f9K"uoz2u\ܢh}*;#J Lmz߹\rUxU++sװ3_͚'WzUsZo[WۚnVnWzrcH>7dRKohE%AB?}9Qz-Vv#TOvUhbk )սH~PKjӺ&H#8Nϔ\ۺ M ]oofge4Tي`:<ʢoP _ oޞQ7NRUaoNzAqk%*`iɱ{Nқ[c1 wƘ >ૣqn5ʑ&X|d 1Fŝ$z5dzV d/nUp۵|lM+X>!b^f4_T&0Ä!zYTG{0 \썈fe8Z7%h\q|,Q#‡_+=jBD}ffkmbh(kb|n ٯhm,ϼYG-vB=/@U?Ld5 "^5gy3T>|ʍ8wJVдx~H e-"Iyvu- TDXˤ!NI9mb!IgavO4e>*Wsn;lvM\2 w\oqw)΃^GV*Z>`PV^!j9Zªm m,bv*Dpȗ;w߼$UKHpj5nZ 3s[nvK(Ȱ&?dV*oͼ87`NcYva0͊B4ʐ#ZђVB ?$G,=73G==Ok`b]87'pL8=X=d(snh<%FNɾ}<ް!Uk3W+jo #YEyQp~BɛDF{k.?wcwͽ=K! ҋ@93q|noO+'& ]]AqY<+32AIk ">Gw&;K_nNcGǷ8yoVF:/:)3ᥜ()Ͼ]JtW6NtRc=\ŖoySqQdx \! 5V$M75Q]܌'2|Y\ =NOMDٟb4L-a.u[.v(J;q^U`V&}xs֤g{n _{pg9= ;έ]H졟iD( UCqHEEJŗT{ԨZ٬VU̬saYe>Nx8ځwe ?cd] iK>wײh[Mjr" _&m"/UI&9;jtDaXg<ߞ TJyCh Λt$*!#b޺wtjwҊj4,5ώ򜌘p "]'m(+rK0reDzz`pł3{"s!qЬ0> z'ԶKD#bm.Y$]]*aE}f^,mǢw r34+(SdOYyw679b۸*K˻aw~SHWq mҗW{f_l~“Fl+P3?ڐVd;OdYc>͹Tg;Q6 "Hs֓V`L:0OOxWkqg<&JCiKEl-%M\[geC;cu/&[a'w[X旉MxٔϞK>Hx>.B$g f ;]"SW DA8P N91XyOTIiz¶uH)'Z]܃1{F]<ͳ1-`Y!\#e7BIW=̏1BZ8!r3"Aҁ PF)$Lc;2ƙG<]؈U̖˺ 'ɥ 3ʰlɴscau$bǧφمGL/%N(yZM@ԚYoɖ/WIUvpuG71'ˮ'ΡyUjwH8dtП\d-UOKZ5xz4,]E«R4ŸXLˢJ>?r0#PfO.7f/'~Of}./HXcROX }#LF.oC֫;E4(-J`//ei~=]CucaWp"-\΂5<j{Sd\31[TTIDFT:19w Rgqn.wr@x6)ޤ'M/=m#@2>= ^ok B}NqGWu`0qY+NA+a{?^(uq^`0z\ $ֲ"o簍'd-<9A1\D3+EhDLR8 C܂m=dwuh 3LuKsXV;D7Y鼸⧩m7,(켵³y>:RHqEP^ FğrX%s0#b` !a!n}g_Aз:-ʶ*Gn(Xs-WL;ګ`[Dhߝ'XZI LeNpk3pQPIu|UhV5KٙMH͵J _LN_ O,v8SKXMG"ܼr:s@EgqI"1 b!lE;j ok/҂K5 ~ R|9Ne"n=%<5[3ObLC6:mRY >̈dD2u>.Žś.NOxG介+'PiG%7Cwο~Uz!NHJ ?sOb`\0gդ Scp*\>֠ZVa]"o0[ن+,Ȥp)௪gx $K.^ϯM 6}룗ܱwUOxrLU,;LlKmU4fNck}3&ЧJU^fc* ,0G+^E{1BF.?zcXϥ zF0^ TM4ѣ)$dU:Vr .wtU]'Z@f 4jvZ Äf8|=skě I"x0B56,[b*DnxbBt$K)ƶx}[MLnrI#pInfdA|ZW NWU [~*U~E f028פgf:5=[]`j$lFΗj)$7]o.V u 8֟pBj∼k5̶ qKv/D ['_sSO018u;nN ,UXzRF/W ?˟8`ШȨfw\^ʔtUt']JhN Y.Щ{L?;k˭y_PY:NM b NU O:D1T )D6 >4!%gt9Ӊm`q?15gˍ}~ӕ9ٕ? Bg6es:n6;rhtԢ׻2UǶ:еm&U7ZG]hO#f[s n w/I6όo[V.wPzj7GΚHB*tREyIGJu`ͧt]WGl[>Ԑl2 ڔ磓Mד酱L^l]jĤ!q %] #Ӂ_]^V}Km9Pb _ ; n6ϑٷ'$ 6 K6r s|U9DzE))/vXE:7Hn`Ⱦ*!kFk<ǃR|'wȾa UGt훛$!Km`Ԫ >n-3)f`*K4F13PG3 71^YG g,WORhK̫MoY MiFP&??2 {Xs (AEXA?4z̈́sqVG񣂄*> #.!D)ŒP#ܡւO=-M*s_qnԼ_׍VRY^OwG5Q۬` ˷gr:{fl7Z'{eǀn |bqCby*?64ϓ$=|l@U3 ؋gDvx%j~DwIm>T 1ҹy8^ :ۨ+s,-4EzCi#b1Y,x&yN;e\Q]?}TKёwJ N۴d}؄ˇZBH@Y{T6öm?Rz=J2IYAKgK;%F+Bf.wRAӷƅO?.Τq{їEme"#Q~bX_]x>"r:0 EUC(%5{X'+]*Ÿ@ǕIoמeniqOr,<(ij5e9Y4z3rA5rY?X+2P8A]eFr]D C DfM1&#MDPcU$owS$`QXyD"ƱzPXr &a  ;pH]mbyB֊$#N'GkcO,"mF0[TӘ YǩtqY'y^4ltZ.Asa&WC:e=jF=:>{= Q$y5cm C&k7圽x]; ߋ]p*m")vr:iY yn?nc~F> {DԮ9UZa, 䎘5nWuCްr<==?[O^l <^$ζSExDN~W4FýN/y){ZǿvA3G.jOK"浇c)q`pYh}9mhRDeyIF풲y1e`N|eOm{BE9z2Rk{)K6FbN^E#Ԥ92鏨CĦ+t1qkl482T86@/di02!o~ڐV3%% Ĵa6=}r'1=tyT]oC}eOt& 'D7x/ڻͺj䱀2R#'\j?fbun_ѥVvY6`62w !ɢxH/ yܦsKYJTL8KMnpvQk ?z>yPUIK(5k/= iw(Fv.hن[ _ u'g", e^7sHqH'okfXI{ޛzw]% `,"]Rð༊-N@).?^{QHuC?!.ܥIڳ-n7ЪSu(Ǻ. .-NFGY~|N=2#C1דOu4/5{P0?ROpa7p͜q>5/S^紜8]!K@Hd|AvC[BSm 5&--~JfCx;wbAKDLQWF3QKJ*c-#MKn p_y-7 o^ȕriabXs5Ҕ:J( fVnB=YN-5] endstream endobj 849 0 obj << /Length1 1415 /Length2 6647 /Length3 0 /Length 7614 /Filter /FlateDecode >> stream xڍtT.)]*0tH 1C tw (" !%)1Ϲw{׬ͷ~~~|Zp3,`qp (x8q鵡;_7.. /s'IH Ttx ~a0K_@0P p03.s<_@&sf HHHw:P5À*`5y97BQIptss;sęـnP5P qrX TCLƁKԶ:k-n`'鰃C`  < Ts؀_`ssY-v2,~vpd> !;e%5`s6w: 9vFUy20p{{ ?iy6k P!,\8u`PG_҅ q r!@5A/7r/9j Az9]!@ Ps bSXw ~ff~9edYL#dBҕW(|*`.IUY ?"_%_q0*Zqq#oN1W!Y;a# y I@ @쿡z?UX@];# BuC,ԡs?%5;( w +ԗ-)65!H9g20s/qNN`\ 708D;Z3 k 9m1A@No?N5wqrB,Ȗe>1ǝT6^IRb^f`}6cVLH拪廅^k4U4[V4fw ^TO&jQN(-8,:艼+ڧ~P jTmn)LF%3^;%g\ X4 KQM{$|VJ3GAZi0DFJTw.&3u7]E 뵓]cZǎw5{rҲ%ʾM< `Ў^lk6{x:u^8ur Iw~|^X``t-}?I ֛ʏ<Js^8c@7f WVl:sx w|s.Lrd]u0yT8VU3?w\jDh(D8/|`Cﭾ'!t/1·^]Dq0AS;>9s+ +qGG[, i?qb-oWB-ԉg Ð`ȑkWETfL[.Bm8sOЪݐXv#7;o_L{'?Dbwm2 !̨h>@($k`O4l5 "?)>lv3gȡjGkBKSNLز˜Oz;a7N~K>lDc9*TrJy<pkTCΧǾ0eBޟO/F7!CiŚ^˩sNzZ-~pO]G^N'Yas7{AlE1]< PS0헼Q+:0͌_fYf⫉|y_w@4*QnRǑwK>Ytz.o7*]o'?;4Lݱ_5Rzї{Sl"@5 dLi(*y6NWjI]n~Jl& ^bDft%n<&V"7P.8[lK . \1ܷ"4k"_-q̽ӻP``9`x %j[}XeA__L|eCeQߤ s+.gi?VӲ`⬨"R(p1ٜ["9Q g܁LPavKAPZ@^~}gf2>w*F7?Rlx)Unv\XjI()q3Tjn{}q ikz] t{vxfg~3xC]ՍGњ=~oE#̘f3;VUJ)x8{di@|JeH?釢S%y}y| $Eֵ 'M6űȽɞ)ָ<c%9 a3d()?TToWS]ƦGXȨ3/pDq&p .yɝc'YtFY|[ 8Rp}rX8>3~`"rO%ej0BKPHC &/ 4㯝R wX oC=2?B:REm3/K5ה4+Ճu>|Zg\-[U^D-u$S*`- .E%X)z <\^ 浊KZ&x$Th,?[ٷWO[II6J p?}]bj'rg||$j1Q %KV(՛$< |*N#lUTè~XY?5285D2q*F=-NZ&ZCde"Up Dhqiŷ`ȉ71] bO%ݎ"\ߗ ?%aD ?\x+ɋTkkN?U?ۦf1ل":qr3'-.银kR/237-$kз+PG=Uח PH`dJ?+^-M?rk:#4(u}RCjò3U/ӘAELӹm9cϠ8oZ'x,;װcY|S0Yb#g+]=Zb!%^X]tR" }1TհRMryq&pF$SaxNl` QȰ 9avdv^t ~f㳲KgĮ(vٺH4\owڤqψ.4?|sJȳv81'#bR~6C1鐃J}MI]xG262Lewп*ۃ^( ҠefWİtrE? {IHl"p]2pYSpѠò0kRp]![_ᨲmh#/=4u+U}{5hӆ83{kJ}چV|HgiՐk[NnKt6K3۱ A.]DraikH8YK;{m~TjDM ĢiӼPYoJ ~HH4H}`Q(+jl/>۾9_IS4mD;i6Ѣc e;:=9͋3>H t'f&nx'&=i4Z㳎>.xIyaab$ҟQ~~\#eu 'GІ.'Ws :G{)n sЯ5ՕnEu]:PԌ C2:Nh}폴;X-gg6.qC~f;2'wiS4wM۷~TI Eb}3u1s#IX@e&5" l#8o.Ui^b>:sfx:/[rbjfJ: ۸VaQfB^諐 8&/Hl"VAT@!]~1f[>0Kgip>kuv rJ&1"O:-ISuṽK-YCIb.=^kl9mV}~ɃQdO^J[% ]齸fp`~;jfm1ʠ^X sڡ£fβwC= MD)9eT@ܛ0g rN sj܏42YDRk&ḋ6抖QlLop\O>ӭ3T *{/s7hMPꆴODžJף9Su9Už$i@^YN|Y:p3:wi =.nȚ`~4H}Cbqdp(^j`{vdWHYnl=oρ ϤUYKc4 V[ʯFl%7L\Ҋٛ1KjL.]#5) ԟa$ksdew'D x2>S|#{wZZ爱0+}~l $ O}+䒸֞/O$78Vf8ctjk:SG2}o3Uiɕڶ(9ά:{M ) :A5}{fRO8WuU"l *{7vV×,;&,yS4Tu]t8Sh&"1rg@><3ey\,vM<;/CKd> kĘZeUb  D&69ת癷 {Eztk7>K|lIpI=oLg1_ջsY|KX|MƄzDR->%m ec=b)G+ۗ?UKqDMII8He?З2Չ=Q<H<}'O(w/0ߔaq}-L,XKixSdjN>]VsœafҟxNG' /|I=<.1b{AޭKDZn1} =w+."&۪[q!?pXN 뵞 NmԞ I>/,!;Z#_/D:eh 5zY1* Va$2"Q{эk#%80°;X;fXlT,DGl_(S{{IOH-KЗRg4h֥) 1F]8S'*. }f.xy/ d~Ć҉xBd h|m}?˶#Z3#&e7 x)[p,RZK Th: ^cT^qxEhK|F]^]*&Tchp6@MXLԢ060d{PѽKGUMGnT6}k]`PQ"s23}zV{yc-cO15YWekwŔ9"0fM+N+Mo'*!*j32ޞ4^A"tIO56QNpQMqr2rĸ 7V1?,ɔoh޽7T2~ND#ΙFv }D%߫d}bЬailY0L"8KFVsތV:ʛmgfc^a#OcTpe3|ay(#/{ֈ&*_\d%U_H4d̾93w LJ(J_yG(>>53XoR8>5n\Oٹ&8 |}:mdnH ݟ?X^_CMT5U^{UfEr*M+wSh(R31CHr1K ~#|Cغ C;qӦ;zw5"+& k(LG;i*( i7Jә endstream endobj 851 0 obj << /Length1 1433 /Length2 6615 /Length3 0 /Length 7593 /Filter /FlateDecode >> stream xڍt4>" EFD[t.`AD] z]t%j(QCHtBM_֬]{S䘟ij3"ԍ$EBLCoH6=z7pUwMǻߡznn{S& Ί.Ѫ_M+k1:SYhv2mg8K}󷺙;5־r[?xlzkc]A =eI,! )oZ#+#$T$-՟r7F71jAqgYCu%ꄖ3'.b ujl!>uʅdg!OwkjQڽhp XRnTil9dbwG V*_ *llxG?QkY*eԉV_r&%5cCsPuLoWӜ)zO t>~@yz<5ͨv r:Nqթ}T!vޚ~O]kXtKqR,9{ωnIvh߀ 8LY6b=_¶y4Y =;"vCX oxg9@;@EGAa_g5lgft0OǫOeXEg,k)tٍok_|fy:<~V޶69O< z M}yc|mPJ IffѸeP,e,d<T`qg&s+du`1 <~DM-+ĩHT3@džXNv` AmCØ[H.H^JJ}~ hҟJr@N驍YIކ`m视 Kg|u82D5k0<+1uٳķ"oiK(_1H3(o {]DӧZGW¤$e4IJMɑU Kxq CIaOZHѴŜW BW~e 2[:2.QX T/c\wjɺ= Mvf?j,_׶z)ؘ nzXH/"_ SCw0#wxDK'*tI(w*-yfnۋRwPĩ?C*ĸjCF[~t?oa01-(?[tHp@^PeRڧE< -N b{LBh3)$/!q҇;LD}Znh{ I|y4ftn]gljڌlx<8FV 2'ՒwoIi$Mog<ҕ&tRl8jȍF# _N`эjOŎC:|c >"w^2J_h9CsGl0Qbb%4Dt,b]~9KQ+O>vC9C*`%>zЖދ=Yggא.HΊӶls6}&мWOͦO7B|fEs5vb|GkE=XB8sl'Es$:tr^oŤoC[e ' (љeͽP;1ʃHt}oUb)]ݵ.JR %{9M'ͼoe6hJ xLuRq|l+ΑAiXh|}a)~zRU++sT$"H'w,+ n~dVzX8n<+0-BF*/ߋ27/]YML6ݟ(==3a2-tDL"P#3策4E8aW=1[*ىrڞyNًahEv? }п尡]bK|ISt [aw6[Ȃ$Xֱ>pW.j,W1P5`;(h24dKDSjcS/^Ti=~4KZ/ #DG*z-gպ~=xv&YtV\IHO4> ~)Čč.*N]ӭ+}&=q ,#"/Eg,^!DV[S/"ڥ >n]9-pܼRA,v޸l↴ӭZ=s1Gmmyѐ+FƹJŀdc#1 c8ʼn+ܲHAɹE#-슌@sc/3YO}>GdD`9VG*߾^P=Exz5VJYU_I o`tijR<,1 \ [ajTN}e>z4*𕜘ڤ|֍ެ`aRwG=y=ELϩ7ct5 ʐ) 0*F&Y޿8|$z귞(؄EvVCbi ~A͞)ל7g^$:Gl^(wt$;+UO8%DFnQ,$6d\;8Cp90lt_~M*)~RU'+5=f:5~@gB̃󎒊hs,Yeꛘݩ}SQqXw mD-2<ڽ[8x!QlO $Buǂ=rƤ˼-lmmp44@=p3+^͓6$,cI?be,g D ~/&PC> \-RSHjO~/VwLׄ?]l?W"b D"Ne?1**6{ٽ&?hE\Wx@F'L(JxLz"si\2|/]bk&hGor+*osOfZ{}~)cb@FtǣZlTbͷ<]w]WFzGRu%r?eؽUbϚb\y> w89Qz#m7oBErʵq(#7i2_dI}<|- N?&sFK۪$A,lľ'cOEeGj*I09s 4)쪪ׄ:=q%F0~H(>`Z]rçu\;R[krp =370wP/tDu4s+9#ZN,}.L.(Nt^h{K{N~kjBtJ::M#SӭnOsjcD]Lأu߅>IH ) zt D^ #c^sv2("2իfxuJ`+웖 LwjHvڙ/$tG%H|!ZG-g_5+rc(jj~qz}De/GUVr@˝Jv at , eiQ zNR>SvUW%2]급F vH.V##z[~iN|]Ge"ͿWFvJ6u'YlFv>qIV,-FJd*=㛲O'T! M߅"nix`1&/EA`:ӫP&1|c4""@@c0\u:N/ީNFsrI! endstream endobj 853 0 obj << /Length1 1558 /Length2 8033 /Length3 0 /Length 9067 /Filter /FlateDecode >> stream xڍT[6L "!2t%!H0Ct݂t H4ҠHHzZ߷fgu׾7=6$q9Ҫ....n zz0^8 @dd̡p;U@\\n..B\2`+*@ rà8{mlks0Y2BBl W@j rhiІXAP`B99===98 6blO0rz ;TƁAбkC \9=ܝ@mE3鏱6_9 @`斖Ggs'o ˩p@ls'_n9n;ss&^_Ynn`_%r ﲬ4u d o7;A<|`'+_EX;s:]A2El@P 7yYr +u8E uuSoPwtdÇ qpN/+˩,ꤤ ^_v  hʂoWE'k'[x_`k9`\|\]+o5oGmvNZw(|T!5p_S}ПUYW5/ @^.?r dZUs;4 n_o ܋tnp^Q {0NCbk殮_P+of89 P ^?kBN_߈O _eǿ%@x]|N? ?o?  r/+q7#[Onj+K Yb,B,EBB.k$=7EQ. NjLСSYr&vjR.9_|7y/ةvl,f.a?)hfqS uGР~Xʦ_Ǐw@P*'ڦUSBD!wm;'a]scA,qY2newtG1]WVdBZo6~<34a3_% zq+v˽P'nm䗐J~,3яkςΩIWK<;(:Uh㢨v+Q<׾v g<厣m@,>_>b84J2z*f8*fŽx? IԭAzIQU"G-BBZ艹8Xֲ[ ~\qR)O~g:I U>˵Oʫ7XyZ߸I0g$*45FtuMϗ 9ɘDSdd1o%G75h}£vE*}8QϪƮr~e;TZEŒEWz"tbY`Vg * X􌈆kcT).GaRњZ wW|e|X_- cPnW+8mc* .BBeq}q&T=(S~kƒƍ{CXv8}d.cY"D0| a1*^;Sa5^O%l\7=oseKm(p~Ԝ,kym6<'Tb/0N!{ /DŝB-y gK1ªkBvSv w~U۸CΔ yŏY3+C nqEDWT9gmaAl0҅=Fi*p4vco˦=3A-"hr uh/ 4=\xr_XQYjQws(Vnİ[2F.Z`7*o/ dž;qT8:eWA9g4|atmDwsUz,dY&/l_&\EZM0xZC^o47JoR/h|)у҃}rD2Mp(k%uҳT5>3ѧjνGOEέdّڐuoYN-&ςi&ե|"ܭt'$=҄.D&fPLٗQVRbC?[7|_]Gz :8wrJ?A6(ZXKzLr̫GҶ*eJRW QRHKFyww/`~("t/OZ &584bl?[*B tj̥պheٰ$w<ߡ3Yk^\61Nc+Q7={ ,,Å^+vtY>S4kruD.9}dVme'26Dj8%5ۂjV HltTT$Br|}䒛]߂wm6{S"<u:m\d3u^li4!iNԍ?Gt\;Xj\/FZI4:rSAoGdJ<)9R<{.|^_u$ V9,#T {ەf _eP!hbxGUZ#O9BD(5ȏNJr}ōQ|gx?!|?:%SCGHnBPzs1$"Am,z.m$#!*X}ɇ93i+ }ݧgHXsZ8‡`;Jv߇gK:N[e*hO79Z.y~,F|es} j[ZdK)Gpu_zq0O"=ڹ֕Ԇ'Z3 Nŵ>I]uLh"#nOn~, m=f%gQǡS^A@gB sV4vZHUD]G}otM0XYH&;)GȪFo Ժ?h&:93 ,jB6ꥠīr4t3!PUޮZ/pŻBO}cr~r\bԯ=yK'6-@m;ڦgȡ~yǖI>^O\"$-Wbj@"dm5Hܚ%ngw5$3DqSmUn DX5k uA:rcJ3X:^ބ==qe F'h,y—5\!f7c=KDMӠܭWfg<(ݻL[%W=>ZvU悴P#IEtO&&xI`OMegt o\J_\(ZJk(9@%Oü>8+u:${R FEYArҨj 7a_4]{/]^Q1&I2~oʇq)``Q:';$z ;hr Dr9/N2&ۘҨw-1YIMTcmˌsg|2A2)mӻ@Uf~}{تm׊m-Iijxgʦ!Z7s0 =#WQZcfQa^ax碞{`@v,`%6E)0>Ҁ#3v77f(SьwG۩f&ӭkgB21#Wh~ waM4x/iÝ]7 ay&T׋ ,J4fZӦPVys}_A*:- z*\ٯ>+(.UmXuHPڗԒ%d4ᚍ5: XHdg[B7M-Pfr{}tKؼ5,PxC~KYk(3yLv>$^b([ .cߺ}vg!Ѹ/韔)5t16qb̈x%M|TҼηcTl?8+\u_Ϛv G`˛2i  -ke%2%&2.dH\Lh'WN܋ZclԢݑ ҵ* qz23 oLNn{~;6wiP) {g:2+O7_7~$h-N۵7@bk43S" 򏍠ݾɹvhed4PF© 4D)jBO@]5˥vL&b|K:uo[m._L?^Rs>bEZY4=)"ҺPޒ}n޾jiqII|MUڽ9ҵ1ti <܎HiX9#(ǩq UEfS 9Yx0KǐÒF s }СH~Dz@QPC<.>履fY[I>&#EM_V, 붾)MopҎ 71<'sLxRgjDjhM[Vv/.`(c'eiLҠBiErZ?ra\-UOKe[Փ|TXs) =K L/}3@Ogqn؃ѩ;;ا\T"rMs[EuEEBǸw q#-g…C9;\|) >e: 1g}GPRg>WfQ?D7rSt^ldeU]BE f[Q9-Pj8}_VUIT#`VQg=֝%Jl:[wb a 1Ia^æ21cV{Ku`A ̊{y1LKxy]x>ɥaf";0HD"P=>3IcϤo _%g+'(d.KX_Zru3ڙ~p;4a1; m y$bM1;s-ܷ?tl]nEwæGzkԽUV#n= }cU Fa 7ä׈-CESB©%YE l8|עhվ!>]ۦ$!L c@TUCKL`D =Ε 0Ә ӑ{c6LSy FsZv^f>f,c'ŸcK>dÓ3i'KjED7/a~<4B8~}*p/i)`8b`%uC\:PUQţm) o6qZ6 Cֲӫ/lu/.*S `2](ᱸrv`ukV.a8//ҙM; N*(\<,d"/"yK-]ӡo]sҥÀ`(|rD߳KWh_Lfug( NܟaS\E H4ے evL2Ҽp?yAi~*jg2qBFlKj&~@GoXZy~;4~l1U<\@~)_xz$hДNM8f U x*k/dI[tJs?QשṲ8dvFb=V 7'=N-m<>Ol }*zrHDͅ=m}K6gTYCUGm]* =֯"$AF5ؑjR{M)5|sa AMJ%gJ瀁YY)vB_lR"f3ȑ^`݌$6NỊdLsINim~1M·/MpvnD*SᦚofG"Xxm.~oU7sf58Az7/5[ZqsrM8v(inuwOw%n0ѱR (B;^yh3lcF>| ,!|[#Bܰ\=<#ߦ(XĖH]{!}~OX7|Tkyt|#Lk1utkJV[qQ/WT1DiVX?<؎U_\8sf(؄z&m}jVE }H>4z?iQ!Jil,D]wCuA(rR7wg@^I ##u(a[itq?EjE(JK\C `qBEm+1S.Q  8̬$"Au| ;R;wgxic$w2O3`,>ɣ +<=,^,}cZ%U@}ݱ3CwbqA5ozF=9l]f3-Հ@!+&F TC,(K VYuQ]6bbƶʆ@DQ~kMDoБ,74B;zlE)3~j5h*6tDv۝}; ]bbް,.* ua ϝgsFc=OM/ʉ" E/y|iRj5&D"f15Q/jMdB8N#ߪ.sR8ݥmX៛_W977\gO/ᦞFncXnPg%a=qvLb^}+EfWW9$`QT t|W:ٵ;K%fqJy+7\.^SQTk]e͗ԟDBLU p5r$hTWth/&jnX;DN]jzH,I(YCfHaucBy(LzμfzT5 }q@jm%BVKг+am精DGdoh _CνPkgTRϰdOȀI (cd pR90nW3\Y<\3КgdTYd)ǻO&ާ3?h]<'U|gVzץa0a>z 7XDm~5n9J϶aqa3fq݌աf0,K1آc ~ ;,Mxsu ի2H|!azUqY_C4^ V(ҢK`Wa&,27L`^?|"3/[fpUN.òg^tIbznswma WL.b<ݜIBbm endstream endobj 855 0 obj << /Length1 1480 /Length2 7005 /Length3 0 /Length 8010 /Filter /FlateDecode >> stream xڍtT6H)4:1Ctw 1)!%( !" 47{{k}ߚyH%m* (.07H , A ^| Pr@ݐ0\?nP 퓃8u`!Q  pA<`6un Ee.n0;{3zZ""BP75P/ZCk(('7ɍp{ :P$j50@ 37>gC"lQ7(pYCHt;@t8 w'C.7 n9A j(/'8!|B~w(Hk isA!0_#*>ey, G!'sZݛfO_- nckw}8,gE@B||+em󫼞 wˍEBHrsg> YVP;h7^ ^6QSVS3c22///?W e E_-{ֿg1 P,7 SUc7;;!0'hֺ PGuo!jա60w* h%HlsaHF Ù?~_ZsZ$+#A'AՆ_6!F Gm |h@~S G)~[5 x~[ ߖ0ߖsgȿ=hxp6  =oGBboBji]}֛†#[I SD y2EKܺ0袉[$mtDOYt$y2/UR khn)R#1zoի*%g9.[4 UsDjŞ9N }pX/?N\>UNv",z%~l~=J+F#gI۔D3֋i|!i9 vQ6 :#(N?c/84f1>(= ֍vH66̅Nu{ZN+Ľ ӛDڗjiޖ=iKqѸ+;H{ź, Jiq i|QF7*Qfi)i֒Rj8Ǖ֬#pteqho`9 Q9Y\V.!yzהQ%ls3 5D_sOx"j1C 6gYO+KސVy|ǂ@\4sDXY=! %+Ն0_.pJeфv |XK-I|%J*әќJʱ=!,ZE4kϓxN|Z#{݋2ͽLMbo@*/~4ŵoZ۵= &"dFֻ?q0[L3p'zW5U]խyCn|UzXyOLJ=AIn w{+[Iͭ?q7xg=S\ UȐp )maB#j٨]F95bߓ>$ fNk[2+Gq?BmS-x6Sʋ?oY5LkLqzJ]\,v F>+-qO^RKʟ[`l.[(8׶?ՓZO;T L lvB s>b@F$AQ܂#Y?m-pPktHyDZ?Y"OϜ.k(QÊ4D7ZT^u/ ׾GC'Mm>R1[8?8 b~RUjSʖ|,AY ~i7Ĵ 7W[QA"2t.+MXOfH*-6.+a莇LLxwtFziYv9).͜99|KmV?DYUG1ZB@Τ!?6nv8Gj`sݏ(r>~O:pnױl~]}wd¦֘)KHyHcrybBqi.oYcڈ5MKϛeeo<^o=*ԑz--Wz(F0?$(@/T'M0U=DfA^ ATi+΀LwD, ywِD#{ 5e?-l e}~)OU,懏1Nt[ {;Gd^sN^t2v|޹u7^JcB|3&ߙLuiw 7p#YΡS M]J<]yJIzfdTG: =J©ZXŘ(i#"ѡqt{sY8z $zKԋ$ܡg/t7A6`w60BR[mc\Deoؽފ?s?{^y) UhCmmf'4bvʫcM -"Y0r9G.dnY?d.D;IOG.cJy9rJa>j] <:ޟ:ͦ9%.NEb` hXC;#Wk|v5t&MӅBq+&phW9VS)<֯/E^R $3!lfr38ˏX>#hN$2vj%xR\WQ3C͇pnA^S"tq(xb0U`6eki{VaV/~`{Gy u4hY;s} ĖYy;uMi>H^ ք? ʏSSSaĉtҷOE*BkiM^1,\TJ$ʰ:E-nvS$p|}RVr]"*v5 G`)R ꝟ槝OjEy6m>|ڟX 7 eu<;\;a`yZmn݅Bg0ekhg}z?.{q6{bb^hɿpI9O ,yq4sߔ~/:e˱N8#l$K1\G Ʈ)ܯ#gg4r#S)gړM7ݔS/NRp8(<x_w/ ;쪱nu8\h%8fm9-V+kQ\h+-mָSz_Q[5BggaɽSsqYⱦŪ]}ʇo&`EQӷvVDȺ5;zX7|/lNޓ Z^?}7GN<8f|5C>9;D>.wϪf'O_<^mM&F,U(WVj=][HXBXrsU;L㷴ܛ}t&1ߋl5.Ckϼ106$. ^Rծک#R=L.ˆ[^IWq%LQ!z~Ձfu/t8)TQƋċDaCvdTW 7YKaacSK&^dKծUm=ir^2P*s]L3ߨb2' 6h 7hs1 m%nC;/7Bkn"هKn7o eIX| Q?"f7`?c8XڔKE b|~ `;f)mGq0x҉k<1k-u2ʤh ,1Z%&/* {0Bׇ{gChIe2NI;+c3#FX"$\fqk`j+!?rF~3[}5Noc2#;.:A+]G9iGږ "\ 1H &vYgw#s/qzhތ\@ˁ1rX]R^.muaJaM0{Dhq= CUlG }w@Pry޷Q UHTMnj$Zҷ>oe6 ^FȘbŤH™ƈ(7 A6ڶMqN`<\=cx#y%I/,%{.HS}(P}<ƻTV~ i&}]DY;'a:KL; qo^&᨜ٶ%}3&Vr>MvgA^# T,, Ⱦf:eK 5n"v"C{M# H͘#,c\% H'{Lj?]^NbDa hx''> 6(4Ls 2١rs-#2"AMFƷ1%N_eU2}rfKM>mj5|R1ˎ+f$P>l7d ͒{\r:Nrc-9y-)n8Ht$-ҝ$'z-bV\{a DAէ:w>'|Mg::.׼aC:J܀<6 vyc7/Gʽ@os\5EU˺?M-2BIѡkZ$+,&gӔT Wcm :LKz? l~/vah2e2Q#Ũe}**½o/ٲI2%BD5'z? jSHSDJFIiKfӒ =2x]) 8 ;RNRN{!1cӘ;}rQ5V\R^o9qh MBE 5%DuHi1#=7. ;m !?l{hINv`q S^4Beu}mXKaҭ!];,$ +L1]#w}"3;U9T\iABg<d|ǗOb7$9+eYm/n]/> ( ' Rf>~P<~b_øU5ͶtѕthPZNн+W/jơT%@q=AAi]1w2 Yy -BÑyca̵܅W`]N|S܅-a1Ȍ!?F<41IM7#n-k+ALw92x}˷{Tc,}l >~Nu(x1Yr쀿4JKeZrvju}hw%YdiB^V8+_|:< WYY,i vͨ;6C27Mgf-E/XyxL۟S7SN'X:}^5ű]TT ;#t Az:z7&oJam爺C" SDNwVGzeoS\?N'*ּEq42j_d}v4"bj.H+2m.| ] ݸǴƩxp98eEăG}9ڨT3'%wX,p1HmIM6t-n`б#<1(U'l>: M0v5ЮPRG$iӋLsk\}2U}LMG>Q:=_p R >+` ގ빀;^OnA9p͋2V+^8,xGjrbɫ\Z<ƪoɚK>AwC&z푏%T݇r쒹'*6iZ%䧉)$dPX\=2;b8,H 9>*{Q.glǝv86+`~l㖦%"0՚}]uxbkYm[ ]9⭡ B҆ZCV/k^EESA}[v~yHgn(^9zf/dQQ7 u:^<}N$g"# tq?Sbs' D6^lSY[_Ϟ< t2{%w]=) %¢9FmɄj=t[X9 o%ģ㤛-Xk>e gM_B^)2}QŰ廦;Y>LuweU ]dn~ Sed^d^FrOۚS4y97țۡ{E ` cxx>>]T3;6_ H,#(j ƉDȳ IPyRaY'LJ o97WY0Ӂsm-ZEM);UH9q(NCV=+wI1Urxu5пZ 7Dl:6LMڕ7ό!%]J]Pg5Ģ^s#3 ܏Y endstream endobj 857 0 obj << /Length1 1391 /Length2 6507 /Length3 0 /Length 7453 /Filter /FlateDecode >> stream xڍwuTTm׾t(!%͡Aa`hnC:f`薒PRPI RZZBZ:AJoyoZgf70Tr@(OA0HXPR ¢ aaRnn'w@Q2Q X*E;^H, %d2€_@4FPx#]pyr0G'OA|P~,--);PraP Ѕx:\'B!H EM85] '"ą$EE;: : ;NvA`A8 G/XPm (c06/`%e K24 t5k濣h_ @, ` } w!F#W GR􋽨z|w-=40[ CSLU'DWO^X)袱@7 HiyBPB9bI- Gx#|aOB~0>]P E;` ~%b-q U7M! Mp4Ƥ%!/o %oSDrC6^ D[0/ J: \pVGp_Dc?lI{0LEwWǕ><1G!RpYbN'b;Pnn(8H%sCKdE(n֨@qh7 Y"M5DRRp#2K) 4iqy+o=eQ#GD|cH1ƴN}.lEQ 0̽ԢFvgk\>~G?JKH톪ps;Kt$jܙ}P sReq2ӻFJ&͇0rQҏs=dQ~ُ49v:v (&-qŎlSrп}`z,.,$IuhLOڛfU0F 7TLRu.xRQ#'yFeyIy4d +e%V=.uxɒ*u[χLp4ް.I̲]y.M)q*-AZ駻_$Xqh [ \s O'iW ,n^4л_QE_eqFޅ휩boks>M: ̬3,'`B04G3f3,* Uus_?l{*˜נ/Fs{8?5ҎG5fQ00`0 Ȟ,z/ape3=-Zx$!;gv]λd9ҥZ)a {qp+dWq~S-ZY-8c-p~Fv,2̓/@lG͔(I 3Uߕ~: QDhb#:{#ag>e$ix!Qrc%2豍ρ&Q%ZA۹ 8C⩣myw|tLNKm^&UiLAqBߨHϜXz{ʾRʘDjb8<+@~.mp_ՂeCor k4(eoFjدu8{{?ܢMT߁ #P-ʽMTz"$vt>F\ܞG$ "Tg =KTu_S]s%)zaD1ɤ_STzԢVA1[g4?{ ߰#Z_  ,}4D|/R(sZ朹p=G ɞxeEY90*"˖)(OUNMqMd 4)]Vl-炯9KDw-L'ޡup JҨ f, >S6sK#/THSeZ, 1mқhrufKSxJ7['of\cSlDx#[(z??  xy#VLj~fu0Ug53,St9>BJz4}L΂ "8tS=:=7)E}t/^6g"„&'dl ssKb-4R{ߞ;mw-JzxDM9=xR1x*ӹVVp@Ϙ'@/X;rg7UQ:MlZ}W=]Ws . )"8)3O$V۹JZ(rn^5おOţAIpGɷ+ )v{K?[QYDrƼ<$ƺ,>Zhs%xCqe6u<뛯AP;Z}WT_0 ocfzSfD7ҡk eNʲ9we&ٝ?)(p2AZ(9E_[]xY[Di .XG5.+Vn'ѫ>ӈ~\r:W9clݞhDe6"QǞ ͈ZF QXF) M,fQ>Jsu$w㹓ɀ~eN"gr#a;tA$qO b.gN]WtA$mLw$#9MyR(2(yW ]z]Y$~$YHOIoek9x7s]*'h40TzL j6!Zww4cZ rd( )!H,s,rOsLJ{oyXWApX g܆>4[5 a@xg,qwG2G''HAuxp^D i3>lkS<o\Eg7IȹJXJ$.|vZtE"FT0i&)GzsWx /Xjt-yk,U]e_$`S܎~VC2.gP%ea dF$z[SM8M򕣦2Ц'Z@Låmc*~Q͑l67l~ >Ʉ vk/Y }I,,.JE1GSٴ;(J{Kp"+*QBs3%3T}JvT//J[Vk5?TKLg"Dب6ߓt ٿ'8`PQw YcS?M.w.ĬI hoZѶ15|p:*@G-\ò@P&Ģֳ4(wuJ%i9w%<~Na\d0H؉Tx}!gRdXG ήSʭju.}jSnЀ9+I2"GRj9w7 *3 wom;%IYP|sR䣃uƬג63_E+A3nUG1iܰ+? τ9j.ʯ_d9yОU$<ggHiʯ _ssV<7=)Vvt{;ˤ.cp&(ج>pL+K8[M Tv"v$5Ϟzj!|TSg1"oht*kVgԻ?^85|M4 yJղt5ElJw ޒ8"Jce N,ZzcoI9L!{Ыc.SXQɭ'|BE_Jby\}-e׿2ϭULkYPO]( =wa1{P'eԼ{fLZ$w3AZ-iݛ_ >r,vd34ۂC.zeZqO)4|R(] 3sȖT{VyDx׉[{sl۹ڴ!$9|Yn4&Dp`@Kgٶ6D}]iQ|J$_R"0j>ު9vZ&a(5V- jGqJn H|J#xO6FVw9ؘ#n*|ΎˏV,0NM'5dSƅZV,ݬb"y+5AP㝇zߝمdrrFI>#۵*r7x)tvsibŇиӵACJ"Ҕz+cNԧ}ZL4P@箺h|v0Pj *C4^Ky%Ad/9=u(W-'3s"GfvIO+QWmĵkӥ|L;8Rp;LRs eg"K nnp+q:]2Psp0!۫]vb Yݖ4%{ɗ5x'޳Yn25R-cǥE߁lLJ_|}u/HRwiur-VfU.g?m!;]UC 4t3,g):@R qƄ8:a(6R!rm!Pf}tF1<-0'i96:ا"\\ȅt9}.)(;r+تH `G]+KK1IuїmB=L8iVs'O38Oe+cP:S%W[eZR#5r k)7@U ܠkMy\H,sVCGAK?- baoh}o~{1jx=T pefOќݥv^+({L$]@ bpYRN֍z45'_1=EJ2inĔީ/S ^jdl FUWfôY RHΠ]Qv]GAuovߓDl VF, z&Zˁ>n?*sd6?47tmzk]kieƕ.ꃦEh\)R,KMxDo.Zq7m˴lTs 5+^>铮gpپUN-t磴 {ͬA>Y2I +x7R~Jѽ> L` (&ej<7Fwn<7&㗸o@*3bƏh^Ifzzþme%cFvm0|S Usa; N^mCa1+Onxk^@(qm"u x:KnV.r^.t endstream endobj 859 0 obj << /Length1 1369 /Length2 6278 /Length3 0 /Length 7219 /Filter /FlateDecode >> stream xڍw4kvDD1e0ef0QC-DDKD5!AtA 7yw_׳<^nNcaeG= D@,@UW@&p;o=9D/ Ԡhy4%+"`Po Y_]F0o/e5 97@`Cx]|0/>;@C s90p#~;C((p8a}@Pwo$ CߥCeC(7G_a׬pTEzxho_`{3\7[r#~1E=}`w`*t04@$-%&-y`~."`_j|($ o w_P_ ߆K`0Ü0d~+~`5aH?#QW**H?@@XT8 ?; ?wNH_}P~K'. $@7H+]/az A@_Cam mwP*(#tAbvp3A/_GTG8 퐨$'/Ies(@@.|'\AE%"(D4@hoͿ;xy+=y|U˿79ON "\"~*`nr/g Nz9$Iy6uu})$[R [ONmZ?}`+b#c6QZ: 2 u#l&h4(y@Ēr6ipiܽв1q&.b0Ͷ(SV yFXIWфg&oo1[2 >bX^{ /ѫ|y2[, -eoT5q@eQk P h=hSJn¼зcއlYdoL߹('Ws.(?z 4֙P*QVRg L5:+77'$El^^OJƳ^y;s=x#~"$vfZ<(lfǢ`QLT&Ek#hQtYAq'LKkɁYCR^ EAbbW$7]'k;LdȅcfU-ؗ$ ?bsf %:Iht"kV !˖8Aʆ7|5yA[+bƭ ky`5OnΥ zDsH6Rj2D7;wYxZ"T.[j;OM;a )婉 x-mfBtSxLg\]m/#[7 g.xh^kZn>_4Wstsj{+ׅf8ﶶ4$HP.>(׎v2{BEkڦY: t2Ij},U3zJ-*܏ԌB!IwM:˙.Ke*1`&ME-<؋ס|DGԁ}Le!R$-sGscl׌/dT9*S0u9fi-.QN:lq:/T;mk^/gyjc\g"zv,F4`muW&B &;o$]^R^&〈Mz c-UaSy~>$,7]6Q>MШ!HYK7k=o@0+Qj;*l6IUl`\lY5>."5Ԛ@șiyKEԁg 5BJ/72l%K5 I!2z'}A2<\7>{?88*9,(\*eX\]{^A0J8? +a,Nyׁق+){r/QwpG,PwJp 0V!7..(y@NɰCCB1'`cHjNMq&cc"B͢xRVd?P6 o-f(6C &Hnq_+kҬM;]4]:Wo0> koMڀ$A0g1[ܙ#3ETdӯh;_TڏejW]˕Ҧg Iٓ3E,_gTL=U/|&{86?f.Ǵe{-YݮQB=b)*Cl$L['5I^~d.u7ZwP V"̽a Hj#ׅB^`Wv"ac)W.+n`O.;/&mK=4{RCɸ:W֚LOa®cu=$}ORCnX}c/7?n)j8a;I t]1:g6pITܛ%v{@&z(d7!O-tڷ']M=*Q)"$gpӽKg aptKї2-SOڇrW_Z5pӰT/ƻ;a[ݻ_^ 80s\~K'w*!n? bŽ ҮWD\%Nac|0dkן)گ2g"cVK^aYO p?֕^V&5QKCMw.F0iXR*g~oysy7 ?v ڃ$:FQ)XmF?zJUJFR1ӛ17? t4>-~ Qp&2_ SNwZ [6[ZzvZw P*ُF}A<0$Wȗ!={ |wDiiW}y\V.㣘@nasLB~Ab7ʏrcEqeݼfGoF(LQN1& 6i1л&c $$_/ KP#_8Y*(Nw$dq_y-W'?sҍtK&nޭU,c({JF- 㼁 zR,"`y WX6NH[:$Oz28u\]_t Hf|=~JQIժp" ?i*O߰7 Wr3f!6jH׮|X]"RMtYKy$/&[s v0[q0k2PԺX vؚܾn^rI01N,mJTh'%̇girHuf+˘~E@ؾK+OV/&FB%Ӌ+}srQsEs9\Ǥ|NzՊT] PG4wIKHZ/d=09Ϥ1jj1ΛJ* q{ ξ<#7Rss*\R<ͥڟOVbjJQBvQ{e\],:\`خ[xr]Gڒ>X&kgFreDr+u{[~V9[ ekEa3S$#b3a0ċ){j**k2/D݂4KgVNEߕX}s8~]9񹡜FJ-oJuͥf569P^#E;M*ksm7ng@ng >npi*^Bԋ~ÔCAD֞GϽ&yU\V uh╊c鷸Nb"ߏP_tUf erׅ{jS FN52ZkbHN˞{Y5rsx76PqI5"xW-99&q>Έ:}6bps' j e1$Du7d/91jV'nO:%%'@3#w%ϋ-r;E1a[zjUq*ܙ8m[$jg'!gMI4 M6,v?hzVןULu\0.΍'ߙRw%mžIzI",moN3xk6sI9O(9LKyc_9!CQKA t9XTfl|37/a_80tR" d]EOq uu}7207W^}e0K:*bZӾ͹}w'S[l6:hhV%xfRRS%y;JStI{->0&.x.]siYx +Qŷ$}'sg4_|.VMCXMbϗ=[i2ԉ\7 LivMCּ%N_᜶r^$bV4eHݧUcwx7z[-ĈR&I㣛R|zB5HϞЪy)q$WL8BAvLU" m YLOy }y b+ZNݘt6#i_|ZlS/2؊fu_֣pD q}<cԊ"99Ґ %68XUiNKM D,Ȝ!u#hfBʚ/b#GK.;f+l;< Dܫ˹O&?x6݉WD ?zz1 *]YggWODs%}*&2㥒RcXY伒ju4V/0ۤ{Nw9Ԣ܄qwTIذEƪL|~S4OŢ{FA YVePL%7Q ʕzi@otlXv ZW[:?0}S"{Ɣ`<d|*˽4ռnGM)^㽓:\izGBR|'*VV;^"W)ΰJdW&f+yB NF|_wk -h!-D)xE*pM lRьyOvjI\Ïc]:ܑ7bÀz;cW" :fҔaS3JI#4^{/ZRF^JJ}TOss,\*kgw~|iܨNF v~0^]69Rs}k]YƅWLQwdjc1;d֦ ulw~ dPh=N T2@q>≍h YJhJ[GENFԏn G>a*eQ=D@nʹSX 65A3#rA C)IcRZ6AD4s~N`rFpfсAOf e`BA ܴScϤK<{*OsCp2,|8 M}S?L.3T8Az}upj/>LIok[ľaʞ endstream endobj 861 0 obj << /Length1 1755 /Length2 11923 /Length3 0 /Length 13055 /Filter /FlateDecode >> stream xڍPڶ-kp4Nc=!8 Npwr>_^uUcʚcʪj e5s{S=ȅ `ffcdffEPv #PhAa 4qyM\AYW[ ?Nq7ks#@tFwtryj3 ; `b{fof tV..LL&vΌN4wk+*4Ahb#@/\ xl̀ wW9 ~9@MFe,=XY A:9^ [/_щ{ؙ ?aMN?|e@}/dP4h>@Cl<MQoCtSM6}h]]@} @T *ͭ]V}D@Yhlbf״ke  5KZfޟS|ߜRdfoNJrpLL<ޛ.qYwA..wz {'?: `RS0+LL>_F q? p:wg 5`}]XM,C0#ۙ9Yޫa;Ig_4YF&`729݀q}[X9{.d}u`0yW{\ts{?)4CX7 i%Bΰ3&0EB "=hV`'g8ՉfqG"սD »>/> e)]s1{<{FfwTv+8'4"NSf¸0Ѣ{LNg~(G{V୻0R܁GKy>2A-$3]X7_1 >yq5Z+mde; c;ȉT +K%' ~J˭fM2"d`I(qep.,~~hWP; ^oQ2t(DP~3I(wЅ#>f>3.7t7)GEoYb4ڜ;A[0i{y>qzuND痜**`tp1z6xGM~v OEK]qkdz;}8UBςxA7ޯa/7UJ`QW)w ɌZ5/^E sɼ&GH'Ƚm48"CQm^ PGFZD4j,VM׎FD`[٘1ǎETto 6^cʝV1oCK;tą>k>s~˚QFm[WP&fM ȳTe]oӐDZj}⟡IPPf! aDB[AE`^u)悉D 8!HT4,9gN*ɑ~ܧ-^lo,qد?YM|jvZA\m_iBxBW\IG؈F#zڮ=Yf\~K- q~oluse9`{JNŮv)%}3#_s< ojeWbw#K3iuV]շkyRAA!Kt$͛s 7qV8Jʆ'p>#Ǹ,{8HI#5$mYLWT*s9B*UyJ3SF౴!g]h8:Ond2Ѵ+Nv;B)kתkiNfH]H%oPn6H _zMm OcW(fn 1mvzE]C@J|` &|N)d$r%FuknYP,}uaRG9{ӧ6h[j[ΌEɲ♤av_#~MG͂#xgO'i dN8ز|YBL/H b/wb>:.|wR*8Fki x|mKߏo[!Ő?xkb$C5r[{(T$ [{6'Ђɋc[I'Zyxuyʈx n? XH7$Z dewG/B%f:èr_ ;V1}!U14M+nس8R`ʷ.Ieku싨}CEQqp~zbWLc=^GoK<ᇂw:ʏcWSr3(ґTU*c(2 .yoIz4\=mVcx:TK&]uTNkߙ@Fo9؈pIU{eDrkK熟LW@~'ypK&9ϟ6זvsYR1DNav]]t i7  9ߜۧa {y"‘}cǨ[w|FˌB\7utVN1'gпNwhBo@Vý8ؓTGg1YqèJԫ|(<+Umf.[$o&!i)}kG^GS"4 {كAiǤ 7Ġ+kEk&z,=C|akg1Qu0HD9w7IJ`Yƾq(;r6\:3AFYR_y`#or&H96~T%1ĤhYNc]6x`uUUGUԐHUĶȣ({N'CgY,FtsJ-M~zBq8a@v#9=x yVS1h9 MyEDA 5Yh(t3///ʘIh9'scE\`mC\~IMGX]Cm%Sm(JCL` jf!&%GOT癨|m@[y1(~2c\dAq/15[QSrmeRbK`,ĶWq}P4etK) ƍ!DYY{eR&Bٲ{1EiFqd[u/ZR-R$=*  Z/Ϸ :=Qs6$mg_G?=}۔mpA 4X&C _-FY B|2B8 7>դ&󻈿YD؁xe XO%q͒1-Qqmz%Ns͔rбwb.DEʙɾ!bՑ'HӴ-eܮNI+W\,|8:=H^V f2 ;5\ivy/۔B{ˍJDm0؂= R7.z3CӤu)b4N;ƽ qׇE<)7p˵օZ0eB椅c-~|jPe|fm'3B6 54kҀ։It'"[ޘEsbX@ ڇ#XzL&& ?A9y&g,0)2N=]it.jrn3B52QhjJҶiO Skrd;:ֵF2{;7JCq8#m Ā6AW,{thnea縣<о*=E]A|81M_wiPl&DSa遷x*?ˋBoΏO<2yEo_0~hKLB`< &]RBX!#܇>YB"\ٗ@W}]&I1gӭJ _] n|=4Tw8Rt{XRL E5PV(ĥ^!E.iY ‚64ZV -r6'3>MM(?Ŝ"pD-p_ R}#HZnԳ%_  !w{]9Tz_S2TL<?]}T-1E;YhpeQz;M'r\ 0"HyYk`a߆3.ɇJHYHa]_)s)==z=CHDx^ gO VMsj]k&ݢQR*fqZP z8BYWAk\ Q1JX5}{2P7ra#g J;?[:#8#14 #AJqlC?t/}B|zgj0" x,gZ~v̞!U'<˦/Wc^b/<8{'r_eeдHfSzOjHT֭U_F'b.#F`9?l{2.ǎO;(ǀ7Uu\X*gz|rDu~\ZDg[kJr]B!n u@f9:+J./~~o!D`֏ևxF5A^þjWF['؁_j-**z?#_86IE q˗(\GfCwLE?}!ZbU_Ӣ7 N#UW=Ŗi6KIoz½ 6^OxƥV\hFMڍ řIc0V~cAY,Ǩts2ԌpԲ"YcN 6!0RVNtI:vah-Dރ_+]YFlR%WJ˻+4&GQ Al21w4rmm0^QnY߬m* {+Nx)1 vBza29^WyXZmY/AxKF|̲_4|N$.}WX!o58T֋[VzKtR&p,]']|B7Tua`BXƴؖXT҉ 4hak)"~>e`̩M`"rdn,v!3PdBm*Y(W\}_kSKH5O>7]">)mc4OwP뇉C{]1a} sPpct}`Y X߽ݭ QD2VDAn3pꓮmF,@0_PXCcs ͜J9q(y ;So[;sbUTWliLgG;/ gz imœ lCDŢhn%X"2Pl͌p!_KK64Uɑ)JU ON&qcqrW:Wxsgp>41їV,v, *io{櫛vAj z\ )f6"KvvAޟ*½Ez{SRwⴜ(CxU=UNl<$wΛ f}Zc& _V. ⃏O>x8?hH$x}aTao~0KԕT$N/Aoc4Q7rX[x`yQ-0m1ͺ͜>OdQ\AdtA"%]~h,X@ч_7 _<ݾ;r-IE;-%kh7Q#gȢ@MtzxYvC)a8*;uƒ% 3"ӧon㰨5;e³SV?:Q+2ɧ ['c\1eZ5lnwjb[F݆ Oό9LJD{'k]xRxzXRJk搎0π^43vYH.qv<_!Dhz ۃ|56O\mު=<՞=jP fg`D$}:i#5_zn4tVM@>v9Uװ&5R NE:ڨ􈭀-ZݎhbF`M87 )ݙիD\5?^`Н!``&?%?/0ꈝSa1I, 矔`nYr+aU'7֓ bs  č3oNixB4p$-GJ6DלV2K.o'}F:IćFFRm|i. Yn 0fs cn PwK7D[Ҥe7D8.~Έ8>6|"dTkYKe|LOkkikBrGĞpDS%ex CDiv>U>üF Iو¢!ih 7L;}:)^UnSzmJgMuOTk YQ ܀ $7D>:u6_+֒.p]$V=o蒑lcFa0'uáMlaתG`oQTM5;<-=P`x8&x'G"-p0),ME^jObLZII SߓWa\}BP;6ȲQ/"g2=#Nt#n;"yw rm볶\@ᗧm$NS1KP=Fc$;aT[X9C]/ۄ}ehbS,(F2Z!,>ߐQ`]'b~ڧX2~ d:ۭb Js-M QS*3cp5Uطr~c',OժDa5P6K_2R@mﾠ7s5scxRΐ}AޠK4i0 Qvǧdo&[AV[-ah@1`}C=~|t)5÷f$Cmn‹cH!?XD}LB 0Nែ:ᡣCrLg0rf6FLp4VU$+i\HF3!G %ILAWybjE9`;"S x00*T RTK\]_ g1ɞrdnYkҮҷF qg8 3 p=#cS+J~w9ËmtA%}եB3q2ki%/> 1 ]cbدv#&ňVs-[Vgt'GXgq۞y^&/pdH'̱2<èa Yݼ5$YYi ЪJ ^XAឭq1HvS4qjS# G⾱l;䚒䂣BiR*RR(-9AO]g*vn",8nG(8 뾍a B{dSqQ(CRYCk_-uc^4%,0 h D5:W>ҷ>q25B~^psE>V4u8ZO8@Jp&1lRKa=Np0X:䭵dspqޭ"ݖ.?G( ;ʄ{ྵeQ>誓$;}lŪ=ZZ_o@)[a]to@+(˽ K̄6cUNoa2B]=PBZCۛV!8lbr$:T ]xt&E;{E[t l9e2/S3 mVy$ <"$8Nߗ-L&lm P=L?㺧a<^Ís\M"qP@SI @hWྲྀ#wPye6 |فg`D͇A (In̈́p:9~cJF}ތ?px)[MF-d'ҝ6..Wgma zE /#.y ߿̌HPݽ~d6{-m- ';+ _a`%@a4禸ڔqNve܇G_: K.hI4^cBw#kM3C0!{" r ⴻ;H>'SvRfmDe4v XSI)JzB޼U92m1z)tQ? |x Ch^@:uV?:Z$5[U4֌$Zl&x#HHO *#;!rYwSsEF쀤ic 0,| 247gErj}[7:c^@ȒA!Y#*=gC` endstream endobj 863 0 obj << /Length1 1390 /Length2 6237 /Length3 0 /Length 7194 /Filter /FlateDecode >> stream xڍvTl7ҍQbHR!`PB:i)i)QJ!;~-E2 PTKmC9AhI!H7. S0n8@ " w@8"2e-@!n$.H=#Pt a` BA!Θ`APJ'E\d===@nB}~' C H-׸G gHP BB a$S`q8kqu5!+ ;#]@po`stTP^(nă<@0' w H M kB_i0}pvQn$S!!`̭{ ^# sm~`"lCԕHCPq ()% ^`.F_jL.f?!uy@(;-la`b1G¼@ D_Ol"N^mRRBx|E@ VbIYtAC44"?߹!0P|w ݿ?;92V3/;( [[Q N_"MՅ?P7E0'pzPˆaha%U`/vH7 fI+-7Bp C I~SL y~)˘:(O߲@We;od`L27ˆ9TU*x nȽa_w&'L YF(|\\W;Vgi|Gޔ|:A|dvw4oGKW?`GFv lWw)r3n5gz_*$4ILE[Nry5Ad%MËb#kv;$1f+wcϧ|J u0q11S*mj0/z5峿!(H)y7^chMsv sRUq=5C9 Jºf4Oo?}K(8+6\nxhX^(.bKD ^EOcL̿%^d`l\-եVT=>F}<<9 AiE[׿K1۵Wળ}6=I1,%̰JH2w"K\VZ~e"$Mn5<*<p~|Y7+nv-x=|M˧Md":@et` ]4팓Us')|oZ9[n:,c$hͽXQeKو2ÜX]asb)k&8$~|MqУ!# Qa4NjY57;~D='N6*1=T6r6]/rrP [JKHg.Spt[ͤ ~88+Pn&47¾e%x=+,K)AYỉVS GֺATȵq/]P?}@y][{kXL`dJ..#J8ZEU?[mD>$#&ðI)=mۋ:a$fX52fjMEV&K(_WF=`X >B8{wUX{`U\I{KT 9OLE{_ef?QR_,ulƬ?WW =hPǗo4#[pF=dS>F2F" 58s"',}Xo-_$S3o*@RwX_K#p|,lzv]i8F5 qI4' d(;Ȗp#x&fk%3ݹ?PNn#+P~&&wsD3&(6m޻GhBm v17"$6duObDK[R.=- 扥?r~A31ݼ"ER2}\+.ϋ0RD)=q%lV&C]z纇vMV0R:<|A*p~ŶUr?u}AI~eh`Žȩʂu +̔B!%ÊmP3z6P>H}G0z=nnvƄ3 &dXWcBJw˫.[ Tx~YS |407C4ϊ >}` .~:^(WQqdI@gjȵ85gv Qጬ ej>P+ < Jw_[j/U"a.i)ZEܛ̤a*`KJ;%~x$Y gt5O$y|pFJ4xP@=p?/ѝ;ɘ1[9T.&qjj~R<;v~p^@ /Uk(MYh~ r>'ӸU1==-JcEr_zY#9%8ӈyBgPsqjal xқkZ-m ͎_HU6NNKDC9|dr w^0$]st% 8qtGNW8i''~6.}ªSY+uStu#- ϱ!,i4D7iKVS 9-L,%ˢ>aQrz.8(!^Mq~;F&rkձU ݱA+ JJ[?dD w$:1gmϝUVʳ%V)}pqG$Zn7l[yAC*^n)<2ab~D|i07!/.GFMg~l㔔'I)3[}=V< q6'Cso?'$QAUZUcJ5lWcJlZK(vpugt 1 JIaOzlsd36,wG{YՈW Ri9iÒ]t{׌.{ډٯ$>pӼs9;{R\N)ACoICi!gծёAFg PFN}߯k&JTr=o'MF=4v *>DXDqL6k 35˂ݣ2Gn~SS ة'ג>xlk>gjVPV|pxSޫPqHPȀ\>z.t|4ǹ8ImlLӖLbhvggRXm۲AǛP6^bQdYy> ?C%~r2bR/8\Gq%^ n{X4iI2JhrVn:J^,V&%OQx *aO# f LIsy+Z[i Jʷ؄LJEoN~Lŕo=Ѣ~^t= c&*0t> W/pҟ-ZV(h8^DEE+usPYkNLfgU]i`U=`Q#бF۲om {M8vdeƖz{/}RIoܤmtH0E .nֻJ>K9|yAD4j<6pE"^[v!*:CӔN~?;.Q.Mf!o7BF$TDkfNsYY7mحN!1eu~w7KH}_K3Q=u߳>]w#^8XVcڸt 5}2㮉4q-rmWw+^_@[IMx}Ul2``9:  YX^\{B{X8c~2fЛMj.Vב/ &dy- fpP.sA;fO$+/۔W,kǁTh"vCd95yE4\Y噵zFTn9( ;fH8dQB BLύ|.JL[RQH?=?CZv)d~cvj-WؼO흕X7mbewd,, CD/^]J(VbvIv|Ի>02pԦqvҢ[!(Ȳo)_} ]4glpZjU\3~\d:_7(Ť呤\Z+{IfS6gvӵ+#ø4oaR_ }!ϝ0'|o[G BtA1Y h~sKEg˾]}j揎Z\7r^l5o˚E)νgomio_7Nu#I `_:jKa }9@כæ K%}U'NcK8PЃzZ62ydXIotN-yſGds\Ml>ɦ-?!1f\s8ᛊR/M*^O\Ŷ@w_-v F\~$ J$ c92; 꾘 {Y*FIf:ΨN__N~صۓǙzےxiȏ[  SJ/PPUbcOˣ xʱ&=)NCfE'Tȃ:6}R o%xB=+;LL ώR1lj#x-⁚ciႛGIWXGUvhV i׵R;T+Io 3ǥ_'abƱKιx!ߔNVvt%e/UA‹f<>$+?&ZqQWn?`D=9};+&\>tBNb,,d񰙷9 mEFOJ":44fjnmͣKD7&݆!\Am9Džܓ/$OW**^\L'vC*pLHv{|U[o3P&l[-ō| h+&ak >Ri6'uy_m vKXB)[.c0SMaƗzOe74peK xT݆t!FcC.gFA+kriB)zTgBG@s^ ̋(o 8$MX.@&ˆY9Ʒw܋7#Ps˛L% r287ɑ'LslWV3sk7=}Qya@TXeZs?羧X+kY@#qkd`tg]sQ G*XNx_ʽۥN+{EqP,ɚ= endstream endobj 865 0 obj << /Length1 1390 /Length2 6232 /Length3 0 /Length 7184 /Filter /FlateDecode >> stream xڍw4l߷hmĈ=bo޴FR$DػvQ.U#Vժ]5kתaVT{?w\=:'@v#S!GTG j&RH\#`(7-9!rˮQ8:sG:nQqd@>0G0@z$#Pq"a0F@q!`7)0JByȉ ݽHg%>A/ 0zA>PGq`wɁ3) FB8 {P$W`08q @`8w8ܠCM=a%9ݼxv9n T1q5 @y {~M(+ npG5;"՟: ඎ}p/ wt59 V"G E$A , !."a<Ը='@CPHoh6["8 ('';N u#n CA8@>lqrD0\s5-S#mRUEBb $ **+ ?p'@O-an/bC,m@ KCoGan8zpGoWKCamFqP;D& u4 .Go`n08DAXq=^8<6AqwI 8]bR0 Ɛ'IEq4t# " Gp!x'}JDp/oWG[A F"q \[ EC!S|ăڈ*7|V'+Ogާi|UaK*i]5x?o6Ց>l~lg]kQƞMoo2S^ 8 u%lo{zPB|[6.jjxJJl\(<&=!g%t ? ڼK6dbeēI 31f.f+[GƸUuO(^B˘dl*b`}n/3!v\Ry%7&/Aإt-QsU;7Vꆅ64(KPZ +nro~Q~47F%dira5mޏxB`d5R)sc[WɥD=$:?*D> ͚a~,`\Ag?9˷y(_vL\e8}p'{NX|`6/43.yr>85+]qu\I:Z);i1z >)ÝnIХfȼi9mKcDm^'3oM#@ibIݘKxàE2pbxTրDxG$Ɂ I@O[]^nzQ,C͆ڄE &jkBNGZv2I_77\>{ ,?f6ʮb[>٩nȧ|$BqMџPQ<4z$jእr)_ YgٝgnS LJOηމN5va)ɔ Z+}܇vez__Zzu~fOQ'O赽yQ6v/VD$)837D\FXoqY2]HliwG*_|RgsJPzsL>QIӷ&Idq$A|4$ >W43l^Yo粌낰W^sM%a\o¼\FKD6)_XLTT]OoTv!n:W5 S Xq<%=?.E^՞a㺭 &33٧v2ۨ_UAwdh~у?@a`okO޿!UKZp)}-ܵ즚Fv䩦mh&p$"AkFŪ.!'dLeHiF nMl1='IG0^i<10T]*zOEOTE@jUK\{Cv7g]_6%Yzj:/-Szɮ/fh@l rJ&7~T:!-xf6y(#^;\HJibr@^ R-4(2bѹws)K0kITQS^jSs5dT j '8VH, лLŲ' T\`nZùoeLHX$bg~XcUExB/Tl{W:LY8!Rh#۴߼L:30ɘdOی eNrQ]d}[u70ާdUvv(ӝJUK+K=ge.BQ cEFr ηdkI[lEGTA~{>9 y{OZǸF!QD7zK5ed&=zD`yj$IRrE8vM\+l_yJk@Zo|kr0+==+9UaW4TlvZ~q[D oSI$@gEʷXaJs3n;zKh=yo衵UTXjɗȶL?dBU5_2i%JwwZܛOy0~DIђxhmυ]^fty:p 9]o>PmyqT֠;dsc]CrH>J_fP\O0߇[1&P*ýdP4w݈Ǭ^&ukr>O =٣~# H2k{f  ;0.Lx}x7mf"|+svv=ӏ:M*2^QGmS ]@yF7GNIpήeQU㲯w0-b+?GD/OU9n_(:]/Z~\{K[." 7oHIޥl^Mi;DRL}S g}yONY%)M!ܼ;e'@e>94y{_DmDyPB1)zK?LY VG_ֳ-+gO D"-V~ެFvWͧi <"&4jt"4V(źMW>!PQ W9&\אIG96Pӏ|'p\J$}ǹ1p^z N/By BYauNO))0IAJ\5{H댑t3ӿªu8Z|(G^CqOf͜ IԕenpGn« eJV?3lR>z4yS'#sHt_yk<׏f:f&YQm 09V>V,Ff#!prkѨ goZi5D3Iv~+OL+JspOm =/9DŽOe.<l֊1[|aLzHK~\-`Wcjb.ΐlU\ 4ddl DaBGKy3jV4&(]YV)hG?({ެv÷iBcZi[Z:2ͽ #eLJH-E~{Ȋv dO*)kG;il.)FץiJ0W`Yd.qY{V-∫g\FE{scNE,̉ ~}ĥSݶj_Mu`t1Rsu&BB?|l}bjJqP{֡_-]Z& !0it' C-'j)c3CZW  p6|]I.RP!Vèmz{eUCzNpp3z'K+F.Y?Xz f|*3E-P6yrۊoѿ >"a;R6C_ʿ]ˌm$<>WsCT<ڂqR%jkЖA1Q|6tag"-$&YG6oTb U#o# L4 US$GhVI%@Ze$vzY7ioÜ8:ބnEh޾h3Z^8Z\aDB_լܰ4hƂ" C$l֫T=>giVP2Աn1HQک,>|^])P2>Xulax)%Y. B{LJ:!T 2w'v2W&7M% 8 SZ~#ᕺµ9s+rQ6P] zdoh&,f SMgLKl=+CMSjpZS-L;\.7?ȴ=hDr-@s5re' ʚ5)N:'|ůJV sC7k,7o nD8`k_RxvۭMs.xTaѶ$ҙ{]=*H57793_M/wThsFޗ[eꥳ!NH`yUs> stream xڍwT7KZF) 16 D)$QBi. PR?=9{sv_7>22Qv850hD, T7` sA|X/$-X8Ԡ8> vBā)Y, eՠ>H'(P{T1X @~"##-c0(ŹQaPw)_|}}E(/Q YA@ĹM^p +](hb8_(H7F;@@Sm=GY0!e aPP? D @C =QNE;R{aP(W8l +;/B h'U GSCb0|AHW N s49q@I0,-=p? s3o!?8DS#p qXoxp{@NHwFxpğ=XO<{eM L~'HE IP#((j̟`UO>uۗX8ۀ%0MoAGBQHwxz'ߪ?wBz[g@w^H?sC?sGF/ (K*a~MBw@~ ~ 18 ^0~S =UÿI1  BAaX|$d e^\cӏGG{{ &&;MC| }~p`ruwl"K#|KD'T$/3#fʩm48VD'7' /5&~|\A.btt;܍fOTFy5:JƗ_J钟~y`o^4ʗl'A*HG=?B=x$^ ^h='h,`L̫Śhozjӧ/6ޅ[l5CȤI7_)vq-;75c*Ҟ/ VxJ.Bi69Jj_s7>V=~¸ */w#s{ʇSaSs%+ DiLA_ҁ "gqs!KZa dN:ve5X. oFVX? Ÿ6~\'$v.l;v;_80f,6vu[{r\oRA ti5ġ )KΘͤ1֞׎ț.pæJcjz ܤ#zaF7N$x ݒ\ƶ:dԴ `H7Xl NEuO~n}yA5!Иt?]-AU6WX??;lp$w`k9*4Vt5x$0qczɅ@I#6##m*}~nTm~J_ލNg[HmXwQ#iI8aÛl8ws7.vpW^v!gk qg4l|jQrP 6UZ'w&~_K+nnckb}cGW V= C10×7fz]ХGPNs^q*> V7\Q=,a_߰|LӢ:9Iߔj[iȔ-.oG  &|Rv%E#m?ލ4*LbUy=[h=(c')&S}~jb8|Q!pYMX`L 7:'m_*:2G,B(~,~:ZF(7jm# x"^x~iMꜨ2v՗<5" lWf̜;M) AIݶu'P[&&aro7ĸ6Rk7}hcGzD6ayH5eJD.eq<)40x:ֲ')u|)E8n/6Y9!IR<;T3~]2#=$'9!=)z2Z{۬axj`Y}4b~`;Pzv1@2jN뤚 b']zp߶BU*{>9rYp7Z{ސ5i@Oq ;f虭 \q& tGS)ӭ;8+kScIűƺkɁ5^/WQ6޴v.]J'ks^~'_]v<֏A'QiaԒץ5tr̬' O 11&~( ze~_`#Ryu8*,bzɞF?nuApXtOtpGIh&nX1H^X+ƒ˾J߆C[~qll0-3eW ӧzdTْpJ}!Eсs[gK{JxkH= ոv +MJS(Q(g:_;P% FiH%偏-0EbcEy9-Iͥ;Ba5 hC#k֏Q,8%lԴ|eZ9FCs;A'9'`&s'OM,]wn[fm_j4cjZW3#j"8i?4Rt'GkiCgq%,kYٱc@YVN,j05$c֙v³&s˺8i!ik/zd$G?wV,kW΅.')+CԆӾGO~_jZ;dkj0MNux*_kb'^ڔ}B7zk'o \&~Hs9]TžR9-W#x!MpXa墢Px6,svwHgN"e/{WVJG]Œ%4oN*_YxRYToQ9RmC[ hu=9U1}fRq}3xV93AHd='](kE#E7 8MmY+Vmܕ} "(v<@05g# jيF[!LnOݸDҸ7{_>FG13+0< JzHq+t` hi*~.FI S;>ta~':q{|FCW~&;%5G]QLWX< ԾDzY0(072>Ǎ&}2BlnE6w\fM;wqo f[q:|7U(OrLeZ*q75WN*~,ܛnG%Ҿ6'+N&8zH"MR2#0*2rrмDb3,8wjLڭz]fXzc~A2?0kbh˼GV“†gga!,ANnbM[gK֒ { G$O;3y\LL!$5StO=0*zmH>s39lPFA`T>" _漦kHC6Gtz_|b4-pGU8#F0/ny6 ҵֻ_Mk&#i]؞^ٷE.zƻQvg?z՞,v˜/S*Y;~HHd(>̑ Ѡ;و/ޗ ~*=LM_D;K]n_\qxqP=j cNI?R5Zq!. 5=/_/ L>;!]()QhW~]dϏb{aYzNZ44_4u(9~x 3zXYy־oC1fO \xlrP&ByԿDT VF{R,jtlj3EzCߡiRx{CPb6 1vxHsׅM``Q0d6캎ɖu3Jx@rPI5FD0Ϙ3 TmO,v5.kx[柗Бu(޸PP=pҚII]ә|7nX+N.1SOF')jo_,Pz؍iNL2&=d<(laW#36oi ]/q㬉CuGIUAt=|?O 34 Yh㍜;DKcmFKVL /zs_h3+q#+D.^X qUGkLy,:[Gy?k 1.!KowM D3J22oi>AfQ"w/Kj;Z}E:LE8b!-C_fr>ENŜ_[5'׷ll79L|ZoE1p?YCL¾3k9?1-W8^xZ2m3su u IU-Ob-gG'nptW(־d}0jRRVaY(FND}jpʃ78ah lȟdQXyޔ"(d2yn>?޻m^ 1ĵ:zU$Ņ^i&G0qWY$ *]ɐ.-EUmF2?xBA؈JwC,냤 7=" DS~/ns;O[H?Yn ymvf uIz2(O6!og (RWL;GǨ*8ɉVk`K>J!i-"3p(){S!*gv~$qtPqcШmzWE4tD.ȯ] ./IH֋0?}"j00P<}uTW\+_t0,"|Gt18)pڠ,Fjʴ,fېe 90(r.'Y1&|d'jXxI E 3 O2Ũ"R4]΄ih:RdUYa  )vHq-mp7loJd:q7Β.$~"E+R,8Z" m3Y\ @,",L7'[Ov&Zou3ge[+E@(„^gl1Wv Mkl~lщD/5)?A"j4%RoܝRk%@y Q N$Użtqwi(iE %?ۦxͷ'6Y]}/7҂}#  Yg.JkԻ. :NLWǬio8 |"f[f :Wl>DUy-nTvn ) ^[|T% M!_HT(=aʌtmEzT=uyp3 d>H,>|~žz=1<i(钕 5ffR|?N`48ҝ)F` M\^ cq'CxhMbrt#@KPyq->V%R}uޛk^z,`V۲bwPM*!Nd@qo$dbzmE{ ksRIq맻 / *o!|(D& GTn?̤U2m$l ~ha*wn\#hjlWbd'B {cg2a=ieBE@ON!#ůns{}o!9EG+(Rm 9a1J9g\Q'H:r,^B%Tݜ)܅CRsbAb/x nt骒jgb[A[Hebv$b[lx2'i/yD/u.#GR(${?fxBc\~HvmsR+B?:z'az;n=c:Pu.'~F𤠡h2 28 ؐTk; S.kp2zxֱ.1;-<78BP207e҉>kV8pYijW{ЖJ팒=nr9*9;u<,s%_cGv$ ώλv*yƓywǮ- Ox9D2u+^"%˿V}F>`5GLJZZ-PK$7.v /".~)mM>>"݌?y',yj"Y,gw8+'Ȗ_'t\Ҝb8yi8}cN]N` LBGkʯW'4z6ZO/n`tH:x^7eMoJw'ש06&M.qe#uP432+Iґr'fABaw\euVNOIe{c0R(E(}{>eR p9uhjI*1ާ_Yqp"~U1"d@ sbi_(~3ִRMDǣ #a ;VF uHU6)IvvE2^S{ߊs}'K$jW]zV ^*Z3I=C]5)8go";6LiĢ rv DB^x(q*d]T|z97iaEv="m&{@ст .R’Nafw ].=^T AsqIѦu!e;O9R. ܒK22O%Y2 j^_o,]\痓6j5""f(M E_1AYș#WX6Ttn[0y~OsS_:9ia|,5s=&[o]+H ED}\I=/DIi #|v2~q"BO9_@57# zBWFԱ+V֤cNN^$oU/ #r\k_5p˧~~Lb)J(WjE@x^> stream xڍTT]AJdR@S$`a[%E@I锖nF@@;{׺wZ<{>L:\Rps<rdԴxyyyt!H(ǤvB@08AH& B03D¢>^^D %@ xL2pw' uʿV 6PDD;@j u Ё[@H`}jD:𸺺rp'glW F\_A߅q1tm ? rPb!P0Ku6@GI1Vc j@n+daw!0k hȫr#ݐ!A. d28 /:F@*ur0K=DO@ݺ;0?k+W .^``ӵ6!&tDɪن`P\ [G@3f&F',懳8 Xm=ǥu G1 "I"sq%@ *趌/.>FAtαf# iwb4@\&J ,֛'~M>|/n ji}]gГƧljmAkOq/aF |M#,ְ }}d`5(P>F[-4M3o˚o X?N%퀟V3³&19 DYEѳIA 0ǻ'@>[hwh gseG%Uf= iɩ_- 'ОUvt}@8GbJ} tmԲ0F<N~[MݚU=l,1 !$F:'Tbp- !܁ck~ic0'{IDu>2㐴BϔJ"sߨ_X]fӓPF?==f㗶-;aiA55N"ztifsś "Y.yGcKl^*md&xUqT Omk$1٦~"XVeCvɽodv"Sd`<"\"c΄xgLyLԽ/|~pц av'P$4( JA5`LG<^2^:tpz*P`L y::XACw]~ D4m=zK%VuJ٥8_g}Ty|{ 9h[dA2AVoj[5ia"DJt>q\\ |Jz.đF l9/N|>Ek~8RneׂG&5v6Z5֩6/{:$ltt+>:w_xTzwcjAa$[fguPA.p<_@ ly9 7 <[y6lT}h&GßІn'y9cwZo%f7zР%7^CĒ\4ߤVE>_%yrGrβҖR~[:)e7)gxgayB.ֹg{{&HI5GVfj\D:se#S_dhklRFQwS.A.Oܞ_D67t@G 9rEV#d'~=*߻ f[Ag %k[#vqMpg䜭>m3ࠣKc5wr|Hn2THk3ӉF ]*Z>%En޴49"w-;V/Of:95.>Ry_uWgET6CX_jU4]n>?ԓ&gܗSD˿oCP=#O8LnՐȁzM X3tvǩ_ȞNS/kH8%[䗘Niž;EJK)O戻$8wy`2_=o7OLoS>EdDo!r0Hb/ &䎄d68DUb'vB+V|-1խ8 C L'qh w׻U7B]ew6J*2ZVY@D;Ҿݙ` 1Hf`o:f^Z5KbU%ΝZ|m@5`tuEO@  úwG׆4ցz"6K+\z)L+lPYW&z [P=6?ӢK [J޲{*/?Eݝ`;_䐑MF(Ø{+יW_C(Y6\܏l "mûXEt]@(\Ց9&~?y#^ d Oys+&*f}hoj7B1e{*`x AGhB٘ƾ']]Ȅ7w71(_yadZ\eH}wlZJ^D^+o>O<fg`G(!9d~S|?/Z%mG[@KeY[GI&\*n:sT=:Y%:јNj18:GyPp8ErMEz9^Qz zK>-M:kPeFTVbƢ1ۤg2a@vԂ%%2sS-H? #%SG˕'Dɢyc0zq4+D]4Sδ/֎gc-jY'nγJZzkde |j!pm+ <^dq>-sҾjħVGا/Wn#h}fSY=mľ3j=}QD7%c_tl8N0>l4$Y yT0ߴs~[ôOp_,Mh{S?6"ŞMhĘQ+ZS(n:M̌yȦocZ6G_Y,{9mć}[hYBG>3LЙyv`ĪHaAYSz}F͖n6M!Z1ů[\#^1'TCs3Zi$yk2?^D/HkZOnpnɩ4%!!Je# l_vR߉=y^Idžk>hf3lELK)-͈׼xxP=90 SMf& BW[N*} hZyﭦH?@c3NZjTUڼ%.l^t[%>>򌹋*饪r4,8m8>ejtcx*(~ݪ| >-bj]prx\S)nX:^, rza)Cf?niO2siB֟`:{iN@oF aŞ%ZM v9&AL-PRn?=dgX]Z 닇{L%Q iAc{!b/ jwXE*W,qxŢx;1:W-L24a{pXҞY?zpT'+qG)@Yo ^կ>|&WW 6qA{ >Z7C_-Zb!%Fz#Q1mFx|8n|%ՑbY7gCg[_ptϥGwt!=:yj=|M<83"F/&ud+1{\‘bCYCC.ۣ)q3V ,m|G[@mU_«7fDb_o X_yD'_vxIvža~TFr풎h{HH6%U/]g"~V[jBM?eՑdjXAjQP4Ӏ!5T3ACmJ/z7ө躝 @ HGsje7_|lA SIA9)Ox own협&tKȇx&.1lcb(V:,|REV*0lWOY(J@d2ɚ [2LTfIv's:"2?AQf+'J&6c{9av΋jEEtXqQh_87ACA?!{D.fUnU'Y^^~pYJV 7cq `x_fx"w0{ttk o}TO eXEڑtoE*b͊Ŝw`I?mE#lϟW zɎmid"41.4Чے-q΀[I\Snd #¡qFt8oFuS$M=I̚y6UGMZTOu2& sNs0&} vhX.гUcfZAE')sHbgv?4l؇Zd?N7*#ܗ,*QW+Kbni=P>|/:?a"ڶ*pe^Z-8Cg)UYD=-73rY;vŸ GlVw*%D0 |eڏǴ,G5< ߊ(lrn$;M9+zEGEi|BѲOǁm*ۅ뵛G+m'=Wo0g Kk }C. endstream endobj 871 0 obj << /Length1 1751 /Length2 8699 /Length3 0 /Length 9836 /Filter /FlateDecode >> stream xڍP.Lq)(ŽA$8-[qŵ+(R\ t̽[w=M&tZ2P"ȩxxxx00g8& Bd c0:x  xxD6䭽u. ((uu;y~Yd\@`5n s3P ,`0W1nnooo.k.$+ s<@^ [.Zd9=TB` pA'g誨4]A?4u8^.;5uq!;3q! =pk/k ҭ2kxt<<ο{~ [9 ]</_u@!Kv`6l=]!`7O_6p?= z?];x@a=AV a=pd ;`/'s8lg1bnEey]}ZG)+ s8ExBaaA@ѲUǿ|U vP_ XP8sA݌G.,JH=˟ / 8s=a-Pw򿦆?WWd t_  2{89yx`t5 iA=oKt"pjw*@P'(vwń. y[i n.w{ A1VH-Sp# 5DܺH!6@'K'oݟD[/?_0 yps_6< \l/7\OxOg~pCm!T8% 7n#{BMG= +Pxccxm 7Iԍ$(ARZҜm 劈JS>f}9!0mS} [(mdmj\+SdSTŇW{?=LD.ktGBSυ$ue$So kP]X&%!kV7]O4-_SC0{%@{<37tUoG2(h/2N\(2R8Uɷm׎U^UN%#'=`$xž3ԠRx}^zٞ8xyz;ÙV,H QǁF1欴f:=[PZςNe c&Q? [c(fի#(E5ϒeUfU?ZӲHguQtҖKs0q-9FHspHmdTn,+2WKmUFX7a>I41!GcZ*MvS~4,<>K6-l_iSc,>TH%xŜjW0C3~eӡf+bĪGntF)Z&vidX&kx3v5#+pw):~o /.GX;||S䟙%6~x;g,wỾUo9R;_+mImP1>QzpҔ =U%H)̱U]'uBɆ#d};"i;<ڙ,X[c_ nV_i$ ҥ/OO{@ЍƔ<_-fmd&6Lwҿ 4F ΟOg6 .q\S–_!=("V䚿yi|ߣW |Zz-?ϼP475{^=NFRyp!ߺ{Ľ?sx:l !܏sSߜڀIx@{aN< Ǯ1&wm2#QM6ɗdv^u"xLQҊfk.*KJ>E* 'gNBx4W H{.DzJ$m}CZ \FvlMˍ'_$,vd=CyU/Jn={#y(# JvF4n}zA%XzMX:yn[xt@%Y^D?Ucܵ <ʼncS|6o.W) IϞn&-a1#}dd \$qH[~-5ׂ'k1&*wᩚA.DSDG\VI+,k߁(v\{h+ЂCY4Vˎ#FǢPv' U{qiZ՗- =A>7J %\SXߕ~V| oJ 鳣#}B6UɅʽ:#" l`RqyV҈KlLzʙ~@Ny6WB2s Olh%]C\'0(gF6'HVR[ܠVݢGH Eh<*jfS9EH2Pwh󍩡774+쯁85 _2y<"JgٍXjT#[d%Cq|Ѽro$OjE8XBՓ.6u1$~lS/-t+3 "Zy;Q{ּ8iemB X@w f&>,ωɉ\ఎhVxW^0]|?+v]Anf4f91œ*TnYd_ 2)=CBhE. L~zPC\ηM$͇9oϘH~=ÞS.9sKU𹐳O]mn>cٮb_IWFשM~i'[^{qb dJᎡQKRԁ4?Ϝ"`jM=Pj"[I Qw.z^"ǟx=QW԰c%-9WVk_9YE ,w%-X-Mn^Luc7r_5ZL</_~nC̐\ߋ6^і8J,m Fta"֦T>^q ҵNmXĬQ/)ͽ10I_9]!JBgۡҴ'f7Tj!aZL0.ⵧxwߚ>릥{u>\ɽly;E^HGr|89|լașǷ0 ͥJ !5ؼ`x ixE{5~ɻj&}ЬŊa߽chzqrJ[x o[zb_)U,9.CUH + `MAΎͧ̇' ^i.'SDpŽM91&ɀjbhbP:.G5`qX5J[5KчsOh "\?Pxكzإ F19^kI@/1TĤaPu58|r.%_4%C J*ǍS?/k\XQ:z,EJ>|FIq> c6J%eWn8AEϴ2?si$>{@\bKEkj~Jx-.SaP+WXQ J6=訅+u^Cg*75=R\B;Q"G,S'=û a|KMT/ V܃%_՛@yR}#s-OhvcJmN{0~~{Pey|v2}F_Yo:EWt1zJ7lXi˲jXĂE;"W>CQIwK~XdkcGceD@}YEQSy|c&eƯgAh)f>Su>%yUw"Q&ʰMf^!p:r$ M c~W3&Q[knsX4íNLO :8nDyY]%~<Cc04ZdmʥCu!B b$&Dzom4#̗|0 yo 5ȫhEeK{ەdzfە\RaiEYiA1g;v "а*p `3)tM Q4tnMlOMnE[Za:dN7cz=!DG$33ѺBC$ogw lk!bd}>0'%3B|ζV"zɏ\,(HhΕ:4K*&5QԺاjHy.ywbtqXrw."0cUܥJMPZu#íJZJٌ&8"8)Y?'®hڪn4Gڮn/x&WR-Dn %w{xg-UxkhD%|]*M=C7jOl;HܵD3 Cȅp }tOp2Х+Ķ>ʿtZe6l]wג/*䄈XbBQhyo#Z>VllD CirqBЩ3Qz* PMcnsV+DBUU{vݺylR=Nz_te_fPU8zx-nFߊ]uTlVpMtVeԲn,3CF&$wXEIZ?UOSa䝧OĈ @Jyyv`UOp71F*BlK*f;'&H?r6?׌o- 㩢_=z_ : D<"'(fMtq?8w,jc A(gHa8$H=h-΍j^J65}h_UJt'v۔% u8/^K!{ҍfvidi2m]M򱠰uyՌcX-xv}櫔͙E GՔ^}ůEE{-TU:͸/Zv(B4VQrYGe&ByG4[>}Yv9xyP-OjRGI~c 9 X%:.K(! >=>sd7' )foHw@yHD=@3rE+2q4'<)~ My90C%1[#zǛsS;D ?Lإf WRXtG6GaC?cUZBu_mLPAK %e)dEpAml9d&q8G&,eƥ Զ]|^rxsgX$V}gR j44Y"O~lR"ŗd׎t?bź;Y,ybҤѦ{fH"Ҩ%㗓&}oQ:o.e4NpϮV9M:Fj5mЌ/X> Y0RWZ.Shf}ͦ0X#`]ڏ㧻*yoe=Ohhyiȕ%23X=3?ҹ((@?Rj׼f'lL i1$Flpp7x8bSssOv*5c_(z!zjcwmK}&g3L'%I҆Htedfhib2d[>+q 6QAtƴj#hz D6>$[9jhqpXk`ӥ]W3PjW!16ӫ4BC 7_{ [OyGjxK|U@ͩcH~kZidpX` %ףyR j n$wf{K2xS $P$DK^F,2"V T2YG޿lj+!B?v:={2z .|h&GJwhcِFNL}O+eyz9(9#8xG[nNj꧆ƀ6PE㪐k/6]=Kѳv%H-6ҬKU|ee]قN{Fhe2UMTM` ɭpyFXF{/J +'~=dS|ƚhu^E~Ԥ-98Q9%٣kAwgM! "j.QiF'l6F*ԻoR$āt,GR9{=|ǯFV.Ҋg>xSe6 endstream endobj 873 0 obj << /Length1 1388 /Length2 6114 /Length3 0 /Length 7071 /Filter /FlateDecode >> stream xڍvTݶ-H ɇ AK$BI ޛҫ (&JRDtU@)JGs㽑1Z{k2}FaDr.TŅ`1k׌Xg_=F/*05E;΀8 *%'*-b`쿈hD]ap'v mDeeAei C0-m?J;`r""^^^0wa4BbC;㉀`.? _p( Eq(86Z:+ *,rB~'lm.0e!0 `(/"ˇyΰ8a w"n B]!Qp_C=\En-D$RRR @x:*o&sEv!H;DsE.* X>"Ou]> q^frCTZ7L d%$Q @ZVg RPvh@OSWÞ7CDq $&)77;;a.Hgf=8q.@7dz8忣ZX({D%p iHvGze{|d;l_6` ̇S$'#[Ȁ0 ť;4׵$IDĝ/{z`08FؒOMmo;V7W*{ /D%vEJb&stHhX?|,z0<.xۢ=3d.v6OkYeWo+p4e$NsB)k/~n.@!-w;6N9eR)7"Ԃ62jQY!FV=&3p_^04>:iVaPm)h5Kel\=]hxMuF[d3Զ4fqSnw^89F4ǫsFj+ҎٙgԜ"3ǢۋQApc\?,ZL'}O+O'jU2danޝ160z#,͙/=u^(áp9s4epzvX?ov}ߩ!OM5:hH@&w_U5tz>8hyei=6!b ?ySxGPw^h#Py@_HRڙ~M0$ePf":v``. qW$gOS9Jr5_ l`/az>.Gy8 종WFІƶ@4Zbl߾ҼaW[ZEs,n޻V~!Iv,}tQΤ;28me8y dYRTOQ)l~@٘zHTab N'M%ukѭoR !yϺS.R{):cyU-ݤCqf `9Åod J{fQخ'u <191mnE >D϶,8 v?nqY0.f3}-%z+TA=Ƿe9)WlJn0Ze&z}6oB,hg\U.x:bLv/-6[{b]EfUt\2].6z&tYDxJ'etI#l[zMC <#!=ho LQ}SC졘iHHfau%h_ϹŐTՎ.ӢuWv.,q 5STTXZNE U}}}'Ήk8-yޤ@^nS-kҟ&CA =)fPfC$k GWn~jRRxfF՝jw5tn'=!lC g74: F{ NuҘgoN,;zSzX| P'\1Ӳ`{:U5 S8g!ȦCZ'{ע~ /gT i [ӊu{2| k$=Zjg7[ܭPa~I1O$J4s2qwz&ehI1^BVSԒb3m{42f/Q!W_c W2@OZH  [ۊS9M=qTO9|m3ql볹sϨ Qxmd9^l@\#wYcE\ 6 gp(2ݚÕb;P։4qxJ V'2Q H&žmNj쪍[1 pZo5M3hԀt 1v#W`K}e\7fz5IF sΣCǼŬY #^<4V-(C6Ge e[dCHF5SCM%'_>4oװڣXUP",v[A9"G%HjtVTO`u-*k5lC{ .O_IW=( ^Tҷ:=XIskE\JE;zq n(MoP1ASú~n}_m6J[ؔK8tO!藅tf Y'ީ^>cdOIKR&abNGVyw^X.S-)zs$xt1͔Fu!RV㨼 v M#;u-nl-QG\Dg!E4H4U::)zXI,?_λ89iX9P͋0/#;/kzN|ص ibxNYi \ /#.*@1pV)qx.Mtbr>ɍIB%BVgS_Vd8iY[ 3]֦~5x"#6 /wo%0hn*AYi>gYy}eA 2t%evIɡMzG-=mZyS6B'bD ny;ϜMeЫ?_p=X3^z}2ǫ]{Fp}uL~W9f9apz6gKQ t1+>rUɰ{M[sMTwZqp,S]X旑ewNfNMgX ٍ$( 0,^w,=8ȎnDqVR~;wT֯n6ӋTzM iA Ƨ)ْϩ JL!I婞&wTZ/{C xu=V=.0SkʂڕL2<Ռ٤Y^{ #iJʓO5\*K/E< ƙxF>}M| F`^wGY2TOǜI=Wc|(eetnjoŊ&) t &M$, N^[&Hm| GƴCg@maki,b4 23,=Ω#?;&謞Fr:̣;o~mjSijv̌V6x\@ԥqL2]/)b[/(卮kWx׹Z "?ߊ;voċRFK5h̯ukÅYKOHTIjKP dHݔO 0^m5Mgw 7k9~ ̄p;pRIam,@/;FuKz<0:|׌BqB|)^1U?^E&dob=_ B>Ti՘H,FF$2:53QczӾ.|JSi"J:uP'XgX|I/clq|/"v-+>96<~9{!lZΜ*QOƲ~ę1s}?xԤʸx*!b/jfVzf·ϐlT"Veui7+lo\~L`N$rVe j#֮ڟL͂l~KI~~]j ^]yPߝ&.6ޒɜ ~cLO+p7%=h[7cȴNW/YbJf(@&#xkO JgaRҲ7 V&KgžH}#xkaLL ðB!d%.V[2]CerSeC*DGib53Hʿ^8d?6wyx]o?v`[uM2tHgr'`&Šg_4.%}.X<HHuue"u{:ʏٛ9I/6,b McXd}MLzcA=mt卡[tV6W^񧖍^'vx@سZN0k噡BǺWLK=^e1DޣDbw;p򧓣{=»/'Er*^]5Sws% *$[\/=Vۛ-[=[BHuD`CAK o248Tg1A $辣_HwZkr\_0Z9.zȃ(luH,ǗWhsW[GS:BrDYFORt?gnZM J oSbbBEaa}m]Hj7G܈u%!ݼbr?~˭r=qꐧW&*JD☎d!^TΨeǎwydfVn$T^J.S_vn+4%K0||/AUӊd4~ITfqj8aZԢs0K骵%ܒBa{ M-"eQH>E]>KDCVS2g 4xJ1IOxd Z۶79/vLD_˚p_0^(w'03ګ#⃗i=KC^IS|/,N\": )g'Qrnb.Pi㡱ax ,>d <AYV3I;~M2Q%ɉ+{Т!a̒$O:nm JRF endstream endobj 875 0 obj << /Length1 1392 /Length2 6172 /Length3 0 /Length 7136 /Filter /FlateDecode >> stream xڍvP-ҫ4P{P$@$@B EP (] UT:(~{}oL;kq*pu4 + *z&w 3E`]a >sF/cP,F=]` XJ,-A rU(8O@89c JN(!( :Ñ3&'& "1@MA7 0c^p}(g2 P8"( >{Ltnp@U up@#ݠ(pD@VE~4>EBߝCJF(~a<nX p5د2SVCTH$POw;Nͺ( G k RKCX$+%%) >bʛ࿃_0~?7?<Pa^p\Q ;!P@Ax_? FC}b&wLYJ*. ! RPhf޿_oYK- ۀ [SoUnHwXwCW_^XxjY=8  eQ$$G`>p!G1p_NsEh ׫W o/r@~L"zx@q !G緐b@Og 8=(~]+D Gaq ^+bnBveo_}Sh7U*y.-4G `?9뒦k+ʮN g~4cӖp6E3KUyK4n: }tjWFv7-&NC%˗5cdH:6lRv:a.l+iZfʍѬ?q_c̼L騐* e`eKfeԮ+CT^&q"CgUc`vvw $~"Rf劍 ȉ{ɫCYsOC 2X.UZoY A0Wld w]CSgq( ƒ>_f6regۅoI3_^aޕO\ɨzPCJqIHc!գN}m3K$@jw>\=yw2.My 2FG/Mߺ9F܊mP HHւja-oӚ8U6Vn{m>B 6)KvV=Y2)L(7D9,|dM'B|dAE#7%kL.=+zYD0a-%P3vYM~ݍ =PNyM}1>9ȫߨQ߈nK2IpV,qx vveOss |%+ͅ"jphpe.3G=7 >qBiξݽvi!Ctڜ:cX MӴynÜL1{sʢ` b8A~ΰӻL.E''/55ч m.vF1pmQi3![fck9cX=)!U2Cb6 fכ?݇]d W8tkR# =E"omugQ'M+`4fЯZ d&(k i.g$#.<7Rб7zbѰ͹fzG.T.m{.ʷbw+V=c5`Jϫ)%& K"ͩ;R8b~=VL8^jLBbKJV/=bY>EP]F؀/ alf <[?EV#&;eP",O,RAq`824^4bN8 e7R`)-,o]J G2.ҫ`3c(c_JM=!OuAÉY5B:1}l!ǏBu@SSwU d.+ch &|4I"al:6-[exAU{)t|Ư7sD=!UG(-Abr~ߏ8#lB*hp *Q4^kZ՗YF2*ͭbHyNfk59RZݹ\Ǟ(Y(W J9$)"CeBS.K`'='Sz =jz9zSK^"ɂ38}g;A4l=(qyF%^;h|#0oyYSwk 젻&MjD\F-0+4]|=/~L P*^gUqQ!:[Bzfd5q2PKM渔|7! ataS%ŷzj~os(y\"u_41Z_d1a ͓BTdg fP$&*L9P(Ё[[uIr'Usħ9KP)PdQwe'-ٮڵޗ{~ܛq2F8 ^IR[ZUŢ42J[X-Iz]a)&"YVTŹ˴T 7cގmm=K}:mVөE;q.pE բ&>e+k1 z!qc^qIeubvټ^9 Pj H0kF=D̿:W ML$C~t{ݓ8s !k1h3L7z'L٫V|oÁ, C@OFv41f>j6<ǻRI.VAVeV'o?/O &#wΒ+tyA凯D'/*_a?V{g(I%j%0Kڽ@BZ-sFlZ2NI>496~ޥt3=shDz;$I?oa>o|^ahi6Q|[SZ6xUn-jYL,X?#iy LtzijF.z+u0>X[GViI@y%ؘ9F( mpo"s2I+'~ 'bz*Hf<6=y#wW=g-Z&߉Z'؎/CڣsBGeJ}ks|}i)#Ƿdmr[1:}@LNBBm aoKawh`GKxDw(bFwk0  i_l"%qzꕆ>䤪KTsj{KudHt/j&ٷozMb׌LL[ {X/t| Ð1.}Τ~Z^槵 s!a145@wޔQpWUgȹFE;MMHѳE|{NaOJc?K{g=eQd`3>JYwD 1M>W?Wn J*;ƤNmu-B e,rUU6JPjA$EPR^NqFP9Bg[.Ԫk,ֶaF^3e9cw-wfyVޢ[y봎j5CP1yF킉7@XHa{yYfatVd؂(gn&q[ջg̪6/K5Xa9jK9Ʀo$ 3K|0 ̰0V{W|`uYD'~tR7狫xfg88W|;Kz>|K+Ph-K#iwuBMX:|Y|<-qu, (zi3G#)qw"&==*g|۟5ܢYrX}[`&InVYXW#ЙඅEzM 6m;6 7/&% 2auc8HiqX [Q?!%SBGA͜1*=y j` Q;7b$!] 4c N N([W1_@*zJ|ĜIz=m]C\J鋂͠b˟]դsmnj[qܪ!L%gB䡒=.?>?;I U2VXEtёQ~u>!O|mV6*.(-*ojsgBXR~͌jyr~Ό%V tmT|[#F"ͻ~i%w[پ+1!٥95 Tjv[u*lkVYOkJu9u7E;҄?Vj(I9[%z+~wcR@!5/NQC4zn%xl=\Qe&[b!LZ0N@ӅPJѴb.?q#bQ2~48ZWI  9'dreR'\?dZ endstream endobj 877 0 obj << /Length1 1491 /Length2 6933 /Length3 0 /Length 7948 /Filter /FlateDecode >> stream xڍtTk6]%!ݍ0 0 Cw#%!]"% H# !)݂t"|Yg_{~XtydV%8 '7 @`6C I/<B0ӄjn~A@O?D8BrZ4yjpĕM셀!Q>u ` BAP'A}8 Az+,zxx\y[i·(q !ր_ @N? 젮p} P# "`u8@_U !k!<5?/  N f :BJHOCfrtA # E]9$ =W0tu:j+ jʊ0kyt%Us0/ Մ3 QUl!H0x퀿x9C~;|T? G r7v"XCH #'; QzP%/k8j)qo/  bA*XU  ZԘS_k98ΥGG||`ԃ[Co %.Hp^PuC@ZS Vb uso*ZY-J~PW. 00מ @ȋ%'aa?j!! HTգ ub/%P9ouu@]8( kQ39Aan :#B @%-Iko/WlRMdmOZ*Hhl9z\4> 2a͎=!hrB}՞(yʬ[.0f:?QE+)lwi.OFtzД'%.îQ&h[f+W*Ǒ"%`9%S:O/B5;#c+X|:V{?&gբQ鳸6P>Eo85V01}$DLcwC*Uº|*=Wnѭx~h N8 ːsF,]ObL%?y-8Vc7ߋϡ6HwQ1;_(`ixw_Tğ2f23~9A^5hZ2o3$%ᙬ'=Ġ#aW_B=T Ͷ,xa\ހXfN< ^5ƒ z.-5%(%-(M{ z 74q0>RC1K{irYF <NJ;=9jJF!G:@CmO?c`:{ahajJr5zIG~Ho5P{Lwumd8NR~ZPל679 ֧bj6(eL?XwG\Tq-đKԻv|g.bQ<u`GwrH9x(%E$%]&9?%w`gJH mtrc QFqzK.qE5W3_YAelv^O_2ypP@Ŝ@+3J\'\0֕QP7*`׳F6<拭Hq37oWT`e E@ZxftlOa(!Og!&A>9T= 0> (.+?tfǓ9d,R8Br*.12ROPj̘lFcU4_w2'ޔo N>D 4X"/s0d'Q@I{Yo1 .mXnޡo+%<.R? n玜n"~7iH#7g74=Z+罁!١Ee'„rO`a杔R"!C+J欙3KXF/rQ;L\eU2Zf^ysP42Req@z_6̘b3d*-¾;>%,YF,wj:ZS/g!_% 2 ɹخ~'%W:S1vGOGrC$5D\:[_S[y9o2~VՓeTUbf} ϼŵ Z4IJkLp۪ԋ\@nv琄OtNlå Wev~">"1(E֜p 5j' ~ben(c3QZN<\)whJpR^Ip#卟1mS9*ރ{ΗRwbY^MJw2l <Oq)iHEҬVh@i.adzuV 68|uxz+^8Ckˇ>oӕ[I%evUi9-U6Ac+|JDUj~ [hmE=gdUhx}4x3`݌=[6%)38Mf -{-Ŏ["u[¡眦JD./&pC|,2:C /:wfP6: nW>zLFuOUWm}&\m<߄ FK5Bdor&4aF묯e{dh m*]`9d2{`%^8ϴ~9Tt݇Jx*r.2&#7]Ze9I+cDi Lj ;w5lj~5nʦ_eLY-{VcҮg-:0aXpU$M,JVƒRnƓm\(a7Ina3gEnaMW̬*nX.vg\8Rbc2X@ 1m M1mmE@Ҹ7w"ct汓G[=z o7;>aoױ_X pntQ2?ڨ \>V3S`+c˟$UcUmy7Drl=3o~?jʲH933U)VEz8'*nNF|ךUegyB__-oD8ph`W,4.:P:.w)^X<gph;덟[2W2,Voc~cs׬ YsAa-%Q st9zPKJ[oW÷DZic"c]G;$:ͺ Jޓc'ʫ4mtPc'FYLg:Cyq_mrۙF(u++ZD (2zڅbkT(Qt$zp֋+hAb%B h1GlA!d@3jf-)yK +flI{ !&>.pcsta5໪M Y@ZMsgP%xe |dkz/  9|F4*%n'ef͏v7^ЯZ[OgݳuPM7G[7WǃFkꉒL7$Gͯo>*F0noD|?x$2ԓ% i^y)\<4FR=i!ӾZE%?~7<[Z;&ySNG꿙p w>YK?a@2X%(k2o-nHKS(؎q >(|9tw%dbEI)g>[x 1@T>"thcv'>8JUPmZpmy.׳\]R.Y"ej˽iy;:_th:Ӓ4XiKcyX7UYUg0 U$-bڣ[E<R w)./:TvvOu^E|э^$}*ڗn]Z`x<¹jQYv$,犬͑'zm)]6{܍ -1ɭ\#=mcWssX5zu[L0sĘC~≂brRC"bř &3|[H%Ȏ4FK{Lq%tjB?MVjgXmnSERYH5Q ZWWR}L  gZY{RFʲvbjJAA:EFrkLJ$r oThٝvua>s gj'U<3{ϒ<+ K1ҟ9a>wUkh ^bV*)e7''Gqʏ0uXvFX`\^Eܼ0{J2C=4eϸYu|dPg j㓟Ml:o`Gn;ts1v N! }/;M J 5w qzp^j$,]6!yS\|*)*JWMI,"!ޕl:/USӸL&|c7 W?zxֱlYFrUAÒ܎YT͒} =pÓ;O1i9q@M1iL{Ǥc5,~P^4<!Ԟ:]1x|B600NgY! *U LIr?0 %SEIl*bMJ #ͬx8)hJppge00B*JOS 4-TLDhܹO?fA!wwu:bt{O6Zp.|A[nN$ShI.zOZxa8mG!Kb)[G ]vR{mjw Nڲ6вbIOK p$0Wm}*LoɤEڝ9t&1e7v>嵰Q2+d\R4RZ;3KNJ:ޅxR{qoK|-5 \>| b c6Er5RglOf`@.̢$W74гՆ}pm k(/ )1a_+ y7^FRk(_d~5o$^!d-‰r氽[7 C@?xT8}XU,2@4hwwu (Bŏ>wk&Œ TMJCp.[ ל?:*n 3Rf˹VM;`D}rQ)h;dF~C ˡG+<n;U^R?\g&w=w@@9~x > %.t 6y) bam>pc5JhtvʏOF7ţ6I^stqbF 3>ʷtxQ@~R#!Giݻi\h:%)y2Mӆ'؛L A P J,y_?yA vw>qMx P6 㣼XV90ʎQwЇ<)y<\Ôv'G<P'X>XgNXI,V4%j3"t )[g%dwQ2 h'tE%Le]Vyf8 3œ<򨝽})o"QyUlh,)h8hiHs1KhouW7B h'Z\ $"[(Mr@3Nvsޕf',^嗣);>sM}}qYQnq%c! aOfV[-u*թGʯ9Z7z]/.u="R%nSǯ#.V\n'84!Ʃ1V,^ShE䞓wӬMV%!k[3,ޮ$1Ȗ禿X LuBV^j̇#6嶞XsXsP Opc~{p孂mz\ ݾ^ؔ5ftڛԃP Y ]m'ׅg cT8t{fx 5-Lپ ex(u=0w%UfEݮ67 ;n9pbdVE.p s=?2E`N;y˞>H-%Zj1$'lD %j endstream endobj 879 0 obj << /Length1 1440 /Length2 6550 /Length3 0 /Length 7537 /Filter /FlateDecode >> stream xڍuTS[-]"TBHEB @HBTA" H HAzQw{c79gUZ{ϹƤkAB >!~Ai$PPP_PPf8ClPDHeb* 6N>ts ĥ$‚R"Q@; >D"h2 w`  IIIN*¡(j0P8vE0hàu`\<<:}2iٖ4ڵ˗wfAKF-<ջKjcA`d"L]d|-n. 10`bE1.b>YQ, 5/aqJ1t^qz3REr4;*)騼2e'Q?|XaW;R.JN`{ guuXHշnb@tbw<{D`<=gfNSPlpMZU@xov^\r=ʤ$2=! |,%}e2x+v{VVRGB +r>RKgZny?:-!O1Вuq9{lt@:D2!X -ۅhvUB J7_vXޏwsxW4տ#~8y WNU*ͽO~փ |_G:o>CyW|q}, %:C:t`Iw] aGW}"EAsQ#w,ޛGy݂@vA61FAOd%ʄ>W_1c&Cuj6>!DxKtO߻G[T5xg2 1Z#ȍy9A}ق!?Dd=!MbQNCdyҋIG;JMztC3A箋wȞpS.:Kx ڳV Q7?u#fKP0Óiem3qs(<=*w3(1w@vD:+L&?O<_͡-uxA#b54Ű-3|} ݹcn\ȫd=փ~ 2nlsN}^<+~FMQ:pݥd=THhЍG. ցkad0 巬_<<+G0墧walt[~B{̓'Yقš"υPM&C-I,?_{5D3(M2|SyU4Ɓ{&(*fzOk`!VDq5qDWR1qX`3LcX ฅ7}GUh0CJ 2=va;O\h5hj^f+qztGԡ4G,η?rnl{RCStGݜ;oRe/0kLFm 2y0\Q.<,6R )W=NQH;/vF1X")kZr8!dЬ^tiQS+AOPت]b0] o#.aߧVL3f|(:LnZH/`J~s ؍P47f 6,k_s 3{OG~w>C!ĕG9͏+әʽ $+Y2󥳃b;7:ٵi2/>@L.ʫF)"]Y M^ǎa܁ m Mk~ЖBGzGs߿v AkN0 [щ-6T#aexT/Ouɿ RkgKҧjZZ)OhܔU!ۆ#rig+̋̕j!Y,8꩖lcoL.=G.i1 ̋]A |ó{~+# _'&.E5h,OC EB Uڷ8bKm^ \\V(ip' <Y|ç2's:6W5q^`˩vjz]$r34^Naj92*K/0;"wEۡPyG`g &=ehetJ*m'ʁ@1teϧ/gɇsRYof+oB,F}7vePe| D{KѩjH}׶hqͽSL>fL.13n+Q[ ɵ'wPIbV|L#ZͧryS'+c/}{p/ ~R¯>~Bb8:BEsuW +_F-uB9σ_L$LKPUvm-}y.RHa8 Ua*m2 3J# nlq֐.J}Ly1- L鮩#,.a˳yx~<ֳ%Yd"R1% _xS ›qS}_[UZo؜z͑\W[Fwח뵍\?s%oA>U;fٕ a5) ",b ZH*'#a0euSSVtʔoY C:` i!\ ~5>or[^ـF=IPo$>ml:ƪ .Hxd\]2?Bj}fr㷗Fw=zz TGqQ_ 7Ş?:M!l~Qko󷋘g)5*3Ih3j!׬&;sHRZz&sR?ߛ(rx)ɟ)Ips"W(҅fLAԋ>c6=Tc)AunKIYЎ#Lc~e1,q~q㹕/qN 1]w?38Og~# %S7#~C-,٤-K:*'nYl>:.@W#X75z/^L:^*v<7Mn`eRg"-iunyxdm"LHpE1tF'iB4a6/>?^Ԕʫ NJ[;<ܧ@nZncc*=4ԙ[󀐩v¬ؘi~ZDEB{W2/}%[糇Y- W59Y <޹J;kƼu!?bޯIRy'$?!gXѴ_M(x;k0xU^h5蜡Dʹ'gZn_T~w Ie$,q@1΄"]-Zi"!M'I%jągZV5INR~l ܊#)E( ~ts nt?WψLدgҲ@i#bP,`{DeoJVH=OĞ9#'9{7W\lSՃ=*}9ǎodlXTt/o=ǴNE9ٮiS.hN|M2*Gj:-?=YM+O엊:s=O.eo kYW̞PECg LcIZ65eBl5k[K'^З"R 6ViGEtcg=H7p}xNbeh멏_Eٲn.IKu_e%wޭb*|?7q:-iPw  =`c4r&Gbf 'I ^Q3gUs2EKͫjcOB> stream xڍtTk6!!!9t 9 R 0 ABRBnQ%DAR>xyk}ߚyk;p!tA"@(&srпĜH 2 F_T@ HʊHQ P/ ) P{ ]!Es*#\0{,W-/@DFFJElp.u !laPB9ѮžB`i/+FP~ @&D 0vtvhO0 68lp5"׷@:}W(OΟDD3 E0= 0vF!`0ls :h_W>-F `?kͪp2 GCBm-{Np' YUssj\C z:|]+`w]f#E=4ED-`~my?^OZa +k*.o + @Z1~TM gm+cC\  G@ C_F_u;; `Uwg(?U W ^E탡`^P mJ~١7WnQ I{ *!^' BppuGH#_aߘuG"WokP/-,ncmHi") ӧ srު'')(߮_dROޚdvwi`4Fa M1= ^j&GcߜqBϳϩfI$ zʫF lEM}'dhd%t^y`^)G8("ktH0r?RΝ\|ҟvY􀶿 ಶc?2>3lYۆM_`m* \į_. B:*n:b} -81WO^O|Wq9Gz[k xy`PW*(QrAKJ8UL=ޛ0G@<a!Cx H;T7~,0FdxܔV [\AQ;~$ށb_dZ?4s@,+,fLQ^ 2R|8a0`M^U-/#RA֓jı [~LJYM;וѴe@[ѽFXssO2UҪ0tIAHS}* Ef\)VJ8:Lᡷwƶ7(J _mO^C fRo@JRzZi$C 7?1QL$ز楟9 ,2uWn`]Iũ #G}X :zˁQcX|C-ahֱ`l?q?H1ggB~7N`h2Q޲qĭX~ .#[;|퀥fm C ~A`}O0{z;2ky-0^'& εtuVIsr ~7ae-Y-Z<"b\qŇ5 hLE>I! GTGn|xj(ŒJܪJ0Q}6Z%{ |7khBϑ/\r-_=+y:֝62TB]2YE#sHUZ]p6_JO6AB@f_,^Ц:Z}nk<8%ij}]9 C\.|TF& ݛ[guNlXD#7HvLdoM>4i'g9$ZvW3w#Ԫ?MfD6S g G`7_u÷©r 3zPK^CdYcVxxbV#6 '}Ҙƺx{ާ8x3 I)܊ݔՔs-|.Ep]Z w 4_#,)>YqjdFޑm+*9*pGnSh/eq!S)bqSlhW!O(6sG#гu•u7v2Yvt5~_$3יA[>t7^7 o d.؋XbP<0KW>?U5=އqDMd×e;PZ{ӗMcub ۰t)[; Thx^E{?'!$j3窙+"^0/h4 Gi1A(>+Tq&US2V}_^n8Mk L4gG- LјźRp'g*#N =b0vX7 k0L׆gϬvR؀ұٖR K>&!^[ii"1=B^jHTu]ϮhR&m8]}#nN%}ȀUY9knzg_˒cjaA̫τJs 6zc= P,=T\PpX 1CXtNsdB( T]Buwu#:7,|”=u 6p'ș"yE@9 K.hnJ;: lOȇD4~M%VA{'&+VP ;%'A|gw3_k[z$N\+[;^}j.^*+1C>.fR#tkQoރdț~I啕q]Ɩ%{#=XxAҞC9v4rIY{l9E]ٔg fsG{NݖݝvAdMX϶9&^)o ]ixrgp1gL*}Ŷ0-4֪pR'7[[˟oݱ鳺X؃Xz@_=\b3EK g>I#KK}:OA/IC[㦗"FI%P;>-U,FKGKњ{ L<_꓅ 4Sg8A3 *jVcb{!b60pl,KA`O,(MX#ͬ\- l^ZyUO&eLwǚbx;hfST`c'6[o\i(vE&mzױ5eX{= :`&<ӥ6]j8-Cl>fALRR ַ3NPFQ:1,,15o2;1bq,? endstream endobj 883 0 obj << /Length1 739 /Length2 24693 /Length3 0 /Length 25278 /Filter /FlateDecode >> stream xlspݲ>NlkĶm֓Llv&mOl۶{٧NWꫯUwMF$foTqw0ecg( I2r02aȄL v"@S. @ ldinPSP14tػZ[x\]]\]\IR65-Lf6ayMI9q*@bdci 46s6;lL,ə\M3sȊ˩DTv&\DY;Z𿒍%J:GebXFv M>?RLLv35P :M&Nv!{&$?I6i/?vIB% mvu_Es?eUdSאJ-jglobigPî v+Zg{ݿue NnmF- H%$dIcfe0s8YX\c''S;GO/{LMLaW썹RC|D g!if Ti@'Q,-L.qTp~L\lK5ƚOD.To)օ]AA\V'X2sΪKxQę J Vĩt)P3Mhg, _vWBwp- B5YĻDyدXjZls;As+ZK?rC?U WsB椶QMv2Tu%@f4aUIsQv'7b߁cQw#lKN ns|~曡i>4yG`%8׺]yiߝĂl$ٺcŠwa2Ԧccz'>/oO~lIvuU]#uAc!UA7kPL 3WET>o(!&sYfzaE g(e5ako%=} E3#W{QnZzeDy颁*MWR 0[Lc&o9ɀ&X5aJd8vmYiŃ쭌_9 dqUD'-O6A{ >Ew"5`fe~U+Ek;έ^L3c.(l$0vR!dӼGHDx ~ϻhV^Pxx=i#g%xg\cɀ8L @CS)0ZXޗ85g <1mwod-6W_Eҫ@|Lݍrج CfӔeD(mCvnJ=H(z 7uh{cTd\Hx MZ qtL,HV/fq"| WUg ,^U0,V}x}aJюT_&ؾRn!> Dy #`|+[IdRd(J.!-7Uwf停>y!^j|e3}$":$$Bv. [Th^4B>OEh3}>?#fMMv ~:d Յ3u4U.o (n^9c["q?ǝ)&.^{'kI}u`TbܿW>5 UOR qWxBDpF2np2P>1%VWg8Mַ&\˲u(ف+.b9i*2sN {8=:DnO.mc "R遅-_iv( fj+E7LF` …edNNQNA׍o`O6ϼ_vA!xrX\c&23)X$ZRGd*ãͰF? m{Տ&7iOm3Ns-{xNaJ ʬd̹2S{TTewDkIBqYlngt g6q%7%7_W?דK.߸6F"}\ay;וgn|9t]sfbPHd~;Q=Ji}>OjCwgvOd$ET dǠ)ؽO| qpRïd13o;DP:e$o蚣 б e[zz]roR#(N1Jd0AGCHq5o+|DBb!&^au}VhdCَ0z#bSzp|q㢲gs(TT5D=sk~R;y 2%Q$,*MYh6"Yb+xl*rSfIJӯmW4f*-$FCpd~GyqbU:1{slh 㓵ih rk\w3.rw |JQ|m/|ی>Q$- WDHex@&;Ij2u5/jM9ݿ9"l#Sj7(< Q~LjNpGn \ Q$l6|MnC9.;}3}-CSH,ӑkDc$'.IYpYgHghLU|+ns$nk$qGdha u@$i֥Aٳ4.Ыb*t-GC]EVRj`Sۄ{!v,tP =rVHyO^$ߓP[خ.CHv6 BFt(I|w ǻW vIi>n?fIpH.8a`y!sƩb֫HOa[0~&/ d&|{J&=[^;oRvP;$ a[ʁ@CQhoRe:'w!tsA5KsƠ$Ȑ>KQ* #<*: С57罻!b76& ?ue4:cៗ#RPm,u ԑ}.;7P¤1 2IBgEosAuC`3zdCu3}dj}}R܍G&b[649* ]gYH*w^#0p u @EvVB>b《zrBȚOʙd )RQ3(R B.鎺2-T$O BW۔[ QNEqEp"^F3nJj!SH ɧaַ8YQQ0\?-73[S8Т.*=AbYPӷ̶jx7(^&јwk`KE孅<Kn0gWƉMP?@+vhnz" `*z޶^/pC^G Oqh(#0*h[XUhv%!"Wŧ^^sk׋V776agKaRKD$ K B&f'#n(\^I,"{fK>RFH|i5R{3u+lt/fѕHOn) ^"R*)v҄#1茞E}e U&gE[+D~Zjkt1(jdh+,jYDVnUm󻧰E/Ju:[afQN@ҎPE@0 B]Ha7iL Fz,.@@2R^yLaJ~C'z(_wQ5ysuCQG|6zi]Gr]lXag7O~DL%` no(9dne fףL{lFݜC)=a} ]@L mdv,]p;'Aj]aDI W`[gcT-ڰ\#lD}6c NIu&A,7UZ$z-LU.s?8nSWc2xKUNMl4 T/.ߚPZiګhidΉN)~c7xkȀ~ Y\VRi@yS8Z%Dm"2GaUj7 f$MiySٽߡKaDo#EjZ./whq88|weT DzP_vmTZ963 #P^4TUJt~d؛sΊ$r 3l3օ/ޠIun^ۺٍYCvکN"RKQ\W8ZeH(Goo֢|dDM¤]>mt}o+O;']DyIBa}Ԏk{ Xĥcej,&;c Hk'I=gpw~0]=c33i_ u# fwUDob]R\:,v'Ǖ_qG>RՔijҶ6pi{,0;Ӎs6"*M#,14GR䡡p (yb~ȒW<\WH暕T}|G$2ɹޘiC@!bU'؜Oq$<ֿ2Uj 3܆T3 zF@0p賦v!<'Kgɣ]F`'G"oo8O aR'1BiIZx$WA[(5⪁n Bp*ɮk > ň>@u_DҹJK4Y:𼅸O5m5M]ϜȣMRl,s1PmGwJ: pgd $ϩc~NdqdՋo*nd|:"R trz(?ׁ>1\$1#_Q8Tײ"ek2YѴ*W-3{1 2i*C@vmf2$r\ڭNw19^uC[yTB |o`yO*\$7Xn='i(Vr {Nb/ax3y"ܺThPqrba^U? :jjԘ)[q"Կ}K( EN -a %up)1nk8c(h mȤ͗ XL8+n!٪ujF`60 O/ifzoJܬ_t(bpSGHoşKs%)ChوO clo =4mcw<-xpq#1B #>_&1`4P. RGcJb/S&Hy{ UT;-ɉ) |ߙPf/cjm=7EHcR'6&rD!F[/COI5_>H[2^\}/d ?xP uqRГ-&Ko;[u6(=>?F3g.G|ī@*'l 3MlADPn q9ukeˁ| ֆZw7sRH+ uKdqk&y+Cf=<8c-f "]LwޫBI K-p(Q3>~=`0H}U&ஐB4Ǎ6&+Or$xTIZj DPVnUIWSWYar?W3* P>ʁ̐0n.mvj[ɓs{Γ-3 W` CAWzGbbvyeX$FX9UoF\чdS1 $/ȥBRe_qUC0@uA?Z݃-޼p"@cDDaF+@$go-^ZKC Ӭr}k6I0;Bq4Q"t]3xk8sC{.>£xk8V II] z$Leў.>RjKRbB߳E;L9^r\U$.l%-娅ں_]<۲N&SS~>,I{ye]kXRZ>TtZU@B٣ %9"%pSbXvdL^*nNa Rޗbj~y`͟±!Za/K1TT;L\Z e mwO2Kr`ʒ]$'V4FٽVscgm[Љ .Q^k"I5xҡ* ~tt4[vCb!M6P_5F[؃e:m(ؘc}ARAqQgؙO:KQQdvH) tmMC,D3]R$iZ6xGg.:xƑ&JĜq&3rOnUI[qi:!LVGʾ{gT=!@qҕ\7,wQ7* |\B-˴$dɹJ>lFҒo{Ӕ`<,l,\vz<V,Hc_\5,!fdSV_Ɏfݦ> bPv'N]C$2#@]+Y@6]兢,nL%6&z5ly[$9"הwe~.^?@w)o >ñAC1*#2Ta=> n/،v2gFO>67*deb^j+R@y ݲ+#mIiV=QԠ %ଘ ][? <&uT7kEbS1'J E*4VZczI'Wjhҕ]*/mLT]S*u]H=Y#21`I 3m48mu@u^:`V:]%G弃\P鋸*yJ]H^b=GdMaq# 5ZAgƒ~ND2W&[$XM *S݃)FUK0)I!;LRuuu-"s@=G <&H CzJ6J܉["4er]RXzsL;q^svPNieǧ A͏hM# s 0(Bff|e R@ܻd&fn ; +Kvscyi92$`i6,iщ# ayIqV+S+4 w]co&1e u#DH3ΡZt^zڻG//+'O ת+P@;7S9EiG!V#W=),X?Rif"Ey˵ck4䓇48*yOxYtK=Xv|`St|l2# fgs{KŴz(& }>L`d#rg -_h4.yNƮU[DL4k{ues?'8E׹1Uxq#TrTcS?MzS)3̙o)eq)W@G +mkEw+ɡ;.IdV'!,RȂ(Y PNJEtNU@~4g,ao##vLUA{72~}3|Yf~I֞IקCDxIt׈Mh0%TKF.G uߖ]XQa_8("$LwW0RHƨQd,Xؓ֋RWUyeb-[)#$z꽟MD4Ĥ;f]0< VU8>ցt.rAA䕷M-1}k9fkt>J*w3С:aD |k Aw-0'[砋$a4QӋMIß`WX"s񭜭Tƃ c -8 .^Iş..z?`,CR4V8O jsc jMŪLFM>+[v5w7^sYH)4ݣ̆_1OÊ{7ΜQn執Sк%BxnQp.29JXm0?‹zg|3%)}eڿP&:5WZ #8TpPlfL!hsVMj]qy0ڰ2uv؞TS qRklȤp(P#]${+&ni}eFnæ}c2 uvH!ߍ&(Idxlҷ;$/ScfDkU Ɩp$ъ scG|YCM@v4I!kUx!B-]y1*E'B;A~ l{[eX'Y9CbþU~h/Ƀ0ߨT tI ;4uv5hL*[W奃WcMAϪȮIݳw]7، '@xd͍'rj))~v=/Xm ٫\@Dn Cˌ Ges0*څ0SͅZU2[Ȧ Sۃ~ʨ"f=j\RhRW2K`x~k,HYSv܌F T; sd썰_qI8zgl(hׯ\YtiNXך5JJgfyZ,LIgƫj}oNVѳE^fuX+.R߽IUz6I{>wwvs{~iH̓~[< N8xupu|Wk g>FhO[M7EvM^a!kpHD\Cl>ty DL+ķ(^%8v4˅bSS<䶄kBbW Û+v^:XJiK95۬4qC,Jj^#IN43u[hz :2=d%^%ȹD\K"%)m_F"0VoE[&@j##D_Xhw+Į߯HfsX@sYcTh(d> Hl`<+eR҄!@#۝i, I:9|tr ŞLC^ 5S!sP G/*쬦Y,7Slrbme J%&L4&Ɖ0Z?_ubJΚxA^bX*x}Gwp,F88TZ#6.L@o+q @u]CX*P3Zgyd} yy\{0t|V{BUR.>ˆc!:6f) \m64\'OJ/d/bB*qeZ/ϓaR`X7 yi逎om~gMui9U[${ CzM7>pg<0+Zrs}%_sYt] vЅ@'K@R̴ cߟH]M&[0 (c-lґ׻.X*H뻓{J;2*wHZ82r~p vBֻ`.ѥ_̴tf+J:9!P呒Tp;734UF-a;DM>c?L{kOB|'at()\aiy넢2]ӽM\4(0 E:O}Q399~ ,`;/F_]l@ ?V;iWD!:̓eȄ m^({em(‚@D|WWdQS.ӗ0:;L4veuBuZ=HRA}΍'+8 ()]-U_6F{f'\t4cϪ.;)]d)l=HeSNp=b<lőkڴI|i\6“$C1)5sڳ&yR:lN|SOH~FbU ~El摧z4gQ~/G*(=$o<%{%:a&uK:W>KB^fM, Zy×قTuׇŽvq qw .X*LQb|P+LS8SAIrbB,4i$٣_| B Jm:h/kx;_NߞOldL51QcA?Ͱ%1䦿 FtR'Gӷ $nodA|j; |}l=rb^Vn< @~! }9!MsLJC/6 &Ka`$Ҭ*2ߤfF%Ԣ&V ^ V׺>.Iy!2X?H.%&$J 4eA]2d;/eǃ"xfp+!]% w[-h2Э2x :54 jEXk`(z+)ZGE-Etoׯ>ż6> rf \a@OScbece x@ 2 -) 3BO jZKE`}oTrT '@偉-Pke1y0-عt۫}qX1x 9.ݬ}(tZ-^@z\XÖ>sy)혀՘7x »؉W0׶r4# _Vzq1Ҕa^/*yR S<8P惱m jL G+^;t4up#3""hW7ؑ:3P#{NlBq3{0r}! NjHUf}>sª2SLoGѠO 0K%4>lt$Ԇv7Qڶw")WP%3C_)&xB8Hd@v<;}uA_/-7 ]PD#]vKt8pMiq_r.sWQ5Ii$BeQ49$ۉ_B"+_ڤWeX$? M-sw>\eb~@ T뫆xL "U]KiH`P0d1z9 =7~`2\9+ƃk;$-/fRE"#"TM| O:XBIr5w%r֕+`!sUbTp`}#BPfB,^@iB 3g<§}^߽+o :1p% v|,EZ8u]7ӿj1$h:A|Z`6[b5ͩ;FNS~ث~eͮF>[9("FUmqy. A~x֡ 6Y١T$HB:*P^ۥѬ7/g@ AZcط}NæW%z_,t.P}gՃ_B: Ub&8r)\G|\:U0Gxo|K.]S\m1 'u3 1<8Ųo{Sy_ujw]\dMVo\S/Hsfkb)*/B/eoQKVjwn3uWqAw-I=U%N<61 +Ȭ?Z FFiopHI+URSPjj&ss/!ϗe\lF|/5=|tNZdUp^y=|wn*Bp] ΂%٠ՀPϗxO?S3Jmv]f]{ Q%RRlGёP}KPZ oᇜ7^a/9{Kvf4JTQ]FZlg1j3A1_q/t~jfK(eX"avd)<ze I7,*&5ЅM|Ό͐ 0 -A5P[8vW&%lӿ,db<}댞| Mk7fPq--48ϐao\Eܑ(c߭!m&oU҆0I}#NJ'W&.hxHũ EGO84vb{ r{}܃̰1N>1rMK[3С[rjRAKY|Qg}}Uvʹ;n;Ќܔᰫ 1ܦ6D6wt˾tJK.# -?W??Jߢxz{d1I;vȦjD**Xye<+A=\)d^;î!BY㿅֦Ȓ{ʇ;ΚWۃ{8(ͣrV~IuMS(] 7eCu?2Gًg?iM_Qz PQtX7*jY'i5&[Zn/1([nWpL$~9O`Y>dO7KN8LU]ˎt.< % Lv2`dx FRc՟i u' ndwf]q͞\kQFO_ y UGo,4HQ n&sȑT1 6 X)E>r7M8}ѣ.sAQ iQ5!!Tv~>fo<{7]v!b(Uf- )3ӂpR4F]Sc#8PdFS- GQJi"f XE/KuOOyMWAf}!rG¤lPLUr&R`Ǘ K> 4/ <3(9+_?8VzYÌݎ  6Q`hp@9ZTW8&']1qST?_%H݀jbL= !ß-O63@̔ hXI?C錡8F+8f::jpWl@l;A9%VP!Vp =hk]52MA<'߳K߱* swN:^a^{ͺ=Ha;.BkCjUZT{7iXjː²bu}HX|*0n2hwv\֐Q[$Mu[0Rc◬ j,J8v -w5~pz{Onր1?";@#~~p_H9m~1Kֿw:kwGW6b1ƵE2רPnQes^<8-#K%nBn:D1sR!*irn5:Tc4w^ȕHhSS&-&:#QX~&t܆T9><P 5ݳ^=dMxǞ`M[~U͢?EJF]!%9!$` ƟR }]2%”҃aG">`wJ#6г.hLpDB?-cݜR,\7̰V%Q;L}۵?cP.`-aR+6 \51|rL6.WyF3MEܽ2Ʌx%דt96t-7Vzz]RfۢJ?Go 9Wr$ 0Aie "d\ǭ5/Zt-Z$ n&sȑȒVB RMxZAE35{j#|>g>8#ϑ'Z55QVwl*'OBLs6F!4ca(Q_>NHFҭ14Kh#,  tV'[B,ė`=;<0}W,\"pQw|]Hr+%~m QfqBمh 1N8<\W& 1e[|02<~]Kﰤ$KWʻ~fmuD S+ =@ܓB胰@ftEItҋ*vo[*~Yer(>5GHo6VAGW L*u9EubM50 '~T7nf[n7q"1{df*ƂKc#dځhg-i-g'lTZQLDleSSlմ!K &eK/Y]zj'*+K2bs`Ff9+m N@5=2._qBbk>'{@Z9C$98D h0\qjsH:IGB:15DH|/2͇ҿnF%ɲ JmVG5π2_"Ǯy[C| RD;3qa)*RqtZsمϲ$%V/iV}%jL1{ SljA\rq%E(kބF Hl4>@zFjܿ=uTq-'6 7ٚ#<=yl UHyzV*-ĻR^bF{Xi `E=<mQlp3Q:^V_= vvݗ>jqpIȁ,TgM"3B1׬ (i)7Hf;h~˲zt\oqP27:N@u9f*XڝRƖq &sZE5^q5vfv-pW%di!fq\KZ$f=|%Qr < fzyڑخMB`fľ]sX\S8?ՐQ'T]nr>yYǵ:kgxڈCIhSL4+)+óoqx$ Q M*>ҷe4I<pX<1UuvvɦJĔVq:}7DSsGt5d+6Wb\ug~ 8oơ/&B In[2SֱzVO̾Gvqt4!+}^0}/_v ~PL4b$8(B'|%v-+ey3]O FbVfe=՚rI?sJ~Ȳgd_>F1};Bf1 mSY7Dqyn7>TDϢ*vwǛk}3=V*V \>fG ^?6 L>T*W3-+ X7Ydq. m=R03aAdeaV镣|< n1*l[^=U?hzV !I$$B.ݣȠ nH=ҝvl >E$E/3'JdL,+(gUmʜh*qN?R3 qU HC_|@ 2\ֹz*"j}ƋMuQvVÇj>"di@Ǖp/?)%x!WIu侮Ns%yQfzcD{QͣQ5bs4"vFӎ^Ibxؓ*?ʼn_\ood4탤mV}[$hM!s|r ƜY_`b-1z`k?駷EßzCoqeAW3aո]c?Ѯt*"$=xbx``=Q s*܅]v$:RhujbC7q-180>H3dޓZ2~ kB?+lq}5GIek8+ Q C>tUV}X3tJ>r-rkX!&Rڣ_YLG;@YBR48nzxӰ1k)DNráN,QɃ!_!:cM X09U!l;3C b܋)GQg'J %0D4ݕ˫|,SFF6EJ^9fBXT5x/8ݛzȷEhw6`o@@jE`VVZ\!!X̬~*K)>pIo{O3`ɫ8f;OcxЃ'Z(p/tVVX;!lġ_IqAN;( z4gSj{pbiIb`cWx=0cus Ⴄv$]ҷGNɈѠ8Q7|J#K f67+AX0Ma>0>-*ŕ}bwIL0m8=|gEvGp~g`PQKE6h* yYHDL^tU$`^(FSU*heb e i2?`/Ks-!Gyc/6{/[ )!Z%oſKd9E'0&{5{ pP@!GR'4>iQR~aap46ܞ 17sBnb[e怿90/kP 5"zί=ٻ79E~<7`4,Cg7DѼ(I~4|F%iY} Q"Ygq zv`n,kCelf yc<5KFT4 WnKbb>H`/g ~]s4|uh ,Fiʞ$ѳb;5?)̒uu)\խyѩ^f/63<.x=5s 8Q3LVfuT0,]'b6AR"ngo/UH+;*p "ki-ma昂"" endstream endobj 885 0 obj << /Length1 727 /Length2 23668 /Length3 0 /Length 24227 /Filter /FlateDecode >> stream xlc%ݶ5\vuemsmwٶm˶m6s}F|&Ɗ9X323Vd۹z:x*šLLL&V8rr' 4,&&f8r ʄA@ٕUE*@ 0D%Tj jlci49fN8{;Sqrf7;7?̜mrbB 1FU)@Vv.<&򿖍Zko?33` 4cnRvfM]?ThH 0v7Dm\]N9{S@ 3mdki?zٙ B@SEK$73G5ٟJWS{;)O3.Ǩ%)#.Acﴘ9@EL7ﴢfT;S8Yzt5$Lk?7= +' fc?tM\v.^{@ oUZKhX\%$܌ 3tύ吅*n;l1o8 T4q k i_R[C5::C?=6WP:kmVRLel@㗄 ࿯MZ,&/vĩ>܇<1ןR/Hxn]y3-ӧlb'aBڛ/"`֕ M}|[ \={ȁdPާ%D#腭}Gyv%l _ҰiYb"-L#(6OxvWm;MdjǛ $U<0{?*]R;TA= ?u{Y1#cog5(?(AXIǯj*#c# - P$(HD :5/KE'L{;3dRi%s͊[ʣg qۼSOC7'{=E.ᬪZ|Q x{"^+t |$b@ 8ؒ_Pn~ܦ~T/7\Qt؝~el~"X)A} VwMTōOєkk'fx0rPptFX:};+LSvFθjR@[qPwT`+P|] k9,aIa7$ULХSx(G6'R+^0mm_[4]ʑ抴u`g1Cuߥoj%[xeȉ\uCp) 6"k-MECgɍT⮏qGV\a?' USAsݿXîfm!_gޕ#t0V .6i$Co< ~.>yݻWjk™F%E-wBo^/*㠤40 4~A;t6w[-__N>H( >z)lݴgh9ch&[ || }ЬI5CУ~1R?P)u@a-3g]J kP\zr-|]BG5\R)Wv[ui@fƶ:l+P:lto:*X4tޔ}5} 7 E(>L sqwB[Ia8vHKn'()s?ĸ+LJ 7,Wq:Ԫ: '\6?1̍94hШ߁0Ĵȉ&C'I2 A tWcR0>zmX:>/ KElFS'Hؓ۲ɭ)Ȗ\XBȐFL%E]!ns`N wZO"J^6ƭoEߘdX=l2CxNR'Bcs'F(⇰fl Q,1tDcjP֞g](oJӢ( z͹YxrrBygq%t<) WSQ.$`PUc`@@"2?GG2:ZXŚqvJzu廹ߌ#;Ez<{fO{ $U7;՛}]8F" mAgzVFb-T//-ӽjrBRϩb6j6h)~i?uo*cNQLX!媫ʁV,s¬$'2pvUk¯yeafE&A/F[=!=V,nQw]*"}9l?1Hcma/;F 6vQEn:;":] yKeqwT5 O:kovqֱxV(%yKdR\.,|;ZtAį8be؆QryXmJ)߁M|am{YVo/0EDa_tj#.)| (k+u >[[=c yaIeѢYF s}<4{6+Y;k (}Z 0O#9EB(4O /&JA;fmp) NkjWE DYV0f5UN]+ғƙ&j~bGFh/бCbһ. YD\?ݎ$c#Q9!fƏof7Id{ N< NϺX 80]5%B,+xK[K[LK)G`;O[t@Mf#{8kf"^t8],y&« ]s)* |uIJ @+CA 3{Sif#d[ .%g0Zj-NQeC+"CRc9$vI.o@paE>L/f|nzjEu&[ gh@:A=rGqw͚oLHhLWhK}&8PN teOQBHxC|>֜Zp΄;wK,]~SZg(YT1kM^rE4j -ߙI$ꦿgIxi*49PS/[4&p5~g1B6y+`JaQ^Yϋ3.` ,6-TԞ {XOASZPDb mFg'!ǖFUR1D3TԧVbʔoN'>7VUQGTzK(& =D ^ +?@D}!<9JjP~W`H?Q&r-|\m?>F(T)+wG)/K|઱G'70pd)$z' tBC\W 'i"r@㨤#!G48񛀷WȄz}V|<Ώ0 .C}v&cJ`Cǔg0 7=]fKGqLBdv뷰muE  ;Y4r1[,МLQT.8)e?N^ $sǾc8CFaz :G"(Y!Qj i߯=]=2xK+%ჺNegGZsi8˱ %|/4;z\X0 i;0մ*ګ9 nD"AñX{K{ކhi4'2Xʡ݉7ͫ.l4;ȭGZO+灰^XM y;6:DsM%sGOy|C\}JdPC*i<3:ar OJ4Z0Цn? I-}Sqm51fw$lRIm`f`ܻŔ)7k",aA%l:Ǖ"3gTqnNnWK_~,8q43 -ܠ~u q>&[j  3ɾKPVN4zž 紂 eQ.L>]ЪkߔxeG-_d=}iiLB{muY | jis^Ru|+jvzJÉAte6wYOTӏ#4ѧlК[\nS췙kXËڙ?mnN7ơ} `"Va Fgy:'*@!-sƟome2Ds0*E"H 燭K޳oeO`Od9=+;AWx2.yqHkѺMPKCG!bژ7PcVad|TW~QSPlJؘliwt54Y2\E7A\!i,FPumqVcaЗVݛ/c}vVwsiTOzV.{6J?qkH. wu(KgnAGdI{[:c`|D YhFS5aZx.r",;W?*j#xcdIkLQCp1@^5ހ| ÿ2<]; yKaB;=!-EէFuWmnZ.zOa =ˍ( 葨YX,C\X}<" D;V XT} .i's׳J3<[>dt&V>,+|4M8[񵈄{!&ոX -ߛP<{Z[۽/p߈EzWrOLV//ݑ$K0+#P;E}|ȆUV/A9ʇ3$7U#_S7:^] AucMH=h_:^c}qrssvbP#h,6;J(UEkOxqR{, x?q_U'p҆׊BwTmwv6M8QyqD\ۧS42?W%m^3+4Ne :2똽84zH@"QƊgAxmȇ}hl1x`s h.wa;xt[܈=jK>3Š7RVȈ=m]"#t>{xK3==Si6gBy(jUФ⪂k|EB-IxK]4f3K$$$ܭXZDf.3mhU0M0EfȔ"/U5WECjeN?ܭZ:xCjt(kPQ?Nuz&lfb:?o U\p4ܸ 4-B3#8s+BBo>f~T޴Gc7w$2&+GqKGЌ>S+ MՆDjѹ_':y㊽_dyq5}?Ŭd ?(z?&׌ňӰ`y` To&!nX|,~zJߢoXEf םN* gG)c9]\wQN/u&#ƒi*J|k JCf?x/<'MÙ Sd׺h]{.1'l$\~U~"%FҩRQ*7yE&̓A-6t"H@?!Ƣ>| VSBKzk9ǹ#9a&Xo-H,(#Z?c}]#_KFo8r/)vB)S|Z[c.kuLK5oQeێeV7I1dLQڄgRwos wlN Zce@.0K){'j.=g!=P ;Vi 4ݨ;%#iJhh"v MK8^@WU\eܪh*W!B6PHj-9ӝaf%ܼZY"`ecV uy*0f(>rILkZi]l8JAƖUm;:f< ?F2>漵ecX$6Db>xaF7+;[5Z&g/?KG05`꣋B>e`9aChIF)J ͖'&IMdvlӢ W//J?!Tmt+#yXHBUy,ֽuZg遱ܲ7MT7ȉ8ܦQdzt ],|vtQbQdVaJ%͟T;RC>Xo9uNUf83e4+ۻt9GyQ݇>G CP+:"y^:9,Emg.~,QX{c$N8PYTU["{Lr!%}-P!R'9 uTQ+`^yb(/ V2N}qIcVl\v3Z L?}Ay,'J<8[Z/~::,Fs4;ri$ cO4”hdѢtʚ1"T}m9,-S^Fai?2 W~"Y<-Ʃ%)PdXYNerehGI!| A{/N&1֓ÄjǺѓ.x?BQGy~ꠂ"8Y9{Q$cN lvueO"=We+wd_bZ%ey {mq?f_U;%$''P@ӤKqrSVTwLړ&A,ln|40WM*8&}m|iМ:y0*>Ъߓ0ǎ`ƷR#gzTSsW$|,'Y KnT"\ƴðT|JEa0wumTG: 6qmM 0W4'7w,}7hK!$3 f v R Rں| *CtX:>n'|z<4<V߈"{|'l˜2ʊ|}iȈĬA`'A,#w }TEҋl5wJu+ް'PvYó.?f><[ʏHɓ9,"qG0#r|hLr\u.͍fhx NnxSP7gM*dY.g$|MaCq碢 k3͐W !>mo#Qx2qUr]RI\綼GqZ^W.WN7JB>cO&\󮆢hQPT]>ܸ= ;,N3y+4VxC76Q/ۘJ- {Qf! 1~jhّat@#9+aa&s'a~z4V}؛{͸?gqj.$Z""ia3|jﰡ/X3n&14d*^[>Z5 kbߖ"3 yp5A/ѡ2v7jb[)z ^R{ (FEv X6M3ҚY$ePaр7r8|n+Ŧ@F2*wWRdf+^L-r8c,ה} .#i8'`g* XH;R҉}5Y/b uCXWW,ݍI2m"ϰB^, FfDF+eD;4 s?S~R8H*:%T=BzLo0Re*Kn?"E[T"~6oތj\+lI`Jr.vQVUak}ynE9d#&)Gho֚*`7LF3. :L_s]p{ c jgB^ Ͳs^bİޙ5J)\{4FytD@wH~䖝 Rtf>0y؇X5KAU.5PfR% =0_("q 7Gl;vc=[?xՎ<^$]K J:mdL\8ȤF̧hH <{+/+iFW$GS @~$};̋+\jmQi229\)"(UaQɮ!h;!Ni_JN(>T)W h+N-Qۗ]ЊTt~V(%oN#L&V怗^'$ɾ h!52u=-zM29xHV~ h1l}hia$ (͞]HGc@/hZsט5AL3U^&7EvDH dm<ߐi"+@{o2Ư 2}%͐AhtF;HT{VHȺFϖg~Kδ Dj{Ԏ6ý.R|!6\t! mdO3׶zD%S?@E@$&*XDuꌽ4nMؗkwޛݝפaqrZ hjo[\v9K1*U,0_:T_DCMKGRG g:GDOxJCG/ս;|aiPzd:(N sڳK-^ xzT6}iDUU apϦmp~+Dۀ ;@˔k~*$ 4KB!G :t9c7$ zgrp*$ٲmw|y 8,R5sv.A5O>z4!$%#"Qv CSH B0XlH72q}"iu .1~!t{>|yï'56h(Q]>wNuO@aA{Yĵѫ.wan®=yA7j@\-Fc&wfb0tdnnVyEfP+PdL:؁Jg=VhJL`;=٫n\nh+G_U.SUiIp龣T _etQa%;H5nՅ4P?q =8\SyWycI}JS+p[HWT!(s)4(eȗg\%ѣ&;ݙgLc>iykys"i$I|'tđDF{m)Y0xrTgqL4mg_ 駨JeEK'guE?6ro2H WNv .L="пJv4ĠZc-.hw X0my?2IAr>-T0I̚-;|Ê 9Iwb7U^KƵat61q7;\ٔMǴ$5'^kdJ/1XWsibUpW%=x9[kݟgV0S8G0!/V+::\BVm{0rHWhۯy9tcu,ژ5BGӵ[E*KD/D)^ۺ=]2gg, -~x}3zB1PϤp5a瞣)ܯN'n^AO/l%Ԏ3D _5FxP;HFZxiL3ZSmQrW:^0wq#{g1N^ˎMIߤE,ze x bHC?u瘜jR=O'EADӸR3Mަ8EUJ?RoFg7tĘޅO;Epcֲ%rx,AV1_ q*UҰų߹+ngi^.y"rw1d5coa7SOr)?-c*K_>õـC`B'5DLPҚ;5 . ݍ+y"ce+cmXm_m T[#OUaAB )luD^/d:@-gT, YyTO,{]۵ R\6DNFsIf8q"՟QmNp۞GVݽ}~!5(}=cPb gf>-iM%~8]HPbQљ4ATemЏV*SՆ6ka 먿Rbt ׃fP_Ga#Wx™`=J| @^,baSSŸaRi[z(EeTon:(NmzK,YWU43GړKks۾ MЁA7dMr5N_ gE:.xaT?'|#o:*F'Xձa$  e`ٰ[7zٿsk=nST'@FUp.om'݆8t¦IirGHHS;ģ@sWgn81N+MW%C:H}C3>x&ggݛi/M> Ļ-VǨ_ܤWɜijM$z6I p*ל*$PuH|7K3R0~0|hJ9+RW ژA{g= XInmxp-ẔTxZTWIvv},d?fXV3HsAO\c\ι! 5'e4nfx*"@Ku_qw1iʒ)́ ?ףhh(Ej}Uiúxoe?A}ȱJp۟P$v!/ּIK#\?L7j" $ջ#Ѿʅeo\:+IPtZ]ZmW9D[KrժeX:U}8g0YSqhHknǶ$jcʓ0f#۝ur"a[3>Y:vNff0ԙ(Nr vuRC?j^:ZVM&K넶J~|F$8vc˛-+oͧG_d3i22U31-(eqLǣ RL#X帙ob7Q~<}oܽy _͍Z@w^|g ޥRmB3fCZڨ*_=T_$X=1vW?UŊYe2<,FC g`U!jjU L{) s-GM CVֳq^_zŞZZfb(efcr7P0l>jo?ZԯC>0Z@53;qK/\yw^ ;21џ%NP뗇7"iOG`ŷBK!mI%2bZH猘I YXHUX]hZh;QC^i';&~I'`6k!33pbFҦF\MMÆk=MDl^ pi11<yB ^N`VKڭ80_qG%D H좞s& n(SOmrv.1Szߐ!:ZOa鴮WOP @ J3{93F +Ztrol:*u.ЕP)-õDȑ7qأ[+li];cB4JvkшL;hLnQԃ9JlӲ@Aƻ49pO rTKQ<}zM]cD"^A(K. Y*eP4QX4-u DǤhYRkQL5P2UO3_?YJ4ib?:OKɞV`2p7%f}3Ձۤm4 t6ebJ)*e?Y2%bIbE"] vʪTȦ`}P[1[DuB`&^jڭѶS{ /yP ړg}J2֬#WkrV_~#.Q=}P}~i`H7C^gS|b`ҧ OjbK5V]"jhjۓ0'^_*zwZ' D᝛|(e "zo4XC|>6X6_p{5f:!|oҔD(D_ ׿*4B w<nf Ҁ2G.+zTM'ӈF,h4piw><쩛$=:~^+Z |sr: ʜyL }./ŽG4˽nխ4P|R Vz(y W r\Z>t: &C>x2Tgfx~= -t6g;S${Qbe }/~9ER`L{(4a%E |If8ߖCMAq f# ><Օ.w:!1.,q53&?1 2D `΀"0n ÖUf.MrRؗ`]LzZ잘ȤDM^;8;4EPAPjԮG؊0oq}0nG1E'o(d^.t~/uKp!N |l*>8KEDQ؟Kq^Ml4m:l@yj"ϸK~J_Z-tn@*MO,RhUJ/@݇kzBT۫iCMK|~B1) P(ed{e&^o2E74'ó;ݮӿCuADeЁhB 5kl?FQڂ|zksKa1`~ECG ~YW `R6>ؑBNԠWrI%72|t%gc n?# 6r2vhϙ??,8&bکIdn}>O\d kdKՌbK/Z}.N[ % ط ;fCy48ˇe䳀{$*7@)FSM/o̠W=Ɍe0+U\`>x 3< s&̂Y`RA/dU yYyR _ Q̤JLl*bFfYB9_  J3d'?~0 bil"_,)ىJJEg,}@-b{2HОp,a Ѿм+H~>/r~x:wո;htfCYY_Stk8ΛlԼ n'o'/rU".⑻{'jnXi~7X `g͂TRݾiKa#x>S`!}s7c7F./&1G2p1/ς,XҗTk兆84Fn$*,$SJ*}06#H2[Mg|`(iaYB퐺'Гn8f\HDdF1.$a">ṫk):]ӟ-k>XȺ)9CEwţ^oFr]KaZL/3 W=ʥ(YK$"?ŚnL:h=JjyI\x .`ٴg43MS22/}ű'}^# V9. ol[YB v  IQ}ƒ\g Zv3M3|D |!)R~!Yh1Xl\h2ꥡŊ|/a #3y7D"(L}N`ÇkTLW s[3r-mѮ=Lh,&4$ , '0m€{/o`BI;nwdH׸uiN8n_a9 =꧱ $z9~ʃWT訜-o897{Xh"4&pb143XB`1f**~Z^}CRtCl1eK?tG:'/o3 Ny:ᖁ= .~O >7t$UmM%u|8]ct( D Ar@e'!R3`=vZ6%8 ?/b\_nBkHf!H&%ls%ENRv~33Hy V3µLPg`IW߻D:7[ OՇo>9EKݳ4^ξ9#<iT]v"TI㼡De@O 8{`jk&"@NrJLT+X 5c3a?B{fL#g`T{Oa[*8#ݮWijȹk 6L^٤Bnݙ,MdkhڎNRb(>1.^iBw4Qg,Tra5j)e7b]vjOA (վ(4ٌ"5aRF~EB2%wxTՀ>_{EIC&~=BxTl WEׄ 8Kl<Ss6l,G )pm!j_C?c(m FLD$7YjkWS*w3jXi:ܼ8t"NSΪ $]R> 6+"֦g#KU L$f[|Y]@܅<4⺚2}O[@ .h >vZ˜Vc o%dhƒߴu>7a9g9A9 FEGDG.j~Pn[KOQxB8\+VQlc ̠?WqY7+fhSSgr :q,ޕt{m#:%1st 7z}E%@vSWf@r YeZ!g ER!&AHIG)#48!KI< X#ԦL5"85*Q$2O[v&l?a)5Lz8vX+rGA}8:zh"U42|,Sr-P}bTKFEưW.Sk,f]7e śe?75Q Ɔe ['*>;H=DC)=.nN^jrH3;>BHMΫ:@x^˓HSڵ G4rdXut[^m~1`g΃w\^韨oNO@6PZq!xTrV |S# \%+Ce$xfeZTᒡH76aŰ"xio!Tv4<697q oC=VtTRIiu\~:C˩"6G`'^24jwJQ:]Ѻ=o^eRX<,ߤ"QcNRHy"1 Kjő^b kGU2u1[W0bPF81z|s.+¹ 2&?AEB4$=Yb̾r6(_HtxsNts%KMmZ7g'J'SʋQ/UA;f̲lⱫ*aԌ h1D5oz"&_{Ķm7Cqs: ^j:&n}ϖ?(ša7޺qb6&쿧H4qD`kZ~v ?fiFӓY }\`X{ŕd}:1rRt<%e2kanTYt^| 4艹e&M,!)cdmcp&9*T1R\. lъ//ݷtnϫq؋)6H`M!ܫ0,;3 S3'X H@` v r8Eٸ hP endstream endobj 887 0 obj << /Length1 727 /Length2 24215 /Length3 0 /Length 24791 /Filter /FlateDecode >> stream xlct-f;fǶm۸ccI6:m۶~xO¨Ysc*rb1)=#@YLHHGN.hjl 1t6MLfFF&8r0@iLo%@Z[x\]]\\] R658[,mL rJq9U @ ciljdJ0:lsL,ɉ\MfȊ˩DTv&휝656rWul G2ᘘ&#SsK;8&igGmb_?C*?.66rJa#@hbhژDݝMLLMmhki=$ Ctt75Qtr3C^?D'{5x߄t B"j46M,0jh? -Cߞ0;@_Mￒ{13sXL,NNߴSn'SSwSc%1wUjSHhL9$̔*d׵6倅%ޝ ^tŶ_XS(0%"rs7ż׺0+5\[c9[ 2UK93EBlŭ?؉SDB0ݣBο2] A&շ/ ?ʫW_٭]d,d~ tt.f1D1.̀fIػM mtg V &|l$m'E )=*Ng@~օ;^q‚p];<]@{||LCt@uxⒼ?.MZKdcUnh1)A{آXQ^~|ްX$\jԚiO)e-jl7k]^.gV4T.Y<N%ӘE¯ւ x%=7"Q!p:ݝ{k{ ѵrW|cg ].(Hxt*q%$ļ]25n`7sY{|[Oup?iTN$T{Ur$,elH׌*":cQW{O@ VAJϦ_)#>2øb5@-nma &cԣ+t;[#4[ ʊao4s)mQcHbpí=P"PGf:I{y& ӣ ˰NU~Ia=a TQ/WXY%_?fp>o 2Xj~5>e!:L|=>AA<[b4F){%k ?U]< XOば!R{K$z@DF[B}yw%< bڝ*TvFK^ʑ(zk/Ng8jvFt`\ _&uoCu㚢{3uƃP}VƶqټjE7UjNk~02UFUEUbő׬;<_љ1٦;mrӺ{׭(pW‰Ow!6 u-ƙ-uqٗsNfc&A~ހR׭{WKh4Ur7|P φ6r,7t5v &V;]d^QҙeOzj#r#߿6UVPL \]IddAwݐaU.>8;DdF4f6+ɝc=q*UF*Ew,v눺C~Ӥ x< Q+ RBVMhk<sBYyĽzuz3!0Dl&ic58W={nNta2r fjUHyQkvߍ`%< A=NA0Jk]ϻ[a c ͌v%VeQN%dWS$+-Eg >jpo$,~,pyf3ѓLczrVCv,Խl1#8s JW"lfN#u8nEEb!) 4L#NOaqai9{6F i^&m$ >У-bLGdB_(B뿶e;a@W@Tșv-[N D; h-5#SMmA֊ fOCf&Xsz=oVЯ@]ިF$hꝍvIƠ%6?1-uFi_o=;(A`y7+TlV{aSL9y|O|J d}" g`B|Kͪ?%YA'jSE ŵ49 A bnacUkG2*.ZR(sݶ!3 ,û&?+p73ʀ3 ,t'52TSAVƛC_+0\@,_y¹r$gLcxn6/BIV|lnQ-_%lS^zqH1Ia ` և:iTalF֢1HxxNm0TZF:N,>l_µa},/T!-Fή7,Rwg+HX+'+Srlx-ds%GtVS K:2c z6 7Cړl3oFE_4BnR)<'8'W)OO]#l8z:(#C_QΊ Cu^=Z!1ZS|껇hVW9c#\U()Ҧ91+BOS`L볫'D7XC}1bbH'F\MF8!\9\./+cxZ|SC,^'Q˶)cފPgDņR n07lE C8N 16 j"6:ލNYa> c >ǼX 5ԣ@e#:j?]atٰR~f:vp9EfIڦ;`BC3 30zaIA~W=7 'tv*竩GYvY\!aH a2 9bQ0Pk7;}B֒7BpIG|U{u@_׽.%y_><#٫}]m|PszF4iGLN!/DQcktFI.t~D|gQyGU]WŖ-VQ Y1ߠ x7憹(L AZhg6Dw_PUĨjg >T! S!}Hףj6XE ~ |pG kKX>Fc WsuP#wofT\Z`̤U s?%~OcXJ;=,i% hԄEn3˘W<}%h@)qon9ڐT#/&͇=% i.uyM[ZP%VPKrs|ERM2BݧQw[^(>5mxu;xE &C_)o+Ի̄Jtq*zע%eA-G&~q_2rvB̾v×t]M k!1Dc2r oi{NX$t ֛tv/v|Nb~7<+0$?@t^mj f lwd8e͜f+Q_֠fM6ahK|JxU0 F?|s⽎Q'ozOGhں@u*r4o/rUg s%{wk'xI&ϠFdU&%bͻ{-Hk|Y[|R'(g-E4b ؐ/^W%-ob<ڧD:{|rt%U`+4t:+R/f EihioZ s@k y/- "BXKe0~I7߲߸UD6ʮivHT.e#ŗ\x`/ĘM,N+[9dw=ۋmj53j'sRa%.8'oylwXDщfh8#nMWJpr0 Qz,,$+VrƜ̙m&q&}X* nuFiմɤJ22D{-6G *H$dG$1rЩ_uф8-=vbJ| /-L8 Wj7$Y>|/p?FG<-@fJ3 +w٭.()^1|n_V,,Ur(lE7!eú{hN FEsת٥ 7Cہ}PMպ?ضtO~?4ڦc߰+8U;lƪW7^_t.Fÿ(,*WڇR#ԭ>Ef2䩺j4Q`iUihM董*\7# ʗ <&o`"$ zitbBݸI%S.=MF UmKZT:'DikH̨ͤ݁e,:P<Ɍ,K Jj@% `yc#O8gRl;NJ1d~<쫕kԉ(Y[@ڈ:Åx :47;ľW*WXvLH#9W2k#-'g?IڹҐȃL[Cx_3 j\ ybR]#bo)[82&2$a|J#>"[PHo{oi#4Gl5H@_{"Q|ڐ- D%}J3* lNsP)~!bgş/oXq"g~}ZfznDOZ6 mI H&h;sNNN)Gep6ӈ-{ dƯ:%G6e67dmӡߓ|p]C lϞӁ1;di{!SV^,eP/-4se(.F=< O|d守}Y꟝,mv/ZGeC1ssP>ll\@F: ;Տ' l +h(f)b翵325{ى?X)?tZ ?p_\w5vTw`@1{[Mv03~nShLFI*cBMs"mh+r~lV9K(b5!Wn @Զ!AϹ*դ^kpwV':Fh,8V v;-sN1< ]g^X62za QS7ƏYJ=\ J 18 3 r2A\Jn10Adv[Gϐ/RjuuR2 0C3Y19`fgsb$ ĀsOYWIP {SfG`AZ lITV*vxr] as+ϚYS]rp`Kw7DϣX& R* :QWUds)vqAGT&?+ƨ: +A$sR~)@|WH12,@sUO͢P^[W$5!ʬK~㦂uQ {UylW @WbBY4n7y( v7Hb!_Е]&k K6*!Gt(ˤ1=shWyQG_%xQPyت1\]scy+/FCM3FmID( L,i9b.2֊'bCnSA>ͱ>GpQ*K9O4KvRT,%塍|:m±6'ff٥^OĒ~Qw 7M ΞWPgd{0h]<|vu3ӯpŐzeC- 9!BDAkÜIV^A_ܧRT; )`vX[ AU3}|xD+0?X%N>6Aw}Gwl3^$ у TC19'c.+I j̜lLT Lbcxiwcm%ZVj$/}HCFw4UM5+XrTT?g Y8n3T_ů/6$u|x&eD^{0Oiٲf{k%~O bSfECTP ouS}rqJ$"H0ͺ_5y |7mB1 -VJ(#Q ɢhEo4o@ǀndY>8id 8~WԈ$̉-H9魺 A:vjxQMK/o\`z_ArM`} )fjmtu8BpmVUEqg5ϝ8,&Mhto _ޛdǃko?jq1 ~"4J|v~v-dXTS:c~#ƄCWo3 Լq`oռq][bPrz 8{Fd6C~~R7tKAaǨgjt q4-gANĊͮIeZ@&ֺ(8M_ɏ&d(X^]Z@ D\-,,iG& q\goqMkBȇo FqDv/LbSR~.vv"{賸2GIGȅNj| P@WQL C2^QXCQ킂x* SB+ďZMsC 2CcXƖ$v,AdE7+f/o~u{7!c {]67b,I]J" B7FvS&um a 8h)@N:>cVm<+ 8 Ht0C_J2XtokfДvKpMJKIc/qIr7Zw^zn}s2aN1KRi4@@[HQA ` QN6ހG>Hӗcmg׼n%&"Sd Rx̞+$)>3!Aso(:iki:4N*"B *x()CƐ@3z#yyV=S\Tg^7oiё`߳N 󐔟u`]զLo5`Ls8 `5"o#b,OG\Tkζ Բgt)3/(O/3mR" ?p,|zY_.֟aF%}=cˋ#%gߨzBE.G]E2BƑPxaQ|q(C(:Oj:l_22t!e~!nF[Gk>vw i0DSzBа!ѥYycmI{r&cV5[\50%RO_5#rK\`ߧ?:RN7qI*Ü8nVpsUczDs.P%RF,n`YjGmHԯ=9/rlfN:&OՎoTt\Bdǹˈhvօ"!3߿՞3۶"˿2q2*;EޖlБLnDa'{R~ e+;6YT,?!(:_WNpվTV~ A9f\`сeO:l G0R2D7GA2c)؉\k€ i~2!G]]&6v}`v!ߐ9>_mrD"6V~rzUp/`ٕx'[SfРxt+CEK<fIT\o?,)ԎME5%wsI:(;MٽD3WRI!.$^<ld_-zxZ%!sxu!Ej"Kl/fEt%_ ݌ %RO>U(22ŃIe^2 Տ*3O&ö́HNe6$o")[;PeՒɏTSEıOO"hΠ}3އNPBN`zیi d4u+Spq6X R̐*'i!wΌ]twIbon^}2Db 9zbj>[ Gʵ}jhs ?nV)I2w_#po4xk^uIo힮}i1گW0Jzp7K0I,\V4{幘Kc;qݍfHZmf\.R|Rhp.IjۘS0~l`Ss2UHnvY8ó=/'KclaiGԺ,!ag#,TJz"aDȈR%RHN1J2f|I ѮDž8U4=&q'6(ވ8:2 C2&sK7g?;KsY7r lxT{B%)- ?kdǥ1: jImp(a7vjX.Ok-::'[ęi#o2J<+UKxTf?ؘe#G4X2~$Q#<7T%,NJM8G- _VvQrw+\+qel\ՋYPFy=|`ڲ1Qwhd=v(vm䦱-vܪz} c9qґ&wCFnSIhYtotLcDwh77nes*?L_y'}.QBqzf AQ^<4=ovڴr(^ɨҍ3bdn 1UC"K)tOIbz?Up*;,phoٷ+J:F[Tm*lvc̎y;iNpك{Hغ)[ޏhH`tgEG'$vRx OJNZB꼋,@RnY%I8뺠`Ӝ_z)D7cw3yh^:=h#C.+iE*4ǮQ-S#g(7mD0>??U/3ħw:U^m1gAzwU ˯;eKD5cBjOB4и:ا@O(ÕA$(1 Cն%S.ߌ_v[c~iMX 5(Ljc0C\o5wBx7wԟ;ԑ,fq DkkYKD Kfw&Տfy;u#KIK^o0r-D>-mgCsaW W@y-fxJ.\0d^,/eNNJQNu+moJiCRΗv|9TQ+߱hhr!^eC)P4|AUѣ)6%]6dDvUŭbSʪp;ևRˆHv}ΗkNLUY"a bW- fgm7 wmqVt|ؐq#Z鼜˩vby}VUdy*cnޓYvch/|iXȍ Ē8)dV԰1NZ}J{bЖ=ߠK˩'p}ϐ.XgɇƈyPUÂZR)`Qo"x{R#"B>ynDjWGd 8Um ǯ4ǪYZZp^,ApNxSe(%?FNʯQ3J5y!j-ū; bݮ"Ψ՛T@WU֩sc%$d<ƥ#ñz%֝h^Aߑ"B%^ꀳizd/vY(±׿+ K_L* N#qG blp*A"C b.W'^Y@g׮ggPQoLN/-:J6S^ޑDm5D?D, \R1~K0kU?6_ 1|gUgyn :RO)\tq%"Papi`iV$ M;Qd1 9)h(g3fZ13!B\t;&| "/;kսvʗƼ]f1\p^;iŊ~P ࠰!+JE]}ԉqmk8ZBs 4,RLk٫F_wA! cՂ媪"AaFE{I<~$E"ŭlpJ0G9w?a W;{o]-,@kb:u2Ogb5N;قcc ZC#,޿M\HpxkٹJO$M䛬Bd$0gÿV0j~Ab1te'tDZLIW,GyKڐLC|>{ CjkA4w+SHX{l J3'c 4YN_>P❍^{-0G{ iW~COl9 _h͒"gxlaMpK ϭCᣅANBK(\lgɏ/;soS{L 0)AŨ2tCrLxhꫯ.M_MQg?:~Wmڳ͡vhNWBUX<#ۧ޷I I2ӉNGy *B6T/SR x 911y\Od-{oӰ_yGsL'ؕ01>l-9|6ŇIf:S˴7 \;IwM#09ݰu<U>1T?^ś% b<x*!uƆȉ@ԈTOj6)A 3܋_bI4G5\}/Eu]c@dY1ńN Xͦ`49׶k9rՇM4hJCYn %aü:@ &BqIcFk~8[&oz78`o_@.bt>On1#1aN[4y>3$=α rTB8bb<nO[BT?w sZsB! I1"6 b޲lZo7D Γ”wy9!;S]lKSO,j=<2wA2%qgOk?juܧu5jvEXYKBFz0~~Ĺ;֪GL" E~)W=4ؕ f>HYs쎐dLOk#^Ps`9"cq-2V D\,w b@eLz0Ĕ|U3BWÀM~~fZ#b^&L*ZVU>SRq+Hl1Zm U@Q Zuzg3k(ѭPUM:QvѮB[#˱"]uXCx6uy5|R<- PXq(̈́Jpg8d V2^?8 UE$.*aXc+n4h/âE }'ԦmdH@ʙxB* Hwvㅧ{~PύD^va u0~ٓP魃x(9I8^6`mk7/UMq./{<͑1 #n(<YwJU7(o?s + F2u4gԊ E֛a݈c!>:vx6a＼?yzbfLMSlu-lXP U;ehi<2 $DQcѽƲ mrt'\O)ĸ> z(~F #'a/K0oxB""(v_`8V 4MI|AzLſ 06 á!خcpD!lܛcX6xz^yZ9H y}[J@?n[6.9I$D?=u8B!~܎S,Ho53hʓ{Z?0n9"čl=b~:KmYg̝٤L$sveHNmDOt=qeaT+;ԳG>lP/Ja$";1`؎VOϢª6:Ʃ_7рy:_ zrpאI,/{ChRQ"bƴĜ>Ɓ?{4SA]*(Ɛf'͐&mIbl_O|yϛ7ھsh"NBX !Zb*N/Pkt" js8BX<74BGǸPM"%jү8ɐ< ŐkRw[yx7w>mU"kReqg;!ؗ`WCE[:}RGY}XF5E^=v)ql ݺ{%%7Nꑿ[3 SkyW0F)s|CgE+3{<^*5Ud^= LzEHk & ׇn x l{K-#NK[ZBA}[ů5 5s <>6詸7YGJN1.N!Re%! 5~\ .\YG) ͞8/N(_2,{TH[va 4Fz@}]<*eG̔hRbn3޿aV(kbxxbg%L&t|vs`+ INf2}_%u]H/@OB|pK! 6qFJjz)\K] K p 5xCY0ޙ $u265u,ZgPq`f0TB'F64\Mc1_ !`WRg6MP6`M59^UrWgYU/:xE)ml1;_Yb܅:uW4uے!ADz@ ab HiVo*)bpf]yGh2WL:.WlKҿ ؞W[^j/w`lDmIN5$Ct$l?kSr,'$;]%mvt7pdv:?_˽~7aI7V} *n0O@^ZpD2/݄c9+źoľƮc1n_<\=ɛ׃㤸րKGJXG{-ٹ iprǯC[XB3 ;}o$v0hG;j]}#HJkZGZ+n1㿕l4GE HץyaAT7GuKYF/d!<"8{tB_tpBS񲅟2Ǽ;pTfx/r4l-Fcs +\bE+kEץcz,AƭC9DՂ)͕ m%v=nSuI٥S".WT:Orz^ΊV1֭ɨ ^CXocb*T8SR:g2ӭԽ0; C_q:P҄%΋,Q&;pY xpL8Fc@uϲ!6ZHHZu*/h5~#_nn Lu> {^+0Z")J1830ddG<|τ{\#ЂG0+]y$C0#I!2n2Fc10Qғb#gS?_iLU(sF-ME>ҥDC!8@7t AIsS&tblZv]~))Dޱ`U{ <gvni-(tW/2MYRtض }㋖cRH7W[IېOO5dḟe AkV(1O-7GPl+NJ9q"ԕeҟ\ F5OG_y){lw.ZI[K蕑jzNO⅃uX]{l>88>v~oZ'KU29jpJ_=dNA,kSzrz@dȲ:X iK`dg9k^Ib8d*s A)h=B􇸝:7`(я14SR(҄tr[obub/gMѢ-Kɢ`jt xWqTiȖ|&WArˤ84BoתHUw >%xUШFeyYk4y֛'OzVUS`tvD@WuteJyn'"}Qox՟ @VaFl~wvW&e/ ai7p'ٙ{ DryH aQaUV!G "T3z;"R‚-r`-Զ6{(SAJ6 p=.hhlGQblb}?R.U@:4N6ط0}gN R+ݣ#m63́79NfYCo'0c-+rW%IeU+YGp=̒ 1ߣօn:kun`;ont kѝ"d4+N`c =eJ!ar*ۜѢ8J( np"}Br "}PV5`I|(58Ƴm+!}F=⪏>~K`K/+X$S?Thp0kL!D{IF*䉾HG@1*T)gp؁VOHǵw /BA JJ"CFNI3;Ʈp5m|4"2U]z%a\>08wFpO\[Fwՙ w$j(S93\/T,\uDJ5Kõ֎6,嚑 @jFPs,q|DаcCcb Ӟ;kxd˸9 L/RܦCRP ?'N .6[ʃ!@9|3m*P[#PA*j"6o+^ɩOl -͞gy59yv_W]w_D*IEɏx,s;Z95wSO),d5 6E<|͊ѫ`EW!Ya`[UL_C4Pi,]T`YM$֞H.Y]' r] $GJ=LQi3 R > stream xlcpf-$aǶm۾c۶m۶ӱ͎m[}ު֟qs\V՚HYHHP`db`01Ñ ; -lE \u @h`da#{8Z;()YXX8\-<N.t.|tR@5 ,))'Sm#k c1 H 0sXٚXݿ غ!fhgUS ӫ mM2uv 46rWw4 2&#-t5'lb?GCJ  @!lgc tڙmBv&Qwg hC k_EH:? 2'd$f4QpGrSCw\W{5ie$$g 535(;V0 g |YCgG w6ݿ_-sebb238YL>#߲4[_3Lk -1P^a]F27?½WwC 0ݽܑo!6"ONEྖTn+5]CAD9gl*PMdJ93Fw@lǯ->ڊSBFSנ̙^"ܐVi?vba dȞ.#S)(u~-j롽'_+H,tATSM+4AGmwd[ڽ2i,LHIlQ.>nfQ&+6y 6ޥj"o,٤]ZcWx=h--'VZ 蝩BY.دT4R:<<٦~兊`YP]+DU^9 Nqtqq\pCGΘ]=nb -aJmBu=-_6^Z` B& ^ GF^N:sO$ĒZ$qܢnNH5Yݓ.#=rj'u29?gؔ|=P?7Sݪ}*XD}t@)y]AzeʽDh>- NakU' \a S.*h>b5뽙R_ǿ4Ʃ7-6Ȓv,"͙s {vI TzjPp'AoL/&M>K~Onm㚉r@?[:L{  jQM%uaz@v"WOϢ {JvKGP!Yn 惱.^HYi )K2RJ4ԋI6}t]w~ֿú:OEAi3`,w(z`/aCaM>qjʞ$|O4O3TJ I؉_3qfD`m;σ]Tn,W 2_?StwicaWpe.nwz5\Tk` moBURIeK1|OO'-GG g"*4$\y>;jC6E(&U0eqBjW\ӢH+Ik?u5y`Mپ96l^ vedo#^+)K{q'I%u`Ek$ΎvhE(4:@EUYvil1=Հ>K~N_`Ҍ *(U7wX›~j(S`ίd݋ZGB#:ŐG;= Uw1lSs.:7[9'K")޻JXfKڗ2y3YoSU'7B&gq>wx"xy\֕d|X߻3L\ʏ~bTfF>x(+GߺѾ(Zdt\iZ`4nNP=F߻cqe~̀a!>@FŤT pgLxH{GSهsoR\J |!jdQ%DaI;jg@ DgU.:k!fk:C(~? *Jyj8ge`>2p rhJՏ5xF\Lr$V6鼲͸wiV2bVfb.ru<)vv}ށё7bq'zz}ht޳6i=|Cځ s጖V%irL[F0#K24#v.5 "C1tx&hfk{4jAzRF~#/ KaR}_AuNIB@EڽL'wy/Ygz<j\-zmq3Jp2ΠY\qВP/CyӬAZT!6$ 3\~BzIئҎrbROz@wsg++BHތ6rʱ >(r+P Ă6W[3ݯoPz$P5t".cT%J5,$Unee*c.^J0ezqzX!tqa#/р?CzO̓ ۋ=յT}}  ~b҉$zظIo?/J(Tgb jGVl0zKL}>/Wζ]٨qK502Г.rhm LJuxށ{7:O$wq~6@D9=m] vS57e)i%6FpnD " Ժ}4` B>ǀUyl̟A5zmL&R6Z6VBPqPqtw#Z@=ʸ~sXS؟y 'V_ENuJđ,kLQZ#-OtoZYq%ǽAsef \ }\яMZ.5m*3mtjAg;{ (}GKn./ekz(|2 rjGDħa\s\8)5n=敮RN߯ɫk&C] {1\g:w LFBqkhƶ 6e0ª%}HF#黵Ke8*qS'p)H70i4}x.(<_ohP+B-^V&Av[H2Ջj ~jT!'957z&Cp*SZc |pݰRq&rJZ ~Ս؝,М3B9TX̘aM2'B87L`0@ރdMQf0T?ZL \݈.gC9~v~ۋ6ڍ~dґGR",OlOv)93?@i6H >?@o%U4I51M^0At sUp#)G>eԼc% h.2t]은F}<}FNJ{ՈR ^̃%S|h+l.f'wx,l^Cڰ%< 7ADWJ_)2iQ !޼7uC|Fby[_sܻ1rSZt jɛ̕>F*! irA=!+w9+'t(N6S }Y"}oȖ'Wbd^au&4)rX Ϊ=gOs/pE] T:;LyRu?*P[yтO+ܷה-h^n`7X"aM|2[ԔJp|%b\/RXt\џd V@7{:Q~pR\3T H_jKݞwaFy@u,D맣_F6!sֱ 1Jng*gOQ%DYLj.·֊hax1^ Yʶnτt|A7$8i# DkT<Z]m sr0a-پ&@V~7J Ov!ͥ^Ymww %]Kg,ݫ~{ ZQvR/ΉK;[4`)(ՃUf}^'@J׀ć<!^BEL2mo$Pe CjC mfȒws*X>IWg_[J%*8iJ#ɬ&:l??k2m,yގ:F;pސg8TuNFC IgMz֒ z/fSjЙӔW,pF^yn5Kx'"5K_Lk!<6x2jU%/Qwx80ƞn*+Uـmǁu'mw^Z^?ɘd]"??}TWV {Ihwfe%:!-d z8#BC 1B)Iȷ)A=,[*JL ə,2Iu6|t wQ{>9AAfFt\h(w ,R̥%EYֱKy&vA0?$ibhJ)P2T h:"/Y, boM@y9פtn*tݖ8$+:MHTd踘zSov@3`} 28U#m*KPx.^{,҄FJE/ AǴޑw/l|=k~܏VXee,Zio+L#\`w ׶E |W>KagZsj͚X)Nv۵XE\{^ ֠յk8;wr~3H da[qx.9icz`Nq7VVY bǭ[ulD9K/0p&˔j]ʣo4=,VWL28'Q#ItdcLz2;h(fsLNx,V \KP+:aDiT_>e cP㙖_˙g?m&o_ 7;ܰPvE ǐA{$2܋llNu}y_]52ey!^="ro`hȷ#^FNg)9t5IF٦]WxV7궕.%&|ΑwuDG:R$n?Uͬf݄&x,zS%FMDrGq]=;-g +Sl>bUhg+dFm ht O#L %O49oԎ#Ζt0mr*;} 1GA `פ=P#i,,vv4Š7RjbdHw{%H)蜭.rmJmֻuc[RUo{dOL 'rlu&kc1p.oԤ?GS'$iy]>gῌY߶a_@JLٓL~:@^gqLRTul7X,oGۥ1]ŇΧF[$R)\+ :Ð&Ž:h-:Tip@䃾m#QiSn`|o'tXD)HSkX>&=N,gPdh/w9Dgxy]}i Ø%|7cz6[cE:U %7suS1giNPLPy8o6xb(5M-$Q%t.HtOukݨ;_G`G|Ѕ!*+HLe\uqwe/ Hj!ܐ8:N:1ӝ[ŽE=Ds̈́j m߉dmʪiXD Y3>VB"d[$~P.,A$rK*'󮺹[y)05 * [c/{p9d252`I^Z ~.Lљ|ʥ` σy;Tw? (lfBՃ@Rs֕lcs% nzs%9|!Jll4ƿ 2"o n'h 7Ⱡg"{8"[hw) …Quo)8oQun`1ihAO6jL><<%3j @LN5+͢MιFUVR~H#xR lMSHc|3SGe9vG4:H<F1Xw?;\:]lq^k/ 5tS). ؍bpDZNK\YMN6vۈR=ݛL|j fq->v{ zQWv]>{y+=NbW//Û@t!–z ;o:/Co飒;O|;Ju^6;sI`#K훐/˙5Q?9'91  mN OXr4damԖobU3 iɵZeV 5UH>_~iҘE党 g2E0WFI3b{jYR_?ˋ9${Lk݄Pz$47WHD \4G>~4 e2IJyp"wkhLco[ 5nPf+U#6 Jb!aolڴaa ~qCM]R4:ͦgWV_i2F:|%4\ZFZH|~j܂%l O FK#g ft'1aH٪E,Z)N:)wXsaNKTo5WqPL~yf}@PZ768c.y{4,׵k0~ɔXa+]щ^nt^P{``AR?}ð؜dp nS^)pџ I5-9XNo/e +ߟmmm )-;6իznqh[foy9fbi~HC](; ]lTL!`!%҅3#e|uzl?6r[3Bg)>ou*QGF,[H!ϒͰU<,_v\(Q)&>=M\/ewacAbΊ >>͑\덝k'uJ#+<|n%?:sW U cV/3>s&sK:kCrи( sC3$6;',ku ⽓IR鋫i~Ѹ4_,H j,ԟb\&qKT{d|% Ɏ #Fa>3"pȑdzSn/^>AX3g~Dqͤ#]g> O@7!)l\ۃ{H` ,y+4_$x6 lX?XizrTGyzgb͵BK#1dlF]-'("k}6/p~ "Zm6A'Y4HnM0xߡBpiϣiBN}3>ȅRÖr!F\RXRf.D9) U756Kl)HH c}zo&!RuH.ˏR 5LX䜸$)RҀC.Ld+~_/ A(z&kI$]Y(;Sq/}ñmD!-qϠ7 !EyI)-ܶaʞ`g&c4xWbUal j{&(E|HwiT9z`*3|ْ~2T_+KeeJ*uqAqޙ cNK q@6b'Gk{…_K!JY#*/! [6QŒS 0]n¦o*kz\$(+>{":,Ӌ]S`_ ﹲ-6u_V wΌq@uNNJěP.a"TUm@/FGR(.g6~K^S (> 1iym1VhS'MMEPaŘlI2CJsМv zu0>yXE7}L[`_!vg,܀|{'0aVX]a>[ڧ嗟~LG/T$J݆$v-S{<ô|3U6õ!vz^vtI`?**ʱj-~ҿÄ;t:bQ1YfX1i@n\SuMл.!iuRn ςg:wꘒ f2=0v`kDF졅´ 1kGEzM{z^3峡zH KBGJ \ D5-8xgгC6;HWF^`̩%ʪrAy [ԡf d~y"!ā|V:AJx#-\JA\!!.J3F0@n+1+~4ǹGP>B%V !s6C:ƪb-:}$KHѩ4N}2'Y7/(=ofsW>U* jZ8 ": hy_ dScgqXTL]Ť$7rMYz~' <€*fn<8%$rz͛0YjI͗uT]akӾ> x!R @6wi*[ >3J, i2$uo%U{vN0wTr* }16\.i_ԮRt\2~iHVh&a+Fgߊ. 4Hf ŗ!N};턻Ex+N9ɲjfSu>_`LFΖjoZFBEJXS3a,4}CāA}k3+Cr 6!_f$4)ƒϭ<x /;c"V&^WnYcwT\@m QtOBOiKec\^V:x]s/bsVoW|पScM|{os}-{ȗ](p[;Z+cĈ*%mv doz*uGsg)C? `Cn. V4nW*`d&'dB]MWN M {~7,m;D\.^@H Odmެpcǧ%{}臘6(ݖ3ٌ5߷'LY?ny0|MY\rFiW ;hF1U\F0fŲi5=iNAWC++ ÙpěűcURS}6w=B *9gJ%zJ"2AW52C~$-0o ֔G~ }_/ 9BY}7T ܘ 6(a{7I6vLDtWx^v$yZ݊dYӋV^p'6ooaTPb#234VGShՐ?lQ#A$'!lyj# D#0˪.9fyll5|Q YS{3Y:Oy`>֩H֘j5"7ѭ؆~!*k9'[aDnp|?i~dR,CۺC!G1.t1MΏ؈ڈ:7Y %p3~B{_} @8kVP_E3 =)VO㪥Lfk3|k|} smtZƯb_:ӱʉCKU)m9(652'bpzU%z8Yy٢dj2Ч?§xfעl-hKIVV<@{f GJ ! C0/!v*;<]s~}6&gQmw\ "؝:>cNOb .eܾy+l~Դ>FWz{di(bI)Z%tz,`{E]`H&W} @^ t+k,sݰVqz=iLUs5ں//FI*J.0'-96Z, XByOG$Ml~5fFԿ0浯"Y=8ƨ3:)QO~kL:hk挧/,ћD^n%gMîR22swڑ%oyZ-?QfӀNڇӡ.L#KcG*#lDx ReDž3feX%M7c+#f30|W */#Zٹ!3y?^ sڬ&E[v@aM9PUwu~.(rfl-G T0`߈*w!s MY p]Ιs1 Ӑ$0U%|Rĸb΢sF?tBn a&S_Q &^>/9ĻVҹ[(:[ƚ,IOcJӖX|D߂^Q;#e< O}0hˤ*`h/l1;/I`e1V6֣ 5T-5+Mi]cSa]Θ=VS7o34?-sOh["œ'hQ |`yǙM l]s_D1%rڌQ]b쏐 i%L>܍zfAmLjkBm䀭6G9?}c@=Pv#QgdExxyJCBI 8s~N=MLU R~ MCLßPJ_6i9| I(L%$urJڀ)UڠmcpFnBU Lŵa ~iW 0]@fHeI+ڀ:YdyQpOLoDͻf!JNjY].(sG5>Т^2p&/ZS7o- Fُ@ߑrJNшFb> |]3E5LTa\4>+FcՊ'/AdLΥ./#>f {9>vۣ⫩ѻMn'+fuٙXgl&"7oB6s#FP\f~ !q3='V"Ш _RR=BFpiahxtG+ s+|cyĞCE!WkHԚyz22){^c++(9b)xYOS^.\t: bN)Y[\o7r~j-T:oJ&V@bL!Q7k:u%ߨH>+yWǶz`DQ>mK㭐lxP˩oeM{/8eK O}$l̛v۝&Ay`_l)Pń=\iKʉp|("mղB0@n+Ǘƹ wւtKwlC}H t썛Tȥf)U郫n+DPmT Adpۮ`gqԥ*"SXY3P> n)iTIqÐun(ͮuY٘EҼ-Ql8g3;A(?kඥ: bAL *_JޡQZ)]QTүD@.`8(cѥ>~9 G[1.  5LJz yK뇩Ho2 HuFs*U=_}O<֧z,R{T$:V^EO{q H&) |~4[Ǻ$AV<]!iGlh(fiSSK}𮅜}~-%S(þH} Q0ЉkcR/ظ%V#Jv.3hQ} ^"ǖӆDxJ'W,> :cbˠe{mbgܯ‹ OHh:"9s.&qW$á;}5lr(9Nw~Z=NxXhpz!qu=ԭ}IrjD݃ H#2bii@v|/Yrbf5,NU 2y9go\> < vڍ¿Vېz窢NtWe9l? ~L~uCuMdzDUb7p'i21MIgF/ӟ'>iDnKfKݲ%ɹ"R¹̝NLtT0v,Ҙ׮د(# G~( QE%ސT5&b) wRzVf˂q}oGe09f@9UM(^A7sO#}-|~v/h.*|<^D^4aucǀJ83V  6 _ۺ7olŗ g^.$D]@,7 ㇨ 8QAqߤ :LV6[* ٩(magV=r ~U7^"Ie4OSvkm=` EF@0vxnR82[1wr>&74oɑ# Ҽ֪V &-gH}"| (:sR|n;6ۅ#vUwOc!'?Gm,@nU#%8Z,ۮ:'z<{vcPؕwԽsek#% T`m6]j=R v8Iv‘DtB`hhVz+⎟ѣ p:Peb̕E nQɒ"FH:ӷ< endstream endobj 891 0 obj << /Length1 727 /Length2 20312 /Length3 0 /Length 20884 /Filter /FlateDecode >> stream xlcfݲ-\zm۶m۶m]]fm{{Ȏ#XsZdDbv.*tbB,, _0ddN.v".\uS Cwt4pPS P14tػY[xܜ]9'Iba 01+hJʉ(TvN6W#Kc) `_?̜m*br*Qaza @Ft;gЦF_Fvao2}ٰG9b5hd 1|pPrkp;d!/Ԫkw펃$e⦱@ڽ7a/hdvWai 13D1\Dp!rwIڮn߃>kak=S wE@~Hʁ4»N\BN;,KVIDt #D3oД %򌼵 =>q@0~]o*_ω=f\쒼1D/gx"AÀ)y5AL~fWeTWhsQkvSF,QJ|f* ǓtN .r.ڶTlp##>1_ 97bf%KȒ= V(z]flgEoհ>1zȾD #fh{b!>BQۂ8@jI0Ho83o@&bvT2}t<]wd@o3u'CIl#e87#q7ҌM`vJ'|6 lo_=#H3bo;ݡ#"Wv͕V%SH%~mH#GCTJ{ࣃ^`͂\z:ep| ,ml iԂ)/mOc1 ou{NzS&⬥_`Y?T;o.mt#8,/'ˏ9/ me93h,t]6SV͊iݛ A%Mn#yO8o'Xc޸ā[rp&eO$S˛'0ſXF4X0F.wBd*} E _H 9FQ@2{tp^nlwfoxN?jք3&kyern@woWAE xPn4 1;A(Z*=kp#A'F;~R-{|[b{$؀g^!qۂnҐl$CRrU.r0Ww6]=p {aGÙL B?.uoB >xzx7jʁfCM%.JCh+UbVTZGՋ`g'OP2̾B 7)ҍq74rOݨ UG5$\"Gy}8\0G&89.b7BÛxT[2|"[SȥS\8;_5qog@'׭[M1I+:u bI6ХVvLb8V3;Q`Dt$GlLH 3u&4!=FO"LJbJa+EEjHvv=\YC-fsEۯy{e<ZjΞ@|H~LRw-Ky8BlxdL@_%WYU]!r!_ cഔsP3qI{I<"\hp&b(Y@{93 U|o.RsxI/Hq,-bmԀGXc7;afhTk؎Z oѶ54s;"\c%tGr1o*>VE\c$oňBj5$d :qhsKnP /WY ^ju?=RW.qA*Rه7,x$:L%uB(oS97W$ܞP|T"z_xn9ݣ F;.gLUmY?JFܿe #naU569^8r [+ U\vȆn`͡mЙS oqu s^>)C]ɶS7ZD:9A@f_'[SSs(,,T5Ǒ^ Isr5AKup IL2Ez&?Q < 7%i&k,#7ȇaGk'Um/e5i-D/%FmJ؛$,\B6% tdaoI6kG* 71,>٭=ɿ/椑yH3UsywV!nt 3p˔>:{{`ڷtHmA^_9 vŤ b/x҃;'l V[B\g!R1'3O;tdK% ~iL4VBUsN/Ş҃Wˠ}I5ε4A|JńlHm-hqQ~#Bd!qC>)u 1a -mZ۟&ɩYאE>cM; S!  _jwN3LsEۦrk(-ȹ衋m^i~A=iQi4`dɱbYd/ʩ,QMSg4,؛$\%g.&nP,<)d; MB#0{G|4֝EID]%9ze4ymFIw(cռXЛU11]|i~)Sά,3y(dyuOƧE{ksl<.De&K}n٣8x?5]]Rf 8b?Mkr9)8Oѕ+qx*Qud {WX>MuqW‹/~X[aב@ds55{AZ{(^mt!ud:uo`)o`9ǵ…OFj܁KtJ-G B"tfX~R"z kXrnp6bC2[|~oaV΄-]5@2sz |J9AI"$I:q&;=cK_9^3]I G_0 <6iܣZ{3kuLEyވj ߔhTt6~K%7PQ>@{Z~ž\T^CrAieyăl4qy@YA x)B*E|"a#}2":$<Ņϰ$9˷@ioeDDK7yyؑҞBcTF~EDV,Jv2_۰А8uaz?gcgx2єt?UȍW?c4=8q@5*z?!Gk$7 K!Mu19 &뽞"qaB60o٣ʦۭ|K*> 4e1/ym&[$m(+؇ : uPN_ya 1&/'}MqVaz٨rG8h PkvW8iNѢ!ykw<7dC"Oji.6Goۯدq!%줿9a!D]9#wŚL(r!98VW[ L0hſ5C2oGl\%{yi- g]GJ]5V;Q&AP]!87?$UYy<'SzKl=`<zKD?e?vD.8y1ATśadR{N4f.ÌJZrx=FUd}l/iaN.i?ہa_OiA͕ڗmAVQ:S'ѣ魥W9 (ͣqgM2ɻ)vN0+ukTt1f31.-FGf CyFԹ9H\MSGdXYvvJWpգ&&Ji9zػyyD=c9%IhBEXLN=!`LUZF$*=Q\Dun$@~?{1Q_ۚ]EOr:.$g^'4UlĝOM {SbC傅3#,DDg{h́- }+5d\%tގkƯ1iOm]͒(ARgg5ttjh.9^fSsOgѲO'iLܾQ\ */W)R\=.csVO!:;4IBiD]r6p ?XvM`|I՚>%<Bpl9hwթOݦCH^\oa;q+0ݫصqB)(^EDvW_0$y=LV_>OgZ#J}Kr" Ӷ%V+_#:=66 |;b&dߝP* `PAo+wowG_97 ]c >i܊fͿ*lhL!ӋN,zI~1W}F+pds3HIlYy|wB2SU!\)eazRdD4/pvI'_Q(( T(dϒ(IР%{%[ dnWJ,+}A\BW;Lc}q3cm pX5K;8 qX$AocsCRõ#9 Z}D1Yӻg ASƢ?UGc*]@5 86=i"R} گVωh2] Br?:xphZܻF#9铪)FIZ e(3HJS G6 { cvScdڕ2.鄇Pw,A ƙF+b69~!YŎo أ1ܢ mJӷXkw]NV˸5!* gImdHw|3hwtޞ[ \_=fv ɍ OྜFڇΓ͓B|KEKNn`4‡&`(a=@xi !E|B DV5gt:15}>>:_nQdD}|I`, ȡ1^Sp-IX1; 챛)ʀmU\;8 4ɪ,FA#g "\W10'E΢㸴pI.T-Ng=\ XO~AipYWi}"wLb3Mt @q,[R-!60ethS Ո_(fYpyTy݁+W- v_ W+=NqJ: 9}^Aϙ uBt/=yT}(/.MĽ%CO|5[-{pOu%B ?)yo(RS{l=U ӎuʯ:Қ'űقl:OOibbٮk5z>#p>չA}vKky=oxB;gT=~Ҫʲt2_XdY;2VzPI.-^R|2̪}ʮ(U9gMf+rrj/BD(]iQ?deCDD{lIRGC,Ď YhQHt.7+10rQW^ B /mnfe(#g: =Y}gx ^e;]lMudk!ds E1HՕ_Ojc[g?' qॊ-#Jc 0lEhn18C;pه<[Q5Z iQ_2!^7Ih%ZᏒG}hC0Yt# k9&i-ri,p1ʃ%B+vXkˋQ/L׹'J9f#;w>Ns,/t%}lxaX.f OMQ~/(ߌlcEH>3jǔ=)C[w@1xTrFH9;U)?6G1cX7S>BaQk z]?Ob/4E(SBUcZbCo S/ƳQJw|pnSk/UhRV{|3,eɠ i~g[n  yaZ:ǤP G~hj}I uCs~k/^te3Mcmr!b C|_n+x6<7ш08B:NDM7RHW읾HnnFD X| w)Opp|" -Əslq?g|5ǔiТe5#!aQvX3zNTz.f$pc5M'"dN\5@a=«dk8=q07ĭsԕ h3$ ` qjgN_t|<՝ցV~dS8dY /_ 7N4!Md͗i er]gc` l{O雭J4{QX܃)8PTď';ɩ684[r@8> UיX|+*"cd6A}'Ë*:_4+׏yPP8|3ϱG $5@J. :c=ٱ{.2@AIRzг.&%Xv]^!=Lj#A^?c2`/e)b=nXrӞmBTըg͓ƭlx۱Y< ~O|Ҝ-}ǵa8G5G0`=vdCWr{? ~m%ڳ9&\I݄Ns!ֿӍs͆gr\3;$$$CѸt*MW3DuMX$ŕl>hR5m;"HbLеZҪUTZqˁU| .cvH-h%"<`SBDyGs7ʹ(Ơ5g$G/mp[\7c~DhduXDp=_+QȕMBnv{"c҂rm,`ڝZ gO[@`]%ąAzK+KL$_c.W'HT<[ʊ o)1~K3:`4.X'7g۝%zSm.e`ڇGNCn Qœ%&~WJ@I3&Ķܯ3U.ph/0t30@+Zw^{殤k~zU¦źx!z faqZV=d7]tlQncҶ2;%}oQ?)=;r1)y*2trU1^3ec`25 LZL?)x)>yZ[I˚Σ߇L K >yFIkDGtmhz7l4ޖُh¯ѠsX!+쭙r;*:k%ao{d "s9:\>y2$isǸYh Uc,6=94wiC;Ggk[{4YI0iaֆIc|Ѡ> QWC ᬴yuǖ=`6[w}s"''2AOשi sE~12F-E3ͬI\>_([ٙ8߀4aO9LMƷ9ҹBnS_[oD)ZY-I޶f@mZLꉧ􅍿_&HΔg:v4oBxSɾySܝxgG/a? zm8]eK;yDח;?b,fb 'fhS $[ˀMԛZVS7K3/`"xUgTR(3IU9#ՐJw8S,ߧZS6<-1&/GF.Yge<3É0e"83o}Nޣ'EuT`k;Ks1"6˝/E vtfBEJ)0fG 0MkBkfɱ|GiC@P\Ź3Ǽ[z@3293an6_)C?S״…})RIQVzth@syAa~r%}mN$p5S2rM*qk6eQ&FhzP?{Sh /Q/CJ_ W"2[\EW`hRZgF&<@"!&^E}#@i( 8mᾶW-=͝wV@H4m{#;ף|i!ę焦3=l dHFͧ * P:#˩)e*rhqTmq]x 9C!LᛜhBKmys&h&>Qj'~l J!dc&9},UԍHbOF'NVg$tYcϒjWT֞`~S-WQ\_֎A6dO kVjRZ?d~[DYxE!fbN~rDR: FO! $iHWL;z֯l ~ǥ}T!8Q[<C4dz"+θ8}oXJ$/@0̀ ȃ+}cfC̽r? kn~M؞S+ wo6fqeZף O17l*i+_/~U"nFPxy7@ k,Ҋ$&T;O5poּiY(!hK4h\o%cY{9>?ٙ&<`6qsKkc)]9:#16rt {gZHK>Dt)8)`x Ly9ߨkK7V?lYnؠQ3aѫԮLNB hV#XKHe^fO 6hX OWkK+WA<u&5ՁZYn|D(ߏc=z9q(]=ːU!X-)YnH[FQU %7GVw (~2k\wK+8 e[}2-#H[՟ftR6ZGݴ%[֜00c3 *}z\SZa§i<*R|a p;C͹CQ{VER|% t65ÈYe""bZP SgqVZwIYNJ!Ue҅<朂"6Z {q ėb#V}&wAu*l3s~%$VStemς2XeP<`"&[PJNp@tͦث7DV̶mί Ԅ&mA~PiD[B '.Sms%ݱە)66Ӕvq,W%yZn#|~5'sSUHP%ɻ8jRiJ[sB`QFR-n5)"}_lIɔUKӕ5 {>(hh<.oZO/RPDq65i0% +wL M6é0 *iz*M?mjGj]Yu{]BnZ;t6K ©A f["9.Jy+b}iSjJAc95pК l3 1).OW;vJ1IJo-z Vh12R`HK%욄(-!p77.@)*sl4+mdm=m ,*rW(a{*9܄WDPȲb'L!Saq c)7dgP\ {?gwcFke#1:ׇWR[6F/]6͵^$GÓ?$^)>!<_WylѨxΠ eb1dӏCE{Y YJ0/r EI{ޠ3|w(?-xu45z2u< ѷi_I(ƾrHy1g+nӍF\#.%|ť ^gBs&&-ۿ~ +$X_遟`瓀WH=^8(`(8 lۙcÑ}e+O]XE tXjJ)8oy%>3n].Lɤ"6@f/Lu,/3dyEda33lqY`Q3;FX65^Wr מ?åPaJ{VLt26يӴ_r.a/:w r0I <2*b{֞wYE/I~]B(b5&݀竺!(! ҇u<6#NDy2ߘ)-f'S'UeN7}Y5M[uiެp0Shg9(V9 #* C,T.鄅` =hʞ9p'sx=>0uajhFdk\30QѢDU0;=`ٞ[͑ {mrSBw3H{9bz]~ә!i'= i--V,^6vqIcCv)0ʑHzU>pڽ ir%ҷ xё9DVFus}1{Ř7wG‚'ga1fS] > (A4^0"{^ G'BWr~=.Aazdw:\O#Pt@!k W?žne6ѡ,4ec5],)|:$0 1aP;q\4;ͥXa/ nV;}@6;;;424ދ_AqS5Od5#L߈| 41j)V"$eyNc G[̤IR G/O(BBH6[RI r kn38,$$ v ĘÛn#2ZU/չՃHE%a30湅 Knle*Y Qhl*lB%Q笂Pg6h/=USo/΁k"8|yMhh^նpDŽJG0lA9DQ$1?dK0 N[mG9_9M6uPǷji`ܦjDw8(JC|z"P.8n:@͗QZҾ&)y׈xƢ o Ta_-5GBuO,hiIV% ^5Ud-H<~qr uDN$kZT G"ON]{fJE3?HY6w3-g0WZ :sl[$P bA `D0]tAsOMMOrٗa,nQ;LED M; fb1~AӤ\FLpP9p[?(;v;ޟ6c}̬DUΩ.[7auytk!]b}(Z^P^=9g XAv̻&$JZ{t<@D [Ċf:b2 ⓫`B"(Sh 8\/xhɍlBј2=~UcSf4ù@#o(Bl@cK3`01ʳsnJ[0 ӽˠ.G%MY&%S2ԭ͸ D^ny.KE^.F MLjts޼Vs\m¼OОm\fs\im;ru[]w3^j&yVnzR{?C[tbHkzlub+UB.].2^8Jv俘뇯^2^%`iz%?GCI&t$w[u ,l$"x w2!6ߣ$ Us:`ۢj#}$3A&T`GZRyIv_:7^S }1=,kr9v;mkWWܔPtMC1M ReX*\~015[w#axdc!ch=Q>xawh.ȋT6dNd ;[Sv0l$xx؞퓽qyka)m8PϞfX矒246X@~r\0锡9bɧKm$i@5yo) ΘEM9R%5=b) "^CpzC!39 5o`.;JT+n{f ţ4aK\nTѦH'X98%N¢N+8Ü!Zm''cDdUX$Huɒ"47"8 gn?N6F>t} 7|j n d%| bb~bg FNXXMTF| z߂qu}F)+#}@irN^` M<,%isp}S,Dž)Su '5A~m v/lb(%f7W0 sA.ڇT -KYn:m]m(đ oC~1u|v&G //д6/CS [ccJ<^V)BC_î'#ُ51lgsSɫa[ Dݡac p{z)v<2oV,٫ƿ 6 jhUXH;x"vdo}&|a|1vr!0-^RI>ƕ| Rvq׿$F1//+|,b񰧨'\z=.;V]]n}V u] %*<>G#huZ < wv@_U*;nc;`"#m;/)y &Yl8Oasc\HÄrP( [I[#x#lSE ܷ 'NI[u.֌cwbuyԯ@$P'ݒ86h 'oYgb;m g@+cTwvoPWuي3$ a,u5$go?e5U>.U͡r sY.Ns" IwI{g.%wDנ.ބݼ1nSr VIWf#2 ct 4G$)9+DghnkiΧ qͣ5ƯhMO6G]ʁRCҪ͗ ͵kRh/JCirigG=T%„pj%[柞t@DG"|}i]C `:W|\oiIIܚDM$`u3ӎu\%" ˟)ǥ`9e.+ wGY14Qv؅bʠ3xd\5x/_`O\N)_BRم`2meqa軠yZj-3Ұ{iotk=euo  \ZCd'YAc}w<}X)k#`w4C !̠[b!5@zo3 G?X]t:*S|Q!Jhyg{/:GtiڏO%q IỞmog$hkpDfSeDJTբ{-ı }1?H)]ʈ/( K~qIz^tHΏJ`ۯ[MB1J@#\ -@DX Loxb׍+alF endstream endobj 893 0 obj << /Length1 727 /Length2 11129 /Length3 0 /Length 11721 /Filter /FlateDecode >> stream xmxeP]ݲ-48 m6l,K& `e"QA`+ Kg)?AZZ\]]E\\.BLgK WR֖UH+@-@ oe wA`)_!` ;%f$Djc{3r{g'hMpek_XYfV=t76sqO/!45]lmq3 P1@3 h?Ygz[U!+')@3e+習ꟸ&F \@0c$M5'-io 2|s1쿁VޡPNXW0v[}0kIX_'#  ec?tM]`???~"--LSBJ}$ `&X!ǻ.t1- wP'M7O7dɍc(cQda Ee>Uk*?j a4La.¯ӗ82sK1Y~~Z3{k/MOܦ4en"rAoh_}k܆{DoXxϖ;F+ShOLM酇6Ԙ(Wk 4]۶1]nt`NCk[?\g)GWmbW#r%IbQlN֋,eEﶳμ^㔰mCiv#7'T:J ckc xM/ùd 48֎~„ NῚxcE^,-b lO <;_U ^DȆ&ln0y `uCOf~Wx޽L3,ƅI,߱ǴAEQχ+ƒ&?t)4yz6=. H?yM8@[QJmNж܌Y4}ȟ?;pYb ڧ &|qժ{uI<~ȿ%Ob^+ˡrk0@P:pp"b ~{DN?O]'@sO/:1f5\Inh;7XVpSh wB-gJ.3 D=P T5꨷7{t2dxQU؜`Y?tQ3az v}J8F3zuyZZo {vC0ؓT#}Va  'Y$z}r󎰧;5ݒ.4Py J. =md려һEP&4wm \%_MN3ŋqU3T x.VlFd45譮{,eJczU K$RGz*5P+* GwX5gkKQs#R!+'<FA0\"v䵄5_:ښd#8ؿ0J&>[A/9iSƨd)Z~t۵slHZQ/ى8Vv{OYhJZw547`}A2>PiFLZ'WT*X@Q/Ȑ3PL3H5uEq jӼq +-t2[{N0r}o;8RB^jɇ%x&ȹbyc(/oܠqCPҕiֹ̩7L,b˓˾#nxk/pK} 椡72zh22P^'! Xp>2^r%hwm)`]q\+ӏr(>Dq *r:tq%>y"|ZfsEct?&3"ڰ wM⽯ۉʫS)[Y_[ЪzP)Q@'^>ZdɔF?;sbL0)N*Ҕɰ\]JRu|+7.:FaKAyQxmƤ54M?NS^,rV9_lر>AvjYp=#Y2adqxWP6ZX&5,װ(RVZ[U_4Ե]RlF.HY6b`جD AÅF52sF!5bxQl`"@*.RB`϶hX>]~G4s[Y:!`' 3v6hW sq hw!I!,K pJyjM;ܸ8n;F]WA({/SZUlH"eoY6>^]"愮Gٝ1e  rp#_z] xj~* b7Q#ZT[3#ZɜлfTxu?Um|{$D.¢JTCf"ݙlV^/e_8"³1Kz?0 {4"5"u}:ҥ!f^`dX/4Jv:D({0HMif$v-.wʯ=u'ZTyؓ-VOb-|jh,BU ,Yb~uLyJQ&>Y[(wFQ{Gqs'[]\f ܑ0_8<A&틼U4&ѹGXR?\mk]N͎2Lܖ$L~A`}(6T% blkml r[6;g%p}X{qS2+gdbGx8mąz|/I$e~qL03[:l.E ~tȼ&l~F@q[_ 7N}yѱҮix[Gu8w)9FXy$虚IB~oBdIC/|y%5#%WϨ~UWl7w*Kx_xKOuf{=#'^Lo䞫ox &ǓҡѶꈄY p{6eԋ}'x"γBsfzu%Í[I cJ6gR.zaS}y RִS{Oc=~Ju{mYLp*ARh%iL- ,ASwBM+0Oi~~!QV半nt+Kk{8xMe X<#:Gd^U4%,lBOk2sІ,n)85'Oӗf O?Ngfwp+`_vڝXL`팛{$kpDvfm\N+GWLsٻ/]cӱ!*kYe\]GΒOsx҄YD|85-s!=׊kPyaHUh/~.Lm[&lP"7W-nhhvY`)i0cm=6&ZhXB qk"805Dcd>Nٓ0 \1dߗgEzќOYOgP{:ܽ[2@HyyUCs^B'PN2ygJɄK+CGM&%Ջ+sCgZQQ/T5"^7z,(¹_ ;wf8ĄV^BJ.)HװKѠ74)Γ3bX gDC8 Ų}d`xzCb?RC5s"⣇]r/hT*aݸ.b">@fz@zN>k>K4t=4 x"sǧ`p9rGtO`vXM\[YFl*>QU'A؀&&+! Uc&"[|RP>;^=&fA26XVyIbGzYE)؅]Dp?C[D\$֒׶IDL=/"Hp2}M+N+1_W+y=v;YM Mȗ% tMajṷnj}#j$P!oB^W^Gܝ>*V#򴩊9%_5S>Hp1Nuf= cL-0!8͝qt%N.w㳂Eg[XDf?WX-Q,eK!}(PF^b6M}7:]$4Fk I+$s-;}nv @pΨ#ڷk?ą2M#ф%\>VFCӽh[,v+Fg?p|]k9#KQ-T)8 t}3Z ~%r<}9hyO4;/SҴ&Q&,|˩5oHFm쏟8;S;39r 3eZ)cE:`ލCDsna'1Qm?a:VmIOJA=BjD;Ž)$9\7 ?(/= ~Z ˦t&9SiGOAj-[3 xbõ_.D p%b'P?UJb6`Y.Q|;vd[G?񚧮g{ES2g܉ȡn<3efDMn YHtz)dW݆L$%*m]j3!`[5![vX@V>KE;o+Zm@,wC($+)AxE=>OH_f(!.3tDAf.%$'/gBԩQ@ m|E;/ne] R D)Ϳ?3b]l6ЪXuP[%'+ebL# ΍2JH@K¬M4 1UR,"U3@.eR oZ:K9:ٔB#8SE7cS/2Pۢ% ƳHd7+ C? :i؃;%QK *xË5&bRq~31rS kcKkLΙ6~ұ줬iڈ ɴu U!'b xLҰߟX:doqHVsq˴enS?=Kvv+msCm-䔧P}To^mceUi|p/gS8Ii;^+>/nB ʊXi&Grwv%[/9[4^UԠNj`x`X2sI9s?EX}*j: P;1\Y)Ir 1j'z7PjD1"# C1ĨƳ?#Q nΝR} o*#M#S+ &[1!k{ h:=ƞ(0Gdlrpݛ|(4fd~Cp6l2 LT[6ǼkbHv?KU'=eyYE; U>/@B9e"= FH~ Y'Տ0zFPosĮ}o3&džD>ƁPDWm K#[rg/`YƧu/tpȋYx2!2j3d;vbA L͇"piwS#EUg|`}0>nkkmAH;Sfhbɉ qґʵ2ѯ0Y2"&|'L(NH {q~T)kdzB&7TʍS/ϺK0F|RI ePmR~"BU|B LºΕD$|ZeCA, :ӽhf61kH 5 e lxW(u)c%ίa dP@6+rpQ0fj׹BG'J7H|L*㊤S8 ox G1)`l(qyZ6 HRr%2"ž& 懭@g.k=V~󚄆upeX:@ *ΒOMH8"4t E5"Gٟ5T}BWσVoN&DyD/ $d鄧H(CȜd]f_߄>}7텓丁A#m4j\glE`nz3p%)y|Bn8)) egۓ(6{J1 ըp5gl }޶ [7ѕ8|:T_+)y:pzȇls +#@Duʋx'O}]RY3V:Ws nHLiO.\UMŮ$L?NL;J$ӟR:qb*c-*r$jk6m݈c6IAyW<c- d҆$:gǿnț8wuƎvc+ xcʽ3*&jͅ6ѥ$䗞.6LXTvDUxmŚ ٭!µ{?˳D$J,K!& u rѤƠc7?xz0oF'3=1ѦffoׂMp $-) LCS]"i U%CH߳<3 P6R"q29~,XŒzɔ3mxNq)"Vν|Cڤr_{*߁~VR 0RIu B*'"pXFX;hOoi2J`{p1#&jQl6¡֝-heU XC`iJ봹NE˟RD3 ,1Rg Z[/aB bZtL˟1jܝ71W9.g((_nhlNMTÆWf5&s Q7bcl@Vvt0?CvTP1=r<]v Δ^e7qAnd0ŠB!["lK~145JYuAW(Rʊ(j鱗ZV f9RM _(|#Ŝ){OVoY3}?eH:S=;Ρzh&kl3LU7&YMU唱n].DXgY-'esE2;T DF׹u]r}="s {1>SVd22 RkR;P-6eUKKIMOnXfb}#;݈ˬv,ƻ3WW$cm"Ա{NAAPiZz. [$ll]JFqA'BwK3WcOK`P:B?fRt"U2;UM>YW ]ߗbzLuI+o+RL[+so-љIc% Qȏ%Wm Gll4EFr/(AV]<8y7 Dz:CvӄƤjnT_ wu/mÝf`] . q6g24BmBՎ`3 x/j=:7X;tJ".`/}!Ay^ą)jpʘwu8k*z\NUS~R8\LmI^[ SD]ݱھ*q1 .!,px5=} %D5Ի87Cއp6A:stf@"Z$,$ R#NgAZ!Bae~&{hMC%m` 7iJ3)g$E-@5rU[{(#ra|돞ʐH 洲k8E?JE/bY}^LmVͺ˟S@=\ش- kGK\}ƓV9M1IX^FWa8w uĚL䮂B|w^T 1ѠHLB$ᕲ&' q ,Qj jP ,3U~Zj[,4Lc<"t/rBveӠ^S%<[I0^E #N㭚Gu*Nl BmcQsre-f_;~.ZJ $X{4qV s x[p8cF}p*!Єe;XeZ*`r+_XU1s&A,_ĞgWԩ_t$MFߥXGͰR"O4ٙTgAMKTS?~ '΁*rr[OFɇ'Oܤ*Ø=-N'gj=-<'!2HOѓ@iMtMNjEÊS m~R+22CWݤnwI?z:6e.u3;lzHc*\SB- ܫr!^ZpaJių5g4\ x,V^ATcRoc{/gEߌdsLf @(1aic4|SʐQlԆǤMP.GiX )հAi=ryZVswD D#$++:3Fg E?@ |X_R +eD<f`qxʹQK_22uAfhE P|=o&nb*,6P2i.&:JZ !; d~9fE(Ue:+L"fu_\YɡY8`u ؓ325n5eM잰*$X s`z<D5.}_.1ޜ{qAje_ȿhvN V*)-Ԑg(nePE_l{?WpHIr8nE63vT I;}g:AA\K@˩I{iuȴJWT~Z7b:רR2thSh6MTj$%7mM\Bno~0?r9+2h2ӧHѣ&? M[Ʃ]. endstream endobj 895 0 obj << /Length1 723 /Length2 3599 /Length3 0 /Length 4188 /Filter /FlateDecode >> stream xmRy4%!e)m Y.f013d_"D]% e!-;_9{s˩A㌼\`Qa ` B "|.a!܂@Dy( pr7~ @! ! YHp c§Cp8s$kjƀ !}=h#hw !.N9b1(@GHIUOPA;4 V?GeN\' b=DԢ N4?ji1w[:~ 8U;vH];bPx ``p,ڹfgC"gP; ݩJhS  *GNvC78 Gn=Uӣ~/337ֺ ~UNaav?K毣:v8,c?odw1D%)JbCѸ^7m%8@=pӊB?dw*cu6^#C[ՊS\tc:v.`'5'ǃ6B{yXMrɛ ?Sf RmT__?)9G2qGgg:AC`(TpJ+O՞$jn[G?3g4 =56/M<V8tn<ϬBdˑ<~j{;bcάMJ0`DQƑLXV'Xw;.iц])lXXu`nWX3ƦacR| ]t)9tX Ju(ӽK*zkƦž-o}O x)}9%4ܲk,RQj<@)G n>m+b%QéB?>2`UoLWt!Pz ם'~ٛ$'9 AErAX|zGSo+|C]ᔳ΄瞏z҇:^@Di8%Q{+m}&Lژk8’d߾.*}ڟBd Z6>k-EkfQAҜ(@H ! ܍U;&[icYWo|i96{%o,06%9I9Y*Eby_l7%(l*[R%+.rjewWjf{3~^!N8]R;.|"RHr|D~9ҾHa8]țpIW_k6E9fgjZe?~t[N}wxaEzŐ棊W<5twrn״aW/\r<*GrH͹hX9i')RD %uQ֦/o/#* ^вGn3qNyŠ&s1,c\C\`Ӽcjt르ˤtpz@I(V1̥Q ȸur WcSS~cMye Bv>y:fT*&d8>$,p*NjFVYIܹByf YǙ;sb0$e;ұFeiӁL}Lvj`K{0=ϧ'8w64⅃׫6TX2GiӀ'9]<[\ηLE(B'U [~7DS)Y CtDVR,3 +Lه7<{D?q87Rtrϸ9^/Lhlru"֙NT礑1k{+G+(Q<dd WhNFxbΗ#㍑d:=)#&0:]aݜ:CEb <a?oL,VOU&Xosfj arA#aLZTg=6>F҂fv^^i5IFj3FSI`w,$j]w cS9Q28+F;\lAءl~$h ye>{9T3Drs)K<2TYRoͦ!z4]ĐrDpf:ArUY~'`ps(A>_d5m- :LJ;:]lʢԠ-îZ)4;c$ e79[(z̲Kk/²2ޡdb AoAYBS`9Anay^ϐCg2ڭE_TŸeϼ$JkmSˇ*1P`P#b .vq0o~~u㵴d@,RBA|?zEVسgc[z)VHHѽRяtu'ɋMJ?i-dxe{m DiZ,j+7OJ|̭D'hk9=wDF i[kt{Is: ݞ|uh ?;N$a.ZV됆kq-g(WΣl##lc@B殙\>aw]KNOaQmH8q"#C "-v=)5\U ,|IH8&[wqWY~$H`.yu-cK˨'[xVʭf&Ƭ*W(uv3(2|I~@$s9`j_Do:lYJ3ųt ;o"֪>TWH 0ءomimR?hn\i=iDg:Ró揟I\cl0j܍w2ZGmh3 ?gwgJbP 8EF[{c'-{B߉[l=G|s 7ӘPn*r;CeE5G}n{H,~uT: I?՛> stream xmRy4lȾD5f&egFa05YKҐ]Jv*l)a,IedgPY,_[;w^{}zd`<.9Qk0cc *'9ee$K ml1> @`,`L $b=y>!Xo,8O+i????EHS` acs@ 8cH`EqaQ0 ;~'Gcq"a=bD7`ijgCScU;cGf{x2I{B~] #*1w h, a2X"0Fz#q  aNFiaS’` KޓۓiwK K=ۺhߕ{G/TE;Z(5~"xIDVHo!Q%LN`_z"u! :iZ'5BWH'wAqP:QiU7~(fUd2]O`W:ϔe;2bN=$㌃k̝ݝK|PYYf //3}.L^S-xk4[:*1~sLGCGߋG͆]`rڶ&D=7)9Y*xٜ[sjWIdʖ7#rusj>E<0 S!ʎ8t@(D<\#pMW-Nm*~ӛ$%/VI`/-2Uv*r.ݖyڇ;@agivTƏo>nη>K{gF,'++R{0CX=kvd?6CV1P/lV62(vZstAD ; 3PhY'ҋ/6b[d˨,i;A}ȫb BOn}sj7Jnh8sIbLqTzޚCnO~?|jlGϦDO[$׮T64"ZO7kQ̮~|i#{q)TJ\uS׏X>c{:, Lp&w*:\8ɗQBc-RR" 4yg e{o#X<)S'ࡦgYb w'"{nmp3ޛYbW'2:<+KɉFn?So@9ME3纺 }R::UCUh?aIi6.Bnajtyuuqp:l4oAtRu^JuKۘ2]ok 0y'1ub93jrbM@7ѣBߟ5ַnzi~JѬs8l9;ft^XU$IZI4>ə7ȹ#u Y.}o7e44hg\m]Fo;Y7 C dwf}L/qAqiaG_h lVc4Cw_}RB_Vsunh|a= ^KmE'ʠ<^Qt7GtuC+B9.`6K9G^/:[SS8?Dg5ԑM֗7/X.rx-.9"~>ǣ?f@^ى$ҢNηemߎ<+)R\q:A]zԺQNٶ)2SIPz[X߶?)6]XStSOwW |ZL˭֞3<NdžH~:bL{D霒y/2,K 5>SR~vˋA+;OR.UEޒt0߉MY |}aMt_kΈ7mlddzFO9ZYrs*n]@;X+BkԘN$.}BUЎIu=*fEA y  yZiTCSJO/)wM#c^' ]ycԋ_+[w}./]})?:]O !7X! 6Ţu߶[%\x!2r+n1d'k%#ӇuAJmE,wg&M+<%> stream xlc(]-lc/۶m۶m۶m۶mNq^?1cU*HDmmLhh9DeYiHHL ,lm L8LLHl,̝ɍ(W20pWu02vqqwqtupg >  տ|#[cH/6.&N3uƗQUS71Ɨg#?h#鿖-Z:ۢb`70r741$lLmY6vOB'GC |cVV&BvN&2&66AX[X/BlQ! GQ 7cy 65GLc g7G:jlkcmH'!# LWZ _- WZ2&|89XkxKmLDH6)}c=@r93FҾQ!Ja'nmFB )C䀪a<Ɛm(4/pCϼ(T ZmЦq5CR8䣸dR֯l,3)v pje~T.VF45_hg8 ?EfMΞEZq͊t+L?#xIO̫d\tjNznrF\5ZWGdtq2d.X=TGHJ^|00>X&g~} !}+| pM&@#1Ƕ-wgջ?J%0Q\"8w|)w|X~opE^:N}x;5*C7$xfPa. ycrJda:T BAI06|K&_$j,8!J)BLME ztōVW{r( -͡`( x|,ЅV xm0X0kxAM?)'ki Q֜oZ40԰ͶUpETYҦ5oE5~s ኩ[6~an} dǯVkTD6&{KZ]al?, M^w2]-p%xl-W`L\}#h{ʍePlE1vzˇ\4lᏸTk8ׯ>: @k0E %5>Ʒ4=DBQ: d;6Ǧ>*}4u}n\[4,l~y $؅իt#l\cjRGQ,́+tAB~`j4*%3yi<zZ X7;8aN})Aڽ?:GѪ5|._ c[ojI3IQ"_ڲI6(~J,׊>+c- 6yw&P#1,rf+.r@L|@@TfT*$ c (;?c;n42D;/# +N&Y! bK[ןj^>S]3甹aEb[Lb^%b"5p ) %9xE ivљ2ozQ:32F1K E - O%abdxhM؎6[hi3ggG'xVu`z.F3D)==PP#̢NewooHDɎrIKR_rpL-rr# 9j_l#z<-AS.}O{* rj!Yr#5 g0|:3vcL|KCMb&Qe%Uר91oI:V߾bzv]5LU # ]@- @Kt+}JZi1qGږNBcKs+VPK$/d O?ok,a^3uMI$X\( [^8bCFˋHXu ڦ=@^70ązSuё~45 j*EG`F}< Zq(@@yŌd5fMM -*?m礵GǧM[KLbI@7zeeiR(Hk$i(v]4\LgZBhbPե؂nPk<^>Lq[Fw}ںVϾG#F8' Ole?+J?1Cgپ ~$J>USTT~R?lc4F K<p5ZA*p쳐f%׳*Sɱn Tv D=/r c6q$Z$|(ts1gC̰Kт,朲t!}/_ _nVl99buqg\ԥ@eZe1~P*0Fv / ܣy`x.{bQ`q owzA@U$^i`up'ţ@Yą@u\3 PȦwռ(^?}ݣFRœnc`k>fpV)Aw$|Qc|dp/晗B}[pA:'&F;0 ڷ'aҖ:J LC"7>u|6]?^L}UtRlDE?+#P[ӘLXNe72~ l#n%B ]E>qY`J&U?aIJ?sT.H)&Kd˰JF kl-I٤1aU + D>N{pkΪ+tqUY1 5U9ە?#sHҺY *DK6{o>|YzCZ[{5\+_9&Ŧ 'yB?;ar/rI9s4 *Td6OZ*OWfV1Qक़FVc]ꍘ;&#1I4i>7$?Af7|c5,8:l ZKߑ7yH!rkq,6k,};F |m5G4gpd꾬Na !sX^ ,M6#3><o5e8y蹤k㭭O46LZ/V2Ge`~UZ'y@ڷU5$@]ëGd&hQs!g#v5,&DZ=rB¼0%\0^}Z ԥ鄆2d߂Xm-M-Jd,65*{^Eݴ p ܊I0s2i 6w4r,0?8(MhY"H, -Dz褹ꍤ ]X#D!ƒ{akP)7Gpq =;ږG~9f#fהECΣfwOSR[5 ~5)@A=)WE`CcRJ̡gt޽Gʨ0qH_uUF,E/O&ٗx ޜ8,-P€4 jo\FTSlbptUӄk`4 UZC}>3h9)ܽ^ήXQD8 Аu,lzvS hEtx^5#:ٌDXQNϹbӋd3oߩ"vio-&;IucA,!q>ħMBwo |q_9£"E^)gF^ ]Zǘ]u^T~OWh ]&Pci5yu \NC cvAVW[9s==Gf+>%K ]Bx>r sXs1}m^„ =&$-MWgoeDΥpyiNa!:K"f5/8u3 pn\/TeC +T;"܅"JE-Z|Fjn\#_5PR'ض+A3ۤwu6t'4 ;=8LyV^/ 7/ +(<"2)DDcuf؊{ƣMcB[Ysse<2&46H'flvlËjju'łDQ 9DqH: \hSP~<)om:SN0XN)au5i `Q@3Gh\Z3(о\T J7#8СOQ\QfH *J0_N:2e[0]s6J@pϵ b9uShG0Z<( WLS4Gtn;t(X'aOW jG`ϷPhqwKsH>22<|gPؑ]Ÿa evqn%&~zb2A"‡gt&*mkƅlnVM,t'*ю|u@}U 2m1G @[t~6i.4GpU埅JC0M9$I955ʒnb4EZ}LEuYfFta2 bepE>NBsTLr} t|%N,ʻYiMb &Rfjܮ8doߑ~8V?bX ʦ !=%=ݙeqc./P=es1>Uk"Ip4VA8n_ϔ>,e>fR*Nu27-")s. ܀hYw%5#qދ/L> "r`!d'QQRwLVtqrB//LwpU?1=$UӠG&̽_ˋÕj0U0t> WS0oP{b:)78Z;W9Iq2fh5f'S94yCkxlL !!-ބ?9ȘHCs0Zq2qb˩Wum^/bϒ:TKbnMM?9%ӿ} fqw2ʎ 9[ (ÈբE'n`=l#F }pf2pEF58uv~"oC mP ^ܭc=Q ⯵98 g„PYnhQHQ5eD(6殮;/;6zqgrJi)[^<UFsc5sܠu5nHɍb =wKp%!acRgCag4fBAZ%:r&+b,QGy٬y}d]M״_߮:\PѻQD!-hB~@+^Vi.!Ӊ҇E"( r1Z蒁z|j664Qiu8r޿A9IL[uwPj}2+*h .+22n=!{gZBTBͺ_QUaP|Bi<ȇm%uO,mzݲęg}6ga_A !`Wqh0Ćٻk41tnqqooE{}Aٴe ;\?YA:|F7MΔ2ۼf6:ǚLYw\A^׍/}~]o/n,9^>5u®rPS8 fV᐀B|yU^Zl+XNވn`JyS+] 8^&+ B<ֺES@ mrz@/:~cbMsâ/zoŮ12k?Qf$Gߓ+.=c#  ȚV ə pܥ 9|quBV)ЇŹJvE)-3LvIn[PXnj5iˌvܼMބyf/jo[_cjT%Ɣ,nda6 {&@@y8;+GEE:fkP[QU+=Hv N'BTbm }>Iy(,P65. LfӣZVO 0QrfuK~mnJfC1#j'Š@ =.ւYRx3S[5+{0"\O' ROL#BxAxtz&%6 ȃ& RJό%)J=Xܒ$vKR=&2$y}O%{3&nq!6>*'{LD W1}"(]4Tr\OD})Jd3T&gݛg\ڙMӉ-\luv%9&%&=zI/4 fȾQ > DA dkKP"|V)A%jLJ(n`&5<7'{).K869KG0Q$h WB`m<x q WWiw(-b>_*F:|Jtr!4w2dwzOGt&sLyG3?aӄί ? $t죸.B&;*)2~nD*gDt?6YXlpZ1XQLj:cV#EpɜVٛ*7Pb/C*El͹Dhta· _!-ÎyjuhīVSHi$2R]# R^0nG)0 5MLqkPd0F5Ȍ{4W?21&L>>Z}`bL>P2أo>&r0…WXОE:"N:[vTFMhz\fx[ )Zy.\cuًU7G}?3pQ>Qm>bqϷ&\n|gq1–Aqo:gu$˚HN!}+nװ{+$HBSIh*9m \x+EoAĝL.f 0x÷j^ `WtN'Z4WL #Gu`xY ,qj,O2jLN CJ\9G΃p.H/2׿ws@yr]xF⑺|Jd$!} ބM'c ]y8>=_vN,ep+j&; QghO48 Me ?^`&گR 57a f{22>L;Y# olfwA:j(KLbB{C9_qB?0󱴡S zLD$)Y EoQ`@Kt(c<!jf  t*pO @'-NL ‡ dms1Yy'wήůB Qd4"f/礰zLRnEʾXkc-4:GqYh}5*KE')/nb˜Byܮ(GiNVף)/n.`+ٚlt *哎69+Fv?窝E- c9C| Rٌ?qlLdF|bU*+餉rϧblJ'"!ziOѼW|IAJrU%pǔP<u|Գ2촊(6)y8$it &xuL[k * U&м|N]XqG>)2yj?Fq=|\Z(R(ܝ)uTOL *f 0{(!V%AtWwbQ[N>B{\Q| i$2wJ~.bk\\Jt˕}DK24\2TXx ch[))6:#93̫Wڮ^CJV"Q<+2̀zj9_*J "2(GTISLѯN%ӕjM Q2y^ 禙- Ffy P)^Oj81[){`.^yu'ꋦ6 ɦ :a"ZA-'v&w*s01)(RW}pWQ!4M!Eb02 5k>fއvyZ9[ҫ֦W 0y^$0:].Ps@q/h_F}$?#&WD=@p j\A.E+W )o[Q_0!tI^`x(Qg εvRXr./xNaN>]H31>١:O'K2ǒ&IK3Xc!JեǤ5W5/ҧW.f,Bm`V3}[qveˬo(CaZt\MB&{V&Z'Oe!D f; c0t9) a12~Xt ) I}OOE@LځņĺlCKK|=qeD9VY_:ӓ[zvK athWp:@aV zj!(YעwlL4{_=W 3<`8*X$JAk_~m-Z7T$njZ&7;:?Ō (Q"VidoMd\„épVM~QWVfZ@ |or@t}*,"ÈMԳyD+i_ve\*в{|Q}tIpAuQ݈(U1dZ;CE)k[`&Td$%) z=b?!eV}N̡3M cNbs5aJ/d6,6D )8R,\&~eL_W[rlj䓧3̤(8͹Fɬ?j<tYR@vnV A'ƌ]&J1! lj%݉YyPWa J )^ H)Vx|Ơ(MQ2YoU7bApIO`W:O*Se|ܷM Kfag $VB{:{#H{_2 f^[oKBڑ"dARqY'MTw_-Nʼn',Ƙ7C?u`2?8ܠO4;mA)af؎oԤE`2.;,T\_?jc 7L*lȕnLI\ >! |݋\|8G3KII (IjQ(d#?>bti7CB[av 44A/m*&i"vD2M';q4iOO 3%XB3y1KXlW5AZSabvۣJZ4U][tK_ X ص4bCy!KQVi9"ab>q]_4xIOL1h':zG;w6bE3bpQeHux| a5#Lf14g"*pWĵuLQ?w&It:T%Kh8(=r!+bY=4wk9_S !*YC qλٗsRlRJߞضED ]饙 粠iNoe2@d>g;A]%WQ&(DP* wAx`db0lq(/VO8+I 8{u1[gL[czoh4t* `_$ZiPZ:(׬գ薤B r-/C{2_xֺY7v,ǃׂ#.(сb?HrFǾ9"QOñ!U{Oki-DȦeD QSgUOo }AoV}GaVC% >  lUJp.?E_lN'J%0C&?3E \i}##lj 1as"&vrx:|tH5M)OU"& Coc̀6GQXm cြ}ZPybG0$Kdʮr u P2}1"շ@sune;i"*7"Bhc'q ʩXi1vB/PrWF){Rǚ-0&qTVkޑkN9 A;`&M;d5OB~Ir:|XB}aٮSXH$2$D?ݮa'AM [)14rY k5(06!4@-uIt(d,E u+6G$:}kڤ^z%ĩ-L"uCEC D7-%5N^`"AIT'`8S=F3B*b(Z*N_C=:ѐoa\8Va/Υ}덽dJLjgⶐ96·h( G I\VcNA 5j)(ݰ>ZՑ{y(@kxXªXf*J603quRm*AxǶV2v'f|lz[4AflpM6mpxYQrQQODGH:Ujml&}'n|{a//4鮸g 44 0呂aKw7KY:I-u HEDve o{n\9)$ Lt(!aa@ZdF2)%vͨ+V"Ǿ{$ ZdJkɭKUkk/tU:p}1}.9PYr8g^FGIRȎd _'G!x;Cbֹ{׫alG~"q5*'{,mcؼ_GJso`;zP#en*ݡ~95WH43q2mkb۶7m۞$۶mcj}]uNSua4)y1B4҇zduޙb7]Ƶb}>Dm#g\1_#wes\q[1LU'3ꬅ4mBQ=ʌh/KGyw!q=+#bT貓ӷeչy1!RKiRmv8YyJpsWBU1 'Jp VIor0&LcŦZDȵofrIdM7Jm:½Ԝ5XGK}tG?Y㼜,Q Y:(O Nje\QNt= ğ7X=v Z*A'`xd 5zv ~+CH#=C{)Q.` NK([KXZK93V]HRPM!`I@띭g[9l4 mKbi_TħK-z4A @CXTΡ?L[,4iSxd{J~Ց-hT~|s.7aZPsrhݩ#(WkGmr{H-ͨ&d0؆RǮpzh ۏŴ'6| @dَ)3 >6N#&whl;F; aZe!:-dH|p0n1Mm|UK]z=y` [:G ڢjV\|e71@RAd$"vr,gpge0&œUb&bѶ) "DmDv~ӦO;])P`3;K _2&+2XncOA^[8:W7SSGJU tCGeRGT6E"on TĐXۣl}k#AnԔOoĉ3~KMm\9JseZp^&c3-%%B$J[ȇBp'|Xx:>EJ66OR/2s#qwJhHZEF*' /^GF}bo9GЋh{QN*r|aQE͢rJ˨a)H9FhH›k %D.|| wQBŹS$" ynNBj0 b!`fW_(%Ӽ]F4a)׫KM>ӫNR:LnżuecUig{?Di#AV//KD0n֋Hrl9xZ!Mٮ%B~Z=K7S 7yD^EG2y7{E p|@m * 8趡inKKjn+P)Nm^  E:n8ƸYi] u1=Zk,E3q`LPp-'\m(\JD&S' YHRu 5޵y&70 x*;R,Փxgi 1מ IJ֨)6FnA0Uo:g,>AG9!W L$̝-&2vԝGV|g&:JMm9]oȨ O@v ZEb .M%N>~S3׼!' ϥ݂Y0jAᄀ9wt>b#LzxaO " oj\l ~pOw[=`' scT`ڃfi:WmC>#I!|i} zҺAV9˸rzJMdv g;'CLsW!*_狱k%e`L1|#smeknG̀nQ$ISN7%wȠWt 'F%Fl ~+w"E:>FdT͠FNeByElD -{o-U1(c1M噏WR)T'zԩ=]ڱ uEMsDyIܚ 떏s*HuFg~|fJ89R%<pX4bPzځ NT&7z [u͏$N6`Iض$ eovZiu ƜbAorFEmh-~N:TiěAK!|<+\5=,JX`Щzf( |@{&Dyo3;X$S{k6 ( `<`[}D%–5Tj)uh~] 26[O'_*=jLeA\+9׭v4<7umѻ_Р_p,|/a}q!!# 'Xx:37: #M5({)I6 y!4a0hۇ>>AAkۗ6g|@\I-Rrn3$D6#C]B= ?|q,}ߴk[\JxjX)3t#H_ !5'@UXtlaN^wK;qD ѓS(?Vp(Y)*?l2> e=U I&h.݂kr%mޢ]_9ӱߒj"$4@7aѶi1htxr-+zvф7f"Ll퉪uy0zSO=4IIĸ-bn"]9pj)27N14Bz"گrywÍ/G'߹`G1 kUH)ӲZzm(Cв^(8LMSBHR=}a3 TN~ 08Hi~u[n 8Cj3tvKlX"{nKm?ˁ1hNz^b UW?3 V?o1S> M1ǑU}hnrx1 Z]R18&8ofc2Z4rC>×ٱy_ Ds'˞Noh\(& C(l}Vs(Nȝ88j@Yg+>UA+?yEx'7ܟMֈ8AH1f'Tk87 1ЦL}Z;%ޡPWo߽]+_)VM8lMAf-q{\G+Z(K*x yMXjqL1\?,g͊Zwzog|w,Ge!sQVGp+< \I^ʼ$HVoQ ʖūaYE_c+sXYeqTU+K[8Fɵ9(ۉO N TXhmH~3RЎ4K/e U 17ĥ0%|5\-GȪss(p֏PTKUz̎ѫf7pbW&eHyj3 P x}Ev@ 3 $&̶H*!`pm 8n['Z)-LpoRo&3eH H5t퐫N߈\F 9"5}XqC< 0EY&7UVC2Kc=S q)yj7#[Zwq? 4;'d&MN]9͉}K 5iD<(tA.ecd7,d*2MܦelɊY{k?dBvI5::p*G@Za8Ylrrek< >c]LenMIm{F0d $cJ/w/\gPr#BRj?e{sye::OFE4z0Lǽ8p,cWs6+GzaPYj2I /3Aӓ~֛@#N֔f,nP lh֘~wYʰ\oODEP穌uOosQTU%[>i&xKo}:XKn>(i2'4tapKrYX xuAym74/f$.jww.&*qvxjNjt%L;@H ID)FUC4PSB{+puYߓAn(|XmbB /SAjQnтkk<&bN$5b$!;`JcD'-Iu52jQ@Jm`﮵WkxZ!'Ӻm Zz'g-Z6M}\"{lzT@<ѡx/x \У hfܠA*YP[_E/ܨ0Òp♉VZ/lC#5IdOX1& uK; "<Gr*7 MYQm ijԜ73, Væ~?X,d/ vM$Bh0쩗-ޥ,.X-bG;F}WnbmfDb;( 'Eհ&{i=a!8N`T4uv4a(KWH)L܆IP]""#g maBO|(y;9ij:|ڀ$cA* b hZMjG(wC."mq@S= Rb[Zb 6$Ny -/hn{9e2ŞLAI˹F"i^Fmo5N D0u9}ih; O^\̩ -20zY<+Fzܙ{%Pva3*a꥔ݪF{ͦ[n2s\`%l2\:9wʴ'IFdƒKTyL ɮ* ǜ/Ku ioǏQ tL9sT28P3d-X9d_ه2[Gۡ9ʃ݌(jEm8I@wOv岻U`r*sp |(.lfqt,ou/e6 (cQҗzQg@dY!g%y'W'0B#xLuCx/kFOPR܃+'hm6x+l&F!0Qb LAb\RY( # Pb e:ޛ.H ī褃Ko INEyZoHc-so>HݶoLZ"~g<6RCL&T -(xm`"Se#gȒFҲcw\v=k!x`jk͢/J tɰ|!qОkp^0gg(iq"\"st`$Ѕy~B޳EF55?6k+,sT8C։Db'J w*!L穸^;d%;O?pDJJl ߌ1#Qv+S&<0}K J{~XqM@ sPΛvNX M礤5LP]fJPzUX+T4sŜ![Ɉ`iH1C 6{Յf 3Gy:@$:R|3DYqP*ڙy^v[XI:~ 1,A1p 9]S(wFE GKznL+'fZ>ߙ]&ckO/UGo,6r',{9 8c6DNlaM.~kBw(1 G*&g%hZ'9a{>2-l6o*?Ju\yLbk`.Z[}>T b9=SJ ,?Zl {`8ҧXn.r-|1|3zJ4>ϙްӥ23+-rLվ?y-($0FT\=sޝ/\zM~NxeIw}q 4xn0D 셝[ sw.KD/GM i?ِs,dQy?P1a tkt׿Ti!< kBJhɻpdNS9#~C檚"Ƞ3(4* v?Ԫ%>Kek Oyn<qg=(gfpU3hF,;T3 MpP1Z9& J_9mx׫?c?DYVi0i9~=HڧWW.$\~, h]! )HG4n`/s"`+ O 41 tċ L)S6C(+CҘn^/4Cjλ[guL@WMҨXxk9RꞱ=5QQwa#k;:vkdJ-2<ꌧ(5A~ u~Wz8A~pU@VrI޽)H<3GNBJ듚MTn$UEȇ'&މKL Z"`7R qbUCױ3 g)1~HZ c3\xf_c{Sg5cJOE,3wq@Q)0zNE"lqì (u3!2d/"Iy9!Ï._e g1i5hysv]lFw)pK2B:[uli1K}dPj[::&>"lvNuPˆ(%\ Vo4&?ڏ%J"h"d3&ۂŔ!W_cϝlYӒHJ$e5l5وaE\ ,.RΙ~װ#PHmMӍ_iւPuKu\ ]aXz X)Ϟa2lte=*&X#RO~@)0".伊.o+.eJaN6#z9upʗ,"j~?ؗIM}8s6 kfljFFNrQ ѫDRV +!+ʵzH{i@.j0xfկg҂`!tpSkHOϪ?2]oJ>!9kˣCM'~(\O3xA!^;!KbFrSr*^ 6י 'e d?VgSǺΏf1jFfўSk.tQS [ DCcyԒ7(Z3bʒȈ'$X@]7

G!Q1qHN_;J\maXxZr3rN/N>y Yx^Z Q%w&WTv9һ6wJQCxA)| |BnW{ [q5jQYAl @v֜ftbD_}eql]s6,oOttS`:($Рn  ۲@J6}> stream xlcfݲ-\]Յl۶m۶m]me۸}3sd̑c+V"%sQt0eec()210aHIL ],D ]L&eS# ldin0WfchbikPw4𸹹 99Ӥlj p0Yژ4%rqS;S'C1@ٔ`f`logb?EbfNYQA1y900 #O3?hSc'V<02L,]Fv0=iW!??RLLAښ(m\]L&Nv%{[C m-m<q!bv(?R#ѿ>YSKW?'jboggmH//)D_,jglobigPvGKC'&UV0{C?n0@?"ebd2319,,˿ge$SSSc{cְ ?ѢJpYUFՙmda +{|w8@#޽]"xSJswłk05l[c9;̍ iZ)2^dqpG;qJ]r,o8yk#u=Rl}Š@p{ofX]#>4ީj!-HNUJ.4үɍqGl C_G E"2qA>2Z !8n{jM'q}##]6ԽM7x`BM{%MA"\l}VRdS'\3~KLf 4Ê> QR̈́M\2e#ÀK9d5qE_գ_슪}KQ$!nxM=PBËQ?21Pt.1;kR?iS4挐\0"vB2Hp[9#D$w@0>tJf`"#gv<8]s@=G- B@D{I$FG`"gZW{D|f059 &_x{BʒCifF·s>⸰h@%ކ K6޲ ԡ̒uŰd. 6=RabiDYjpڑpn7ƻ=({XւZLG+{nw ]p}.w+Fkj2xW:7nG{m{n4hEs󥴍("42+BHU;P:4QSEzWU8ʅ-ȓzA3ы΅w9ϰ3̈#$L7JW2ƑA;E&Q+(<;;xKZt2}yj'y (NxA> bV5Gf-bjXwN OGpk3:~B:6F;*ʍU 5!Zl*Y(t9!@alYw.^o4I,(X}&9:Og69kaj&1n3%?b`Nzrn_4^'Ȍ'Ѻa{ExSDN`5L9\Ez)0eH ScOB|n1{|.XޘB_QcFtZ< %5rEhYQf;QV%P:;;A8 DnKu˯ظmǻ8``5o]/~su;ySndDp%?>{W1˔'%xz>WpS%irL_A:j!{PaHnI0SrZB$%j]mX6U1JNj

d/j>3޿-OWUNH;ߢ cDKnCЂqnFC6ѝA~ vR G6.tU Md'pz wla `u`Ŝ% ,HXCFXL0[2%AWHlkx/rmlދL,H6c7m-6FSٕ@\F_VxanԊu Qz׋DczRVU JAڐ0wYHf$GNѹgXl/@ ;>^2ks֑^ btLI;[9(d`)o zZX!(z A&R#ЖJyιՍ-~hvۇVZFyw J=᥇Gh'?\ ת-4e,KZ݆g rs~Cy` Hogp 2":b \OU: #)\9;t]8;6i4 Ix{V 49g7߃rT~cE7ֹĦq2bl0!lJ>dxMڢEoZu tB'Z;7Zt[fJ۫eHUA7 <[b!|27?p2r%KUcF~-P$nP7$Mgڿ u5u5!j=1y՛4Ng~gmBT!aDw&{((ܩHx E K+hkipP1{6Ӿ<&}Ǩrmt|hr6±9ctir7VW}~t3J߇5Bf꟰/C]X1&#~_Z", nC44Չ :d#ZtSv7Y WXRɭIrb}_5  & [릨$w —Cˡ.Yj@`Œ3s4vnݾc6:" cj1+Iv\8=2O*(XY , z'bB³n R0z8= MFd:?03}D& YoR6_w`dSMuAa232U6Z|rj K{,`*%6&M4UNܿ¨_L;N/ v_Ў)7 aeY Bls/I̅U&CLY.=Of]sd@GPD/8۰BL 3>: l<[~3͝K: (}HQ̣sQ3I}q9>BVލ%s\Ǡ&1QiwӔM3Be `H:1[4B i\ڙ@B>QzСDtwo ;~QiˈnF+ ^66g9lu DZ ^}HSGP}9`D8E']ݘf y34\ߤٚ7][БYT^@Nw{@r\alk[[4jLC2D_.ÈVc?w/Qd djB: vʍ\-- ]ۿ+PFbB-=xKim4dB&8C#X'3)1رo睯LԆ?ZA9;͐ ; ̽еS(iz;`M-x 'b썋=[^gN;й , v5IM#V3px-ʦ-8H[N'!1a0x]!u*zuJu:~NI77e?f@7%v}%֭Am`WO~g%.9OY͓BZ)ciPkdWz֊OS /[p =U 2{&W Q[Nǜ$\jwr*UPj\4qstX) B.}9K2^_KEBp^P\0 e}7 iU*tD֥Ox2"y55cqmujtrNFe 4A, 7埔 ^6n4o-#.S'R?msղD#bGUznkD5+ySJoE  ڕ?7V3ΥtS<B-ցx|WMyqτ{$n4QQ!uhub%~5QeG ޱ@Q-&<:5LjcQY3+q`#9j, 4^(:YH_X]Ey W">/a>(BUز+7?#x(ȩR"]k %. 2gMGMpM0CԵ]@8 B52:6Mӛ!ywCOrd:S0HD\  _7ytv#ɏN-× 1kHUodtʜ?G+QS *0zmv);OFΐ[MI娫tPۻ6rݺͣ_$'Fk>$g z}U&V`-2Y_^uˁQ K!=~{|.NZovɧzG] Y<^{TQ")u\l@\qNcyۆW}:7a:[LWo"'NAHf9q+Ea6E!eO\0m6e뭂?:k i$JqԊ;\ɺXcڽ R.;,Cm"PhOv42r a$wa ,"N7O(ܿ ̀jmxDʗh:1b jJ%NsAEJN;ha44֦?\ES=Sl ҕu@c܅!lO 嵹{MNzW,wiWی棴 |tB=IR'%`no$*@i&_2l?tӓ,_Z(!#3(A *c_iwٺݽu0԰]*9m^Het{ZAHoM%6ˀ~OC#S DpU"K ᵖc3/m'+гT.ёUư%㓹H2k]"a+:)KWU`鎿\ެ"S2P<+nGˌQwȭР2H^ 1øA00l矊 0KZeh*I޽KO$ q/aKAV%ΕW+r R/Prv%氰}o ;!TŅ'V ߞm_D~`둂DE1' (tg u( ?juN([ҽa s֒w~/Jn8ޑ9x0Uzwa?>=N)T$:r "}"ڦP%h,u'+AVjK/"!\P7v""Ml!虡Ypx/!~Ӊ 1 o;B{GׯZ*Z=7:{?_#t]PHb > F8#ٍIQ~f wIwY/"36/2.jƑ*^/gsV/\ILq)L>7GAN$իp$)h4;'Ͼ~^r'iJcHJ%UүgHM:SWrw̧'غ(孶) 4"f׸]%v-yR(LTd.'˙z4.O1>V:[D€Pm\<],+u|3pнaYȓDP%KV1ꁊ$0UvS9 u*(Pdk}Dg}ÈPN3wi\EH1@&j)UR| n Ytdf 6Bs\v7\#1}|]h_;K~F]RuJRLFIpqhz^, Oܨ.RUD(3,eunB";|M-zo8}xadIPnA$.̫DMt9\e63EwԤ=HX.5-e"( J"r )M,aQS}L}oS_\dP2EIuhĞJsW|Bam`o= q#;\ G^_fU;ߵe _JlyS,ŋ+Ax e#p0'/HL 3J$򇷮O3j =~ Xt+&Uf SYOrK>*.=*[{ZRJA#b{x9͟O^< @ZCfdP72o@xNd=C|xߡ)!8o1F6U?1ѿJ@ZvT*k]bb.S-һK?0yJgm +=bb059L-6b`7~:rAl&'_@c^Y!]G)K[jf8yţS"rXCCK%zD{F!ajh)*9kLx.)ۨ>TZƕBr'F.ӖɌQ^r0ϗb caЂoxV\d]0 B-c䛖Owtip7y7[b$;3T$`Bot.-\PT퓮-WKoꉌ}f#XSWD>4w"9v|#Mm1 K_B8Q=_7#C0!;aX`)Q-@1A /Ae _~1 zYRi@ ͥ%ςz12 qFYMH6%u>׻G)xs "DŨ@>%).6*0bK7u7̜uʽ~Z}T'g~2?. YB6g\^a#[UlQ0n`G-7l"GThA\ B΍)u*Ѝ3@?.(aN}A4{骔ɄڃyY$`fp *[yjK1KKmڕE*X&OodX|I] x&+UXLn8ZWJMPW] Yƫ;GrgRF?D{Aa*xTt:kL 4y:PySdcZ ]ҝL>b!zl,|sGE;Ju:hnv@,u29b?l* Ojl;;ن}Zv.1 'RŸ+*eiƛ#Iu])XO?!w㗰c%axe{N:Zuƣ`+#޶TY _"YkOuxY_K.@}ɍ}56W+w˧mZCAofCG(W40GRw字ekV9xGp%5 ")h ΀GߣM2.9QziZA؇Mx2)Hul2{pXF9+89Fw(#MyЛAF ,"m᢫£F)z|A݌L@Y sl%hԭ`XqAP4JP-oJ+7q-; 3g@Ͽe ׳բDT9Z0cVKGP1XU'i:g֪F] lXWreuirϸtyVgM䆚>A;ڸ PRb%d39^R oRH&惟[r.aUwߙK`Ǵz*DžжIRW: [ˬP]kGT̽Q+.shvN[b@hsYz|_[rvZOSEZ&0O0G8Om珇{&`7$܎ZQ pv`BGwrG[fr z5sH hAżjjˠ"M#z75m-|[޴YK 3y3(\>-UIRH}dJ\*0 o.1DR]tGo !ˢr'Nv&D3M$[+YP=~{C@'8 ;}3!; !~{_J/޶4v.cb ]bwXzert^GZ垘ӂ6N>5POG|pD/JJpD;|{ź.";QKm1s_&?PiGC^>hi93Cv, >|Wks s1y&C<nt c;0ya)[sTLn2Z[iJ,<0Dա,(n_iGŪOHno4INV4zw_#ADURʿY\>N#n_{qEٛp gxp1 h4Fu% 9 "AdL5R{0B2X )zT$iGx:xqC]m$ kDS{-q=fݏ7Nsk#^Nh,n%\GBSs3H;l3Z>C?Gg!_~hp m\26K[E1 ִT @1F:qaPk,{tDNh<%vͤ#So⭫nmy0 B/=շU֑"p$'fu Zo'!$cNIFhN]?4yuͣbK{/nULΰ8X9Ŏ"urT8U0" ^m@bCۊi^lЇuu4s~3y@14:('Q{;sm!~P@) ӏq_ۘugvw ~w*枷9DhioWh&5Cz:zGj0k#S> +/OH51 Q7(z!&=0W`o$@]-e aEn&n#@鎍`&]Iqy6Sma@\0*h{Nw{O{?C)]} 4SR6yF yj9 ۛt33!B[`0"%&}̆XW,LB9 kt4g%#IrDJ)%JHZ,h5IO 70yGx}6[c8PՉ鸭z׸.Y5Y- [Ɣui (Pj닂ЏJ ~DNHvvLn$M tT+ѡ|fTRqa1;Gf 89eQ0 =<zDI!S6Kl1():9hR5cy,zX>K˵O쯵O|[=9U;w1EFk?7uwvA-;~W]'^>P="pmMRESV*:h$KMTBcmӝ&^:PuUI؊lqmx8=bv7Gp6ѧytY}s( [qY^iuڄAZhf }b`rݺ; / W)r~GY\Xs1 A6-qNjaY֒xSBUSLxP2Nr}sVɩBPaRᯀw[%h䢔,n Vx[lF6QhoQ,.'GoRuLMY?h$PC,) =A~p mھ@xجȇ4s"-;+kXR4j L%K͕M;4RLh |ԕ`$\pJm8{<:PGZvҌ_g|-tRbeI6p;vi2AD9N&Yvtamҗ .m-L{,_6dt$mkЂ3NX2n):,+"2^p`~!vL܁ex 'YtTo93ЅR`v^l]kF4=>%G fTI7@ 0A}dߚ˃c`2,01IL樭d!.YMW\qWep4#wo^]#)hk;91w묭QY'o{rtn^OZ-56+[s%qK?cdטVmdL~>}rh5,[^=mߘ93#ڕhZFM{AꖏԺł pQ(zZUK94&! Ğ/lǾhS"G*Dor L.ќZEЈ'H=Wȴ>E큮y+Q$ ];\A?UyMhTxι'vi9 ~dXEFJ%DaG;fJrLQiz=-l6"l,>YP`)m]#C{9 ]r}zX33Qu^"鳇Ø^ jiE:Z-e^dDqpƑ&#!6ӽ/ \]ԋl/| ;D4T] kmU:!;+  9BHR_[hZ;%#rH!ragߑ|Zkd9‚<}!ѓɭg<?( |QP}ڸG[JcV{YPBʲ̷enMbg= 8'"`2ljRA>IMxT!UYFndb,s oljnZEwK mloz}ޖ &Ŏ|ovR.@Ad21uz6iKpIJ{h5 T*euaK~bc]޸|F[b"mFؚ}T)QJ=:;!HC޷\zAdD 6({͍7Z. 44Xk1J}x+?C--ke0% 3g*bHp _TB^ aӆzO_;vCMыEBvA=+e(IyMN )8GWq(+;_ɖcMpi" ԩʈh&,('E %(WvyV Ur|B1zJU*I٫\& D6g0;= pu3۞yh{7q]Uxdw'5^m0:_&O/ yyɜMG5V+ P)o)pcn$ҖJN̡k5RDr$jW~Hy }R/@6NZ~Re >pRNVyζIy)ud7~1P5cs‚!PeH65J&GS-hBD8Ķ:H*/3;']9$e~gK,bWڜɴVkyyTbC2(W~5}Cл̳ AL˓W&\zeh܆4:9:LSCseg']d=,Zs;q [?@=OLJqtĭy Wr1ެ{hpye'@ q4rvŞGځHZ7(#EC7>H}.|wj;@S2a_7m`ˊH:̾=s+ɗTZ RBa!P7qj7 0F'nlwpl$tXꑳfS[k75%DV?.id-䱦75"TZkAkV^4]=TQKϛsKjA'֑ŅR03ˤP# C:dq oovxhK#`[Ik3<͡=#e5VȆ cŭw[ ZM.(;?A3菭-|`.Z^m.e8RE72*0\9UP%e=WwB LQ>e;{,֨Bw{i7eOs2#ƙ$RCe]ݦk + Buds:k":1=7ҁqnN~wyqjliC5c6cw:]s}U2_sW*v*NU_Haw=wv8ax#{+)>}!#Aޞy8i8A ylӢ>fR&3&MIs-_.ɴHW?G endstream endobj 903 0 obj << /Length1 721 /Length2 16553 /Length3 0 /Length 17123 /Filter /FlateDecode >> stream xlycp&m8'5m'۶m۶mz&6sϹUW&'sQt0egf`+1q21XaEL ],D ]L&S3  bdin2WnchbikPw4𺹹 9283Sbj p0YژD%Tj S;S'C1@ٔ`f03N "`f13'{[*@LQU`hgřLGpec_N`&.#SsK;XMﰉRr &f]ml mMT".N9{S';P6_EH?1;d,najhf6HEύxߖ񯆌Z"bJ]M,*.hidҊޞ6/gdfb`K=YX,Lf.6E_3-1ƚ1OUz[XXB$œ3lߵ6刅>N`>ЈobOꮕ0xz&8Bw ܯnM1B BX:%ss#Hf-;NڱE9Ơky7.%j֯/xCZТ+# }kr}@`=;UJ'$Yr(趱?"!ceq]"IkܱcKxvyUDR}kLh@UXŰsKu=TaMVX^?7KH ((ʐp9ċe0҃~OyJ*4y=ܘg43p!pudث*q?bXNlGdN6x=H60^m6+ҷx^ I؋'^KT#J%tɿ#ȵCmn-levU%jDCnL6pFbW]l{﩯vvǨڲ#Yk[(W=ƾi@4Tb!\B !e 2bwuT5>-"7, 5Qj0B/6Q?S/ťEC g'"p"?*e5>2-\w  /%?Biup9&X2 ?*mȇY\vQb~01~T]3 PïLł5wf9gAZXXb#@$9y^BAQ*NjeTG V4-oFܪk>;dP 1Xӟ,:#n*z׀R頠flAҜb୲SKM7}D@hJs~ֱeƝԮoF@Ja(i2cDֶs"_S]lZ7aH,{!uXTcܕSax#{`7kC4"J \Nx߉ ղs5_4m/uV`SywQDk/&{5xva19T76j)y@P.YM,{~ >W2|rC'Z|K6Ɛ]uJPx7KA$q7/TȽUmJ]ڐ0R}Y $GXkBP#qm_~nJfʎ&=\b>nDϮ_(4O&vs0\ m5Y݋:w5Gys'ZD|OVY VHtN4H4@ro@#5=ol7]·=fa{9bѼp7RVﶓoܤ- [r`\E&}.yˎ߭(}&& ʢ]F|Sc85]0tςK_S ƈw9%a* n@q,'>5ҟ~B&{iO߃301"t?Ovs[eM:=Q GE(%9BeR`G[0?H FuX?`sR/gC{I|mڏZ\ V%w&10иg#);M=1. &,m%xJ쏦`ڪ'5e޴< 3fɥ-vC6ͨfg\M%yUz#*{2=rBB:}9JSp6f!{Vn Jli/0\[sᖒ#&Fm[y~ BD9k$ {5 Ց)8V-@W2c|ȪV1 넓 Bi(|!"lz[i}lOS*ظ+`~4L/q(^O5\'z5\t#-;'tQB>r~1n :ECSa{̔,r\g!#eYyݙv" O:eSeЙ*')LȒrTޅyK0SxvrJ<*7r_Vb(3i_ (oyhGAFX;vS]F?{?-ysJUgXYB{hw+=4$: 2.PYgӀYhr+33}fq8lm1\}DsG155zs'>efJ54G 1JpOFbdfZ/5\M';Y&=BI+$aURl)EnA^O@ %zh;ZpuXOԢ[fK[!&;91oA c,5y5s^O/q!{^y=<,vH dOeFpTĐmN#׬Exg j*vsb:Fp1pL 9u_6HRa*ToQ!\ƤY5^FxYRTGOGXew5 _;/E95-pC{Ok%.;~i Ca{w݉ʛjQm#?  PWE&";d/ׁn#ɷrBܩlkvU'ClkhKxVl/**=)tr+KLr/,g'xlpcSbOx#G`T9Ĝ7pƲTJq^>krݑ087z=l9g'4]XJV VMg-nq ==Fb.ݨXJЀg'( FҤ 0B BTf/yZ5_)Vq%h1p )_Z彄~ޗ

s$L]"k_9…(QarxDa#5!AP"0oXĩ&L 3͞]ߥ^s猒kKv"'12FO۠P.JylЏHP=T OWDpqv/iNO)Z_wGT\L sюzw?;QA|4{ӕiK Qϴxs@אINsWJwo'[~ ?muYԱ}Q@?M0$"/OUov(h`."BVzǞ4;tQN($u.b'[O( -|b`&>?l' +!;Ky^R:zaD`F>6P9"!ٛGUyȄͯ"`@HEI{2E[0lFr Ŕ_j,ݠ&*j+u]"kKkm/'&{q| ZE>Q$;w˕xL~ĺr^&R:ݹ@Ȝ8[GH,4Qk!-8"9t{vN֌ ~PWnϭ@5}U_5WHɥZT}KɳoN}>^\N. + 4L6q(+Ӛ)&(xΛ'j=Ȩϵnt /9LlsH66( 6ʛe~Q믻u]?0QD9izR…}$7v >.=eD%F,F7 d\[ܥ&I:@ExefDzdUPFNe.4١~Cdɼ}θ QT(Sa"gnɉ ='S% k5jnv%xs7 SgsZO4a)h86۫*1Z`>$m9Tg7DۛZu˱sgpCݷnmm}RϡIbc шC^mm-r?Ci]uJ@R1TYͤ>mA\S&~$a+3h`t*@Y{bN:$mUWtٲ=_Yg5l7Sq)Z)|9"m#+讛ԝJGH F%kqAλGB'h3YL8iQ۽AgNyqK*{`mTB y/2Baкn=Zk˃|g^E-TmK%% irLj\g>z-W}STGjPUfO)(˄] <7xf 7#nfRYp2f4QcX_Q,BDMTM "$Y9 Gf}5|\Ua5)UG;\{e#DvۥA';->hi":I4lDPQR]<~2vn@*:zZWĒXʸ21?eZ-o͕1we8 vvD4weinZ)|ҸN-}D"á\%JvӹHm9a,QvJSG:1 5@W$;HnvU|FOb_fВC~Z5iνiBc<t#d+\xF>Pc↽-cX>w+  #ϝ:a|Tj]-^$ӃY:o6.a!ۼڻXվ>K2귴<?Ig-=&7%]2PV+5`(Ip |ӉBP0preoJS?B`4alKTA,P 1"eT`$.k?ZN=q'1|Wu\&}x8]%Y.Ϝ̨@? La2L$h^ˠY,q$-GA&1|%?ŇFLN͚J)zB}i,\+ ͆_Ws H8,# ]rGl* mw>]U;)&KZ; 'pɅ5pFY;4aF~d"@)lz.l 8B秺z~Ѹs:JB6Vd=75~w$6X&7u+ 2kzA\>2_$5tRUoDs!ƞuC Óz]{ 0hɬ AwN_hz`f:qrN9D_!;2~ kzny 9DN,&#ikWڒ"XoX㑇)7.fMZP^Ȗ%+S&G~okGZE4s0r 'I|Q ~ 'iTO@ҽT=gcggkp;=tz!{P}YNm笻"ĩca~89ýh$oIPHZ1%Pr@5&cʥ8Ɩk !.Gg?bc aEG ՚ռ_?;cXmhklMx3'!>c|"nsKZNa;#/毺N{hGma"Lzjj^8,tT)`mu*WX0' 9jz.MzWD]{>AAW׌66L({o݈[HW9;ςTT]ؼ;eI Wpb<8>ugYVai&QؕtQ_ԁ1IND$ Gp{pӇ_;ĨÍڨ1.w?4 goƃh`ZWfXXK гt$ \n5 Hѣ)e_v](j='f&'žzZ3¡ڰ9g/;ݲozDw/)yoIhԙFe)$h#B<D0M̚P(A?;gҔTU2mƒ9{EcB̶>k,zϾzOdVwD2攸W(`:=D"X /nCNh:m#ҦaC+g9v8Į.UNsFNM=_bȏܲ]:E x&DoaX.nAYRw2I:4_.ڱޤ\kLU l33:1jktE][{ƒ=t<^51vc dʕʫHs\ݿ`m,_94.a,"f=[ G+XFq M)OԴEZsw?N}]")O鹢 Qߢ,aܔHU%Ε_8I(8Z˥ߥ._& 嫯%f!$/hApSKqFV;/qss(@D (^ 9G'T/9ŢgΣ/(4|0-r|˂F?Ʃ8=oJ+ SƘ"p5-qmn:\e˳c0rU;#ShVQA.'fU4).k&@[ϺkUdrw*r׏2L5(>YUV{ h+Gh%K3Yְ}C=mxQպ1L\kԓ7p z\ْ\%z J@; Wy-1i.(B|ׯ|(PI B߆ovx+ut++ifL%z/^>XYUiT@mDyK2#E mʏvap% !rfǯƩ㝛̧΍nh*z'3BXХ|}{J԰:V'1W~Z dI؀B=ߢ"[d1/*tK$)tkwSPKs̛c"PUܻ!;۷%pna~4Cy(Ɍ*w`R~݈ "- k߇LƜrb&ј,2arW%psxoSe,oH7Cs) KS"$cշjjRwyq\uC Qg1Bc};Cq)[f'A (Rf\rCk,mY$G.jתstrG'OwӛM5NnVShIM!oSծSBK<K-cy#k. $lw3ikҜ/Zp 툦 l#\',VfCnh";E!;)iϵ-φ1ȝku8ؼLRI=G&Hi35e5J-+UY/11˖Cz\[^y)nJL-&~ `͙zHr|JT #ފ3`>zZ\n`Zn5)aE'Hnl^ϵT}`%.!+%aCEI q`&q WL8@X[Gׁj.Ǹ/>$EgWYXíījg[%"n\#o=LZFbzI`>e-M NE3`!&9Qe8VήrWy(-NxvyZ$=@7`Bg ߜ [g n0Hg!Z*g{N/<'zd` q=7lQ΀PEvaJojJ /7LQDA,tNe$8r{$V%ģ|/_]#-D/@\td%-!My @GtRڑ8':ݡu6 ",ٮAm4禤  K-^(ڝpkFƨt OK<:wcS: Y mbF;ӞdߖhDTޥr0NR O%}0Ĥm8Hⴲ_AKK]%ъ[LRٗ}z2mU?djqZ"ۤkmhM 0xM{Dh >nT%O*PK1_[AU-l zc=l+C";Zx_."PH}Pƿ+\ӓ=m)QQE[ !fC 'ʾFNAKe3tVhDO[xpԲXgAq<ťZuӡa1Xj[{_l_24^H.fOf]љwU4l(2 ѡ8F*_fu 4_6 hB}g :6aPQ n\+AfRxVuEOdOa H`GU=ԃ.5 &SbFq&(!sTe <"}۸r w@0N3*?+rY'$|ĜUv6tx% p9>7Bn{O~ eV"%R2P7AIPbjA: KgqL_m+e1؛KZDfUl͘xsI; <)2N_ՙOU"0*(iYt ;*}+0DM4@|H}b TNт_> zoh#F[@127P:"`y4̠u*gF ]r`K (TTVieI9wçĴ1_i t-' [C~pŜ<:=CgtV%F>!j@|_”W%_xVŸL6.cbY+|#h\`-7O||}t9ZݑGl_VM!5K`[kbꇱ߻V,ҙHkzڐrcM=t΄׫qXQe;Z[#u~Z Y+Z(QAi-^b2weHCkΜI,6#7n`el7Cr6(lE[1mGc+*{@DΑ0.뢚Z?ӖJ'&*:?86`΢,ƐѶxbamߦ[Oy4V`iYoeF m ߾ja$,~c l6*"U}'H!$~PI&tԨs>k3J?WZ0Pz7TOYGaKvΤNGӐ/u gڳ=(* _!]vy>u[2_`ۀ",8(PǸ+nPSi夾i^,WU{=t9NhG WB؄ÞZ+22ү|b\7r دC_xaUDmo[ A7;}b:#n8ɩJ{S\ԩg23O2>䨐doL3h 0aiUFh˨=2$wkՓ/cCduiG \ovpbwװJL|,6ןc-9 0/3Fi = 3 )O!9BB|(b@hwNuQcfFD ^0vgYIPa(^fwT,@ڂ͠2+ҟ;|}mS}&|r~# D+Y@]q:&:sU'cݜ #s wTS$y[3Ǟ[5(7 endstream endobj 905 0 obj << /Length1 721 /Length2 34350 /Length3 0 /Length 34934 /Filter /FlateDecode >> stream xlycp&mlyb۶mM'm۶'ęضdbg~sn}Uk twUr002$Ǔlpb@cW+{qcW /@ hP:XX,p1G/g+ KW)ͿM[c3+;+g%]ōM"5 j [bJ:2Rj)E ll Pv32[]4sgpra{w?̝ "J 1&u1@^r{W@Sg_f=m1±̬L]&@ +{8MﰙRr if@nv@+`t:elge_?:[CV.V@3e+67GŵݿϏ9zߖL"Z*t]%M̬-jhilVޞ6X`l cf`KDE<}X lvk w_zMWLB3ZKUAiЭNZ Y]ݫz ]ܷ'N&bI"W^Ȫ,5F\Chڙ*BDݹfm+N_:UJUvC$->KSe~!jQ,ÊM^" Cn(p -9E?7>t~rhrrBhLl @< Jrݽ$)滧goԥ0}=z(PB}P 7vM+@\{VE1FuB?f@]Dmc !!ԙHTӞ 2@2Ęd_ ?OVӸ)/~v k4qhtTR߹@.]t6&"]>\d? .kF(P7u0QJʕ+zMzf16ǻ Ғ ig>Fu 0Ҽ+;BM(%3hOd,0m f{uBVdm+^j 3f*&OJ~cn{tgyχv(* z:,p v0VOhgrWXA0JްJ 5'֗XD߉6kՅ6 ǃ8IDyQPڝrYATDÇkVRW=FƟ*O,;s#Td:N:"ש˷{f aWHvNI=UQ&kFly]CP'E2?y4nHMɕ,'Pȷ RsaVҊ.Lkeq)!MFB4#=$eKc5k[ĥR,ln׉v插muXr B6~@7{c/uyP _:,;o9 +*FoIVvrnEkᘅ>JWWo&PHwPl<˹y3!])z(3 D\7Glx3@j2y2YUy/aco-v Q$y1FE>9RbŠz"SI hKeb9]b}4>؃ scM7DDTEQ!rT|@;{ӍJbl tHf=R~Jx;*jDe{}'~ s2Pg9]a 7(ŏ-b`Lߟ8'2uc. W->"t qS`f f_жYUcKd}jH8r£L'=Q ݓlnqwڐO쌓oHiҟ=/5eݖaՐ OsD&" .8}Ogp&8Yc DQ|a W%c)!!K -v!Ĭս*Wf>|?:C19 ״1N/4H&~O9 Ǽ\kZ@ܑq_] A]ZǰS ݻdA!/P( ?Zi݀cYqSہyvF|-\ ޣgsmOp'~ZRDf+ n>h іT ~r9΁G ԍAnyO d5ãp{+V5kqۣ;N{_\܀31uPT%DTӀ-eBN{k[]jAB<( 煰[Zj¥j"`ԉﰅ"ϊm_].F͘4c-emf(YɌTlF'jcpRMS6[IiǶګG+s蒍h4 b\NOt~^fC=xީD !xۻ|Wł7`aB.;3yOnI}C9;ܑO'_kDˁhI}$UbBZ!`i"1& S(yԸA"SI9 Ί3A%qR֙ݸ#oSd9Y'[AA*W.0qE&~[ɴ%Ċȅ4R/SBQȔɕo/ +e˹?kk[(NU%^j vM_ЮV h ۧM&H ?I{)4~w U=\-D#L'69tq"X^G"#Ls a'[&tL@cr2h17W:TN].fW![pg9b>b>Q ٰ[~FWK"?\#>`*dmn+/̴m$2<)Lݮ*YەD`ʄ^0eek <$]7歷O Hjepr;M1ho%. Fvx:fš[=Lޠ#E D2xuB}jqWu^Z6S,u99 Y.XO!u-Y[T}euIĘS#W})-gLVS`pvI`TQp`UT>B"iPAVr]YzK{X-!8D = չb{4=MTJ*Ab D6jB @CZXwiӗݓť3FaƻQ3N}T&-H#0w^\+r80?~g1- ɶ|ǂ+hR{•69m?2x荫; |_}I Ֆ4εOa-S%uQi=;λkj@fI@w57~C\\^+Wq[Hi1jʦ!g>uKEqwd?i2 ?ӢR&{勪kdqK4EB}TJ^F P٬nDos{9BU='::cfcl mI2r/-3ٽF9?PveREEMNb'KJ;d VTur4sh٬D'IH_2y0mmޛȝ-6N|Z;īeΏi(ٺq2H|ؖA9Id/D "ݤ ~/Ձ #)_uq/;7UCeƊ>pL*3+1텅twORߑ<u=bEn( K,0#|'E(kWr}yQ)ܨHO\jZ†4;Rf>gaZA lk$X0$_/%oyJp_ƚ-Halp_Иj3*:ެ[Mpw;݇ɽRx3]<&q>UEqC (~C]l6FpX #BY*p8^+  in" HDCUC U{E# J Ɩt>^3n쩇 .񣅐IQ*,Z^gb>jz1+aqώ-f|_.ӵ*lo\13JT-YP2/V ׇ2A!7lt2{[AC߲|ν\?Tj؅Br= <^nzmREa-7P?!4h6̖'ֵGq̔tAXnp̥HBB0I׳&ѫIiELY%_g/'oţ S͘%C.d[a5䦢6R,K+rwS-Tp4V̢U+aNCfzҦ4CTa2q(-5OEd-+_it2GmybErC9='C{ Vw|BeK<e6ΐ׵ SI<ƕhi{a^n_Y~ u^Z$j+4AD8 k8q_ȡ**Q8OMO'RES' zT~4dHq3w 6[!w DX )wm"@-,/Rٸ1dg_Rmxҳ̼mĸ?X#} SPI^'g?戛z15YenKEfL0߶0K)_ĵI$ b4wԤ<1ŠN '`DJƏJ[(w9 6i+)gHROذ孌d=S< :;LJ/TteD1)e!j5rs1v%{nL<*kƭ|ɒ&̛cJp)u("Y@\qF]1CO"C%&cI;Xn#/4m5"? ڜi+lQ&0NKL␒G# Ui Uɐ2 iIc2 'ۆc st,8჏hɖ_ۊ/fg6'l3>(X;v09^ ALY?e逆PE>gtN[2}GL6ҸO8G3V2OwA[~/d%zJGjq_EM+xu(BC&ze䑊⺧Zu?U_Z~ +On\~|d* ȁ kӞo_-D@50D?T{1=* NR9<>#Ps~Ŭ +&Prxpnb7bzd9#g,j)[4+$WY+$`{YˆwN$r~Kϒq: XDLh: ,0SBBtc&HF l*й*F˕'8S$tlcOe[Rewݠa$WO_8Հg.1(!B ,*37 "|T-*lr(f+NdUC#9E AorI4^ygoIQk:񁬇.5Ԣt܎0YDĶN0r*Mʆ3L *^xj$U\sW c~S,)F{@6+!F#_~v%g51<Ď¾ QE[5ȄXxNs:ydWJrV/K?4?C+h$F,}VIy'zgZ[FRj=hJԫI\^W `g& ~ ;M}-u "WRswiԯq Ww!ϿHe71G5u|\+|=neskœqvp 񕉼|*nLIZf1<ͯ:V}Jvfɐ3"89t.:[cY }/bsܣFD; <ϧ| )TN #`XG_웩Q]m7YC*DHS`˿ k#~8t5K (0ݴHB#\-$gLdwv"8VE0O&F>s2#ܗ}k3_e^(kxvؕl肷dXMf@ۈZGi2{GɓF -&;J<`͎ƈ\wUpo d#Ħ$jR?w(eaZk3yphǂ Kɱk ς=ԅM9T?Q&xDCTi MIZKnj)/^ӹ1po{355Bo=ukؽ+t>boBBVe픤;"$ f&\Ḥ#WlK G*XoYUPdMg ZYS:C΄-{CQ$e`EAr aDZT-aXIؙRzh+Px:JO{!o~C{b|t4b#^OChʶ70~H`S1FV116ↀQz p'X73W}&_(Z<\k~V7|bɒ:jZȷIci56~(/[3[|1jhWnc+ȟp&"3k tuj%M ,bSpN P?rs > >pU_•Β)#!;a5͋!aޗ/V{@$O}SNZњ_#"۱szGGd: Taݬ1@ =SriF l.vҧEStZv*AlzWIw#a:UX 6}[KU.M/OX˴О20标{+"q/LCt2lQY 6kE27BnĤ7(c0/B]:ݸ(]yыd`RG8<]gi^yZs hrw{JR2AKu!{Ãqr'3D? nM}A;B**c9߭w 2f8>AQ&9E&7 8L#^RzLX AU߿r>f%3#Q36=財T\8dhU ;v]PzM hjlWD!%q+̿fV+ϟ̥bUaw,s7xl.oV*w T-ڸe wc A@ v Q4_$5C;}6|V 7:3NbOې Q L&ɇ?yW-/ E924򠀿W6|\1͑O.M3-w?>C(ЉV4 clY;.r8qۏai7 y<pѤBTl{5)A/mtHWϜ͙>v(b03JXyՓg)Iu!sx֝3>p%̦$1cm[!njg~N''} \UDOb>IcA .ۘH{zϹ_\|s(l(|@"B$<"vTz.K\y|7⧴ܸ)>0RWW03P|z ]Iґ|tpSv(B'ef3 .Z[)+憧D1!,^9Mt$Sl%Z]=^n\S# Z/[!fs$C.jDTqɱG\&ւ36xJ#|YZ<+n C &9he Gm9Q5QxeiքɢUz0$n1fo1Mp-m:;dt+ˆ)Z4^6:Q+?dSCG,`͊ f8/wkkăSCO4J> 4ĠnJoFH- ʸDžA9޻JQJLǬ yQ ^ ݙ^ tPFܵ[Gϟ< | A$!,^X߯+0~:-쵪LXϿG+q_,OAIT!g\*{lH"&|hB~zu28`T}* )ɀ0낢q"9>T91 KoJxx7[ }ګF\VL:\c#I?b`a ˴ayذŸШX/kZ[cHo'nSϢ0kcrHLj;IU)YI,dֵd.}=C!.~ϩ?q9w]FDpoP|e&q21 =Ek>ebp& &W\F:j:0K}bUdRy3$7SYP[7]9:>2pG: "k8d6F佳Kuq ΕfUN&*:ݏL\sa G71B3;)TQ +l4ƨ~\z/cN8_|*#YԮ?`EByNKg{x!d\LbJWV$t:vLLB.No\V);; ;wt"[LՆq.)EFЄφ$iD+ i|akY71))a؅; U nrVO`I_sص2>Ec-M* ' ?ή Ux8B3?eօ}ό稱ekqMT/=I {oX^(B!q(KgiEYpεi56\{ѱD"Z3,4Rtk="x,Cա hh}])LxSLē-] h}M?CQ1qr~\P`\Z j=YOT`QN+&A#LEL^Uh4JY\ή0q}9sLImT5U?85^%&`U1*]ZUĊnoӬDw3j4^dyuASbʄD2< rS&2>nH_H3Y*ZPZ(0' ѝ-nUZƔ |ú%jHeC0n*Dr TG;^\$x5-ԒLB-AAEL$ l+09j/n֟fmC%,XWQA ӑO DŮF"kp l2s*)G N hmuێ +g7D(LHEq`*Z9oQE_sqMvdm Cgz,:D(b-k9}ef"toDx5K>MWb^r? ޽5CR %~=>H}:+ϝ"&Sc zO% ۚ7jx"8))HY'O[$/i--5- IЧIJt9資Ė!ka߸Bxf䘝j8ԭ5cw;fE,)Lc 7>.B>S(k]k5|9^H ܲ پӅjK_ ;>zfIjepY3a]e;#G~q6ӕra>nV$l9}˸֡qPP@҈T~^fmթ C8IJƙT.|U]GRcTR^W'[#V\~(hszNM)JkqMSMr|$ڵ" WN$Ҝ#EOʖ*!` 63nD VZ=Gwck# :ǘ)v.$5$nE)k!yE}9[ln{ayӐpVw&ęƫ\Ng%֨ RNz7!,/Ҽ7LQilܶږ[6q4DSmanTQ!3ϊ_yiژ9GJq3GsO̷N۲%?2t֭gefyE`_Xer/HfgMMRg)ACT\(*E$Zq4l[x=)ȮXܻt\C7҂㻰.l܋`kfv)ݦLJI7 ;a c$> +gM6-aC -12Av"b ӐoPIr 6` f=UBLQm;z.G>uS!K<یm0,[.d`n=/&7Z4',8 iQu~u񄲁g]qOo4*1&'>~'<@lcu+nqpgqdӞo2"+JO}2-ZQP2mc}Uֽ_a"RV$Th(hX4}Y#MkNVfSW0CVwN  D4xߘccݍ!%&Uqn@`3СV|J)^;..x( Xi.,hth[:@yWP-V+ {XǵVł"ᯝ0ڮ㐩o /KtR> =[*{g7=_6O2q@3[E%%#eå !˗njFoTws@pG7ܡ7*>Ǧנ 1XdrZx)daoJ{blwё-$hz\;΍؏=. i"Q^3bf03C6jNl=A!Up]D|! L+U-2ՠU^ޗ]8D`4-z[L5@si5Mۑ_MNyg\9<ϲE6Qo6Vz4e3` a߹joI $;cm_|/(ڤ9Ti ^:R9S`HDVh8ǸDZܚU%]b@a^k}C2?3#&1Yh@4$Ersʙ)xBg Q㝳ʜ^dw$nF _b쵁x;RʰVvtNذH-8JL: oҢ>O*ϕgeŅ6qZHulkeh^vDt%/ zPրCE{5xȟ!D̔&cg;uªV$l0# BN_WsF"+<VN4,"(Kt?B!jSS뉷y.J{UXi $AplĸtS"iMcD}k3>4W$.^CS|!M1;宿}e(b3SP?a3 ^P=paXTuyups*AWxpWt c}( m~Kb4ΰPwR3?7όWį̀'so dNc#HzC|Dˈqw~0&d'&AH}ө%7&pe˪څf5\3w^l Qa+ (-AJ:3Ma9BPfఋ#ߺ@F\I}*HhZе*,ϐCC6^;j;m̾KLcD[U)&75 kwE t MσԚ\|̪:)dO e)|NĤJK RŬk6Y1C\Q 1IH8A<7 n7vLSpױ>A#eSÅ#[ ()˷FՒU ˝-akdH{-x,ZZ>XP^V^Ih8.”K،y Ps1&?)h\o׎c. !kfh)ɸ-~m$PvTZF@ omD<v8ϯAyZ- }<@'c˵PE wh5xRua\2ܰxd!ziuFO#4T)|?hK dczVT/ql;lRuW1le9_;? ed\jl}sKD2r * nl$}7wVB=ѝ `M'x%Ĕ 6tFՄV\ ERDHOrgTnw&g? ;]BiR0|9]G=ϊ빹@9tq"ؠSlS#1@H b3sL\KgUv @Ki >aYAR \ C ;J!vBM2A ҃[Vw>zx/r<^ [e4?)knBwH6&O J3,y1yҩX$w٨dt-_5f|HQՁINiՔ K\1fQ=TV.i@abqp cPPT DZvfE9'|(Y߸* +U0MxH% ՛I)k<"upY)+#`j%fHѨrwO@͔Ѫf} ʙQ$ 2'WXjm]38/$ *P2}8:PdXrS@(׭3s,Ww3cHaݨ\phY趺R!˱ykŃ^(֢!Tk'V}i迒#:~$s.K7"Yr# ,d̀riTbq)^řx =9'7E3{an( {P)/Bt9eA,5Ecnjf"̇hv +Bbm2zl$pe5A2gbBi֝It@made"2p}L7t=* G~At{ՋA^KGH"}(xxE"dh<4F MPAN5@IǎWvk2O80Wt&v]򙚐`?(4PmGvUz~;b`(eoWg|}}oӞ} [`)Uuꀖ@ 8`)b PMȅ; ccĨ*ZG(|a^ym\Odu;ɳJoؑ0T3t!旤7yh6 ^HݖC54N[x|~ I6;4O-}dgп"9d><_DtWɅ⍕A@:݀z3,]o^4^z׵1yr0$T7+HEZM-v&{wtiF kk,;yƏν5\2hs[MV+ʒ'G` sʆ h[# -xvS>şِ`X !2*v.2BPN|Yo4.{-`у'Z$m̄#:>q))<xJ`(['t[yxQSs?ՀyW(` OQ_a_ةI>H*slm9# w kR+-]lP!D?`W"AQHyo!hBw/{Rpֵ;vy0jm'J޶cK;C$j#eUl3NacˏU?o-Y?z30C+wi&?we)lYGۤZA>%iw~"!(`}2@X}2r8?|9l`Uqt5Urt)OPg]cٷ= ߢV-1 ˭YW—ޓ $4j' ~c1~gW[Z.zvn8 1!VyY @k8#(C`Z4ũiP@oĄ<((67&Tj8BТ4+Ď%S$stv6}‘OFn9B ס:X'_G2VAm ;w*4}܀LIתa0_F6! LsCU5h̅Ey.v}(n㚐?sa˪xk)}asc| {tWo$BÄsCF.kn"\%[ݨ2DN-_ a>cga"5B0p=sZ ysk&PDͷ!cWZ5ݐsދZe$%о $-W.=G{}zٛV gDS,9K]@L}mNc O%_ 9}k Yɓ;&OO-B+6e.Y@g P@Ak1(06~鋡(U)Z)| j2Bgv# EUoKٯSz.菱'i͔6*d>l҆kL,^LkԸ­O_+,Ϭj5(c,vn8U)`/TLWkRmd& 6Mh*7]uaˤ$=a"ZH\sE.}vPjGj8aɣ-y^>ոX«=t g;wP*$ުr  X1>AA<@˝;/}!o" %Ǔ2tuJD@Z,KAu#~'J+g!׀A0iXpR2;YK߼>PlɝgqILvn>X2)u^{8Gw”+?2_6I6ffN{ 蠶%JYvH`'Oөۋ:nfYx,('~q =b%$O-Q_G!dPBK=Fulڸ1I>h:3">{^皆fRyIa.(K(**2$oTzwmh{S3 ME,C7wʞxoyRF̱wY9(vc)1~ͥAc~^il3岧-ڏk_IhJ(Du;6*E.NQ؝@ڱdta|h Ar|4i <\"friJAgS5MFϢ+jؖahULTy1*3Xrы['mV_{-u}_'V ym;qC19 m 栮pd, M [6< dH"=Pz,3׭ }_)=g0*<Gk^LhF8e(a} :Ă'<.sz5;7{Q#z4HKʊ˜ $Q^LNkI5-pGRQa~^Y|&S0 zemғ3r{>ѣ(sgsnfwd SS>E/b[Ϻh!N`#U!dԷeBҒk_o.@gIW-g1%`*۪m L#~-hw\ٍ9:r_ewhX%/0ᛵrR 016h5;i >n#A#{jޑm݃{&A[i!g#"VŎw%|N.Ce6]\rmEjƅfPd9~Q>z؊TH}]:`Td`Q(&ġ{/8+h^g]( #GI`Ӱ/aBذʐT<ۓ3 gCոzxΦ@y7~-ޜKmr,F6\e{P N&\kýSuXYNX:5O kۛB6;RL{XIERڢnjA JɌ !\Cx:0U6 uXdQE^,N!҅-kl]l>R^-"0ԊPrIC{D& R+L$a/LFM(e=y~zsо1 (x5S5XrN5찮l~u5\TfP=q-Iʘyc>=]꺡GTiCoV&7-" IYFԌwP0L2_ Nkn~jR ѦC}Hߣ,LWsA;}{)D6~ d؀ZṕܑO#Hk0 z۸pB(9E4@ ,v9S<[ Dc^Ůr6vő!4h6dP\uЛWQiM2 Ӌ֠ BP-}0(A8-s;'u',/bt@ !"a^ ,J-+?qz·Ia G*\Mƌ>QLIXG KZPHw3 7D![Z:?'X2 VxJ4>XGlq[Y7\65`Un `Wȏj - {g psbVSìhEk"ғWusˋ C$!l@7,ꅾLU3:*\pTHٻR؎-5C͚jv˂;K<,mR]VWVhyr\C?!Oi^ F2y*Tly e~;$1crA)Ox;@) wX*!FP9~gwCtx>^|uK= h=%*XiǬ̭L^#"ޔ `tMZ/ cFD<6ws49@gx-NuŬ<י PJ8HmX\zA"հ $:#)w m(u<](9+B~) Fkm2笄/ `ˆi?FkԄm﫬| n/BJ6ᙲ2s+¯*%t?/WjtQzdΩHކljq_  Mͣ3Ëv`g 0E'߼GPg`чʆr9`axo'.ۮr#A~gނ$qLPR ?<"?ǘ 2w-3ѡ?ܒ;>bo'KxB&{%{ o%ىFf.9|gΧVڨ1Y K|5pڃΧI4 %ռUF8u;d,yq 7LQyk8?J4xEge 0"߅X *'L&/8BÔl]+)"ȷXDw5xS}K6?R5h'gh<-i"yXyk@$f5³Y]atq z!dlJ;߭Jp1;%b<3?%3lQW0nNQ)7[pwō@BQ1qgA1vy@ #L-?&*:/2F/9HL/a{Zݝ#_@N–V:*J4ȑypd/]v`aϿ+Xggʿ.%)sOUxR`P$SըxL\6r(dD᷇XQP% RwkxuoD xtQŪ{ly Y%؝zV@63TQ~Hg8*qlz~fКgHA%_EQ~YUM-ט4y6HnE fuuf\u`E&9Fϧ2q;nZuت1 f]itPdsmW3?7 5*ң!(K9j+pf:r}A7kjCϛIŽMۆSPʚ9v^ZrrIB\8UeH πb$c7Ɇ1o'J+6?osF{p7%4CVѻLijX&S)};X/׫zoKZH3UD|ws'ْݭC#93v+tjFDl=q(!Ų  )aTlU kX9ȟkd NRD7B3 !j9X)"'`o1*KJO4]] 9tuY'_1/pxϝ3*QX+R`W:Gbl}Ud ]GgBZX`{|}آ8E{pK&MT\fm9% ^'ǁK 3xy{ߞωR\aKW 9gwt-1w_ !-DLz%ؕ(/4oϑ>VN@[2H9o:ÒOH?&8#v)PZy^B\Րh-W{᧩]TjTڽO%l@tzS;X+|8qY8&=~jynz; ^p@sy׃FJ/nM.>s*4k="TZ/js0֠,UTU+Հj´_7z'$j`/ǟv?QUE'BcE(ȝUhFi23shg1׶Lo:6l3tgIJBq|K_Hkt/kfZ{hNB..52,`m=K?n,|(L>F<(%j!HKaN,FNGHMiځ+=xi}ừ?jgʐ0(wl?PyF88?tRܪ>6&*^d^<@t׍J?rҷ]K-:us2>ĵ)>+`B |!ȵ>!-US9%:R9V;{'e >Ҧ+4_WV\҆*ZnƐT&{E5,Nc\>lꞍ[M,r1jQ .cKM A>01H$`qJ֩Rff vFv I|3 "&_n-פxRG/ o|egUcg(guN ]TdBU '*T[ rMΔ"ʸ4i5iEo]@~O$¦kzW'gU&p#]՝Y+ r`_eP:˞n;T&K#::,s]H2n6vb`(3Gqչb8Zrh6oT{[Kf Ĕ1Fxaqob&ˈ j~ r|8O.v@cR /[\bs2Ǻ ( s_Q8 ^W"ݝ9N%zXWO_NDScI^}O CP|lmrj>cc O}YL9T5V|\/,.Xmg>7^ sb$+Y_;|AQ}g; ]K/Xr@|{CIm^Cp-Ӎ֎ C HI uRmHv&I22oivCu1Omi5^(ݙzn_oV X,p+?oo6cїIn}z #+>.h:ښ7T,6T'`f~]deУUkISf`tzG94~5T  L7t#- oFcvbii 6+戯;X+ȣQujJyKT<|5r$d y*EF7@.A ZxE|Nm㨱yM6SF+Gb I9`ЂKS HϽRjc,J10o?x:O^k򈘨Ya/6ȀoOOozd_p5.)/Ɂ~0cW/wvhh{^bN!D4vH?.]^PBZO; G~*z1Xb J][7 IU6bzCm+^8YJfyr JI촡j%W05~Gz }ɴĉF //N*RaPo¼_T)GGV׍qƏ\/XH%Ҍh#o[쒷]oAq=cfJnȮ@X4Xd`'Uz~KkN,UZbvm~wT9eBo-c!Z~q\`6\WxKR";w\y|}ܧ=;~s}Uϴ^7kH +bP+î>eα1mZ, eٷ2\N_2uR\6N$u#y©U7zR߽;@+Ŵו I-|l['#B(M}Ii9DmU`YixsoցV|~%X" endstream endobj 907 0 obj << /Length1 721 /Length2 26580 /Length3 0 /Length 27108 /Filter /FlateDecode >> stream xlsp.ۘ8yb۶Ķm۶m;db6&}OYk]EN,ao`L)"`b`#'u2Xۉ]Ly&f 39@@eLo#@hbikPw4𹹹 928 03觩)`fic UTҒVPI*$ML6%W#Kc)5 ``logb/L `f03'{[*@\QU3I3řhSc'eGp_Ju 04v[17i;3{&?TpH 015'Fhk upu1uۛ:Tmv.x39,%,=LM,] hEkg]MM,]m3>YQ{;;?i{BFa-Ya5-M,?]d?`<`?gгٙXܬ߄.$SSSc{cJ?*HڹC5f[T_&G׸F{W$xSɩܗR*s7u[c?.AJ4Slyu21](; kvzhY_(sE7F/`{8EGZ_Fv Y24'8%_()dKVB\tX}5b\a'{>3w>Ǔ"JRR<+ ch,q&J_v*K8`(d@:/Omt]uK x67o:z`DfR沔߻쥶iA_Kl)Ncs$32[<6fv]vy|6vjhLVȾ`^f^0>v#&?Tf@&w'.E7$iX1P C_F|u40dsԠ59#v!;m u㦩fە8V_95rPƞXPo (;.g~<;dq5'vZ.z";*yǡɰO yr ߋږKZ_<'h"4oPR;J}ϊM?y( I3Lv!䗑SY|@/&AYMQ`Kv4³f-doc-dˤ!vzļoYT)q5[``Gw4| 4tG)og#.ƦMGGۀJ\ y\/HFW6Dk{O+{:ލ=j_ ˻NC/^-~ \TYtȃzu?"CR!h%r30xh2fX)Zr#4`&.!s2wqI..[-;]rTmhI#}|r08V-XMʔ@0KDy6 &z1Q+t ] bXKgJ$ yUxqmdn 3S:Ke"j]K g"3iH0yg sϩۊ~MaoQ}>&32@ 0I㪱5n%D +sʓ iz#A$qQ}'SmU.̇}旇1vzQt86MPnF/uܵ)1B!Tn(l b%w=AgٝyBryɎ|؀٭&Ϙ(R9i. ׬WC YhիRG̫&mw@JW!cej}X4f~.i~`0W[^3ZZq;]#*bJSZ'*H[\!i,5@cbCJ({lQk"y>asxLQ)Q] ?o\RW%:XoLw"gaVoNqxP ,شWd!僊# n r R ߍ`=Ҙ"@W;y,,S6?7e2شh8̺SHְhtbV6C=7D4WsCse$&ܢ"jL% Qq*f/nAnr Uvpj9JI\*T햅 )Bq5(؟+nJG C{Jm/$"qLxhpN=JKr 667v>ºbĊ6?~^sTdt)\>@ ~ݼ mmL]` 얼 g!0lz-Ja "U>4B"a0v>؁9AhU>__y`(E/ 2y$'4BlO\7oFwa FW l}HŋQ&Ul},'sV\w$ <^"3F,] +"uf>| C2ߋC\;a-i7mU*-PTnH^*$E\kASX+w7B#Wb>_ƅ ղ84#α`|7%f'^ kp#Sg@xwQߒ>A?4a?z1L`[Кi#.D9;Ё}ۄ*]tE8 #"TVEDKo='Eg,dj@DӋTHY -Gv;g7}k0Qv 2;"҃%Z ϸ1j^Ȑw '0 ۵+iEbwCS%߭ˤC5RCMnmxN*8И3.$cN<"Hu2SնT+!x{>2aȕxo409naae7j.B 4)M<?3/Nϛ]ёS**'•zWLjVRJ-*k_I ´^[HZїx4Bp˥`,[<|,*3q %rf,'P>΀ ]cY[h#QD fM@!;%3de3Ĕov>ģvP)Z=HmJSyosWo ٪g:k^wB򪣽xfp^ \CǜH% dE_cdOzr}^p|:~Ě=dk:/xUBw#3,nw fu_!pn$]uJ鷖盔$F0TL:iNU{e vh̰C+J0O`oRQq[@:V`W}ǎze,`z#^q4`%+ jۦ .bI.hH[>3l,Xw|Oa:s mnrb}8 m1gL RF9JΆRw}VŅw3 7;,o>YXd?JM\uys/#܁nՁ g0HrSRz@/rT'W6,N7*'T"i=\<+Xwξ#sW7{DK+j8 2'y?֋ FV>;"<$5( Ql5WlWF 6wMGTL83.ZBOz#n_*/R-\=4`/`䡞si];&@;7eY2U߱X@aMf3#d)v$nJd:tX 57랩q85nb0#>0݇r Qe7ql+,,9hE&!uBbn+)Ϳ:ASwʫ{:>w)uZ:;ޱF֌0htmIWyG `Kl{07$eЋ| 7ݞGŷ;`8&hG R^K-V^s6mJiRBKYWJ/8>>[!ʺ)lx.oj̒aa -D4Hr+QR^5η6]/+Ҩo8ʲ+Vg4=MX!ʅbn?Ԑ i}[d[>~\˟)>.zHw~33ϡ03#)aL=l$^4b7|Z?dѓ ȧ5xɷNd;k vӝy44rw ½ۓQKTc63|t!-(&!55xl>HY}xm> h?ภAd7/jHN.ǞhqÍߑV+ͿӞ)ez_ iW_d5>|JBst 5"X4 vg_w CCǰ>T|AM:?cQv.^҇̎Q[ETDKmȖ&M{NOk ȧQѣWQ pU#3FPCsԟCAoRDVr?'cKǐgzb+mF*^PT!It懹#(9g>rLK:\hwSZ28[Esbv]g YcG)?2?eR'a^`B'DX7z{t/&?气[dT#ޜ^nr-.#Óz 2[hOH4>S@>Ub9ؓ7%|^@ *lZqϋ I[(}RO Sy]5ӣB){\~ɱ&gKX\E50!PFDWt:>(;>r){DTQVt* Mh09Mx8>aZxg}Hlj^$87 WG;; 4je"5kh7 +ULNb }3v8Uu{L;ɬ}4"sXPMī \\JY@s[` U3a>V0Zw·t7\ЇnNuLEh.lQmU7ohh<5X&7 qpo3l^~'ZLl" !ӓ{s:2菡K(Uw 7O7IAX5hI]`k D߅#/AeHT|~BV{OY(/poR`2x`Ob4'+xeCYF 7 6WM+ 2ƍͭqhzqc e_Gj^*j a͐!玸Ҕf1,/pDM?,3})Qn= 0RTz0NDe#茾3 T߁s/D>5UP9'8Ca2[Dve%~s?Y8i;W-6ޓշ0xu3| dgX }u&w_20K -,1Y_6~|( vjم+W1G&4 %P Aw8a WDtvo:Y D 4&@ѹ,]M{ڞI8$,cK`o9Ș0WxmF]{_u̷9Ǚy= Xͫ_HkWH.ʥ?< {F?EHQ"cW BN-ݗhhTLLvYhL ?7?| S$[V),'`DH((JHGzJ婾!]EkTx.uVN*}0? OfȠJ͠*ό1ŢOt,+L} Lbo<2X>Հ[$nt~!YZ(ϒQ 7觀nGC߼toYZ T,8yR0(wgރ>m{jw'''mb*#g홙@Σ%29 ѷNGeiR:hExsѕp;V"V~`^+'Ju7>aѕ Y}ᝠ:*Ejǖjl&R\!nQ6!_E<֩j-UNTGeZog֡& ? 8F#ȏrFӧ5@Zb&-D1CX)2gIN/腁kkpZw0JpbTfS2TnM\t2J(pB{e&s({Q"OA8Țq(taBi6QYl~ɻ}dlMeY T\0AHrZq{l `jΑ~ ;L[ b{(.ycoh82~6xc%LoVݿI62B,<>o3{7]׋$l^ʢݯ Bl{DA]m_Z:Qz u{r ,Qzsv7rYG3SjIhntS pd@ʣhi CM(( yugRW$3Ǻt@v00Qq 'BӓIՍ⩸R` 0¥C @ۨʌ[Uq%'AN] =u+uzG UNԉRH9wɚ)8< \ڮu˼wxмT竞к[outN/z@%έ 5@eYzҔx/TUVGv$ȷ>bszvcO-6ӟ@Ivto6>x5a_^q;="ϣ֐Tt gy,Ɲq\"3PDoMg*q:y`%=3qM?,֫S>KدK v^IneKl %&uMZ:wG! *èШ$rq^fMuSy9YcڽS/CW!1dXuZm@@.Eaot)lĨ_S{$TAX2gGAvHf'Cr.Š`-kMW,p2WȥNM2k!g C:wxqɼ"@Y]P: 9 Eo^U1.9v^^l]^ܫEɈ/"9V*N  qߜu&NOFw<6s'єK~'sREq%i{꣱V8U-3%g%P@Og/,NamjK!e`q}C٨2EUWt\/dTߴ5G0vG>X%΄_1 q SVf/=߅"+⻔M{.ƹ˖rY ^Ƈ}8ea]S"_)7xt ]7ehl'(0L\NqQl;f1Z$mƕdWé޵DixsDB̩|4Mi-n䞆٠Vza+K "-.suêwHSld3Aͭc|C6gzO7Yĺ񃒈Ivr(z rd3̘DYiym,mշtA ojo +jϷ2"ja\; xhPu׎ ӱCLP4P-e90:t_ .rmIܼr*7cMq-l-۝o tgr}pDbt#c>T;T=hwZW'm˕"`hMe8RM2uXq;5;Jfa+ f2`g TlDaVDw0zB+HrU{u =@gVdMiYjGJhO7܉A“_^+ۣp3M[5{v Vݴ.VV~]<J3'ڥ㼗CĒT]&.&0yͥ_‹IcgPcrl2b|p|(9/,kepKP炾̍M^+0Yڑ]qŮ}y2>$*Бw+`sm9lo-ջ3q7_"Ɍ=3BW؋#)i~!1)~K]r5R+2m IQ3=oj%t$O6.(߶--0_[T ?w7?|DkKpD0ngr) TwH7<:9id2M},Jwbo1rsrz? ͉Zڏ.'W"ſ)/HBղe47Lnz[%bK̂GV; ͺXr|~u%|dL܎tnl}dM2>s%N;to[( B/ //8\2$ MPwfoP6zM[X[>' m7 ܾvp2 %ǘ8}%]` EuhZ@Md7h++_IQZ6uYF^t-A1c?hm z/dj獑ۼ}gfLf q܌9N膦TbRySuSc-U 1\?h&+c8hG{l!'ZClR]+e+m-`AlE1n8 K ]%Qd#_B ~RƓkPMP\/ډm&EgUlD8.Y!%\xU^cE>"4h bL05^vnRzb2Oi3 /w1p_]]MւN88Dv T p]fW `Fꃍw&3P {r4=&Izx9HCt+Hĥb !:_IY/V~#7g蛴3&Գ}{ITJj\Y _"@>|&DZtmb1(neb83l|G\%Qzcxjǣ"3 X-\f0q$[bW{XסVҥ?'QW '2`ͯq`].poXn!,l5V}1GB:]ǒ 3)yyi=; YSbmS3]+.mn2ct4liUcd*EZYr/n$"'5o{ŎZyOϞxKB&?p]Wob*?4 /_ uM<1MUCf-bj=%F5O\ٻ%ͥ D]!GJwę+;(~fs{ RUNՇ'p6@61؊ON{[[,X?xuW] @];65;QE>K÷Є[%]}ǪD鯰\^OQXG:]Knt(xXrFo]sK#K!N~y*b̥K$]Ooԣ*ϸ%jQ}vON$N}?8E+2F֒"6z }B8w -̄jn2;z -x[urjm޹] j>J-06 Qۯ8t 8r=ڑ>Yi`?7-7ґˎ7e6 ͟ ^kFV; mR'+?mZWQ{276@B#ي~+!D^Fxd@ 8CgA,\}OndL $!ΤL͟0'kX/ LcEj63Ce-q7[׊iTx %uҩeo0a#;a֜V8j%>Z,"ڼoQN3]Q4j%q0)fl4t ߞ7 #LEҙRy*¬}C~8dM\u8q,#N3B¿ p 6HOvx%K5S1C%4%y~2A+{ .Wli hi0ـP :=!>*e< z *eVbgђ՛ K>r! ^_%2p~ g̈:SXv$u))zy}m2,W(pPHР!6 yKa/oM_o)}'g)WH|J8yk2ľ(>>b\?喙'`sO#)'fI {'2Cf. rIUΞ<ӼmN19>\1FPM[B! x㼍mMnm3\i1lZ/n%} $?C MH'Cq\ڑgH{<_{' mKP]FnL.`xq$f3S/R\ep Sor aBf!wUSKg<2*S]~Vלa6Z$/fyXUÌ^Q2?s/0%cO[ }uԼ?j60l-W7,Ff@D`6WH2HN8ٷW69D:T24ZXʳTZK Mlyv.RK zScWڄ4dj`~1̀>bsgGd(RmpvCT2 N3ʖ[Q@eK#.؄3W@_Pjo ~ į[S>ʔ+\1hn3ɩQGAvPVI/N n G-} \kBC}t#_)Ӛ BK\}EԽbGny N7HɈØ֒6{3R`ŇpFhFlnp@)cy@ݠ`?Kf!B@8Ƒ j:AזTb`윐K8>qE] lHK$5z͏f{0d)rv/C+Mm/?W7fɝ #L& ~ڙXbܨ~bf-},gۺhPL6d]X pق4v E䯃 -1:s^g%>wKM9@,xuˠI= GrɛH*|;S>~T9ξG|6MQW98]Z/As!xmaXHņ6u2,x9,VK x9s$o,s77k?A"Eic( eB EQ-EgIZ:XvOS |R43U (g/Wk]U|Q屯XL_9)Ÿ+]L O=Iܖ]E#VUTliFӗ\S8cze:pxo1hx@zYTS)B9MJg!;Ho]{ VS=_.fTy 2t`ؔGJasB̤/W9y2!6,3_4 ;,hSOaG ًT^I:5V{ [G <)N z/HћBsISE,#|=i# I,kTXކ0rH_8~|e![y !ʳ. `Eua`WEq"ToP1p5H>kXƢVd_QfMPnp1 ~FCbdHpXs{>VxbNM e.xg#$Pc81 4CeL0ub:Xec{&n9 A;r =D?eμ=VЮ'艞g8 RN9e"_%JοW ݌veCO|U R6$r#?@Δ1G+\E YoKNQ;\As`_`;&cA姝sa,f\3}QܾhEL|IEaŋR 1yM(@&]N.mK>~zѸFr 0)pz&y.i雸!tk-l4ف$eX[xYF)zJ|mxn˱{ՎBAWyE Iq/HWR8x]WIB. ɪLRޗԕj\z\ApR7w @Hl\y"M XnY:23_5+9eÛҬfB!'~p-dbv ^t+dτ*?gC?r8st{^J}ibS8hsi^Bmf+8"KF:1j3ש^=?bS GW!2}lEtV,s~c$]"h2o\"#o<_O@N$YqW)Z0#',GfǣUjЅi Xd0x*vU !OſQgMPLbG.;14vͱWYR%g*#:NvELL>ܬDel`-5#Hw@#[g 2λXcU}o͋G^z1O|+ -EcGa7d %^nY?OtK aGGʦMdrP^,V沤ͨZGJ\Yj#{ y2#Klč2!H_tj \8Ztzris2lmFr|U狯м/3)Ѵ-@aFGɐ J$}BAF|즦csɀ /uNu\s=V$TŠt4vSpX22%Co?U7e+04GO~u44mנ LX*فEW a1q+o}ihh]|&h'hxVlz͘틶0˘:=O Q\sT@5˼p[̏In"BX3^W8p8g9@ad3T sہ["D }Bj.!ҮDLI ˪LrQ :$yϥΫ s*a G^Rըm9Fz (Ļj `O swgT-o"NO~wm_(=2pT_eօVI,Ok $縌 c*M@<XJ{ì*RGIe5X.=#Kr-E!SU< Q|eϢco BuU/RC:VoRMF)/zNy̓*h}&y2 H1 r"c Z3Ҋ_"S:hԇђu(t $P9;iY~X<'0̶Ih#+s8n{x{ eA[Y%6c5O"[`CxC1zHzy}X?}' 1ԛ<Oc%cՒ "O/E닚(jΆAzg4Ob̓t#rwd?"`3 x*iPw*2jk>N*Y2wq)ZS(&w#qXΘŏ6^ct%sZXamľE eBp3:%[4y 1s$s\ ʠ8U>eS_l8p>ל ׾˰Zq`6FzUrJ RI:Oso}hlnO E0_qP @WM+{cJ#x.JWQM-vmYv  $w.8;` a~0J!A "V"`;><"ICjs 4jBb?;Twsus=a!2AMѠ6wH൷v\@Ơ)t4r(5Ąb{JLvfʯE1?`,Hk! <}7qn4e-+fnP5ԜL^ ? [ (XybQ [TH/ Z f=pW495?tuAd(Beo{͋ &c 鐆 -`Nu" Y!"hڳWAjJey(XD80G'7N %Z[aZ5u l)z~gA9dS BYXRΚZ#Ywrx/%8"HPo[ :Z_X0s#c;Qa[*: {@ghDI1v GׁW-+ c_hk1Pɨ /CrJuW,a0ᰪ@ɠ.PrMKy.Ӭs=\EiYŨT40|H+*ya:z?s[DɈš$&Đ}%l#a WT/|!PGXrӵNVVO^Pߵ`ĩ^R;JgՓIc:5yF82Ap #& *տTGgL)JF ]MWv~6gVnkцZ ",-.p\i_A[sڻb9aaJuSK5ThT},Q 5BO*(UϦؤkwU|Ґ?}ޞh"^" zcL>MG.oS[b榓O+nA5xFӦ!jvkKʇWhn;fzƓR\j l;ث~z, Ms nM`CI?S^@Ze8?FTbn.57tRZa$}c4{..$OS w諾p)0̅P'f Z5Q՗ؕ((rfKFycXnz> "lqj[󓵀Bw6VzX EטeӞ -3#2A' .یZK~bU$P2G#vRBC̔cA屏X8XOQo"m;J#dJ`$e޲b''eS P6EoX7HQ(:$XbT`ȄSdy]#c n6WY+[Çқ\h o7 1M'-*H6!DTԁłku Mw/Y.\Y`kO%Fٓu.R_Hل!ڬtGNʢK;:LP`GE&6;=Z7ӾHeE;uP!{Xe-jgg:hUę_l6+v +׏q|N쵥ؾ^dP٦cE?|`r]_"w&ur-nޯ$*K髉V1Z h,\QP};QAR] Ϛ_1&i*/Ygh0b$S Q3qՐv[xZOU+a`ڑ1D]e-O{Rt`;dpA74Z]Clbem7o7-*{_٢I0FN9cYQVEg-ާ%E^ϧϮ5t5_ۑ<,r}1ב.qC@QBi@FRo.i\F(+KYMnz*`Wo m y K߰sxrRI%WYHK#Z0t@ȯgȀ;(b 1x>ۛxlSkE30aUR{-w@ jxT3Bw%7^YI{G%2󿣦T*=XCX*KφQTy-{Ʋ)mt>nR؁a*ڈ Θ2B?]fE93*3HW(*)G: OT{oGSˈ8e;P:+ӕ nhdX(R EO:g! I"/PZWl"|ъ='-6qӄw|!9:uQ(w2hf]T _b09o@ֺOBrGE"u?m})T@EjagC9^vApkB}%jY& ͝>{D1(j`w-Z0te^HHtTSyޑt? PG737cU%.vim)9MG&B?h_U+'kus<6 FD^H Lʻx"xS-<Ԅp95ZW}bZOޅk</9oLH)9];٢+Nsqg6",#'RW|?V{Eg}hW풿Wo^ x1n YZ֦c׹ۤ+ES'aK }`y=(q"GgK̆Swtva;͈# @Jj endstream endobj 909 0 obj << /Length1 721 /Length2 27908 /Length3 0 /Length 28499 /Filter /FlateDecode >> stream xlcpn]-''m۶m۶Ķm۶m}ow[gbZc5Z7) #-#'@ITQ@TVلfb P202IBvf #6U;k;W #s+ /?EJ&&gs @HN^CBV @!&35q4ȻZ[-LlL(v8#;[cqr7[WG:dDDd"BB[c?NMm ,Y:Ǣfd[9 M,l?ac!??RMLAX[ؘ(l]M2v&E; l,=q!lf(🐅?RX#ѿj&c ԛ?;jlgk/H/.+,!MwZ  ;-o`/N2Ύ-ÿZ:%(hE`dfapf8::[zA21q71^[3 Lk-3[N=;B2}d1hnwx}7`ȳ{#qDdg{<1MZL\n[PV{ ec$ vq眱(O5ɜ{^-Pƒ$_h+FC kO]8kRxm {Cg^X`qoFmжi-SJ(,(1Ătd}Qsa>ַIC і0ss JR16S`h?5rW'Ūk;p ˏlhIC 4Uܷ|&1{ZÚ _}yO{^~E0,!&չR]qmo zXbƩ\nQ+/FF=xzܳxq|=\3AC/|EH1"U!t}CyՅJMs= .|w tEҎJiu!c =hWx{8(:-LM P(֟8Pܸq;tˬh(-ܾň0*H7ꦞq9ezS0]Gy3YhٺU4LIAdja >@$OgT.[%O{G`0R_Q죔 ax36*1S4h,Zws(? @ ˜L(1'e*"L9G==_y>hۦ"+ U(Lw٭Zayf^% ai}Β_t]zQ(R2.?#nG.ZdSz  ;ʹ_cJ:zEk)ٳiFJ휟wUa`;&o3=iK $?\.&=w:L9/u0!%+8])|.D*MBЯRv;̌O&I#us]ߋÈN"tpIkA9ϩK_ͱ)\BKRR (* NbSq%Sp8pP2Ź  e:l,,?4Š>7Xō03Sk_TI_}[lxXx# /󱄯 ܍7Kвti{J u}O}?CQu孡 ;~ e?XYT݈Y#9l($I A9+jȹ:ng!!T'yD=)e*_K"葀{/v :Q8,&؂*ѯ$ؾC\&@F5ڨ} x/ ) gIz;,7~L [wAyfEև5x` E' t4>EÅ]૊7}!" S&že=۹a QO 2&f~UsPShFa* >r\9nQJk>=#`Pa1FFM #,Y|}-)V'cD%J%4$SfwS2ˁ-It%жYngl~3o += Umѱs"=KӀ+" hf\ǔG*IbU GU ꈃԢVsHy\owVKo"] p/1Fsavvh5ŵē!}c)n}^Qrƫark{kJZ.~ĊC! z482fFx?s}wQu|c/]9A5nD4Z$)yalwJ;? p3#GBg臚).򳇘G4?rŌ$F:'@sUN'Dp4᝶g{t)Z.6;;`aC X>p@2 GܯJ>]i9Zܦ2\6/:{$EB:KS#oPZTk)NDR,6O`XՀnQ$wwc{.hTnAI'㔯u'3zΧird;ĭ{/?yןTslܮk9$޻ݗ>=zv]\Gx׍jD˒qiG [䛌'ęJ;0mu*:8// [ .Q@lvT3,kHTdD7BIV/-7c*RO8zmD,; \쿼 zBdq(|D C0&okJo){ mCJ'S9""֥QbD7$/^3ź|?+|$_!~i_;k(T%?q #Q> S#!)MAйG^M"hg`*.\Lȏî6s5~pY:c h+:'5*)XXo|V\*.dؔZCy3ؐ0 sxo&|X]TrM\ EZ'KUOR+fi?y>ITlcEm d"M=7E86@H dMK5J!S\/gDGO@]i;I[ةsFH04?'+qxg첳 x8.^k(Cb#H7_|"0xFX4~4[ݑe[n #%dy2 nL;Gb4gᎏ&v|[xjPq lhN2VTyO(40u&0@̇ejA --E-+dv;hO'csTW_'nt`$DW'i~}+FFܽ6f?원 I'p-Z:PXQR1ȹ5]zQ^O `g9R\:22PZM3n#%)!`+;)$wOi>H@!kW]شXڻ_eU`e1 C@{J *);G[ok#@d WtOu(LNuI[ .2~׺#zV[Qs}2A}@҅_ѽZi͊*h~.LڵzD /YJu12M̕쫊ǧy2|m8GD ِu!lu"hHbcp,@;Udh J \$Pqu3 $tfO @ݟHaB1n}jū/tw-~pKn#a$V45iMD G>~CLh5Qa}yIu y6 ׌>}a_`A[Zݦ*ΞzKΖ'* &4VC;#ݭf%TJ4Ԥ畢a 2w>ңƩ~FM6p:%v%c'`1k>b_0 0W9deSXk[[[9ZO >dɖzJt ke=r@5'N& ;՛ 7>$mc; =K`͍ tvjݞB}O@[d6̤.WߤM(_,\ _}1P[$Osr= EK?WuȖd"[hh ?o cCYew0Î }Y(T`O7 |Ìxcq9íz"k\[Hg]:x6kp T&{ 5=sOf/4±>fLr3+Ug+m  8Ӽr7.fy#bDSEg6q%/:)t b[ʾ8[ImV֒ŭ77V$'sq/\oVo.Zt%.\R6H ]onCm fz2w,bf_s;0Y#+[zR*Q9ҽtT,{\| ;R~mxj#haBn;ߡzҟe (.[]L^(ڂZO%;`"x{]뿋uf* \ {؆2Jx?Mh΃nmy XDZSdtnUft:5zE4_yzf6AisKwtݟp懨i ݽeߪdà!J%3#C{7~[.ymږ.~U ٫rCouڞ, _R[S{@@dϵ(c_Ŧp4dašRPфco y {] ?%Fy2Y#{䵊U .{ew)!g}6Tj vNﬓ# K*ŮOYmz7= *+ `8izrPI#Dl[eq #2;Ԙ"kpJ l\OaʱUeZt ʤyF1K1zT4*hD!,ŒnFeqD ; T၈"uԄ@nid_$Pg}fy1$|Ig_Zl\„= cfȽFϐC!ʱ;I+Z ^ a9%Dy,/8>v*lM\am}x2LҐKRة`>ޱd&yF[7Y@U?sm?/DeM'|FSZ ܏u~D%yEuF^s[)+Eֺ'ȷaZ61̙|R>2'. [߽Ob*>a+vkz2!`ߓm3q^!㸣\9?nzzpdq/p^O:}:,9S/-0 *-RfuZ"6G4J9+`ZHtLBO[Q0!:*98\!*Iɧ7/ZqA(9o]2mbi,`ߦ AYJ>xZʡ҆&F[K1 W{$0Nk"GK@4OM'ZR's,%70js}|[l6[qZ9j8Nnc>%SF EѳTeDu`flY Mb|oIƋCD!{Ti\)~rj.ocWh=Y~>t-fn~sb-TNrGP1N z+v-_`!vߑDV$</Qϴ<4\S&*u/\, n૨Y]4f#4B*Ů~-[~awF#'EP-f%c-3-TQ.%-$(7AK eT$)WHؐ™7Qx(.Z)<&p/ *Ks @$-d#AWxo?TLАT%kr(Ggqs N/hApekCtK>qSy-+a@O I%oɝ@O%ѿ~_(w*|9z U|mq1f:3De栄4%T OMTڧ Z9ck'MSC 3&7/9͂Kh˦M鸕SnqBkG-Nb8B1-+ =?28TZ5+s0?6WS?hțj{3Vط^ m.[ bY/1O +jv}}^* : 쐎yQjg%z~O k(ٳ8]@B} 7peL]ҚIȃq͇Bovˌqʔ#]~تe6.Ӭ֞kRZܿ}#t_5:`S!|8ǙZJ횻#)BEqB R+ciG$nDgtu%?H 2&6]BU8;<ֽ:췘 Rq&B9ӔqqVPhWoދA3S9frst4Ƹ~ic d~>x̳RPJZȸΐ̶QƸ@@ѥ{W7V -_kN G7q ~ZGm= z,F8–șrv]6`Ne}vu=&?jJklU=g\zըɘme_6UJE{ê9"wr By$C;iY'zȣ\hGlgf6?sbՐ'=SrH*sr(2Q6_\U1p21̀7Ѻxan RH|A{LɷB4*ʆFzH7@RfbE[9¼pz H fz(]7al$'uÎd=F4zt|^l.8qʻշoK VZ8y` p)+^H$jRjhwf)zøӢer.on3յ _9ZffiJO } aZ7Vu~ςb vuLBvh|ىSP!FBaHmʨ]oRz !>nCI q|-G`j7*|#-6(@Ӓ{[7|3_7 ۘ/ovS?e<;VRo*\Ol[}(Rڹq"%-w8!F+1RcEV%,i جӦAaXl% Xyel$gD-Z@Q{x2eGNC"nIEY`*!~3f^XIӐAf1z E!ЋDðNc+=ܘ5Eaׂ0Z}o~ WenNQ1j界7U!ň{qq'K#Eˑg$dGk%h(ђѐw|]|` YlaiC+'ԃ))1ibXIO/d:\s,oXT&麜 =ɘr`@-&)fLs\}}PBxM]pSӃ+›o˨@a 1F7}O/N8KbAԍ-@мS]B;4 ;zr1pM}B݃:S9C_.%+MYf/+ކ@BFR`mspgx]wIwi'7r4 iå|ĠS>.*K9Uł1X 컉ыvQ^IhvƳ"_@/{Z{/3~g@ Hy6vF/bƪ^Npxt9+ʎcL/MA/;W?X zK9LˢBUĺuaau%f"&Cbu>dY"ut2RO+|'bySE(!֞CHQ-W1A*!$O%|DMOT$ p.ɭK`0,Qv_0Mh#*3) x˺1:ϭGG3y/T[> fU[2)XާdRxes8#/6te.bM͝. *1QbhU e}{i..}l `] Kszk`Mt+} _֭TџV&U-r~==]NL$9xEǰxfT:2^H|9&DbqIǃLCG\0Q,4׬w б g 5'bIVBJ-NXFrk]q2_Xs!}JխcKߟQl 1<䵩xo>7cR1^+K*G3oUjqFҺ\?y WVzi RqE|*7Ul(Yyd؋VUysvպ$t,kt]QRwp9#"af ٠ v WAt'+Tx3Ymght3H"(V/UőpH<a:ucg>Y=1rxcGdrr$e5\IVټ«-O7s͔ZHS y ؆,pnx*L}^`Ӆ_"cWo˦3`AIƭZ^+b.m;Mp/P@"F)<\7LE{G?h Yd |/O,tDl4 /SYbƖXb캊Wv<"nH .*rHa_O{h%%"BL2 `ְXc ]x]~|PMJ3#JטrXx(6è`+ Y$H"qzij kp~pvW$55/R \Ftf޷v9|tI ڦam9T|EKq7OJ[?հrCS&i)q=:saoTXMCLu -K5F˩Fov>VsNy-YxTlUh g>2~;]\Qmlu'dL ѻX5rHdꢄS Hapg ̸T@dM8qo(qw/v-1Ɏ]sO@0^ N?CdY? I4~QtiP=FoQ)5Rb>wPQ;XXoQi !\_[`߉9h̑x)U9DAT"jX^_!Ŕɞ:EC[coB5τ 1'NeRpH?jdpsOO=0nrw@Is?柗Yz YPO\ZHd[bPDI߽֘Zc ;fxnt^)eYķ%̓|ڠOO;WE{k$Zxe1 0<*I%7EEpDYlм.Fʛ4IeX)cLA՞s)61_fQǩ ů:Few# czoyrNXYp̬iHm;(abEK 6&w iCiB`t|_aZO m-;ŪO1y:Zg6EbV)&b P5Mn9%FdPq̄\zXw>O޺Ж@éڤ#担ԠM`P_'@F],E)S;n.r3ƶfs5||$@Bp2Fn|yu6Z]{fTqp\3UK5S1rf *YV.1g CvB&㳬k|e[ZIʊ[-PboZ;mAA]򉏓K4Iǐ9.jѤ#-8vdRv (#z8sRJdvK}jq66L̆颌ghմT*} ߠl ϻx0%Dϔa| 󳨀z Qs?NRRZWtm"媩)&>oip&0|;ꦑ&hQ.u:nҼ{,@q/Xp^`&h>ޡe);֖SB%`j6[ː$lMBDQudKDz j@ _X @ U1Id'vrhE8GUO3N"L^D)o1<_8m!w(uuE.8dUK03O ^ҭJL0!9d7؆+T{TXiNA \@s + ' %sÿ ѡɃ,3_)uFIPo~lR3T=DD )bT{~51gFHuƐ2O#x- =bk+=`37m tFVGaAʺ{=^;C%롮͈v̭۱XvE*5 0Ai2FGFTdfQ-m=Kk5צէr뉹V )*=;G1{AGlb2^:wm3˻>Wa-4$ʹFћL1#+df.u2OZAT\"UosȀe `ŝ:%ԗ꼙JeßD=bB|j<13a%Wj<!MjZb;#Ęa$kz̋/ uQjci3pg.JKo? +M2VE <,y䧔 44<Nf kgqp SR O"_- BgC'= hOyuA>o^%ScwKXe0a{7t5d) 3 samd' s"]5|w=J:ƻ8 :F%D2zW"ȅHm 9z- L>Jq$dyp|dLެ X6> pL:KWRQ!;w40X],=(lb^`r93rrt[kqzjWjV?؃fI> 3lZ1u o񴇽D WD 41? CDQNk9Q5r/:BF Q_:jue(PUgRa[&52.^HKgq < J~0t 1|=<b_%&+΀Tэ$?uh rۇ¨;ESuuEȎZM@X/#%sF b1{ 6ԔpXP(V!Q;"bQ84*Q]PL|Qu &:;~7;n ǭMN|mLs jP8g<&xSoR̆ĩ|^{䄧ޒyAÄ^>gI'8*5#&٫*i(Ζ>\ikklVy)Ht^'{yKNKGs7㼥x9rǭz5%a:0L q@H9Б_ Z>~j@֎6/F*anw9>'T+4S=ou!bCyCXn3&u0@X?M5V%&9qڼsy~'0>Z'-mcMsZbNZ~y779 x찗i k5)\п;g>׻Q$EB8m*2~gK^J:Չ.x z'D = _v|1"d?Ǩ/E= Q KEhֲ{ 32 H;zi 㕪w }HSv,7AXm s Ĺo.;fE`F FSorɀ3I N odQcxAja~AN_ͼ)'˕93Iq\ͭ Zz, 4/bzR& (ގ;.t<1\OJ#XI On R?jz.S2,EZ '~uhom,DK5$,If546CLC=0%=eT(wzz]Ƹ ۗDWsa 트".8!>o|~N%\DU_l Y FH샂N =9{zcAWy@( #mm%[ԏ-حA^{JA1+WJRuP L.Sv5L7w1!k]_u~jp-+迦T1H(K9L1C}$s7LITG5f a3qH:`5v= CZe?m.3~a)טn٠e kҩM^OWv^9duw<49F_-3wx#B/ 2FیԼ9Ι1 l/<.H4ſE-)ݳa4_-r0J2V}ʫ[y4LY&YP$\Uf~1 9y ^G^o'5cJ}*](I3;*TǼ&̹dXB#Uۨ.ޞeOg1^$(WPٻDjf^)=Ѵ-a,smI6w9X,VnQ#v~-8'rqܧfаvH/U!+"i1떶kQ-yCjJkM*e17m.xX= 22eg[C-T6 .Qٞ4NK7$4#֨m7ٛE1X~qʎԊ63PG?+_VNS-*AnJM*'Na'2=!.'WkSUG,%'-VGۃOsМttͲ,J[gfUbēõs̔40^VYɽZh˩NČ31?s@7/3Qb[ VLPZP k\5H#edB77j |uj4NAr(ԡ@nOըvp`Jd2ouz4]HE vkq :λle-=aG%$_7;7%m.5'06m/',Q E()H֬Ek\HϤ~Ѧ5qHHzߓs`GLߛ ~8<j>iF [9C]HI|Km1._1ַiɠ8b Kx-HM0ѹ!&!눕~iE+ѥt :遍Es$4%˳U116`KZR =ˑ%=g~2JiqXo4)yȎ6}-Ʃ(­0}efVB}v$l`[2W_=uJ9b}~܌&gH>HѡܺPTO;d *^{~il&<,wklV`Da=~VԨ1φ9<0(9Qe|B?/N\AEvVJxҖjIt rvzNޑ gXcY'{]afw&d 1RQLdjo |$;x}A]N=BQHk]nwzV/~,_AȜ=եB5"S;]G+9靎i*9~gT'ʅ$e$[JJ:{ {v˟)|qT}uG1N++剠sH3Eu0ΡM Q^ȯM;v?\Ẹd)7EĎ JU{ywo {9(aLghcLLGb}V_]g i5lx.ދF,/40/_V1'A䞭RU,lz9c\̥x <fòt VoaSE7r' Ypc s^xv5IAds~oMCc!iJ~\=tZBX٭E5uWk"~((TwRށ?Et|u+Wzo%2nNhv#t$z(j0_cf-0)(=ez$;0CN&S#iy}T}8(\nY"zfL\S3]Ixϴ$T;gqO%@~97;_R/ 8>A|Z< ;bD*Gc,a| 743>n.œ 4,$S3?0MfXw5_30.pQ7j8!G4}U1#($AVʴA6|#7_>裺t;(]e= o*^a8a1;2Bs3t̤!$a_>JE.k8Vb|juXC 产|ѷ {OcjcÖU37:-^IC~ܰ<ɔMҵLoXD,4mSYcDB+9txՖiXH(޴FpCT-_K*Lb&!)d|/6wů7%* f}23VtK) W6ǢSmsx H-KYAcۃp4ͶSf@ltLdZ!W]z02EʕsKz#ſZH8In(ϕծun7{RjLy}f]oÃ) *%duԏigu.R'@DUK8f,R(r>FyKROЀл"uQ|汆N$ə$%1JRfXT jC'>Jkg9 O <-f{l-C;dSDgml#8|RpMu" sD>M[%7#p(Fp3P 2*kK%{C0ewO]!Yf+~ O] +|YϾB~\Ò'w;;Gz8. )=DEOMn^L|/,}"y3T *;LpҷLO=Lfpʺ?Q+b%?JD.9$=֔5٨Nu89X X>}lr)/]WJ~QI@ۨ{Q"5/ MUtj6G~;SUm|1<_%'A^SO4-a.e={&p^oQy*-eLiqqAH)x‰c/<1 ]]YfPL'Jg:L\?<bL؈M=UnÐrDK`b-T%b^*!}e! VGxsGVzR\P맔:M7K+SyS%ay7z?cb I!Q-/P MI2)GtcF-8qyY ;^mb4| ǀv7c%}Bxv%&w^ǣထ6c'fe0+pf\aFkXs5ERnSѮ ~1='ͩ+Ap;P+w,M4'+bh!@A_7&C ,BApգl?fHRJlODZF&pO̓azP%{'SFq:l@?!VaU? DOگԮX#xP˜gET t>bLGη%Dri0JM"bӄ%Bڷ 7hH cnqⴗ!FA;ЕszPo@+ &Z2'BRp\AFwP+pxChiwOf ȞS]8֟l @Iۚ TUuvOr@`z9 xҿݼr%CYP!6u1D/ҧryD<}O,.68ܢ_^xͽ_J1h]!mWcwiM<6Ang K^:ԫ13bΗ|[h V NZhnN{JҚ~a;}݂I:dhR2dg?t7]uJr9?~kD.R f+cy…jZF4~7G}5ͱGw$q۰W; yaGdExp[w貐DT ]ʑ^ɌxG.Dd+h_"KAȯ"ŭDNM;L(hVYy1_B0Va=M$>-I -xF?Vy_=ɣSbfrUאVC ױЪpШF Y0{"jL(" RsXXt9_^M¦rfB =Y%"n~s-Dh1inMO'FhdJ01_Ve;%ԇu__KZ瑢SlFS+qFCN=IZ#ȟC ojp.o5[ q786'Nnb<-ۆäLkHv1?k""iATB':`>Ge?+WR{H,7)gS]W|Jջ]=_! C5M21Fq%m.0U0jb54F3%J Pj(CvՐ w/S9Ld4n}d[%c>G` Yگj [&ÞJh2/E-O$1<:2T hKvBY9V|&ˇҪK2|esSo󥻑Dj*I1XF3pJISm=I"ջd8i"|Um'լa\_l`εgn(N"ի|)Cj;}J6') IH4Ҕ5˷ZHr+c׎}<Pt?X;+)K(gPpc5o>%F$*0[eSEߦW)XzIF[HjX]L Ϙg(5Zy]𒽩|]CI9 : qk..CpuلbR7{AXpP@N <;@쒎8:ZY sWyXo!GXsr2W8%&vo e,QtK\e3ʯ;w׼d %d1/XX?/pdOWc)2d CmPg@ӥ^+$9hV\go=6qDI~MN"ʛ{nfjUs51P-܁bVW ('薧\(q,{ -TsH8ۖa`z^VҼS#$6/Z#O'IBKd/r9?XK_ 07k|c#- MDJbqmgq"$i7Q_ql-kUXMmxoXXD ~œ9hMAi"c >f]JQ&Q#z|EhpY,r ށuWN{LhWlaQ812/kA]h[0YEL9j/=KCk´ 2q0Ȗ(ojYЗxʎ YYGf wpZOtoss?|MaVj#7Hw dhmlDN 8LAi.i|]HS @/$Πϫ GGЬqos4¥W(Gik2Sͅ82&!ӄQ+{sTdb3[NԖzF6=Ed( |9cߍy:K}@<@3# cٸ3 c=4% "bS4)a(SvTכ sy.z)[iYdD16={(#EVT^u*U@a 9 Ifäm#TdueX-\(lGΞm`zG/lme\)!g :_ w̧̅D䷧m 8.3µܖ٠tT j0޽En>lGsQ،2m|AP ^$ZmvًiJ*\Npyp%7hL QԕM39F9؂$_[K뉅+.-H8 [E^_Ϙ<P46ȚBW]f8qb5YXYCax-N! :y5.1`8|ߥ)[1H|v箎 Ug9 %!sy 3Bx 6:G$ґ6[JS]^"80A7/&Wb[ c6`icޮ|à \22v]ǖ X̠67t.zr?Mߋa.iqsd4ɨ)OƋ]4iIggѱ%/"e{r.(ݯ!ȏN7'ƃ(ͯJq L/s- zF|MaN]:D$<VA/AÞX%[ +7#E>=$`mx{ r/׬IԵcL*ڱh{4\ 7%rɣg%=<)M!lJ$~ S)6n|\k_|23<Dz$w~Vؑ6 澶_NMURw fDbϿJޫqt  wBor+>lzcMzkgP.<.y_KuX7C5y\ M֝AJFdLH(]0xlbUX/T {RNB?/o:ǮzqOAlÐLiAI_~}S@+8p+ߞmʥ1MW&DS"L SHs%*ټxR]&.nigg>88GL*CQ]kMLZGZ?]&n2v1w=z!hO=C*ѩT lmh-4Aّ @Бc¡8C_%S% ܯ͞UC3h*c_qŁ_D~ZP%"a[VU5pC[TÛIP%fMmao"!we+Q#a@ <|m_}צ y;ڡ%hY$ -OE\*0KjA@U=bn^ }FE~6~%Zzcz$O(/%#&^2.T)~v8W4$xm6,|n}6"P>(D K<Ui琕Q`"}-Z<E$fgܰGP6u1[ެ<@,4\PJG!3q>.)FH~B&X*%OR2'#29sFlQ"m;RrAމ|[^2'c+xQ }ҢG45,5HJ:hjI *\M.*n{ mf?O_0=J['FtڰUN]YHrPz5;Rw6J7xBb^P[1)%%Duq#o\*hB;BJ$` Q"⨫_hS2Ei|j[Z"M6SYi UOG=D`Aeggj66?6v/fSw D%b|TQW8ܔA7 Og 2 z\ M:wnRO}I $mQ bKSA`BRcAywC' [ C#wN^-QNI 2 /"Og6'h?G;7b@v 6”%xwH|ѫ@֥Hݒb`&$'Vdia$YO֫;Vþ U4:>^Gǀj:PN$\H,_ae^ϊpU ̳Dm;ij14N+ sQ0Wp\aRDˎB$<~ٻKp H#4!Eghr1<ؗ<_2IN'Ra {oŜz8^G~I88;$  { VN&'x#t59qIg,եl컩꛴̔bi Ж38x10.Fܬ_-:Ir5˹]L<Ow+H^` rTg@H-{wEk IyޘU*a@6dx*߶p86mπYvH܀ΔV1ʄvs((32 9zr$S.o"J^< T8rSo߸T3n D$'sBy![R 2v> N[\4l%u wbqc,D4%ay`fƿ&ujCBy\5j!"f̊fbNģ%Ðz.]iGN5٠V\Ž"'m*E>_a}#]F>&*wpc UĖL_{o6Ȍj x[nXuK֢ C*[ƍS #߶~au5m+4SbXU![\DCCg|儭=;U`'ծCD,9VB`Ah4md2b|@a2*+] K-O݇ eQ";UC4{KW.'OKi[XŠ{E9ёƄ:0Gν7$uV{ݤ%n ߞ KlʏuxI#)h=+󛞛^šn %!|);^Q5g* D"B: Z΂ l,8](l.Z>Fac2I&vqEӿơ6Rnbٍah) : Il[g_h?mf \YEر!D)*Hg\[b+D"D{{\G 6 t\n+L˄a[T̕\&& xTu&p1BB'@.rH$MNb<_ģiK-PF>l]hҎ_ EpJheB(,)}xt~9 ,b) }*uӊZ.7+q @l ^ޞ (lv 1m|Y 둴 (j|VB?~_oO#Ғ\/;Ӊc_(XSc ٯǸЁ q/S=Q^,>bF`>bP~kc?M㢽.1;YZѪ7:ĹꓦQK߯sWQ\t(z:*ZY?Yd`GgsIf!bf&7 -2dl7z Lv8fJ,0՛IZ endstream endobj 911 0 obj << /Length1 721 /Length2 17312 /Length3 0 /Length 17895 /Filter /FlateDecode >> stream xl.M-ڶm۶mm۶mݧm[m[;sF#WQUEN,ao`LC*"D CN.d pi:1a!'wt4p!2wH`bikDaocfilA&*O)))$:HҘHٔމ?893?̜mՄ%ԈEDv&DrR۹865v\gg_? 33  t3'OῩ9Ï LLA(lMDm\]LMLTmvEl-m<q!Ga;cOYD6H︦E?ϊx!ƿdUVӦ_;-nglobigN'VX{KD}y/&ӿZz%"bMNDDύkdjo711oUzkXx\8܌: 3t/d?&W8j8pF{-$xSɩR*sw·k0 l[c;̍ %):r~dIÊpG;Ij=J,o8ӿHsEF {p7ETܻKDT"bxkpQ9k  ߃5_%ح:E$-I=Ҵ'"8*( &W / \ڪ#ƫz ?> 4Ԟn ɷZ`.Iunqٛ3u?w&OI5=$ΔI$iGm{ЭD"h2TdlmdP{ ^ krNA.30u]I4C7bx\yϜl _5 >C=x _cWDt.fĮDƛkS6rQ}Ҳv/,*PB-쩹-5|hz3swHo!Ux)x@ѿܧq-y:kDo @xEW3&;B[,'Ii <ȭ#Q=$\Ax*[1FE$3+k;\deR~~ß._o#D?cx#ZEJh쎷cJ:`ᦥM\'B&e!_Y s8iY9|(pE~pPTB/S˽km͸CJ '$Ŏ`6 /(T_FpU^qlF@—n#g>Զgߝ tOqډ?=٤8w"(Y>IX;oqNUx۽?m!ߊ~_;d^;vPvQ{\ xߛjQ{KN[2Ti/Y3+WB1e[8.55mvW e*yږ myG2أ> DD/{b!uccExQ묳4Yw һU>٬K,񗿶ֶ\–}ఋLXR GU|r֒jV)ᖻ 8 gӤpET5 dO.iC2효Orܹdb)0xY5}灉QBN['5NxBW d>y+xk-QFU=,hYp^Xҋ`OnɌkr7otϠ\E Im2艬18d+wzVoe>D+F8(|XXz49{&Y';;,HQBvKoMMny<\|;ՠM#biZC~Sza;/6J žqxu_9VA0bi%\y>0T470vK ݰFCsj۪0[jXD/ZyDuߑQ <_^p>?̼WiP/b2(oeaB1ѨARc?[DT?ܨ]:%fv _&{ nbM!.5SyWZe ǦBb-o*J;lHlu?}"3^l?#H=,p z׾L|3f̤^ECz\xZs-λB>_3.4ؿ?||Q\, W=2ec w'/ }oZ/zXː~aǓe":2q$%;Xġ2Ib0U)QۓnJw5s{Sk%?!̓lD@Dغ(:xNO!zܮ$6c.qMw0`"OS<-e ((d2 'z)vbw㚴sD|]+[]oB)9E,Mje C37rx*A G4ԑ7mր$G!ɥ jt}= j?XbndR3`{t`L$,CQS%#Y /ֺ𖶃*}L4 mIԲ]9!U5yڷm,=0?*&r(TĽ)~  u== ∪p6"W~r7"ǛI|h?_O;kUF|) ɷpxnJ$"懔w '#>OsX堲Td,)][%\HءrB/Xz >"-~ 2,yjޞ&8E"XEQM8V!Y咆͎;\a^I_4a ,~Sh?cm@1ÛajXOD,߫cަHyG4\۝_ZloFSJ$WaF uwJEȷw@[H= m|8Po>N}~hN%lbM͇GO bS9[@vZbOvu02j\& {wx4g>99$u>K )pݥE$Cb[,w9: \2}]T ÙANO #4ZYk^ԫs\Fцn*7 ^q:0 8C}/ ;_ U:lj!-W3}SOF9`9)_Pޝ.20r]swH,.7&S07 BP(+<[n_t+Pw}T.̑xmz&@^º7e30J*.fc ک#B|2@exZ5qP*On-0;ŜyRaf_%kRJQq<:rWA%ᖜޛ\ISa,)eAne\4͸t6lb?3i?nGF\e"- n2(+J3C:}Jv8ߐr3MrU3*c/?9~oD%kj?P?*u^JV1aܧjWe-Ac!o7 ΀``mF#Cη*D46<Կ͕$켚yƺϦ mRi*m-Yk"cB0Y3'}Q`mw9AE5ʜBȻDDžbn>R&4ZES$8Lu #9~IFX`$t5+U|<|LISRshE7`0JOiJ"O׷2f&OhN6.xһl芎KsV| ؞ֽ6ZmXez&qopcӴԧgrQlJq'\3һܨ;- )X+ XR@XNGeq:ߌ3"㯶[~8p&`Pr-J`6+7ǚQjGaZ^2-qsUN*bQ9wڑd."l?F-QRdCX.4Gد/W'꙾R^(60 IXݼXӛPo_.rT^kɁ9c>rp2fd7M=8+57 =2g=9$*ʚb{Y[QxGZۘrec {yίßMW,r " (HAIQ;NYnxnzx4=> VE #Z6v {8e]5n;{Ls#Gك=D'?;+ág꒷'Ab0.e}B"({n>?׊O[qe螹^i0ȣ߰CTrD(7p2( YW/NTP0ძEb>) 4SڱP B2C }׃ͣo!n [X+kgP)~2"rUL5BP.}fB l~h-Ϯwl3ؐFԣO%3SbG-'n4fi.Va׍14\eMLTj@_9֬f]߉WCDRh7Yi5y]S~JP g Z%@238 ;F.1^*N:;j'!,,, %[]D\KKt%"o5[,qa(tc lQ~wX ЦV!f#{`QreR_'ް~;H:ےmRf6͆),h?8W`k+j pl*pm5gύ Q5$K^8DC'lhTə;!j}+n 2O!ebha^Ta]12]4!;IѲ\ftJٽ0~]*a}5}D{g:m"N}-0N0= +,dS,8ַ~"A!SbEEc) b膞z7Hr'YBV/*RQ ,pS{zA:3\]qHmk$  KWC;N;X'jA#[3 έ!efi.>Ĥ9Re2Q_\ ={w$[ZuO`cQRc[,.w qsqb|p02xzFFhL!4tlU{UM H MF(/=1 fH> ~ExiL*Hڷ|6l5taYJk/{n.3 c[iS-@ZUEms]Le΢¡KP/\σݶ-֔h!!wAbM|@ 2+b~Sso F c)G?;Ẍ́X^9mҗ\{/IBP-A fAj`%4(aWݻE*[}1?{ d rdҴ>uӲfu?yyށ"by"C@42A[P;,0-ڧ6 ~VÁ.I.mq`b;Eo$7%:B'cЮ0=ϗihSZK3Tq ɓoh|"*`):ܖ0mfd?_eĖtgG\zqKφP߸ B+{U0QCW}/ HVGA)F= 8:U58*lD'f;$hEZqEYUON'+x0=IN7!Tn|G%!LVn?oP̢A=$ɇYzI3KgXrJC403/\% F7魊|z`x@zD9̛2"2ȲX2R$<CP]4}lƁI _d$[[hKbPLpyƣԪS:X\"Eϰ0>J4rqɹs%WXJCQo ϱX~4PCDPG@4.*OKJ)np n& )/&/q1\(`?$Ȟ^&lWqe+Y7ʝT;f~e;))Ǔyc[U(z Ai[hʃ7^P)iK{'x#R5{7N&ϒI άBt`!]=IR7cx&\RE>< !Tf3hqxck+ V|4w ۷+U+#Y| OBmFn=oQ Y ZW!"h/@,sJ\;+ϙQ)Dnk* `085MeI ':"E5gC]:9!FC0#p5MI\OtHm \Amp1# ? zGlxx7/VٚS łj=3#';K}XG23|{fiq v7鰕^KۚgAⓓ_S9M[pO2@+S s$Vy#Krůɇ: ={ 7P9juSѺynKogTe( $NVb}߲?ڊE/p09`eTSۇ{( ;FVD1t`7io $1+ɌC66py Q{=aJLeY\ uɈ P[$jpV.Ih. ͫ(5 U`ZO6rQ"˷R6OpFUt5j)\' d ]TI۶#-Vf<Ldx;KT.0[tS$EO.Ϻk3~6=l}Epb$OJ*w?q8JHT>9 K[8grҪBŸl K$w.޷Th+l7?U/^9dAxUi~Z#Qxo~ɽ6g0iCF|@ |]~_qUOg) kTte>ɦnYq" zZw7~_/{1 wH RgT_6WV |o(9̻Sͧi0nBK"/9L|E\@ a/+- տp۳&G{ߜďv=+p_zi 迋fz{hZ2;j*x86]`Gj Ř;y+u${ߐ0KC-D~#@*Z˩o8'4"$:QjSķi"'ߧi}L\^Q\]9Ooʴ%g`>?1qO7Q9wS5K sy9KH @CESڑv%n9TRay RiniUL%G3 '~l_sxo1ŹO4I<4p?+C dNk509I9D>&hoq|NM"ꭵ*wFc9dZ^`axm|LopU܋=.E}ewLP(ޫˌ h(y_HM|!o! q tK?__հ2ʟM(†ұr ENg}ެb>-qķ]h ׀Y&aۘ6DnBA*6DWԄ*!{Z5`nz~Cm})槶TV笲P OC ,]c2hvB98qmUP[mq['sb%{cfSERtWdl* C:4#甘3t1Dr2/ehylKj[oXv -1J|u+Sv^fe8ƅN62n}Dpȗ}9]_e@A; ȦB йȦ qZhw<m}TIt0cy{/=(h|6bDǨЉ!zEBP%zFϊռPPܚ-ASBLoq&5bEzƝޕbnr .<5%C;!IQaՖ@'8+B 0pgi#a8}]qnSxrrARPRse.Lq+*7 ޔV E.lo!d N]UFt7bK_ ֒2 )H8xÔ}ѨfZr>m6 Q`٬O&eKU>.h tf{k'PL TInNg~nx@BLn?ioQXL|7)(:~,@u%hnqhM9͏TSvP} Xg݈2@\-ӥM8m U.{66pAG$2OxinL|OܛjE$#7)^qI YB?wPTn-lU&{ ;[1鵐 `ٍߺm _;I!!f8(4PNJ·|(-o:RU4tq%2I%2,'qAѡTDo}‹01f~,%2.մNX׉F" Ɇ(Kx] )~{k-*ksi{{B/ݫ6W^ xtխ7 |/u$=$Eo@H𝲛{ CRפ٢MNmL`EgGOÂ$ǞIzY0S$e6Ii?y D'hhq MBʛYI`&\+mlLx[`L=h+gd\Gpb>)0#g y"nRm%^0-lO ݈aL l} q˃W>gl  Zt/ ->8\r8A[}Q&/[A8N#E0#yflX}̕Bq:<\Ԇt/Ixlڴ)Ҭ適Mᄃ«m#5p(V0DY- RfѧP&N(*Ȩ,%6-u: w$ 9?'|@Mq?AM+RF*- igƑ};0ojFzf(%땕bTc[=}UmlZї2n(j4r cy9Pז0}JP&2(z\/cҧ%ZJ3!*ݸ2kq$Q\Qt좆;5J:9ʆ]> YeiՉ A/wгDg^-`CBʩUh=k(LBN51O o_l,+x)E(uh;O#IMP"9v;@b o%)Ŏgϻ uhγ`q0Wc Bu郴e$D3ƹ4>M@V)ʧQؐKUN} AϷfce}( ^o?޼zS5]@ĭH]\EJ9PT zlGZl0eX[_CU(\M5KwdUXlޗ+'ybb6Q}+NR e@)K[10+"ƙ {&`+^:11~~D(@^3G[r"1iDp) MC9PCD3T\Nc@/SJ#!'ʴkx:KD:)i抯 ct686²k+)ZuԋKbϥ=/?< "= \ZC۾f EJrλ/"E}6FfsÆ --_ΏYnOݰ$zbL`7?1b@:YfrT)gJ&Ƞ}+^ٱ>M33JaixX~>oCѳV Ԉ2rb[Iq&'?$eq a[`XneZ10l1Y m)VK=tj~="ҭ|kjTX+C5l-L>[6Hx4:95I@/\{_nm U6bG /X"J= _l_c eB.zѯyx,8ƿU;Dbv K3F+Tgti7LB?yHes¥7 ņd(T`\#ٟd$Jg0`jŽf)ݫ/ڋ O1tKDW>Q8@ǘ C5_)!({ht^9*_UNE>wJ5#Q7y`Nv^UT!RZ-+tp9i՝ךl\DR1x*g,JJ=ݱ\; ?D~{.qWBcvDOԄgj ̘Gjed|50\ n; 9/(,~mTCUAH|2h77A$4We9^eӦb:ɞr|TwUn uוd}y]DRxߝD'4LImg ZQp˱7n7@,`~*j # MՑN=7sE1jxv &WHlXд5lj9ƆPS]@B m%v=Ʃ˅"zX0T?0fh%vKAYSi6EF{u (hcQ40/vhL!I)8ӓ1/,sR\KzJf^4fز_G!.ħ5؝ỤX[Ȗ mˊ!by6cݢ>'.nw?*0dLq/ :vQa'Y=3%0ov=n >%ݧŠo#E^O\)u]ӹf^O dՙIF,r?Wyy_BWP}W֧L}H Dv>4>ifŽ9N.TϊBpMK4Qj),ERGS}VOUj,/kC^oxHё+*\ xdcn^n%HXJbƧq^梅O9 ʄOO6Tˌ~VsrN."D@|=F( m3ohӓq6GӓF/n :^QJI5ާ/O603zκݾ$A 4p.,}7[1+&nn8E^bs{g7'MTF K[`yC]r/9kV fRi+=K|1:H"|ο!:;RJy@Yf`La.K)#5Lw|?@p$󎤞hHcXN. xvșkvUt\<93ث{V c{.#^XkcR IK*θ2K01D/in. endstream endobj 789 0 obj << /Type /ObjStm /N 100 /First 919 /Length 7539 /Filter /FlateDecode >> stream x]YSI~W㮍5a6f}t[? $ӽ~<*(D m?bgf ?~VnsٜΜ3_.aMj_?mg$ifɛ/sम-/IF*qVLvfV1ܬJ]/ngX f6xYb"HHte$yZW$dJ"\ȉ270Q\ ԙOB"˜$AYG+/Dl"FQlPgS2BgEHY( 7YPrd%|\U_gfZ"(,(5%K! :яTR*lH{Iň7JMI %+m/tNVBNJtJP yd2A+!Oz)тҶ*Ң:y.QZٛTC0H* / -DDJY+%I E@Jb9 JMEj8@B\'*xdi x.#:o1"-dp91+yHJ`]8b*-B͂GPa~"Yh_!B*)i!!/@D*/AX^U#")"fNDnpssbffÛퟄV`ʦ?~Q]M/vlbrL^wXkK٬CMdyӊ ugÍ;Ih_ ovr|f1l~q6lJvQJ 2glx1d|C2?9m l _͏p~wokb"IR=zGj;Ejmf{'u9".mt~``%F qn +Kv3t|M `6?~8K:|SS=b|1J[ ՠ;(yBvp"'ᜇ5~|0[0eL[MO2 E d*X(XMÈiי+vZ9}>{uQ {BCTXb@OO)sZ@ LcjbgL11lk)CƤFP١j hqbJwUJ *j$34D$,%Pݫ.BH.菦sAst'ؙB$4,xpgu2=5e'e=$C_""M`@4wff DӁSFp=صzH"?cC tbHta)DIEU( *-&mXO)r)x %S=nF=Uh cMLsUӗpo|~iɤ4/J^qշl`:(fj `\d"UJL(NkV)s#4Z)0-!+Clֲ$$' ]&,B-w=uzlž~!Û8 {NMsRGBU5`'KuPtXQޮO%7A]Zx$xCwVkBSjvM.zvI 4PGiNbqSrhZ{55:M{G ȭ nF#2O:gNÕ}]V#kfv?([.-UU˰>ߓQx&99aX볇9ɟ5AqUT ]8 :NFl@aQo}/k-cN¶,'>t&_%U f.pMh Є,f*e%f!Mf|9[Eɹ=[c5J> j$BZ6²y))eMk8+uc*T2p< 〰m^5JK2$ana`b:KuƿŎ))ˆ`ʨ69Ek0ܚ-=]T1ރP0%q/B:@ 3J* X(.)h'A c4́ "45/Fz}(\lGC&ybQˈz[r<(mb*GbHS/` Z+i5*Vt1:}E}D(EX29Ģ A٠f6F@76.6L$c[ez;^pd(rA;QЗg\_*@QjͼgV"WttҀ)6%3 p-Vq#RI*3帽PDGe?k .G3ˣ(Hj+[t3=km #tI4I4XkJs{,P.e==4Eta]ogqtlH׎=ʤeƦh7 ga ʯ^WA[t`kY(!f|=TZ_k3_-f.R5]u-4Bӗ'EU`.GaJ9 KzO6\3^$)4Vޕ˴5]2f v$y!#h~O5ԧ]=騧KX7h~RjmZ L}RMӄ0'K5p$,jdu~] | |ţZ2@.0Kjx _M8)-Wc#x&WAӚsKm(tG.%;ոbEM-|'x4+I˔>uj%2I+Jo(XI\U 1ؗRs]j? uj9z|1vnJF φڐD9W7F1*zCGКY*ʘSIiPfׁoOi Mk4B#7`s:o Gu[}Kf1iz^>*Vcd7 ߶)QwC;g$o wPgxτJe4]x~yot⭡І\RCy̋6jFT[F'ƕlmZ'Td2 qW>[ƭDJ(xS:Lޡh9TW l4 wXjyX 8[o^ʏA-jZȗ{hZ˾T;wM|MȠ^omZ/"iJϻ[^%A'7NZ͙={oѺػ⎚(NY{\=gVZonO.K'=`v#!Q&Ri8 cȯ^hrٚBU ]A)U0km9*q̓䗧fg'emugu7ۯch=s>/nBӚ=7FДgȫqwڬYr}iĖ^)L}̸9?~w{xrpxYJon<)x< Z:CLoH&2l ׎(J;w?bƀaPEݓw?gW8޴F!O;GZ ѷvMװ~Ħ@6dV"3L v-d^x#AJָ dBnN0=6%;TλON~:>|9>;p ݶ\ý/p_91*>|B⤘~OZK=ٺ}gZ*p8=Z^GI^k7>yX q/Nj{`B'`Q/68nܹum>p+u{=/n^;dedk{? fԃ(멗oݺ[bV^0ذlQ6=BSUshV7I4>Oŗ׳;vYKm߹mP፩T~.*T0Pbk=`x8<~2<~1gqq)ĢQ=">$ԇi'1w=1G ^=4;T￟Ct_}HZ݅r?֌5}I{-@sh}As'?4㨅薌^wG%OʚWwQ\+b^Ÿ6Ua-|YoypOO!b-#+"?V{xImgrX}'$o _rB Ab"l/X޸z]s;4_Z&z3E):/<|C8vR^bDw76:^{`졉+u/N/f,b5t.1XeEpS[;Rw9,MG:WZ*O4JS"F\ /$%q˻{Vmv+} vٻNnkX%svsش꽶}Gʦ lr&`ӿPf\#kmw|YPYܶIGwiTa)m?Msnwdw^`3ݵ浵.Oeh#bwݗU[e =h1p Ou޿cAiwϋ|j?wŶ [-i îQėWS]0.s#ѵVYڅ ? endstream endobj 913 0 obj << /Length1 721 /Length2 11168 /Length3 0 /Length 11746 /Filter /FlateDecode >> stream xmweP]ݲ-7=www@wrsϹu^?ݣG=f׬Zvj Ff^7.Vn3#%#lig+t4AU=̂@ p4pP46 ;k;WK &UlYZbJ2Rj)Eu([[-M@N # _` rt+ &"cRmMmxA&6XX&c-ӿ|5p6uO =]6 3`g r|! 냈_ Y:IZL-Zmk?&2tw?o;?2)*JKw)KؙؚZښTz t4/OYhls;@_?DEܽX l,6v.;ku'g@ w _R_2h #uK]t> Sýs57$cM2``t,4\ܷrE%&JD29}e9PvgICKQIk4F읭>Fhm"$Xi{",'h "4~/L`2Sh dQN=wیD0ުgS6U OU,Tc`> 4(n)qZN)f)SU6#r1oqSY:ӹ5ѼiI 0PX}s>6sJ/[ BCq2Ob8Ť2hg/LUFn(e/brwyj'2:rG7*pvzgP d>cctoԄ*ߥyHC~6CLOQ?QhU|@NKɧߪsM#o (7Gúh 'E[rSRN?oj^;FPe-t}6m!FIem uBjwq==P3^!ΥPd=L_T@('r)k>8~FQ 3Ecٷ c& @GRUI&A$~N*[+#~اBCv2{oy3\Y}?|[ꏄ |ݸ<"4 M0IU֍-Ɛk6>r# k?NJץto#WݖUL4F sg&w^|Fk9dIٕ)f%贽h~!T z&>E--q[OW&1sA5!b0R+cH7m1h,i1PoA\5Fw7Kϻ}'&w5&NвΊLfc9P_!pȤ?*/״0o .j"Ǡ *%nH[͓رo[r)yhVt$v^=)1Ӄ{rЯ6tr} sDCF|wȤq_(1<-*t<8jH ;Wh4KLN`䓇u KYw/FH%|sCɟvZ ۏ%DFWnQp[9\Ys9NrҬt)@lʳynWX{pMBeK,)u)@|P[93VTm6 (W J"15瑫|DEdFn2ZT,EQ3܎_G0'^j3*Us', i) (݈8藰E!MOfJTyxw9m}O Bv>^oY}Z! &8ɥvF;:.%ɜBTqۻRUE+MEnatC [RS_ XVX X?lLl5F,j982.Tx&(+C v`nbX7-g-6m0:Gݼ[Uq*|1əTBC R; ,ݘrxcT> *!L.M鼨/B&Lǥ3xD~|ykԥ,nqec&,DZ}bf."QwF3L:yBL_n+{VN[P3MU_5{+i6S)u/v5AAٔ,?,/aB,%e&N[8fD!qrD^P2k&+S,Y$baϣ|V[(`@n˙l_.l1x:o$i<&T~!EdPf*PB2)$_$H}?w$ *X8<ܫVHJoy5N"4B#ޠqIVƧo󟘺MiK 8H;YEA!3=2Azu dӚiQߥ0 N7h{dY@h#sEΨ/=ڢ8vl&㾑&*6qzTwvо^d7M4u+ r;F3񱆃z'.oUߴ90Q,G} >5x!SPAt:A0_ӃBb "4C0_!D%Xaxnգ_Vzh U8~O݀/i>yq~rP[.j].޽O!]5$-6OAvt_J-Ҷ_]ȳ|a !hSKC4U>F]FCZMm:G_? "LfW Cs[Q snd~3wO~|c5_)g(>3$Mrg V-rTs^Qr-4D:hSnp,ߵD7o2j#ym_*)Ԯۯ o$L^iTI(\cӎ/ (XΣ6|,tV"nNw]5aen[|PϮ#PZޗ Qx^!~f@RЁLaVJeU@GosnF dH V:))a&^ ?ޜbu(,t>bkqމ&mC++wh&|9PN3{kZN%vK3aR$gɅzC3 "n++2Ö%:IweM/#!; PkTfC$y%^>{DǾPCW*}(0ܬ'bsl̡VbZ^.qXXӅ?JG.+v&i(u+M:Gk>LdH~u&k̡ ?һq) { w)^(.FF "Qf 9xn¿a A2fN-8P[9^N ^m}ID#i mCk`UE44~Tx-PeM&i>c+8IQv=ܕJѭ($IE֏>؛c>5;HȔˇ>e"q}qszвFZㆸچrkT y[ IPKߝ㱯.)z=(7 -R*D27麑;̏f0J8b[}1㠲[ 7>CĮXT7x%!nFҝfsq'JHFw_m-.œyKDq7 I]BggR=?=93,b"3??p 2}E]:h{Q03prbto2,5n!9pYytu5<1Ni.꼔 @aWg 񛻧EPD ZG'^b-ޖH|+e%vp`|Z~zg_H.t|2{:y&_!s֛JT㼖x0 jw΢BĩQaаJ}RZ55d= ࠣA7u87}d.HH]h9y \OE[\Y3Jmt7f#]ve..CuJ h#Ax4|՞s^>bJ2yBtLtr9rwzrѵ㔢2Ģz]9TS8k' t#/ͤܝe?ڀYw) MjΊ:V Z nWj38 AoJpgz7ݶD(r:Bvl0_zDw~bYpoʴ(TX>368L< t)5[r3ڶ=q &X?*ی .FME %H\*1&U6c bV+sӆ4{ܑWiyuȶG{j攕's4?tI*EL 8ٗgdh/Z7377peKq eyovRY㬊6 TpsT"EJd;`Z޻:&iOtQƗt [hnb[plkGp}VϺ:ؾ*a&)~{7t97dFME&Q{6LV_vVP_ű\X/ l}{`U֢5MSE瘗)<6v-?K˂%czZn\Mp{Gp_/Bn.ohv9Z D6wh(oB{~Hآ\QcP!7Gt[:y֬K.W@mT RTtxyL>[ih#y+;ۧ郣(]CBՍIqY7^0=n,by8RB=D~=0st,p')1Bvl7ybD;U҉!k9}aW[ זָAghF"ͧt%Fo$xw<O ~ڶNjLcGɵ^XpH%!nuZ5;<=tK $u}r,npDqS{ȊչzkTi+>*5MI?%#&6sZڇpt+Jto\ z=6 t._uL5aNQAxS!RښNl_n+7ll\؃]ĔS\(:!20㾓\f|Ճ>s R?o^8~`jzCzKthh_JQMX'.6/NKnHBR2AOb3檲bԬBheb$0ñA:x)gt`d~G5_r|E݄Ne[aDۃ̸`~w 3[#Fܽcׅ*58|hIdp@mo箈OZl+;rR{&!R\ ?KNÜBf؉sDtE̙5>a+K#@PL}ccK˥*(/呚H+|+͌B5WQ?1u\ӿ S1cƇ)g# ualVyE MO:zvө/X T)DgK W/ 98HᯱZ Z+xxE4(zKMU~@>IಇQ':h|%ǫ:>5ZTT퇄V\>﯀AX(vNU:Kt5zy{2#I,a|S<2cۄ\ےtn%'2Kޅ['Vp<PRL^d5Ozv 6!܇V4D5Bb}0&HfaC~b1/vͺ&HN]jïwL=&T4M#R}5Wr]dȻ.ZF>epe Wpan$% >.nUgA]l٦t2ܬ0- Ʋ޾{/@1M9MGEuvZPPʼn>"8htC I'%gqA th3j{;tӴxaj'n j EQQߑmk ;ζΩa»?QʪEaT̸ +jI[JX\=xXJ a~yBydi9 OE뮆춗rýТ4"*E7q=%__qo:bL6:_w*|c#bO/0s(~w|%"e_+a9\*:#@bRU~a KnY}t΄Xz ּjgH\-UN1$hD\zCXYD@:f^yb!@b` }vƆ^g^X;W@ئ]_+pYR ǰ_E5Wg!T?dԇ2J)_7P ky?,(m["a3GHV)#K 2wc}3zާ`'ε%`컏mxy ӟbK鑃XjedĄ*?79 :S8V؛g@o3ْ샛e]6LakLv|0%85$Y;ay҉ɵع`,aZȹ_@*i/.?B%X;Yv)}DGI1?wb\,/R"RC~ay9w}۠ =[}>"S+vS x0ZIv/$<)!qKCv<'/0yٱ$UH:3`7Ʒ,N:t^j}T-rdɄzS-{ʐ.fDnnꊺ%zJ#cD#j%zAC)xx-|)Vo <TQrs)O _$9%^^Q|v5 !%h5K=gϐ?F9jZ,"2Q@^c$BȻwѫZ|ĢiiG9z$#!&GP>O(Ev.)$X!wlbUw>NN% Y%HȪ99Xzd/$* OrڙE .NLKcPB|`ry=J-~t4м6r$.{8]oVf0v(/ޭP8=H[ }Z7{ w_fd=S<| tTqEf/mdyې#47 P>#<1^| b":4uӏ6, ؜!4` A'{COc\2+V_\Dt,(œU\` VQ6JCz`-j' gLv.~].*mh$ ό`=_ų-5ё@S\:!ɕՕ{Pe/ }CTܺ+뜹9Ҿɥ[fW/\`J\APVQnxwwX646(zuv@G?K ->. mۺ2E{fՎm w KsRkZT ::^Z(gZ] "G}s)MԐazCYE4שdNx>vb|  ƹs %Izjx܄ErbmS2 ?x+oebuGzleo\sjXP2Z6dPק;(ooc%ff .7?+ 'M 0_ |NR+}3+D ܈/XmD}ʮ=mLma\J~k8"m^XNeU.IVw% η((?=7=Z#<,{+cNQ:2k'YjTr |cxY'L<uUT 1JrHRSrjma@AZH.E>剔)wo; TFܷ4SsPޛhoYUcbHM#c1)V_rMg"h,Lo'hS~Pe/huduy_rYa^@]k?ƨn=}[FA u!jZrZZqeXjҘ8s, 0\WOǯsq"zg$>w=5͍Fi*<6(zuZ0"]NJvamI 7$t2 _e`iWmE,' ^d'*8nЕ)is"+u2ZGt)iƛI;TCl~h w ؔLO 6o4Mf.uPnC}0S|&%Mt~:ÖC8fż<eb1lH@X/;_Rqȇ0W%SubZBD44B#M1NOV >M% NoՖ3 Eh=xG_E^UKY([%+i]=֪UQ+{:K3dg`h Lߢ-O/Hy:;~+ )G׈ɘҋT0Vcȥ'7.E.J ܧ/bE# endstream endobj 916 0 obj << /Length1 726 /Length2 31057 /Length3 0 /Length 31651 /Filter /FlateDecode >> stream xlwcpͶmbyc;Ym۶mΊm۶mY٧nխ31{ѳ釔PYބ$,`c&%r41p6p6LL&FhR3ˆA#@BK$%  $'!!+Uؚ8X] -F&N&S;Gſ89?Ll2"r!ze!1@ZNM-U -Z:Ǣfd[9 M,l.?hH 061bm-k`cwq6q8$ `6_E.`kt,t ,[8Z[8#?B;fӑ11p"&ϹZ{})߻K KQ 535(9NX ܿ}e -Z tjt%(hE efb008|F.&VRw7Aq[UW^a^B27;ƾWsś 0ٻڕo&23=& Y~-&0~W׽SŲ1s(O5ŒsQ#Pʃ$_ q'~mVR9C䀺q<Ɛu$,/hKϼ<(LNcR؅Č>f&*)s4Xt`Mr_yh ~ Nm lljb!va‚ҍڷp_~W!+}g g(ap eho:}|F~jE7i5а^ *,?Pd0D-lGK=P hĐЛx&Q?G"w,ck,W=fAxA="*Z`S6䋹=W IDL՞=Ykr >*ZYONKsRGּ(PpT-g604o׳N1VI}=kekRsG@&1CX(97S0F*xkhR u ,~gS% ++m83&FU܋}ۙXǭeG"5'(I#PM]0tC 3ድ^PoFb<^E2HsbMt;['N'E a%1O<2w)%W?8n(Œ̪oR3qD*J/8 _v۳dhkӧ٧T* >$omb~&rH؁a}'?)HmrAG#N*+6q4fϥ nU!}/j`E8e\Xjy;Bˋ%˰E V?T;c'Jzu)3:%#e@m=>>|*|K "/y^,P+?jTk, (}@RVKm>0WoZ.&T ={<{i#SHpI%fro*0j/'3ѕxDD(%\cJw-rͩEBo푐? :` ݼGk(B脈Zlg9uq+T#70ƣq7ʺ+'6~H/!솀R!NB< iM l 3Z@ȍb_W YUwĸNj]C0Qjقwu1Ĉ9TͰo$!=xt 7N9)r;H;JQJb\긁qȕzԘf fʴN":1c"7(_ sOo w:Fsf8^#%4Zu*-$c_ϝUq" Wm&BK!43qy =ƖQ?(Caľ&y& rFy6P U"f{e~,B(Z#iiՄ'w| 8my@G(ǗK`~H`[ %tc0mS`=,gǾQ3l7-kČ*[^9ZŌYcf@(:M'+a\x9kt^iQҎiW0Efe S˓qz @7K.<@[Lk!Pn wCR[*$otWغ2(HHҩ8>iNhocjS?3L3~-Κs&؊h4qϛP9Gϧ'^- ]gVps͋jef/ vHXyWQj{kۍ.pK9KsKSM hL}v_fl-_sZ٢Ua[y(a3b$;w-o['`Ge@PbqYK惰Vں:( <j4{cƿm| .߬'HjDvHee!yѮ62Z=pB8pIr/Y;OVgo~ BQYs{Mw1L@9Uᔾ7? #[S0 uW'slS{3ma?߫pzR8J9VS1 ulk!aZU2 &igŝ}9%/C#"BRp*qiVVf?Q?U')=n%|2L$#mONL;σf@X|4y8V 'G>5' %֋~@#)_kךX+J:Ǒs*PD[o#oDɡi{*0N2`oU[?|?.e#+ 皹k/y ؆gf> ?r૗zXoYg,_0z+%׊G|x=LK dOO'1ja`B7zL`_\`l*tANXt:N2!8 s܍~X!0Xz~ h\O嘚D:?9-wU&[ l ]?}Ɛ2;McmJ!e imQ1XT7܏_t6Gr4IKˊxl  *Czz<ͮU+P٬anjho't`-ק HqU̧\?NG,U;hKPd|J'sS_Տ$7%\U!e14E:lD%mKB@-=."F*;u(- 3wQaZfxػˡRqx YY+BkrACQk,uV` \H2Kgۺ-ɳhcƤ̈fGQ#xT| /qe>( Ɨ͞:vAhr\g&JAZM Ԭoه-"M,v4~ߓ[OV{m;?>?8}xS) +MXw (&lm1xWI ꐐҎӔ\}BS:9=uiDi`x`BŜ QsXc: -pԁS/:{`E"w܁m zɔA7XW4[L,+YP%kgS>׃7͕pY&RX X_cXԸ'7Eu5fd%q92C$uuÐHHzhvRIЫa/xDO&r,?"ۦ"-x,(K)ѴJCؖ;|^RR'_HPrjM'Xn7lIbGΐfQOS>G.li?o? I ,Tz _ɸ_c׶|Y<,RݦEbG$1, +zڽVI K;1g3 U Rkd87ޗ9))&k6ֱC\kdsVqMArHQBT|$F 9L_U nSmS.?ZVl|Bz|#7G0$"O=]5`ymՊͷH=yI=dImm@cTz@n1'i_ ?t-ߚ$~NF}9\c?gAD9# >TtA}3!9ދYHZie73;Yi^Joʈl3kLþᚥjzn;PmW8Ӓ mdb*ɘk1"z !o*Gg!= [\ yfرmcQ+ _@ Wc&9ps對ǪKו̓]Hz( 2創XfQ]5B,5 Mꇯ|E 6Փd}R(f)0*Z@?),nPnb H] B֨@ZS8Fase0"X^8XAͩXGJ>{V[Z୤lƌ/VޖK|kfny`G<)*l+_WQ@hwm+dTH5xS05(2~!tMC7rJu֗Aɀ(8E &,)DU"5`󵟸&2[GT,w^wszS\թ#n9JH`z>Bi%UXPZMSn#Ag빘x>:vZ!e 4$n2MXn&g&#Ӛ: Z&[߇0źcŬ302[SI>xP+p1&t$:t`Mlw59M_r@`a^ͤ?޿z8@P0K=4pi۠ C{"q|jj`HMO]\…>KK.#ˈb%,1#cKsvǞ%*Og&tc) 4:X@#Eă(b*'~DU3 es: VlB 6"cClnx!X>*`yƖb{<nG}1NJA-J2:,e1WV> )@>!MFOPm7hQ}Y9s|U"x[I**bH.bbԔI=SB @lNBL.3/!] n%S.j$-`4?76@!)=SiY^2 @Pf1 0#:$TPXn'MQVB} _P7vQOwsf"@@T!si"~~@mNTZ(#T572KE9|7XTr-6?~^97r( Z*,ĔM@5FJ`H1ڳ.R!IM/b`CC@XSnY#iF`zr]`A_2/ uobk|:+PlVnY el#hV^@s )3WGxMOEj-L EDYo)QX 4i(\[ G|b2S9v姩]^0~LϚ6bJa QXѽ^X EwѮfy_!6j,PHbj-\)^ZdB p ~T1kDM06Z#d/IqfC \ )wB3r=4>E(&3߼UdKmyttm&>}(iD]]- 6@":E"OFmN3/!)m]l8] ZJ quQO@&1l}%e(tw"ac_GE>[m'b@c>Au «Fs%w{ذ T!@|.}V)j /hw_<燀yEpEK|OUTlDHWe\c^/d;Op3_Gq(a\w12O(Uv#VݭG!X+%((DiSpH=1Zb6J@%C :\G2A[/joyy$4լ?&5H@S|a:)UrAIe4KDP8mS~g[JPk5惌D1J+|qNK^0cI)bc{Tn*waWi]tmx k*0M>В U!~0VΦ9a_,m 5slxEgAq`פ}P)an9wŌMfba>t%6냉P ܥ|^GEYnk_1?)C.}Gv\st, ʘPV8,nV`LLl hÌaZ 2ۡE"bGXpI;V1`@vqL2w,XZhfɛ;S:kS+7M{ ]0lP6Ðf~aT=Q9ғ9{*"Q. >KR  ʛnwb JaD'B{zii[N բevx|LTW?eVWJֱ{K%{Ӷl#f[ 2v֊ ΣnvvYܫݔ3꿥d12"|Rj^91BYia 7\_*#12 BJ0I%ĭWHz 5-P,3VÑGhؙeꄑaZM̾2-`X۾ ry";u 2' l+} ͖f9fa^w(v.o𡖮v?zÕ}?^a-ə&[5^c _~7 ZOeEN+vAjo c>mϔv(d>FJ l]+[L DOa RyC+ L2l*vY8&]lU͚UT'.@&hQTmGX13p0bzu ǘP_M$F"O=C|ƼO{2]8j#=#WI-\\n nXԷ|MǛE*ܛ0ۨ6'eaIsjzwL[ CɈ]l&uAm]Oz |XuCt BkD耖"h*pЕ8 nii䭡Ua"zP^ҋ|>ߩeD\ie {@;ɛ>і̲/N xG˹kiP"T ᆲ4ti4fczeH2hΫ=m|VdXvYX{P= h1fFdAU$`>;jN]Hö=.y&IbnFkG)c}LE?}QKxlW& ^zMMEi#1~:a>2!H<`j#Hն 7% ˄NByiHl~@ (~v@kLg40c^t(f&W)3onXj%( 6L"xO0MTƻzуoIJ{9na)ĸn!IL`8OeE) oU >h`ragU=n ё2EىL\2GsF$0y.d Mxx#J z&u 4 4>/Pv8#($%P'VIT8q#^s> j15U4 ~epβfHM;ZzO|b, YM#ن ͎}+¦PM,!%]?$ k,L;j떡LRYk^H~e$OG}#XB,_{B>QU(ǩ|h˱<өK_E}ce:vF‡mق_ݢtZ_o\|!M&YFKӔM#8Tp3UJ'5]){ |&N)=؁J|zdCUEqҕ4QG#6fVC5Ҙ~ xW)dHs[rx4"`p3 +H^QoT޼CoG[KhU>/TAiVѸg%5&)\G|cώ6.+, cMb$v"%Ξ{ާ[Qh ?w%Iޫ\&tBlw#m>* x ; 4] hѧNqr v6 ݂jVFUYP-rܘ:* 7m̷px!iDƍboǽƨ HE=ŋrT:;$:#C>P8aY~G{i#NB9QUD %V֩e4č@g (":g+8Fs=,~9& $+w-KZZ h돪L'w d'{G0o_@x=k?z{;{k9ΠؐHM `LJ.T$QJfrfwU}/2_JL8tVBDHNVY0&v>d!㝉 9ݬ#亊lԿΔ*x[e e g Kˉet`+t]`೓!I|LSGa">RY|`6,h͔9TYKu.6Tink֦/a8z` #dͦ%ʾjL82J^ۑ|=5[xP/fg.][ghtg`{ 0̇ƒ$[/,hM8b, kE^L]$T,豇7o 7<0~ yl9 ;(86.odʐY"PЮW-6$O=މ?h *nN/3L<rGxjuQE_a.5. ouzw&&k>Ixm, ~mRs(ڤ>ugF4rXe]V3y2 gsfڡ;o=唍jF̷. f]w'H7d5|) v4 8懚?ZTVݞNà tA VK ]\sud 1ީ)O v#~08~ L"=uT$L)2+cmit;Aav~a㋌7΂'V2^ټ"h&c. # nNdKs"ChvBY k+NtwZ#@6NPǜbk6^4Ѓ,ISLmm<?PF{ｏ2P1].Ntǩqn.˙Wq]?aw ֮׭D>}ʅ NAF& M>W *mξwi3nHMWcʝo̺bnX!;dڂ\]xGM_hGy ʗ(ۺ}&Li-fF]vf2VsQ g 1AvQJj}`O7F99[LƳUKBŜJC5cbڑz#H~[Q](//W|ghAW:`9K 3̟*6JHMjJO PqxL0^k / 2\z5)S%Ej-X3TJJm9N+(`O K70̠]`{JU'r*c2gF~L??3ܮnַ,x g uCQpO*( 鏄6x`j~F#+L5xOD?;}W'HwInw].:Ʊu˰ pc焛hTrs*Q**qh^L-ASQ8 V'I :r֛pd4ţz |j ot"&=Xej@Ot[ECP?PGoۡZ:(ѭGX.T1<B6Hnz5ȿCmu[ܔ se%{xeZ샆_v2ϼ1&n~$L7#>ziN!n)UD9 oBm1b""WC[*⹲S0D9c @4<>/C'd1͑cW^G"$knI^2CuMHD<| =٩#K1D.5imIcCa7 Д8P0qH2`{ɮJmJFX3iتRb<" ~ޫmAjV^Fop۫ys5i.P"(N!wb6R4F0%mO7jtLk}KL<2l~- "W ca&=Vn "J#yY_ otqb8F ߠI햪>3eH| Hs!G~Y;k;7#`c#`$yԵcw @NS8K#oHWh1D:JJt tğD_}Flk-I^ǪP8ęfX{hQEܜ-͜Ca#u3"Ω>)^ZzԈ8б/:7a1V{wEՙXi㍏%OFXI+~c$H3n,O RMNzB?mZ'oݸxܲUݜ4cbB妁12@)Ov:)lT]ykN^DvUԒʀZ~6_daFBSowڅu/c37_%2G1!b%ul?jKF=-\g-wK2 ,5'FmNgW3o~ˋ @JB˰5om}-i;vi" X1qit^'I%]<]{- Hlj0:*ٗC} ֊8,(Q :K^B?)޽?I|Y]4H`,fJ29$e]b5,@o!X9P5>i}E1`~X_4N3ğ.Q݀asP*&X@f'wU2NJ~c@ߓY/Owv3TMVlؑZ%H0̫5cL(킅e+2QXb 5M>ym!۹S/zzT)ꓽ7}?a26CZ^ .nX:JF8 )D_s -m_pLE4qYm>8.h&KI],OX>]^LY;+6vhP_JWiDckݲ}KֶCtGjL9X__ˬlQT: $Bom 7s=[i9[VGť_/.k<%$S \Cis.xNYv q.\dɣK ڍzꗢ1LwS65rqT"uoH#5!I>Ry*OlP\, /0uK~άZY"粫F2Jkbᖀ7D۟UC : -hTs1IqʤİZ7-=GRqv#-k!_Okc{ ) Fȧ(j7{%_J!+*u@ uiG'b͆Q,u-*ʢ@(@_&nCLvU{ꞏgm^UyIUj9,Q6}/r+!ӱ!N;O6Cg?%]Q= ^@5-h~.*9fbؐB԰ga0W>m=7?FY3Ƅ]}*1Z 0[}MhQا?λ>HC2S@@B Ն]dȮq#ۣz!:5A^mJSR<~^-hЯT?^Wv.c]P Mkd7}Ju`m'&* RK1 oؔ{iZ=ol8ٹjOmJZ歐-AgVIε<*1Ym9h ӺO",h}ǍW`΋Wx3!?ipw"d!7L= Gpjg [H+3;ΐ]3WKE)V׋\=)R?F<+|W(¨5f!rsۥ䂅:;W|(sV=_wG= @/D  f7ÇlQ2 s^<T]hdKLwkUό+eKׁ)"]|,T('Q v,9yt|WbYb'{WWSp*TC&j?Ɵ*ԧ|TEurC=I{׎w1?~@?20 lRZk+G bإہ~yH#GA *r)$ '-@v`\ⴎ`-Mb?gunprB}<@'=SW)6Q# >%;CųC;HZH ߅}:!zYqtG23ei9z]̢/[r0*%7ՈOV\97'`>)"}-HsnS}q ouV*?=)Wmٹj.*m@Aajo34Mvߣ= 1MZjh6Cx7,, QmT;c~ځcXz=fg%=q_ސ@+uO:N 9h 5UWӵ5@x2eh_n͵L0#5\XQ)j<;Ҭ>LD>m|c]|e B7-;Ze2"qF9GZ߿ѱǮL>ۣ+dg(}tK *Uc~_bͩA Ŀap#bDu/(G09X𤅸1D 8[G(xM =4X^\ocRB3/bfJjuHG^HZ^IԿ ~eoH/mo!J[[VRUx@Fj3pMppqY{h"e'Ǹ) *sOnЀ38#(dTcf|]:;P8 1\?iGp @!XyHʕB>ʛ]|U <yGXEh|9 ϛ|v-B p5PZ1+pgT=@ia19@\Zu 5(vI ݟcuKɦ>S+Pյn =2ae'7%bǤIǿt8h''ee@V U.YK+m` c& ŌwgWD(#7i}ڀGAdgnv*]J3WG<"W]$[fB(75[@Ҽd ֒j}rTkgd jbq.ĺ+ A0J}&2V.i[kB-şvmk2PBsbaPQo+^Oa!+8=; zz@9uiKre  Z\#,n!G:/Lt훰n6SK6Iknn2J0E(er!4J=Q@e7Qh4VOfAw G2`)LM:za4(Ϭs7qnd;Se6q(Vij#WDܔM[?E3V#O~J:XWBPH4 lbP8h2`}t2델== v3\^senH9@%W׶{LyK3F bАy!k@V+σFj]x$.wigq 84ՎQ) "Кtljzt+67KpKA%0G3V:j?e dw82@VKxVΖV,#0= 7%urtpK8tl:-oq[Gӗ"?lXI9bH־A7m#ys2i(L(B0iFFE: 4f&RF"W}pnGB#ڿpz],8Rl/y,C9,NP/P8@SSi >6/V *2L͜4QRMOH7UZePV:CHTJ/)%͸!CeSwAЃbr $9P*VL}D8{?'eeiZӠ(mN[* a\.RHoIV.~ f3oFUOPGe;] -8VR-k-Fslt+CUvq*m#NՌCt.)Ϝ_AEߕ(Aۢ47J$q/JR!8I[mGcajS ^V#9=sC3#c+HJ+3.Y>q |Qߦ$CqD|Np\P !`*QoSU &w@["6RSge[:o^0;ڟ{']Tܭ V\=g?2NߔRbmiq`ey_mKQ9$ &6}I:w;Y5j VEث7po/"bMk4EptCBl&  +1̟GԺ6[훁LAŻ"1҃ `D]!A4,)4a i|%j{[&hD&$?g;EtG9.;e뮼HS\ۢWPh̝1'{>f>/*dڠf<SA2/6׮ B^Y ;Mr2NfU tOݼk ݚ&?3T1|"هZq,V=m@Wʝ499ecْ|9o AYآ`'<59I OIAf V}gR|f&Tu{@Tݏ7VܳuCEɮxc7(vh%qWzSrfȐ A`YX(9Ek8+0 h+4sL]&9g0?Y hp݆45ӁopN~͢8g;+T|0Fw*V^e"~ggdvWN $ގ&D3]NNRM}yc-!BGF DoCȁwH`oi%hrxES(zkPN#-ܪxa<T!kVo2y`VL~&0)x:T`7jP !q Gu LF=hJBn0hl|˥jpLy <: ȡO*ԝT ;[GQ׊APv#z$fC_ZDi䉕 d>*-VWRmj+BF!rVUrv)3m]Y/;T\})u/i}9p ony-.Bi`Qbj Cܦ!JrJh-{"-I|2k]ǖ"5lj[:# 2?,Lgj<{bJ F}+N9ZqhtbQ6r5>Vϛ~=Q-lj"pclauP}}QoFx"Ŀ \щviͶqbd46+xofOGk3`K:qsik.휖Øϭ^vm]d4S #bbszSl#0ʠGgis^+66z2 f- ah.- F TZNb02[?-q$rO)>ZgX]j3n* 貣) ,(mC: N6JfB֐pj"Ź WRqz,5V MѪj=;z1 G)gS#Z S=_uƉ i #T=*)J)"sq[YALEvnBj:Бd B6]:B [@[t R}e!$lxkL9:{iDaL:Q+)()=S0x?c!G)%G/Ct? ~ J OPдxQ8 -'mF=TARtl0H.熆L3a^klh}4 s7*4?v\;B-Ng>j`d_& 9Zv6[մ*izg` | uJդo06, X9ď#֙z^SPNS2bޅtzQS"YDl%K_C: q@"?v[d<1ګ89ҋ{I!Q_@FhxţQ+~nD*Đ;my;Hy6 o%ChӆԈ?%'!Q'PgFwn|{!aZqR(pN#2ׅ-Cb+DD}wnx;WXý݄#qvŖyBwX7qJQ99g8e[vG[5 ~d]cG֋d1n38|~ͳ_i.SɄh!aƫzV6-UM.P)hŪ/m\,14L'Rd_f<μԎL,_>Ԍb5W5s2= eY~<s'Q"CغW['.laJDȦpƈYpSV|}`u=VU!rBi5&O?Y5_6+]TJu (U\r%H[rTpP r\NcX>ƚ~dV;-leVSLs5Td[VK)0&Tf0nr=G<u3w(.@"\eƛrC IM&As0yf Rv5/* uա,UWpz/hԤĎEvG ek614:{䥚&r$KuyB˳V mLuQ7 E/錺jWD2R:31Ǭ:EgY%3Lgu9:&Tt s<Ќ\GuJ^B4V1ձWn˾2l9*䯝߽@1&$UN*jo8LOWdR*¨n0E La4IpuC]qYsdҚjYio]{"-˙x}|BbkU|*i6"gnLDObv<2p )kS= x7g䃲) E5F|c*AL#'sBrnJpA  29,z -YCa`6[(IKBhko.]K;Hr?h5MjU'w6jL/4MwHBVܴsd>-Iu&[`s%Ҫ4t`uWA; $BAeeKS$5Gش1؎9o' p WkF4Ɓۇ&5O7"3`CC1[m܆͚r.[jP9uMjY<%WZ} a$ r;Aw̉#YӃv0E;^zn zxĖv [yH.tlhG/&IuFbީŷcU *u?){a>Db(pfP;:sxuMQ,>KjM5B̓-/UC*p:ՊOXf\{7ڹEo=} 8򦀹| P4:akE^ NJ7Y(a^)ѐӌ7]Fԉj_ǩQ08Pl`jΠwƶ_@N} ;i(T@}EPrV^?w=xȡ416wEAQWctwJr}\;v1?F>bșHB@BMt\N4Yp v4p$57éc?HqaR@A H  :rL8a#qwyU;<\W'!yCEvP/E5Eul ;~Ύ3mԲkVʰM\w7G2*GBQ? ޤh1engbCt$}jOUP2zn#C(Maz?p079bL=ZH6FoޕȈ f,V+LzZ=?0|ݰ՞qH{ m}R6O1[qKi< sY'2$)O킒f4x ;<a[ZݸӹǔЯɼX%ǹ^p=, $E6<ȇۄpw(V:aDS4]δ#V %Rq%dZQO.d|i7_T(EچTˆ@O_paϟ=aj%JN[kt_{UN@XElŰEv9xgMwp# .zuS_Auvi -j@ و}|bU&kk B*NBLHoY;%5JO9xTp//!V/7}qSȊK#8E2'U"!4JJUR4FL!ɷ6o e HNF &GF` k+ͼo|3Qӱ?7Jcb[9˖2dÑ|8Fiю=&;ȡ_Z_f KU9XvTF䓹N{h@|/iwzcVYU`^Ƚ=/gw麦;>1(Hs*2AݪjM( 'YBzJd_^_@#qz=yWNFڵ|SpRΖqIj <?;ή3sMGe#F6nӴh(yom$kN2u?#d= ?%ƿcV Ci Qd~z}:I&}a4wk"@⭒Qa';[xBײ_{лd8AKjW͏-Cߊ ֌^8 @uHBԇ[ uqS{l1Hl;R{Z5 \hX &rlm9;M>Vz00d q^iZ-s`BPL5wo@9ъP!:k(ӹ F X?:0{oi}Fں,iwLϼ'@#ĠPIs -O읠`*]$n⢱?`NDFHV k4{t+/-fЗPG,{REͧr=):Ħ|kC.u! Igm 6 ښ E13na9xliATaZbQ9= m54Ĭ M*h̄vãx&~G& R0@:I!G\hy e1G n%Sj9D*Gw$e+ku܂WyvyMduϮEuf <䤲lWra͋u>R/1^(fx`PqO͋63S]= jwLʿ׎IӍi ;ĕx] UuE19H@!][=f :V{X$ht0f RarJ}1LNѯ1R~mHEIro-4 ,lp]ߘcSϊH23;F]fQ+`p3j8Nt0]c;EٟN2főw~%'f^9_/c! r?Y6X*Z 8$5N0}}B+kqq>.-; , `zLΕ1.~ÊVvڰc݄_TAx~ $?\▢AXwC61;Z j5B&%Msd0ێ ɽZ8׶OT1]s~]AcUp@>gZ9ɂqX:nJ*C elwWyb“fhfeTWR xp?d.J{ =0̍"d %Jԗ+y_>HY($&`gzz%] qU0[؆Nda 9ݸ5'kTw偦,F^Պ&xjߖBfk2f?,k썪D-l.)Ca{8qF*?3nn4XpK0}q$zG=OB)۫,]{Z. oMC N ,NO%|kґbmh`EYٻ'IO=2MpFT>%))!_N9=WdDhV\78!9eBI hof1.m00!-  BEK-tS=1R ۀM6F Jg՚a)Z3ݓ_koJOGFppdJZFiѳ;X2e4L)ty _@")a%wMzkB x ɉL0hkMz d`u%i@4?;uqFyiQ4Eu_:D'q~$I8(DŽ'.T}֊ԏF 9~"m\νi(U%&vA4xT\x5'hj Lئ@loQ1d`vV8\ 2$Cݠ{p5j`U*6kAQ`wj'ǎc4'JB2͑_5=:TK-w^<ԣΈNx\LDNMF8_ۛ j9gPfEfn~QNHm-dEU:S>nެh(?J0uny(KWnl~MIn2gNkV-;5݇d-LH?ZClб<pXcn?J]і$;Ct)5Kݹ(5QoRNHi5C^-ܦn{{[cx"?:X ra$8|+Qآ5%INyѶrXq %fN̗LuED_;dΎ,vc rzH~a0vU;)㊍;IaI;|3 bwU2$ظĞ Hх[9E>]X7B".%KYU22:p͋Aw0$-.|!n5ۥ><e%D'Y7R+7[?]h"2f.(4{bVc}7?_Xԙ ɢ9G}Ob,"єy嬷GlBTg'8qkp9[ Fvugc%'J64xZX)?u)cX7d@n;EV5L{3}\wt8'dTsNh'Wi>od3?8%qد؊UDeDn}?4ncaM>`C >pܬtЌ'2ьs'@ct4eit GӣCuьm*D#`%?g"ōyž_ԑ'ZGC}:,|pyʠ,~A'˘6вn+BF?@?QNI_~ 6c/m/!dcU3 =3gЬnSH+9 2o \z%6FPRJM`7Q y]n[+og5,KCcĶ(Bmo!?Cvɷഋm~cy8br:7k5&H0G 6w-OVӕ T*u:J/8:d@-MJlai?>Cun܁N6ڊiO1tC!d[Bq\9T}rljԺj§T Ü5xۅvVjlnfؠ<].S*n% 3'+}Ʈ,B076dR gY7w̋/ѭ86ynAΗIK 'PDO rU+ECA[nqV hj~d%92mUY.'15(-n8?N[,Cj`E{B? ޚ_Tݪ* endstream endobj 918 0 obj << /Length1 725 /Length2 35282 /Length3 0 /Length 35822 /Filter /FlateDecode >> stream xlstf-vc۶'tm۶tlwι7?Uƚ5WڛDEL PWUedb01QP8\,D\ )@` Gwt4p07P12tػYXxݜ]\)R.@  %%/!!l6&YK3`f03'gs:C '*$ aTٙd%)sq'h.ce?DvϵX"g7ү"DvU~2XSrQkYu6~gm)+eDiOa,N { Oz40RYWJ 'jrz=! :I:ZpN6G]).}*\҉<݀h~QWTcIAU,u;pPMYk%"tChE#uG@d%*b9+>#nStsffTLȧs#Y#qwDAR+CTCyu'cSەnTfMߎ X481'UlI畼iN6Г=5ֽI "p]3z5Z3펩`(᪜6⥋)í*e0rzWQœźx 83a&@p2v)|]LB1{N4lkᜇ\w!nϷmXs1/~^93ifQd!e$N/t;z Wlo2Goe^{iIJ>kwum{۠J/9-G?LX~I\q\-kFoB-]m߻G4!U 94S`X߸#w ͎(lP=$՜_bV P[x9Éq9ѣ2_VF"'~ǝ!,b_2%2%] JEk*R훾YF/buL`}s^:gH PxUq*Xsζ;"1[}% = &H|G^! I>CɇsЮ\lBnhp;y!c-'ZΠwwV_BKE3PCo*!?Xň;I WSjʷ˓CK^'ɆrI71c!tsBt>G5(l" >ZagK,ؔ^\/Cs aTNօ6[-&+q3~Le4ZB;ͲG/sbG՛}7ކ+^ZC]y-xJR ^ZCE&ڏDrcbg o#0sXkzz-38LgvxWBo6.}Р_e"t|$9bb^\ޛM͏2Ǿ'YGiNCݪj3ͫuHd^}u74z^'ĄpG$WdtC]T★I8]P`ę3EԻu϶Ui5Jľ-=%DdZWy 3ԖZw:lKrwM(9lf#ߖzja6m'kQM /)umV1-šZq'ʭVgG-obW$I 2ktg](o*g(S#ʍmVP{,}vWlcii3' HgXz %UvKњ=E6ucfm)]pkE.͵$'YsƗlumS:/P2 d*Dizd|)`#[s|Rg)ƼDj4g`#oŜ/Fgp11Q68%z^ʲYN+Y5W-qn*[(LddWt0 %B$xB̚V%xL?L+wR1т"3KȩeC7NWz7o}i+Y.پ5jjV Gqs/kՐH %L["ƪ(tgR樳eQG z>ص ɳhgٖ˹,FeƉNyȬ!.b!vmUQ]lfpSYN}I3O4ڑ5^lcW}`T + #X+G!ulc \e?2`$݂2y71f"fr^2^ OH-5U&D3ce %򧥂R)y ABBbO2S\Rn?yMRGaVء&|j[K) Y3G^?S\.X7|@p*˟*t]Q\'F@)'PXK8agcD M+v$mZM%qNCҶP׃b-)mNpDySnJ3r}!B`FDAuP;>+52[dz QEiSkes=J7)Sa2k^Q.kUq~K=!;!VEα X̕UZb Jfz`wp=]Mw ?7؜qz-JhVQ=c=wMl8۹\l2K [L*h7\GʳNs(Vl=H7\\a'LT{*ѰM;N.wYKh ) cSIoySz컄|Cߏdf`h^@,i' 4J%uv7n?>kUZ3~z*iq/ŬIF;~aϧ\4`LUŢtpK!WSR{Ȋxw<8ZpFYzx`MɰHPfAAo7Oln3~BJLmծqL;#D&r N-w1Y/_!qM.)Eؤ2 wJ;6J.:͘w)}[ jp"S){kݓqcJ+!dE|f?L;ގd.BR"Q8_V 1E/O"̺M ϵ䞠祃L[Sޘ (0ꭏ⦂ hz?J%~ "l1C\g{Sn@ fo|;g<]i1"JJʌxw^#ˆX=;չsyw3sN (_ BBSX|u7-9c 8n`+~՞P`fuMQK >O"XZ0Z 8I]D;1ԩ&\F'w&kw,GY\iKF| s;ྃ/qu|qaZy||xR~DOBɺZmŮ N)]^\dq&1`p#.e"ѓ+?ٿzcBhua՟DQD*rI"\eJZZ񇦈NeEB Ol*#ڋVTcgS'H(p()\xXpn[&>g[>6iL  ʟJTwJPevV" vZ9~f {o%@m*[WXFCzD }*f ®]h}G;3(\j۲M*Kby Q\g3)^)b8: ( 9wtg٠0K=AG`^#2@sz5x8t \/SZ1F8pwȲ"}><֗EX>(y^CX@:H.Fw;}Y6%nАS 9;&R)͗ݤ5UGlA6zKbͪGj. FEE25B.J c}-|p)^/L]XJmfRv1~[ WF팯8kA=;)y;H[#( G@hGpQa̰(t;:Eyj+?#vdI5d6Ĺ7Zs!"­NIhyuM@6@>Ζ̟js&\,Ӭj&੡ݮz7[뀸a!]`%y[b~=KB%y 4ߠG%!^rXCF9@VpPT2`:҇U@Z.:=2!M@@G:@|zlɍ1)n*p<Vo@nQ704{͓B#E%d3L *)wRDy@"JOa7^<" 'k}2oz#~x;H֔ 􆏂!ֈ6ʧᾈY@P|]`i]/q#^UqycC YdL0DTU7m"TB^hz:? ߈q@M/d]5Jс.Z*03 m4  Qzϐ-![] qzI\-v $Uyԏ3S%\<"6g(##׼%%>Ymn&>UGae=U|jӏ"@^l`0~\MՅK6hGЭS"_)ŏ5 k, }/xw `231]95`}-udȟ[_+տbCvuj>o nDPl3<08,gm(_P{EIY !e$oM8߸S)`@ޞ@4>>gZ>LiݐYYwc8dljm,;B&X){K'8(mHo6&AH /(^w] vEnj)rH.-KF Co[C85W(aI'Fv\T'1bd2bw"̏_d]Y[buyS?+8=}BUUև&Cm+~Y>%ZR"ܹ6ɹJ*] rXJe ,$@!`OVY ַ_Ҫr;xHKa>VHr7/?!#em#<+̢؊~uU pF1~3ts,;kTюXNC ~CE|+6H] Kv2_Kf7"o8zk@OY,]e9 NS1E,A*%G5|7%)A\?jתݎ^ hL,hNW G]ߠ(m!cl5a-z,~eucBE$_D΃$܄uiaKrU/hLPĄ>v>svM[i"च178hǂɕFUBD}y.  HO~Gb*OG|R؅Nn`p7ϋyW%?Ͷj*SXǠ+Sek@# 7Z'Nxf>ø]!VH^;RHszV}FZpè#ǣ+Q~]k6FO0Ft9&3Y<`oٖoVDw#'g9,q1bz:i:N< ;FUb^ZgmU۩4_%rr1Y/x).CFH\6:Э㇞AM@ikLEw& p,TjU{AT~QTQRR`Yhhx|#}KM?NswϡpI DNlpY#Dپ&£CͥŘ+ &Ʝwߊ-zE;AQy~c׭ᐸB9֛I`PHv{Dk^h!G6̷9BC:35ǖ}}[hz WIooR(G. H*S蹪5cTUx#z3m^Gy3Ox lunIU/^`=X#g6v0xYowLR" 5yu|#V?!sA^O  MVuR|֝$]ٝL-W_dqVuuhad!fC ьK 4^ryECNH0z)f[ 7ȗ6Q\ X[s:] G=э~o)$FEؙ[GR" :+{X`VϽPwGYpds(a} DPt5X #!Fþ:8=]2\1NupsL:tAxm!м DB%.E w9HV،Y#6Ck¢^ִJ9dy_/u~BWŤu 2̑ci=ǨSµ_b̭Hݼ EtZ7X{ f ?MvsudĻ{̃jW1ɆM2NW1trAFՐE^=fPD'%wZp@LeY%ϼ;DDyVb1W?bXZ ;^9ħ0N#Ra{t뉜;l:M @%Rtkh֍`FLYnY:N6p}а^5)SUw8ЋI&>c65).s7)CXe@vYp]usIW,)Q<vqRLO! X.;=] \3;GLziG(ZΕ(:l/JZENc0g6#,WaIl |e@YX/24L&GEc).)2gGVRkئ ʥ@l>j x/,8yUکנ4.ϴ̻l|TsoAU*v)_cYߋCІM)GJ7]->| e >.13@Rc-RߊcR2N%Z NΜ(E3Ν,Cۛ /laKZ<+bdZGJ,r׬#2CF}` 5KyYϘYy-^.C q*;T{o}1GB dRm4@ZTE+n. 52`j)¢ugxRi$LTMsͻϜrrWbr*2uC{42Jd^"|r4[xQ&cvBf x3ᖶGh" _q AhtmvOh7yZ(aG UiKF[u_ tMSO Բ^DZpocNp7~U+4DиvsoZM䐬~ A]*:* wVbw)"D\Aƒ5*:caCqr{Ƙ o$$N?g$#b: =c]DTrAt6<lP |rYVӢY?܈܋ <$ }A?Q%=._[.P.v8VLj/s"( Vgq߳Z$>kE@(Bl~\ 'yΒO}( ?NH58ˋ(T+ٰ͒}E$? /[N)i7_;#f}(?+eiY¢#'fXÙpé,[vL,+:@`X˶TTȌ\"@ K0HWn~]Otar3QW['4+“}jhf/1j?|MG~n`n+r"8yD8eprGB%ɃnoRLJRˠr q4f Ns=S\ ̺s噑W'GJuÌE Y(-;=D ʤ 61Kcx5G(w]]ҝm$Ig4$z`07mɂ7V}Ձ!=6ŭbt&h D .OgK? ReOR<%EGU{Y:z:X2$um 3D2g6mSi֫AZ6]R;`\uE/(\~ =YR YW8ྼS^؆4ܿoݪ{d,#pL0ZTG7-pxWNu18 ^%to9jc<z&nccU爚Uf_mlx;"`i|8qIX ?~B7c.[)xD^:jso f6PnB1}ј"D.+Gj-?.-~(FXZS ϓvb׎(ZKpj:hZDZ)9@;XNw>  1sqPUZqNц'i#SH,PA[[4b ?=3DlEw>AW/2i=,Z3u GΊVQǏT*␔H8cuS|% ́G+KKïs)q>` i1i#xW1jaL<%Y'>SX2z` $0t8nH-#H' '<iѭCw_SnZ]vlͨ+/(/鮊ZΆ9/B9a|r+'SMU!BҘQƤ!ӅQh9,b1qcP@{awԞK'h yf@#tgJyn.e%o  |#}GN %82}$d dv'N5х[ZOۉnN7{Hc-.dY9k27 13V':?1L&[IPgDfmK$Sad s-ERQ's KÔf~pp<-7(A?f;QSo>4C`t&Pnfn07R;"L|+y 7{́]"!Zџϊ@鷇SQ;Wc=@ nբlLXRo=\OP<>qR8W}1N]k "' t(L; ཱ|E:1k#aش2%{lL܌" @M%3]vyQxZӊ`I5mb,/dzf5򆤘 u@& l(J^j` f쾝wm7 -a IK76ZВ%T@-xy|yS @J_gg1EUQxx]rU|cKgstƶm۶m۶m6:6;mNG;sv:UT=*CY4 CVt.N]K&}`@ԎN;˝ٖuƳ+OɁ??Bva=]1)|#Fn9 q}1DR9T:]%V5\A]c%+9l  W=v|dM"_-V3hL(iAރcuHAGC7t ȻbCBnI<C|lhHPxI0'tGf˨̓Dt8/)z=w$wRe #E[ʻ4{ؚ'N6keQkso\zDb \bgcDXht/Xk'`(ASq#Ĕe7-p*dž셻1XUĺZj ]Fjsb9; d݁;jޗ2?ED+.m1?)6Bώj?QMhߚQ-$;Xo@a e Dvڌ>RG;X}! 6(Vs{F2)p\+ U`VfNvC~[i[a+x yk~Nw$Tψ13%?17?-[%ÄI@ & Z͹pi4`DjG@e^_` (^̟Όwd3m\hCRM$x`1ƞSl aB <é긢ͩW i xY\{ Q-\{{m΂)q_3ތM^cm$Ŭx{9i $S럳6c_GAu t{Ck2X+#B2$q;j'z=fOT&;}d@7VWU:#3I]͟cΉ+VL|w9-׈ƽAA.ɒ Z$t~_sf?}Gض<|v< R[:F Q"%"Gˮ4ag?$9 *FGysj 5eY(1aا(zǭj ?hGPyP]7OWkx :ôrBNQ3<7HʋMJ6"cTzd^3"y>:S* bN#{G@.T)ֆܘLUwvX4fW-fO\R%2Uj<#ASLR pf[k$~붩>ʼn8H\U60al\0dl #q=b]kܲ@uN{sus%ŔS)@j`),q~7@W,<.0Q7.DbkVᴅzN N %6 O7Dk`43z`WK$0=6:0cpu>P<#~:L<3%Hרe64{P='L,v5b< x%?*+4"hȩI`&Vab1N~i{||e?\?YpFHP U?/*ʀ?j1}2p'[i: }D+`@X23@ߥ0WoSU p:H>KtܰsFg7F1@H1)PHooc=}"<ܣ -Ij?T Q|"ڟ(AVCrNv/y5ĞmKƑxdQA\o}$,MȍfhE\]m ?)[ (r@WAր#$F-I u ק.,9 zoYnE;=D Q%7ύͿ0`ce5]3#!#FƱAmh4KM畑~0KaK!^0;8%O_^52bШݙ%*?.q݃ &πo*E|UsV|BB&m#=h"Q#;`N΂FߊSP}Ë65&n  7IUNjJ{1BL] 3Z[UBZt{~]204rt턱2FFUُT@pQ5FT /$ke]X0%zH͒H=?g짔weaPA+"F&m*hCf7UH`Zu}{\(y`>{|OwOV' K.= 8 5c mƠF_<DZV&? vJ=o5 9N)7mlYʇge}>H ?SƉT?_Q 8(z%_j۠hB~RQfkdJ$ ^JLarp˽_5S& IjsI$w6LR|_ce >di`y ']$\N >t0+ ~J#oOZ-Yd,7 O = R`PүH܄ DA9u(>qb"K2K\hHRǀb9o?Tv">)K2`'G,_7KL'W7ˀY%8<7w.[ȭuZm dgjQZ2k0%bo& >훷hT-4ўBל|V s*##+ݠy_Q :I400py#pzE͹IzuV%2@K$-fFy Tt] r3}&غPcqoFdUla.@Wefο'j5}KƆ>u@x =9_mᆄV O'r…ZFW>Hqn|ihKۿl3ZrcBƞ搰:d$[Ӓ*%Ǜr$7RL|Gk,Ux(c=Cq#"NnD䗻4qNÈQ1npЅ ~mWĩ TUw4dN5J$b^De5lfU[P,c^`9c滑q)#Ŋj!Iˆ) mCkf~>5Щ6 7$€*L@O+  ;%"4F4*Ar }sW4lXܦ"^pá9؞r=('[C|O ݮakRVs\%@3̖EJo}FFqϪ`?'7Ze@G?[bOg9?Yo甞N.^I 9xFa/7crPu/n+!(Ʋɯ? 9Koi"x:e}8{ۊXB ͍K*>`0;FX*ndCJ͓V93(lR(ժP+df9i[](-b.qo(V9LgI1MIc|AAD# # !C)U 7T•MQIIo*X\ '+:,"y/)N ԚQMnFښUvaHH#g6IΛ7 )ʮDE̎NJPJkzNrztčT?@ N͓ڨE"?slɃ/֢QvCj@-* T@tHMt֮wH~%*r )3q,}!~[}" W /ttL߮p3E`b][ sz#MY(I-TЦdt CO+|.9`Ϻ\<9wLP*^=̳slk{iӥ[#CWYj(]F.GܰiF3" (Bʡ|:IP9m}~F^gc KcqM2a̳Nsdd׬X| b{#jYeI!`[~S$&VQ 勱*sn8ɶ37HֈIPDġ|-Ұ"Ah=#&~u} ɺlt`\2?Bf_d&cS)γY1q/ ?ݹB*>[oEFcT\A@"B!u-J`7~FCqbyS}l0<žS**e>Ӂ(]/uVUۀJ1G3;'B )[oҽ*Op:"j iP̕f]:k/Uܴt B$C`'1^31W?>J_lpz>ZyY`:ȩ Tzjey,PIE?Lo##ݱ'b)}ۀ C郷1wڥkG 3-{f[A.1-& pg`$*Сج7_N{{W*8=e^7-9KdM&JDLl]/BQwgeOaGᤚ5DS˳§P\B_z!ܻô#E F5 @)`|7[lHk9. L){qLJ|ve} 8+6@#iXn es+snϠ\moFLwi rlsXwn5V|$;q z(yx}$'$f~0vX v2ɨjHmq7~J"@LLKV%z\%p]&2о#nD,q+ [CM<\Wu ^* '1޲7Ƭ/;F36:r:%_`UWS]4pt;&UXzڿ^I7.ˊs]VTT v@R?ȵEöP=+3b&ނY_> 5_ v4Cp`"$4@Z1E`7W`̍PhtTZʫe0Gwտ'up .Ftb?8:Ckr(GGu z&ғp62 k嬍_T3N/w+ompRxpXY?,gu j'!"g`zw4P% BGg4{⬮wO=<e > S`Z ԲX+ƝUaEKI)k‹r?xiB+( +de GW=vȪ*L9ZTmD" ^` U=rE2|`%&4"[4 Ly' Ά^O2-APcՋ; \T%712%Y>!tK [njiH@3{d=iu#KFedmUtN",W$cH/:7_ meJ c,AۤHJ3-'Ω*iϑyy3+=}b'YD 93F!;U "rӌ)J(KYOLRGCEg 1Nx! (zhL\ldQV{eNuRrbOð NԗKk9qzf/ .é~(ebUY?g ؈E{b($Uȹk/oMgSl%+\@P7 ܥF Rs!qXF:|8,{26 Xm/lAR"Oz{SRP~ G}!Ռ푉bDuVN$?G=S5~TԲs, VD<*~}d锑 eŻ o=X U@0hd^~3}Ze^ǭ *f׶H,0/:x|C@\@]/#6,ˠ<'$&VO"W|-]{JSM"Ir_dK]Kb9R6!Ə?Y=) 5'Ϡ ۨ,xR+)K} \gn58kڋ-[FPM]]i! &BsSo)!^{Ca ~vu$q&k"aW_՚@d%SI[2}~.M#Ŏ!ƃ.c-HdEU7 ߁yC\+YD/anew),搘djVMWdw H":PXW4n8l &Vs31xVHy>,z@Vk+&*PpfKݏVNl4+F#73A0Ҫj߭}X;%"̍OKKZvMa Tro _=Moy7z@Mo01 gmEl o y9y?z+}q՗ݼ9XXvo@_PZ64L'mvJ6ҩC8D$g{PNJ$garr/~ Tb]6\JEGwiqK!ƂɦF~J10$z]-A?"YSM%JzN7' d5Wc"}rZ-X݆@N!vA9ac]J8x7HӣU`VZvL]HlLYpev[~Q,+W,'4P#nJϖjΑLۋncOq1bQ{fdC w7|WiF 1Y\>yp=,ضGݎXHz& &>G*!=]M"V\m^k] .}8bes{ ?@7$$ਲ਼`kzlTºZi.X1ρX>;&͚M|Ӳ*񳅾jK$U)l&~RYT%$4T&H Ms,8]IhHۆD*+ jFJ mY輳}T7QUH#dZ]n MF_|PEo AdSEF^*XIwΡӕm&.YrS=X谓9|]po 觌. CR$& Lk[ǠS3KWMuhCpЃ`CeDhpo{ј)'E'[w{Ӕ8Lp ώ=謥kayx-@ di 2W3 *<S23 Ə"N9\x~o (^_ꆄB Zq[;6 @ irQvs]MX" } Q#tv-)7ػ1 QEL?دyڷg# "qsF/K[1DAm5_D@ҝri"K_:$q "! ]snNX&[4>_&EۇEﴅflWF&;wԶhy<p!\zR9<^ 4CA#/l!څc8][mI PHjD\W/Y#\cb325sB1q].'^iOJUä*&n,4wJ!*Nakb(N$ǻ'J'5yR&@%0576kS:"D^;WǓHɽ|HSYul,\HodNVY77pA?۽@JER/Z ;.YhqKX+aUz?uwi (Y=e8!&$)oIS 8`4ĻCg&h_P7EVmgƘDb:3Zrov{+D>.8}l^ڡv")hyg+Փy|d=KNN5gqqDhEtǧ3/TM=} ei,r!$V9t(kBIfcCgʮpVzay#G3Nm/2>*J9iM…(飷l!#'B6-/V%P#4(2„e7횾J&Sx"3#v)%İ5lۿ^]׼]${ V0ћ}ۭ<:B /7 ^U$H*0^#$1d\بPݴ?}~4V`X%ªuzz8k̗J'oqu=9W(j4syVXaa-Aa?2%9wLY6XvcZdY۱ z5kM/d̈́ 2 Dp CT? qN NGpW5=~w% |[#ñv߶*Qbq_3nDLڵuNvf^V=/ 2ʹs`ǰގ+ ]X޲E9NR\I3gһ</,JE\Bm@ܺdڶH~#0wUMg^5'Pڕ ]w] Z+(klnە&(tkO("1~Q= Zm!&v1:OF͹]Yvt{^=ҩ*fɿ)gmZ LdBNk2he:cFW+X[o2yptz]kJj QpXVO(py 7T R22;AkCت<RP3$A)p'63*T|Q,fBMy_Ůd_^k* TcƧS9#sIVt? n yEXM*:JZΞ  VnE1J<$^}p~S` d"\\!]~m=b OWRn+ʓى׋ k&t;7:Z+HȆر[&S;{ 7{dg߹LVʡ{X_ 4ʮ5G\n gK+i¬P Z#qUl*iwo6(ɍsJbHz]"ZK*3?e#b>y]_+Kљ ^JZjs)E3zᾓ=< w _KȤV KSdW8UNwTZCa;EwxʮZY@-wH' jWՃQ ]+F׉ognW&HFS>رٷm{O)"hI&\>wy}!Ehn\L/0AFn"XJbvR&Ooezn {i6/zFrE,L*吖PئLWJg٦wZeҤ:> 6<>7H7f MA谬#g]|NXW1ܙ(gBW]e>T-GȡaKԷ07j:vkwwn"3i.38V Dzc$LoocW aC x̦))z,#XCo('#fv*s^_TU~Ud+.a~0˲n$pe xhZ*_'y]uzBf#c!R? % m$^t̟<βg^\EIL`~+ Bx`BmH͝˸sHMk{pĢ(^ 宛 z[CPS5ovZWW4ͩib?f:V!'NS\\e1[:Q2Z%&ϡĵjպلk !gk]3_80Bs/GoT%jI$4X8/T3kكRz?&2gF6ȳ.|#جOd3WQSw=L$LT^fܭgm4y 쑇Ǜ1zX.6h)vdl#7 45 ' ]l *j5Go$%|`[Y_8vZD J8C-p@:bH|IZ(GL,W|΋|hӡhc:͠ #V(X^5'H3k r^v|%=qrr2oԊǵАvw Y?FPʷ!,NM|SVS=_J.aŜ,xgj.X|'_npJ͇wRͿ%|ĸ>& ,C85 G ]ļ?݇Z^Ԭ+΁Vk][NSyz“: c-qWrz1t_1(^p24϶Gxk;pf,TkbQY\:cv8FU ܄V6K'P^2lk95 Sr43sG_dc7%mŹ&ۿI*(UQ͈_SROx1O6"u(WI,S疝/5d`f+8ϯF%y⍘NJM򎻀݁^jDBwrE(˞$3#˗E=C`pi?h.F--GlL=$%Y8SN `6)KV롬 1qǢ((PU]4ѻ2@=0DN2`:?*gqdF:r_qj$6,RHPZh %fHyx3)]R!JaIZ]E[#O8N G*EUĞJhTbR1!aC]e n}m֘a#:1DDT좑fSoUw@RJn|Pe54[R73Qɸ+FdƯȌޖ1}9D \kॣ͘X5c, I Hm8vk6Sq"fA\Aӥ_~䨁X8bU]@#x4(qZsTo&- 2ۘ|c.sSca͑\f[) IiQCi6 ̲@V?Mi}h>.k[ Bфi-[6a،iSk¾*XT]m<0m 8eL,*ݲ)=2')M3ѥKep^KqM2aeFrX\5R|ypax:>w~&oRL%A\H2qEᴦ^;ԙA" #Ev{_vVSʙyJ(4Cc^?kw8jkl1[.UDkycA2 Cz}Z0[E} ŠN;(oiS,&?>V64tC#̻<_;ZBMNz,{D/<9;=δ%*V l,PǓ6ܵzFȧpwe|ަ1@^`1tr>X,.ԤD.y d+ޣx?R+yMtPH>}ut,hŁt_CJOgW*; rV(} o;N c3F1l40C(ģݼg*m̦}E~pt1(iڣZM.`\#.wf K[89Y$*oF;8ڲȽ@y+&vDgkY959! 9&Nv_=7%R;s0ҢziSq>j ʍ.;$6vz 8вݹ>tɶ"o3yckG=y|ц/Mgd .c@}hJb.7 LTK)s>;v5>) Kf r5%qh<5Pm9ORpL93XS^ c0'OƜ]uJ-b\Pнng+> I2FwFtqkO t7}2v%W&%Lx[5ob@ endstream endobj 920 0 obj << /Length1 725 /Length2 36618 /Length3 0 /Length 37149 /Filter /FlateDecode >> stream xlctf]5۩9DwZɹ#?G/ܓ W#kTo~˺6LOR+p~gxGnРO1O12~8?R{gm CnQF/Fl=N\g.;H;:8v,}'&Z=Yu"%L:$RAzV\WWz_D':oGP}Ac떾82zҕ nk:Y/.p`'D:.ꌒG[fLg41XkRE w6wP] +;􎡛onv{5sO#hG֔w"`o0-Y>;<ﳼ"?=]$K+6R%Mz&FzDA*t*Ї~'LȣTG&a$['KD˾Цhu,븯&d?Sњ){\:447;LH+aABcB*>FpjBOn2 ̲+zK&'@禐1ޥ.Ȗt "Mr5TbYT؟(|ecRe `paqZ#*d5b|xr,q:)kzl $̕* TudMF`Ջƻ]}V5)rvw$FAu`٠\U]Ə5s p~9Pv _{oc Gّ<\Em@מs\D+k+Ny##TD5zd W{C /M mi|gO/]F[y"Y8(ܵ*ya4}Լ ˥[9WVy+>#>!3J4Hsrx =Xx9d`6Go؃4^˜xp/62F }GrmhŤl4yoa~έ=9?%es r@oAR9{>KS0v!S*/[M z͉wS:uzBg Xv)ó Uf$ ? a2۳&ډ])V ̐"QE1EpM47{!wZD+e/#B_D2Ll;qJ.x8CgiLZx#]%b}5%-+(`ni '/Tbd <945Bh- ?$o8 М|iAg3ǘ96vj4h~~ _Fm*Uw6L8!3 {u*[CmݏN0ڏI(_L {YΆc|:7~FōS5W*Y8="}?W+NeYqcMKtY1I$$!Ϫ'Wr?ޛi\G&َaȕ~ =Pq\ԑkM 5\Y>7Tغlp,h!NI :jWi'Vmu:D̝Md ޻n]b=ဴk8L&3őc_Դ %ӌr30yB-<{BsA>"ͩDAnŭ&?r(XUcF<85끦;Gl7Do$Wd(^]4)CZ\TbǦ>nǑD`@>'I,̍4>Vb|h[1JcY>cq?)ݷax +hVN-KT2kGo8ǞHKio'-ȃ }N;#u.J~,9v }gezEmT֊FGeDlSE ]C) k|T ˈHf;vtB(8-־=켚%W:qy5+!4(i0/vI]kw%mSbǾ3{v4~Jď QT|*BH?%T_T>+KvjOk("}dֶƙIєE] >ӨT= ʸuf0v߄MM8']s0fzڟ"jm! |ke}Y?b 򰉳?V%N0$nh:03 ^/X\DEhrPL_Ҥ1AA/ ^od?cpD~;Bx˝`j8&VS+)jbf!`=/Ϊ\815Lg%QȣjWhkm'7%p 0<;n(w"b+Ot訕#n7`m1ҍwH ,y"唢Y qjNl@ hnuwCe{=DV÷Hn0,$*]܊|< S EOݝ;3֠ڦbϺK)ݐ@5[5VrqI2R1nkƧIfq$|i^Ѣ` ~x `MHL$g+sͺj!PAHHfRBB:(]DCBLZh dcmR,GrńKãpyA)Zo͏Ʃmd\Lm48S2r jV/PCE=VqE\oLy+dwdf_ :&9Q'Fă6,Tq$pTMă탽A5Kncg|FdD+~V߹ {ƨS4~ӥTzv5vÆ~{pcOOL{`{+Q7p٠XW9u-!]iY1M{ݘ^]3%`8Ýhdl&$\ZҤ_jIn`3Gܼ@u0Npl!|IVIcWZ?ƕ7HNPˋwep ➮& 6AS :h|Ec*Jˣa#߆Y_LdK+P/q)T$ߏg0Pä\ | Ԙ{JJxjTJ`{҂aaxH|F&=Gۛ)c٣#݇;J謙ja@.3.XAVhރmlgP.-ȝc?d7m.wǶ }Hx# >>}/N~ǙPBFh@D}0a{{[:$bFWoh?8#fITjK텠6s o-t",(=]el QXsº™+  }upp be`}s9{tM$)-+F&xD2tp.c^zg_[ZAϲ0-Z#J-c.jY:7)جPPztB7 5oሣ|XO-b-}}h;,{|ڗ$6gro-bFO b /WZFS Xrx lcೲA/4ɾIܰFԗCrsH /;BXq) gPӉU] )% ȼ̂9QFoX$M6RU*,W‡$;o@RsƯ2C5mILzxNAJ󸶧 JE琼[OpuPDуef1r-01 P- BeCOf_B-cm^.V^X ~*R]|dnY{L BZ̓$"uTfCN~p^7$S!7՛ O![V60<×/7q;b&~i}wJSg J/mh~EKٻN7ɱ>Ey\o xV i5nn36qqVP]+ΞsP+ϡ!IIuUY~IDZA9siS)&xZ|%OÇK_RrX?Sp//HbB7e*|ݠiOzU~Xs"CYTDU>Q$g'^~8:Ӻ.@d\5}C Hs a72pșdvS~1ҵu}GN_= AycvǺw<,%'BES7_݄'} |nLgE؏} l*!w=ތ#HR~#J%LcKc_3 qh)l@]ܴ&%`n*s2Q:=V"1Dd3Ɏ3J/!G ~R2ʶwU{᧷z_Ȑ4'y%1EmAmVf<.I2~hi=7+UYPs=i?K2WhS )^R{(FE?ܬ? ԕ!sx{#@CMeS,9R}rvcQpQX UT*dX xvdrR&62i|]¬ Iz=?KwfKxN}vt4*%R#Щo0&?Wlp\)RGh;kT0cʑ3jbn)Dx)R9 y- l6FLo'Ըw:)2v-Ob(M&< C`Gzʙ ({SVr-RܯЉ![:?Cz?ɕBh:f'r>5t圶lQu: wmKù~ex4ň)*CIɀ8(pݝt.º-d_~eWl6Y︖tZquJ}ą'+P:S:H5YmP)B%Ьi/HGO8/7[ ؖ|xQ ,͍,;/ݕ7p

y(~dxbo=kv/r{W?ae i7VS89k /E4"WƵE In,@ 7 !=X he2+1JxPjLȌ}I0=Ԝ;BR̶#:4kEEvV)y |4Ʋ|i Iޔ7۰8PQ]م`sk0'o[ ˔%?0_&~-ekђBsp`YNjX=ԋR !_NDbԪ,1?.cAsOg.&*8 %5^ &QXkF5e% s0߫R dk/($$^E%d[Q#\`mDI [<4moܵ8tS$;| TϰUϋ>yG"d Y4}D 5}mt=qhBKN<`N1@ĕSPٴ3:nVDR-R~k' _jCO2Y 33Bd'Ih:-oo?0z>x̮DAt2V\*&V]Òb#ߢ}XSis )-ؔL vWP4~O$8vi;y~ժi s]q۫uPڸ$cSB<Ɔ8 jRva5+׬P6nG*W^J9!zzX|--)5P!(~/k5,#]|K!/w )LjqZyoW J:N a.IvY.A`tsY_yzD4e+C:c[˳7OԗxJ~b<[g2]} %~~7i5Bg#W ǛJ<F+$:5e2 aCHG̻׭#F*!1ᦰ$!c?RmAv`HqK-2L\Fl$<&Ywj]7$[6@ > .ΌGK!u9F=O UY$1\uӝWPl0GyM(i 9t! YBK$!Ed@ڧOV8_JTgĉpL0~ckH2T}&̭%ꌅM C4cxR}ghԪN8{93hTsӽQ6^ 5$ffJkڮb%Z]C609 z]:-Awo{DqhNaZ5 |>j=mvV&Q0]|B㤆ö39F9"l?2 guOn }Kw<$ar￯-Z.ZEzp&ЋfnHƗK={;i,O]~ޫ >bjdZ>hDNqNhjk*;E'wBJQS(&xވrS 1 .lq ^ >yٛz,A'ٓ b[ig.R;и,b}ATPØr͝$tX AdL|]fǀ'GlfŌ+J]3#ub:*e뼲c](\hH)k ?Nr53h]tm]$9"W!Jœ[Oh*6͓ L;-o*` F.g&!Ѓ̨vmw8J5s+wiZ[ ÈCjV8 ).2b8G-.oK_ 2ؘ:(hQM ?0׼ԢdD'uK[3Z_.w: U66sqme !VG~3w۵`s[rHx3n l=a)֕Vwr,#tRٸlλY|s+]3sATG7@ӨY O&@Jk%@%HJƑ>uy雸жbi#cvwN-s"u4wY,e^ꗒ XrY#\d5$Y/i% :nfZeŽ:6ЛK2AW!fc;b,TgC~W0xuN #"=/#dgR߃:Še0iϕCBO~ŊT(-6YAPEZelmRhƓ8+M.DFmzUU8;$ôVCZ7Hl^߿_AppOdQr܋CcuhB|u2@ıETt 8B# JEvسR%YP?:M krԇ$vg+e ]`iM1R}D)6*0RC+CPD'׌ V*%Y 9! bpJSeRtO+BmKʇXSg K%uVgQ 7{d(\,ߙ,}W[4-cP(5r2 V3aEcwu 3{QwV{/,k"48ux/Sijb%].|vB=SS{w6LȌ=/`ݐ7tLi-OPʇqgޚ$k$,Jx[6e͛\ O?S$\ޛ|X^X ;QxAGD˼m I*tu_ %ʗW2 )Ҍ#';=^޺UE`|K\`h ?ˏ7\(dB|&]`<7-!]mzy6gAˌª3ѱ׬.sIP&6h\2 "WZ)9}!e#!Ԓu%X )Z>>:f#R玁A35 +-䣁HTR[_]5+}&l#jBf&*Qh*_RloؽE 0AENMRn\CJ=b#tv `$x6"{͠zss#XHuD3sh)M{GoI1YZXoۈׯVMq埳ѯ|iJJ0 f3ZXzT*6FYGnk/ H44 'oX#?pVAWx lqsT3@D-ʃMwQ{MC T>nrF37^A^Sv\ĎVgvF}WF<qEWj쯵b$%3W"zLu- UBUYvj%j+f]D!9Z%ėy9gb=Iin.^k@BNK\monI㈯ j5g 6Yeux5uwA;gW3Ўi/6OEr4F?sig:Y\,fxu#R?,C9L!ZNY2բ3X]d)qj!`{yɝ=ʒ#4QoJ)Wf) 6P/'WJ_jZ,y4[D4d"}6ҷuO|0I?%xAtvlHX0jjؾ ᬟcƨt- DZ :lɗJ\8$ҽ(eX+o)UjZb GH)M J_ 3c]2ۃ?LRpݼyj\&8y^8N:lg2SH)ԨG1O%: ;sv]h2UoOx(8uIG,F,;}>*=NOQJ1C?杔WG F`C6h5.wh%큦ɱ:|4zS.k8ɐ4gT-+My﷽ˏgo {}Z,*5*wFFi ރmLenh7E7͓> &Tb~'ĬK26x ?2ؔ2j{o^i*aIx 9SXqDkTȿ;dڇ'eO?N5nK0{!ۉx>jdJ5fq_]x %-ۃzbt?8<$a.'P MD)C̜V)HJğY볣FՃ| R0c ~~rd,݂}Q-.DwppLJ r9ZW\]B(jWsĘ@%%QKR<`Q}dw׀wEt6֥r;U-~){+ o 0AրB)P9{:dT( Ow?r?A7yyxΏO1hyk^_O9*R /.WʣZB8o ,"Ņx%DC֊QZ@mПVGJ*]~B#uv#!#zMj{vMS \O% +rGqDGs礻1ۦ)4g!?XaY&`̨;V{+~lڂ 9; piSq_T??۸$E5S#.3ZԭOAw@r~XmJ6Bhq7SƔ;W?}/ܑC(,6Rw1}Ƶle /YĠ%O8żPhyEHibℝYmg5\TX윟ꥅ2'J[> kb!MҸ̽1'\Ձ~"^+⸓}A0lK"Ogh]½=p=ZYnDCk;qXv[,9j[{VON63ƿ_*^Tڙ~0Oi-l/OBVVIicC# ~LYaep{% *7c|>/w6oi:%(\\P;϶M֎Cox|jU?v JA(A;_+ޕGQ K@o6ܺQ8?BWsOk.6}Rm/b;HL>G"Lleyxx=\nqXYPO G?53p)ȜPt.!i?pYGwԲ}eG E?}Jҫkl5&T>+ZD0b &PwCn1Y&JM]$\c|n@n= HcJZ;R6<-'/}/W倈(WX%IJ jE>w K>K_cPuu!\ah zt1 ~_;Ұ Ri7cFN|,u_G 4ϓIpˌ}d\ɭKs@`vm۶m۶m۶m۶m6w?ԩ I 죝d;cta4(U\N#{[|" Bj} ^1ZBjKR7{+cϼjxt]7Ym[BgC?Rě0޷$.vs uiM U;<,qh߫SR0+8obT> C}YU^,߽m kD ֈ~4[Z"bVQC;~zkK^HD9UUebxPR2 "h_8t_UWBtLQNAE Zk21YYŽwe'=撔ɤuJJ@:'=T9{^d%qquyPz#G%((dͮZ'zl vD癆G12ܸJj\9g^KjDrߚ9W:ՔWwDE5p{=|{Ǣ+ za) !];i̒q Ӭ]WѬQl/m k! #PUX8T;Lp/ hYuY(4eUG*!=V-;rhoVcc-ܧA!<ܾi`J#D.*)u6x In3bqwUaBبn*Q Pߡ75ɜ0E3\-#i!E0˰T !:sEzxIN0ۇ.vBXSъC277@L}j&\$sYQ4[;&wFu/jJ4RJ(x`~%5QqǍ ΤS]l̈g>vh7T!CiƎ޽a 'y/󂭲! NQe=uH އ`H?&b>67q(x&K@whxb<|jOGO˒KS;o3*W 7S0'71ؒ8m8T .f"zfD"5**/E CЉG.i` 1])0.]<:x/Ќ Ŧ$ i*T dby7EVF7ZBspR\A; [G>ĶfnITA wLtֵffmuxT(Yg7ki_܀i7j'94k,LB2uAqEsrxf~9ʗc;l6UL`\14SQNt;4>-.wq0^Bx9D\|Уݗl-DzQάm\W0%D 4@?.{]̶9t^koYH,1 9MuMA{O|.) \?o -?F Kb ? B+Pl|aR} җ iB*Jtjy_q1^ tv*r6JN7on 08m5Zk$>?"y©u#(.MхĐefCUuxG b Zz)@<@>wv6Q{Wf$7e"~A HvtcEò@hF|ت NW&O~rǞ'* jѨRciL7@Z1sI͡/Wh!-VESUbf <wz3H'nIek5wMa=ta$Y 7ͺn1tQ J݀ jڍ (U /|0JsNi .^MĬDdM$We+i%qҼztgk_90?8IP_"B7Vҧ#]28bsѮ5'm l}qFp.PXd&%+eKAiTK¤ZѶq=o~k]nuomҰ{ôaCtxFwa'|wYKAsCnQEqB.i=Ta` Vd3b.g(Ƅ66'._1!>8[twm0M/f*j%\i/$ǃ!:wdr-NW8vi=&rk%Et;SivLySoY;@Xv0C:Z.(n8Vep.< %\|wO9SB2{LEA$]lȐ3Ӗ/h;F|R7ooty aݐ@H5ae3PF^DBIT/!8_ote؞L`{xGl˘CM(G+*ubduQ aP 2ڲȫ{Ig4Kth=m(uֿa4A4fYni8#8aRG] dc6Š1wCh8Yx* Ƣ]@8!*RQ #oG RẼ?+ *&Ȁhذ}r{gw^l*RgO][cCi>:śӭLvӓSn;]K.~=mwdR߲sp /C78z -NtG0iќڶ~1{w|OVL?fA7h5<{5`|Q|⪘D^S/`7g>`G&ՌX)jP~j(iۦ{Z0* ICCBJݪst!e]VUuc[qHkb}]W3+q^DA)Gւ/dL4<_WqmާQ~9 p2,GՖ" I1X>' b:t^BIpc8:|Vv#Jf &WoM6r[v]@j%ӫ[Pvz  抏o%oj紈MYTHCkpa+9!rՊnȧ0708A:#hh3}ݲ}p %ǀZ 1-Vʍ xr:[IMR%BwE]n4 )/OT rO޼l)IVFHɀxZ%cH(%m7' GcT_ dV2tـ {SjiӸ}*-Bت{3DwhzPmn/:LG2 êKVl]ݨ;wQ {&vj1YG7,+ݤ&kڂFccAgI`T>M4<Y%W&i-OˎK$K 9:YW˖Үfꓶs0#1iEWO^o]N76 oudzkG< 7]ƑiF롈/LЉ5ݽ; teCŸpDl|WzY,vJYZW;~V#z8\ManʐvcoBPo=/ؔ½a{v\z=2p1x^&#yJ`lbQ5Njeu8ژjߵ0 Mܕ#g8lPزZ˿͋]P61*iqhNW11l|WiCOLi>W/{Yt.!ൔuH(A]L+m1荢ZdA×HI7 b8xc ( Qi&_Aay?9VDϔɻU 3Z @R@XE┩VL;xAF,#eD|Ic4įP5 L??=/ϒR\q٫$8t"* 8lB@61_I<G.4s"q`\suQM5haZ3~ef{.jH"O<_2w57΄̀PUn:yx5E.Ex>b0di-G=QtO~5펛خI3Zkck }иϧr;'.=|F$b^B`߉}ȗiRhcCd:l,ňG<2aJKʛcy>Rp{wJ.G +/Idx <5:^]=!Yjl$v(GǔIntCA}(;76Nf؈3@Dj^ͲXR+ƽBh/q~ڽ\Kp>{ʾtljx!vw%mBf\jMz\]@F`sĴ=w_@[3!9ٷ˨bO>0J'4`tS/׬5c$7QfE>?hQ@ Y4/űȻ0bVvl4[KpPW[jf%sX??q;lڜ8gla1AR!~-V׹if:Q^cV޽7v?D|IWzBNcLh^c=gik@ l{02 4 Pʠ1/,ZN7SjNnp.I_%N} :hH ")|Wp };KLͣ;T9oFlMG9K{]0!N ޱ+ÉIfT1k>aַh!hrk&u+h6G嚩B!ז(n"Y1<]؏(>w G0%WupR]n1MQ5jߐ4Md$ E,b풞~I5鳜ᱛ7R-`ߒcވ27. -4q60 ^ kܨY/DqIZabq#9]vko2 0W>󗣤p* %-$ :?tv <'Lg{2|7pa~3ˣq}IkEK(1G,GO'RŸ́YퟔCmkޠBY@1Ȱ\ =QE'VXǵrU:ӛ$^w'b7Kt7oh~dDtGB š_KJ(C{yS&gj(RdJm; Gdg,MkrT8f%+niv¶]Ԙ훷3 ԰ :.yw(:Wׂ % ѝVFRx4 ޥ!*j.$ΫL롽pzgqJi (>3+ZiHh?T=ԔͻMNWBIf~))&h[0tu]UmabϺOO|Cԍ±EJ,{%zM|85/3Ÿғ{3*rNLE -/0 L8fiHk~{^AJc?p? ^!8]:r0uV1zPM!b1.ΔK_c =MSBM\:'f#OCBf" wC =z*'Jhdo ??nEu'Nr @"*Ak+p 3ŰAW&0XV#JgZBv.a]50hwDXyYm?GX60Ɛ0={6iYGUJZ'#l/m,VPU]34:RcJT!O24>-_tZ} {) uc~dNz Gyv,B㤏JdLZ 5(ě"psc*igSGCx\Z[@݃U~`n_ߛEFֵӤiv_🅷t?+E|,$;yzaùa\NJo_M/h\ :x_ ݞ2\.p*bb $v_ã;:{ɼɳC%coۓ|œjۙ {<0L#V:ď?ۤ's4R"M6nBX+(l!cnDxslT^U8R@Tkz?bŕ0s['_z&~q*x;SZeڋJ" r:(㸲vBm[ cWI0K9re:X6|"hsũEz%1x8UWndbȲG[f,Ϻ)R4_p%;`'Ww|VNɏkj*%vǤmD[/GЁnj{]Ԧp)XT$:Eg-p?'G1p/J+ZNo͐1P$E?AQgT3T'o"#o_\xp~UK!>Uד= _+?&گ$B.#E>;a8D )}#^_Ad2U Y{/pO@;Obre`(hExޥ臟kq$Zfjp[YY'BIT8Sqev`,fpS&/n(Oxy"v ʆma 3`RCf*l(0n/~XNl!Wɳ ~&_Ʉilzfhݵk[K0`%gԩiZMۋ0N1BXW 62GvB>f{1FayR;Oj6}o!|<ڰ=@eHzq![,CHˢ (S8+~!=m ȘқR@&psHKZj֋0@DkE1"ZL@vhD nZs!}E;އ|>UJ-i%"Ѵ]:T@2&B4*_|j(Xs<9Y&!QDbEu#Qr%~)A~ ! [ ڒր`fl{!,~Ԧr<Al"ǧN? &f,rD 9\֪ cܒ$qi/N2!@2 8o<]1J9M=Y|VS 9^JKi^A^ ojL@t:hٷǩTxI2v"Sz!LYs$#@oh0ƪ1XG÷(%۸UGnJTइԚeU;Sb8@0{ϖv2:30;=oڵ;s3k9 !E.wW \Z-ɍ%e(kkI X/gfe +E<_EQ4_ü {\eM –g0rJ1[ ?bmtJkeB(ẉ M=/QP,h;sXVz>uCR63!"ݙpIߊx*EJhLOn8ղ_F12n/_DƟ}y[:$gf+'QKn,捿l%Gl 9\#>@?{>j]{K&2[wx:>:FkEURo:^yk ɍliQi@Ffy|g;s_ceH6 q^Q6epXi{=6&:ym(_ȳ^׮JJk觏Wz3iX{g§ a'.+ƍ1o昅c@G%Dr4j-{ \CfC)g^1M% 0YֆCHLhn׶y=X k\ ׽b{uaقa|?siA(@$~FCNyGnS\ qI5(\cO2b(#r"?oף ka| / d$4mSܠ5|='9]ų8iUh'g͕9ijΈp5^OTTNNX#Ci Mfe 1M \@ ½U<r$+b*/ǁ6{b`VcQGfOBW󔋵,pG3.4%4~I B .T]] L.s&md^u9@'7v(*.ɚ8ܺwq擞6K!u'\X ;jW=ɳDtFK'Cv@)c\Gkb"E *:{qLX%@<\n݋/:W:`"_]1nr\1@_گijx:89 d.2xv0{ :|Y4;hQ x|ѬxHSm*CI:]Fkр_(Z@~!ia8|:׆Iڂȷ( 3Ѻ #F6/͌WG@,U\ېtKD{C%J!C`I}T3|Yf.,9D^2OlBXTu)ˌ30 d\|sV$Fq[x#]K%1D^J95jhΞnjNtD;&wO<\5yHu싔_!]CAt~"%}ׇnu J郱Z|AҦ] ~ƿ02Gh S/ky}RB0R?x#Hk4+z˪(OB{Ix j}ѷN߿]g@q#[6:rxnmBuoRJ3X 0G8hĬģ*-θЊ1IbF|Cf:nJu+#h1qJF) aKnYT yzI=dq5 , +m-NX' {`7ۿ3meԤF>s<2-8 ko\uG$ʉ`8HRtU6p$KOWg릶;M6LJw{0H)i?ْc°y<+Xy %()4YZ2)}I`,<`})agP][*'5-n8%DDƾs AUs>RU""mo)na:L %#a$-i ]{[-8wS _gRdZGѶTA|j6Y̢rV[>5a{vP,\i/"HP gVN堟+*R,xQY9́s4G!Q$%P.-o O(ZC,}l%ӑPDNY Tq 毺_%A 햱y,,Μ&@m>2I :DABpeIB .Ό@JZ-zMfO+[L J'*]ʡ(5cT6%l|$ #^m;TOKCX78/0ma+THW5XםY.~]ȗ L3ap~6IHP?{ {>;@qd@TKP!vbnݙ(gku#Ne;̱AX~.F#_x@ҧH(oZ y2R9 o/8͉jKGKhj3:*FUl8$<}s坺zY搪)M=u?+oF~ 8\@.xեLy*Ԇ[Cq3jȪ&Xh[WX` >RÑk/dW͍N<M)"ưAY|(phH&_ RrY/YyLJhӬ:>c^֟86M?# (*:n]Sh@@\-בqOP|SM<&B tx-%p^J@NZSsžqH*t%m? +wBݛa/4bl~!ME q39nӎw nONmjAE=& YGLРcǪtSswވs:gh.V(Uht)*Gs ~3zj(1'S`)=^ȳ[ @ Wy 7^lwqdXU*D!}{gdeq_/vEsf]ªQax|`U0y8\=b$SŰG:}L .$_'4Q#C*zSy3MּIau.Γ^u(rh H"|Y`fg1hȢTٔuȁ~kAoa/4B3 ԽE76IB2gR&6pP^,Kep̉E@Z{Խ)Qh9Yڢ5arZTc0t4|k$QeU?2e0f{ޟtĀUS.;4B83H5y ҘzrqjvU޵/V#*p`*6d(ȣoE*-6s~JBAJ d7c?00}/7ol. 7}6Z p.? 8q`4?HdI}!p@A|za<#wp<rAEm{kYҐ[ؠB ~ 5ZTW%Tʖk=T"!(f s1!6q_}<'mE~MPA>aUl4O%%b=ڳI4[X8E`J*W. 36,$t }=`,-24aڗI}֡jaE33ҎtSoh 4:i}7lFũHRx×sî)AIAUT!7Elq/qƍmdUUxd:9c$owA8t}YB)=ۚ6[ά^L}k HU!c!o:#060&g#MRվW E EJZ9L*)ɵb~ ;U(Nҋq(qMfV`1+mFmpVV6?i5.À~ӧChN?82hT}+?f`}pJ$YU.;'%}iroiC[{דG{[8&oHn}qVM σqg1u@/lK<ʽLضhB+4HquY&:,n * Yn_::[nڭ+6` %89ǖ̝lampu36KʌOo>6M|~K뀬BOE=3*] zMidÒ VȂ+9m=Nu;oQXT _=dQӝ"Lݝ=:ArT;Y 訌IL'H5V_[58HEDV'%UG)K>IH\X^1\ E7žJ"+SH^53 7 }T;!CWTS,Dp𐮫$q;/B{N*؟PyS fx }Љm5}~-UDc=s>@8KQWm˄>w~)q^(C5rׯzG\W㵰7y+g(@ Д!`LJ'󡸁ufaq*109cCW-@&uqh7ަ`R]솦Y]v&!1H]Ã9,W%@CCa(Ωmuk>;VVZDiv}j 4x]]^cD TǗ-23OUmt:Pvȑ1 bT8I½JqhyJtOkaӡ$۽&2Io;S:'糷p7F<>0*Lz<|~¯[6Mwk{(Piyļ2(`,_ir'~ f] 6;̑UW%hoee9~Dm:9X㎺=g'K5%94|a Hk0~azN=~ Y8|=Sq k,9A 0+bp<䆻ѪXT <![ op<ӏ+N9.D?QVja[0-ngWy7m}~e n;FNt fI߸ׅX( jU! C* Q1 \Jslǯ:Nު=0:s }2bgj(^bxUHBdܚH8]Tsà.@:)y^ n[aǵF2i&7{ӫxȶ.(%&IJgO'Hb8T8~arָaOz[s-{M2{7(=LH r5,>W) +.i_ezy;n UHP9;?! W5߿Bmw}DXlMs"ysoHC*D(B肉T6fK1O(]t}&!ee9jK}.ƂKyq2 `sJ3%cX'4hR[2xe!on7bNB,kx.'gɌ* XjEK6G: ~NBm͗Б @[N!c*YhxOwy/^d=y'^2PRyp2008KXm,VC%'Η%#nCƂUCfto0 `tug;iH⥝{ [ 7+F+<şp ecqe?>wdUK(߮_t_N{!{N'pd(>G-y_FY\귒;c18ӿ{;˒r9 :\X iɅy(=H0d F%#\׸^Qk}\߫eIXaS39QcȜVQvzͪ:OO?(mV_f Xku?0,.BȰAA ֘LoxxurtE6$Ϻ>.XxUk2,sl]62=@je{WfŹ-m*4fF#Y?=9p"UooIۧ e,)搵O2*ujV- m v]-baװvwc0]*(%@J/Er,>ap}E)P@2FV1@-$!XQ769 KdeK6B8`?pqk+`4*ު':a;4$,c Crzc2x +E"4OJ-b0I+d+()>i;;zֲt$[,X|Dj+RGe~/&uKx{=1[T~aɡ{dAA63diSiVX]TN(@13Ğ3/l{Nrpk E4,lMJh,c{o' 7y!c$T`U_t KY9D~& K+ˊQ5hOC}6%޾`]c q4pk<[R* BQwe@_-_ \ø/=>dz 28sDt{+6pǃh!KJ O%̨ʕxg2BSnDk]g^FaJo?>DPjsN0F<~\_D{=Ceg`ΑLd ,Y} 6ӭad͍b bmSk<Jz"4}B[uNC ? ?!TB_bҦļ3A$* ho" 4 ː–rw >sӖrr0Zjs&̂cdowm _+j3~:;QDlAXŐUqæ~"a ~5|e׿ڜeo*RQ x@[]bj H? .N2ݶu-M&Zv_FV^\ LP/`Q вK۳k2pGO&uܗ,u@/񨱂ޱ e(Y?M&2G:@ncO@s͝i<`̓L 7e% e2 LiЉr\-_=I&GcΕO.?Q(9/mBq|oY@G{)ML]R˪tR&\gތOf@͓y͏2b*ԩi!/![eO;pUGUwO 8EMˆ~5!ėRZ nsmvn۶.:G[*G5QMW ""!Y4Z2R3pa8xۆB"v endstream endobj 922 0 obj << /Length1 725 /Length2 39087 /Length3 0 /Length 39648 /Filter /FlateDecode >> stream xlcpn.XqrǶm\m۶m۶bNVlg}{g@WsMJ(fgaoHHPSQad``01Ð ;8[ي8pM&F&# )@@aDo%@fgmjadquupurst'Hln06+hJʉ(T&&Ck # %`_ `v6YQA1y900 #O?&FZ $k G$:FF3_Iښ6v@NP!%okk9#@/-zH:C?1Ge$fnb`Ύ.&QgodM-\ln'쪱{>z9e UIEm-lih? ,Aߌ0;@_)%$dEefc0289|\#GG[Z;w2q[VUSR0Nh#[ ]c߫`]J޷ęL& ZB\i[XL H&9cc=PKVEC/8c~y8N⣭8orLo89¿ aA{p7XzGaZ זښ yڇXX"ۡd;_[[n+G:O 7<[;x\KUG{/3:3wD``lr7e6&97'Q*,N~UEG&-u ?koJ`~z$7 e3O@X1q;jqb=H!`ldLZe;P1m#]CHp?<~Lfmhx` W'q 5B&CNꚿst}_T4b3R:Q@,uͲ.̳n;j)ME{[>3LA=9hs(^6oݳ n@gsqDx˂b.I@v9I +J-㝳lHV4*d_2`4}2uAkh!(M NݭWUjyW,{}ydgC<_U~?=qcc_HSFT[<=e ' Lz .q}d eZdG߯-CvG:#gH#6xY+XL3S-$5Og ؉Cm:2hp-_8P[]yG݀%{ۉ%>HgǾEMѲO5WKyk!]NN -]~\gNñ9~3\q (]]jWqDiKvi>$Kfvơv+DҴ1s`( rZW Zu~ {NkɰkO^c_;v?/*1ɥ_j q-R : :NL@.Y'Waf䱢(9VxvՄA1ٲ͇.A#p9,%qǭiBVOQz !F$HQfo)4՞@'<)-?kO#!\^) 0olEū־ݏc܄'<4{KW,׊6*%'WgƲx6OlM qճ:Z2M@U~*q`7;D%=;Sv-7m- YeJ0I~ E9i'ۑ()>n7+>\ԶOkˏj(E! EmX9ӰqI#x0lň~JԡDҷ㶲ɼjsz hozz?4D8Px״Qƍ#+<˫)C! ރIV![ַ </ 0=FyG9xH6 b>}fQ#E.% yH8v3Z];!KOgIZ\&~}0x^Z1:Q6~;0gyMtT9Jdja몴 #hAn MP. C2tKmp߬5@hR235bg_QCcäMsLIģs%s_0vwHRR8]|BI V \Æs7oTA57'_~]pa>!޿9eFAݷ::g*q/!N>1t>.o6̚8._3DNRv,-f)v~dr<f3Ѻ>Gqh_h1yh"%_VC!;_"Tfux/DvCICYsr |!qsE(ܛ__!T{HHW0{ B}";QÈ!PaNeulmw  4.g C9ZĂۿřbD1^g1_H X W/s2}/!qv1PAU_`̖}Cdgw֑M(QW*:5'&¹8#3N/fxB Oc? 28Gג&y-0BNSA0U(Ҷɖ;p=pڶo%Θ6be3%t0cW2aɅAW_IqʰS RN%jU9m wL-HzDvߖ3@LlLbdT}:h9iޅJyWbNjd''ocQ6/"[́,kx_&'6*H2zo-WuIbɰM&n*]`7"t  >Sw=L &A,3Wse,&=S%ED3&]J0 fo[~(ʠ;uPg:1MCII840 Tsvn08 T2O v:*ɝkKM'$=4@أ!蹪0 FRS+1rc jIsG3\4pO]@&\+KJ"KǙSQQ=rHa<@̪>ǸuYQ6`R\"I3,pg?xQl m`6F&CxUw*-|B!\v)k, gUvįKR]o)]'ES%ӃXJ0_.2<>?jCYE^?nr D \ir ^;C>r(]r,iH!@R%4c{`Qy34(0y)jZᩴB|2,q7ZY X]SPAPNsq!Zl} JFPy5fp agl(6bieUn*QDQ-f&~USb2Sm|t@ WaGD*LxSYn{gfZ:(wt XH/Z~S\>(XZX2FxͬӤsIyTX%;HM̗q\)>0fqeTcz^_KtK#[*-$>P{pz+=ymD?qأ;ax_>j9cisɑޭzjGUHÛTK614`%➿/H:C?3& f6yT$b:3JR&.w ;&%uYr(Ӽ4=~WȞI7@Pځ%U>O[g`RCVF֗>S􎴯wy>iefg+tg;! 6/.-ZNXi^s?QdӬr-~(/>*J=Qg&&N)%)J)XB9wDdi |S7|H]'YPWIrP Y+ ?8er#qqLb(mqmle優'Mo<()Udh6I8$k۽>k2\iԢs0D&%LTg †@'lR Wc;hU/̈́= v坔| Tsը7IL5&Jo(bgz@Y>It,$m0SJ#O ScS3O_%%V<ˌ̓pCLo &GBVSDHzWpfJ7KUp ۂG-EMp~ $4MO,0l'm lc7ÝREj sS[?,2x%2MF _O-ˣE6Vq }LI{.~l {Kʨѧ1'ARjAEy'ƠKc!>&hf WExbĚpF0\K(9T\ u뙡5ܝcɼ-rEU+k%L\"H#R%Tx@&`QJc:"\g}$ٛhtMm; ~koiE1s9eո!KCcwٳJ7wpҋJOpyu[<ڞH*2K++kAuz7VhN`PzB{zTAҋ\^lwM! ,Dlgl>^WU 2ZNݵ'd-i%m |B /_$H>[[ɦMSS `OGA"ݵSM>AX{mkyv!7I.^kK5:45*v>ppoRI Ǫш{}fdY3m}Y} =5PH دAIVMqϳcK1h_=Ɍ%k[D V؟IJmCzE/< 7, ;3?:uvD\`]$%;Tr FUbXۮ#zƳ"snڵP ߅A5TgG/A@ד;o"KZ/n*2ǒ),WRA],d*#N.iKBgG\w &A_tn?/5\t !qNn"5)0^RQ&Y0té=bwʨ8> 9⭩bifkP`Y:] fwy|?3@Af(N#WKXf__--&p(xKF΂#E̐6g x5i:5C&mvxJvc:0ՍsqMYwx0T 5=( ! 9FhWcSy⸄߽ *t.)QβԦQz`BY-W\RH>i;_4ʮ,<LnԑS\.IV6Ii%fK  y'h Q-p '*6l5(/m%o4lO2eܹ;:vNhȔHəo9 A)@CA٭~@X:>}0lv"QκѦC}gو$ jPwRJ!4Pr?XxHV`1QW?i9Df< m=DSx9pw|Ed#*ֺtмj_+3ۛ/j=8?R6bHO[XZSSvCLTNp1|o²x7 im+Z~?&L[cs0t.OHOFmMq ǀWLeدQjlGC7oNmkwH~W/X֐iã8:o8qSM޼qNVa 3ޱ Ⱥgx77Fg8l!<)_3|$r}]?|x#pEE>?{PUS -'o %`:]aRpz[ǢP@K` p5'&l1%AQfc|@N-;Gnf=f}x,'֔9|*%Z wWe ~ yQa-?Y9g3`*Ej딾G/HzT--a.y̋򒰿`/*=dU~IЛxtDkIN`v72QPgFTi/zZѕ̎\.j4ƈ_( ELy'_Pjhe-MO2ƋmF=\xb\ W4+Hmï-ܤoCrkN/Xk-$''lT^S{q܇i)"?Pf"&MsPRvcǢݵ 2M7Ddg˥Tu".V,z.ċq o~b _Գ1ܚrLbJy#Qk0\P@B&K&ƃʳjl,$j#8ŁAΊ0pxkIuAkMӲ@~ox*܂ZxY f *}=8w.&&ߣᤑ>OP=ׂwOi㯂Θ=opr^,ūoNYҭɻa% Qeޝj`1p t`YYq*&8y(?IϭwXӣ j{H1W;ӎP3u\ctqUd_n_z2f:?=evnNѮJ9z (NhÓG~c@egv޹l?|-(us0,|T,YS0xUQNiR\"\՗ضAmBxυcҥb;*|=yH _'k0^#nXŌiIH(npc$v{1jw v<?B"_S'#Kdqi bJz,QYJGl#,if ]'VۗI*31,7)bbJ(骰>>\]:rzxČTFp!ȻUzHc+79wϨa = MDI#qHngxVBm 29TW3y "Nz4Q?jqc!]&5F7\%RňA".z܍4!_Ô?ey%dta!% -5@}\Bj(Z٦,oʹF=TxVwPwș\]t` 9iE솮,Ϳݐ7"?O$b'9xە;b:B>z\7&7\KIw1#;K%Bovz*X!hH Nð1W25k/c8ogd>LQ+q%eJ@=~, d_C'.& <w(T3DQw}4"'/gfbO.1߁s5Cد6jX'SS'P}+{1Yg)yX]ֈ~Z fX}v;Aśl̈́+qyyqٌ56=?]Q __hͼHxJY}XqtyDaRjQ##+=iآ5Ž#-JKͯ'\3Ï @ijd(f%\["^'݌i.Ee{=ZWCEOȑs?劖EZ}[.×uU"h뚵ʡȮ::pwu52.4I5|: yN P|OyD5-q  Q#4Ƒk|Ol޺oPd=?z< J]D.e 7-`kh ˠ4JZ7ʫeex`K:gnZ i#(Q["JL/"ۢՇҿەް֨cq%&w"2ow`B&b>sE۠ބ-IPzva*=Mw@i O>eי_!q7u{ᚉ}ˣB#; FꖨZ~LQN0D'+]`G3]J]?zZsfyN]νH1% D w5 %HXkQpCɏسo\ײb"j׼*Ujbpog: JD'Q;t VCS+J4rA_eDz=?<K__Bsdpt-8jHmGGw Ym좎H>(RiD[#rߵL3")˒ϩ{Q j_xӼT @}#vpΊ A^1q%H諚5uО*{"t(0*1R"n &ߏVNW&@ 5˄:d3ӻ7RIޕV[=FanaΦ̓Qwq9nFVL*Z Yw:)C'2jys$s]2EӭvfǼ8^Q-< #JznB AR I9ˇYީLY|bz ?o%;fFJ (e>_Ozl}UO== r#G8|c}Ɏ{kyn EF`LT6mApJW-a]ry~M!g[SnD.7WڲʂLlً4ưL U""6("H,Ll Mņb' 4X_xL%$ nsb]I".CrƛcrCcJCq.Yv#?a/_uF|-fTZhI=KRmųYLѪqoDD'Վw{K lY6!0/7ZTepJ/:.{rq;\iuJcCaij=\;oOoȇplhoVQK\Ͽ*e[5NAs{a˹J ]lX8pc6-"31F:aILz#~Yr/RzX[x2~Gv>]唂E!#-:VXNq`۠SJHgWZ)wCq1pޤPC!ӝ[~-hY+/6&# ꒩Y,4'Pt3R,NO~ eš'tPw,F?.$z0WmQ*_U (]5ݿtXH, ')\d&nC!xDq |ʯK3ZFhQ@27|p9Bg(MPØh_x p/ݬݪ=~_FˢR| 7d| v@Ҧi 貞%̢;k®P67cIg48]~ݛ}20|do^>PSD_tl3Hd彎'l\ uhvtdyD&*(uwc0Zݐ`1(nُNCK…!z~?/s_2I:44ddҚZO~v(*QGe2 sSŝgh%f1g,()2<2#dWFa aBzzFz>'3`w#Jw:@=fߪme6tA* .kW _̡egyD+%Fjr9G ?UO|JDyJIZ1>Y)%YMoA⯕۸s0mB }6g\Yu琑}k37]idqQJ`dqQ0Rv4w{HDj*?`̴Ej|%KtJh-"\mb>Z%"W74es&ԾWɼF f=#߱`ban>(EgMoݒh5IWLh d5Ӭ":lZ3C{<ڞSǸ޿!9hTb6<VG=RM"\u%5RX& j?'tU{,c V4J :l^f 7DN)@#R&hȨ8 *]j:#fC??#˟2jܶ}=rl[V$Wc&pU $K%vNvk+$UH N18!QO')a3qslni6MܔK)%48$zDþ. f^Y>;BLB72MDz2[e˿W-SvS~5mpxh+_q=a۬+~eRn6:ƚ@S*S7\V\eD?.m.N9a{xOgb7w[TZ+Eg[??j-'Mְx+gp8MaGl=JqT<8Zm:فwc .y@Cat%.c:vOx2ݔ?ކ97^cq5k$Rf;fϽa%AC< ׋t!ހ:GhcdoZĹ Z @RbFh,H-[h$ZFzl,"Zn3pXiҊ sde&:[e6On"eU!zh !/ e|ػՒR$+_G(Oz̴y"ʑ\ˏ:_yN\gTrGrҨCY),-<^kx sM5~8d><j7FNd~ҩ/&%,"e.:ňwgcٱY?0$&GhZAG6S}U1xW"x{p{ڙidOѴ%utstP]M)R LBh": 2|5{gaW y"x0\Hl~2[E/{j;4Jn@cS./n`\k8vWwzٝjpmmmk,ݿwD3Ѝv (UT?] =ф|uUr vK9A4<a5G ~I"ٿe7)//1˺_#^"c7|?[?&cmW!j6&дk$/ O8\^qL` PʽwiI=%d#.c4B٫luɔo3Y]e-K&N,YNB_d*sR0.E kU\١ipMـ2Zd{5Jl$4F.)w瘡+~ &#gsx5rbl /dž bx0D;VP a>JO*X 2żzo'E(˞ԻM3n?`Cռ Op0~OsSz4WxnObЦ|32*١ұzIe ؆.vNP/E-]+f|dsDTOoAtcW/zd*$5*+7.Jk);i,4OԺy/>q!oݱfz҆fiO[Zxx;[\&)K -.paO+R*q ᘁu[w$4*bǘLc+oD?g3Aǐ^ zErt@w.?|aA)`SoCd h0tXEE<$7? &UUtw WMj!ܫԭdO㠰\!8Dp 8(u2Fĸ[&tʠV,5,xM5s,u]Z8 )Q2k'諄WFx*m+mRhRN5?;d5PؽƇls,_9>&5Zr?^RXuR4#@U֋- [1փӴ3 +cf yrŻqﰘra ZdL;snu"犱i%$-osϤtǻ沖6}h'G6M?I/{0ϰG f)`5GSA<6_ X}Q_lÚX^BdžV@6$PGi&6r_{ f'!_ ^ٴŠ扙9@PMa.J2.Cvz|,h8Y֦!CL0;? o y Dӱ|؏i!I,L`?ZGP=RUޮɄ\ \y#RW6l yCQժi`^pQ4") it3H"=Kȍ8\2rxoUS~~܊%{G9x2fXeVl[#Q} \1Be?;:޲H996~X9Lc8>jٍi3BHM;g y`?ֳz?,RHHd22;+8j[v:i]Ʀ -aᏇf)XAxp\ecj_>32f} zbX@dkN <SxT^kQeQT*<3`z:8B~䔋1RTHk2+9)Ɇ-FSY=a_l,j?M%o}J1NkLML@7E;QJdMȸ\<'G9ܕ^3k6Ll.$=~yw| gG0Ec% mw\K/2 -ת`nQ$2 ԗV~ 3 Ȍvv_Jw൨G~E5D]t@v,(Y0^y9M@\ԃEJ|uD"]9,{gNchco6'̗n,gX/V~E6cLi$oɣۏ!2Oڻei"QFR7j1V*76骹wXQ-!‘$%nol3^Ͱկ! +c%~ġєd@}sL䶔9xɄ뤍 x6 Tk?8xmZ։0Ʀidt!c } nzx^}'܊ux fPXI5R1'H#~RٟIWSΘLb7(8[k˔hd)PUڱġ*X6a+@=Lz7KԹDc/iXk!}Õ'(p-J8̞$0kF`&,n$N9\CWpi'$1fm<Ș=Tw9>@L]0A;=AL:L eA^t[%0Ht A!AZJ' Ϣsҡ'ظIf:&cp[mx4K>x_ x#;,5DG!N?x0ɀ*%p raMQ56z=-qӁF6a6ܾsr\t箶b .f/!;噇qq%LlD)W~6{7 K2;)[,~x+fC}?{r !Lh ,w@%0&(9\`8 'oŎi`BW1YfOF#rM^+O.+ ~*}eQ -j } 6o*%5,2f޿1 -;\O=k|+0h?Dz]?gi-;vd5jl XTU(f:j&E qԄLE8 >'M юFzX 8AI˔Mz,rh')'iD|r&s]` Hfc)/)MymbUS2v[} Y?cb^#QnpL\Q, vZvRA$cгQo ̍-WJ<-j,D)t;Yn>|¬ض%J'|i=4,ۢ>nq"B8'۹^]ѠeO24$9&ɧQ -_đ"' nB|NkL\$e])6 i'bA;J9Ua>𻪹:e)JX؃5fiMշyFg,hqw Bq8#LTB.Z#6xlqOԬ(bZֺvyl.Q)jfpQ^`ghc'HRcyV #HٓX`~KcXJZZ}m߲GwWLnB$q亱rV#t*a/`A1L^*ntMq!FIӸ@ ON75DZw}/EX-0mX DC=~%5fͅFp2CJ*:븑*^-pzƣ&Z ii&1F)BEDA_a03G&pn 5\cDMFGhPh  ~AϜ~+6F/l1%ҰDž |_WH>bugv0p^<+#4l@TYs2DFgڣ[o_)Y>̒9-/*@g(9.O^5tgqTCؓ?8yy0=o?O#7¶\3^NkA9 HClә2jI$bKX7+mg ʼn!MDI'UղrUь[5a:p(5I`>sFewQ 'G(DDԹR_҆x=2)&(/){,31!J&X\zYGu03H Ÿc&z:,KFup(ztgTu @ @$8@j +oIF ?1 L/f)~^b.k<Za||b~ Ar<% yZjITJi 7^Bp:񴧒e c-S9YæVjUתk7bKazE%ʙ'ױ0(^`C OiJ7&xhOpͦa*4K@0/GrC4n+G]vLbu+}ޯ/`b9?c\בoǹ, (ܫIMp߂`]NO; 㰑3?-θ%h`S1wtC3_8EGTu ? uLS htN%@SQXPi?~嘎x6qM#ҙ>Fn^/vz(ȝ׾Lct4lA+j8H,TmZ>ʢyBSDuן€e0ğDE( g=TL pQ[Wza%?23Z ]-WD,[Jt5~ l$}H }=h$~_"^{;ܩ㾉lr/d+ۭjI+Dz+[3xH'$'RgH_]*(|dDǫENnHg^',F_bopƫҚ=Ӳ3V~Wj{7$dDzZYF#`FkЕr!ԃn\.Y&;՚ecP&Dyޏ# _87cϩeB{2C&L>P|i O]`^5Fh̿GiS/Fҵ3zig=4n-SnZ\5ȗoQq8jQ%ޛ6t-/ zDDB 8oym.Y~tO7ks$NpXme"XBu$2qVa|SPËM"[ D 8hWOѶ.mB^Ϯ_fPm X㸽}8*S,qf֌hn6BlBm6VKӓ:S-%m&潡/0<V3%{Aͅ:aH ڞg(naqAZ2WՌ>?P~vlϢ9|"A& uډ۞nx:|s!G&ة߼4o[*"Rxq>gF^^7O,OuP .j<$\*`D{>awb-cyF℮/icmiVgi Qx?xc_y :~\дG7Sv*%lZeriؔIJgh4?>b]hh1΃ocPH*vڲ0G1481 Զ-bx\~B ^%\iSt1|p/}7MJZ D#;x;tE`m]e3^"[qb[Z i`{j7V㡞$SJ6"?p/!-fQ ,^9[0* |M\pMmP#tgngWr*#nY>Bޥ7 Րh'B֭a| R6x! -7($mS &B[*m _Sm#7Q)!dtRqx6]3iA|fCx;KA:xuWj6U2Z,=]_g<] |;=Sꭻ=0`)|ec.v-!DB2LHg SQ;\S}"?I/][9LV.3nsל8-k$4^,2dV 5RfowہpAFR !PJ__T2i >=ޯŅ-VެvCZP+:uO_ġr#߀lL=c&4Ǻ4tSo5JXa긶(.qO_ ޠ=I pZ܃_co\VBr9e$itSYV@+C{r64ܼ׎DxJQnWf|l /iTlyAz38o 'V5#BXy6sJ⫣9.խyYa\dB#2{g) nW*Z笣71sAVA Ĭ?Gت߳x/Uo5WlHdMEU.:\!UMI8#H$@GGotRz#:ahJqsXPiH XKdr>HoFzN6vIn(o#׳a8:|;Ө!eU7Ժ(oޝP807ChNBcmwoNA9}1Y90ӯ+;3TVy OKoLVu/._IEJ֢9GupN{ͪ)2kAw'3گG0zJE4s73=bWe ItPHVS3bdq6jn?E@ǔXP3ު@ d*&YVwXfͺO-FtsBj#Z'|0_ sJ"h%Bә$P$"Yfj$?m_A R*k<~WPB|_2½Q%hה3qR2>SFk.rGCVyBZe_: ssSԣ<~KE(+A{ <[1;TfPu@׊mf$x4-Fξi:f3|Gy(G^|$5g?^B? l@+|ad(977Lك"sδ]3]CN toї~$Yʵ45\>=_)D[cMzE`τiOÈg$oYVnBX˅a,vL0'OSWRkْ FJ#`[7i?Y{߮SmJ߂ו&)MVT>J2tU:ۍxm,?.dR8V'2~"i4"ge1~ͤTh}l\_QG^Q˲G<)%L1Gr2.asfp_87t5i"8G=±$M.CƓ!*.nGgVͨNo̻ƜC2&z!ZH^ΐEnV Ŭv;}Ajc7ӡc9Lq.2U ~fxhEv6L)WOOӄ!%I {׎*p凪qǡ:?%#as#{@ X >L 삓jOb>IГG99*\Lkip9q\ݺFN54o.UnCl!"?tFY+kI%x/vX3H 5#x}K>}(}T/p=ub R"8A钘UcPq a51wN4X}%=;aٽ x⢰1&gf:[n+9k/Yv WmSx{܍ Q:Ԥ,,ORk4qmy!u0H].:ESjM5k>NS1PAG0~Z"V1m B/s}jGHW2s&-8{P4^LJXƵJa5(6w͍MTsI"bFKfvyrәQ*FeM G[{rܝ)8LDi/j +2UKԈhosu)<]=rC=DH|?ɥpm1nJqTsTH:#74 N nz+5Ʋ~* 5 jfPƎ}eL.;VRZfBv;^~ z@Tj"9> Ӻ+*I *$NQvLs2<)PzG\.#P)Zf> Q~L|#ER|CwmɈ~ocv#[I ƯDXIG=$Gxf.TZ;&ۘ`! +|$*D\癈3Uܱ19TUv=l*u-0oՖ*~mVo̪ ? 2;1Q=w"3'Y=Gݓ; 8ɸ=lja}]?GN/O:fDkQEHcsf)'Iu"8Y&Ɣm.|BTAK . 3Ll]PmIrkAdו["RL[Vo(oc' !o{&<_vA"*{`` t`wJZowO<9fۮ;#=ԡbr۱wCȱj)N=f6V}ʆ' ijL288!7EJ"Ab܀HeAKRJkx%]_Z߰m l$ROa6G+-$ Q̪~#*lN 4(uYe]B' Pty77WiS؀_kU X'L:.ӈTY`5MKAw-ƟP=ȽBGнۊv4Kd[mzqǼ^8Rafͅl\QXDY09pRQŤT4z#MbPbJЦ,DL=QG~" 67ݝ̊b@(hFgůHlH*#<٫2Ic@I S)Ȧ6UdkU-@iOqXM~TƳ!0!H3<7S :[6UMᝠuF7  Cqw"vU(5Ad؇bIlD%䉵8 +M" UۘOnu1őFn3VS6;[LיԌhLe#QH^k%2djdzpU^pײN!IU`]0R9Rqxa#Q|9G0ON!HS9bK\k ̑'"ǨKrn+D7e)%S Vv5+%a^z YxU7 >%&EP潣G-HggIZ1 C6y V~Ǎ{ \ðͮVM^̓ΰڪIrYps8p<% 8yVh{SH= (JD2ԓa_7"`v4c|1qT{kg;hc+J GGM0QWcqH/b6 rRVw0- DeXpY5\ԥyaّ@@$ĞF5ˆb+=tzF#A=p1TU" MIt#,5%(% \u!l.UnX1 ZX7Rl&ԫؤٴ}/`bqFq4[|:gqDEL[sxWȹk9Qkizfx2dgH@/!PBHm^'jК;wFnf„ u  c퍇tfcILf@$O]ɿ}<'+j갚%G_^btcSBXQL~=G4 WXhnuQh| 9]@3'9易X; #X7Ȁ3<׺7>H/ڼOGvՃssC&ތ5h*5A0ҥKm`+zbu ibD@wFM6!]v 'ebq3vب>̔&%r ~D5BjX^݂ [[/^/hB5kiVXD?_ZvJ Vb/$)2m 4 Cx73%So%IlșI]cmE 34guk% kϹH)A4V Q ٸv,_ht{P ^fmOci.|腟z*%iP/pjVᐯ Rn_z~bKvQm1\1]{@U$d.f G;6Av,ZA5CqM]YU',`ZU$i6az3,W>tK)4`8&d 1܇+Hm{%A]'zp\,ͤMB$z`vv؀0Xiu'$0垩m*:ӝFiN+OEa,j➡,q)'~3<4Ħ-{ CWD%%b{zg]`?=־-e#Uk&6p&hNvn%4}D^:`H7cJ$ b2\ ,&}W7Xפ[z-I2r0԰tU¨TڕwJZ%ܴ37{Q`s#$;YAۈ#q;ܭI"=5- Rnm*\d\xX A1@ܠ]H^_:\z/d#I>V";]9l١'R*}:aug*Yǂ;vo6Li$ Y. ҏJ\We"S\y2hɨwO-Q=M帳ٖ$˂(SڭGJv/q4H_!s[<#ѻz#nTfaH4-(T,>ƮVȹ^yuM7tFW I#0ָ`~ l¤3faކ .$/iDu2p)dV9~ V={ߊzϔtk7ߎtz53U!KE6]a"F࿇D"$Zw"M`冉Mys?4'U3\ E OWch7K9ΓR`jr?2V{BY5R1bi5Н#-T!dTG^ld] =H18f2\zÞmO5BwyNMttٱSh8n$̟ ZA!п79֘)cMۋyj8ٜ$|}ZFVLT,eS|ኹHys8/ ? J;x_蟸n`̖݆x6{ij9{@edRRKK %!( (FS\ԉ~\ϖ`2[ "Oлnc I:h6|Hn,T?eLu;SEW*٠ @PKbGD |gU`1Oe ˡlx:τw)H8{_o@74nר\3<+ lX#R;ڃkYQ3po,A)9+\҄q R"ϜCyh+0f-=C$C)VϖWM )\Hv:Jj=ˆ 7j^þ|"ub3AnaljG}QŎMSb.L@$IMA+~ l.+p~Xn&lIy'Y'c~5z~ށ8~g oK]>fyB x00L6 jd XZ܇hMq j݀top=%) .4jboW7n4ˀveϋ ݗYL¦Q51[PuOvV6HO!cgr%DfG=o5>uFou~~#7H, DCw9] trUZ2-\jW}βjRo>S; *G`ӗLOWBj|6oQW4g #sDǟxt{1&}hsyX d^/ުjxM~+i7ؕE +$Lֹy,[Ίod#oqso5 ەⱃrK ֪O `6w;``/PP~,!4u9PNѯt^nXw{\IhNyc%ݘ\Zy.$Άh`m}3s_~*h[IO+N Je1p;bVp2x 5Dڔ.fS7|J|z =X8vCZEH JIk Nc'=}%gt6K\76 [s {h+όU`[9K,ѯCna|t H[z<~KOѡWU[EQyt~ߤŔPe`Zv}R ǞZ+k5PcҺpY,Zh-$= CPɵ1~qB]Ls ZPP-#, AXX'qYnC.ُ C!y:2d#Mi\zCpO7Xczw><(3! l#޵y$я(m-Q2o:K8ybbkXڊCe0~{0BX蔚>ۧ#C\lG\"EesP#tZr(cQM^ueMS_P۫Dۂz82,ƲݩN0ͱ4`|lb3Ԇ:l7._KիR 'uJ0u4EsMAnAO୿OsvHYB02{ {*sbJm'1*^;+`OL0 C#Wt^ a QI[:ʏx_pLw,'4so]h`VYF?  =ϑjuXW|fG +)D1ҷpj&fw2,kYu'1#X(7m݈~`:6Ж1 F}俯=LFQ+l;6g{uJz1q9oB v4$H{%K_Lᾭ]o6W =I r5\Njǁ1B> ;Mڵ(]} RpՔF7TvJE~OV9n%zқGe^g4BFgY5v֮O> QܥC8hEz QOv&- +<*,b!($4lt7oY|ƟHʑțu04p)ep =i^cna9/֙ct틦/&.3Tvd@U@8jܒM8 hwjt/h Z("0GE]Pq?ѺQ+Xj4/]g")Ut^?҉ {2x@Έ8OVB#$daR@FtA87h NSn3D}qI U *W^v}Bn$Ymkv{&N8:w`D% `Λ~x `kX{o:L̔' 3wcȝ.m&7=j8N|?*iD|# iB@p|C#8]V6b}%Ox6TXP9 $u4Jވb9vo*ei^ yh[sSw[(κ @#]<6>,́Qa"x6 l}ƃ)LT>]U>=l }Θ옜g_-iY`al>MAYs@KF9g&_0c*MTO*7$ڨmҡk= _jMDVhOPpOiy~˳% S(ƉTo4H Fgddj/gPNPW\.[Bn]nȰ&`/jżI"uDv.i7v9Ϟ̩`$4lx-j :jڧY>1mEaj[bT4s !٨B[*Z68 ?cLd$3?!YrD~e{(=쏖صXFy_aЇMO@grR8bd M㢞U%^r `1IZ/,p&V( ƏpL!1ք&N0ULjf^&:~H>w%ۆzV@w=e6e` ,$yB(RDj&`R&{mʥ{(AO4X^գڻSBp7K[3X jЋٌQ0dSGwa Ν2px8E9jѫ[" Eaj!6|(kPD7!†:23tm9>DRZ wأ(Arg]y)ސPg&A:H[ܰbW%$ aNN];lWD^{]zm$v^sLB-b͆eaHIbW{/P/VaneA1nսP`< E u=MSTTqNWhTuW &xdOdn'pMׄ VnSUNy$y4 󄵴8@#d% ｦ׵E|i=iĊDe7oU(/t+_9"sƕ#YKgzb5\͘O^Y &[Uy lx(g&D'3.ᅏ|HϯTe .dtpw#4@ZT:@76k 96 o wƹ-.%V2}0YSh` zŐ"UJhh\鎳:M:u&ų Tee2W zKK$_D% YDs톌Œ1',o=ZT]Kgp)ei(e)h>{kM4WcE 3lĿPGIV3`Ui]̷8sq6U'0 Tu[՛+Ĝ[4bڷìZΗ>2/!縑Ti `ʒmFU2XQ$[/[YH9VR gO%Wy1Hʮn#+Cn۞&DG|N_*SbI4OȦ;{N7k?)Bur VϲJX=n7٨Jdg pʀdu-Ж۪Xۼ°0^c\&LCwdkQ؞1LK bEm*g+=s) Gy*&eç= c46Op&xfs +J-'p)v?*Jqƫ5R5t&%"lsbS%` >$F*Fr8nt H )Bg'o.FLΪ5?77dttMGso,/cr2Qԋ] =i`{H:^;TtAlj=+ߪ4q88Q=a g>@Tp~0*2ś(&*1qjn/Jp| l<5 RaVJ'?Mh5luś%J;<>QE}&ށ44/q%pFq5>p^wQ&!ʫfXxxgmxtz~3 mEi rw7o\y!(3mJxU5fwxMޓ&3\렢>L)Z5zp&7'3S0)(KyEMÌ2i/]B%{D͆r#ڦSߡ ܰ7Xץֹ}]88(f݅jlKZXHMa)]`U%6$(XV.?tW8A?G˞JY(-l.!ݒ69VDe }B #p6z4x=۸b%GhG%k;&Yn6ErLⴕVlтx\5|"@TJ&føɲE琌@[{]hDOgC"T<uKBQT ?.Qh^x9لr@O SĐp \ŝVύu9y@ E[X4kt2>qXH5© q5<12L*=NS,jA]NO8ymP2I+7)+[~?Z*KemLwgyZ祬Fĕej8XUD(7CgJ1]ߔ'xa`0*TPGR+gQ ;NUéw(>#W49TϒC6_(Zt2"Hõ?iCIzBRLl0ֺO[ w j"_Ia|>J,BˬDe.:属:b6`\opcNxFud{X\ߵM} +?/cQ|VP~?ֳnA{~GL>Ys53b RU/BdLPp:D;j@ YʬY%mxt0F-ϙLɳ.ORNsL6?=q( i&ͭ{QbccZ F}Bj\g grkbX)1p\#= oϵ\gf~Q>uҨGQ,wwwOr'r;}M> stream xlSpM-Zm۶m۶m۶m۶r}e>OX/csȇLRB1{;OSFZF:.e1F&:f(RRa'SCK{;CS.uSeSF& PN.ƔXZ:ػY[𸹹 99SljJbaJ`ficJ ,))'N@!.J njgdhCjdciL ciljlJI`fD`_MbfN*br**v&2۹8s65vqWw4.ce?d $s=6~f? V)BG e~I QPXnxhw ;mpR'YŜ|騆;f J-{h%2ּ=i\x܋XXA1;;k%{;dLoMT4e[&*t~ lj1Rŝ["vß.^ؼwrlᵗӠǺ^$& W ~T99nG8!嫂Jlo1;?m(amKj Iռ۪JW}rK-{92XtZ[▚>ph2^}GƃSdY%1 4rޱKQ 2_|PNmpIbo[0F"k5vξЌZy:` uhR &!5 N3źddW\U?32[eZƉ)o_;P; Ζl;Y2h!/zXDid Pf@S玪q?틇3huE)񻹝hlS1j-98l({lújŻd sLZl<(yhmǟs`#up$ 8Nv(])Hӎ &p j*΃"].4ȓZM?fs'rޜo@? op/ѤDv.Xp3gPdth+,F s8I>F9emj+\זzxG:lr&=`eQlO3n]UOQxGuo2V K+p-t62"1vyHՊMq0Gp^]/aI,Utfċ9$o~ _w 4L1;22f\wʏOI{5C8ǁ@: ^eXאQVaW*PsqQN1$&5F@7xUz~F8)1 `c{xkz@[ }׽K kC34ڋrK`s˾  Rikt(ɕm\%%KP܊Zl~|aW[lBW!ӽHNZCםUJ)EZ7>i?ڋ@%5B}7]y1ӏ?úeB/숖ba,mmN)\l'tJccLEs~ϓ41q]U^G@xPX!k0~N7/yΎMVsr0Ed[6E\SJȟ>~=,oZbz_mUYq@Za\ueyR6AUlzMcdS}BzIa.NOjZa-!+<g ˚y% ^="ssx&1}1L i*&aBr䢫fu4e | 5KX1uY7E)%P[̩xt9v+i„A1v`pԲd t[Uo6dr7p>D zJ.^vvw<X$0q5_ (8PV;w8"=U8Y+DѨ!24y9B⭖d}$x~YevPyQ!d>Xw9s,I.-VHT{ۆY{E4ԧXsvw+I83?)MKf1BH-IM]Uh(6UA^jQ:y6gbF:4EfK}IWE.< *+^VOV}%{ )Ld{^FE%uɾ_j4Ss~ 7٣ED)7}G'uN%izﲧ,rUfj=Ш{D$$v\,!&hC7BW!Ɓ'J7n[S"f8ŷ_4\%2#t~xltGmhE-Vs[ yۯՆXbxpyo y. L9"in}*$<&t^OX~q V7ؑlt?]23NZzo nxٽm;p,Ly7F9%8K4Ξ7g#?1m/ i?8+fXDf"ZXLɿ€+"eϭp5>2 ʁA6Jlm~i9է!B>`PeG*.<$T|ǩЙ rI9)+{(r>лSXހ碜{Rk6:Br"?m9ؔC&^x{Y,DRK('vNv=lDzb{f=wY#')tI;؛O60S^d1H,#K\2P*b،c`z1O˔=bY<93lΙ,aX\D#X L#zW4rwR%ri{+rױevOPTKF+R>CYVit |y%P$E s8=w-0x }P581i"IJ3@ BWu.%xF NhU|mQ̒JqbsYxs9f|f CWV̊M c3țQ8(O]hh:t|D{ak @%k2e1c= G=tr ,ƤtCcT T}z*h(M)k 9 aW4q6 o$jC  fbFƹBŴ;<`; Zb.™ZzX|KxDõŁBS ERLZ+ES?.e_8JxSōUS+٬ϣ.*.~=TӤVak< 'ƥ3ѪRKz$ -nQڈ1_y` ̧pEպKX\fB<@ Xn2o\'{PzRqe"odB9-rp5cD3P7)܁r`mJ;Ѱ]}yCNv|)FUz-]1w!S|v;? 欔!Mk ؟ri`BZgަl׶x9 mgm9yFlɰ# 6'*H#(5?.}>ae_ULnғz 0jsZZ\>4MVA7FF:2Ĵ-YpAJ@A3x61۬%(p Y'8: F׾Ͻϱ2E\ ,NÄE~jY_0\sZI5 4&V#e$5D7]^]9 @uzyRGnqGԨ[^7@h>iȝ7%V ‡ֶTB,@V~6mԊhz@!B'܁ )' tQ'rT@FnkVS58CW<zR%Ћԡ-E¦ApOL=\^ gג7 n4iz}5QqN)#K=^Mȕi#wT/h~]|f}>$NDa7sG[: | <7Y*d}9[e+,'ؕ 8(]M^0k(.j RuXyx_Y.~2YX}ay,Dcgh`4& I$0yӒr6ZKj>`@#W%}k|8ISLc% wvLgKO`*9O g"C{:hkpw vڱ],SSs A|YxY4b ,!tz;FCwO+w`NxK+"feę߮AvCl ApVJJq}Wp4Fn8%;o=~QbmD&a?Ֆ]-ȍ? z1SU^$+A|u\~#e(ǯ%j^ղ2a'Gn/F W.$r$*忄,b fUGDOlÏ=p ~ΐzr<+ha VPmv̅;vZ~ۦz|:&%R.WUUNYHx˭ɻ\ uI"v3\'BZ~;) 7VWO}Do(*JX +&PnRLdV6^/#8Ɔ6^~l`fy*@?ӉB#wNdMfy3y#m](Q=mmL԰v !I񙃷"UGc𡵉xjKTR1hN:{-Rƻ Bndv-̤>_ AĢԏ]PՒuQₒ=LlƝFNi\ނoh^&9RmOWk83r)PPR*L*|Syd+靥jlNªIze!7mUBY7M+n.8ً7x qjG5?j2׆@ȹml O1гszu f祫"KˍdTY)4k5X` }L6VC2^z5MS*8Ⱈq4U^ym;f_bHEŸ'Kyby]ظA@1/<9:28ڿJh-^u1HOmX,9By9:e'栬 1 QLT^Ӳ߅4/[O2n"x^6et F&m@eOPrh^=g?h <^x~/@b v;?#>d0QMV"oʸȄ3`8"5?~|5 ~T-ii34xqt{kL, q! g<;Ke^"絬/W hX¿!W&*`dw=5ay4 )ṯf2GVꝞϗӁ tJVdE>X*34OV(O\XG$2&U9`'Vϒ؃2|4jJùCQOS(TE51(WBl\[՝P||{`&*vq.n!3kR[T k_3&<^g )K)Ư9q%0rGm*cMr1KBR7\:1 :gѵAF3'i|\ׯ/4 b=E:6?}_֞V(4 Rzt\7Nġ0r>/|)n剸'<ZO%gͽ˸\J_?B]4rIWb? 5Fl`jx ڴݘɈ&"-l2E]!.r;lU7VLBW 8գ2Z8y~^zbֱ_RG7W%Ϣ(a[]8jbpb*,T\]UU0[ݧR. ya9 d$ dJ*w;`S˞^@`Sb0h\Ȯ_1caPKD\NFyc-έTO$||#Jdc$ژY֧̋oF ϡ g]>cM;/ #@UWk{bv zh XQ"o>. 2%gRmF&'4{]AeFfTR@&cAlη&P4}F$B]WVO:hOD8}\$#ZiʼA-{J@wMg=c`pg2H/9Ʌ5.̖-vl%|Ջ5 %_,M c&~u8հ4uEy94JVЩ,k4@INj$"ܩiy)*3}w zDQܚnI^w7K`'smBz^;WD }vG\!_ܥWL2M4i&@+?>M::(ȡxdg4xt wM-Os`H)#E.sM^\?r} ml^fU7}_ >fLUdnly$s1:,S,irA"{sy18Mv8f/yٙ&ƫߺmwPq]f|q8g{h= >X ֕a*Dx] <@'AQ"ZIG#7¶p]!jkL&I;S6Inϛ3/=G3WO;>#Qȝ6YL):JT!Pղ#N]ʃF%orؠ-ų>Q,gn97w$ak>x  W@ >tZpC_Jˊ}նI&!vcQCP?Is(34syxrʯ>4FW`+\#@A@IQMw ryqz;“RMs<ڟ1*"J'c/k !G >D6֟o٥7&!3rupi/@fY7jIbn7)NJ'P|T5<+k U&sgp:b'YLj'Dۈ'-m(fiʪǪǖߪ3Әyt#iF J&Bt _,qR|턊^\p]=ȘX8DQlljN zjDT_`S/1XJ*wx #}x}\:` AN 2|G{/PzAIaIy^sKWs;w-zNPÎn̻FDe<(\X$"TSd coWxU:zLMHn@ީk1?[`,~8oc|PoߝƼ;oُ&*ج]HR62!B,R+lvGg4)DS骝 ZvVf)(]yp*`y0{fصLASm߂{oEϲƁB ta%PN8"Y痢|J8ed%?#!s;s"/ ޳wl ԒZL15ۑv>1@-?{., +_k&M/ ڪP:Bg]Xd`qg{f"׃SulHN_QzS5sNؑs EAxGw\%ƏXL:vMztap&sz+*$=ثc2oo~+fC)8鉹TU9݀k2D@bim!uhfJbU"9J0eX~VK?Ƶw{o[0D>_h!R#~uy%SC B+sYp7VA~Z|C.HUF8GH ӐФ2PFsˆ:'5[6*~ˁ)Gݝ BGYqh25+z^ߓc׾)jƁՂx٪|xF9#9ԯ6^R 0/ /p^yeH\%Վ>=좄J=YV1&ЊRt1{l+!_<+̈LQ>8n)j Ͽm4?$w:zK%E=Y)wGeΚ-U5-Y zahQG-|> 1J^k5IU(ƽВi0iڬTGDZ%پ׻lw[ǡzR`&*<\yFD,5e $t no6^}@aKlђ6prHg#o:-֠Qs endstream endobj 915 0 obj << /Type /ObjStm /N 100 /First 928 /Length 3176 /Filter /FlateDecode >> stream xڽZr}+JzR '67''VKhjdC`#!uZ K"RiYF%`QI܁D( 0-R fᒠqbTCS8sgV ιB1Y#. 4'p)\ h4\pZ24\\!!4sבnAZ # &"IO2M@ZDwPcw «E .xzqABpWknt7T;]n>XT')Q"Ze*GG|N /"E9x-" 2x&/NOq<}zerbTTF e7 ER`*-#|*y=s)?2rCs&M9-X97gb3^thl0?glKc?&z::!lExV[b0Wv;4f#-`-H+w(gU~OIG)vxriƓcV0ǷU|%RѸT>ܝ,+Wط5po.OVK6> w'1AERuD*.X#fzw AU㘍,}@jZW!Hl > a -*Vb=ogU-$[ΑԿ}8\Lj>7W7{",!AnK2/kH/#{]{\yD:~6)@>D&l7t/5g !OF$o_{Þ6KxJCbAH7cyH{qwoRjƋeƭ-C_ˌ[}/Yd?Y 7p%H#$y V\'{a2 IۛDbq9|<<-ѯLG0i!M.1O I2cH>q4 m$R#+ )|9)c){Ji߇~ò/?HC$YN1t‰OϑVII~Z{Š~h ϯ⟢yQwh> @S(>ӛ$Kdť"\)`d5ɭM8Lf-Kї{|'y֚ԵN_T\D?V} +}/Q+KȬ/V%L/+]SJZ@kˋx 执ENJb>pAx8H ^a$ٺ5FѲ+Al>sKA|HxZӺ:/pL}%CHtƻ5BWKQz)s1JRUJֶΗetLE}a$;/h(x,/&d&,Eڭ"C ʌjaZ OW@_"#^p_IQ-hY@D~DAD.xF< #:3XVT]L+VҊt'!cL+V*}[P2کm]DUP!f+ibd &yR` s`6M4]מKbBU0]{ endstream endobj 973 0 obj << /Author()/Title()/Subject()/Creator(LaTeX with hyperref package)/Producer(pdfTeX-1.40.15)/Keywords() /CreationDate (D:20160520113643+01'00') /ModDate (D:20160520113643+01'00') /Trapped /False /PTEX.Fullbanner (This is pdfTeX, Version 3.14159265-2.6-1.40.15 (TeX Live 2015/dev/Debian) kpathsea version 6.2.1dev) >> endobj 930 0 obj << /Type /ObjStm /N 66 /First 552 /Length 2542 /Filter /FlateDecode >> stream xڕZmoܸ_u$|'88 ;Cq8(W]p EҤD)(dw!9<3RhXh7\Fp8H 4Q1y8Aq(U Q9%5:K7\(pqҩHkpp C ͳV$ (\Ea0ChNoL#q' 1$$0>Mo8D7+iqe ULBԌ|)YhITVWFEhl4m )e `&1g1Rҙ9D7V9:ʘ LqV6JIoL'Ө`^A! D;2j0~8ys?uO,;N>n?64a|g? Lt6A{3󕤗v}2I/Kyޝd%X>Sjˊ"-256"I/xu?STjX$!y NIye_S//+͓ڰqm ɋYYO_4q,rͿ{{}cb'6%Nr|KV{eP~\*‰!X/`KY``7çgc{Oq7 H(0aaš%9(jJBEX,5sbsWۅĢyBQZcEe y{n,A_SSEzJ'*Xw_C?zjVڇn|e0^t[#ݡoю,T7{&._JuV;qHR;0ۻ~@T1%]>\S`~]AZ:>Y{޼ffzvi-fVCH󊛙1fZܲYL &V͔V'& WIPZy5{X^֬WkV5j ^T78=ј^Ux|woI7VsuR@xp3w+[ة |G a_Aذ {<_<+MKVQX=tLwJ`f'J a'gC r5cԦs`#'o]ۻ v7y?w#D 9t/~9vq0N{;;y endstream endobj 974 0 obj << /Type /XRef /Index [0 975] /Size 975 /W [1 3 1] /Root 972 0 R /Info 973 0 R /ID [<018FFB10DCD5A6A2B4B4957696D15477> <018FFB10DCD5A6A2B4B4957696D15477>] /Length 2388 /Filter /FlateDecode >> stream x%ihWҽZ$X,۲,UI]b[teK$]Bh!PŁ: !i@HӒЦՖR:- PB[(ɟ mi{gܙsso&Lu lDQedQT6#%h2J[жfAn4GZ Ѷ@m?5րZhu8Zi4BSΠՓꏶEӥtjIft-V 6PG vA;ZMtUUhS >m+Zp͡ih{2GQhc8y4f t] $:)pmm 86v"2QA[%=.1q"G+Ahˤe6&0AۅD: PH:&zH'Z/6F3&18W#PbóR|(RVE;\zVGcaǗIYݾ S}=$ehgmh?'ehΓɱ6m@Da)]EZ'%0Sj{@E ?y21"SD}8.h#P!p 0 8@}́=o]tpQ9'\7eX^lu/*ZuE.T(m=5Q[x +BG4Ȋ￣Ԭa񁢌5|У(kOJQ55v*z{^.X Md'<;&1vLco1>黏>`;&1 vL;&1 vLG9Gwc>} vL Kִ>9L#?/  endstream endobj startxref 1207798 %%EOF madp-0.4/doc/PaxHeaders.5405/DOC-References.h0000644000000000000000000000007312717644140015364 xustar0029 atime=1463765180.05772051 30 ctime=1463765201.029553013 madp-0.4/doc/DOC-References.h0000664000372100037210000000724012717644140016217 0ustar00fransfrans00000000000000/**\file DOC-References.h * \brief A documentation file containing all external references. * * This is a special documentation file: it contains no compilable code * whatsoever. In particular we use it to define external references. */ //class References //{ /**Frans A. Oliehoek, Matthijs T. J. Spaan, Christopher Amato, and Shimon Whiteson. * Incremental Clustering and Expansion for Faster Optimal Planning in Decentralized POMDPs. * Journal of Artificial Intelligence Research, 46:449–509, 2013. */ ref refGMAAICE; /**Frans A. Oliehoek, Shimon Whiteson, and Matthijs T. J. Spaan. * Approximate Solutions for Factored Dec-POMDPs with Many Agents. * In Proceedings of the Twelfth International Conference on Autonomous Agents and Multiagent Systems, pp. 563–570, 2013. */ ref refFFSPC; /**Frans A. Oliehoek, Shimon Whiteson, and Matthijs T. J. Spaan. * Exploiting Structure in Cooperative Bayesian Games. * In Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, pp. 654–664, August 2012. */ ref refATI; /**Frans A. Oliehoek. * Value-Based Planning for Teams of Agents in Stochastic Partially Observable Environments. * Ph.D. Thesis, Informatics Institute, University of Amsterdam, 2010. */ ref refPHD; /**Frans A. Oliehoek, Matthijs T. J. Spaan, Jilles Dibangoye, and Christopher Amato. * Heuristic Search for Identical Payoff Bayesian Games. * In Proceedings of the Ninth International Conference on Autonomous Agents and Multiagent Systems, pp. 1115–1122, May 2010. */ ref refBAGABAB; /**Frans A. Oliehoek, Shimon Whiteson, and Matthijs T. J. Spaan. * Lossless Clustering of Histories in Decentralized POMDPs. * In Proceedings of the Eighth International Conference on Autonomous Agents and Multiagent Systems, pp. 577–584, May 2009. */ ref refGMAACluster /** Optimal and Approximate Q-value functions for Decentralized POMDPs. * Frans Oliehoek, Matthijs Spaan, Nikos Vlassis. * Journal of Artificial Intelligence Research, vol 32, 2008. */ ref refGMAA; /**Frans A. Oliehoek, Matthijs T. J. Spaan, Shimon Whiteson, and Nikos Vlassis. * Exploiting Locality of Interaction in Factored Dec-POMDPs. * In Proceedings of the Seventh International Conference on Autonomous Agents and Multiagent Systems, pp. 517–524, May 2008. * */ ref refGMAAELSI /** MAA*: A Heuristic Search Algorithm for Solving Decentralized POMDPs. Daniel Szer, Francois Charpillet, Shlomo Zilberstein UAI'2005 - 21st Conference on Uncertainty in Artificial Intelligence, Edinburgh, Scotland */ ref refMAA; /** The Cross-Entropy Method for Policy Search in Decentralized * POMDPs. Frans Oliehoek, Julian Kooi, Nikos * Vlassis. Informatica, vol 32, 2008. */ ref refDICEPS; /**Joris M. Mooij * libDAI: A Free and Open Source C++ Library for Discrete Approximate Inference in Graphical Models * Journal of Machine Learning Research 11(Aug):2169-2173, 2010 */ ref refLibDAI; /** Nair, Tambe, Yokoo, Pynadath, and Marsella, "Taming * Decentralized POMDPs: Towards efficient policy computation for * multiagent settings", IJCAI 2003. */ ref refJESP; /**Rosemary Emery-Montemerlo, Geoff Gordon, Jeff Schneider and Sebastian Thrun. * Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs. * Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp.136--143. New York, N.Y., July 2004. */ ref refAM; //} madp-0.4/PaxHeaders.5405/config.h.in0000644000000000000000000000013212717644307014006 xustar0030 mtime=1463765191.037632817 30 atime=1463765200.245559273 30 ctime=1463765201.009553172 madp-0.4/config.h.in0000664000372100037210000001037512717644307014650 0ustar00fransfrans00000000000000/* config.h.in. Generated from configure.ac by autoheader. */ /* Define to 1 if you have the `bzero' function. */ #undef HAVE_BZERO /* Define if you have CPLEX library. */ #undef HAVE_CPLEX /* Define to 1 if you have the header file. */ #undef HAVE_DLFCN_H /* Define to 1 if you don't have `vprintf' but do have `_doprnt.' */ #undef HAVE_DOPRNT /* Define to 1 if you have the header file. */ #undef HAVE_FLOAT_H /* Define to 1 if you have the `floor' function. */ #undef HAVE_FLOOR /* Define to 1 if you have the `gettimeofday' function. */ #undef HAVE_GETTIMEOFDAY /* Define to 1 if you have the header file. */ #undef HAVE_INTTYPES_H /* Define to 1 if you have the `colamd' library (-lcolamd). */ #undef HAVE_LIBCOLAMD /* Define to 1 if you have the `dl' library (-ldl). */ #undef HAVE_LIBDL /* Define to 1 if you have the `lpsolve55_pic' library (-llpsolve55_pic). */ #undef HAVE_LIBLPSOLVE55_PIC /* Define to 1 if you have the `m' library (-lm). */ #undef HAVE_LIBM /* Define to 1 if you have the `stdc++' library (-lstdc++). */ #undef HAVE_LIBSTDC__ /* Define to 1 if you have the `xml2' library (-lxml2). */ #undef HAVE_LIBXML2 /* Define to 1 if you have the header file. */ #undef HAVE_LIMITS_H /* Define to 1 if your system has a GNU libc compatible `malloc' function, and to 0 otherwise. */ #undef HAVE_MALLOC /* Define to 1 if you have the header file. */ #undef HAVE_MEMORY_H /* Define to 1 if you have the `memset' function. */ #undef HAVE_MEMSET /* Define to 1 if you have the `pow' function. */ #undef HAVE_POW /* Define to 1 if your system has a GNU libc compatible `realloc' function, and to 0 otherwise. */ #undef HAVE_REALLOC /* Define to 1 if you have the `sqrt' function. */ #undef HAVE_SQRT /* Define to 1 if stdbool.h conforms to C99. */ #undef HAVE_STDBOOL_H /* Define to 1 if you have the header file. */ #undef HAVE_STDDEF_H /* Define to 1 if you have the header file. */ #undef HAVE_STDINT_H /* Define to 1 if you have the header file. */ #undef HAVE_STDLIB_H /* Define to 1 if you have the header file. */ #undef HAVE_STRINGS_H /* Define to 1 if you have the header file. */ #undef HAVE_STRING_H /* Define to 1 if you have the `strstr' function. */ #undef HAVE_STRSTR /* Define to 1 if you have the `strtoull' function. */ #undef HAVE_STRTOULL /* Define to 1 if you have the header file. */ #undef HAVE_SYS_STAT_H /* Define to 1 if you have the header file. */ #undef HAVE_SYS_TIME_H /* Define to 1 if you have the header file. */ #undef HAVE_SYS_TYPES_H /* Define to 1 if you have the header file. */ #undef HAVE_UNISTD_H /* Define to 1 if you have the `vprintf' function. */ #undef HAVE_VPRINTF /* Define to 1 if the system has the type `_Bool'. */ #undef HAVE__BOOL /* Define to the sub-directory in which libtool stores uninstalled libraries. */ #undef LT_OBJDIR /* Name of package */ #undef PACKAGE /* Define to the address where bug reports for this package should be sent. */ #undef PACKAGE_BUGREPORT /* Define to the full name of this package. */ #undef PACKAGE_NAME /* Define to the full name and version of this package. */ #undef PACKAGE_STRING /* Define to the one symbol short name of this package. */ #undef PACKAGE_TARNAME /* Define to the home page for this package. */ #undef PACKAGE_URL /* Define to the version of this package. */ #undef PACKAGE_VERSION /* Define as the return type of signal handlers (`int' or `void'). */ #undef RETSIGTYPE /* Define to 1 if you have the ANSI C header files. */ #undef STDC_HEADERS /* Define to 1 if you can safely include both and . */ #undef TIME_WITH_SYS_TIME /* Version number of package */ #undef VERSION /* Define to empty if `const' does not conform to ANSI C. */ #undef const /* Define to `__inline__' or `__inline' if that's what the C compiler calls it, or to nothing if 'inline' is not supported under any name. */ #ifndef __cplusplus #undef inline #endif /* Define to rpl_malloc if the replacement function should be used. */ #undef malloc /* Define to rpl_realloc if the replacement function should be used. */ #undef realloc /* Define to `unsigned int' if does not define. */ #undef size_t madp-0.4/PaxHeaders.5405/depcomp0000644000000000000000000000013212717644311013330 xustar0030 mtime=1463765193.437613649 30 atime=1463765194.397605982 30 ctime=1463765201.013553139 madp-0.4/depcomp0000755000372100037210000005601612717644311014175 0ustar00fransfrans00000000000000#! /bin/sh # depcomp - compile a program generating dependencies as side-effects scriptversion=2013-05-30.07; # UTC # Copyright (C) 1999-2013 Free Software Foundation, Inc. # This program 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 2, or (at your option) # any later version. # This program 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 this program. If not, see . # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. # Originally written by Alexandre Oliva . case $1 in '') echo "$0: No command. Try '$0 --help' for more information." 1>&2 exit 1; ;; -h | --h*) cat <<\EOF Usage: depcomp [--help] [--version] PROGRAM [ARGS] Run PROGRAMS ARGS to compile a file, generating dependencies as side-effects. Environment variables: depmode Dependency tracking mode. source Source file read by 'PROGRAMS ARGS'. object Object file output by 'PROGRAMS ARGS'. DEPDIR directory where to store dependencies. depfile Dependency file to output. tmpdepfile Temporary file to use when outputting dependencies. libtool Whether libtool is used (yes/no). Report bugs to . EOF exit $? ;; -v | --v*) echo "depcomp $scriptversion" exit $? ;; esac # Get the directory component of the given path, and save it in the # global variables '$dir'. Note that this directory component will # be either empty or ending with a '/' character. This is deliberate. set_dir_from () { case $1 in */*) dir=`echo "$1" | sed -e 's|/[^/]*$|/|'`;; *) dir=;; esac } # Get the suffix-stripped basename of the given path, and save it the # global variable '$base'. set_base_from () { base=`echo "$1" | sed -e 's|^.*/||' -e 's/\.[^.]*$//'` } # If no dependency file was actually created by the compiler invocation, # we still have to create a dummy depfile, to avoid errors with the # Makefile "include basename.Plo" scheme. make_dummy_depfile () { echo "#dummy" > "$depfile" } # Factor out some common post-processing of the generated depfile. # Requires the auxiliary global variable '$tmpdepfile' to be set. aix_post_process_depfile () { # If the compiler actually managed to produce a dependency file, # post-process it. if test -f "$tmpdepfile"; then # Each line is of the form 'foo.o: dependency.h'. # Do two passes, one to just change these to # $object: dependency.h # and one to simply output # dependency.h: # which is needed to avoid the deleted-header problem. { sed -e "s,^.*\.[$lower]*:,$object:," < "$tmpdepfile" sed -e "s,^.*\.[$lower]*:[$tab ]*,," -e 's,$,:,' < "$tmpdepfile" } > "$depfile" rm -f "$tmpdepfile" else make_dummy_depfile fi } # A tabulation character. tab=' ' # A newline character. nl=' ' # Character ranges might be problematic outside the C locale. # These definitions help. upper=ABCDEFGHIJKLMNOPQRSTUVWXYZ lower=abcdefghijklmnopqrstuvwxyz digits=0123456789 alpha=${upper}${lower} if test -z "$depmode" || test -z "$source" || test -z "$object"; then echo "depcomp: Variables source, object and depmode must be set" 1>&2 exit 1 fi # Dependencies for sub/bar.o or sub/bar.obj go into sub/.deps/bar.Po. depfile=${depfile-`echo "$object" | sed 's|[^\\/]*$|'${DEPDIR-.deps}'/&|;s|\.\([^.]*\)$|.P\1|;s|Pobj$|Po|'`} tmpdepfile=${tmpdepfile-`echo "$depfile" | sed 's/\.\([^.]*\)$/.T\1/'`} rm -f "$tmpdepfile" # Avoid interferences from the environment. gccflag= dashmflag= # Some modes work just like other modes, but use different flags. We # parameterize here, but still list the modes in the big case below, # to make depend.m4 easier to write. Note that we *cannot* use a case # here, because this file can only contain one case statement. if test "$depmode" = hp; then # HP compiler uses -M and no extra arg. gccflag=-M depmode=gcc fi if test "$depmode" = dashXmstdout; then # This is just like dashmstdout with a different argument. dashmflag=-xM depmode=dashmstdout fi cygpath_u="cygpath -u -f -" if test "$depmode" = msvcmsys; then # This is just like msvisualcpp but w/o cygpath translation. # Just convert the backslash-escaped backslashes to single forward # slashes to satisfy depend.m4 cygpath_u='sed s,\\\\,/,g' depmode=msvisualcpp fi if test "$depmode" = msvc7msys; then # This is just like msvc7 but w/o cygpath translation. # Just convert the backslash-escaped backslashes to single forward # slashes to satisfy depend.m4 cygpath_u='sed s,\\\\,/,g' depmode=msvc7 fi if test "$depmode" = xlc; then # IBM C/C++ Compilers xlc/xlC can output gcc-like dependency information. gccflag=-qmakedep=gcc,-MF depmode=gcc fi case "$depmode" in gcc3) ## gcc 3 implements dependency tracking that does exactly what ## we want. Yay! Note: for some reason libtool 1.4 doesn't like ## it if -MD -MP comes after the -MF stuff. Hmm. ## Unfortunately, FreeBSD c89 acceptance of flags depends upon ## the command line argument order; so add the flags where they ## appear in depend2.am. Note that the slowdown incurred here ## affects only configure: in makefiles, %FASTDEP% shortcuts this. for arg do case $arg in -c) set fnord "$@" -MT "$object" -MD -MP -MF "$tmpdepfile" "$arg" ;; *) set fnord "$@" "$arg" ;; esac shift # fnord shift # $arg done "$@" stat=$? if test $stat -ne 0; then rm -f "$tmpdepfile" exit $stat fi mv "$tmpdepfile" "$depfile" ;; gcc) ## Note that this doesn't just cater to obsosete pre-3.x GCC compilers. ## but also to in-use compilers like IMB xlc/xlC and the HP C compiler. ## (see the conditional assignment to $gccflag above). ## There are various ways to get dependency output from gcc. Here's ## why we pick this rather obscure method: ## - Don't want to use -MD because we'd like the dependencies to end ## up in a subdir. Having to rename by hand is ugly. ## (We might end up doing this anyway to support other compilers.) ## - The DEPENDENCIES_OUTPUT environment variable makes gcc act like ## -MM, not -M (despite what the docs say). Also, it might not be ## supported by the other compilers which use the 'gcc' depmode. ## - Using -M directly means running the compiler twice (even worse ## than renaming). if test -z "$gccflag"; then gccflag=-MD, fi "$@" -Wp,"$gccflag$tmpdepfile" stat=$? if test $stat -ne 0; then rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" echo "$object : \\" > "$depfile" # The second -e expression handles DOS-style file names with drive # letters. sed -e 's/^[^:]*: / /' \ -e 's/^['$alpha']:\/[^:]*: / /' < "$tmpdepfile" >> "$depfile" ## This next piece of magic avoids the "deleted header file" problem. ## The problem is that when a header file which appears in a .P file ## is deleted, the dependency causes make to die (because there is ## typically no way to rebuild the header). We avoid this by adding ## dummy dependencies for each header file. Too bad gcc doesn't do ## this for us directly. ## Some versions of gcc put a space before the ':'. On the theory ## that the space means something, we add a space to the output as ## well. hp depmode also adds that space, but also prefixes the VPATH ## to the object. Take care to not repeat it in the output. ## Some versions of the HPUX 10.20 sed can't process this invocation ## correctly. Breaking it into two sed invocations is a workaround. tr ' ' "$nl" < "$tmpdepfile" \ | sed -e 's/^\\$//' -e '/^$/d' -e "s|.*$object$||" -e '/:$/d' \ | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; hp) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; sgi) if test "$libtool" = yes; then "$@" "-Wp,-MDupdate,$tmpdepfile" else "$@" -MDupdate "$tmpdepfile" fi stat=$? if test $stat -ne 0; then rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" if test -f "$tmpdepfile"; then # yes, the sourcefile depend on other files echo "$object : \\" > "$depfile" # Clip off the initial element (the dependent). Don't try to be # clever and replace this with sed code, as IRIX sed won't handle # lines with more than a fixed number of characters (4096 in # IRIX 6.2 sed, 8192 in IRIX 6.5). We also remove comment lines; # the IRIX cc adds comments like '#:fec' to the end of the # dependency line. tr ' ' "$nl" < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' \ | tr "$nl" ' ' >> "$depfile" echo >> "$depfile" # The second pass generates a dummy entry for each header file. tr ' ' "$nl" < "$tmpdepfile" \ | sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' -e 's/$/:/' \ >> "$depfile" else make_dummy_depfile fi rm -f "$tmpdepfile" ;; xlc) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; aix) # The C for AIX Compiler uses -M and outputs the dependencies # in a .u file. In older versions, this file always lives in the # current directory. Also, the AIX compiler puts '$object:' at the # start of each line; $object doesn't have directory information. # Version 6 uses the directory in both cases. set_dir_from "$object" set_base_from "$object" if test "$libtool" = yes; then tmpdepfile1=$dir$base.u tmpdepfile2=$base.u tmpdepfile3=$dir.libs/$base.u "$@" -Wc,-M else tmpdepfile1=$dir$base.u tmpdepfile2=$dir$base.u tmpdepfile3=$dir$base.u "$@" -M fi stat=$? if test $stat -ne 0; then rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" do test -f "$tmpdepfile" && break done aix_post_process_depfile ;; tcc) # tcc (Tiny C Compiler) understand '-MD -MF file' since version 0.9.26 # FIXME: That version still under development at the moment of writing. # Make that this statement remains true also for stable, released # versions. # It will wrap lines (doesn't matter whether long or short) with a # trailing '\', as in: # # foo.o : \ # foo.c \ # foo.h \ # # It will put a trailing '\' even on the last line, and will use leading # spaces rather than leading tabs (at least since its commit 0394caf7 # "Emit spaces for -MD"). "$@" -MD -MF "$tmpdepfile" stat=$? if test $stat -ne 0; then rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" # Each non-empty line is of the form 'foo.o : \' or ' dep.h \'. # We have to change lines of the first kind to '$object: \'. sed -e "s|.*:|$object :|" < "$tmpdepfile" > "$depfile" # And for each line of the second kind, we have to emit a 'dep.h:' # dummy dependency, to avoid the deleted-header problem. sed -n -e 's|^ *\(.*\) *\\$|\1:|p' < "$tmpdepfile" >> "$depfile" rm -f "$tmpdepfile" ;; ## The order of this option in the case statement is important, since the ## shell code in configure will try each of these formats in the order ## listed in this file. A plain '-MD' option would be understood by many ## compilers, so we must ensure this comes after the gcc and icc options. pgcc) # Portland's C compiler understands '-MD'. # Will always output deps to 'file.d' where file is the root name of the # source file under compilation, even if file resides in a subdirectory. # The object file name does not affect the name of the '.d' file. # pgcc 10.2 will output # foo.o: sub/foo.c sub/foo.h # and will wrap long lines using '\' : # foo.o: sub/foo.c ... \ # sub/foo.h ... \ # ... set_dir_from "$object" # Use the source, not the object, to determine the base name, since # that's sadly what pgcc will do too. set_base_from "$source" tmpdepfile=$base.d # For projects that build the same source file twice into different object # files, the pgcc approach of using the *source* file root name can cause # problems in parallel builds. Use a locking strategy to avoid stomping on # the same $tmpdepfile. lockdir=$base.d-lock trap " echo '$0: caught signal, cleaning up...' >&2 rmdir '$lockdir' exit 1 " 1 2 13 15 numtries=100 i=$numtries while test $i -gt 0; do # mkdir is a portable test-and-set. if mkdir "$lockdir" 2>/dev/null; then # This process acquired the lock. "$@" -MD stat=$? # Release the lock. rmdir "$lockdir" break else # If the lock is being held by a different process, wait # until the winning process is done or we timeout. while test -d "$lockdir" && test $i -gt 0; do sleep 1 i=`expr $i - 1` done fi i=`expr $i - 1` done trap - 1 2 13 15 if test $i -le 0; then echo "$0: failed to acquire lock after $numtries attempts" >&2 echo "$0: check lockdir '$lockdir'" >&2 exit 1 fi if test $stat -ne 0; then rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" # Each line is of the form `foo.o: dependent.h', # or `foo.o: dep1.h dep2.h \', or ` dep3.h dep4.h \'. # Do two passes, one to just change these to # `$object: dependent.h' and one to simply `dependent.h:'. sed "s,^[^:]*:,$object :," < "$tmpdepfile" > "$depfile" # Some versions of the HPUX 10.20 sed can't process this invocation # correctly. Breaking it into two sed invocations is a workaround. sed 's,^[^:]*: \(.*\)$,\1,;s/^\\$//;/^$/d;/:$/d' < "$tmpdepfile" \ | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; hp2) # The "hp" stanza above does not work with aCC (C++) and HP's ia64 # compilers, which have integrated preprocessors. The correct option # to use with these is +Maked; it writes dependencies to a file named # 'foo.d', which lands next to the object file, wherever that # happens to be. # Much of this is similar to the tru64 case; see comments there. set_dir_from "$object" set_base_from "$object" if test "$libtool" = yes; then tmpdepfile1=$dir$base.d tmpdepfile2=$dir.libs/$base.d "$@" -Wc,+Maked else tmpdepfile1=$dir$base.d tmpdepfile2=$dir$base.d "$@" +Maked fi stat=$? if test $stat -ne 0; then rm -f "$tmpdepfile1" "$tmpdepfile2" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" do test -f "$tmpdepfile" && break done if test -f "$tmpdepfile"; then sed -e "s,^.*\.[$lower]*:,$object:," "$tmpdepfile" > "$depfile" # Add 'dependent.h:' lines. sed -ne '2,${ s/^ *// s/ \\*$// s/$/:/ p }' "$tmpdepfile" >> "$depfile" else make_dummy_depfile fi rm -f "$tmpdepfile" "$tmpdepfile2" ;; tru64) # The Tru64 compiler uses -MD to generate dependencies as a side # effect. 'cc -MD -o foo.o ...' puts the dependencies into 'foo.o.d'. # At least on Alpha/Redhat 6.1, Compaq CCC V6.2-504 seems to put # dependencies in 'foo.d' instead, so we check for that too. # Subdirectories are respected. set_dir_from "$object" set_base_from "$object" if test "$libtool" = yes; then # Libtool generates 2 separate objects for the 2 libraries. These # two compilations output dependencies in $dir.libs/$base.o.d and # in $dir$base.o.d. We have to check for both files, because # one of the two compilations can be disabled. We should prefer # $dir$base.o.d over $dir.libs/$base.o.d because the latter is # automatically cleaned when .libs/ is deleted, while ignoring # the former would cause a distcleancheck panic. tmpdepfile1=$dir$base.o.d # libtool 1.5 tmpdepfile2=$dir.libs/$base.o.d # Likewise. tmpdepfile3=$dir.libs/$base.d # Compaq CCC V6.2-504 "$@" -Wc,-MD else tmpdepfile1=$dir$base.d tmpdepfile2=$dir$base.d tmpdepfile3=$dir$base.d "$@" -MD fi stat=$? if test $stat -ne 0; then rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" exit $stat fi for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" do test -f "$tmpdepfile" && break done # Same post-processing that is required for AIX mode. aix_post_process_depfile ;; msvc7) if test "$libtool" = yes; then showIncludes=-Wc,-showIncludes else showIncludes=-showIncludes fi "$@" $showIncludes > "$tmpdepfile" stat=$? grep -v '^Note: including file: ' "$tmpdepfile" if test $stat -ne 0; then rm -f "$tmpdepfile" exit $stat fi rm -f "$depfile" echo "$object : \\" > "$depfile" # The first sed program below extracts the file names and escapes # backslashes for cygpath. The second sed program outputs the file # name when reading, but also accumulates all include files in the # hold buffer in order to output them again at the end. This only # works with sed implementations that can handle large buffers. sed < "$tmpdepfile" -n ' /^Note: including file: *\(.*\)/ { s//\1/ s/\\/\\\\/g p }' | $cygpath_u | sort -u | sed -n ' s/ /\\ /g s/\(.*\)/'"$tab"'\1 \\/p s/.\(.*\) \\/\1:/ H $ { s/.*/'"$tab"'/ G p }' >> "$depfile" echo >> "$depfile" # make sure the fragment doesn't end with a backslash rm -f "$tmpdepfile" ;; msvc7msys) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; #nosideeffect) # This comment above is used by automake to tell side-effect # dependency tracking mechanisms from slower ones. dashmstdout) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout, regardless of -o. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi # Remove '-o $object'. IFS=" " for arg do case $arg in -o) shift ;; $object) shift ;; *) set fnord "$@" "$arg" shift # fnord shift # $arg ;; esac done test -z "$dashmflag" && dashmflag=-M # Require at least two characters before searching for ':' # in the target name. This is to cope with DOS-style filenames: # a dependency such as 'c:/foo/bar' could be seen as target 'c' otherwise. "$@" $dashmflag | sed "s|^[$tab ]*[^:$tab ][^:][^:]*:[$tab ]*|$object: |" > "$tmpdepfile" rm -f "$depfile" cat < "$tmpdepfile" > "$depfile" # Some versions of the HPUX 10.20 sed can't process this sed invocation # correctly. Breaking it into two sed invocations is a workaround. tr ' ' "$nl" < "$tmpdepfile" \ | sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' \ | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; dashXmstdout) # This case only exists to satisfy depend.m4. It is never actually # run, as this mode is specially recognized in the preamble. exit 1 ;; makedepend) "$@" || exit $? # Remove any Libtool call if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi # X makedepend shift cleared=no eat=no for arg do case $cleared in no) set ""; shift cleared=yes ;; esac if test $eat = yes; then eat=no continue fi case "$arg" in -D*|-I*) set fnord "$@" "$arg"; shift ;; # Strip any option that makedepend may not understand. Remove # the object too, otherwise makedepend will parse it as a source file. -arch) eat=yes ;; -*|$object) ;; *) set fnord "$@" "$arg"; shift ;; esac done obj_suffix=`echo "$object" | sed 's/^.*\././'` touch "$tmpdepfile" ${MAKEDEPEND-makedepend} -o"$obj_suffix" -f"$tmpdepfile" "$@" rm -f "$depfile" # makedepend may prepend the VPATH from the source file name to the object. # No need to regex-escape $object, excess matching of '.' is harmless. sed "s|^.*\($object *:\)|\1|" "$tmpdepfile" > "$depfile" # Some versions of the HPUX 10.20 sed can't process the last invocation # correctly. Breaking it into two sed invocations is a workaround. sed '1,2d' "$tmpdepfile" \ | tr ' ' "$nl" \ | sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' \ | sed -e 's/$/ :/' >> "$depfile" rm -f "$tmpdepfile" "$tmpdepfile".bak ;; cpp) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi # Remove '-o $object'. IFS=" " for arg do case $arg in -o) shift ;; $object) shift ;; *) set fnord "$@" "$arg" shift # fnord shift # $arg ;; esac done "$@" -E \ | sed -n -e '/^# [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' \ -e '/^#line [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' \ | sed '$ s: \\$::' > "$tmpdepfile" rm -f "$depfile" echo "$object : \\" > "$depfile" cat < "$tmpdepfile" >> "$depfile" sed < "$tmpdepfile" '/^$/d;s/^ //;s/ \\$//;s/$/ :/' >> "$depfile" rm -f "$tmpdepfile" ;; msvisualcpp) # Important note: in order to support this mode, a compiler *must* # always write the preprocessed file to stdout. "$@" || exit $? # Remove the call to Libtool. if test "$libtool" = yes; then while test "X$1" != 'X--mode=compile'; do shift done shift fi IFS=" " for arg do case "$arg" in -o) shift ;; $object) shift ;; "-Gm"|"/Gm"|"-Gi"|"/Gi"|"-ZI"|"/ZI") set fnord "$@" shift shift ;; *) set fnord "$@" "$arg" shift shift ;; esac done "$@" -E 2>/dev/null | sed -n '/^#line [0-9][0-9]* "\([^"]*\)"/ s::\1:p' | $cygpath_u | sort -u > "$tmpdepfile" rm -f "$depfile" echo "$object : \\" > "$depfile" sed < "$tmpdepfile" -n -e 's% %\\ %g' -e '/^\(.*\)$/ s::'"$tab"'\1 \\:p' >> "$depfile" echo "$tab" >> "$depfile" sed < "$tmpdepfile" -n -e 's% %\\ %g' -e '/^\(.*\)$/ s::\1\::p' >> "$depfile" rm -f "$tmpdepfile" ;; msvcmsys) # This case exists only to let depend.m4 do its work. It works by # looking at the text of this script. This case will never be run, # since it is checked for above. exit 1 ;; none) exec "$@" ;; *) echo "Unknown depmode $depmode" 1>&2 exit 1 ;; esac exit 0 # Local Variables: # mode: shell-script # sh-indentation: 2 # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-time-zone: "UTC" # time-stamp-end: "; # UTC" # End: madp-0.4/PaxHeaders.5405/missing0000644000000000000000000000013212717644307013357 xustar0030 mtime=1463765191.893625981 30 atime=1463765193.697611573 30 ctime=1463765201.017553108 madp-0.4/missing0000755000372100037210000001533012717644307014216 0ustar00fransfrans00000000000000#! /bin/sh # Common wrapper for a few potentially missing GNU programs. scriptversion=2013-10-28.13; # UTC # Copyright (C) 1996-2013 Free Software Foundation, Inc. # Originally written by Fran,cois Pinard , 1996. # This program 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 2, or (at your option) # any later version. # This program 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 this program. If not, see . # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that program. if test $# -eq 0; then echo 1>&2 "Try '$0 --help' for more information" exit 1 fi case $1 in --is-lightweight) # Used by our autoconf macros to check whether the available missing # script is modern enough. exit 0 ;; --run) # Back-compat with the calling convention used by older automake. shift ;; -h|--h|--he|--hel|--help) echo "\ $0 [OPTION]... PROGRAM [ARGUMENT]... Run 'PROGRAM [ARGUMENT]...', returning a proper advice when this fails due to PROGRAM being missing or too old. Options: -h, --help display this help and exit -v, --version output version information and exit Supported PROGRAM values: aclocal autoconf autoheader autom4te automake makeinfo bison yacc flex lex help2man Version suffixes to PROGRAM as well as the prefixes 'gnu-', 'gnu', and 'g' are ignored when checking the name. Send bug reports to ." exit $? ;; -v|--v|--ve|--ver|--vers|--versi|--versio|--version) echo "missing $scriptversion (GNU Automake)" exit $? ;; -*) echo 1>&2 "$0: unknown '$1' option" echo 1>&2 "Try '$0 --help' for more information" exit 1 ;; esac # Run the given program, remember its exit status. "$@"; st=$? # If it succeeded, we are done. test $st -eq 0 && exit 0 # Also exit now if we it failed (or wasn't found), and '--version' was # passed; such an option is passed most likely to detect whether the # program is present and works. case $2 in --version|--help) exit $st;; esac # Exit code 63 means version mismatch. This often happens when the user # tries to use an ancient version of a tool on a file that requires a # minimum version. if test $st -eq 63; then msg="probably too old" elif test $st -eq 127; then # Program was missing. msg="missing on your system" else # Program was found and executed, but failed. Give up. exit $st fi perl_URL=http://www.perl.org/ flex_URL=http://flex.sourceforge.net/ gnu_software_URL=http://www.gnu.org/software program_details () { case $1 in aclocal|automake) echo "The '$1' program is part of the GNU Automake package:" echo "<$gnu_software_URL/automake>" echo "It also requires GNU Autoconf, GNU m4 and Perl in order to run:" echo "<$gnu_software_URL/autoconf>" echo "<$gnu_software_URL/m4/>" echo "<$perl_URL>" ;; autoconf|autom4te|autoheader) echo "The '$1' program is part of the GNU Autoconf package:" echo "<$gnu_software_URL/autoconf/>" echo "It also requires GNU m4 and Perl in order to run:" echo "<$gnu_software_URL/m4/>" echo "<$perl_URL>" ;; esac } give_advice () { # Normalize program name to check for. normalized_program=`echo "$1" | sed ' s/^gnu-//; t s/^gnu//; t s/^g//; t'` printf '%s\n' "'$1' is $msg." configure_deps="'configure.ac' or m4 files included by 'configure.ac'" case $normalized_program in autoconf*) echo "You should only need it if you modified 'configure.ac'," echo "or m4 files included by it." program_details 'autoconf' ;; autoheader*) echo "You should only need it if you modified 'acconfig.h' or" echo "$configure_deps." program_details 'autoheader' ;; automake*) echo "You should only need it if you modified 'Makefile.am' or" echo "$configure_deps." program_details 'automake' ;; aclocal*) echo "You should only need it if you modified 'acinclude.m4' or" echo "$configure_deps." program_details 'aclocal' ;; autom4te*) echo "You might have modified some maintainer files that require" echo "the 'autom4te' program to be rebuilt." program_details 'autom4te' ;; bison*|yacc*) echo "You should only need it if you modified a '.y' file." echo "You may want to install the GNU Bison package:" echo "<$gnu_software_URL/bison/>" ;; lex*|flex*) echo "You should only need it if you modified a '.l' file." echo "You may want to install the Fast Lexical Analyzer package:" echo "<$flex_URL>" ;; help2man*) echo "You should only need it if you modified a dependency" \ "of a man page." echo "You may want to install the GNU Help2man package:" echo "<$gnu_software_URL/help2man/>" ;; makeinfo*) echo "You should only need it if you modified a '.texi' file, or" echo "any other file indirectly affecting the aspect of the manual." echo "You might want to install the Texinfo package:" echo "<$gnu_software_URL/texinfo/>" echo "The spurious makeinfo call might also be the consequence of" echo "using a buggy 'make' (AIX, DU, IRIX), in which case you might" echo "want to install GNU make:" echo "<$gnu_software_URL/make/>" ;; *) echo "You might have modified some files without having the proper" echo "tools for further handling them. Check the 'README' file, it" echo "often tells you about the needed prerequisites for installing" echo "this package. You may also peek at any GNU archive site, in" echo "case some other package contains this missing '$1' program." ;; esac } give_advice "$1" | sed -e '1s/^/WARNING: /' \ -e '2,$s/^/ /' >&2 # Propagate the correct exit status (expected to be 127 for a program # not found, 63 for a program that failed due to version mismatch). exit $st # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-time-zone: "UTC" # time-stamp-end: "; # UTC" # End: madp-0.4/PaxHeaders.5405/config.sub0000644000000000000000000000013212717644307013743 xustar0030 mtime=1463765191.889626013 30 atime=1463765194.645604001 30 ctime=1463765201.013553139 madp-0.4/config.sub0000755000372100037210000010577512717644307014617 0ustar00fransfrans00000000000000#! /bin/sh # Configuration validation subroutine script. # Copyright 1992-2014 Free Software Foundation, Inc. timestamp='2014-09-11' # This file 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. # # This program 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 this program; if not, see . # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that # program. This Exception is an additional permission under section 7 # of the GNU General Public License, version 3 ("GPLv3"). # Please send patches with a ChangeLog entry to config-patches@gnu.org. # # Configuration subroutine to validate and canonicalize a configuration type. # Supply the specified configuration type as an argument. # If it is invalid, we print an error message on stderr and exit with code 1. # Otherwise, we print the canonical config type on stdout and succeed. # You can get the latest version of this script from: # http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.sub;hb=HEAD # This file is supposed to be the same for all GNU packages # and recognize all the CPU types, system types and aliases # that are meaningful with *any* GNU software. # Each package is responsible for reporting which valid configurations # it does not support. The user should be able to distinguish # a failure to support a valid configuration from a meaningless # configuration. # The goal of this file is to map all the various variations of a given # machine specification into a single specification in the form: # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM # or in some cases, the newer four-part form: # CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM # It is wrong to echo any other type of specification. me=`echo "$0" | sed -e 's,.*/,,'` usage="\ Usage: $0 [OPTION] CPU-MFR-OPSYS $0 [OPTION] ALIAS Canonicalize a configuration name. Operation modes: -h, --help print this help, then exit -t, --time-stamp print date of last modification, then exit -v, --version print version number, then exit Report bugs and patches to ." version="\ GNU config.sub ($timestamp) Copyright 1992-2014 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." help=" Try \`$me --help' for more information." # Parse command line while test $# -gt 0 ; do case $1 in --time-stamp | --time* | -t ) echo "$timestamp" ; exit ;; --version | -v ) echo "$version" ; exit ;; --help | --h* | -h ) echo "$usage"; exit ;; -- ) # Stop option processing shift; break ;; - ) # Use stdin as input. break ;; -* ) echo "$me: invalid option $1$help" exit 1 ;; *local*) # First pass through any local machine types. echo $1 exit ;; * ) break ;; esac done case $# in 0) echo "$me: missing argument$help" >&2 exit 1;; 1) ;; *) echo "$me: too many arguments$help" >&2 exit 1;; esac # Separate what the user gave into CPU-COMPANY and OS or KERNEL-OS (if any). # Here we must recognize all the valid KERNEL-OS combinations. maybe_os=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\2/'` case $maybe_os in nto-qnx* | linux-gnu* | linux-android* | linux-dietlibc | linux-newlib* | \ linux-musl* | linux-uclibc* | uclinux-uclibc* | uclinux-gnu* | kfreebsd*-gnu* | \ knetbsd*-gnu* | netbsd*-gnu* | \ kopensolaris*-gnu* | \ storm-chaos* | os2-emx* | rtmk-nova*) os=-$maybe_os basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'` ;; android-linux) os=-linux-android basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'`-unknown ;; *) basic_machine=`echo $1 | sed 's/-[^-]*$//'` if [ $basic_machine != $1 ] then os=`echo $1 | sed 's/.*-/-/'` else os=; fi ;; esac ### Let's recognize common machines as not being operating systems so ### that things like config.sub decstation-3100 work. We also ### recognize some manufacturers as not being operating systems, so we ### can provide default operating systems below. case $os in -sun*os*) # Prevent following clause from handling this invalid input. ;; -dec* | -mips* | -sequent* | -encore* | -pc532* | -sgi* | -sony* | \ -att* | -7300* | -3300* | -delta* | -motorola* | -sun[234]* | \ -unicom* | -ibm* | -next | -hp | -isi* | -apollo | -altos* | \ -convergent* | -ncr* | -news | -32* | -3600* | -3100* | -hitachi* |\ -c[123]* | -convex* | -sun | -crds | -omron* | -dg | -ultra | -tti* | \ -harris | -dolphin | -highlevel | -gould | -cbm | -ns | -masscomp | \ -apple | -axis | -knuth | -cray | -microblaze*) os= basic_machine=$1 ;; -bluegene*) os=-cnk ;; -sim | -cisco | -oki | -wec | -winbond) os= basic_machine=$1 ;; -scout) ;; -wrs) os=-vxworks basic_machine=$1 ;; -chorusos*) os=-chorusos basic_machine=$1 ;; -chorusrdb) os=-chorusrdb basic_machine=$1 ;; -hiux*) os=-hiuxwe2 ;; -sco6) os=-sco5v6 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco5) os=-sco3.2v5 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco4) os=-sco3.2v4 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco3.2.[4-9]*) os=`echo $os | sed -e 's/sco3.2./sco3.2v/'` basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco3.2v[4-9]*) # Don't forget version if it is 3.2v4 or newer. basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco5v6*) # Don't forget version if it is 3.2v4 or newer. basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -sco*) os=-sco3.2v2 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -udk*) basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -isc) os=-isc2.2 basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -clix*) basic_machine=clipper-intergraph ;; -isc*) basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` ;; -lynx*178) os=-lynxos178 ;; -lynx*5) os=-lynxos5 ;; -lynx*) os=-lynxos ;; -ptx*) basic_machine=`echo $1 | sed -e 's/86-.*/86-sequent/'` ;; -windowsnt*) os=`echo $os | sed -e 's/windowsnt/winnt/'` ;; -psos*) os=-psos ;; -mint | -mint[0-9]*) basic_machine=m68k-atari os=-mint ;; esac # Decode aliases for certain CPU-COMPANY combinations. case $basic_machine in # Recognize the basic CPU types without company name. # Some are omitted here because they have special meanings below. 1750a | 580 \ | a29k \ | aarch64 | aarch64_be \ | alpha | alphaev[4-8] | alphaev56 | alphaev6[78] | alphapca5[67] \ | alpha64 | alpha64ev[4-8] | alpha64ev56 | alpha64ev6[78] | alpha64pca5[67] \ | am33_2.0 \ | arc | arceb \ | arm | arm[bl]e | arme[lb] | armv[2-8] | armv[3-8][lb] | armv7[arm] \ | avr | avr32 \ | be32 | be64 \ | bfin \ | c4x | c8051 | clipper \ | d10v | d30v | dlx | dsp16xx \ | epiphany \ | fido | fr30 | frv \ | h8300 | h8500 | hppa | hppa1.[01] | hppa2.0 | hppa2.0[nw] | hppa64 \ | hexagon \ | i370 | i860 | i960 | ia64 \ | ip2k | iq2000 \ | k1om \ | le32 | le64 \ | lm32 \ | m32c | m32r | m32rle | m68000 | m68k | m88k \ | maxq | mb | microblaze | microblazeel | mcore | mep | metag \ | mips | mipsbe | mipseb | mipsel | mipsle \ | mips16 \ | mips64 | mips64el \ | mips64octeon | mips64octeonel \ | mips64orion | mips64orionel \ | mips64r5900 | mips64r5900el \ | mips64vr | mips64vrel \ | mips64vr4100 | mips64vr4100el \ | mips64vr4300 | mips64vr4300el \ | mips64vr5000 | mips64vr5000el \ | mips64vr5900 | mips64vr5900el \ | mipsisa32 | mipsisa32el \ | mipsisa32r2 | mipsisa32r2el \ | mipsisa32r6 | mipsisa32r6el \ | mipsisa64 | mipsisa64el \ | mipsisa64r2 | mipsisa64r2el \ | mipsisa64r6 | mipsisa64r6el \ | mipsisa64sb1 | mipsisa64sb1el \ | mipsisa64sr71k | mipsisa64sr71kel \ | mipsr5900 | mipsr5900el \ | mipstx39 | mipstx39el \ | mn10200 | mn10300 \ | moxie \ | mt \ | msp430 \ | nds32 | nds32le | nds32be \ | nios | nios2 | nios2eb | nios2el \ | ns16k | ns32k \ | open8 | or1k | or1knd | or32 \ | pdp10 | pdp11 | pj | pjl \ | powerpc | powerpc64 | powerpc64le | powerpcle \ | pyramid \ | riscv32 | riscv64 \ | rl78 | rx \ | score \ | sh | sh[1234] | sh[24]a | sh[24]aeb | sh[23]e | sh[34]eb | sheb | shbe | shle | sh[1234]le | sh3ele \ | sh64 | sh64le \ | sparc | sparc64 | sparc64b | sparc64v | sparc86x | sparclet | sparclite \ | sparcv8 | sparcv9 | sparcv9b | sparcv9v \ | spu \ | tahoe | tic4x | tic54x | tic55x | tic6x | tic80 | tron \ | ubicom32 \ | v850 | v850e | v850e1 | v850e2 | v850es | v850e2v3 \ | we32k \ | x86 | xc16x | xstormy16 | xtensa \ | z8k | z80) basic_machine=$basic_machine-unknown ;; c54x) basic_machine=tic54x-unknown ;; c55x) basic_machine=tic55x-unknown ;; c6x) basic_machine=tic6x-unknown ;; m6811 | m68hc11 | m6812 | m68hc12 | m68hcs12x | nvptx | picochip) basic_machine=$basic_machine-unknown os=-none ;; m88110 | m680[12346]0 | m683?2 | m68360 | m5200 | v70 | w65 | z8k) ;; ms1) basic_machine=mt-unknown ;; strongarm | thumb | xscale) basic_machine=arm-unknown ;; xgate) basic_machine=$basic_machine-unknown os=-none ;; xscaleeb) basic_machine=armeb-unknown ;; xscaleel) basic_machine=armel-unknown ;; # We use `pc' rather than `unknown' # because (1) that's what they normally are, and # (2) the word "unknown" tends to confuse beginning users. i*86 | x86_64) basic_machine=$basic_machine-pc ;; # Object if more than one company name word. *-*-*) echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 exit 1 ;; # Recognize the basic CPU types with company name. 580-* \ | a29k-* \ | aarch64-* | aarch64_be-* \ | alpha-* | alphaev[4-8]-* | alphaev56-* | alphaev6[78]-* \ | alpha64-* | alpha64ev[4-8]-* | alpha64ev56-* | alpha64ev6[78]-* \ | alphapca5[67]-* | alpha64pca5[67]-* | arc-* | arceb-* \ | arm-* | armbe-* | armle-* | armeb-* | armv*-* \ | avr-* | avr32-* \ | be32-* | be64-* \ | bfin-* | bs2000-* \ | c[123]* | c30-* | [cjt]90-* | c4x-* \ | c8051-* | clipper-* | craynv-* | cydra-* \ | d10v-* | d30v-* | dlx-* \ | elxsi-* \ | f30[01]-* | f700-* | fido-* | fr30-* | frv-* | fx80-* \ | h8300-* | h8500-* \ | hppa-* | hppa1.[01]-* | hppa2.0-* | hppa2.0[nw]-* | hppa64-* \ | hexagon-* \ | i*86-* | i860-* | i960-* | ia64-* \ | ip2k-* | iq2000-* \ | k1om-* \ | le32-* | le64-* \ | lm32-* \ | m32c-* | m32r-* | m32rle-* \ | m68000-* | m680[012346]0-* | m68360-* | m683?2-* | m68k-* \ | m88110-* | m88k-* | maxq-* | mcore-* | metag-* \ | microblaze-* | microblazeel-* \ | mips-* | mipsbe-* | mipseb-* | mipsel-* | mipsle-* \ | mips16-* \ | mips64-* | mips64el-* \ | mips64octeon-* | mips64octeonel-* \ | mips64orion-* | mips64orionel-* \ | mips64r5900-* | mips64r5900el-* \ | mips64vr-* | mips64vrel-* \ | mips64vr4100-* | mips64vr4100el-* \ | mips64vr4300-* | mips64vr4300el-* \ | mips64vr5000-* | mips64vr5000el-* \ | mips64vr5900-* | mips64vr5900el-* \ | mipsisa32-* | mipsisa32el-* \ | mipsisa32r2-* | mipsisa32r2el-* \ | mipsisa32r6-* | mipsisa32r6el-* \ | mipsisa64-* | mipsisa64el-* \ | mipsisa64r2-* | mipsisa64r2el-* \ | mipsisa64r6-* | mipsisa64r6el-* \ | mipsisa64sb1-* | mipsisa64sb1el-* \ | mipsisa64sr71k-* | mipsisa64sr71kel-* \ | mipsr5900-* | mipsr5900el-* \ | mipstx39-* | mipstx39el-* \ | mmix-* \ | mt-* \ | msp430-* \ | nds32-* | nds32le-* | nds32be-* \ | nios-* | nios2-* | nios2eb-* | nios2el-* \ | none-* | np1-* | ns16k-* | ns32k-* \ | open8-* \ | or1k*-* \ | orion-* \ | pdp10-* | pdp11-* | pj-* | pjl-* | pn-* | power-* \ | powerpc-* | powerpc64-* | powerpc64le-* | powerpcle-* \ | pyramid-* \ | rl78-* | romp-* | rs6000-* | rx-* \ | sh-* | sh[1234]-* | sh[24]a-* | sh[24]aeb-* | sh[23]e-* | sh[34]eb-* | sheb-* | shbe-* \ | shle-* | sh[1234]le-* | sh3ele-* | sh64-* | sh64le-* \ | sparc-* | sparc64-* | sparc64b-* | sparc64v-* | sparc86x-* | sparclet-* \ | sparclite-* \ | sparcv8-* | sparcv9-* | sparcv9b-* | sparcv9v-* | sv1-* | sx?-* \ | tahoe-* \ | tic30-* | tic4x-* | tic54x-* | tic55x-* | tic6x-* | tic80-* \ | tile*-* \ | tron-* \ | ubicom32-* \ | v850-* | v850e-* | v850e1-* | v850es-* | v850e2-* | v850e2v3-* \ | vax-* \ | we32k-* \ | x86-* | x86_64-* | xc16x-* | xps100-* \ | xstormy16-* | xtensa*-* \ | ymp-* \ | z8k-* | z80-*) ;; # Recognize the basic CPU types without company name, with glob match. xtensa*) basic_machine=$basic_machine-unknown ;; # Recognize the various machine names and aliases which stand # for a CPU type and a company and sometimes even an OS. 386bsd) basic_machine=i386-unknown os=-bsd ;; 3b1 | 7300 | 7300-att | att-7300 | pc7300 | safari | unixpc) basic_machine=m68000-att ;; 3b*) basic_machine=we32k-att ;; a29khif) basic_machine=a29k-amd os=-udi ;; abacus) basic_machine=abacus-unknown ;; adobe68k) basic_machine=m68010-adobe os=-scout ;; alliant | fx80) basic_machine=fx80-alliant ;; altos | altos3068) basic_machine=m68k-altos ;; am29k) basic_machine=a29k-none os=-bsd ;; amd64) basic_machine=x86_64-pc ;; amd64-*) basic_machine=x86_64-`echo $basic_machine | sed 's/^[^-]*-//'` ;; amdahl) basic_machine=580-amdahl os=-sysv ;; amiga | amiga-*) basic_machine=m68k-unknown ;; amigaos | amigados) basic_machine=m68k-unknown os=-amigaos ;; amigaunix | amix) basic_machine=m68k-unknown os=-sysv4 ;; apollo68) basic_machine=m68k-apollo os=-sysv ;; apollo68bsd) basic_machine=m68k-apollo os=-bsd ;; aros) basic_machine=i386-pc os=-aros ;; aux) basic_machine=m68k-apple os=-aux ;; balance) basic_machine=ns32k-sequent os=-dynix ;; blackfin) basic_machine=bfin-unknown os=-linux ;; blackfin-*) basic_machine=bfin-`echo $basic_machine | sed 's/^[^-]*-//'` os=-linux ;; bluegene*) basic_machine=powerpc-ibm os=-cnk ;; c54x-*) basic_machine=tic54x-`echo $basic_machine | sed 's/^[^-]*-//'` ;; c55x-*) basic_machine=tic55x-`echo $basic_machine | sed 's/^[^-]*-//'` ;; c6x-*) basic_machine=tic6x-`echo $basic_machine | sed 's/^[^-]*-//'` ;; c90) basic_machine=c90-cray os=-unicos ;; cegcc) basic_machine=arm-unknown os=-cegcc ;; convex-c1) basic_machine=c1-convex os=-bsd ;; convex-c2) basic_machine=c2-convex os=-bsd ;; convex-c32) basic_machine=c32-convex os=-bsd ;; convex-c34) basic_machine=c34-convex os=-bsd ;; convex-c38) basic_machine=c38-convex os=-bsd ;; cray | j90) basic_machine=j90-cray os=-unicos ;; craynv) basic_machine=craynv-cray os=-unicosmp ;; cr16 | cr16-*) basic_machine=cr16-unknown os=-elf ;; crds | unos) basic_machine=m68k-crds ;; crisv32 | crisv32-* | etraxfs*) basic_machine=crisv32-axis ;; cris | cris-* | etrax*) basic_machine=cris-axis ;; crx) basic_machine=crx-unknown os=-elf ;; da30 | da30-*) basic_machine=m68k-da30 ;; decstation | decstation-3100 | pmax | pmax-* | pmin | dec3100 | decstatn) basic_machine=mips-dec ;; decsystem10* | dec10*) basic_machine=pdp10-dec os=-tops10 ;; decsystem20* | dec20*) basic_machine=pdp10-dec os=-tops20 ;; delta | 3300 | motorola-3300 | motorola-delta \ | 3300-motorola | delta-motorola) basic_machine=m68k-motorola ;; delta88) basic_machine=m88k-motorola os=-sysv3 ;; dicos) basic_machine=i686-pc os=-dicos ;; djgpp) basic_machine=i586-pc os=-msdosdjgpp ;; dpx20 | dpx20-*) basic_machine=rs6000-bull os=-bosx ;; dpx2* | dpx2*-bull) basic_machine=m68k-bull os=-sysv3 ;; ebmon29k) basic_machine=a29k-amd os=-ebmon ;; elxsi) basic_machine=elxsi-elxsi os=-bsd ;; encore | umax | mmax) basic_machine=ns32k-encore ;; es1800 | OSE68k | ose68k | ose | OSE) basic_machine=m68k-ericsson os=-ose ;; fx2800) basic_machine=i860-alliant ;; genix) basic_machine=ns32k-ns ;; gmicro) basic_machine=tron-gmicro os=-sysv ;; go32) basic_machine=i386-pc os=-go32 ;; h3050r* | hiux*) basic_machine=hppa1.1-hitachi os=-hiuxwe2 ;; h8300hms) basic_machine=h8300-hitachi os=-hms ;; h8300xray) basic_machine=h8300-hitachi os=-xray ;; h8500hms) basic_machine=h8500-hitachi os=-hms ;; harris) basic_machine=m88k-harris os=-sysv3 ;; hp300-*) basic_machine=m68k-hp ;; hp300bsd) basic_machine=m68k-hp os=-bsd ;; hp300hpux) basic_machine=m68k-hp os=-hpux ;; hp3k9[0-9][0-9] | hp9[0-9][0-9]) basic_machine=hppa1.0-hp ;; hp9k2[0-9][0-9] | hp9k31[0-9]) basic_machine=m68000-hp ;; hp9k3[2-9][0-9]) basic_machine=m68k-hp ;; hp9k6[0-9][0-9] | hp6[0-9][0-9]) basic_machine=hppa1.0-hp ;; hp9k7[0-79][0-9] | hp7[0-79][0-9]) basic_machine=hppa1.1-hp ;; hp9k78[0-9] | hp78[0-9]) # FIXME: really hppa2.0-hp basic_machine=hppa1.1-hp ;; hp9k8[67]1 | hp8[67]1 | hp9k80[24] | hp80[24] | hp9k8[78]9 | hp8[78]9 | hp9k893 | hp893) # FIXME: really hppa2.0-hp basic_machine=hppa1.1-hp ;; hp9k8[0-9][13679] | hp8[0-9][13679]) basic_machine=hppa1.1-hp ;; hp9k8[0-9][0-9] | hp8[0-9][0-9]) basic_machine=hppa1.0-hp ;; hppa-next) os=-nextstep3 ;; hppaosf) basic_machine=hppa1.1-hp os=-osf ;; hppro) basic_machine=hppa1.1-hp os=-proelf ;; i370-ibm* | ibm*) basic_machine=i370-ibm ;; i*86v32) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv32 ;; i*86v4*) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv4 ;; i*86v) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-sysv ;; i*86sol2) basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` os=-solaris2 ;; i386mach) basic_machine=i386-mach os=-mach ;; i386-vsta | vsta) basic_machine=i386-unknown os=-vsta ;; iris | iris4d) basic_machine=mips-sgi case $os in -irix*) ;; *) os=-irix4 ;; esac ;; isi68 | isi) basic_machine=m68k-isi os=-sysv ;; m68knommu) basic_machine=m68k-unknown os=-linux ;; m68knommu-*) basic_machine=m68k-`echo $basic_machine | sed 's/^[^-]*-//'` os=-linux ;; m88k-omron*) basic_machine=m88k-omron ;; magnum | m3230) basic_machine=mips-mips os=-sysv ;; merlin) basic_machine=ns32k-utek os=-sysv ;; microblaze*) basic_machine=microblaze-xilinx ;; mingw64) basic_machine=x86_64-pc os=-mingw64 ;; mingw32) basic_machine=i686-pc os=-mingw32 ;; mingw32ce) basic_machine=arm-unknown os=-mingw32ce ;; miniframe) basic_machine=m68000-convergent ;; *mint | -mint[0-9]* | *MiNT | *MiNT[0-9]*) basic_machine=m68k-atari os=-mint ;; mips3*-*) basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'` ;; mips3*) basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'`-unknown ;; monitor) basic_machine=m68k-rom68k os=-coff ;; morphos) basic_machine=powerpc-unknown os=-morphos ;; moxiebox) basic_machine=moxie-unknown os=-moxiebox ;; msdos) basic_machine=i386-pc os=-msdos ;; ms1-*) basic_machine=`echo $basic_machine | sed -e 's/ms1-/mt-/'` ;; msys) basic_machine=i686-pc os=-msys ;; mvs) basic_machine=i370-ibm os=-mvs ;; nacl) basic_machine=le32-unknown os=-nacl ;; ncr3000) basic_machine=i486-ncr os=-sysv4 ;; netbsd386) basic_machine=i386-unknown os=-netbsd ;; netwinder) basic_machine=armv4l-rebel os=-linux ;; news | news700 | news800 | news900) basic_machine=m68k-sony os=-newsos ;; news1000) basic_machine=m68030-sony os=-newsos ;; news-3600 | risc-news) basic_machine=mips-sony os=-newsos ;; necv70) basic_machine=v70-nec os=-sysv ;; next | m*-next ) basic_machine=m68k-next case $os in -nextstep* ) ;; -ns2*) os=-nextstep2 ;; *) os=-nextstep3 ;; esac ;; nh3000) basic_machine=m68k-harris os=-cxux ;; nh[45]000) basic_machine=m88k-harris os=-cxux ;; nindy960) basic_machine=i960-intel os=-nindy ;; mon960) basic_machine=i960-intel os=-mon960 ;; nonstopux) basic_machine=mips-compaq os=-nonstopux ;; np1) basic_machine=np1-gould ;; neo-tandem) basic_machine=neo-tandem ;; nse-tandem) basic_machine=nse-tandem ;; nsr-tandem) basic_machine=nsr-tandem ;; op50n-* | op60c-*) basic_machine=hppa1.1-oki os=-proelf ;; openrisc | openrisc-*) basic_machine=or32-unknown ;; os400) basic_machine=powerpc-ibm os=-os400 ;; OSE68000 | ose68000) basic_machine=m68000-ericsson os=-ose ;; os68k) basic_machine=m68k-none os=-os68k ;; pa-hitachi) basic_machine=hppa1.1-hitachi os=-hiuxwe2 ;; paragon) basic_machine=i860-intel os=-osf ;; parisc) basic_machine=hppa-unknown os=-linux ;; parisc-*) basic_machine=hppa-`echo $basic_machine | sed 's/^[^-]*-//'` os=-linux ;; pbd) basic_machine=sparc-tti ;; pbb) basic_machine=m68k-tti ;; pc532 | pc532-*) basic_machine=ns32k-pc532 ;; pc98) basic_machine=i386-pc ;; pc98-*) basic_machine=i386-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentium | p5 | k5 | k6 | nexgen | viac3) basic_machine=i586-pc ;; pentiumpro | p6 | 6x86 | athlon | athlon_*) basic_machine=i686-pc ;; pentiumii | pentium2 | pentiumiii | pentium3) basic_machine=i686-pc ;; pentium4) basic_machine=i786-pc ;; pentium-* | p5-* | k5-* | k6-* | nexgen-* | viac3-*) basic_machine=i586-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentiumpro-* | p6-* | 6x86-* | athlon-*) basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentiumii-* | pentium2-* | pentiumiii-* | pentium3-*) basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pentium4-*) basic_machine=i786-`echo $basic_machine | sed 's/^[^-]*-//'` ;; pn) basic_machine=pn-gould ;; power) basic_machine=power-ibm ;; ppc | ppcbe) basic_machine=powerpc-unknown ;; ppc-* | ppcbe-*) basic_machine=powerpc-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppcle | powerpclittle | ppc-le | powerpc-little) basic_machine=powerpcle-unknown ;; ppcle-* | powerpclittle-*) basic_machine=powerpcle-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppc64) basic_machine=powerpc64-unknown ;; ppc64-*) basic_machine=powerpc64-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ppc64le | powerpc64little | ppc64-le | powerpc64-little) basic_machine=powerpc64le-unknown ;; ppc64le-* | powerpc64little-*) basic_machine=powerpc64le-`echo $basic_machine | sed 's/^[^-]*-//'` ;; ps2) basic_machine=i386-ibm ;; pw32) basic_machine=i586-unknown os=-pw32 ;; rdos | rdos64) basic_machine=x86_64-pc os=-rdos ;; rdos32) basic_machine=i386-pc os=-rdos ;; rom68k) basic_machine=m68k-rom68k os=-coff ;; rm[46]00) basic_machine=mips-siemens ;; rtpc | rtpc-*) basic_machine=romp-ibm ;; s390 | s390-*) basic_machine=s390-ibm ;; s390x | s390x-*) basic_machine=s390x-ibm ;; sa29200) basic_machine=a29k-amd os=-udi ;; sb1) basic_machine=mipsisa64sb1-unknown ;; sb1el) basic_machine=mipsisa64sb1el-unknown ;; sde) basic_machine=mipsisa32-sde os=-elf ;; sei) basic_machine=mips-sei os=-seiux ;; sequent) basic_machine=i386-sequent ;; sh) basic_machine=sh-hitachi os=-hms ;; sh5el) basic_machine=sh5le-unknown ;; sh64) basic_machine=sh64-unknown ;; sparclite-wrs | simso-wrs) basic_machine=sparclite-wrs os=-vxworks ;; sps7) basic_machine=m68k-bull os=-sysv2 ;; spur) basic_machine=spur-unknown ;; st2000) basic_machine=m68k-tandem ;; stratus) basic_machine=i860-stratus os=-sysv4 ;; strongarm-* | thumb-*) basic_machine=arm-`echo $basic_machine | sed 's/^[^-]*-//'` ;; sun2) basic_machine=m68000-sun ;; sun2os3) basic_machine=m68000-sun os=-sunos3 ;; sun2os4) basic_machine=m68000-sun os=-sunos4 ;; sun3os3) basic_machine=m68k-sun os=-sunos3 ;; sun3os4) basic_machine=m68k-sun os=-sunos4 ;; sun4os3) basic_machine=sparc-sun os=-sunos3 ;; sun4os4) basic_machine=sparc-sun os=-sunos4 ;; sun4sol2) basic_machine=sparc-sun os=-solaris2 ;; sun3 | sun3-*) basic_machine=m68k-sun ;; sun4) basic_machine=sparc-sun ;; sun386 | sun386i | roadrunner) basic_machine=i386-sun ;; sv1) basic_machine=sv1-cray os=-unicos ;; symmetry) basic_machine=i386-sequent os=-dynix ;; t3e) basic_machine=alphaev5-cray os=-unicos ;; t90) basic_machine=t90-cray os=-unicos ;; tile*) basic_machine=$basic_machine-unknown os=-linux-gnu ;; tx39) basic_machine=mipstx39-unknown ;; tx39el) basic_machine=mipstx39el-unknown ;; toad1) basic_machine=pdp10-xkl os=-tops20 ;; tower | tower-32) basic_machine=m68k-ncr ;; tpf) basic_machine=s390x-ibm os=-tpf ;; udi29k) basic_machine=a29k-amd os=-udi ;; ultra3) basic_machine=a29k-nyu os=-sym1 ;; v810 | necv810) basic_machine=v810-nec os=-none ;; vaxv) basic_machine=vax-dec os=-sysv ;; vms) basic_machine=vax-dec os=-vms ;; vpp*|vx|vx-*) basic_machine=f301-fujitsu ;; vxworks960) basic_machine=i960-wrs os=-vxworks ;; vxworks68) basic_machine=m68k-wrs os=-vxworks ;; vxworks29k) basic_machine=a29k-wrs os=-vxworks ;; w65*) basic_machine=w65-wdc os=-none ;; w89k-*) basic_machine=hppa1.1-winbond os=-proelf ;; xbox) basic_machine=i686-pc os=-mingw32 ;; xps | xps100) basic_machine=xps100-honeywell ;; xscale-* | xscalee[bl]-*) basic_machine=`echo $basic_machine | sed 's/^xscale/arm/'` ;; ymp) basic_machine=ymp-cray os=-unicos ;; z8k-*-coff) basic_machine=z8k-unknown os=-sim ;; z80-*-coff) basic_machine=z80-unknown os=-sim ;; none) basic_machine=none-none os=-none ;; # Here we handle the default manufacturer of certain CPU types. It is in # some cases the only manufacturer, in others, it is the most popular. w89k) basic_machine=hppa1.1-winbond ;; op50n) basic_machine=hppa1.1-oki ;; op60c) basic_machine=hppa1.1-oki ;; romp) basic_machine=romp-ibm ;; mmix) basic_machine=mmix-knuth ;; rs6000) basic_machine=rs6000-ibm ;; vax) basic_machine=vax-dec ;; pdp10) # there are many clones, so DEC is not a safe bet basic_machine=pdp10-unknown ;; pdp11) basic_machine=pdp11-dec ;; we32k) basic_machine=we32k-att ;; sh[1234] | sh[24]a | sh[24]aeb | sh[34]eb | sh[1234]le | sh[23]ele) basic_machine=sh-unknown ;; sparc | sparcv8 | sparcv9 | sparcv9b | sparcv9v) basic_machine=sparc-sun ;; cydra) basic_machine=cydra-cydrome ;; orion) basic_machine=orion-highlevel ;; orion105) basic_machine=clipper-highlevel ;; mac | mpw | mac-mpw) basic_machine=m68k-apple ;; pmac | pmac-mpw) basic_machine=powerpc-apple ;; *-unknown) # Make sure to match an already-canonicalized machine name. ;; *) echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 exit 1 ;; esac # Here we canonicalize certain aliases for manufacturers. case $basic_machine in *-digital*) basic_machine=`echo $basic_machine | sed 's/digital.*/dec/'` ;; *-commodore*) basic_machine=`echo $basic_machine | sed 's/commodore.*/cbm/'` ;; *) ;; esac # Decode manufacturer-specific aliases for certain operating systems. if [ x"$os" != x"" ] then case $os in # First match some system type aliases # that might get confused with valid system types. # -solaris* is a basic system type, with this one exception. -auroraux) os=-auroraux ;; -solaris1 | -solaris1.*) os=`echo $os | sed -e 's|solaris1|sunos4|'` ;; -solaris) os=-solaris2 ;; -svr4*) os=-sysv4 ;; -unixware*) os=-sysv4.2uw ;; -gnu/linux*) os=`echo $os | sed -e 's|gnu/linux|linux-gnu|'` ;; # First accept the basic system types. # The portable systems comes first. # Each alternative MUST END IN A *, to match a version number. # -sysv* is not here because it comes later, after sysvr4. -gnu* | -bsd* | -mach* | -minix* | -genix* | -ultrix* | -irix* \ | -*vms* | -sco* | -esix* | -isc* | -aix* | -cnk* | -sunos | -sunos[34]*\ | -hpux* | -unos* | -osf* | -luna* | -dgux* | -auroraux* | -solaris* \ | -sym* | -kopensolaris* | -plan9* \ | -amigaos* | -amigados* | -msdos* | -newsos* | -unicos* | -aof* \ | -aos* | -aros* \ | -nindy* | -vxsim* | -vxworks* | -ebmon* | -hms* | -mvs* \ | -clix* | -riscos* | -uniplus* | -iris* | -rtu* | -xenix* \ | -hiux* | -386bsd* | -knetbsd* | -mirbsd* | -netbsd* \ | -bitrig* | -openbsd* | -solidbsd* \ | -ekkobsd* | -kfreebsd* | -freebsd* | -riscix* | -lynxos* \ | -bosx* | -nextstep* | -cxux* | -aout* | -elf* | -oabi* \ | -ptx* | -coff* | -ecoff* | -winnt* | -domain* | -vsta* \ | -udi* | -eabi* | -lites* | -ieee* | -go32* | -aux* \ | -chorusos* | -chorusrdb* | -cegcc* \ | -cygwin* | -msys* | -pe* | -psos* | -moss* | -proelf* | -rtems* \ | -mingw32* | -mingw64* | -linux-gnu* | -linux-android* \ | -linux-newlib* | -linux-musl* | -linux-uclibc* \ | -uxpv* | -beos* | -mpeix* | -udk* | -moxiebox* \ | -interix* | -uwin* | -mks* | -rhapsody* | -darwin* | -opened* \ | -openstep* | -oskit* | -conix* | -pw32* | -nonstopux* \ | -storm-chaos* | -tops10* | -tenex* | -tops20* | -its* \ | -os2* | -vos* | -palmos* | -uclinux* | -nucleus* \ | -morphos* | -superux* | -rtmk* | -rtmk-nova* | -windiss* \ | -powermax* | -dnix* | -nx6 | -nx7 | -sei* | -dragonfly* \ | -skyos* | -haiku* | -rdos* | -toppers* | -drops* | -es* | -tirtos*) # Remember, each alternative MUST END IN *, to match a version number. ;; -qnx*) case $basic_machine in x86-* | i*86-*) ;; *) os=-nto$os ;; esac ;; -nto-qnx*) ;; -nto*) os=`echo $os | sed -e 's|nto|nto-qnx|'` ;; -sim | -es1800* | -hms* | -xray | -os68k* | -none* | -v88r* \ | -windows* | -osx | -abug | -netware* | -os9* | -beos* | -haiku* \ | -macos* | -mpw* | -magic* | -mmixware* | -mon960* | -lnews*) ;; -mac*) os=`echo $os | sed -e 's|mac|macos|'` ;; -linux-dietlibc) os=-linux-dietlibc ;; -linux*) os=`echo $os | sed -e 's|linux|linux-gnu|'` ;; -sunos5*) os=`echo $os | sed -e 's|sunos5|solaris2|'` ;; -sunos6*) os=`echo $os | sed -e 's|sunos6|solaris3|'` ;; -opened*) os=-openedition ;; -os400*) os=-os400 ;; -wince*) os=-wince ;; -osfrose*) os=-osfrose ;; -osf*) os=-osf ;; -utek*) os=-bsd ;; -dynix*) os=-bsd ;; -acis*) os=-aos ;; -atheos*) os=-atheos ;; -syllable*) os=-syllable ;; -386bsd) os=-bsd ;; -ctix* | -uts*) os=-sysv ;; -nova*) os=-rtmk-nova ;; -ns2 ) os=-nextstep2 ;; -nsk*) os=-nsk ;; # Preserve the version number of sinix5. -sinix5.*) os=`echo $os | sed -e 's|sinix|sysv|'` ;; -sinix*) os=-sysv4 ;; -tpf*) os=-tpf ;; -triton*) os=-sysv3 ;; -oss*) os=-sysv3 ;; -svr4) os=-sysv4 ;; -svr3) os=-sysv3 ;; -sysvr4) os=-sysv4 ;; # This must come after -sysvr4. -sysv*) ;; -ose*) os=-ose ;; -es1800*) os=-ose ;; -xenix) os=-xenix ;; -*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*) os=-mint ;; -aros*) os=-aros ;; -zvmoe) os=-zvmoe ;; -dicos*) os=-dicos ;; -nacl*) ;; -none) ;; *) # Get rid of the `-' at the beginning of $os. os=`echo $os | sed 's/[^-]*-//'` echo Invalid configuration \`$1\': system \`$os\' not recognized 1>&2 exit 1 ;; esac else # Here we handle the default operating systems that come with various machines. # The value should be what the vendor currently ships out the door with their # machine or put another way, the most popular os provided with the machine. # Note that if you're going to try to match "-MANUFACTURER" here (say, # "-sun"), then you have to tell the case statement up towards the top # that MANUFACTURER isn't an operating system. Otherwise, code above # will signal an error saying that MANUFACTURER isn't an operating # system, and we'll never get to this point. case $basic_machine in score-*) os=-elf ;; spu-*) os=-elf ;; *-acorn) os=-riscix1.2 ;; arm*-rebel) os=-linux ;; arm*-semi) os=-aout ;; c4x-* | tic4x-*) os=-coff ;; c8051-*) os=-elf ;; hexagon-*) os=-elf ;; tic54x-*) os=-coff ;; tic55x-*) os=-coff ;; tic6x-*) os=-coff ;; # This must come before the *-dec entry. pdp10-*) os=-tops20 ;; pdp11-*) os=-none ;; *-dec | vax-*) os=-ultrix4.2 ;; m68*-apollo) os=-domain ;; i386-sun) os=-sunos4.0.2 ;; m68000-sun) os=-sunos3 ;; m68*-cisco) os=-aout ;; mep-*) os=-elf ;; mips*-cisco) os=-elf ;; mips*-*) os=-elf ;; or32-*) os=-coff ;; *-tti) # must be before sparc entry or we get the wrong os. os=-sysv3 ;; sparc-* | *-sun) os=-sunos4.1.1 ;; *-be) os=-beos ;; *-haiku) os=-haiku ;; *-ibm) os=-aix ;; *-knuth) os=-mmixware ;; *-wec) os=-proelf ;; *-winbond) os=-proelf ;; *-oki) os=-proelf ;; *-hp) os=-hpux ;; *-hitachi) os=-hiux ;; i860-* | *-att | *-ncr | *-altos | *-motorola | *-convergent) os=-sysv ;; *-cbm) os=-amigaos ;; *-dg) os=-dgux ;; *-dolphin) os=-sysv3 ;; m68k-ccur) os=-rtu ;; m88k-omron*) os=-luna ;; *-next ) os=-nextstep ;; *-sequent) os=-ptx ;; *-crds) os=-unos ;; *-ns) os=-genix ;; i370-*) os=-mvs ;; *-next) os=-nextstep3 ;; *-gould) os=-sysv ;; *-highlevel) os=-bsd ;; *-encore) os=-bsd ;; *-sgi) os=-irix ;; *-siemens) os=-sysv4 ;; *-masscomp) os=-rtu ;; f30[01]-fujitsu | f700-fujitsu) os=-uxpv ;; *-rom68k) os=-coff ;; *-*bug) os=-coff ;; *-apple) os=-macos ;; *-atari*) os=-mint ;; *) os=-none ;; esac fi # Here we handle the case where we know the os, and the CPU type, but not the # manufacturer. We pick the logical manufacturer. vendor=unknown case $basic_machine in *-unknown) case $os in -riscix*) vendor=acorn ;; -sunos*) vendor=sun ;; -cnk*|-aix*) vendor=ibm ;; -beos*) vendor=be ;; -hpux*) vendor=hp ;; -mpeix*) vendor=hp ;; -hiux*) vendor=hitachi ;; -unos*) vendor=crds ;; -dgux*) vendor=dg ;; -luna*) vendor=omron ;; -genix*) vendor=ns ;; -mvs* | -opened*) vendor=ibm ;; -os400*) vendor=ibm ;; -ptx*) vendor=sequent ;; -tpf*) vendor=ibm ;; -vxsim* | -vxworks* | -windiss*) vendor=wrs ;; -aux*) vendor=apple ;; -hms*) vendor=hitachi ;; -mpw* | -macos*) vendor=apple ;; -*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*) vendor=atari ;; -vos*) vendor=stratus ;; esac basic_machine=`echo $basic_machine | sed "s/unknown/$vendor/"` ;; esac echo $basic_machine$os exit # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "timestamp='" # time-stamp-format: "%:y-%02m-%02d" # time-stamp-end: "'" # End: madp-0.4/PaxHeaders.5405/ltmain.sh0000644000000000000000000000013212717644303013577 xustar0030 mtime=1463765187.061664572 30 atime=1463765200.793554896 30 ctime=1463765201.017553108 madp-0.4/ltmain.sh0000644000372100037210000105203012717644303014432 0ustar00fransfrans00000000000000 # libtool (GNU libtool) 2.4.2 # Written by Gordon Matzigkeit , 1996 # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, 2006, # 2007, 2008, 2009, 2010, 2011 Free Software Foundation, Inc. # This is free software; see the source for copying conditions. There is NO # warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. # GNU Libtool 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 2 of the License, or # (at your option) any later version. # # As a special exception to the GNU General Public License, # if you distribute this file as part of a program or library that # is built using GNU Libtool, you may include this file under the # same distribution terms that you use for the rest of that program. # # GNU Libtool 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 GNU Libtool; see the file COPYING. If not, a copy # can be downloaded from http://www.gnu.org/licenses/gpl.html, # or obtained by writing to the Free Software Foundation, Inc., # 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. # Usage: $progname [OPTION]... [MODE-ARG]... # # Provide generalized library-building support services. # # --config show all configuration variables # --debug enable verbose shell tracing # -n, --dry-run display commands without modifying any files # --features display basic configuration information and exit # --mode=MODE use operation mode MODE # --preserve-dup-deps don't remove duplicate dependency libraries # --quiet, --silent don't print informational messages # --no-quiet, --no-silent # print informational messages (default) # --no-warn don't display warning messages # --tag=TAG use configuration variables from tag TAG # -v, --verbose print more informational messages than default # --no-verbose don't print the extra informational messages # --version print version information # -h, --help, --help-all print short, long, or detailed help message # # MODE must be one of the following: # # clean remove files from the build directory # compile compile a source file into a libtool object # execute automatically set library path, then run a program # finish complete the installation of libtool libraries # install install libraries or executables # link create a library or an executable # uninstall remove libraries from an installed directory # # MODE-ARGS vary depending on the MODE. When passed as first option, # `--mode=MODE' may be abbreviated as `MODE' or a unique abbreviation of that. # Try `$progname --help --mode=MODE' for a more detailed description of MODE. # # When reporting a bug, please describe a test case to reproduce it and # include the following information: # # host-triplet: $host # shell: $SHELL # compiler: $LTCC # compiler flags: $LTCFLAGS # linker: $LD (gnu? $with_gnu_ld) # $progname: (GNU libtool) 2.4.2 Debian-2.4.2-1.11 # automake: $automake_version # autoconf: $autoconf_version # # Report bugs to . # GNU libtool home page: . # General help using GNU software: . PROGRAM=libtool PACKAGE=libtool VERSION="2.4.2 Debian-2.4.2-1.11" TIMESTAMP="" package_revision=1.3337 # Be Bourne compatible if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then emulate sh NULLCMD=: # Zsh 3.x and 4.x performs word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in *posix*) set -o posix;; esac fi BIN_SH=xpg4; export BIN_SH # for Tru64 DUALCASE=1; export DUALCASE # for MKS sh # A function that is used when there is no print builtin or printf. func_fallback_echo () { eval 'cat <<_LTECHO_EOF $1 _LTECHO_EOF' } # NLS nuisances: We save the old values to restore during execute mode. lt_user_locale= lt_safe_locale= for lt_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES do eval "if test \"\${$lt_var+set}\" = set; then save_$lt_var=\$$lt_var $lt_var=C export $lt_var lt_user_locale=\"$lt_var=\\\$save_\$lt_var; \$lt_user_locale\" lt_safe_locale=\"$lt_var=C; \$lt_safe_locale\" fi" done LC_ALL=C LANGUAGE=C export LANGUAGE LC_ALL $lt_unset CDPATH # Work around backward compatibility issue on IRIX 6.5. On IRIX 6.4+, sh # is ksh but when the shell is invoked as "sh" and the current value of # the _XPG environment variable is not equal to 1 (one), the special # positional parameter $0, within a function call, is the name of the # function. progpath="$0" : ${CP="cp -f"} test "${ECHO+set}" = set || ECHO=${as_echo-'printf %s\n'} : ${MAKE="make"} : ${MKDIR="mkdir"} : ${MV="mv -f"} : ${RM="rm -f"} : ${SHELL="${CONFIG_SHELL-/bin/sh}"} : ${Xsed="$SED -e 1s/^X//"} # Global variables: EXIT_SUCCESS=0 EXIT_FAILURE=1 EXIT_MISMATCH=63 # $? = 63 is used to indicate version mismatch to missing. EXIT_SKIP=77 # $? = 77 is used to indicate a skipped test to automake. exit_status=$EXIT_SUCCESS # Make sure IFS has a sensible default lt_nl=' ' IFS=" $lt_nl" dirname="s,/[^/]*$,," basename="s,^.*/,," # func_dirname file append nondir_replacement # Compute the dirname of FILE. If nonempty, add APPEND to the result, # otherwise set result to NONDIR_REPLACEMENT. func_dirname () { func_dirname_result=`$ECHO "${1}" | $SED "$dirname"` if test "X$func_dirname_result" = "X${1}"; then func_dirname_result="${3}" else func_dirname_result="$func_dirname_result${2}" fi } # func_dirname may be replaced by extended shell implementation # func_basename file func_basename () { func_basename_result=`$ECHO "${1}" | $SED "$basename"` } # func_basename may be replaced by extended shell implementation # func_dirname_and_basename file append nondir_replacement # perform func_basename and func_dirname in a single function # call: # dirname: Compute the dirname of FILE. If nonempty, # add APPEND to the result, otherwise set result # to NONDIR_REPLACEMENT. # value returned in "$func_dirname_result" # basename: Compute filename of FILE. # value retuned in "$func_basename_result" # Implementation must be kept synchronized with func_dirname # and func_basename. For efficiency, we do not delegate to # those functions but instead duplicate the functionality here. func_dirname_and_basename () { # Extract subdirectory from the argument. func_dirname_result=`$ECHO "${1}" | $SED -e "$dirname"` if test "X$func_dirname_result" = "X${1}"; then func_dirname_result="${3}" else func_dirname_result="$func_dirname_result${2}" fi func_basename_result=`$ECHO "${1}" | $SED -e "$basename"` } # func_dirname_and_basename may be replaced by extended shell implementation # func_stripname prefix suffix name # strip PREFIX and SUFFIX off of NAME. # PREFIX and SUFFIX must not contain globbing or regex special # characters, hashes, percent signs, but SUFFIX may contain a leading # dot (in which case that matches only a dot). # func_strip_suffix prefix name func_stripname () { case ${2} in .*) func_stripname_result=`$ECHO "${3}" | $SED "s%^${1}%%; s%\\\\${2}\$%%"`;; *) func_stripname_result=`$ECHO "${3}" | $SED "s%^${1}%%; s%${2}\$%%"`;; esac } # func_stripname may be replaced by extended shell implementation # These SED scripts presuppose an absolute path with a trailing slash. pathcar='s,^/\([^/]*\).*$,\1,' pathcdr='s,^/[^/]*,,' removedotparts=':dotsl s@/\./@/@g t dotsl s,/\.$,/,' collapseslashes='s@/\{1,\}@/@g' finalslash='s,/*$,/,' # func_normal_abspath PATH # Remove doubled-up and trailing slashes, "." path components, # and cancel out any ".." path components in PATH after making # it an absolute path. # value returned in "$func_normal_abspath_result" func_normal_abspath () { # Start from root dir and reassemble the path. func_normal_abspath_result= func_normal_abspath_tpath=$1 func_normal_abspath_altnamespace= case $func_normal_abspath_tpath in "") # Empty path, that just means $cwd. func_stripname '' '/' "`pwd`" func_normal_abspath_result=$func_stripname_result return ;; # The next three entries are used to spot a run of precisely # two leading slashes without using negated character classes; # we take advantage of case's first-match behaviour. ///*) # Unusual form of absolute path, do nothing. ;; //*) # Not necessarily an ordinary path; POSIX reserves leading '//' # and for example Cygwin uses it to access remote file shares # over CIFS/SMB, so we conserve a leading double slash if found. func_normal_abspath_altnamespace=/ ;; /*) # Absolute path, do nothing. ;; *) # Relative path, prepend $cwd. func_normal_abspath_tpath=`pwd`/$func_normal_abspath_tpath ;; esac # Cancel out all the simple stuff to save iterations. We also want # the path to end with a slash for ease of parsing, so make sure # there is one (and only one) here. func_normal_abspath_tpath=`$ECHO "$func_normal_abspath_tpath" | $SED \ -e "$removedotparts" -e "$collapseslashes" -e "$finalslash"` while :; do # Processed it all yet? if test "$func_normal_abspath_tpath" = / ; then # If we ascended to the root using ".." the result may be empty now. if test -z "$func_normal_abspath_result" ; then func_normal_abspath_result=/ fi break fi func_normal_abspath_tcomponent=`$ECHO "$func_normal_abspath_tpath" | $SED \ -e "$pathcar"` func_normal_abspath_tpath=`$ECHO "$func_normal_abspath_tpath" | $SED \ -e "$pathcdr"` # Figure out what to do with it case $func_normal_abspath_tcomponent in "") # Trailing empty path component, ignore it. ;; ..) # Parent dir; strip last assembled component from result. func_dirname "$func_normal_abspath_result" func_normal_abspath_result=$func_dirname_result ;; *) # Actual path component, append it. func_normal_abspath_result=$func_normal_abspath_result/$func_normal_abspath_tcomponent ;; esac done # Restore leading double-slash if one was found on entry. func_normal_abspath_result=$func_normal_abspath_altnamespace$func_normal_abspath_result } # func_relative_path SRCDIR DSTDIR # generates a relative path from SRCDIR to DSTDIR, with a trailing # slash if non-empty, suitable for immediately appending a filename # without needing to append a separator. # value returned in "$func_relative_path_result" func_relative_path () { func_relative_path_result= func_normal_abspath "$1" func_relative_path_tlibdir=$func_normal_abspath_result func_normal_abspath "$2" func_relative_path_tbindir=$func_normal_abspath_result # Ascend the tree starting from libdir while :; do # check if we have found a prefix of bindir case $func_relative_path_tbindir in $func_relative_path_tlibdir) # found an exact match func_relative_path_tcancelled= break ;; $func_relative_path_tlibdir*) # found a matching prefix func_stripname "$func_relative_path_tlibdir" '' "$func_relative_path_tbindir" func_relative_path_tcancelled=$func_stripname_result if test -z "$func_relative_path_result"; then func_relative_path_result=. fi break ;; *) func_dirname $func_relative_path_tlibdir func_relative_path_tlibdir=${func_dirname_result} if test "x$func_relative_path_tlibdir" = x ; then # Have to descend all the way to the root! func_relative_path_result=../$func_relative_path_result func_relative_path_tcancelled=$func_relative_path_tbindir break fi func_relative_path_result=../$func_relative_path_result ;; esac done # Now calculate path; take care to avoid doubling-up slashes. func_stripname '' '/' "$func_relative_path_result" func_relative_path_result=$func_stripname_result func_stripname '/' '/' "$func_relative_path_tcancelled" if test "x$func_stripname_result" != x ; then func_relative_path_result=${func_relative_path_result}/${func_stripname_result} fi # Normalisation. If bindir is libdir, return empty string, # else relative path ending with a slash; either way, target # file name can be directly appended. if test ! -z "$func_relative_path_result"; then func_stripname './' '' "$func_relative_path_result/" func_relative_path_result=$func_stripname_result fi } # The name of this program: func_dirname_and_basename "$progpath" progname=$func_basename_result # Make sure we have an absolute path for reexecution: case $progpath in [\\/]*|[A-Za-z]:\\*) ;; *[\\/]*) progdir=$func_dirname_result progdir=`cd "$progdir" && pwd` progpath="$progdir/$progname" ;; *) save_IFS="$IFS" IFS=${PATH_SEPARATOR-:} for progdir in $PATH; do IFS="$save_IFS" test -x "$progdir/$progname" && break done IFS="$save_IFS" test -n "$progdir" || progdir=`pwd` progpath="$progdir/$progname" ;; esac # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. Xsed="${SED}"' -e 1s/^X//' sed_quote_subst='s/\([`"$\\]\)/\\\1/g' # Same as above, but do not quote variable references. double_quote_subst='s/\(["`\\]\)/\\\1/g' # Sed substitution that turns a string into a regex matching for the # string literally. sed_make_literal_regex='s,[].[^$\\*\/],\\&,g' # Sed substitution that converts a w32 file name or path # which contains forward slashes, into one that contains # (escaped) backslashes. A very naive implementation. lt_sed_naive_backslashify='s|\\\\*|\\|g;s|/|\\|g;s|\\|\\\\|g' # Re-`\' parameter expansions in output of double_quote_subst that were # `\'-ed in input to the same. If an odd number of `\' preceded a '$' # in input to double_quote_subst, that '$' was protected from expansion. # Since each input `\' is now two `\'s, look for any number of runs of # four `\'s followed by two `\'s and then a '$'. `\' that '$'. bs='\\' bs2='\\\\' bs4='\\\\\\\\' dollar='\$' sed_double_backslash="\ s/$bs4/&\\ /g s/^$bs2$dollar/$bs&/ s/\\([^$bs]\\)$bs2$dollar/\\1$bs2$bs$dollar/g s/\n//g" # Standard options: opt_dry_run=false opt_help=false opt_quiet=false opt_verbose=false opt_warning=: # func_echo arg... # Echo program name prefixed message, along with the current mode # name if it has been set yet. func_echo () { $ECHO "$progname: ${opt_mode+$opt_mode: }$*" } # func_verbose arg... # Echo program name prefixed message in verbose mode only. func_verbose () { $opt_verbose && func_echo ${1+"$@"} # A bug in bash halts the script if the last line of a function # fails when set -e is in force, so we need another command to # work around that: : } # func_echo_all arg... # Invoke $ECHO with all args, space-separated. func_echo_all () { $ECHO "$*" } # func_error arg... # Echo program name prefixed message to standard error. func_error () { $ECHO "$progname: ${opt_mode+$opt_mode: }"${1+"$@"} 1>&2 } # func_warning arg... # Echo program name prefixed warning message to standard error. func_warning () { $opt_warning && $ECHO "$progname: ${opt_mode+$opt_mode: }warning: "${1+"$@"} 1>&2 # bash bug again: : } # func_fatal_error arg... # Echo program name prefixed message to standard error, and exit. func_fatal_error () { func_error ${1+"$@"} exit $EXIT_FAILURE } # func_fatal_help arg... # Echo program name prefixed message to standard error, followed by # a help hint, and exit. func_fatal_help () { func_error ${1+"$@"} func_fatal_error "$help" } help="Try \`$progname --help' for more information." ## default # func_grep expression filename # Check whether EXPRESSION matches any line of FILENAME, without output. func_grep () { $GREP "$1" "$2" >/dev/null 2>&1 } # func_mkdir_p directory-path # Make sure the entire path to DIRECTORY-PATH is available. func_mkdir_p () { my_directory_path="$1" my_dir_list= if test -n "$my_directory_path" && test "$opt_dry_run" != ":"; then # Protect directory names starting with `-' case $my_directory_path in -*) my_directory_path="./$my_directory_path" ;; esac # While some portion of DIR does not yet exist... while test ! -d "$my_directory_path"; do # ...make a list in topmost first order. Use a colon delimited # list incase some portion of path contains whitespace. my_dir_list="$my_directory_path:$my_dir_list" # If the last portion added has no slash in it, the list is done case $my_directory_path in */*) ;; *) break ;; esac # ...otherwise throw away the child directory and loop my_directory_path=`$ECHO "$my_directory_path" | $SED -e "$dirname"` done my_dir_list=`$ECHO "$my_dir_list" | $SED 's,:*$,,'` save_mkdir_p_IFS="$IFS"; IFS=':' for my_dir in $my_dir_list; do IFS="$save_mkdir_p_IFS" # mkdir can fail with a `File exist' error if two processes # try to create one of the directories concurrently. Don't # stop in that case! $MKDIR "$my_dir" 2>/dev/null || : done IFS="$save_mkdir_p_IFS" # Bail out if we (or some other process) failed to create a directory. test -d "$my_directory_path" || \ func_fatal_error "Failed to create \`$1'" fi } # func_mktempdir [string] # Make a temporary directory that won't clash with other running # libtool processes, and avoids race conditions if possible. If # given, STRING is the basename for that directory. func_mktempdir () { my_template="${TMPDIR-/tmp}/${1-$progname}" if test "$opt_dry_run" = ":"; then # Return a directory name, but don't create it in dry-run mode my_tmpdir="${my_template}-$$" else # If mktemp works, use that first and foremost my_tmpdir=`mktemp -d "${my_template}-XXXXXXXX" 2>/dev/null` if test ! -d "$my_tmpdir"; then # Failing that, at least try and use $RANDOM to avoid a race my_tmpdir="${my_template}-${RANDOM-0}$$" save_mktempdir_umask=`umask` umask 0077 $MKDIR "$my_tmpdir" umask $save_mktempdir_umask fi # If we're not in dry-run mode, bomb out on failure test -d "$my_tmpdir" || \ func_fatal_error "cannot create temporary directory \`$my_tmpdir'" fi $ECHO "$my_tmpdir" } # func_quote_for_eval arg # Aesthetically quote ARG to be evaled later. # This function returns two values: FUNC_QUOTE_FOR_EVAL_RESULT # is double-quoted, suitable for a subsequent eval, whereas # FUNC_QUOTE_FOR_EVAL_UNQUOTED_RESULT has merely all characters # which are still active within double quotes backslashified. func_quote_for_eval () { case $1 in *[\\\`\"\$]*) func_quote_for_eval_unquoted_result=`$ECHO "$1" | $SED "$sed_quote_subst"` ;; *) func_quote_for_eval_unquoted_result="$1" ;; esac case $func_quote_for_eval_unquoted_result in # Double-quote args containing shell metacharacters to delay # word splitting, command substitution and and variable # expansion for a subsequent eval. # Many Bourne shells cannot handle close brackets correctly # in scan sets, so we specify it separately. *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") func_quote_for_eval_result="\"$func_quote_for_eval_unquoted_result\"" ;; *) func_quote_for_eval_result="$func_quote_for_eval_unquoted_result" esac } # func_quote_for_expand arg # Aesthetically quote ARG to be evaled later; same as above, # but do not quote variable references. func_quote_for_expand () { case $1 in *[\\\`\"]*) my_arg=`$ECHO "$1" | $SED \ -e "$double_quote_subst" -e "$sed_double_backslash"` ;; *) my_arg="$1" ;; esac case $my_arg in # Double-quote args containing shell metacharacters to delay # word splitting and command substitution for a subsequent eval. # Many Bourne shells cannot handle close brackets correctly # in scan sets, so we specify it separately. *[\[\~\#\^\&\*\(\)\{\}\|\;\<\>\?\'\ \ ]*|*]*|"") my_arg="\"$my_arg\"" ;; esac func_quote_for_expand_result="$my_arg" } # func_show_eval cmd [fail_exp] # Unless opt_silent is true, then output CMD. Then, if opt_dryrun is # not true, evaluate CMD. If the evaluation of CMD fails, and FAIL_EXP # is given, then evaluate it. func_show_eval () { my_cmd="$1" my_fail_exp="${2-:}" ${opt_silent-false} || { func_quote_for_expand "$my_cmd" eval "func_echo $func_quote_for_expand_result" } if ${opt_dry_run-false}; then :; else eval "$my_cmd" my_status=$? if test "$my_status" -eq 0; then :; else eval "(exit $my_status); $my_fail_exp" fi fi } # func_show_eval_locale cmd [fail_exp] # Unless opt_silent is true, then output CMD. Then, if opt_dryrun is # not true, evaluate CMD. If the evaluation of CMD fails, and FAIL_EXP # is given, then evaluate it. Use the saved locale for evaluation. func_show_eval_locale () { my_cmd="$1" my_fail_exp="${2-:}" ${opt_silent-false} || { func_quote_for_expand "$my_cmd" eval "func_echo $func_quote_for_expand_result" } if ${opt_dry_run-false}; then :; else eval "$lt_user_locale $my_cmd" my_status=$? eval "$lt_safe_locale" if test "$my_status" -eq 0; then :; else eval "(exit $my_status); $my_fail_exp" fi fi } # func_tr_sh # Turn $1 into a string suitable for a shell variable name. # Result is stored in $func_tr_sh_result. All characters # not in the set a-zA-Z0-9_ are replaced with '_'. Further, # if $1 begins with a digit, a '_' is prepended as well. func_tr_sh () { case $1 in [0-9]* | *[!a-zA-Z0-9_]*) func_tr_sh_result=`$ECHO "$1" | $SED 's/^\([0-9]\)/_\1/; s/[^a-zA-Z0-9_]/_/g'` ;; * ) func_tr_sh_result=$1 ;; esac } # func_version # Echo version message to standard output and exit. func_version () { $opt_debug $SED -n '/(C)/!b go :more /\./!{ N s/\n# / / b more } :go /^# '$PROGRAM' (GNU /,/# warranty; / { s/^# // s/^# *$// s/\((C)\)[ 0-9,-]*\( [1-9][0-9]*\)/\1\2/ p }' < "$progpath" exit $? } # func_usage # Echo short help message to standard output and exit. func_usage () { $opt_debug $SED -n '/^# Usage:/,/^# *.*--help/ { s/^# // s/^# *$// s/\$progname/'$progname'/ p }' < "$progpath" echo $ECHO "run \`$progname --help | more' for full usage" exit $? } # func_help [NOEXIT] # Echo long help message to standard output and exit, # unless 'noexit' is passed as argument. func_help () { $opt_debug $SED -n '/^# Usage:/,/# Report bugs to/ { :print s/^# // s/^# *$// s*\$progname*'$progname'* s*\$host*'"$host"'* s*\$SHELL*'"$SHELL"'* s*\$LTCC*'"$LTCC"'* s*\$LTCFLAGS*'"$LTCFLAGS"'* s*\$LD*'"$LD"'* s/\$with_gnu_ld/'"$with_gnu_ld"'/ s/\$automake_version/'"`(${AUTOMAKE-automake} --version) 2>/dev/null |$SED 1q`"'/ s/\$autoconf_version/'"`(${AUTOCONF-autoconf} --version) 2>/dev/null |$SED 1q`"'/ p d } /^# .* home page:/b print /^# General help using/b print ' < "$progpath" ret=$? if test -z "$1"; then exit $ret fi } # func_missing_arg argname # Echo program name prefixed message to standard error and set global # exit_cmd. func_missing_arg () { $opt_debug func_error "missing argument for $1." exit_cmd=exit } # func_split_short_opt shortopt # Set func_split_short_opt_name and func_split_short_opt_arg shell # variables after splitting SHORTOPT after the 2nd character. func_split_short_opt () { my_sed_short_opt='1s/^\(..\).*$/\1/;q' my_sed_short_rest='1s/^..\(.*\)$/\1/;q' func_split_short_opt_name=`$ECHO "$1" | $SED "$my_sed_short_opt"` func_split_short_opt_arg=`$ECHO "$1" | $SED "$my_sed_short_rest"` } # func_split_short_opt may be replaced by extended shell implementation # func_split_long_opt longopt # Set func_split_long_opt_name and func_split_long_opt_arg shell # variables after splitting LONGOPT at the `=' sign. func_split_long_opt () { my_sed_long_opt='1s/^\(--[^=]*\)=.*/\1/;q' my_sed_long_arg='1s/^--[^=]*=//' func_split_long_opt_name=`$ECHO "$1" | $SED "$my_sed_long_opt"` func_split_long_opt_arg=`$ECHO "$1" | $SED "$my_sed_long_arg"` } # func_split_long_opt may be replaced by extended shell implementation exit_cmd=: magic="%%%MAGIC variable%%%" magic_exe="%%%MAGIC EXE variable%%%" # Global variables. nonopt= preserve_args= lo2o="s/\\.lo\$/.${objext}/" o2lo="s/\\.${objext}\$/.lo/" extracted_archives= extracted_serial=0 # If this variable is set in any of the actions, the command in it # will be execed at the end. This prevents here-documents from being # left over by shells. exec_cmd= # func_append var value # Append VALUE to the end of shell variable VAR. func_append () { eval "${1}=\$${1}\${2}" } # func_append may be replaced by extended shell implementation # func_append_quoted var value # Quote VALUE and append to the end of shell variable VAR, separated # by a space. func_append_quoted () { func_quote_for_eval "${2}" eval "${1}=\$${1}\\ \$func_quote_for_eval_result" } # func_append_quoted may be replaced by extended shell implementation # func_arith arithmetic-term... func_arith () { func_arith_result=`expr "${@}"` } # func_arith may be replaced by extended shell implementation # func_len string # STRING may not start with a hyphen. func_len () { func_len_result=`expr "${1}" : ".*" 2>/dev/null || echo $max_cmd_len` } # func_len may be replaced by extended shell implementation # func_lo2o object func_lo2o () { func_lo2o_result=`$ECHO "${1}" | $SED "$lo2o"` } # func_lo2o may be replaced by extended shell implementation # func_xform libobj-or-source func_xform () { func_xform_result=`$ECHO "${1}" | $SED 's/\.[^.]*$/.lo/'` } # func_xform may be replaced by extended shell implementation # func_fatal_configuration arg... # Echo program name prefixed message to standard error, followed by # a configuration failure hint, and exit. func_fatal_configuration () { func_error ${1+"$@"} func_error "See the $PACKAGE documentation for more information." func_fatal_error "Fatal configuration error." } # func_config # Display the configuration for all the tags in this script. func_config () { re_begincf='^# ### BEGIN LIBTOOL' re_endcf='^# ### END LIBTOOL' # Default configuration. $SED "1,/$re_begincf CONFIG/d;/$re_endcf CONFIG/,\$d" < "$progpath" # Now print the configurations for the tags. for tagname in $taglist; do $SED -n "/$re_begincf TAG CONFIG: $tagname\$/,/$re_endcf TAG CONFIG: $tagname\$/p" < "$progpath" done exit $? } # func_features # Display the features supported by this script. func_features () { echo "host: $host" if test "$build_libtool_libs" = yes; then echo "enable shared libraries" else echo "disable shared libraries" fi if test "$build_old_libs" = yes; then echo "enable static libraries" else echo "disable static libraries" fi exit $? } # func_enable_tag tagname # Verify that TAGNAME is valid, and either flag an error and exit, or # enable the TAGNAME tag. We also add TAGNAME to the global $taglist # variable here. func_enable_tag () { # Global variable: tagname="$1" re_begincf="^# ### BEGIN LIBTOOL TAG CONFIG: $tagname\$" re_endcf="^# ### END LIBTOOL TAG CONFIG: $tagname\$" sed_extractcf="/$re_begincf/,/$re_endcf/p" # Validate tagname. case $tagname in *[!-_A-Za-z0-9,/]*) func_fatal_error "invalid tag name: $tagname" ;; esac # Don't test for the "default" C tag, as we know it's # there but not specially marked. case $tagname in CC) ;; *) if $GREP "$re_begincf" "$progpath" >/dev/null 2>&1; then taglist="$taglist $tagname" # Evaluate the configuration. Be careful to quote the path # and the sed script, to avoid splitting on whitespace, but # also don't use non-portable quotes within backquotes within # quotes we have to do it in 2 steps: extractedcf=`$SED -n -e "$sed_extractcf" < "$progpath"` eval "$extractedcf" else func_error "ignoring unknown tag $tagname" fi ;; esac } # func_check_version_match # Ensure that we are using m4 macros, and libtool script from the same # release of libtool. func_check_version_match () { if test "$package_revision" != "$macro_revision"; then if test "$VERSION" != "$macro_version"; then if test -z "$macro_version"; then cat >&2 <<_LT_EOF $progname: Version mismatch error. This is $PACKAGE $VERSION, but the $progname: definition of this LT_INIT comes from an older release. $progname: You should recreate aclocal.m4 with macros from $PACKAGE $VERSION $progname: and run autoconf again. _LT_EOF else cat >&2 <<_LT_EOF $progname: Version mismatch error. This is $PACKAGE $VERSION, but the $progname: definition of this LT_INIT comes from $PACKAGE $macro_version. $progname: You should recreate aclocal.m4 with macros from $PACKAGE $VERSION $progname: and run autoconf again. _LT_EOF fi else cat >&2 <<_LT_EOF $progname: Version mismatch error. This is $PACKAGE $VERSION, revision $package_revision, $progname: but the definition of this LT_INIT comes from revision $macro_revision. $progname: You should recreate aclocal.m4 with macros from revision $package_revision $progname: of $PACKAGE $VERSION and run autoconf again. _LT_EOF fi exit $EXIT_MISMATCH fi } # Shorthand for --mode=foo, only valid as the first argument case $1 in clean|clea|cle|cl) shift; set dummy --mode clean ${1+"$@"}; shift ;; compile|compil|compi|comp|com|co|c) shift; set dummy --mode compile ${1+"$@"}; shift ;; execute|execut|execu|exec|exe|ex|e) shift; set dummy --mode execute ${1+"$@"}; shift ;; finish|finis|fini|fin|fi|f) shift; set dummy --mode finish ${1+"$@"}; shift ;; install|instal|insta|inst|ins|in|i) shift; set dummy --mode install ${1+"$@"}; shift ;; link|lin|li|l) shift; set dummy --mode link ${1+"$@"}; shift ;; uninstall|uninstal|uninsta|uninst|unins|unin|uni|un|u) shift; set dummy --mode uninstall ${1+"$@"}; shift ;; esac # Option defaults: opt_debug=: opt_dry_run=false opt_config=false opt_preserve_dup_deps=false opt_features=false opt_finish=false opt_help=false opt_help_all=false opt_silent=: opt_warning=: opt_verbose=: opt_silent=false opt_verbose=false # Parse options once, thoroughly. This comes as soon as possible in the # script to make things like `--version' happen as quickly as we can. { # this just eases exit handling while test $# -gt 0; do opt="$1" shift case $opt in --debug|-x) opt_debug='set -x' func_echo "enabling shell trace mode" $opt_debug ;; --dry-run|--dryrun|-n) opt_dry_run=: ;; --config) opt_config=: func_config ;; --dlopen|-dlopen) optarg="$1" opt_dlopen="${opt_dlopen+$opt_dlopen }$optarg" shift ;; --preserve-dup-deps) opt_preserve_dup_deps=: ;; --features) opt_features=: func_features ;; --finish) opt_finish=: set dummy --mode finish ${1+"$@"}; shift ;; --help) opt_help=: ;; --help-all) opt_help_all=: opt_help=': help-all' ;; --mode) test $# = 0 && func_missing_arg $opt && break optarg="$1" opt_mode="$optarg" case $optarg in # Valid mode arguments: clean|compile|execute|finish|install|link|relink|uninstall) ;; # Catch anything else as an error *) func_error "invalid argument for $opt" exit_cmd=exit break ;; esac shift ;; --no-silent|--no-quiet) opt_silent=false func_append preserve_args " $opt" ;; --no-warning|--no-warn) opt_warning=false func_append preserve_args " $opt" ;; --no-verbose) opt_verbose=false func_append preserve_args " $opt" ;; --silent|--quiet) opt_silent=: func_append preserve_args " $opt" opt_verbose=false ;; --verbose|-v) opt_verbose=: func_append preserve_args " $opt" opt_silent=false ;; --tag) test $# = 0 && func_missing_arg $opt && break optarg="$1" opt_tag="$optarg" func_append preserve_args " $opt $optarg" func_enable_tag "$optarg" shift ;; -\?|-h) func_usage ;; --help) func_help ;; --version) func_version ;; # Separate optargs to long options: --*=*) func_split_long_opt "$opt" set dummy "$func_split_long_opt_name" "$func_split_long_opt_arg" ${1+"$@"} shift ;; # Separate non-argument short options: -\?*|-h*|-n*|-v*) func_split_short_opt "$opt" set dummy "$func_split_short_opt_name" "-$func_split_short_opt_arg" ${1+"$@"} shift ;; --) break ;; -*) func_fatal_help "unrecognized option \`$opt'" ;; *) set dummy "$opt" ${1+"$@"}; shift; break ;; esac done # Validate options: # save first non-option argument if test "$#" -gt 0; then nonopt="$opt" shift fi # preserve --debug test "$opt_debug" = : || func_append preserve_args " --debug" case $host in *cygwin* | *mingw* | *pw32* | *cegcc*) # don't eliminate duplications in $postdeps and $predeps opt_duplicate_compiler_generated_deps=: ;; *) opt_duplicate_compiler_generated_deps=$opt_preserve_dup_deps ;; esac $opt_help || { # Sanity checks first: func_check_version_match if test "$build_libtool_libs" != yes && test "$build_old_libs" != yes; then func_fatal_configuration "not configured to build any kind of library" fi # Darwin sucks eval std_shrext=\"$shrext_cmds\" # Only execute mode is allowed to have -dlopen flags. if test -n "$opt_dlopen" && test "$opt_mode" != execute; then func_error "unrecognized option \`-dlopen'" $ECHO "$help" 1>&2 exit $EXIT_FAILURE fi # Change the help message to a mode-specific one. generic_help="$help" help="Try \`$progname --help --mode=$opt_mode' for more information." } # Bail if the options were screwed $exit_cmd $EXIT_FAILURE } ## ----------- ## ## Main. ## ## ----------- ## # func_lalib_p file # True iff FILE is a libtool `.la' library or `.lo' object file. # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_lalib_p () { test -f "$1" && $SED -e 4q "$1" 2>/dev/null \ | $GREP "^# Generated by .*$PACKAGE" > /dev/null 2>&1 } # func_lalib_unsafe_p file # True iff FILE is a libtool `.la' library or `.lo' object file. # This function implements the same check as func_lalib_p without # resorting to external programs. To this end, it redirects stdin and # closes it afterwards, without saving the original file descriptor. # As a safety measure, use it only where a negative result would be # fatal anyway. Works if `file' does not exist. func_lalib_unsafe_p () { lalib_p=no if test -f "$1" && test -r "$1" && exec 5<&0 <"$1"; then for lalib_p_l in 1 2 3 4 do read lalib_p_line case "$lalib_p_line" in \#\ Generated\ by\ *$PACKAGE* ) lalib_p=yes; break;; esac done exec 0<&5 5<&- fi test "$lalib_p" = yes } # func_ltwrapper_script_p file # True iff FILE is a libtool wrapper script # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_ltwrapper_script_p () { func_lalib_p "$1" } # func_ltwrapper_executable_p file # True iff FILE is a libtool wrapper executable # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_ltwrapper_executable_p () { func_ltwrapper_exec_suffix= case $1 in *.exe) ;; *) func_ltwrapper_exec_suffix=.exe ;; esac $GREP "$magic_exe" "$1$func_ltwrapper_exec_suffix" >/dev/null 2>&1 } # func_ltwrapper_scriptname file # Assumes file is an ltwrapper_executable # uses $file to determine the appropriate filename for a # temporary ltwrapper_script. func_ltwrapper_scriptname () { func_dirname_and_basename "$1" "" "." func_stripname '' '.exe' "$func_basename_result" func_ltwrapper_scriptname_result="$func_dirname_result/$objdir/${func_stripname_result}_ltshwrapper" } # func_ltwrapper_p file # True iff FILE is a libtool wrapper script or wrapper executable # This function is only a basic sanity check; it will hardly flush out # determined imposters. func_ltwrapper_p () { func_ltwrapper_script_p "$1" || func_ltwrapper_executable_p "$1" } # func_execute_cmds commands fail_cmd # Execute tilde-delimited COMMANDS. # If FAIL_CMD is given, eval that upon failure. # FAIL_CMD may read-access the current command in variable CMD! func_execute_cmds () { $opt_debug save_ifs=$IFS; IFS='~' for cmd in $1; do IFS=$save_ifs eval cmd=\"$cmd\" func_show_eval "$cmd" "${2-:}" done IFS=$save_ifs } # func_source file # Source FILE, adding directory component if necessary. # Note that it is not necessary on cygwin/mingw to append a dot to # FILE even if both FILE and FILE.exe exist: automatic-append-.exe # behavior happens only for exec(3), not for open(2)! Also, sourcing # `FILE.' does not work on cygwin managed mounts. func_source () { $opt_debug case $1 in */* | *\\*) . "$1" ;; *) . "./$1" ;; esac } # func_resolve_sysroot PATH # Replace a leading = in PATH with a sysroot. Store the result into # func_resolve_sysroot_result func_resolve_sysroot () { func_resolve_sysroot_result=$1 case $func_resolve_sysroot_result in =*) func_stripname '=' '' "$func_resolve_sysroot_result" func_resolve_sysroot_result=$lt_sysroot$func_stripname_result ;; esac } # func_replace_sysroot PATH # If PATH begins with the sysroot, replace it with = and # store the result into func_replace_sysroot_result. func_replace_sysroot () { case "$lt_sysroot:$1" in ?*:"$lt_sysroot"*) func_stripname "$lt_sysroot" '' "$1" func_replace_sysroot_result="=$func_stripname_result" ;; *) # Including no sysroot. func_replace_sysroot_result=$1 ;; esac } # func_infer_tag arg # Infer tagged configuration to use if any are available and # if one wasn't chosen via the "--tag" command line option. # Only attempt this if the compiler in the base compile # command doesn't match the default compiler. # arg is usually of the form 'gcc ...' func_infer_tag () { $opt_debug if test -n "$available_tags" && test -z "$tagname"; then CC_quoted= for arg in $CC; do func_append_quoted CC_quoted "$arg" done CC_expanded=`func_echo_all $CC` CC_quoted_expanded=`func_echo_all $CC_quoted` case $@ in # Blanks in the command may have been stripped by the calling shell, # but not from the CC environment variable when configure was run. " $CC "* | "$CC "* | " $CC_expanded "* | "$CC_expanded "* | \ " $CC_quoted"* | "$CC_quoted "* | " $CC_quoted_expanded "* | "$CC_quoted_expanded "*) ;; # Blanks at the start of $base_compile will cause this to fail # if we don't check for them as well. *) for z in $available_tags; do if $GREP "^# ### BEGIN LIBTOOL TAG CONFIG: $z$" < "$progpath" > /dev/null; then # Evaluate the configuration. eval "`${SED} -n -e '/^# ### BEGIN LIBTOOL TAG CONFIG: '$z'$/,/^# ### END LIBTOOL TAG CONFIG: '$z'$/p' < $progpath`" CC_quoted= for arg in $CC; do # Double-quote args containing other shell metacharacters. func_append_quoted CC_quoted "$arg" done CC_expanded=`func_echo_all $CC` CC_quoted_expanded=`func_echo_all $CC_quoted` case "$@ " in " $CC "* | "$CC "* | " $CC_expanded "* | "$CC_expanded "* | \ " $CC_quoted"* | "$CC_quoted "* | " $CC_quoted_expanded "* | "$CC_quoted_expanded "*) # The compiler in the base compile command matches # the one in the tagged configuration. # Assume this is the tagged configuration we want. tagname=$z break ;; esac fi done # If $tagname still isn't set, then no tagged configuration # was found and let the user know that the "--tag" command # line option must be used. if test -z "$tagname"; then func_echo "unable to infer tagged configuration" func_fatal_error "specify a tag with \`--tag'" # else # func_verbose "using $tagname tagged configuration" fi ;; esac fi } # func_write_libtool_object output_name pic_name nonpic_name # Create a libtool object file (analogous to a ".la" file), # but don't create it if we're doing a dry run. func_write_libtool_object () { write_libobj=${1} if test "$build_libtool_libs" = yes; then write_lobj=\'${2}\' else write_lobj=none fi if test "$build_old_libs" = yes; then write_oldobj=\'${3}\' else write_oldobj=none fi $opt_dry_run || { cat >${write_libobj}T </dev/null` if test "$?" -eq 0 && test -n "${func_convert_core_file_wine_to_w32_tmp}"; then func_convert_core_file_wine_to_w32_result=`$ECHO "$func_convert_core_file_wine_to_w32_tmp" | $SED -e "$lt_sed_naive_backslashify"` else func_convert_core_file_wine_to_w32_result= fi fi } # end: func_convert_core_file_wine_to_w32 # func_convert_core_path_wine_to_w32 ARG # Helper function used by path conversion functions when $build is *nix, and # $host is mingw, cygwin, or some other w32 environment. Relies on a correctly # configured wine environment available, with the winepath program in $build's # $PATH. Assumes ARG has no leading or trailing path separator characters. # # ARG is path to be converted from $build format to win32. # Result is available in $func_convert_core_path_wine_to_w32_result. # Unconvertible file (directory) names in ARG are skipped; if no directory names # are convertible, then the result may be empty. func_convert_core_path_wine_to_w32 () { $opt_debug # unfortunately, winepath doesn't convert paths, only file names func_convert_core_path_wine_to_w32_result="" if test -n "$1"; then oldIFS=$IFS IFS=: for func_convert_core_path_wine_to_w32_f in $1; do IFS=$oldIFS func_convert_core_file_wine_to_w32 "$func_convert_core_path_wine_to_w32_f" if test -n "$func_convert_core_file_wine_to_w32_result" ; then if test -z "$func_convert_core_path_wine_to_w32_result"; then func_convert_core_path_wine_to_w32_result="$func_convert_core_file_wine_to_w32_result" else func_append func_convert_core_path_wine_to_w32_result ";$func_convert_core_file_wine_to_w32_result" fi fi done IFS=$oldIFS fi } # end: func_convert_core_path_wine_to_w32 # func_cygpath ARGS... # Wrapper around calling the cygpath program via LT_CYGPATH. This is used when # when (1) $build is *nix and Cygwin is hosted via a wine environment; or (2) # $build is MSYS and $host is Cygwin, or (3) $build is Cygwin. In case (1) or # (2), returns the Cygwin file name or path in func_cygpath_result (input # file name or path is assumed to be in w32 format, as previously converted # from $build's *nix or MSYS format). In case (3), returns the w32 file name # or path in func_cygpath_result (input file name or path is assumed to be in # Cygwin format). Returns an empty string on error. # # ARGS are passed to cygpath, with the last one being the file name or path to # be converted. # # Specify the absolute *nix (or w32) name to cygpath in the LT_CYGPATH # environment variable; do not put it in $PATH. func_cygpath () { $opt_debug if test -n "$LT_CYGPATH" && test -f "$LT_CYGPATH"; then func_cygpath_result=`$LT_CYGPATH "$@" 2>/dev/null` if test "$?" -ne 0; then # on failure, ensure result is empty func_cygpath_result= fi else func_cygpath_result= func_error "LT_CYGPATH is empty or specifies non-existent file: \`$LT_CYGPATH'" fi } #end: func_cygpath # func_convert_core_msys_to_w32 ARG # Convert file name or path ARG from MSYS format to w32 format. Return # result in func_convert_core_msys_to_w32_result. func_convert_core_msys_to_w32 () { $opt_debug # awkward: cmd appends spaces to result func_convert_core_msys_to_w32_result=`( cmd //c echo "$1" ) 2>/dev/null | $SED -e 's/[ ]*$//' -e "$lt_sed_naive_backslashify"` } #end: func_convert_core_msys_to_w32 # func_convert_file_check ARG1 ARG2 # Verify that ARG1 (a file name in $build format) was converted to $host # format in ARG2. Otherwise, emit an error message, but continue (resetting # func_to_host_file_result to ARG1). func_convert_file_check () { $opt_debug if test -z "$2" && test -n "$1" ; then func_error "Could not determine host file name corresponding to" func_error " \`$1'" func_error "Continuing, but uninstalled executables may not work." # Fallback: func_to_host_file_result="$1" fi } # end func_convert_file_check # func_convert_path_check FROM_PATHSEP TO_PATHSEP FROM_PATH TO_PATH # Verify that FROM_PATH (a path in $build format) was converted to $host # format in TO_PATH. Otherwise, emit an error message, but continue, resetting # func_to_host_file_result to a simplistic fallback value (see below). func_convert_path_check () { $opt_debug if test -z "$4" && test -n "$3"; then func_error "Could not determine the host path corresponding to" func_error " \`$3'" func_error "Continuing, but uninstalled executables may not work." # Fallback. This is a deliberately simplistic "conversion" and # should not be "improved". See libtool.info. if test "x$1" != "x$2"; then lt_replace_pathsep_chars="s|$1|$2|g" func_to_host_path_result=`echo "$3" | $SED -e "$lt_replace_pathsep_chars"` else func_to_host_path_result="$3" fi fi } # end func_convert_path_check # func_convert_path_front_back_pathsep FRONTPAT BACKPAT REPL ORIG # Modifies func_to_host_path_result by prepending REPL if ORIG matches FRONTPAT # and appending REPL if ORIG matches BACKPAT. func_convert_path_front_back_pathsep () { $opt_debug case $4 in $1 ) func_to_host_path_result="$3$func_to_host_path_result" ;; esac case $4 in $2 ) func_append func_to_host_path_result "$3" ;; esac } # end func_convert_path_front_back_pathsep ################################################## # $build to $host FILE NAME CONVERSION FUNCTIONS # ################################################## # invoked via `$to_host_file_cmd ARG' # # In each case, ARG is the path to be converted from $build to $host format. # Result will be available in $func_to_host_file_result. # func_to_host_file ARG # Converts the file name ARG from $build format to $host format. Return result # in func_to_host_file_result. func_to_host_file () { $opt_debug $to_host_file_cmd "$1" } # end func_to_host_file # func_to_tool_file ARG LAZY # converts the file name ARG from $build format to toolchain format. Return # result in func_to_tool_file_result. If the conversion in use is listed # in (the comma separated) LAZY, no conversion takes place. func_to_tool_file () { $opt_debug case ,$2, in *,"$to_tool_file_cmd",*) func_to_tool_file_result=$1 ;; *) $to_tool_file_cmd "$1" func_to_tool_file_result=$func_to_host_file_result ;; esac } # end func_to_tool_file # func_convert_file_noop ARG # Copy ARG to func_to_host_file_result. func_convert_file_noop () { func_to_host_file_result="$1" } # end func_convert_file_noop # func_convert_file_msys_to_w32 ARG # Convert file name ARG from (mingw) MSYS to (mingw) w32 format; automatic # conversion to w32 is not available inside the cwrapper. Returns result in # func_to_host_file_result. func_convert_file_msys_to_w32 () { $opt_debug func_to_host_file_result="$1" if test -n "$1"; then func_convert_core_msys_to_w32 "$1" func_to_host_file_result="$func_convert_core_msys_to_w32_result" fi func_convert_file_check "$1" "$func_to_host_file_result" } # end func_convert_file_msys_to_w32 # func_convert_file_cygwin_to_w32 ARG # Convert file name ARG from Cygwin to w32 format. Returns result in # func_to_host_file_result. func_convert_file_cygwin_to_w32 () { $opt_debug func_to_host_file_result="$1" if test -n "$1"; then # because $build is cygwin, we call "the" cygpath in $PATH; no need to use # LT_CYGPATH in this case. func_to_host_file_result=`cygpath -m "$1"` fi func_convert_file_check "$1" "$func_to_host_file_result" } # end func_convert_file_cygwin_to_w32 # func_convert_file_nix_to_w32 ARG # Convert file name ARG from *nix to w32 format. Requires a wine environment # and a working winepath. Returns result in func_to_host_file_result. func_convert_file_nix_to_w32 () { $opt_debug func_to_host_file_result="$1" if test -n "$1"; then func_convert_core_file_wine_to_w32 "$1" func_to_host_file_result="$func_convert_core_file_wine_to_w32_result" fi func_convert_file_check "$1" "$func_to_host_file_result" } # end func_convert_file_nix_to_w32 # func_convert_file_msys_to_cygwin ARG # Convert file name ARG from MSYS to Cygwin format. Requires LT_CYGPATH set. # Returns result in func_to_host_file_result. func_convert_file_msys_to_cygwin () { $opt_debug func_to_host_file_result="$1" if test -n "$1"; then func_convert_core_msys_to_w32 "$1" func_cygpath -u "$func_convert_core_msys_to_w32_result" func_to_host_file_result="$func_cygpath_result" fi func_convert_file_check "$1" "$func_to_host_file_result" } # end func_convert_file_msys_to_cygwin # func_convert_file_nix_to_cygwin ARG # Convert file name ARG from *nix to Cygwin format. Requires Cygwin installed # in a wine environment, working winepath, and LT_CYGPATH set. Returns result # in func_to_host_file_result. func_convert_file_nix_to_cygwin () { $opt_debug func_to_host_file_result="$1" if test -n "$1"; then # convert from *nix to w32, then use cygpath to convert from w32 to cygwin. func_convert_core_file_wine_to_w32 "$1" func_cygpath -u "$func_convert_core_file_wine_to_w32_result" func_to_host_file_result="$func_cygpath_result" fi func_convert_file_check "$1" "$func_to_host_file_result" } # end func_convert_file_nix_to_cygwin ############################################# # $build to $host PATH CONVERSION FUNCTIONS # ############################################# # invoked via `$to_host_path_cmd ARG' # # In each case, ARG is the path to be converted from $build to $host format. # The result will be available in $func_to_host_path_result. # # Path separators are also converted from $build format to $host format. If # ARG begins or ends with a path separator character, it is preserved (but # converted to $host format) on output. # # All path conversion functions are named using the following convention: # file name conversion function : func_convert_file_X_to_Y () # path conversion function : func_convert_path_X_to_Y () # where, for any given $build/$host combination the 'X_to_Y' value is the # same. If conversion functions are added for new $build/$host combinations, # the two new functions must follow this pattern, or func_init_to_host_path_cmd # will break. # func_init_to_host_path_cmd # Ensures that function "pointer" variable $to_host_path_cmd is set to the # appropriate value, based on the value of $to_host_file_cmd. to_host_path_cmd= func_init_to_host_path_cmd () { $opt_debug if test -z "$to_host_path_cmd"; then func_stripname 'func_convert_file_' '' "$to_host_file_cmd" to_host_path_cmd="func_convert_path_${func_stripname_result}" fi } # func_to_host_path ARG # Converts the path ARG from $build format to $host format. Return result # in func_to_host_path_result. func_to_host_path () { $opt_debug func_init_to_host_path_cmd $to_host_path_cmd "$1" } # end func_to_host_path # func_convert_path_noop ARG # Copy ARG to func_to_host_path_result. func_convert_path_noop () { func_to_host_path_result="$1" } # end func_convert_path_noop # func_convert_path_msys_to_w32 ARG # Convert path ARG from (mingw) MSYS to (mingw) w32 format; automatic # conversion to w32 is not available inside the cwrapper. Returns result in # func_to_host_path_result. func_convert_path_msys_to_w32 () { $opt_debug func_to_host_path_result="$1" if test -n "$1"; then # Remove leading and trailing path separator characters from ARG. MSYS # behavior is inconsistent here; cygpath turns them into '.;' and ';.'; # and winepath ignores them completely. func_stripname : : "$1" func_to_host_path_tmp1=$func_stripname_result func_convert_core_msys_to_w32 "$func_to_host_path_tmp1" func_to_host_path_result="$func_convert_core_msys_to_w32_result" func_convert_path_check : ";" \ "$func_to_host_path_tmp1" "$func_to_host_path_result" func_convert_path_front_back_pathsep ":*" "*:" ";" "$1" fi } # end func_convert_path_msys_to_w32 # func_convert_path_cygwin_to_w32 ARG # Convert path ARG from Cygwin to w32 format. Returns result in # func_to_host_file_result. func_convert_path_cygwin_to_w32 () { $opt_debug func_to_host_path_result="$1" if test -n "$1"; then # See func_convert_path_msys_to_w32: func_stripname : : "$1" func_to_host_path_tmp1=$func_stripname_result func_to_host_path_result=`cygpath -m -p "$func_to_host_path_tmp1"` func_convert_path_check : ";" \ "$func_to_host_path_tmp1" "$func_to_host_path_result" func_convert_path_front_back_pathsep ":*" "*:" ";" "$1" fi } # end func_convert_path_cygwin_to_w32 # func_convert_path_nix_to_w32 ARG # Convert path ARG from *nix to w32 format. Requires a wine environment and # a working winepath. Returns result in func_to_host_file_result. func_convert_path_nix_to_w32 () { $opt_debug func_to_host_path_result="$1" if test -n "$1"; then # See func_convert_path_msys_to_w32: func_stripname : : "$1" func_to_host_path_tmp1=$func_stripname_result func_convert_core_path_wine_to_w32 "$func_to_host_path_tmp1" func_to_host_path_result="$func_convert_core_path_wine_to_w32_result" func_convert_path_check : ";" \ "$func_to_host_path_tmp1" "$func_to_host_path_result" func_convert_path_front_back_pathsep ":*" "*:" ";" "$1" fi } # end func_convert_path_nix_to_w32 # func_convert_path_msys_to_cygwin ARG # Convert path ARG from MSYS to Cygwin format. Requires LT_CYGPATH set. # Returns result in func_to_host_file_result. func_convert_path_msys_to_cygwin () { $opt_debug func_to_host_path_result="$1" if test -n "$1"; then # See func_convert_path_msys_to_w32: func_stripname : : "$1" func_to_host_path_tmp1=$func_stripname_result func_convert_core_msys_to_w32 "$func_to_host_path_tmp1" func_cygpath -u -p "$func_convert_core_msys_to_w32_result" func_to_host_path_result="$func_cygpath_result" func_convert_path_check : : \ "$func_to_host_path_tmp1" "$func_to_host_path_result" func_convert_path_front_back_pathsep ":*" "*:" : "$1" fi } # end func_convert_path_msys_to_cygwin # func_convert_path_nix_to_cygwin ARG # Convert path ARG from *nix to Cygwin format. Requires Cygwin installed in a # a wine environment, working winepath, and LT_CYGPATH set. Returns result in # func_to_host_file_result. func_convert_path_nix_to_cygwin () { $opt_debug func_to_host_path_result="$1" if test -n "$1"; then # Remove leading and trailing path separator characters from # ARG. msys behavior is inconsistent here, cygpath turns them # into '.;' and ';.', and winepath ignores them completely. func_stripname : : "$1" func_to_host_path_tmp1=$func_stripname_result func_convert_core_path_wine_to_w32 "$func_to_host_path_tmp1" func_cygpath -u -p "$func_convert_core_path_wine_to_w32_result" func_to_host_path_result="$func_cygpath_result" func_convert_path_check : : \ "$func_to_host_path_tmp1" "$func_to_host_path_result" func_convert_path_front_back_pathsep ":*" "*:" : "$1" fi } # end func_convert_path_nix_to_cygwin # func_mode_compile arg... func_mode_compile () { $opt_debug # Get the compilation command and the source file. base_compile= srcfile="$nonopt" # always keep a non-empty value in "srcfile" suppress_opt=yes suppress_output= arg_mode=normal libobj= later= pie_flag= for arg do case $arg_mode in arg ) # do not "continue". Instead, add this to base_compile lastarg="$arg" arg_mode=normal ;; target ) libobj="$arg" arg_mode=normal continue ;; normal ) # Accept any command-line options. case $arg in -o) test -n "$libobj" && \ func_fatal_error "you cannot specify \`-o' more than once" arg_mode=target continue ;; -pie | -fpie | -fPIE) func_append pie_flag " $arg" continue ;; -shared | -static | -prefer-pic | -prefer-non-pic) func_append later " $arg" continue ;; -no-suppress) suppress_opt=no continue ;; -Xcompiler) arg_mode=arg # the next one goes into the "base_compile" arg list continue # The current "srcfile" will either be retained or ;; # replaced later. I would guess that would be a bug. -Wc,*) func_stripname '-Wc,' '' "$arg" args=$func_stripname_result lastarg= save_ifs="$IFS"; IFS=',' for arg in $args; do IFS="$save_ifs" func_append_quoted lastarg "$arg" done IFS="$save_ifs" func_stripname ' ' '' "$lastarg" lastarg=$func_stripname_result # Add the arguments to base_compile. func_append base_compile " $lastarg" continue ;; *) # Accept the current argument as the source file. # The previous "srcfile" becomes the current argument. # lastarg="$srcfile" srcfile="$arg" ;; esac # case $arg ;; esac # case $arg_mode # Aesthetically quote the previous argument. func_append_quoted base_compile "$lastarg" done # for arg case $arg_mode in arg) func_fatal_error "you must specify an argument for -Xcompile" ;; target) func_fatal_error "you must specify a target with \`-o'" ;; *) # Get the name of the library object. test -z "$libobj" && { func_basename "$srcfile" libobj="$func_basename_result" } ;; esac # Recognize several different file suffixes. # If the user specifies -o file.o, it is replaced with file.lo case $libobj in *.[cCFSifmso] | \ *.ada | *.adb | *.ads | *.asm | \ *.c++ | *.cc | *.ii | *.class | *.cpp | *.cxx | \ *.[fF][09]? | *.for | *.java | *.go | *.obj | *.sx | *.cu | *.cup) func_xform "$libobj" libobj=$func_xform_result ;; esac case $libobj in *.lo) func_lo2o "$libobj"; obj=$func_lo2o_result ;; *) func_fatal_error "cannot determine name of library object from \`$libobj'" ;; esac func_infer_tag $base_compile for arg in $later; do case $arg in -shared) test "$build_libtool_libs" != yes && \ func_fatal_configuration "can not build a shared library" build_old_libs=no continue ;; -static) build_libtool_libs=no build_old_libs=yes continue ;; -prefer-pic) pic_mode=yes continue ;; -prefer-non-pic) pic_mode=no continue ;; esac done func_quote_for_eval "$libobj" test "X$libobj" != "X$func_quote_for_eval_result" \ && $ECHO "X$libobj" | $GREP '[]~#^*{};<>?"'"'"' &()|`$[]' \ && func_warning "libobj name \`$libobj' may not contain shell special characters." func_dirname_and_basename "$obj" "/" "" objname="$func_basename_result" xdir="$func_dirname_result" lobj=${xdir}$objdir/$objname test -z "$base_compile" && \ func_fatal_help "you must specify a compilation command" # Delete any leftover library objects. if test "$build_old_libs" = yes; then removelist="$obj $lobj $libobj ${libobj}T" else removelist="$lobj $libobj ${libobj}T" fi # On Cygwin there's no "real" PIC flag so we must build both object types case $host_os in cygwin* | mingw* | pw32* | os2* | cegcc*) pic_mode=default ;; esac if test "$pic_mode" = no && test "$deplibs_check_method" != pass_all; then # non-PIC code in shared libraries is not supported pic_mode=default fi # Calculate the filename of the output object if compiler does # not support -o with -c if test "$compiler_c_o" = no; then output_obj=`$ECHO "$srcfile" | $SED 's%^.*/%%; s%\.[^.]*$%%'`.${objext} lockfile="$output_obj.lock" else output_obj= need_locks=no lockfile= fi # Lock this critical section if it is needed # We use this script file to make the link, it avoids creating a new file if test "$need_locks" = yes; then until $opt_dry_run || ln "$progpath" "$lockfile" 2>/dev/null; do func_echo "Waiting for $lockfile to be removed" sleep 2 done elif test "$need_locks" = warn; then if test -f "$lockfile"; then $ECHO "\ *** ERROR, $lockfile exists and contains: `cat $lockfile 2>/dev/null` This indicates that another process is trying to use the same temporary object file, and libtool could not work around it because your compiler does not support \`-c' and \`-o' together. If you repeat this compilation, it may succeed, by chance, but you had better avoid parallel builds (make -j) in this platform, or get a better compiler." $opt_dry_run || $RM $removelist exit $EXIT_FAILURE fi func_append removelist " $output_obj" $ECHO "$srcfile" > "$lockfile" fi $opt_dry_run || $RM $removelist func_append removelist " $lockfile" trap '$opt_dry_run || $RM $removelist; exit $EXIT_FAILURE' 1 2 15 func_to_tool_file "$srcfile" func_convert_file_msys_to_w32 srcfile=$func_to_tool_file_result func_quote_for_eval "$srcfile" qsrcfile=$func_quote_for_eval_result # Only build a PIC object if we are building libtool libraries. if test "$build_libtool_libs" = yes; then # Without this assignment, base_compile gets emptied. fbsd_hideous_sh_bug=$base_compile if test "$pic_mode" != no; then command="$base_compile $qsrcfile $pic_flag" else # Don't build PIC code command="$base_compile $qsrcfile" fi func_mkdir_p "$xdir$objdir" if test -z "$output_obj"; then # Place PIC objects in $objdir func_append command " -o $lobj" fi func_show_eval_locale "$command" \ 'test -n "$output_obj" && $RM $removelist; exit $EXIT_FAILURE' if test "$need_locks" = warn && test "X`cat $lockfile 2>/dev/null`" != "X$srcfile"; then $ECHO "\ *** ERROR, $lockfile contains: `cat $lockfile 2>/dev/null` but it should contain: $srcfile This indicates that another process is trying to use the same temporary object file, and libtool could not work around it because your compiler does not support \`-c' and \`-o' together. If you repeat this compilation, it may succeed, by chance, but you had better avoid parallel builds (make -j) in this platform, or get a better compiler." $opt_dry_run || $RM $removelist exit $EXIT_FAILURE fi # Just move the object if needed, then go on to compile the next one if test -n "$output_obj" && test "X$output_obj" != "X$lobj"; then func_show_eval '$MV "$output_obj" "$lobj"' \ 'error=$?; $opt_dry_run || $RM $removelist; exit $error' fi # Allow error messages only from the first compilation. if test "$suppress_opt" = yes; then suppress_output=' >/dev/null 2>&1' fi fi # Only build a position-dependent object if we build old libraries. if test "$build_old_libs" = yes; then if test "$pic_mode" != yes; then # Don't build PIC code command="$base_compile $qsrcfile$pie_flag" else command="$base_compile $qsrcfile $pic_flag" fi if test "$compiler_c_o" = yes; then func_append command " -o $obj" fi # Suppress compiler output if we already did a PIC compilation. func_append command "$suppress_output" func_show_eval_locale "$command" \ '$opt_dry_run || $RM $removelist; exit $EXIT_FAILURE' if test "$need_locks" = warn && test "X`cat $lockfile 2>/dev/null`" != "X$srcfile"; then $ECHO "\ *** ERROR, $lockfile contains: `cat $lockfile 2>/dev/null` but it should contain: $srcfile This indicates that another process is trying to use the same temporary object file, and libtool could not work around it because your compiler does not support \`-c' and \`-o' together. If you repeat this compilation, it may succeed, by chance, but you had better avoid parallel builds (make -j) in this platform, or get a better compiler." $opt_dry_run || $RM $removelist exit $EXIT_FAILURE fi # Just move the object if needed if test -n "$output_obj" && test "X$output_obj" != "X$obj"; then func_show_eval '$MV "$output_obj" "$obj"' \ 'error=$?; $opt_dry_run || $RM $removelist; exit $error' fi fi $opt_dry_run || { func_write_libtool_object "$libobj" "$objdir/$objname" "$objname" # Unlock the critical section if it was locked if test "$need_locks" != no; then removelist=$lockfile $RM "$lockfile" fi } exit $EXIT_SUCCESS } $opt_help || { test "$opt_mode" = compile && func_mode_compile ${1+"$@"} } func_mode_help () { # We need to display help for each of the modes. case $opt_mode in "") # Generic help is extracted from the usage comments # at the start of this file. func_help ;; clean) $ECHO \ "Usage: $progname [OPTION]... --mode=clean RM [RM-OPTION]... FILE... Remove files from the build directory. RM is the name of the program to use to delete files associated with each FILE (typically \`/bin/rm'). RM-OPTIONS are options (such as \`-f') to be passed to RM. If FILE is a libtool library, object or program, all the files associated with it are deleted. Otherwise, only FILE itself is deleted using RM." ;; compile) $ECHO \ "Usage: $progname [OPTION]... --mode=compile COMPILE-COMMAND... SOURCEFILE Compile a source file into a libtool library object. This mode accepts the following additional options: -o OUTPUT-FILE set the output file name to OUTPUT-FILE -no-suppress do not suppress compiler output for multiple passes -prefer-pic try to build PIC objects only -prefer-non-pic try to build non-PIC objects only -shared do not build a \`.o' file suitable for static linking -static only build a \`.o' file suitable for static linking -Wc,FLAG pass FLAG directly to the compiler COMPILE-COMMAND is a command to be used in creating a \`standard' object file from the given SOURCEFILE. The output file name is determined by removing the directory component from SOURCEFILE, then substituting the C source code suffix \`.c' with the library object suffix, \`.lo'." ;; execute) $ECHO \ "Usage: $progname [OPTION]... --mode=execute COMMAND [ARGS]... Automatically set library path, then run a program. This mode accepts the following additional options: -dlopen FILE add the directory containing FILE to the library path This mode sets the library path environment variable according to \`-dlopen' flags. If any of the ARGS are libtool executable wrappers, then they are translated into their corresponding uninstalled binary, and any of their required library directories are added to the library path. Then, COMMAND is executed, with ARGS as arguments." ;; finish) $ECHO \ "Usage: $progname [OPTION]... --mode=finish [LIBDIR]... Complete the installation of libtool libraries. Each LIBDIR is a directory that contains libtool libraries. The commands that this mode executes may require superuser privileges. Use the \`--dry-run' option if you just want to see what would be executed." ;; install) $ECHO \ "Usage: $progname [OPTION]... --mode=install INSTALL-COMMAND... Install executables or libraries. INSTALL-COMMAND is the installation command. The first component should be either the \`install' or \`cp' program. The following components of INSTALL-COMMAND are treated specially: -inst-prefix-dir PREFIX-DIR Use PREFIX-DIR as a staging area for installation The rest of the components are interpreted as arguments to that command (only BSD-compatible install options are recognized)." ;; link) $ECHO \ "Usage: $progname [OPTION]... --mode=link LINK-COMMAND... Link object files or libraries together to form another library, or to create an executable program. LINK-COMMAND is a command using the C compiler that you would use to create a program from several object files. The following components of LINK-COMMAND are treated specially: -all-static do not do any dynamic linking at all -avoid-version do not add a version suffix if possible -bindir BINDIR specify path to binaries directory (for systems where libraries must be found in the PATH setting at runtime) -dlopen FILE \`-dlpreopen' FILE if it cannot be dlopened at runtime -dlpreopen FILE link in FILE and add its symbols to lt_preloaded_symbols -export-dynamic allow symbols from OUTPUT-FILE to be resolved with dlsym(3) -export-symbols SYMFILE try to export only the symbols listed in SYMFILE -export-symbols-regex REGEX try to export only the symbols matching REGEX -LLIBDIR search LIBDIR for required installed libraries -lNAME OUTPUT-FILE requires the installed library libNAME -module build a library that can dlopened -no-fast-install disable the fast-install mode -no-install link a not-installable executable -no-undefined declare that a library does not refer to external symbols -o OUTPUT-FILE create OUTPUT-FILE from the specified objects -objectlist FILE Use a list of object files found in FILE to specify objects -precious-files-regex REGEX don't remove output files matching REGEX -release RELEASE specify package release information -rpath LIBDIR the created library will eventually be installed in LIBDIR -R[ ]LIBDIR add LIBDIR to the runtime path of programs and libraries -shared only do dynamic linking of libtool libraries -shrext SUFFIX override the standard shared library file extension -static do not do any dynamic linking of uninstalled libtool libraries -static-libtool-libs do not do any dynamic linking of libtool libraries -version-info CURRENT[:REVISION[:AGE]] specify library version info [each variable defaults to 0] -weak LIBNAME declare that the target provides the LIBNAME interface -Wc,FLAG -Xcompiler FLAG pass linker-specific FLAG directly to the compiler -Wl,FLAG -Xlinker FLAG pass linker-specific FLAG directly to the linker -XCClinker FLAG pass link-specific FLAG to the compiler driver (CC) All other options (arguments beginning with \`-') are ignored. Every other argument is treated as a filename. Files ending in \`.la' are treated as uninstalled libtool libraries, other files are standard or library object files. If the OUTPUT-FILE ends in \`.la', then a libtool library is created, only library objects (\`.lo' files) may be specified, and \`-rpath' is required, except when creating a convenience library. If OUTPUT-FILE ends in \`.a' or \`.lib', then a standard library is created using \`ar' and \`ranlib', or on Windows using \`lib'. If OUTPUT-FILE ends in \`.lo' or \`.${objext}', then a reloadable object file is created, otherwise an executable program is created." ;; uninstall) $ECHO \ "Usage: $progname [OPTION]... --mode=uninstall RM [RM-OPTION]... FILE... Remove libraries from an installation directory. RM is the name of the program to use to delete files associated with each FILE (typically \`/bin/rm'). RM-OPTIONS are options (such as \`-f') to be passed to RM. If FILE is a libtool library, all the files associated with it are deleted. Otherwise, only FILE itself is deleted using RM." ;; *) func_fatal_help "invalid operation mode \`$opt_mode'" ;; esac echo $ECHO "Try \`$progname --help' for more information about other modes." } # Now that we've collected a possible --mode arg, show help if necessary if $opt_help; then if test "$opt_help" = :; then func_mode_help else { func_help noexit for opt_mode in compile link execute install finish uninstall clean; do func_mode_help done } | sed -n '1p; 2,$s/^Usage:/ or: /p' { func_help noexit for opt_mode in compile link execute install finish uninstall clean; do echo func_mode_help done } | sed '1d /^When reporting/,/^Report/{ H d } $x /information about other modes/d /more detailed .*MODE/d s/^Usage:.*--mode=\([^ ]*\) .*/Description of \1 mode:/' fi exit $? fi # func_mode_execute arg... func_mode_execute () { $opt_debug # The first argument is the command name. cmd="$nonopt" test -z "$cmd" && \ func_fatal_help "you must specify a COMMAND" # Handle -dlopen flags immediately. for file in $opt_dlopen; do test -f "$file" \ || func_fatal_help "\`$file' is not a file" dir= case $file in *.la) func_resolve_sysroot "$file" file=$func_resolve_sysroot_result # Check to see that this really is a libtool archive. func_lalib_unsafe_p "$file" \ || func_fatal_help "\`$lib' is not a valid libtool archive" # Read the libtool library. dlname= library_names= func_source "$file" # Skip this library if it cannot be dlopened. if test -z "$dlname"; then # Warn if it was a shared library. test -n "$library_names" && \ func_warning "\`$file' was not linked with \`-export-dynamic'" continue fi func_dirname "$file" "" "." dir="$func_dirname_result" if test -f "$dir/$objdir/$dlname"; then func_append dir "/$objdir" else if test ! -f "$dir/$dlname"; then func_fatal_error "cannot find \`$dlname' in \`$dir' or \`$dir/$objdir'" fi fi ;; *.lo) # Just add the directory containing the .lo file. func_dirname "$file" "" "." dir="$func_dirname_result" ;; *) func_warning "\`-dlopen' is ignored for non-libtool libraries and objects" continue ;; esac # Get the absolute pathname. absdir=`cd "$dir" && pwd` test -n "$absdir" && dir="$absdir" # Now add the directory to shlibpath_var. if eval "test -z \"\$$shlibpath_var\""; then eval "$shlibpath_var=\"\$dir\"" else eval "$shlibpath_var=\"\$dir:\$$shlibpath_var\"" fi done # This variable tells wrapper scripts just to set shlibpath_var # rather than running their programs. libtool_execute_magic="$magic" # Check if any of the arguments is a wrapper script. args= for file do case $file in -* | *.la | *.lo ) ;; *) # Do a test to see if this is really a libtool program. if func_ltwrapper_script_p "$file"; then func_source "$file" # Transform arg to wrapped name. file="$progdir/$program" elif func_ltwrapper_executable_p "$file"; then func_ltwrapper_scriptname "$file" func_source "$func_ltwrapper_scriptname_result" # Transform arg to wrapped name. file="$progdir/$program" fi ;; esac # Quote arguments (to preserve shell metacharacters). func_append_quoted args "$file" done if test "X$opt_dry_run" = Xfalse; then if test -n "$shlibpath_var"; then # Export the shlibpath_var. eval "export $shlibpath_var" fi # Restore saved environment variables for lt_var in LANG LANGUAGE LC_ALL LC_CTYPE LC_COLLATE LC_MESSAGES do eval "if test \"\${save_$lt_var+set}\" = set; then $lt_var=\$save_$lt_var; export $lt_var else $lt_unset $lt_var fi" done # Now prepare to actually exec the command. exec_cmd="\$cmd$args" else # Display what would be done. if test -n "$shlibpath_var"; then eval "\$ECHO \"\$shlibpath_var=\$$shlibpath_var\"" echo "export $shlibpath_var" fi $ECHO "$cmd$args" exit $EXIT_SUCCESS fi } test "$opt_mode" = execute && func_mode_execute ${1+"$@"} # func_mode_finish arg... func_mode_finish () { $opt_debug libs= libdirs= admincmds= for opt in "$nonopt" ${1+"$@"} do if test -d "$opt"; then func_append libdirs " $opt" elif test -f "$opt"; then if func_lalib_unsafe_p "$opt"; then func_append libs " $opt" else func_warning "\`$opt' is not a valid libtool archive" fi else func_fatal_error "invalid argument \`$opt'" fi done if test -n "$libs"; then if test -n "$lt_sysroot"; then sysroot_regex=`$ECHO "$lt_sysroot" | $SED "$sed_make_literal_regex"` sysroot_cmd="s/\([ ']\)$sysroot_regex/\1/g;" else sysroot_cmd= fi # Remove sysroot references if $opt_dry_run; then for lib in $libs; do echo "removing references to $lt_sysroot and \`=' prefixes from $lib" done else tmpdir=`func_mktempdir` for lib in $libs; do sed -e "${sysroot_cmd} s/\([ ']-[LR]\)=/\1/g; s/\([ ']\)=/\1/g" $lib \ > $tmpdir/tmp-la mv -f $tmpdir/tmp-la $lib done ${RM}r "$tmpdir" fi fi if test -n "$finish_cmds$finish_eval" && test -n "$libdirs"; then for libdir in $libdirs; do if test -n "$finish_cmds"; then # Do each command in the finish commands. func_execute_cmds "$finish_cmds" 'admincmds="$admincmds '"$cmd"'"' fi if test -n "$finish_eval"; then # Do the single finish_eval. eval cmds=\"$finish_eval\" $opt_dry_run || eval "$cmds" || func_append admincmds " $cmds" fi done fi # Exit here if they wanted silent mode. $opt_silent && exit $EXIT_SUCCESS if test -n "$finish_cmds$finish_eval" && test -n "$libdirs"; then echo "----------------------------------------------------------------------" echo "Libraries have been installed in:" for libdir in $libdirs; do $ECHO " $libdir" done echo echo "If you ever happen to want to link against installed libraries" echo "in a given directory, LIBDIR, you must either use libtool, and" echo "specify the full pathname of the library, or use the \`-LLIBDIR'" echo "flag during linking and do at least one of the following:" if test -n "$shlibpath_var"; then echo " - add LIBDIR to the \`$shlibpath_var' environment variable" echo " during execution" fi if test -n "$runpath_var"; then echo " - add LIBDIR to the \`$runpath_var' environment variable" echo " during linking" fi if test -n "$hardcode_libdir_flag_spec"; then libdir=LIBDIR eval flag=\"$hardcode_libdir_flag_spec\" $ECHO " - use the \`$flag' linker flag" fi if test -n "$admincmds"; then $ECHO " - have your system administrator run these commands:$admincmds" fi if test -f /etc/ld.so.conf; then echo " - have your system administrator add LIBDIR to \`/etc/ld.so.conf'" fi echo echo "See any operating system documentation about shared libraries for" case $host in solaris2.[6789]|solaris2.1[0-9]) echo "more information, such as the ld(1), crle(1) and ld.so(8) manual" echo "pages." ;; *) echo "more information, such as the ld(1) and ld.so(8) manual pages." ;; esac echo "----------------------------------------------------------------------" fi exit $EXIT_SUCCESS } test "$opt_mode" = finish && func_mode_finish ${1+"$@"} # func_mode_install arg... func_mode_install () { $opt_debug # There may be an optional sh(1) argument at the beginning of # install_prog (especially on Windows NT). if test "$nonopt" = "$SHELL" || test "$nonopt" = /bin/sh || # Allow the use of GNU shtool's install command. case $nonopt in *shtool*) :;; *) false;; esac; then # Aesthetically quote it. func_quote_for_eval "$nonopt" install_prog="$func_quote_for_eval_result " arg=$1 shift else install_prog= arg=$nonopt fi # The real first argument should be the name of the installation program. # Aesthetically quote it. func_quote_for_eval "$arg" func_append install_prog "$func_quote_for_eval_result" install_shared_prog=$install_prog case " $install_prog " in *[\\\ /]cp\ *) install_cp=: ;; *) install_cp=false ;; esac # We need to accept at least all the BSD install flags. dest= files= opts= prev= install_type= isdir=no stripme= no_mode=: for arg do arg2= if test -n "$dest"; then func_append files " $dest" dest=$arg continue fi case $arg in -d) isdir=yes ;; -f) if $install_cp; then :; else prev=$arg fi ;; -g | -m | -o) prev=$arg ;; -s) stripme=" -s" continue ;; -*) ;; *) # If the previous option needed an argument, then skip it. if test -n "$prev"; then if test "x$prev" = x-m && test -n "$install_override_mode"; then arg2=$install_override_mode no_mode=false fi prev= else dest=$arg continue fi ;; esac # Aesthetically quote the argument. func_quote_for_eval "$arg" func_append install_prog " $func_quote_for_eval_result" if test -n "$arg2"; then func_quote_for_eval "$arg2" fi func_append install_shared_prog " $func_quote_for_eval_result" done test -z "$install_prog" && \ func_fatal_help "you must specify an install program" test -n "$prev" && \ func_fatal_help "the \`$prev' option requires an argument" if test -n "$install_override_mode" && $no_mode; then if $install_cp; then :; else func_quote_for_eval "$install_override_mode" func_append install_shared_prog " -m $func_quote_for_eval_result" fi fi if test -z "$files"; then if test -z "$dest"; then func_fatal_help "no file or destination specified" else func_fatal_help "you must specify a destination" fi fi # Strip any trailing slash from the destination. func_stripname '' '/' "$dest" dest=$func_stripname_result # Check to see that the destination is a directory. test -d "$dest" && isdir=yes if test "$isdir" = yes; then destdir="$dest" destname= else func_dirname_and_basename "$dest" "" "." destdir="$func_dirname_result" destname="$func_basename_result" # Not a directory, so check to see that there is only one file specified. set dummy $files; shift test "$#" -gt 1 && \ func_fatal_help "\`$dest' is not a directory" fi case $destdir in [\\/]* | [A-Za-z]:[\\/]*) ;; *) for file in $files; do case $file in *.lo) ;; *) func_fatal_help "\`$destdir' must be an absolute directory name" ;; esac done ;; esac # This variable tells wrapper scripts just to set variables rather # than running their programs. libtool_install_magic="$magic" staticlibs= future_libdirs= current_libdirs= for file in $files; do # Do each installation. case $file in *.$libext) # Do the static libraries later. func_append staticlibs " $file" ;; *.la) func_resolve_sysroot "$file" file=$func_resolve_sysroot_result # Check to see that this really is a libtool archive. func_lalib_unsafe_p "$file" \ || func_fatal_help "\`$file' is not a valid libtool archive" library_names= old_library= relink_command= func_source "$file" # Add the libdir to current_libdirs if it is the destination. if test "X$destdir" = "X$libdir"; then case "$current_libdirs " in *" $libdir "*) ;; *) func_append current_libdirs " $libdir" ;; esac else # Note the libdir as a future libdir. case "$future_libdirs " in *" $libdir "*) ;; *) func_append future_libdirs " $libdir" ;; esac fi func_dirname "$file" "/" "" dir="$func_dirname_result" func_append dir "$objdir" if test -n "$relink_command"; then # Determine the prefix the user has applied to our future dir. inst_prefix_dir=`$ECHO "$destdir" | $SED -e "s%$libdir\$%%"` # Don't allow the user to place us outside of our expected # location b/c this prevents finding dependent libraries that # are installed to the same prefix. # At present, this check doesn't affect windows .dll's that # are installed into $libdir/../bin (currently, that works fine) # but it's something to keep an eye on. test "$inst_prefix_dir" = "$destdir" && \ func_fatal_error "error: cannot install \`$file' to a directory not ending in $libdir" if test -n "$inst_prefix_dir"; then # Stick the inst_prefix_dir data into the link command. relink_command=`$ECHO "$relink_command" | $SED "s%@inst_prefix_dir@%-inst-prefix-dir $inst_prefix_dir%"` else relink_command=`$ECHO "$relink_command" | $SED "s%@inst_prefix_dir@%%"` fi func_warning "relinking \`$file'" func_show_eval "$relink_command" \ 'func_fatal_error "error: relink \`$file'\'' with the above command before installing it"' fi # See the names of the shared library. set dummy $library_names; shift if test -n "$1"; then realname="$1" shift srcname="$realname" test -n "$relink_command" && srcname="$realname"T # Install the shared library and build the symlinks. func_show_eval "$install_shared_prog $dir/$srcname $destdir/$realname" \ 'exit $?' tstripme="$stripme" case $host_os in cygwin* | mingw* | pw32* | cegcc*) case $realname in *.dll.a) tstripme="" ;; esac ;; esac if test -n "$tstripme" && test -n "$striplib"; then func_show_eval "$striplib $destdir/$realname" 'exit $?' fi if test "$#" -gt 0; then # Delete the old symlinks, and create new ones. # Try `ln -sf' first, because the `ln' binary might depend on # the symlink we replace! Solaris /bin/ln does not understand -f, # so we also need to try rm && ln -s. for linkname do test "$linkname" != "$realname" \ && func_show_eval "(cd $destdir && { $LN_S -f $realname $linkname || { $RM $linkname && $LN_S $realname $linkname; }; })" done fi # Do each command in the postinstall commands. lib="$destdir/$realname" func_execute_cmds "$postinstall_cmds" 'exit $?' fi # Install the pseudo-library for information purposes. func_basename "$file" name="$func_basename_result" instname="$dir/$name"i func_show_eval "$install_prog $instname $destdir/$name" 'exit $?' # Maybe install the static library, too. test -n "$old_library" && func_append staticlibs " $dir/$old_library" ;; *.lo) # Install (i.e. copy) a libtool object. # Figure out destination file name, if it wasn't already specified. if test -n "$destname"; then destfile="$destdir/$destname" else func_basename "$file" destfile="$func_basename_result" destfile="$destdir/$destfile" fi # Deduce the name of the destination old-style object file. case $destfile in *.lo) func_lo2o "$destfile" staticdest=$func_lo2o_result ;; *.$objext) staticdest="$destfile" destfile= ;; *) func_fatal_help "cannot copy a libtool object to \`$destfile'" ;; esac # Install the libtool object if requested. test -n "$destfile" && \ func_show_eval "$install_prog $file $destfile" 'exit $?' # Install the old object if enabled. if test "$build_old_libs" = yes; then # Deduce the name of the old-style object file. func_lo2o "$file" staticobj=$func_lo2o_result func_show_eval "$install_prog \$staticobj \$staticdest" 'exit $?' fi exit $EXIT_SUCCESS ;; *) # Figure out destination file name, if it wasn't already specified. if test -n "$destname"; then destfile="$destdir/$destname" else func_basename "$file" destfile="$func_basename_result" destfile="$destdir/$destfile" fi # If the file is missing, and there is a .exe on the end, strip it # because it is most likely a libtool script we actually want to # install stripped_ext="" case $file in *.exe) if test ! -f "$file"; then func_stripname '' '.exe' "$file" file=$func_stripname_result stripped_ext=".exe" fi ;; esac # Do a test to see if this is really a libtool program. case $host in *cygwin* | *mingw*) if func_ltwrapper_executable_p "$file"; then func_ltwrapper_scriptname "$file" wrapper=$func_ltwrapper_scriptname_result else func_stripname '' '.exe' "$file" wrapper=$func_stripname_result fi ;; *) wrapper=$file ;; esac if func_ltwrapper_script_p "$wrapper"; then notinst_deplibs= relink_command= func_source "$wrapper" # Check the variables that should have been set. test -z "$generated_by_libtool_version" && \ func_fatal_error "invalid libtool wrapper script \`$wrapper'" finalize=yes for lib in $notinst_deplibs; do # Check to see that each library is installed. libdir= if test -f "$lib"; then func_source "$lib" fi libfile="$libdir/"`$ECHO "$lib" | $SED 's%^.*/%%g'` ### testsuite: skip nested quoting test if test -n "$libdir" && test ! -f "$libfile"; then func_warning "\`$lib' has not been installed in \`$libdir'" finalize=no fi done relink_command= func_source "$wrapper" outputname= if test "$fast_install" = no && test -n "$relink_command"; then $opt_dry_run || { if test "$finalize" = yes; then tmpdir=`func_mktempdir` func_basename "$file$stripped_ext" file="$func_basename_result" outputname="$tmpdir/$file" # Replace the output file specification. relink_command=`$ECHO "$relink_command" | $SED 's%@OUTPUT@%'"$outputname"'%g'` $opt_silent || { func_quote_for_expand "$relink_command" eval "func_echo $func_quote_for_expand_result" } if eval "$relink_command"; then : else func_error "error: relink \`$file' with the above command before installing it" $opt_dry_run || ${RM}r "$tmpdir" continue fi file="$outputname" else func_warning "cannot relink \`$file'" fi } else # Install the binary that we compiled earlier. file=`$ECHO "$file$stripped_ext" | $SED "s%\([^/]*\)$%$objdir/\1%"` fi fi # remove .exe since cygwin /usr/bin/install will append another # one anyway case $install_prog,$host in */usr/bin/install*,*cygwin*) case $file:$destfile in *.exe:*.exe) # this is ok ;; *.exe:*) destfile=$destfile.exe ;; *:*.exe) func_stripname '' '.exe' "$destfile" destfile=$func_stripname_result ;; esac ;; esac func_show_eval "$install_prog\$stripme \$file \$destfile" 'exit $?' $opt_dry_run || if test -n "$outputname"; then ${RM}r "$tmpdir" fi ;; esac done for file in $staticlibs; do func_basename "$file" name="$func_basename_result" # Set up the ranlib parameters. oldlib="$destdir/$name" func_to_tool_file "$oldlib" func_convert_file_msys_to_w32 tool_oldlib=$func_to_tool_file_result func_show_eval "$install_prog \$file \$oldlib" 'exit $?' if test -n "$stripme" && test -n "$old_striplib"; then func_show_eval "$old_striplib $tool_oldlib" 'exit $?' fi # Do each command in the postinstall commands. func_execute_cmds "$old_postinstall_cmds" 'exit $?' done test -n "$future_libdirs" && \ func_warning "remember to run \`$progname --finish$future_libdirs'" if test -n "$current_libdirs"; then # Maybe just do a dry run. $opt_dry_run && current_libdirs=" -n$current_libdirs" exec_cmd='$SHELL $progpath $preserve_args --finish$current_libdirs' else exit $EXIT_SUCCESS fi } test "$opt_mode" = install && func_mode_install ${1+"$@"} # func_generate_dlsyms outputname originator pic_p # Extract symbols from dlprefiles and create ${outputname}S.o with # a dlpreopen symbol table. func_generate_dlsyms () { $opt_debug my_outputname="$1" my_originator="$2" my_pic_p="${3-no}" my_prefix=`$ECHO "$my_originator" | sed 's%[^a-zA-Z0-9]%_%g'` my_dlsyms= if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; then if test -n "$NM" && test -n "$global_symbol_pipe"; then my_dlsyms="${my_outputname}S.c" else func_error "not configured to extract global symbols from dlpreopened files" fi fi if test -n "$my_dlsyms"; then case $my_dlsyms in "") ;; *.c) # Discover the nlist of each of the dlfiles. nlist="$output_objdir/${my_outputname}.nm" func_show_eval "$RM $nlist ${nlist}S ${nlist}T" # Parse the name list into a source file. func_verbose "creating $output_objdir/$my_dlsyms" $opt_dry_run || $ECHO > "$output_objdir/$my_dlsyms" "\ /* $my_dlsyms - symbol resolution table for \`$my_outputname' dlsym emulation. */ /* Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION */ #ifdef __cplusplus extern \"C\" { #endif #if defined(__GNUC__) && (((__GNUC__ == 4) && (__GNUC_MINOR__ >= 4)) || (__GNUC__ > 4)) #pragma GCC diagnostic ignored \"-Wstrict-prototypes\" #endif /* Keep this code in sync between libtool.m4, ltmain, lt_system.h, and tests. */ #if defined(_WIN32) || defined(__CYGWIN__) || defined(_WIN32_WCE) /* DATA imports from DLLs on WIN32 con't be const, because runtime relocations are performed -- see ld's documentation on pseudo-relocs. */ # define LT_DLSYM_CONST #elif defined(__osf__) /* This system does not cope well with relocations in const data. */ # define LT_DLSYM_CONST #else # define LT_DLSYM_CONST const #endif /* External symbol declarations for the compiler. */\ " if test "$dlself" = yes; then func_verbose "generating symbol list for \`$output'" $opt_dry_run || echo ': @PROGRAM@ ' > "$nlist" # Add our own program objects to the symbol list. progfiles=`$ECHO "$objs$old_deplibs" | $SP2NL | $SED "$lo2o" | $NL2SP` for progfile in $progfiles; do func_to_tool_file "$progfile" func_convert_file_msys_to_w32 func_verbose "extracting global C symbols from \`$func_to_tool_file_result'" $opt_dry_run || eval "$NM $func_to_tool_file_result | $global_symbol_pipe >> '$nlist'" done if test -n "$exclude_expsyms"; then $opt_dry_run || { eval '$EGREP -v " ($exclude_expsyms)$" "$nlist" > "$nlist"T' eval '$MV "$nlist"T "$nlist"' } fi if test -n "$export_symbols_regex"; then $opt_dry_run || { eval '$EGREP -e "$export_symbols_regex" "$nlist" > "$nlist"T' eval '$MV "$nlist"T "$nlist"' } fi # Prepare the list of exported symbols if test -z "$export_symbols"; then export_symbols="$output_objdir/$outputname.exp" $opt_dry_run || { $RM $export_symbols eval "${SED} -n -e '/^: @PROGRAM@ $/d' -e 's/^.* \(.*\)$/\1/p' "'< "$nlist" > "$export_symbols"' case $host in *cygwin* | *mingw* | *cegcc* ) eval "echo EXPORTS "'> "$output_objdir/$outputname.def"' eval 'cat "$export_symbols" >> "$output_objdir/$outputname.def"' ;; esac } else $opt_dry_run || { eval "${SED} -e 's/\([].[*^$]\)/\\\\\1/g' -e 's/^/ /' -e 's/$/$/'"' < "$export_symbols" > "$output_objdir/$outputname.exp"' eval '$GREP -f "$output_objdir/$outputname.exp" < "$nlist" > "$nlist"T' eval '$MV "$nlist"T "$nlist"' case $host in *cygwin* | *mingw* | *cegcc* ) eval "echo EXPORTS "'> "$output_objdir/$outputname.def"' eval 'cat "$nlist" >> "$output_objdir/$outputname.def"' ;; esac } fi fi for dlprefile in $dlprefiles; do func_verbose "extracting global C symbols from \`$dlprefile'" func_basename "$dlprefile" name="$func_basename_result" case $host in *cygwin* | *mingw* | *cegcc* ) # if an import library, we need to obtain dlname if func_win32_import_lib_p "$dlprefile"; then func_tr_sh "$dlprefile" eval "curr_lafile=\$libfile_$func_tr_sh_result" dlprefile_dlbasename="" if test -n "$curr_lafile" && func_lalib_p "$curr_lafile"; then # Use subshell, to avoid clobbering current variable values dlprefile_dlname=`source "$curr_lafile" && echo "$dlname"` if test -n "$dlprefile_dlname" ; then func_basename "$dlprefile_dlname" dlprefile_dlbasename="$func_basename_result" else # no lafile. user explicitly requested -dlpreopen . $sharedlib_from_linklib_cmd "$dlprefile" dlprefile_dlbasename=$sharedlib_from_linklib_result fi fi $opt_dry_run || { if test -n "$dlprefile_dlbasename" ; then eval '$ECHO ": $dlprefile_dlbasename" >> "$nlist"' else func_warning "Could not compute DLL name from $name" eval '$ECHO ": $name " >> "$nlist"' fi func_to_tool_file "$dlprefile" func_convert_file_msys_to_w32 eval "$NM \"$func_to_tool_file_result\" 2>/dev/null | $global_symbol_pipe | $SED -e '/I __imp/d' -e 's/I __nm_/D /;s/_nm__//' >> '$nlist'" } else # not an import lib $opt_dry_run || { eval '$ECHO ": $name " >> "$nlist"' func_to_tool_file "$dlprefile" func_convert_file_msys_to_w32 eval "$NM \"$func_to_tool_file_result\" 2>/dev/null | $global_symbol_pipe >> '$nlist'" } fi ;; *) $opt_dry_run || { eval '$ECHO ": $name " >> "$nlist"' func_to_tool_file "$dlprefile" func_convert_file_msys_to_w32 eval "$NM \"$func_to_tool_file_result\" 2>/dev/null | $global_symbol_pipe >> '$nlist'" } ;; esac done $opt_dry_run || { # Make sure we have at least an empty file. test -f "$nlist" || : > "$nlist" if test -n "$exclude_expsyms"; then $EGREP -v " ($exclude_expsyms)$" "$nlist" > "$nlist"T $MV "$nlist"T "$nlist" fi # Try sorting and uniquifying the output. if $GREP -v "^: " < "$nlist" | if sort -k 3 /dev/null 2>&1; then sort -k 3 else sort +2 fi | uniq > "$nlist"S; then : else $GREP -v "^: " < "$nlist" > "$nlist"S fi if test -f "$nlist"S; then eval "$global_symbol_to_cdecl"' < "$nlist"S >> "$output_objdir/$my_dlsyms"' else echo '/* NONE */' >> "$output_objdir/$my_dlsyms" fi echo >> "$output_objdir/$my_dlsyms" "\ /* The mapping between symbol names and symbols. */ typedef struct { const char *name; void *address; } lt_dlsymlist; extern LT_DLSYM_CONST lt_dlsymlist lt_${my_prefix}_LTX_preloaded_symbols[]; LT_DLSYM_CONST lt_dlsymlist lt_${my_prefix}_LTX_preloaded_symbols[] = {\ { \"$my_originator\", (void *) 0 }," case $need_lib_prefix in no) eval "$global_symbol_to_c_name_address" < "$nlist" >> "$output_objdir/$my_dlsyms" ;; *) eval "$global_symbol_to_c_name_address_lib_prefix" < "$nlist" >> "$output_objdir/$my_dlsyms" ;; esac echo >> "$output_objdir/$my_dlsyms" "\ {0, (void *) 0} }; /* This works around a problem in FreeBSD linker */ #ifdef FREEBSD_WORKAROUND static const void *lt_preloaded_setup() { return lt_${my_prefix}_LTX_preloaded_symbols; } #endif #ifdef __cplusplus } #endif\ " } # !$opt_dry_run pic_flag_for_symtable= case "$compile_command " in *" -static "*) ;; *) case $host in # compiling the symbol table file with pic_flag works around # a FreeBSD bug that causes programs to crash when -lm is # linked before any other PIC object. But we must not use # pic_flag when linking with -static. The problem exists in # FreeBSD 2.2.6 and is fixed in FreeBSD 3.1. *-*-freebsd2.*|*-*-freebsd3.0*|*-*-freebsdelf3.0*) pic_flag_for_symtable=" $pic_flag -DFREEBSD_WORKAROUND" ;; *-*-hpux*) pic_flag_for_symtable=" $pic_flag" ;; *) if test "X$my_pic_p" != Xno; then pic_flag_for_symtable=" $pic_flag" fi ;; esac ;; esac symtab_cflags= for arg in $LTCFLAGS; do case $arg in -pie | -fpie | -fPIE) ;; *) func_append symtab_cflags " $arg" ;; esac done # Now compile the dynamic symbol file. func_show_eval '(cd $output_objdir && $LTCC$symtab_cflags -c$no_builtin_flag$pic_flag_for_symtable "$my_dlsyms")' 'exit $?' # Clean up the generated files. func_show_eval '$RM "$output_objdir/$my_dlsyms" "$nlist" "${nlist}S" "${nlist}T"' # Transform the symbol file into the correct name. symfileobj="$output_objdir/${my_outputname}S.$objext" case $host in *cygwin* | *mingw* | *cegcc* ) if test -f "$output_objdir/$my_outputname.def"; then compile_command=`$ECHO "$compile_command" | $SED "s%@SYMFILE@%$output_objdir/$my_outputname.def $symfileobj%"` finalize_command=`$ECHO "$finalize_command" | $SED "s%@SYMFILE@%$output_objdir/$my_outputname.def $symfileobj%"` else compile_command=`$ECHO "$compile_command" | $SED "s%@SYMFILE@%$symfileobj%"` finalize_command=`$ECHO "$finalize_command" | $SED "s%@SYMFILE@%$symfileobj%"` fi ;; *) compile_command=`$ECHO "$compile_command" | $SED "s%@SYMFILE@%$symfileobj%"` finalize_command=`$ECHO "$finalize_command" | $SED "s%@SYMFILE@%$symfileobj%"` ;; esac ;; *) func_fatal_error "unknown suffix for \`$my_dlsyms'" ;; esac else # We keep going just in case the user didn't refer to # lt_preloaded_symbols. The linker will fail if global_symbol_pipe # really was required. # Nullify the symbol file. compile_command=`$ECHO "$compile_command" | $SED "s% @SYMFILE@%%"` finalize_command=`$ECHO "$finalize_command" | $SED "s% @SYMFILE@%%"` fi } # func_win32_libid arg # return the library type of file 'arg' # # Need a lot of goo to handle *both* DLLs and import libs # Has to be a shell function in order to 'eat' the argument # that is supplied when $file_magic_command is called. # Despite the name, also deal with 64 bit binaries. func_win32_libid () { $opt_debug win32_libid_type="unknown" win32_fileres=`file -L $1 2>/dev/null` case $win32_fileres in *ar\ archive\ import\ library*) # definitely import win32_libid_type="x86 archive import" ;; *ar\ archive*) # could be an import, or static # Keep the egrep pattern in sync with the one in _LT_CHECK_MAGIC_METHOD. if eval $OBJDUMP -f $1 | $SED -e '10q' 2>/dev/null | $EGREP 'file format (pei*-i386(.*architecture: i386)?|pe-arm-wince|pe-x86-64)' >/dev/null; then func_to_tool_file "$1" func_convert_file_msys_to_w32 win32_nmres=`eval $NM -f posix -A \"$func_to_tool_file_result\" | $SED -n -e ' 1,100{ / I /{ s,.*,import, p q } }'` case $win32_nmres in import*) win32_libid_type="x86 archive import";; *) win32_libid_type="x86 archive static";; esac fi ;; *DLL*) win32_libid_type="x86 DLL" ;; *executable*) # but shell scripts are "executable" too... case $win32_fileres in *MS\ Windows\ PE\ Intel*) win32_libid_type="x86 DLL" ;; esac ;; esac $ECHO "$win32_libid_type" } # func_cygming_dll_for_implib ARG # # Platform-specific function to extract the # name of the DLL associated with the specified # import library ARG. # Invoked by eval'ing the libtool variable # $sharedlib_from_linklib_cmd # Result is available in the variable # $sharedlib_from_linklib_result func_cygming_dll_for_implib () { $opt_debug sharedlib_from_linklib_result=`$DLLTOOL --identify-strict --identify "$1"` } # func_cygming_dll_for_implib_fallback_core SECTION_NAME LIBNAMEs # # The is the core of a fallback implementation of a # platform-specific function to extract the name of the # DLL associated with the specified import library LIBNAME. # # SECTION_NAME is either .idata$6 or .idata$7, depending # on the platform and compiler that created the implib. # # Echos the name of the DLL associated with the # specified import library. func_cygming_dll_for_implib_fallback_core () { $opt_debug match_literal=`$ECHO "$1" | $SED "$sed_make_literal_regex"` $OBJDUMP -s --section "$1" "$2" 2>/dev/null | $SED '/^Contents of section '"$match_literal"':/{ # Place marker at beginning of archive member dllname section s/.*/====MARK====/ p d } # These lines can sometimes be longer than 43 characters, but # are always uninteresting /:[ ]*file format pe[i]\{,1\}-/d /^In archive [^:]*:/d # Ensure marker is printed /^====MARK====/p # Remove all lines with less than 43 characters /^.\{43\}/!d # From remaining lines, remove first 43 characters s/^.\{43\}//' | $SED -n ' # Join marker and all lines until next marker into a single line /^====MARK====/ b para H $ b para b :para x s/\n//g # Remove the marker s/^====MARK====// # Remove trailing dots and whitespace s/[\. \t]*$// # Print /./p' | # we now have a list, one entry per line, of the stringified # contents of the appropriate section of all members of the # archive which possess that section. Heuristic: eliminate # all those which have a first or second character that is # a '.' (that is, objdump's representation of an unprintable # character.) This should work for all archives with less than # 0x302f exports -- but will fail for DLLs whose name actually # begins with a literal '.' or a single character followed by # a '.'. # # Of those that remain, print the first one. $SED -e '/^\./d;/^.\./d;q' } # func_cygming_gnu_implib_p ARG # This predicate returns with zero status (TRUE) if # ARG is a GNU/binutils-style import library. Returns # with nonzero status (FALSE) otherwise. func_cygming_gnu_implib_p () { $opt_debug func_to_tool_file "$1" func_convert_file_msys_to_w32 func_cygming_gnu_implib_tmp=`$NM "$func_to_tool_file_result" | eval "$global_symbol_pipe" | $EGREP ' (_head_[A-Za-z0-9_]+_[ad]l*|[A-Za-z0-9_]+_[ad]l*_iname)$'` test -n "$func_cygming_gnu_implib_tmp" } # func_cygming_ms_implib_p ARG # This predicate returns with zero status (TRUE) if # ARG is an MS-style import library. Returns # with nonzero status (FALSE) otherwise. func_cygming_ms_implib_p () { $opt_debug func_to_tool_file "$1" func_convert_file_msys_to_w32 func_cygming_ms_implib_tmp=`$NM "$func_to_tool_file_result" | eval "$global_symbol_pipe" | $GREP '_NULL_IMPORT_DESCRIPTOR'` test -n "$func_cygming_ms_implib_tmp" } # func_cygming_dll_for_implib_fallback ARG # Platform-specific function to extract the # name of the DLL associated with the specified # import library ARG. # # This fallback implementation is for use when $DLLTOOL # does not support the --identify-strict option. # Invoked by eval'ing the libtool variable # $sharedlib_from_linklib_cmd # Result is available in the variable # $sharedlib_from_linklib_result func_cygming_dll_for_implib_fallback () { $opt_debug if func_cygming_gnu_implib_p "$1" ; then # binutils import library sharedlib_from_linklib_result=`func_cygming_dll_for_implib_fallback_core '.idata$7' "$1"` elif func_cygming_ms_implib_p "$1" ; then # ms-generated import library sharedlib_from_linklib_result=`func_cygming_dll_for_implib_fallback_core '.idata$6' "$1"` else # unknown sharedlib_from_linklib_result="" fi } # func_extract_an_archive dir oldlib func_extract_an_archive () { $opt_debug f_ex_an_ar_dir="$1"; shift f_ex_an_ar_oldlib="$1" if test "$lock_old_archive_extraction" = yes; then lockfile=$f_ex_an_ar_oldlib.lock until $opt_dry_run || ln "$progpath" "$lockfile" 2>/dev/null; do func_echo "Waiting for $lockfile to be removed" sleep 2 done fi func_show_eval "(cd \$f_ex_an_ar_dir && $AR x \"\$f_ex_an_ar_oldlib\")" \ 'stat=$?; rm -f "$lockfile"; exit $stat' if test "$lock_old_archive_extraction" = yes; then $opt_dry_run || rm -f "$lockfile" fi if ($AR t "$f_ex_an_ar_oldlib" | sort | sort -uc >/dev/null 2>&1); then : else func_fatal_error "object name conflicts in archive: $f_ex_an_ar_dir/$f_ex_an_ar_oldlib" fi } # func_extract_archives gentop oldlib ... func_extract_archives () { $opt_debug my_gentop="$1"; shift my_oldlibs=${1+"$@"} my_oldobjs="" my_xlib="" my_xabs="" my_xdir="" for my_xlib in $my_oldlibs; do # Extract the objects. case $my_xlib in [\\/]* | [A-Za-z]:[\\/]*) my_xabs="$my_xlib" ;; *) my_xabs=`pwd`"/$my_xlib" ;; esac func_basename "$my_xlib" my_xlib="$func_basename_result" my_xlib_u=$my_xlib while :; do case " $extracted_archives " in *" $my_xlib_u "*) func_arith $extracted_serial + 1 extracted_serial=$func_arith_result my_xlib_u=lt$extracted_serial-$my_xlib ;; *) break ;; esac done extracted_archives="$extracted_archives $my_xlib_u" my_xdir="$my_gentop/$my_xlib_u" func_mkdir_p "$my_xdir" case $host in *-darwin*) func_verbose "Extracting $my_xabs" # Do not bother doing anything if just a dry run $opt_dry_run || { darwin_orig_dir=`pwd` cd $my_xdir || exit $? darwin_archive=$my_xabs darwin_curdir=`pwd` darwin_base_archive=`basename "$darwin_archive"` darwin_arches=`$LIPO -info "$darwin_archive" 2>/dev/null | $GREP Architectures 2>/dev/null || true` if test -n "$darwin_arches"; then darwin_arches=`$ECHO "$darwin_arches" | $SED -e 's/.*are://'` darwin_arch= func_verbose "$darwin_base_archive has multiple architectures $darwin_arches" for darwin_arch in $darwin_arches ; do func_mkdir_p "unfat-$$/${darwin_base_archive}-${darwin_arch}" $LIPO -thin $darwin_arch -output "unfat-$$/${darwin_base_archive}-${darwin_arch}/${darwin_base_archive}" "${darwin_archive}" cd "unfat-$$/${darwin_base_archive}-${darwin_arch}" func_extract_an_archive "`pwd`" "${darwin_base_archive}" cd "$darwin_curdir" $RM "unfat-$$/${darwin_base_archive}-${darwin_arch}/${darwin_base_archive}" done # $darwin_arches ## Okay now we've a bunch of thin objects, gotta fatten them up :) darwin_filelist=`find unfat-$$ -type f -name \*.o -print -o -name \*.lo -print | $SED -e "$basename" | sort -u` darwin_file= darwin_files= for darwin_file in $darwin_filelist; do darwin_files=`find unfat-$$ -name $darwin_file -print | sort | $NL2SP` $LIPO -create -output "$darwin_file" $darwin_files done # $darwin_filelist $RM -rf unfat-$$ cd "$darwin_orig_dir" else cd $darwin_orig_dir func_extract_an_archive "$my_xdir" "$my_xabs" fi # $darwin_arches } # !$opt_dry_run ;; *) func_extract_an_archive "$my_xdir" "$my_xabs" ;; esac my_oldobjs="$my_oldobjs "`find $my_xdir -name \*.$objext -print -o -name \*.lo -print | sort | $NL2SP` done func_extract_archives_result="$my_oldobjs" } # func_emit_wrapper [arg=no] # # Emit a libtool wrapper script on stdout. # Don't directly open a file because we may want to # incorporate the script contents within a cygwin/mingw # wrapper executable. Must ONLY be called from within # func_mode_link because it depends on a number of variables # set therein. # # ARG is the value that the WRAPPER_SCRIPT_BELONGS_IN_OBJDIR # variable will take. If 'yes', then the emitted script # will assume that the directory in which it is stored is # the $objdir directory. This is a cygwin/mingw-specific # behavior. func_emit_wrapper () { func_emit_wrapper_arg1=${1-no} $ECHO "\ #! $SHELL # $output - temporary wrapper script for $objdir/$outputname # Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION # # The $output program cannot be directly executed until all the libtool # libraries that it depends on are installed. # # This wrapper script should never be moved out of the build directory. # If it is, it will not operate correctly. # Sed substitution that helps us do robust quoting. It backslashifies # metacharacters that are still active within double-quoted strings. sed_quote_subst='$sed_quote_subst' # Be Bourne compatible if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then emulate sh NULLCMD=: # Zsh 3.x and 4.x performs word splitting on \${1+\"\$@\"}, which # is contrary to our usage. Disable this feature. alias -g '\${1+\"\$@\"}'='\"\$@\"' setopt NO_GLOB_SUBST else case \`(set -o) 2>/dev/null\` in *posix*) set -o posix;; esac fi BIN_SH=xpg4; export BIN_SH # for Tru64 DUALCASE=1; export DUALCASE # for MKS sh # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH relink_command=\"$relink_command\" # This environment variable determines our operation mode. if test \"\$libtool_install_magic\" = \"$magic\"; then # install mode needs the following variables: generated_by_libtool_version='$macro_version' notinst_deplibs='$notinst_deplibs' else # When we are sourced in execute mode, \$file and \$ECHO are already set. if test \"\$libtool_execute_magic\" != \"$magic\"; then file=\"\$0\"" qECHO=`$ECHO "$ECHO" | $SED "$sed_quote_subst"` $ECHO "\ # A function that is used when there is no print builtin or printf. func_fallback_echo () { eval 'cat <<_LTECHO_EOF \$1 _LTECHO_EOF' } ECHO=\"$qECHO\" fi # Very basic option parsing. These options are (a) specific to # the libtool wrapper, (b) are identical between the wrapper # /script/ and the wrapper /executable/ which is used only on # windows platforms, and (c) all begin with the string "--lt-" # (application programs are unlikely to have options which match # this pattern). # # There are only two supported options: --lt-debug and # --lt-dump-script. There is, deliberately, no --lt-help. # # The first argument to this parsing function should be the # script's $0 value, followed by "$@". lt_option_debug= func_parse_lt_options () { lt_script_arg0=\$0 shift for lt_opt do case \"\$lt_opt\" in --lt-debug) lt_option_debug=1 ;; --lt-dump-script) lt_dump_D=\`\$ECHO \"X\$lt_script_arg0\" | $SED -e 's/^X//' -e 's%/[^/]*$%%'\` test \"X\$lt_dump_D\" = \"X\$lt_script_arg0\" && lt_dump_D=. lt_dump_F=\`\$ECHO \"X\$lt_script_arg0\" | $SED -e 's/^X//' -e 's%^.*/%%'\` cat \"\$lt_dump_D/\$lt_dump_F\" exit 0 ;; --lt-*) \$ECHO \"Unrecognized --lt- option: '\$lt_opt'\" 1>&2 exit 1 ;; esac done # Print the debug banner immediately: if test -n \"\$lt_option_debug\"; then echo \"${outputname}:${output}:\${LINENO}: libtool wrapper (GNU $PACKAGE$TIMESTAMP) $VERSION\" 1>&2 fi } # Used when --lt-debug. Prints its arguments to stdout # (redirection is the responsibility of the caller) func_lt_dump_args () { lt_dump_args_N=1; for lt_arg do \$ECHO \"${outputname}:${output}:\${LINENO}: newargv[\$lt_dump_args_N]: \$lt_arg\" lt_dump_args_N=\`expr \$lt_dump_args_N + 1\` done } # Core function for launching the target application func_exec_program_core () { " case $host in # Backslashes separate directories on plain windows *-*-mingw | *-*-os2* | *-cegcc*) $ECHO "\ if test -n \"\$lt_option_debug\"; then \$ECHO \"${outputname}:${output}:\${LINENO}: newargv[0]: \$progdir\\\\\$program\" 1>&2 func_lt_dump_args \${1+\"\$@\"} 1>&2 fi exec \"\$progdir\\\\\$program\" \${1+\"\$@\"} " ;; *) $ECHO "\ if test -n \"\$lt_option_debug\"; then \$ECHO \"${outputname}:${output}:\${LINENO}: newargv[0]: \$progdir/\$program\" 1>&2 func_lt_dump_args \${1+\"\$@\"} 1>&2 fi exec \"\$progdir/\$program\" \${1+\"\$@\"} " ;; esac $ECHO "\ \$ECHO \"\$0: cannot exec \$program \$*\" 1>&2 exit 1 } # A function to encapsulate launching the target application # Strips options in the --lt-* namespace from \$@ and # launches target application with the remaining arguments. func_exec_program () { case \" \$* \" in *\\ --lt-*) for lt_wr_arg do case \$lt_wr_arg in --lt-*) ;; *) set x \"\$@\" \"\$lt_wr_arg\"; shift;; esac shift done ;; esac func_exec_program_core \${1+\"\$@\"} } # Parse options func_parse_lt_options \"\$0\" \${1+\"\$@\"} # Find the directory that this script lives in. thisdir=\`\$ECHO \"\$file\" | $SED 's%/[^/]*$%%'\` test \"x\$thisdir\" = \"x\$file\" && thisdir=. # Follow symbolic links until we get to the real thisdir. file=\`ls -ld \"\$file\" | $SED -n 's/.*-> //p'\` while test -n \"\$file\"; do destdir=\`\$ECHO \"\$file\" | $SED 's%/[^/]*\$%%'\` # If there was a directory component, then change thisdir. if test \"x\$destdir\" != \"x\$file\"; then case \"\$destdir\" in [\\\\/]* | [A-Za-z]:[\\\\/]*) thisdir=\"\$destdir\" ;; *) thisdir=\"\$thisdir/\$destdir\" ;; esac fi file=\`\$ECHO \"\$file\" | $SED 's%^.*/%%'\` file=\`ls -ld \"\$thisdir/\$file\" | $SED -n 's/.*-> //p'\` done # Usually 'no', except on cygwin/mingw when embedded into # the cwrapper. WRAPPER_SCRIPT_BELONGS_IN_OBJDIR=$func_emit_wrapper_arg1 if test \"\$WRAPPER_SCRIPT_BELONGS_IN_OBJDIR\" = \"yes\"; then # special case for '.' if test \"\$thisdir\" = \".\"; then thisdir=\`pwd\` fi # remove .libs from thisdir case \"\$thisdir\" in *[\\\\/]$objdir ) thisdir=\`\$ECHO \"\$thisdir\" | $SED 's%[\\\\/][^\\\\/]*$%%'\` ;; $objdir ) thisdir=. ;; esac fi # Try to get the absolute directory name. absdir=\`cd \"\$thisdir\" && pwd\` test -n \"\$absdir\" && thisdir=\"\$absdir\" " if test "$fast_install" = yes; then $ECHO "\ program=lt-'$outputname'$exeext progdir=\"\$thisdir/$objdir\" if test ! -f \"\$progdir/\$program\" || { file=\`ls -1dt \"\$progdir/\$program\" \"\$progdir/../\$program\" 2>/dev/null | ${SED} 1q\`; \\ test \"X\$file\" != \"X\$progdir/\$program\"; }; then file=\"\$\$-\$program\" if test ! -d \"\$progdir\"; then $MKDIR \"\$progdir\" else $RM \"\$progdir/\$file\" fi" $ECHO "\ # relink executable if necessary if test -n \"\$relink_command\"; then if relink_command_output=\`eval \$relink_command 2>&1\`; then : else $ECHO \"\$relink_command_output\" >&2 $RM \"\$progdir/\$file\" exit 1 fi fi $MV \"\$progdir/\$file\" \"\$progdir/\$program\" 2>/dev/null || { $RM \"\$progdir/\$program\"; $MV \"\$progdir/\$file\" \"\$progdir/\$program\"; } $RM \"\$progdir/\$file\" fi" else $ECHO "\ program='$outputname' progdir=\"\$thisdir/$objdir\" " fi $ECHO "\ if test -f \"\$progdir/\$program\"; then" # fixup the dll searchpath if we need to. # # Fix the DLL searchpath if we need to. Do this before prepending # to shlibpath, because on Windows, both are PATH and uninstalled # libraries must come first. if test -n "$dllsearchpath"; then $ECHO "\ # Add the dll search path components to the executable PATH PATH=$dllsearchpath:\$PATH " fi # Export our shlibpath_var if we have one. if test "$shlibpath_overrides_runpath" = yes && test -n "$shlibpath_var" && test -n "$temp_rpath"; then $ECHO "\ # Add our own library path to $shlibpath_var $shlibpath_var=\"$temp_rpath\$$shlibpath_var\" # Some systems cannot cope with colon-terminated $shlibpath_var # The second colon is a workaround for a bug in BeOS R4 sed $shlibpath_var=\`\$ECHO \"\$$shlibpath_var\" | $SED 's/::*\$//'\` export $shlibpath_var " fi $ECHO "\ if test \"\$libtool_execute_magic\" != \"$magic\"; then # Run the actual program with our arguments. func_exec_program \${1+\"\$@\"} fi else # The program doesn't exist. \$ECHO \"\$0: error: \\\`\$progdir/\$program' does not exist\" 1>&2 \$ECHO \"This script is just a wrapper for \$program.\" 1>&2 \$ECHO \"See the $PACKAGE documentation for more information.\" 1>&2 exit 1 fi fi\ " } # func_emit_cwrapperexe_src # emit the source code for a wrapper executable on stdout # Must ONLY be called from within func_mode_link because # it depends on a number of variable set therein. func_emit_cwrapperexe_src () { cat < #include #ifdef _MSC_VER # include # include # include #else # include # include # ifdef __CYGWIN__ # include # endif #endif #include #include #include #include #include #include #include #include /* declarations of non-ANSI functions */ #if defined(__MINGW32__) # ifdef __STRICT_ANSI__ int _putenv (const char *); # endif #elif defined(__CYGWIN__) # ifdef __STRICT_ANSI__ char *realpath (const char *, char *); int putenv (char *); int setenv (const char *, const char *, int); # endif /* #elif defined (other platforms) ... */ #endif /* portability defines, excluding path handling macros */ #if defined(_MSC_VER) # define setmode _setmode # define stat _stat # define chmod _chmod # define getcwd _getcwd # define putenv _putenv # define S_IXUSR _S_IEXEC # ifndef _INTPTR_T_DEFINED # define _INTPTR_T_DEFINED # define intptr_t int # endif #elif defined(__MINGW32__) # define setmode _setmode # define stat _stat # define chmod _chmod # define getcwd _getcwd # define putenv _putenv #elif defined(__CYGWIN__) # define HAVE_SETENV # define FOPEN_WB "wb" /* #elif defined (other platforms) ... */ #endif #if defined(PATH_MAX) # define LT_PATHMAX PATH_MAX #elif defined(MAXPATHLEN) # define LT_PATHMAX MAXPATHLEN #else # define LT_PATHMAX 1024 #endif #ifndef S_IXOTH # define S_IXOTH 0 #endif #ifndef S_IXGRP # define S_IXGRP 0 #endif /* path handling portability macros */ #ifndef DIR_SEPARATOR # define DIR_SEPARATOR '/' # define PATH_SEPARATOR ':' #endif #if defined (_WIN32) || defined (__MSDOS__) || defined (__DJGPP__) || \ defined (__OS2__) # define HAVE_DOS_BASED_FILE_SYSTEM # define FOPEN_WB "wb" # ifndef DIR_SEPARATOR_2 # define DIR_SEPARATOR_2 '\\' # endif # ifndef PATH_SEPARATOR_2 # define PATH_SEPARATOR_2 ';' # endif #endif #ifndef DIR_SEPARATOR_2 # define IS_DIR_SEPARATOR(ch) ((ch) == DIR_SEPARATOR) #else /* DIR_SEPARATOR_2 */ # define IS_DIR_SEPARATOR(ch) \ (((ch) == DIR_SEPARATOR) || ((ch) == DIR_SEPARATOR_2)) #endif /* DIR_SEPARATOR_2 */ #ifndef PATH_SEPARATOR_2 # define IS_PATH_SEPARATOR(ch) ((ch) == PATH_SEPARATOR) #else /* PATH_SEPARATOR_2 */ # define IS_PATH_SEPARATOR(ch) ((ch) == PATH_SEPARATOR_2) #endif /* PATH_SEPARATOR_2 */ #ifndef FOPEN_WB # define FOPEN_WB "w" #endif #ifndef _O_BINARY # define _O_BINARY 0 #endif #define XMALLOC(type, num) ((type *) xmalloc ((num) * sizeof(type))) #define XFREE(stale) do { \ if (stale) { free ((void *) stale); stale = 0; } \ } while (0) #if defined(LT_DEBUGWRAPPER) static int lt_debug = 1; #else static int lt_debug = 0; #endif const char *program_name = "libtool-wrapper"; /* in case xstrdup fails */ void *xmalloc (size_t num); char *xstrdup (const char *string); const char *base_name (const char *name); char *find_executable (const char *wrapper); char *chase_symlinks (const char *pathspec); int make_executable (const char *path); int check_executable (const char *path); char *strendzap (char *str, const char *pat); void lt_debugprintf (const char *file, int line, const char *fmt, ...); void lt_fatal (const char *file, int line, const char *message, ...); static const char *nonnull (const char *s); static const char *nonempty (const char *s); void lt_setenv (const char *name, const char *value); char *lt_extend_str (const char *orig_value, const char *add, int to_end); void lt_update_exe_path (const char *name, const char *value); void lt_update_lib_path (const char *name, const char *value); char **prepare_spawn (char **argv); void lt_dump_script (FILE *f); EOF cat <= 0) && (st.st_mode & (S_IXUSR | S_IXGRP | S_IXOTH))) return 1; else return 0; } int make_executable (const char *path) { int rval = 0; struct stat st; lt_debugprintf (__FILE__, __LINE__, "(make_executable): %s\n", nonempty (path)); if ((!path) || (!*path)) return 0; if (stat (path, &st) >= 0) { rval = chmod (path, st.st_mode | S_IXOTH | S_IXGRP | S_IXUSR); } return rval; } /* Searches for the full path of the wrapper. Returns newly allocated full path name if found, NULL otherwise Does not chase symlinks, even on platforms that support them. */ char * find_executable (const char *wrapper) { int has_slash = 0; const char *p; const char *p_next; /* static buffer for getcwd */ char tmp[LT_PATHMAX + 1]; int tmp_len; char *concat_name; lt_debugprintf (__FILE__, __LINE__, "(find_executable): %s\n", nonempty (wrapper)); if ((wrapper == NULL) || (*wrapper == '\0')) return NULL; /* Absolute path? */ #if defined (HAVE_DOS_BASED_FILE_SYSTEM) if (isalpha ((unsigned char) wrapper[0]) && wrapper[1] == ':') { concat_name = xstrdup (wrapper); if (check_executable (concat_name)) return concat_name; XFREE (concat_name); } else { #endif if (IS_DIR_SEPARATOR (wrapper[0])) { concat_name = xstrdup (wrapper); if (check_executable (concat_name)) return concat_name; XFREE (concat_name); } #if defined (HAVE_DOS_BASED_FILE_SYSTEM) } #endif for (p = wrapper; *p; p++) if (*p == '/') { has_slash = 1; break; } if (!has_slash) { /* no slashes; search PATH */ const char *path = getenv ("PATH"); if (path != NULL) { for (p = path; *p; p = p_next) { const char *q; size_t p_len; for (q = p; *q; q++) if (IS_PATH_SEPARATOR (*q)) break; p_len = q - p; p_next = (*q == '\0' ? q : q + 1); if (p_len == 0) { /* empty path: current directory */ if (getcwd (tmp, LT_PATHMAX) == NULL) lt_fatal (__FILE__, __LINE__, "getcwd failed: %s", nonnull (strerror (errno))); tmp_len = strlen (tmp); concat_name = XMALLOC (char, tmp_len + 1 + strlen (wrapper) + 1); memcpy (concat_name, tmp, tmp_len); concat_name[tmp_len] = '/'; strcpy (concat_name + tmp_len + 1, wrapper); } else { concat_name = XMALLOC (char, p_len + 1 + strlen (wrapper) + 1); memcpy (concat_name, p, p_len); concat_name[p_len] = '/'; strcpy (concat_name + p_len + 1, wrapper); } if (check_executable (concat_name)) return concat_name; XFREE (concat_name); } } /* not found in PATH; assume curdir */ } /* Relative path | not found in path: prepend cwd */ if (getcwd (tmp, LT_PATHMAX) == NULL) lt_fatal (__FILE__, __LINE__, "getcwd failed: %s", nonnull (strerror (errno))); tmp_len = strlen (tmp); concat_name = XMALLOC (char, tmp_len + 1 + strlen (wrapper) + 1); memcpy (concat_name, tmp, tmp_len); concat_name[tmp_len] = '/'; strcpy (concat_name + tmp_len + 1, wrapper); if (check_executable (concat_name)) return concat_name; XFREE (concat_name); return NULL; } char * chase_symlinks (const char *pathspec) { #ifndef S_ISLNK return xstrdup (pathspec); #else char buf[LT_PATHMAX]; struct stat s; char *tmp_pathspec = xstrdup (pathspec); char *p; int has_symlinks = 0; while (strlen (tmp_pathspec) && !has_symlinks) { lt_debugprintf (__FILE__, __LINE__, "checking path component for symlinks: %s\n", tmp_pathspec); if (lstat (tmp_pathspec, &s) == 0) { if (S_ISLNK (s.st_mode) != 0) { has_symlinks = 1; break; } /* search backwards for last DIR_SEPARATOR */ p = tmp_pathspec + strlen (tmp_pathspec) - 1; while ((p > tmp_pathspec) && (!IS_DIR_SEPARATOR (*p))) p--; if ((p == tmp_pathspec) && (!IS_DIR_SEPARATOR (*p))) { /* no more DIR_SEPARATORS left */ break; } *p = '\0'; } else { lt_fatal (__FILE__, __LINE__, "error accessing file \"%s\": %s", tmp_pathspec, nonnull (strerror (errno))); } } XFREE (tmp_pathspec); if (!has_symlinks) { return xstrdup (pathspec); } tmp_pathspec = realpath (pathspec, buf); if (tmp_pathspec == 0) { lt_fatal (__FILE__, __LINE__, "could not follow symlinks for %s", pathspec); } return xstrdup (tmp_pathspec); #endif } char * strendzap (char *str, const char *pat) { size_t len, patlen; assert (str != NULL); assert (pat != NULL); len = strlen (str); patlen = strlen (pat); if (patlen <= len) { str += len - patlen; if (strcmp (str, pat) == 0) *str = '\0'; } return str; } void lt_debugprintf (const char *file, int line, const char *fmt, ...) { va_list args; if (lt_debug) { (void) fprintf (stderr, "%s:%s:%d: ", program_name, file, line); va_start (args, fmt); (void) vfprintf (stderr, fmt, args); va_end (args); } } static void lt_error_core (int exit_status, const char *file, int line, const char *mode, const char *message, va_list ap) { fprintf (stderr, "%s:%s:%d: %s: ", program_name, file, line, mode); vfprintf (stderr, message, ap); fprintf (stderr, ".\n"); if (exit_status >= 0) exit (exit_status); } void lt_fatal (const char *file, int line, const char *message, ...) { va_list ap; va_start (ap, message); lt_error_core (EXIT_FAILURE, file, line, "FATAL", message, ap); va_end (ap); } static const char * nonnull (const char *s) { return s ? s : "(null)"; } static const char * nonempty (const char *s) { return (s && !*s) ? "(empty)" : nonnull (s); } void lt_setenv (const char *name, const char *value) { lt_debugprintf (__FILE__, __LINE__, "(lt_setenv) setting '%s' to '%s'\n", nonnull (name), nonnull (value)); { #ifdef HAVE_SETENV /* always make a copy, for consistency with !HAVE_SETENV */ char *str = xstrdup (value); setenv (name, str, 1); #else int len = strlen (name) + 1 + strlen (value) + 1; char *str = XMALLOC (char, len); sprintf (str, "%s=%s", name, value); if (putenv (str) != EXIT_SUCCESS) { XFREE (str); } #endif } } char * lt_extend_str (const char *orig_value, const char *add, int to_end) { char *new_value; if (orig_value && *orig_value) { int orig_value_len = strlen (orig_value); int add_len = strlen (add); new_value = XMALLOC (char, add_len + orig_value_len + 1); if (to_end) { strcpy (new_value, orig_value); strcpy (new_value + orig_value_len, add); } else { strcpy (new_value, add); strcpy (new_value + add_len, orig_value); } } else { new_value = xstrdup (add); } return new_value; } void lt_update_exe_path (const char *name, const char *value) { lt_debugprintf (__FILE__, __LINE__, "(lt_update_exe_path) modifying '%s' by prepending '%s'\n", nonnull (name), nonnull (value)); if (name && *name && value && *value) { char *new_value = lt_extend_str (getenv (name), value, 0); /* some systems can't cope with a ':'-terminated path #' */ int len = strlen (new_value); while (((len = strlen (new_value)) > 0) && IS_PATH_SEPARATOR (new_value[len-1])) { new_value[len-1] = '\0'; } lt_setenv (name, new_value); XFREE (new_value); } } void lt_update_lib_path (const char *name, const char *value) { lt_debugprintf (__FILE__, __LINE__, "(lt_update_lib_path) modifying '%s' by prepending '%s'\n", nonnull (name), nonnull (value)); if (name && *name && value && *value) { char *new_value = lt_extend_str (getenv (name), value, 0); lt_setenv (name, new_value); XFREE (new_value); } } EOF case $host_os in mingw*) cat <<"EOF" /* Prepares an argument vector before calling spawn(). Note that spawn() does not by itself call the command interpreter (getenv ("COMSPEC") != NULL ? getenv ("COMSPEC") : ({ OSVERSIONINFO v; v.dwOSVersionInfoSize = sizeof(OSVERSIONINFO); GetVersionEx(&v); v.dwPlatformId == VER_PLATFORM_WIN32_NT; }) ? "cmd.exe" : "command.com"). Instead it simply concatenates the arguments, separated by ' ', and calls CreateProcess(). We must quote the arguments since Win32 CreateProcess() interprets characters like ' ', '\t', '\\', '"' (but not '<' and '>') in a special way: - Space and tab are interpreted as delimiters. They are not treated as delimiters if they are surrounded by double quotes: "...". - Unescaped double quotes are removed from the input. Their only effect is that within double quotes, space and tab are treated like normal characters. - Backslashes not followed by double quotes are not special. - But 2*n+1 backslashes followed by a double quote become n backslashes followed by a double quote (n >= 0): \" -> " \\\" -> \" \\\\\" -> \\" */ #define SHELL_SPECIAL_CHARS "\"\\ \001\002\003\004\005\006\007\010\011\012\013\014\015\016\017\020\021\022\023\024\025\026\027\030\031\032\033\034\035\036\037" #define SHELL_SPACE_CHARS " \001\002\003\004\005\006\007\010\011\012\013\014\015\016\017\020\021\022\023\024\025\026\027\030\031\032\033\034\035\036\037" char ** prepare_spawn (char **argv) { size_t argc; char **new_argv; size_t i; /* Count number of arguments. */ for (argc = 0; argv[argc] != NULL; argc++) ; /* Allocate new argument vector. */ new_argv = XMALLOC (char *, argc + 1); /* Put quoted arguments into the new argument vector. */ for (i = 0; i < argc; i++) { const char *string = argv[i]; if (string[0] == '\0') new_argv[i] = xstrdup ("\"\""); else if (strpbrk (string, SHELL_SPECIAL_CHARS) != NULL) { int quote_around = (strpbrk (string, SHELL_SPACE_CHARS) != NULL); size_t length; unsigned int backslashes; const char *s; char *quoted_string; char *p; length = 0; backslashes = 0; if (quote_around) length++; for (s = string; *s != '\0'; s++) { char c = *s; if (c == '"') length += backslashes + 1; length++; if (c == '\\') backslashes++; else backslashes = 0; } if (quote_around) length += backslashes + 1; quoted_string = XMALLOC (char, length + 1); p = quoted_string; backslashes = 0; if (quote_around) *p++ = '"'; for (s = string; *s != '\0'; s++) { char c = *s; if (c == '"') { unsigned int j; for (j = backslashes + 1; j > 0; j--) *p++ = '\\'; } *p++ = c; if (c == '\\') backslashes++; else backslashes = 0; } if (quote_around) { unsigned int j; for (j = backslashes; j > 0; j--) *p++ = '\\'; *p++ = '"'; } *p = '\0'; new_argv[i] = quoted_string; } else new_argv[i] = (char *) string; } new_argv[argc] = NULL; return new_argv; } EOF ;; esac cat <<"EOF" void lt_dump_script (FILE* f) { EOF func_emit_wrapper yes | $SED -n -e ' s/^\(.\{79\}\)\(..*\)/\1\ \2/ h s/\([\\"]\)/\\\1/g s/$/\\n/ s/\([^\n]*\).*/ fputs ("\1", f);/p g D' cat <<"EOF" } EOF } # end: func_emit_cwrapperexe_src # func_win32_import_lib_p ARG # True if ARG is an import lib, as indicated by $file_magic_cmd func_win32_import_lib_p () { $opt_debug case `eval $file_magic_cmd \"\$1\" 2>/dev/null | $SED -e 10q` in *import*) : ;; *) false ;; esac } # func_mode_link arg... func_mode_link () { $opt_debug case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*) # It is impossible to link a dll without this setting, and # we shouldn't force the makefile maintainer to figure out # which system we are compiling for in order to pass an extra # flag for every libtool invocation. # allow_undefined=no # FIXME: Unfortunately, there are problems with the above when trying # to make a dll which has undefined symbols, in which case not # even a static library is built. For now, we need to specify # -no-undefined on the libtool link line when we can be certain # that all symbols are satisfied, otherwise we get a static library. allow_undefined=yes ;; *) allow_undefined=yes ;; esac libtool_args=$nonopt base_compile="$nonopt $@" compile_command=$nonopt finalize_command=$nonopt compile_rpath= finalize_rpath= compile_shlibpath= finalize_shlibpath= convenience= old_convenience= deplibs= old_deplibs= compiler_flags= linker_flags= dllsearchpath= lib_search_path=`pwd` inst_prefix_dir= new_inherited_linker_flags= avoid_version=no bindir= dlfiles= dlprefiles= dlself=no export_dynamic=no export_symbols= export_symbols_regex= generated= libobjs= ltlibs= module=no no_install=no objs= non_pic_objects= precious_files_regex= prefer_static_libs=no preload=no prev= prevarg= release= rpath= xrpath= perm_rpath= temp_rpath= thread_safe=no vinfo= vinfo_number=no weak_libs= single_module="${wl}-single_module" func_infer_tag $base_compile # We need to know -static, to get the right output filenames. for arg do case $arg in -shared) test "$build_libtool_libs" != yes && \ func_fatal_configuration "can not build a shared library" build_old_libs=no break ;; -all-static | -static | -static-libtool-libs) case $arg in -all-static) if test "$build_libtool_libs" = yes && test -z "$link_static_flag"; then func_warning "complete static linking is impossible in this configuration" fi if test -n "$link_static_flag"; then dlopen_self=$dlopen_self_static fi prefer_static_libs=yes ;; -static) if test -z "$pic_flag" && test -n "$link_static_flag"; then dlopen_self=$dlopen_self_static fi prefer_static_libs=built ;; -static-libtool-libs) if test -z "$pic_flag" && test -n "$link_static_flag"; then dlopen_self=$dlopen_self_static fi prefer_static_libs=yes ;; esac build_libtool_libs=no build_old_libs=yes break ;; esac done # See if our shared archives depend on static archives. test -n "$old_archive_from_new_cmds" && build_old_libs=yes # Go through the arguments, transforming them on the way. while test "$#" -gt 0; do arg="$1" shift func_quote_for_eval "$arg" qarg=$func_quote_for_eval_unquoted_result func_append libtool_args " $func_quote_for_eval_result" # If the previous option needs an argument, assign it. if test -n "$prev"; then case $prev in output) func_append compile_command " @OUTPUT@" func_append finalize_command " @OUTPUT@" ;; esac case $prev in bindir) bindir="$arg" prev= continue ;; dlfiles|dlprefiles) if test "$preload" = no; then # Add the symbol object into the linking commands. func_append compile_command " @SYMFILE@" func_append finalize_command " @SYMFILE@" preload=yes fi case $arg in *.la | *.lo) ;; # We handle these cases below. force) if test "$dlself" = no; then dlself=needless export_dynamic=yes fi prev= continue ;; self) if test "$prev" = dlprefiles; then dlself=yes elif test "$prev" = dlfiles && test "$dlopen_self" != yes; then dlself=yes else dlself=needless export_dynamic=yes fi prev= continue ;; *) if test "$prev" = dlfiles; then func_append dlfiles " $arg" else func_append dlprefiles " $arg" fi prev= continue ;; esac ;; expsyms) export_symbols="$arg" test -f "$arg" \ || func_fatal_error "symbol file \`$arg' does not exist" prev= continue ;; expsyms_regex) export_symbols_regex="$arg" prev= continue ;; framework) case $host in *-*-darwin*) case "$deplibs " in *" $qarg.ltframework "*) ;; *) func_append deplibs " $qarg.ltframework" # this is fixed later ;; esac ;; esac prev= continue ;; inst_prefix) inst_prefix_dir="$arg" prev= continue ;; objectlist) if test -f "$arg"; then save_arg=$arg moreargs= for fil in `cat "$save_arg"` do # func_append moreargs " $fil" arg=$fil # A libtool-controlled object. # Check to see that this really is a libtool object. if func_lalib_unsafe_p "$arg"; then pic_object= non_pic_object= # Read the .lo file func_source "$arg" if test -z "$pic_object" || test -z "$non_pic_object" || test "$pic_object" = none && test "$non_pic_object" = none; then func_fatal_error "cannot find name of object for \`$arg'" fi # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir="$func_dirname_result" if test "$pic_object" != none; then # Prepend the subdirectory the object is found in. pic_object="$xdir$pic_object" if test "$prev" = dlfiles; then if test "$build_libtool_libs" = yes && test "$dlopen_support" = yes; then func_append dlfiles " $pic_object" prev= continue else # If libtool objects are unsupported, then we need to preload. prev=dlprefiles fi fi # CHECK ME: I think I busted this. -Ossama if test "$prev" = dlprefiles; then # Preload the old-style object. func_append dlprefiles " $pic_object" prev= fi # A PIC object. func_append libobjs " $pic_object" arg="$pic_object" fi # Non-PIC object. if test "$non_pic_object" != none; then # Prepend the subdirectory the object is found in. non_pic_object="$xdir$non_pic_object" # A standard non-PIC object func_append non_pic_objects " $non_pic_object" if test -z "$pic_object" || test "$pic_object" = none ; then arg="$non_pic_object" fi else # If the PIC object exists, use it instead. # $xdir was prepended to $pic_object above. non_pic_object="$pic_object" func_append non_pic_objects " $non_pic_object" fi else # Only an error if not doing a dry-run. if $opt_dry_run; then # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir="$func_dirname_result" func_lo2o "$arg" pic_object=$xdir$objdir/$func_lo2o_result non_pic_object=$xdir$func_lo2o_result func_append libobjs " $pic_object" func_append non_pic_objects " $non_pic_object" else func_fatal_error "\`$arg' is not a valid libtool object" fi fi done else func_fatal_error "link input file \`$arg' does not exist" fi arg=$save_arg prev= continue ;; precious_regex) precious_files_regex="$arg" prev= continue ;; release) release="-$arg" prev= continue ;; rpath | xrpath) # We need an absolute path. case $arg in [\\/]* | [A-Za-z]:[\\/]*) ;; *) func_fatal_error "only absolute run-paths are allowed" ;; esac if test "$prev" = rpath; then case "$rpath " in *" $arg "*) ;; *) func_append rpath " $arg" ;; esac else case "$xrpath " in *" $arg "*) ;; *) func_append xrpath " $arg" ;; esac fi prev= continue ;; shrext) shrext_cmds="$arg" prev= continue ;; weak) func_append weak_libs " $arg" prev= continue ;; xcclinker) func_append linker_flags " $qarg" func_append compiler_flags " $qarg" prev= func_append compile_command " $qarg" func_append finalize_command " $qarg" continue ;; xcompiler) func_append compiler_flags " $qarg" prev= func_append compile_command " $qarg" func_append finalize_command " $qarg" continue ;; xlinker) func_append linker_flags " $qarg" func_append compiler_flags " $wl$qarg" prev= func_append compile_command " $wl$qarg" func_append finalize_command " $wl$qarg" continue ;; *) eval "$prev=\"\$arg\"" prev= continue ;; esac fi # test -n "$prev" prevarg="$arg" case $arg in -all-static) if test -n "$link_static_flag"; then # See comment for -static flag below, for more details. func_append compile_command " $link_static_flag" func_append finalize_command " $link_static_flag" fi continue ;; -allow-undefined) # FIXME: remove this flag sometime in the future. func_fatal_error "\`-allow-undefined' must not be used because it is the default" ;; -avoid-version) avoid_version=yes continue ;; -bindir) prev=bindir continue ;; -dlopen) prev=dlfiles continue ;; -dlpreopen) prev=dlprefiles continue ;; -export-dynamic) export_dynamic=yes continue ;; -export-symbols | -export-symbols-regex) if test -n "$export_symbols" || test -n "$export_symbols_regex"; then func_fatal_error "more than one -exported-symbols argument is not allowed" fi if test "X$arg" = "X-export-symbols"; then prev=expsyms else prev=expsyms_regex fi continue ;; -framework) prev=framework continue ;; -inst-prefix-dir) prev=inst_prefix continue ;; # The native IRIX linker understands -LANG:*, -LIST:* and -LNO:* # so, if we see these flags be careful not to treat them like -L -L[A-Z][A-Z]*:*) case $with_gcc/$host in no/*-*-irix* | /*-*-irix*) func_append compile_command " $arg" func_append finalize_command " $arg" ;; esac continue ;; -L*) func_stripname "-L" '' "$arg" if test -z "$func_stripname_result"; then if test "$#" -gt 0; then func_fatal_error "require no space between \`-L' and \`$1'" else func_fatal_error "need path for \`-L' option" fi fi func_resolve_sysroot "$func_stripname_result" dir=$func_resolve_sysroot_result # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) ;; *) absdir=`cd "$dir" && pwd` test -z "$absdir" && \ func_fatal_error "cannot determine absolute directory name of \`$dir'" dir="$absdir" ;; esac case "$deplibs " in *" -L$dir "* | *" $arg "*) # Will only happen for absolute or sysroot arguments ;; *) # Preserve sysroot, but never include relative directories case $dir in [\\/]* | [A-Za-z]:[\\/]* | =*) func_append deplibs " $arg" ;; *) func_append deplibs " -L$dir" ;; esac func_append lib_search_path " $dir" ;; esac case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*) testbindir=`$ECHO "$dir" | $SED 's*/lib$*/bin*'` case :$dllsearchpath: in *":$dir:"*) ;; ::) dllsearchpath=$dir;; *) func_append dllsearchpath ":$dir";; esac case :$dllsearchpath: in *":$testbindir:"*) ;; ::) dllsearchpath=$testbindir;; *) func_append dllsearchpath ":$testbindir";; esac ;; esac continue ;; -l*) if test "X$arg" = "X-lc" || test "X$arg" = "X-lm"; then case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-beos* | *-cegcc* | *-*-haiku*) # These systems don't actually have a C or math library (as such) continue ;; *-*-os2*) # These systems don't actually have a C library (as such) test "X$arg" = "X-lc" && continue ;; *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc due to us having libc/libc_r. test "X$arg" = "X-lc" && continue ;; *-*-rhapsody* | *-*-darwin1.[012]) # Rhapsody C and math libraries are in the System framework func_append deplibs " System.ltframework" continue ;; *-*-sco3.2v5* | *-*-sco5v6*) # Causes problems with __ctype test "X$arg" = "X-lc" && continue ;; *-*-sysv4.2uw2* | *-*-sysv5* | *-*-unixware* | *-*-OpenUNIX*) # Compiler inserts libc in the correct place for threads to work test "X$arg" = "X-lc" && continue ;; esac elif test "X$arg" = "X-lc_r"; then case $host in *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc_r directly, use -pthread flag. continue ;; esac fi func_append deplibs " $arg" continue ;; -module) module=yes continue ;; # Tru64 UNIX uses -model [arg] to determine the layout of C++ # classes, name mangling, and exception handling. # Darwin uses the -arch flag to determine output architecture. -model|-arch|-isysroot|--sysroot) func_append compiler_flags " $arg" func_append compile_command " $arg" func_append finalize_command " $arg" prev=xcompiler continue ;; -mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe \ |-threads|-fopenmp|-openmp|-mp|-xopenmp|-omp|-qsmp=*) func_append compiler_flags " $arg" func_append compile_command " $arg" func_append finalize_command " $arg" case "$new_inherited_linker_flags " in *" $arg "*) ;; * ) func_append new_inherited_linker_flags " $arg" ;; esac continue ;; -multi_module) single_module="${wl}-multi_module" continue ;; -no-fast-install) fast_install=no continue ;; -no-install) case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-*-darwin* | *-cegcc*) # The PATH hackery in wrapper scripts is required on Windows # and Darwin in order for the loader to find any dlls it needs. func_warning "\`-no-install' is ignored for $host" func_warning "assuming \`-no-fast-install' instead" fast_install=no ;; *) no_install=yes ;; esac continue ;; -no-undefined) allow_undefined=no continue ;; -objectlist) prev=objectlist continue ;; -o) prev=output ;; -precious-files-regex) prev=precious_regex continue ;; -release) prev=release continue ;; -rpath) prev=rpath continue ;; -R) prev=xrpath continue ;; -R*) func_stripname '-R' '' "$arg" dir=$func_stripname_result # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) ;; =*) func_stripname '=' '' "$dir" dir=$lt_sysroot$func_stripname_result ;; *) func_fatal_error "only absolute run-paths are allowed" ;; esac case "$xrpath " in *" $dir "*) ;; *) func_append xrpath " $dir" ;; esac continue ;; -shared) # The effects of -shared are defined in a previous loop. continue ;; -shrext) prev=shrext continue ;; -static | -static-libtool-libs) # The effects of -static are defined in a previous loop. # We used to do the same as -all-static on platforms that # didn't have a PIC flag, but the assumption that the effects # would be equivalent was wrong. It would break on at least # Digital Unix and AIX. continue ;; -thread-safe) thread_safe=yes continue ;; -version-info) prev=vinfo continue ;; -version-number) prev=vinfo vinfo_number=yes continue ;; -weak) prev=weak continue ;; -Wc,*) func_stripname '-Wc,' '' "$arg" args=$func_stripname_result arg= save_ifs="$IFS"; IFS=',' for flag in $args; do IFS="$save_ifs" func_quote_for_eval "$flag" func_append arg " $func_quote_for_eval_result" func_append compiler_flags " $func_quote_for_eval_result" done IFS="$save_ifs" func_stripname ' ' '' "$arg" arg=$func_stripname_result ;; -Wl,*) func_stripname '-Wl,' '' "$arg" args=$func_stripname_result arg= save_ifs="$IFS"; IFS=',' for flag in $args; do IFS="$save_ifs" func_quote_for_eval "$flag" func_append arg " $wl$func_quote_for_eval_result" func_append compiler_flags " $wl$func_quote_for_eval_result" func_append linker_flags " $func_quote_for_eval_result" done IFS="$save_ifs" func_stripname ' ' '' "$arg" arg=$func_stripname_result ;; -Xcompiler) prev=xcompiler continue ;; -Xlinker) prev=xlinker continue ;; -XCClinker) prev=xcclinker continue ;; # -msg_* for osf cc -msg_*) func_quote_for_eval "$arg" arg="$func_quote_for_eval_result" ;; # Flags to be passed through unchanged, with rationale: # -64, -mips[0-9] enable 64-bit mode for the SGI compiler # -r[0-9][0-9]* specify processor for the SGI compiler # -xarch=*, -xtarget=* enable 64-bit mode for the Sun compiler # +DA*, +DD* enable 64-bit mode for the HP compiler # -q* compiler args for the IBM compiler # -m*, -t[45]*, -txscale* architecture-specific flags for GCC # -F/path path to uninstalled frameworks, gcc on darwin # -p, -pg, --coverage, -fprofile-* profiling flags for GCC # @file GCC response files # -tp=* Portland pgcc target processor selection # --sysroot=* for sysroot support # -O*, -flto*, -fwhopr*, -fuse-linker-plugin GCC link-time optimization -64|-mips[0-9]|-r[0-9][0-9]*|-xarch=*|-xtarget=*|+DA*|+DD*|-q*|-m*| \ -t[45]*|-txscale*|-p|-pg|--coverage|-fprofile-*|-F*|@*|-tp=*|--sysroot=*| \ -O*|-flto*|-fwhopr*|-fuse-linker-plugin) func_quote_for_eval "$arg" arg="$func_quote_for_eval_result" func_append compile_command " $arg" func_append finalize_command " $arg" func_append compiler_flags " $arg" continue ;; # Some other compiler flag. -* | +*) func_quote_for_eval "$arg" arg="$func_quote_for_eval_result" ;; *.$objext) # A standard object. func_append objs " $arg" ;; *.lo) # A libtool-controlled object. # Check to see that this really is a libtool object. if func_lalib_unsafe_p "$arg"; then pic_object= non_pic_object= # Read the .lo file func_source "$arg" if test -z "$pic_object" || test -z "$non_pic_object" || test "$pic_object" = none && test "$non_pic_object" = none; then func_fatal_error "cannot find name of object for \`$arg'" fi # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir="$func_dirname_result" if test "$pic_object" != none; then # Prepend the subdirectory the object is found in. pic_object="$xdir$pic_object" if test "$prev" = dlfiles; then if test "$build_libtool_libs" = yes && test "$dlopen_support" = yes; then func_append dlfiles " $pic_object" prev= continue else # If libtool objects are unsupported, then we need to preload. prev=dlprefiles fi fi # CHECK ME: I think I busted this. -Ossama if test "$prev" = dlprefiles; then # Preload the old-style object. func_append dlprefiles " $pic_object" prev= fi # A PIC object. func_append libobjs " $pic_object" arg="$pic_object" fi # Non-PIC object. if test "$non_pic_object" != none; then # Prepend the subdirectory the object is found in. non_pic_object="$xdir$non_pic_object" # A standard non-PIC object func_append non_pic_objects " $non_pic_object" if test -z "$pic_object" || test "$pic_object" = none ; then arg="$non_pic_object" fi else # If the PIC object exists, use it instead. # $xdir was prepended to $pic_object above. non_pic_object="$pic_object" func_append non_pic_objects " $non_pic_object" fi else # Only an error if not doing a dry-run. if $opt_dry_run; then # Extract subdirectory from the argument. func_dirname "$arg" "/" "" xdir="$func_dirname_result" func_lo2o "$arg" pic_object=$xdir$objdir/$func_lo2o_result non_pic_object=$xdir$func_lo2o_result func_append libobjs " $pic_object" func_append non_pic_objects " $non_pic_object" else func_fatal_error "\`$arg' is not a valid libtool object" fi fi ;; *.$libext) # An archive. func_append deplibs " $arg" func_append old_deplibs " $arg" continue ;; *.la) # A libtool-controlled library. func_resolve_sysroot "$arg" if test "$prev" = dlfiles; then # This library was specified with -dlopen. func_append dlfiles " $func_resolve_sysroot_result" prev= elif test "$prev" = dlprefiles; then # The library was specified with -dlpreopen. func_append dlprefiles " $func_resolve_sysroot_result" prev= else func_append deplibs " $func_resolve_sysroot_result" fi continue ;; # Some other compiler argument. *) # Unknown arguments in both finalize_command and compile_command need # to be aesthetically quoted because they are evaled later. func_quote_for_eval "$arg" arg="$func_quote_for_eval_result" ;; esac # arg # Now actually substitute the argument into the commands. if test -n "$arg"; then func_append compile_command " $arg" func_append finalize_command " $arg" fi done # argument parsing loop test -n "$prev" && \ func_fatal_help "the \`$prevarg' option requires an argument" if test "$export_dynamic" = yes && test -n "$export_dynamic_flag_spec"; then eval arg=\"$export_dynamic_flag_spec\" func_append compile_command " $arg" func_append finalize_command " $arg" fi oldlibs= # calculate the name of the file, without its directory func_basename "$output" outputname="$func_basename_result" libobjs_save="$libobjs" if test -n "$shlibpath_var"; then # get the directories listed in $shlibpath_var eval shlib_search_path=\`\$ECHO \"\${$shlibpath_var}\" \| \$SED \'s/:/ /g\'\` else shlib_search_path= fi eval sys_lib_search_path=\"$sys_lib_search_path_spec\" eval sys_lib_dlsearch_path=\"$sys_lib_dlsearch_path_spec\" func_dirname "$output" "/" "" output_objdir="$func_dirname_result$objdir" func_to_tool_file "$output_objdir/" tool_output_objdir=$func_to_tool_file_result # Create the object directory. func_mkdir_p "$output_objdir" # Determine the type of output case $output in "") func_fatal_help "you must specify an output file" ;; *.$libext) linkmode=oldlib ;; *.lo | *.$objext) linkmode=obj ;; *.la) linkmode=lib ;; *) linkmode=prog ;; # Anything else should be a program. esac specialdeplibs= libs= # Find all interdependent deplibs by searching for libraries # that are linked more than once (e.g. -la -lb -la) for deplib in $deplibs; do if $opt_preserve_dup_deps ; then case "$libs " in *" $deplib "*) func_append specialdeplibs " $deplib" ;; esac fi func_append libs " $deplib" done if test "$linkmode" = lib; then libs="$predeps $libs $compiler_lib_search_path $postdeps" # Compute libraries that are listed more than once in $predeps # $postdeps and mark them as special (i.e., whose duplicates are # not to be eliminated). pre_post_deps= if $opt_duplicate_compiler_generated_deps; then for pre_post_dep in $predeps $postdeps; do case "$pre_post_deps " in *" $pre_post_dep "*) func_append specialdeplibs " $pre_post_deps" ;; esac func_append pre_post_deps " $pre_post_dep" done fi pre_post_deps= fi deplibs= newdependency_libs= newlib_search_path= need_relink=no # whether we're linking any uninstalled libtool libraries notinst_deplibs= # not-installed libtool libraries notinst_path= # paths that contain not-installed libtool libraries case $linkmode in lib) passes="conv dlpreopen link" for file in $dlfiles $dlprefiles; do case $file in *.la) ;; *) func_fatal_help "libraries can \`-dlopen' only libtool libraries: $file" ;; esac done ;; prog) compile_deplibs= finalize_deplibs= alldeplibs=no newdlfiles= newdlprefiles= passes="conv scan dlopen dlpreopen link" ;; *) passes="conv" ;; esac for pass in $passes; do # The preopen pass in lib mode reverses $deplibs; put it back here # so that -L comes before libs that need it for instance... if test "$linkmode,$pass" = "lib,link"; then ## FIXME: Find the place where the list is rebuilt in the wrong ## order, and fix it there properly tmp_deplibs= for deplib in $deplibs; do tmp_deplibs="$deplib $tmp_deplibs" done deplibs="$tmp_deplibs" fi if test "$linkmode,$pass" = "lib,link" || test "$linkmode,$pass" = "prog,scan"; then libs="$deplibs" deplibs= fi if test "$linkmode" = prog; then case $pass in dlopen) libs="$dlfiles" ;; dlpreopen) libs="$dlprefiles" ;; link) libs="$deplibs %DEPLIBS%" test "X$link_all_deplibs" != Xno && libs="$libs $dependency_libs" ;; esac fi if test "$linkmode,$pass" = "lib,dlpreopen"; then # Collect and forward deplibs of preopened libtool libs for lib in $dlprefiles; do # Ignore non-libtool-libs dependency_libs= func_resolve_sysroot "$lib" case $lib in *.la) func_source "$func_resolve_sysroot_result" ;; esac # Collect preopened libtool deplibs, except any this library # has declared as weak libs for deplib in $dependency_libs; do func_basename "$deplib" deplib_base=$func_basename_result case " $weak_libs " in *" $deplib_base "*) ;; *) func_append deplibs " $deplib" ;; esac done done libs="$dlprefiles" fi if test "$pass" = dlopen; then # Collect dlpreopened libraries save_deplibs="$deplibs" deplibs= fi for deplib in $libs; do lib= found=no case $deplib in -mt|-mthreads|-kthread|-Kthread|-pthread|-pthreads|--thread-safe \ |-threads|-fopenmp|-openmp|-mp|-xopenmp|-omp|-qsmp=*) if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else func_append compiler_flags " $deplib" if test "$linkmode" = lib ; then case "$new_inherited_linker_flags " in *" $deplib "*) ;; * ) func_append new_inherited_linker_flags " $deplib" ;; esac fi fi continue ;; -l*) if test "$linkmode" != lib && test "$linkmode" != prog; then func_warning "\`-l' is ignored for archives/objects" continue fi func_stripname '-l' '' "$deplib" name=$func_stripname_result if test "$linkmode" = lib; then searchdirs="$newlib_search_path $lib_search_path $compiler_lib_search_dirs $sys_lib_search_path $shlib_search_path" else searchdirs="$newlib_search_path $lib_search_path $sys_lib_search_path $shlib_search_path" fi for searchdir in $searchdirs; do for search_ext in .la $std_shrext .so .a; do # Search the libtool library lib="$searchdir/lib${name}${search_ext}" if test -f "$lib"; then if test "$search_ext" = ".la"; then found=yes else found=no fi break 2 fi done done if test "$found" != yes; then # deplib doesn't seem to be a libtool library if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" test "$linkmode" = lib && newdependency_libs="$deplib $newdependency_libs" fi continue else # deplib is a libtool library # If $allow_libtool_libs_with_static_runtimes && $deplib is a stdlib, # We need to do some special things here, and not later. if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then case " $predeps $postdeps " in *" $deplib "*) if func_lalib_p "$lib"; then library_names= old_library= func_source "$lib" for l in $old_library $library_names; do ll="$l" done if test "X$ll" = "X$old_library" ; then # only static version available found=no func_dirname "$lib" "" "." ladir="$func_dirname_result" lib=$ladir/$old_library if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" test "$linkmode" = lib && newdependency_libs="$deplib $newdependency_libs" fi continue fi fi ;; *) ;; esac fi fi ;; # -l *.ltframework) if test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else deplibs="$deplib $deplibs" if test "$linkmode" = lib ; then case "$new_inherited_linker_flags " in *" $deplib "*) ;; * ) func_append new_inherited_linker_flags " $deplib" ;; esac fi fi continue ;; -L*) case $linkmode in lib) deplibs="$deplib $deplibs" test "$pass" = conv && continue newdependency_libs="$deplib $newdependency_libs" func_stripname '-L' '' "$deplib" func_resolve_sysroot "$func_stripname_result" func_append newlib_search_path " $func_resolve_sysroot_result" ;; prog) if test "$pass" = conv; then deplibs="$deplib $deplibs" continue fi if test "$pass" = scan; then deplibs="$deplib $deplibs" else compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" fi func_stripname '-L' '' "$deplib" func_resolve_sysroot "$func_stripname_result" func_append newlib_search_path " $func_resolve_sysroot_result" ;; *) func_warning "\`-L' is ignored for archives/objects" ;; esac # linkmode continue ;; # -L -R*) if test "$pass" = link; then func_stripname '-R' '' "$deplib" func_resolve_sysroot "$func_stripname_result" dir=$func_resolve_sysroot_result # Make sure the xrpath contains only unique directories. case "$xrpath " in *" $dir "*) ;; *) func_append xrpath " $dir" ;; esac fi deplibs="$deplib $deplibs" continue ;; *.la) func_resolve_sysroot "$deplib" lib=$func_resolve_sysroot_result ;; *.$libext) if test "$pass" = conv; then deplibs="$deplib $deplibs" continue fi case $linkmode in lib) # Linking convenience modules into shared libraries is allowed, # but linking other static libraries is non-portable. case " $dlpreconveniencelibs " in *" $deplib "*) ;; *) valid_a_lib=no case $deplibs_check_method in match_pattern*) set dummy $deplibs_check_method; shift match_pattern_regex=`expr "$deplibs_check_method" : "$1 \(.*\)"` if eval "\$ECHO \"$deplib\"" 2>/dev/null | $SED 10q \ | $EGREP "$match_pattern_regex" > /dev/null; then valid_a_lib=yes fi ;; pass_all) valid_a_lib=yes ;; esac if test "$valid_a_lib" != yes; then echo $ECHO "*** Warning: Trying to link with static lib archive $deplib." echo "*** I have the capability to make that library automatically link in when" echo "*** you link to this library. But I can only do this if you have a" echo "*** shared version of the library, which you do not appear to have" echo "*** because the file extensions .$libext of this argument makes me believe" echo "*** that it is just a static archive that I should not use here." else echo $ECHO "*** Warning: Linking the shared library $output against the" $ECHO "*** static library $deplib is not portable!" deplibs="$deplib $deplibs" fi ;; esac continue ;; prog) if test "$pass" != link; then deplibs="$deplib $deplibs" else compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" fi continue ;; esac # linkmode ;; # *.$libext *.lo | *.$objext) if test "$pass" = conv; then deplibs="$deplib $deplibs" elif test "$linkmode" = prog; then if test "$pass" = dlpreopen || test "$dlopen_support" != yes || test "$build_libtool_libs" = no; then # If there is no dlopen support or we're linking statically, # we need to preload. func_append newdlprefiles " $deplib" compile_deplibs="$deplib $compile_deplibs" finalize_deplibs="$deplib $finalize_deplibs" else func_append newdlfiles " $deplib" fi fi continue ;; %DEPLIBS%) alldeplibs=yes continue ;; esac # case $deplib if test "$found" = yes || test -f "$lib"; then : else func_fatal_error "cannot find the library \`$lib' or unhandled argument \`$deplib'" fi # Check to see that this really is a libtool archive. func_lalib_unsafe_p "$lib" \ || func_fatal_error "\`$lib' is not a valid libtool archive" func_dirname "$lib" "" "." ladir="$func_dirname_result" dlname= dlopen= dlpreopen= libdir= library_names= old_library= inherited_linker_flags= # If the library was installed with an old release of libtool, # it will not redefine variables installed, or shouldnotlink installed=yes shouldnotlink=no avoidtemprpath= # Read the .la file func_source "$lib" # Convert "-framework foo" to "foo.ltframework" if test -n "$inherited_linker_flags"; then tmp_inherited_linker_flags=`$ECHO "$inherited_linker_flags" | $SED 's/-framework \([^ $]*\)/\1.ltframework/g'` for tmp_inherited_linker_flag in $tmp_inherited_linker_flags; do case " $new_inherited_linker_flags " in *" $tmp_inherited_linker_flag "*) ;; *) func_append new_inherited_linker_flags " $tmp_inherited_linker_flag";; esac done fi dependency_libs=`$ECHO " $dependency_libs" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` if test "$linkmode,$pass" = "lib,link" || test "$linkmode,$pass" = "prog,scan" || { test "$linkmode" != prog && test "$linkmode" != lib; }; then test -n "$dlopen" && func_append dlfiles " $dlopen" test -n "$dlpreopen" && func_append dlprefiles " $dlpreopen" fi if test "$pass" = conv; then # Only check for convenience libraries deplibs="$lib $deplibs" if test -z "$libdir"; then if test -z "$old_library"; then func_fatal_error "cannot find name of link library for \`$lib'" fi # It is a libtool convenience library, so add in its objects. func_append convenience " $ladir/$objdir/$old_library" func_append old_convenience " $ladir/$objdir/$old_library" tmp_libs= for deplib in $dependency_libs; do deplibs="$deplib $deplibs" if $opt_preserve_dup_deps ; then case "$tmp_libs " in *" $deplib "*) func_append specialdeplibs " $deplib" ;; esac fi func_append tmp_libs " $deplib" done elif test "$linkmode" != prog && test "$linkmode" != lib; then func_fatal_error "\`$lib' is not a convenience library" fi continue fi # $pass = conv # Get the name of the library we link against. linklib= if test -n "$old_library" && { test "$prefer_static_libs" = yes || test "$prefer_static_libs,$installed" = "built,no"; }; then linklib=$old_library else for l in $old_library $library_names; do linklib="$l" done fi if test -z "$linklib"; then func_fatal_error "cannot find name of link library for \`$lib'" fi # This library was specified with -dlopen. if test "$pass" = dlopen; then if test -z "$libdir"; then func_fatal_error "cannot -dlopen a convenience library: \`$lib'" fi if test -z "$dlname" || test "$dlopen_support" != yes || test "$build_libtool_libs" = no; then # If there is no dlname, no dlopen support or we're linking # statically, we need to preload. We also need to preload any # dependent libraries so libltdl's deplib preloader doesn't # bomb out in the load deplibs phase. func_append dlprefiles " $lib $dependency_libs" else func_append newdlfiles " $lib" fi continue fi # $pass = dlopen # We need an absolute path. case $ladir in [\\/]* | [A-Za-z]:[\\/]*) abs_ladir="$ladir" ;; *) abs_ladir=`cd "$ladir" && pwd` if test -z "$abs_ladir"; then func_warning "cannot determine absolute directory name of \`$ladir'" func_warning "passing it literally to the linker, although it might fail" abs_ladir="$ladir" fi ;; esac func_basename "$lib" laname="$func_basename_result" # Find the relevant object directory and library name. if test "X$installed" = Xyes; then if test ! -f "$lt_sysroot$libdir/$linklib" && test -f "$abs_ladir/$linklib"; then func_warning "library \`$lib' was moved." dir="$ladir" absdir="$abs_ladir" libdir="$abs_ladir" else dir="$lt_sysroot$libdir" absdir="$lt_sysroot$libdir" fi test "X$hardcode_automatic" = Xyes && avoidtemprpath=yes else if test ! -f "$ladir/$objdir/$linklib" && test -f "$abs_ladir/$linklib"; then dir="$ladir" absdir="$abs_ladir" # Remove this search path later func_append notinst_path " $abs_ladir" else dir="$ladir/$objdir" absdir="$abs_ladir/$objdir" # Remove this search path later func_append notinst_path " $abs_ladir" fi fi # $installed = yes func_stripname 'lib' '.la' "$laname" name=$func_stripname_result # This library was specified with -dlpreopen. if test "$pass" = dlpreopen; then if test -z "$libdir" && test "$linkmode" = prog; then func_fatal_error "only libraries may -dlpreopen a convenience library: \`$lib'" fi case "$host" in # special handling for platforms with PE-DLLs. *cygwin* | *mingw* | *cegcc* ) # Linker will automatically link against shared library if both # static and shared are present. Therefore, ensure we extract # symbols from the import library if a shared library is present # (otherwise, the dlopen module name will be incorrect). We do # this by putting the import library name into $newdlprefiles. # We recover the dlopen module name by 'saving' the la file # name in a special purpose variable, and (later) extracting the # dlname from the la file. if test -n "$dlname"; then func_tr_sh "$dir/$linklib" eval "libfile_$func_tr_sh_result=\$abs_ladir/\$laname" func_append newdlprefiles " $dir/$linklib" else func_append newdlprefiles " $dir/$old_library" # Keep a list of preopened convenience libraries to check # that they are being used correctly in the link pass. test -z "$libdir" && \ func_append dlpreconveniencelibs " $dir/$old_library" fi ;; * ) # Prefer using a static library (so that no silly _DYNAMIC symbols # are required to link). if test -n "$old_library"; then func_append newdlprefiles " $dir/$old_library" # Keep a list of preopened convenience libraries to check # that they are being used correctly in the link pass. test -z "$libdir" && \ func_append dlpreconveniencelibs " $dir/$old_library" # Otherwise, use the dlname, so that lt_dlopen finds it. elif test -n "$dlname"; then func_append newdlprefiles " $dir/$dlname" else func_append newdlprefiles " $dir/$linklib" fi ;; esac fi # $pass = dlpreopen if test -z "$libdir"; then # Link the convenience library if test "$linkmode" = lib; then deplibs="$dir/$old_library $deplibs" elif test "$linkmode,$pass" = "prog,link"; then compile_deplibs="$dir/$old_library $compile_deplibs" finalize_deplibs="$dir/$old_library $finalize_deplibs" else deplibs="$lib $deplibs" # used for prog,scan pass fi continue fi if test "$linkmode" = prog && test "$pass" != link; then func_append newlib_search_path " $ladir" deplibs="$lib $deplibs" linkalldeplibs=no if test "$link_all_deplibs" != no || test -z "$library_names" || test "$build_libtool_libs" = no; then linkalldeplibs=yes fi tmp_libs= for deplib in $dependency_libs; do case $deplib in -L*) func_stripname '-L' '' "$deplib" func_resolve_sysroot "$func_stripname_result" func_append newlib_search_path " $func_resolve_sysroot_result" ;; esac # Need to link against all dependency_libs? if test "$linkalldeplibs" = yes; then deplibs="$deplib $deplibs" else # Need to hardcode shared library paths # or/and link against static libraries newdependency_libs="$deplib $newdependency_libs" fi if $opt_preserve_dup_deps ; then case "$tmp_libs " in *" $deplib "*) func_append specialdeplibs " $deplib" ;; esac fi func_append tmp_libs " $deplib" done # for deplib continue fi # $linkmode = prog... if test "$linkmode,$pass" = "prog,link"; then if test -n "$library_names" && { { test "$prefer_static_libs" = no || test "$prefer_static_libs,$installed" = "built,yes"; } || test -z "$old_library"; }; then # We need to hardcode the library path if test -n "$shlibpath_var" && test -z "$avoidtemprpath" ; then # Make sure the rpath contains only unique directories. case "$temp_rpath:" in *"$absdir:"*) ;; *) func_append temp_rpath "$absdir:" ;; esac fi # Hardcode the library path. # Skip directories that are in the system default run-time # search path. case " $sys_lib_dlsearch_path " in *" $absdir "*) ;; *) case "$compile_rpath " in *" $absdir "*) ;; *) func_append compile_rpath " $absdir" ;; esac ;; esac case " $sys_lib_dlsearch_path " in *" $libdir "*) ;; *) case "$finalize_rpath " in *" $libdir "*) ;; *) func_append finalize_rpath " $libdir" ;; esac ;; esac fi # $linkmode,$pass = prog,link... if test "$alldeplibs" = yes && { test "$deplibs_check_method" = pass_all || { test "$build_libtool_libs" = yes && test -n "$library_names"; }; }; then # We only need to search for static libraries continue fi fi link_static=no # Whether the deplib will be linked statically use_static_libs=$prefer_static_libs if test "$use_static_libs" = built && test "$installed" = yes; then use_static_libs=no fi if test -n "$library_names" && { test "$use_static_libs" = no || test -z "$old_library"; }; then case $host in *cygwin* | *mingw* | *cegcc*) # No point in relinking DLLs because paths are not encoded func_append notinst_deplibs " $lib" need_relink=no ;; *) if test "$installed" = no; then func_append notinst_deplibs " $lib" need_relink=yes fi ;; esac # This is a shared library # Warn about portability, can't link against -module's on some # systems (darwin). Don't bleat about dlopened modules though! dlopenmodule="" for dlpremoduletest in $dlprefiles; do if test "X$dlpremoduletest" = "X$lib"; then dlopenmodule="$dlpremoduletest" break fi done if test -z "$dlopenmodule" && test "$shouldnotlink" = yes && test "$pass" = link; then echo if test "$linkmode" = prog; then $ECHO "*** Warning: Linking the executable $output against the loadable module" else $ECHO "*** Warning: Linking the shared library $output against the loadable module" fi $ECHO "*** $linklib is not portable!" fi if test "$linkmode" = lib && test "$hardcode_into_libs" = yes; then # Hardcode the library path. # Skip directories that are in the system default run-time # search path. case " $sys_lib_dlsearch_path " in *" $absdir "*) ;; *) case "$compile_rpath " in *" $absdir "*) ;; *) func_append compile_rpath " $absdir" ;; esac ;; esac case " $sys_lib_dlsearch_path " in *" $libdir "*) ;; *) case "$finalize_rpath " in *" $libdir "*) ;; *) func_append finalize_rpath " $libdir" ;; esac ;; esac fi if test -n "$old_archive_from_expsyms_cmds"; then # figure out the soname set dummy $library_names shift realname="$1" shift libname=`eval "\\$ECHO \"$libname_spec\""` # use dlname if we got it. it's perfectly good, no? if test -n "$dlname"; then soname="$dlname" elif test -n "$soname_spec"; then # bleh windows case $host in *cygwin* | mingw* | *cegcc*) func_arith $current - $age major=$func_arith_result versuffix="-$major" ;; esac eval soname=\"$soname_spec\" else soname="$realname" fi # Make a new name for the extract_expsyms_cmds to use soroot="$soname" func_basename "$soroot" soname="$func_basename_result" func_stripname 'lib' '.dll' "$soname" newlib=libimp-$func_stripname_result.a # If the library has no export list, then create one now if test -f "$output_objdir/$soname-def"; then : else func_verbose "extracting exported symbol list from \`$soname'" func_execute_cmds "$extract_expsyms_cmds" 'exit $?' fi # Create $newlib if test -f "$output_objdir/$newlib"; then :; else func_verbose "generating import library for \`$soname'" func_execute_cmds "$old_archive_from_expsyms_cmds" 'exit $?' fi # make sure the library variables are pointing to the new library dir=$output_objdir linklib=$newlib fi # test -n "$old_archive_from_expsyms_cmds" if test "$linkmode" = prog || test "$opt_mode" != relink; then add_shlibpath= add_dir= add= lib_linked=yes case $hardcode_action in immediate | unsupported) if test "$hardcode_direct" = no; then add="$dir/$linklib" case $host in *-*-sco3.2v5.0.[024]*) add_dir="-L$dir" ;; *-*-sysv4*uw2*) add_dir="-L$dir" ;; *-*-sysv5OpenUNIX* | *-*-sysv5UnixWare7.[01].[10]* | \ *-*-unixware7*) add_dir="-L$dir" ;; *-*-darwin* ) # if the lib is a (non-dlopened) module then we can not # link against it, someone is ignoring the earlier warnings if /usr/bin/file -L $add 2> /dev/null | $GREP ": [^:]* bundle" >/dev/null ; then if test "X$dlopenmodule" != "X$lib"; then $ECHO "*** Warning: lib $linklib is a module, not a shared library" if test -z "$old_library" ; then echo echo "*** And there doesn't seem to be a static archive available" echo "*** The link will probably fail, sorry" else add="$dir/$old_library" fi elif test -n "$old_library"; then add="$dir/$old_library" fi fi esac elif test "$hardcode_minus_L" = no; then case $host in *-*-sunos*) add_shlibpath="$dir" ;; esac add_dir="-L$dir" add="-l$name" elif test "$hardcode_shlibpath_var" = no; then add_shlibpath="$dir" add="-l$name" else lib_linked=no fi ;; relink) if test "$hardcode_direct" = yes && test "$hardcode_direct_absolute" = no; then add="$dir/$linklib" elif test "$hardcode_minus_L" = yes; then add_dir="-L$absdir" # Try looking first in the location we're being installed to. if test -n "$inst_prefix_dir"; then case $libdir in [\\/]*) func_append add_dir " -L$inst_prefix_dir$libdir" ;; esac fi add="-l$name" elif test "$hardcode_shlibpath_var" = yes; then add_shlibpath="$dir" add="-l$name" else lib_linked=no fi ;; *) lib_linked=no ;; esac if test "$lib_linked" != yes; then func_fatal_configuration "unsupported hardcode properties" fi if test -n "$add_shlibpath"; then case :$compile_shlibpath: in *":$add_shlibpath:"*) ;; *) func_append compile_shlibpath "$add_shlibpath:" ;; esac fi if test "$linkmode" = prog; then test -n "$add_dir" && compile_deplibs="$add_dir $compile_deplibs" test -n "$add" && compile_deplibs="$add $compile_deplibs" else test -n "$add_dir" && deplibs="$add_dir $deplibs" test -n "$add" && deplibs="$add $deplibs" if test "$hardcode_direct" != yes && test "$hardcode_minus_L" != yes && test "$hardcode_shlibpath_var" = yes; then case :$finalize_shlibpath: in *":$libdir:"*) ;; *) func_append finalize_shlibpath "$libdir:" ;; esac fi fi fi if test "$linkmode" = prog || test "$opt_mode" = relink; then add_shlibpath= add_dir= add= # Finalize command for both is simple: just hardcode it. if test "$hardcode_direct" = yes && test "$hardcode_direct_absolute" = no; then add="$libdir/$linklib" elif test "$hardcode_minus_L" = yes; then add_dir="-L$libdir" add="-l$name" elif test "$hardcode_shlibpath_var" = yes; then case :$finalize_shlibpath: in *":$libdir:"*) ;; *) func_append finalize_shlibpath "$libdir:" ;; esac add="-l$name" elif test "$hardcode_automatic" = yes; then if test -n "$inst_prefix_dir" && test -f "$inst_prefix_dir$libdir/$linklib" ; then add="$inst_prefix_dir$libdir/$linklib" else add="$libdir/$linklib" fi else # We cannot seem to hardcode it, guess we'll fake it. add_dir="-L$libdir" # Try looking first in the location we're being installed to. if test -n "$inst_prefix_dir"; then case $libdir in [\\/]*) func_append add_dir " -L$inst_prefix_dir$libdir" ;; esac fi add="-l$name" fi if test "$linkmode" = prog; then test -n "$add_dir" && finalize_deplibs="$add_dir $finalize_deplibs" test -n "$add" && finalize_deplibs="$add $finalize_deplibs" else test -n "$add_dir" && deplibs="$add_dir $deplibs" test -n "$add" && deplibs="$add $deplibs" fi fi elif test "$linkmode" = prog; then # Here we assume that one of hardcode_direct or hardcode_minus_L # is not unsupported. This is valid on all known static and # shared platforms. if test "$hardcode_direct" != unsupported; then test -n "$old_library" && linklib="$old_library" compile_deplibs="$dir/$linklib $compile_deplibs" finalize_deplibs="$dir/$linklib $finalize_deplibs" else compile_deplibs="-l$name -L$dir $compile_deplibs" finalize_deplibs="-l$name -L$dir $finalize_deplibs" fi elif test "$build_libtool_libs" = yes; then # Not a shared library if test "$deplibs_check_method" != pass_all; then # We're trying link a shared library against a static one # but the system doesn't support it. # Just print a warning and add the library to dependency_libs so # that the program can be linked against the static library. echo $ECHO "*** Warning: This system can not link to static lib archive $lib." echo "*** I have the capability to make that library automatically link in when" echo "*** you link to this library. But I can only do this if you have a" echo "*** shared version of the library, which you do not appear to have." if test "$module" = yes; then echo "*** But as you try to build a module library, libtool will still create " echo "*** a static module, that should work as long as the dlopening application" echo "*** is linked with the -dlopen flag to resolve symbols at runtime." if test -z "$global_symbol_pipe"; then echo echo "*** However, this would only work if libtool was able to extract symbol" echo "*** lists from a program, using \`nm' or equivalent, but libtool could" echo "*** not find such a program. So, this module is probably useless." echo "*** \`nm' from GNU binutils and a full rebuild may help." fi if test "$build_old_libs" = no; then build_libtool_libs=module build_old_libs=yes else build_libtool_libs=no fi fi else deplibs="$dir/$old_library $deplibs" link_static=yes fi fi # link shared/static library? if test "$linkmode" = lib; then if test -n "$dependency_libs" && { test "$hardcode_into_libs" != yes || test "$build_old_libs" = yes || test "$link_static" = yes; }; then # Extract -R from dependency_libs temp_deplibs= for libdir in $dependency_libs; do case $libdir in -R*) func_stripname '-R' '' "$libdir" temp_xrpath=$func_stripname_result case " $xrpath " in *" $temp_xrpath "*) ;; *) func_append xrpath " $temp_xrpath";; esac;; *) func_append temp_deplibs " $libdir";; esac done dependency_libs="$temp_deplibs" fi func_append newlib_search_path " $absdir" # Link against this library test "$link_static" = no && newdependency_libs="$abs_ladir/$laname $newdependency_libs" # ... and its dependency_libs tmp_libs= for deplib in $dependency_libs; do newdependency_libs="$deplib $newdependency_libs" case $deplib in -L*) func_stripname '-L' '' "$deplib" func_resolve_sysroot "$func_stripname_result";; *) func_resolve_sysroot "$deplib" ;; esac if $opt_preserve_dup_deps ; then case "$tmp_libs " in *" $func_resolve_sysroot_result "*) func_append specialdeplibs " $func_resolve_sysroot_result" ;; esac fi func_append tmp_libs " $func_resolve_sysroot_result" done if test "$link_all_deplibs" != no; then # Add the search paths of all dependency libraries for deplib in $dependency_libs; do path= case $deplib in -L*) path="$deplib" ;; *.la) func_resolve_sysroot "$deplib" deplib=$func_resolve_sysroot_result func_dirname "$deplib" "" "." dir=$func_dirname_result # We need an absolute path. case $dir in [\\/]* | [A-Za-z]:[\\/]*) absdir="$dir" ;; *) absdir=`cd "$dir" && pwd` if test -z "$absdir"; then func_warning "cannot determine absolute directory name of \`$dir'" absdir="$dir" fi ;; esac if $GREP "^installed=no" $deplib > /dev/null; then case $host in *-*-darwin*) depdepl= eval deplibrary_names=`${SED} -n -e 's/^library_names=\(.*\)$/\1/p' $deplib` if test -n "$deplibrary_names" ; then for tmp in $deplibrary_names ; do depdepl=$tmp done if test -f "$absdir/$objdir/$depdepl" ; then depdepl="$absdir/$objdir/$depdepl" darwin_install_name=`${OTOOL} -L $depdepl | awk '{if (NR == 2) {print $1;exit}}'` if test -z "$darwin_install_name"; then darwin_install_name=`${OTOOL64} -L $depdepl | awk '{if (NR == 2) {print $1;exit}}'` fi func_append compiler_flags " ${wl}-dylib_file ${wl}${darwin_install_name}:${depdepl}" func_append linker_flags " -dylib_file ${darwin_install_name}:${depdepl}" path= fi fi ;; *) path="-L$absdir/$objdir" ;; esac else eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $deplib` test -z "$libdir" && \ func_fatal_error "\`$deplib' is not a valid libtool archive" test "$absdir" != "$libdir" && \ func_warning "\`$deplib' seems to be moved" path="-L$absdir" fi ;; esac case " $deplibs " in *" $path "*) ;; *) deplibs="$path $deplibs" ;; esac done fi # link_all_deplibs != no fi # linkmode = lib done # for deplib in $libs if test "$pass" = link; then if test "$linkmode" = "prog"; then compile_deplibs="$new_inherited_linker_flags $compile_deplibs" finalize_deplibs="$new_inherited_linker_flags $finalize_deplibs" else compiler_flags="$compiler_flags "`$ECHO " $new_inherited_linker_flags" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` fi fi dependency_libs="$newdependency_libs" if test "$pass" = dlpreopen; then # Link the dlpreopened libraries before other libraries for deplib in $save_deplibs; do deplibs="$deplib $deplibs" done fi if test "$pass" != dlopen; then if test "$pass" != conv; then # Make sure lib_search_path contains only unique directories. lib_search_path= for dir in $newlib_search_path; do case "$lib_search_path " in *" $dir "*) ;; *) func_append lib_search_path " $dir" ;; esac done newlib_search_path= fi if test "$linkmode,$pass" != "prog,link"; then vars="deplibs" else vars="compile_deplibs finalize_deplibs" fi for var in $vars dependency_libs; do # Add libraries to $var in reverse order eval tmp_libs=\"\$$var\" new_libs= for deplib in $tmp_libs; do # FIXME: Pedantically, this is the right thing to do, so # that some nasty dependency loop isn't accidentally # broken: #new_libs="$deplib $new_libs" # Pragmatically, this seems to cause very few problems in # practice: case $deplib in -L*) new_libs="$deplib $new_libs" ;; -R*) ;; *) # And here is the reason: when a library appears more # than once as an explicit dependence of a library, or # is implicitly linked in more than once by the # compiler, it is considered special, and multiple # occurrences thereof are not removed. Compare this # with having the same library being listed as a # dependency of multiple other libraries: in this case, # we know (pedantically, we assume) the library does not # need to be listed more than once, so we keep only the # last copy. This is not always right, but it is rare # enough that we require users that really mean to play # such unportable linking tricks to link the library # using -Wl,-lname, so that libtool does not consider it # for duplicate removal. case " $specialdeplibs " in *" $deplib "*) new_libs="$deplib $new_libs" ;; *) case " $new_libs " in *" $deplib "*) ;; *) new_libs="$deplib $new_libs" ;; esac ;; esac ;; esac done tmp_libs= for deplib in $new_libs; do case $deplib in -L*) case " $tmp_libs " in *" $deplib "*) ;; *) func_append tmp_libs " $deplib" ;; esac ;; *) func_append tmp_libs " $deplib" ;; esac done eval $var=\"$tmp_libs\" done # for var fi # Last step: remove runtime libs from dependency_libs # (they stay in deplibs) tmp_libs= for i in $dependency_libs ; do case " $predeps $postdeps $compiler_lib_search_path " in *" $i "*) i="" ;; esac if test -n "$i" ; then func_append tmp_libs " $i" fi done dependency_libs=$tmp_libs done # for pass if test "$linkmode" = prog; then dlfiles="$newdlfiles" fi if test "$linkmode" = prog || test "$linkmode" = lib; then dlprefiles="$newdlprefiles" fi case $linkmode in oldlib) if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; then func_warning "\`-dlopen' is ignored for archives" fi case " $deplibs" in *\ -l* | *\ -L*) func_warning "\`-l' and \`-L' are ignored for archives" ;; esac test -n "$rpath" && \ func_warning "\`-rpath' is ignored for archives" test -n "$xrpath" && \ func_warning "\`-R' is ignored for archives" test -n "$vinfo" && \ func_warning "\`-version-info/-version-number' is ignored for archives" test -n "$release" && \ func_warning "\`-release' is ignored for archives" test -n "$export_symbols$export_symbols_regex" && \ func_warning "\`-export-symbols' is ignored for archives" # Now set the variables for building old libraries. build_libtool_libs=no oldlibs="$output" func_append objs "$old_deplibs" ;; lib) # Make sure we only generate libraries of the form `libNAME.la'. case $outputname in lib*) func_stripname 'lib' '.la' "$outputname" name=$func_stripname_result eval shared_ext=\"$shrext_cmds\" eval libname=\"$libname_spec\" ;; *) test "$module" = no && \ func_fatal_help "libtool library \`$output' must begin with \`lib'" if test "$need_lib_prefix" != no; then # Add the "lib" prefix for modules if required func_stripname '' '.la' "$outputname" name=$func_stripname_result eval shared_ext=\"$shrext_cmds\" eval libname=\"$libname_spec\" else func_stripname '' '.la' "$outputname" libname=$func_stripname_result fi ;; esac if test -n "$objs"; then if test "$deplibs_check_method" != pass_all; then func_fatal_error "cannot build libtool library \`$output' from non-libtool objects on this host:$objs" else echo $ECHO "*** Warning: Linking the shared library $output against the non-libtool" $ECHO "*** objects $objs is not portable!" func_append libobjs " $objs" fi fi test "$dlself" != no && \ func_warning "\`-dlopen self' is ignored for libtool libraries" set dummy $rpath shift test "$#" -gt 1 && \ func_warning "ignoring multiple \`-rpath's for a libtool library" install_libdir="$1" oldlibs= if test -z "$rpath"; then if test "$build_libtool_libs" = yes; then # Building a libtool convenience library. # Some compilers have problems with a `.al' extension so # convenience libraries should have the same extension an # archive normally would. oldlibs="$output_objdir/$libname.$libext $oldlibs" build_libtool_libs=convenience build_old_libs=yes fi test -n "$vinfo" && \ func_warning "\`-version-info/-version-number' is ignored for convenience libraries" test -n "$release" && \ func_warning "\`-release' is ignored for convenience libraries" else # Parse the version information argument. save_ifs="$IFS"; IFS=':' set dummy $vinfo 0 0 0 shift IFS="$save_ifs" test -n "$7" && \ func_fatal_help "too many parameters to \`-version-info'" # convert absolute version numbers to libtool ages # this retains compatibility with .la files and attempts # to make the code below a bit more comprehensible case $vinfo_number in yes) number_major="$1" number_minor="$2" number_revision="$3" # # There are really only two kinds -- those that # use the current revision as the major version # and those that subtract age and use age as # a minor version. But, then there is irix # which has an extra 1 added just for fun # case $version_type in # correct linux to gnu/linux during the next big refactor darwin|linux|osf|windows|none) func_arith $number_major + $number_minor current=$func_arith_result age="$number_minor" revision="$number_revision" ;; freebsd-aout|freebsd-elf|qnx|sunos) current="$number_major" revision="$number_minor" age="0" ;; irix|nonstopux) func_arith $number_major + $number_minor current=$func_arith_result age="$number_minor" revision="$number_minor" lt_irix_increment=no ;; *) func_fatal_configuration "$modename: unknown library version type \`$version_type'" ;; esac ;; no) current="$1" revision="$2" age="$3" ;; esac # Check that each of the things are valid numbers. case $current in 0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;; *) func_error "CURRENT \`$current' must be a nonnegative integer" func_fatal_error "\`$vinfo' is not valid version information" ;; esac case $revision in 0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;; *) func_error "REVISION \`$revision' must be a nonnegative integer" func_fatal_error "\`$vinfo' is not valid version information" ;; esac case $age in 0|[1-9]|[1-9][0-9]|[1-9][0-9][0-9]|[1-9][0-9][0-9][0-9]|[1-9][0-9][0-9][0-9][0-9]) ;; *) func_error "AGE \`$age' must be a nonnegative integer" func_fatal_error "\`$vinfo' is not valid version information" ;; esac if test "$age" -gt "$current"; then func_error "AGE \`$age' is greater than the current interface number \`$current'" func_fatal_error "\`$vinfo' is not valid version information" fi # Calculate the version variables. major= versuffix= verstring= case $version_type in none) ;; darwin) # Like Linux, but with the current version available in # verstring for coding it into the library header func_arith $current - $age major=.$func_arith_result versuffix="$major.$age.$revision" # Darwin ld doesn't like 0 for these options... func_arith $current + 1 minor_current=$func_arith_result xlcverstring="${wl}-compatibility_version ${wl}$minor_current ${wl}-current_version ${wl}$minor_current.$revision" verstring="-compatibility_version $minor_current -current_version $minor_current.$revision" ;; freebsd-aout) major=".$current" versuffix=".$current.$revision"; ;; freebsd-elf) major=".$current" versuffix=".$current" ;; irix | nonstopux) if test "X$lt_irix_increment" = "Xno"; then func_arith $current - $age else func_arith $current - $age + 1 fi major=$func_arith_result case $version_type in nonstopux) verstring_prefix=nonstopux ;; *) verstring_prefix=sgi ;; esac verstring="$verstring_prefix$major.$revision" # Add in all the interfaces that we are compatible with. loop=$revision while test "$loop" -ne 0; do func_arith $revision - $loop iface=$func_arith_result func_arith $loop - 1 loop=$func_arith_result verstring="$verstring_prefix$major.$iface:$verstring" done # Before this point, $major must not contain `.'. major=.$major versuffix="$major.$revision" ;; linux) # correct to gnu/linux during the next big refactor func_arith $current - $age major=.$func_arith_result versuffix="$major.$age.$revision" ;; osf) func_arith $current - $age major=.$func_arith_result versuffix=".$current.$age.$revision" verstring="$current.$age.$revision" # Add in all the interfaces that we are compatible with. loop=$age while test "$loop" -ne 0; do func_arith $current - $loop iface=$func_arith_result func_arith $loop - 1 loop=$func_arith_result verstring="$verstring:${iface}.0" done # Make executables depend on our current version. func_append verstring ":${current}.0" ;; qnx) major=".$current" versuffix=".$current" ;; sunos) major=".$current" versuffix=".$current.$revision" ;; windows) # Use '-' rather than '.', since we only want one # extension on DOS 8.3 filesystems. func_arith $current - $age major=$func_arith_result versuffix="-$major" ;; *) func_fatal_configuration "unknown library version type \`$version_type'" ;; esac # Clear the version info if we defaulted, and they specified a release. if test -z "$vinfo" && test -n "$release"; then major= case $version_type in darwin) # we can't check for "0.0" in archive_cmds due to quoting # problems, so we reset it completely verstring= ;; *) verstring="0.0" ;; esac if test "$need_version" = no; then versuffix= else versuffix=".0.0" fi fi # Remove version info from name if versioning should be avoided if test "$avoid_version" = yes && test "$need_version" = no; then major= versuffix= verstring="" fi # Check to see if the archive will have undefined symbols. if test "$allow_undefined" = yes; then if test "$allow_undefined_flag" = unsupported; then func_warning "undefined symbols not allowed in $host shared libraries" build_libtool_libs=no build_old_libs=yes fi else # Don't allow undefined symbols. allow_undefined_flag="$no_undefined_flag" fi fi func_generate_dlsyms "$libname" "$libname" "yes" func_append libobjs " $symfileobj" test "X$libobjs" = "X " && libobjs= if test "$opt_mode" != relink; then # Remove our outputs, but don't remove object files since they # may have been created when compiling PIC objects. removelist= tempremovelist=`$ECHO "$output_objdir/*"` for p in $tempremovelist; do case $p in *.$objext | *.gcno) ;; $output_objdir/$outputname | $output_objdir/$libname.* | $output_objdir/${libname}${release}.*) if test "X$precious_files_regex" != "X"; then if $ECHO "$p" | $EGREP -e "$precious_files_regex" >/dev/null 2>&1 then continue fi fi func_append removelist " $p" ;; *) ;; esac done test -n "$removelist" && \ func_show_eval "${RM}r \$removelist" fi # Now set the variables for building old libraries. if test "$build_old_libs" = yes && test "$build_libtool_libs" != convenience ; then func_append oldlibs " $output_objdir/$libname.$libext" # Transform .lo files to .o files. oldobjs="$objs "`$ECHO "$libobjs" | $SP2NL | $SED "/\.${libext}$/d; $lo2o" | $NL2SP` fi # Eliminate all temporary directories. #for path in $notinst_path; do # lib_search_path=`$ECHO "$lib_search_path " | $SED "s% $path % %g"` # deplibs=`$ECHO "$deplibs " | $SED "s% -L$path % %g"` # dependency_libs=`$ECHO "$dependency_libs " | $SED "s% -L$path % %g"` #done if test -n "$xrpath"; then # If the user specified any rpath flags, then add them. temp_xrpath= for libdir in $xrpath; do func_replace_sysroot "$libdir" func_append temp_xrpath " -R$func_replace_sysroot_result" case "$finalize_rpath " in *" $libdir "*) ;; *) func_append finalize_rpath " $libdir" ;; esac done if test "$hardcode_into_libs" != yes || test "$build_old_libs" = yes; then dependency_libs="$temp_xrpath $dependency_libs" fi fi # Make sure dlfiles contains only unique files that won't be dlpreopened old_dlfiles="$dlfiles" dlfiles= for lib in $old_dlfiles; do case " $dlprefiles $dlfiles " in *" $lib "*) ;; *) func_append dlfiles " $lib" ;; esac done # Make sure dlprefiles contains only unique files old_dlprefiles="$dlprefiles" dlprefiles= for lib in $old_dlprefiles; do case "$dlprefiles " in *" $lib "*) ;; *) func_append dlprefiles " $lib" ;; esac done if test "$build_libtool_libs" = yes; then if test -n "$rpath"; then case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-*-beos* | *-cegcc* | *-*-haiku*) # these systems don't actually have a c library (as such)! ;; *-*-rhapsody* | *-*-darwin1.[012]) # Rhapsody C library is in the System framework func_append deplibs " System.ltframework" ;; *-*-netbsd*) # Don't link with libc until the a.out ld.so is fixed. ;; *-*-openbsd* | *-*-freebsd* | *-*-dragonfly*) # Do not include libc due to us having libc/libc_r. ;; *-*-sco3.2v5* | *-*-sco5v6*) # Causes problems with __ctype ;; *-*-sysv4.2uw2* | *-*-sysv5* | *-*-unixware* | *-*-OpenUNIX*) # Compiler inserts libc in the correct place for threads to work ;; *) # Add libc to deplibs on all other systems if necessary. if test "$build_libtool_need_lc" = "yes"; then func_append deplibs " -lc" fi ;; esac fi # Transform deplibs into only deplibs that can be linked in shared. name_save=$name libname_save=$libname release_save=$release versuffix_save=$versuffix major_save=$major # I'm not sure if I'm treating the release correctly. I think # release should show up in the -l (ie -lgmp5) so we don't want to # add it in twice. Is that correct? release="" versuffix="" major="" newdeplibs= droppeddeps=no case $deplibs_check_method in pass_all) # Don't check for shared/static. Everything works. # This might be a little naive. We might want to check # whether the library exists or not. But this is on # osf3 & osf4 and I'm not really sure... Just # implementing what was already the behavior. newdeplibs=$deplibs ;; test_compile) # This code stresses the "libraries are programs" paradigm to its # limits. Maybe even breaks it. We compile a program, linking it # against the deplibs as a proxy for the library. Then we can check # whether they linked in statically or dynamically with ldd. $opt_dry_run || $RM conftest.c cat > conftest.c </dev/null` $nocaseglob else potential_libs=`ls $i/$libnameglob[.-]* 2>/dev/null` fi for potent_lib in $potential_libs; do # Follow soft links. if ls -lLd "$potent_lib" 2>/dev/null | $GREP " -> " >/dev/null; then continue fi # The statement above tries to avoid entering an # endless loop below, in case of cyclic links. # We might still enter an endless loop, since a link # loop can be closed while we follow links, # but so what? potlib="$potent_lib" while test -h "$potlib" 2>/dev/null; do potliblink=`ls -ld $potlib | ${SED} 's/.* -> //'` case $potliblink in [\\/]* | [A-Za-z]:[\\/]*) potlib="$potliblink";; *) potlib=`$ECHO "$potlib" | $SED 's,[^/]*$,,'`"$potliblink";; esac done if eval $file_magic_cmd \"\$potlib\" 2>/dev/null | $SED -e 10q | $EGREP "$file_magic_regex" > /dev/null; then func_append newdeplibs " $a_deplib" a_deplib="" break 2 fi done done fi if test -n "$a_deplib" ; then droppeddeps=yes echo $ECHO "*** Warning: linker path does not have real file for library $a_deplib." echo "*** I have the capability to make that library automatically link in when" echo "*** you link to this library. But I can only do this if you have a" echo "*** shared version of the library, which you do not appear to have" echo "*** because I did check the linker path looking for a file starting" if test -z "$potlib" ; then $ECHO "*** with $libname but no candidates were found. (...for file magic test)" else $ECHO "*** with $libname and none of the candidates passed a file format test" $ECHO "*** using a file magic. Last file checked: $potlib" fi fi ;; *) # Add a -L argument. func_append newdeplibs " $a_deplib" ;; esac done # Gone through all deplibs. ;; match_pattern*) set dummy $deplibs_check_method; shift match_pattern_regex=`expr "$deplibs_check_method" : "$1 \(.*\)"` for a_deplib in $deplibs; do case $a_deplib in -l*) func_stripname -l '' "$a_deplib" name=$func_stripname_result if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then case " $predeps $postdeps " in *" $a_deplib "*) func_append newdeplibs " $a_deplib" a_deplib="" ;; esac fi if test -n "$a_deplib" ; then libname=`eval "\\$ECHO \"$libname_spec\""` for i in $lib_search_path $sys_lib_search_path $shlib_search_path; do potential_libs=`ls $i/$libname[.-]* 2>/dev/null` for potent_lib in $potential_libs; do potlib="$potent_lib" # see symlink-check above in file_magic test if eval "\$ECHO \"$potent_lib\"" 2>/dev/null | $SED 10q | \ $EGREP "$match_pattern_regex" > /dev/null; then func_append newdeplibs " $a_deplib" a_deplib="" break 2 fi done done fi if test -n "$a_deplib" ; then droppeddeps=yes echo $ECHO "*** Warning: linker path does not have real file for library $a_deplib." echo "*** I have the capability to make that library automatically link in when" echo "*** you link to this library. But I can only do this if you have a" echo "*** shared version of the library, which you do not appear to have" echo "*** because I did check the linker path looking for a file starting" if test -z "$potlib" ; then $ECHO "*** with $libname but no candidates were found. (...for regex pattern test)" else $ECHO "*** with $libname and none of the candidates passed a file format test" $ECHO "*** using a regex pattern. Last file checked: $potlib" fi fi ;; *) # Add a -L argument. func_append newdeplibs " $a_deplib" ;; esac done # Gone through all deplibs. ;; none | unknown | *) newdeplibs="" tmp_deplibs=`$ECHO " $deplibs" | $SED 's/ -lc$//; s/ -[LR][^ ]*//g'` if test "X$allow_libtool_libs_with_static_runtimes" = "Xyes" ; then for i in $predeps $postdeps ; do # can't use Xsed below, because $i might contain '/' tmp_deplibs=`$ECHO " $tmp_deplibs" | $SED "s,$i,,"` done fi case $tmp_deplibs in *[!\ \ ]*) echo if test "X$deplibs_check_method" = "Xnone"; then echo "*** Warning: inter-library dependencies are not supported in this platform." else echo "*** Warning: inter-library dependencies are not known to be supported." fi echo "*** All declared inter-library dependencies are being dropped." droppeddeps=yes ;; esac ;; esac versuffix=$versuffix_save major=$major_save release=$release_save libname=$libname_save name=$name_save case $host in *-*-rhapsody* | *-*-darwin1.[012]) # On Rhapsody replace the C library with the System framework newdeplibs=`$ECHO " $newdeplibs" | $SED 's/ -lc / System.ltframework /'` ;; esac if test "$droppeddeps" = yes; then if test "$module" = yes; then echo echo "*** Warning: libtool could not satisfy all declared inter-library" $ECHO "*** dependencies of module $libname. Therefore, libtool will create" echo "*** a static module, that should work as long as the dlopening" echo "*** application is linked with the -dlopen flag." if test -z "$global_symbol_pipe"; then echo echo "*** However, this would only work if libtool was able to extract symbol" echo "*** lists from a program, using \`nm' or equivalent, but libtool could" echo "*** not find such a program. So, this module is probably useless." echo "*** \`nm' from GNU binutils and a full rebuild may help." fi if test "$build_old_libs" = no; then oldlibs="$output_objdir/$libname.$libext" build_libtool_libs=module build_old_libs=yes else build_libtool_libs=no fi else echo "*** The inter-library dependencies that have been dropped here will be" echo "*** automatically added whenever a program is linked with this library" echo "*** or is declared to -dlopen it." if test "$allow_undefined" = no; then echo echo "*** Since this library must not contain undefined symbols," echo "*** because either the platform does not support them or" echo "*** it was explicitly requested with -no-undefined," echo "*** libtool will only create a static version of it." if test "$build_old_libs" = no; then oldlibs="$output_objdir/$libname.$libext" build_libtool_libs=module build_old_libs=yes else build_libtool_libs=no fi fi fi fi # Done checking deplibs! deplibs=$newdeplibs fi # Time to change all our "foo.ltframework" stuff back to "-framework foo" case $host in *-*-darwin*) newdeplibs=`$ECHO " $newdeplibs" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` new_inherited_linker_flags=`$ECHO " $new_inherited_linker_flags" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` deplibs=`$ECHO " $deplibs" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` ;; esac # move library search paths that coincide with paths to not yet # installed libraries to the beginning of the library search list new_libs= for path in $notinst_path; do case " $new_libs " in *" -L$path/$objdir "*) ;; *) case " $deplibs " in *" -L$path/$objdir "*) func_append new_libs " -L$path/$objdir" ;; esac ;; esac done for deplib in $deplibs; do case $deplib in -L*) case " $new_libs " in *" $deplib "*) ;; *) func_append new_libs " $deplib" ;; esac ;; *) func_append new_libs " $deplib" ;; esac done deplibs="$new_libs" # All the library-specific variables (install_libdir is set above). library_names= old_library= dlname= # Test again, we may have decided not to build it any more if test "$build_libtool_libs" = yes; then # Remove ${wl} instances when linking with ld. # FIXME: should test the right _cmds variable. case $archive_cmds in *\$LD\ *) wl= ;; esac if test "$hardcode_into_libs" = yes; then # Hardcode the library paths hardcode_libdirs= dep_rpath= rpath="$finalize_rpath" test "$opt_mode" != relink && rpath="$compile_rpath$rpath" for libdir in $rpath; do if test -n "$hardcode_libdir_flag_spec"; then if test -n "$hardcode_libdir_separator"; then func_replace_sysroot "$libdir" libdir=$func_replace_sysroot_result if test -z "$hardcode_libdirs"; then hardcode_libdirs="$libdir" else # Just accumulate the unique libdirs. case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*) ;; *) func_append hardcode_libdirs "$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" func_append dep_rpath " $flag" fi elif test -n "$runpath_var"; then case "$perm_rpath " in *" $libdir "*) ;; *) func_append perm_rpath " $libdir" ;; esac fi done # Substitute the hardcoded libdirs into the rpath. if test -n "$hardcode_libdir_separator" && test -n "$hardcode_libdirs"; then libdir="$hardcode_libdirs" eval "dep_rpath=\"$hardcode_libdir_flag_spec\"" fi if test -n "$runpath_var" && test -n "$perm_rpath"; then # We should set the runpath_var. rpath= for dir in $perm_rpath; do func_append rpath "$dir:" done eval "$runpath_var='$rpath\$$runpath_var'; export $runpath_var" fi test -n "$dep_rpath" && deplibs="$dep_rpath $deplibs" fi shlibpath="$finalize_shlibpath" test "$opt_mode" != relink && shlibpath="$compile_shlibpath$shlibpath" if test -n "$shlibpath"; then eval "$shlibpath_var='$shlibpath\$$shlibpath_var'; export $shlibpath_var" fi # Get the real and link names of the library. eval shared_ext=\"$shrext_cmds\" eval library_names=\"$library_names_spec\" set dummy $library_names shift realname="$1" shift if test -n "$soname_spec"; then eval soname=\"$soname_spec\" else soname="$realname" fi if test -z "$dlname"; then dlname=$soname fi lib="$output_objdir/$realname" linknames= for link do func_append linknames " $link" done # Use standard objects if they are pic test -z "$pic_flag" && libobjs=`$ECHO "$libobjs" | $SP2NL | $SED "$lo2o" | $NL2SP` test "X$libobjs" = "X " && libobjs= delfiles= if test -n "$export_symbols" && test -n "$include_expsyms"; then $opt_dry_run || cp "$export_symbols" "$output_objdir/$libname.uexp" export_symbols="$output_objdir/$libname.uexp" func_append delfiles " $export_symbols" fi orig_export_symbols= case $host_os in cygwin* | mingw* | cegcc*) if test -n "$export_symbols" && test -z "$export_symbols_regex"; then # exporting using user supplied symfile if test "x`$SED 1q $export_symbols`" != xEXPORTS; then # and it's NOT already a .def file. Must figure out # which of the given symbols are data symbols and tag # them as such. So, trigger use of export_symbols_cmds. # export_symbols gets reassigned inside the "prepare # the list of exported symbols" if statement, so the # include_expsyms logic still works. orig_export_symbols="$export_symbols" export_symbols= always_export_symbols=yes fi fi ;; esac # Prepare the list of exported symbols if test -z "$export_symbols"; then if test "$always_export_symbols" = yes || test -n "$export_symbols_regex"; then func_verbose "generating symbol list for \`$libname.la'" export_symbols="$output_objdir/$libname.exp" $opt_dry_run || $RM $export_symbols cmds=$export_symbols_cmds save_ifs="$IFS"; IFS='~' for cmd1 in $cmds; do IFS="$save_ifs" # Take the normal branch if the nm_file_list_spec branch # doesn't work or if tool conversion is not needed. case $nm_file_list_spec~$to_tool_file_cmd in *~func_convert_file_noop | *~func_convert_file_msys_to_w32 | ~*) try_normal_branch=yes eval cmd=\"$cmd1\" func_len " $cmd" len=$func_len_result ;; *) try_normal_branch=no ;; esac if test "$try_normal_branch" = yes \ && { test "$len" -lt "$max_cmd_len" \ || test "$max_cmd_len" -le -1; } then func_show_eval "$cmd" 'exit $?' skipped_export=false elif test -n "$nm_file_list_spec"; then func_basename "$output" output_la=$func_basename_result save_libobjs=$libobjs save_output=$output output=${output_objdir}/${output_la}.nm func_to_tool_file "$output" libobjs=$nm_file_list_spec$func_to_tool_file_result func_append delfiles " $output" func_verbose "creating $NM input file list: $output" for obj in $save_libobjs; do func_to_tool_file "$obj" $ECHO "$func_to_tool_file_result" done > "$output" eval cmd=\"$cmd1\" func_show_eval "$cmd" 'exit $?' output=$save_output libobjs=$save_libobjs skipped_export=false else # The command line is too long to execute in one step. func_verbose "using reloadable object file for export list..." skipped_export=: # Break out early, otherwise skipped_export may be # set to false by a later but shorter cmd. break fi done IFS="$save_ifs" if test -n "$export_symbols_regex" && test "X$skipped_export" != "X:"; then func_show_eval '$EGREP -e "$export_symbols_regex" "$export_symbols" > "${export_symbols}T"' func_show_eval '$MV "${export_symbols}T" "$export_symbols"' fi fi fi if test -n "$export_symbols" && test -n "$include_expsyms"; then tmp_export_symbols="$export_symbols" test -n "$orig_export_symbols" && tmp_export_symbols="$orig_export_symbols" $opt_dry_run || eval '$ECHO "$include_expsyms" | $SP2NL >> "$tmp_export_symbols"' fi if test "X$skipped_export" != "X:" && test -n "$orig_export_symbols"; then # The given exports_symbols file has to be filtered, so filter it. func_verbose "filter symbol list for \`$libname.la' to tag DATA exports" # FIXME: $output_objdir/$libname.filter potentially contains lots of # 's' commands which not all seds can handle. GNU sed should be fine # though. Also, the filter scales superlinearly with the number of # global variables. join(1) would be nice here, but unfortunately # isn't a blessed tool. $opt_dry_run || $SED -e '/[ ,]DATA/!d;s,\(.*\)\([ \,].*\),s|^\1$|\1\2|,' < $export_symbols > $output_objdir/$libname.filter func_append delfiles " $export_symbols $output_objdir/$libname.filter" export_symbols=$output_objdir/$libname.def $opt_dry_run || $SED -f $output_objdir/$libname.filter < $orig_export_symbols > $export_symbols fi tmp_deplibs= for test_deplib in $deplibs; do case " $convenience " in *" $test_deplib "*) ;; *) func_append tmp_deplibs " $test_deplib" ;; esac done deplibs="$tmp_deplibs" if test -n "$convenience"; then if test -n "$whole_archive_flag_spec" && test "$compiler_needs_object" = yes && test -z "$libobjs"; then # extract the archives, so we have objects to list. # TODO: could optimize this to just extract one archive. whole_archive_flag_spec= fi if test -n "$whole_archive_flag_spec"; then save_libobjs=$libobjs eval libobjs=\"\$libobjs $whole_archive_flag_spec\" test "X$libobjs" = "X " && libobjs= else gentop="$output_objdir/${outputname}x" func_append generated " $gentop" func_extract_archives $gentop $convenience func_append libobjs " $func_extract_archives_result" test "X$libobjs" = "X " && libobjs= fi fi if test "$thread_safe" = yes && test -n "$thread_safe_flag_spec"; then eval flag=\"$thread_safe_flag_spec\" func_append linker_flags " $flag" fi # Make a backup of the uninstalled library when relinking if test "$opt_mode" = relink; then $opt_dry_run || eval '(cd $output_objdir && $RM ${realname}U && $MV $realname ${realname}U)' || exit $? fi # Do each of the archive commands. if test "$module" = yes && test -n "$module_cmds" ; then if test -n "$export_symbols" && test -n "$module_expsym_cmds"; then eval test_cmds=\"$module_expsym_cmds\" cmds=$module_expsym_cmds else eval test_cmds=\"$module_cmds\" cmds=$module_cmds fi else if test -n "$export_symbols" && test -n "$archive_expsym_cmds"; then eval test_cmds=\"$archive_expsym_cmds\" cmds=$archive_expsym_cmds else eval test_cmds=\"$archive_cmds\" cmds=$archive_cmds fi fi if test "X$skipped_export" != "X:" && func_len " $test_cmds" && len=$func_len_result && test "$len" -lt "$max_cmd_len" || test "$max_cmd_len" -le -1; then : else # The command line is too long to link in one step, link piecewise # or, if using GNU ld and skipped_export is not :, use a linker # script. # Save the value of $output and $libobjs because we want to # use them later. If we have whole_archive_flag_spec, we # want to use save_libobjs as it was before # whole_archive_flag_spec was expanded, because we can't # assume the linker understands whole_archive_flag_spec. # This may have to be revisited, in case too many # convenience libraries get linked in and end up exceeding # the spec. if test -z "$convenience" || test -z "$whole_archive_flag_spec"; then save_libobjs=$libobjs fi save_output=$output func_basename "$output" output_la=$func_basename_result # Clear the reloadable object creation command queue and # initialize k to one. test_cmds= concat_cmds= objlist= last_robj= k=1 if test -n "$save_libobjs" && test "X$skipped_export" != "X:" && test "$with_gnu_ld" = yes; then output=${output_objdir}/${output_la}.lnkscript func_verbose "creating GNU ld script: $output" echo 'INPUT (' > $output for obj in $save_libobjs do func_to_tool_file "$obj" $ECHO "$func_to_tool_file_result" >> $output done echo ')' >> $output func_append delfiles " $output" func_to_tool_file "$output" output=$func_to_tool_file_result elif test -n "$save_libobjs" && test "X$skipped_export" != "X:" && test "X$file_list_spec" != X; then output=${output_objdir}/${output_la}.lnk func_verbose "creating linker input file list: $output" : > $output set x $save_libobjs shift firstobj= if test "$compiler_needs_object" = yes; then firstobj="$1 " shift fi for obj do func_to_tool_file "$obj" $ECHO "$func_to_tool_file_result" >> $output done func_append delfiles " $output" func_to_tool_file "$output" output=$firstobj\"$file_list_spec$func_to_tool_file_result\" else if test -n "$save_libobjs"; then func_verbose "creating reloadable object files..." output=$output_objdir/$output_la-${k}.$objext eval test_cmds=\"$reload_cmds\" func_len " $test_cmds" len0=$func_len_result len=$len0 # Loop over the list of objects to be linked. for obj in $save_libobjs do func_len " $obj" func_arith $len + $func_len_result len=$func_arith_result if test "X$objlist" = X || test "$len" -lt "$max_cmd_len"; then func_append objlist " $obj" else # The command $test_cmds is almost too long, add a # command to the queue. if test "$k" -eq 1 ; then # The first file doesn't have a previous command to add. reload_objs=$objlist eval concat_cmds=\"$reload_cmds\" else # All subsequent reloadable object files will link in # the last one created. reload_objs="$objlist $last_robj" eval concat_cmds=\"\$concat_cmds~$reload_cmds~\$RM $last_robj\" fi last_robj=$output_objdir/$output_la-${k}.$objext func_arith $k + 1 k=$func_arith_result output=$output_objdir/$output_la-${k}.$objext objlist=" $obj" func_len " $last_robj" func_arith $len0 + $func_len_result len=$func_arith_result fi done # Handle the remaining objects by creating one last # reloadable object file. All subsequent reloadable object # files will link in the last one created. test -z "$concat_cmds" || concat_cmds=$concat_cmds~ reload_objs="$objlist $last_robj" eval concat_cmds=\"\${concat_cmds}$reload_cmds\" if test -n "$last_robj"; then eval concat_cmds=\"\${concat_cmds}~\$RM $last_robj\" fi func_append delfiles " $output" else output= fi if ${skipped_export-false}; then func_verbose "generating symbol list for \`$libname.la'" export_symbols="$output_objdir/$libname.exp" $opt_dry_run || $RM $export_symbols libobjs=$output # Append the command to create the export file. test -z "$concat_cmds" || concat_cmds=$concat_cmds~ eval concat_cmds=\"\$concat_cmds$export_symbols_cmds\" if test -n "$last_robj"; then eval concat_cmds=\"\$concat_cmds~\$RM $last_robj\" fi fi test -n "$save_libobjs" && func_verbose "creating a temporary reloadable object file: $output" # Loop through the commands generated above and execute them. save_ifs="$IFS"; IFS='~' for cmd in $concat_cmds; do IFS="$save_ifs" $opt_silent || { func_quote_for_expand "$cmd" eval "func_echo $func_quote_for_expand_result" } $opt_dry_run || eval "$cmd" || { lt_exit=$? # Restore the uninstalled library and exit if test "$opt_mode" = relink; then ( cd "$output_objdir" && \ $RM "${realname}T" && \ $MV "${realname}U" "$realname" ) fi exit $lt_exit } done IFS="$save_ifs" if test -n "$export_symbols_regex" && ${skipped_export-false}; then func_show_eval '$EGREP -e "$export_symbols_regex" "$export_symbols" > "${export_symbols}T"' func_show_eval '$MV "${export_symbols}T" "$export_symbols"' fi fi if ${skipped_export-false}; then if test -n "$export_symbols" && test -n "$include_expsyms"; then tmp_export_symbols="$export_symbols" test -n "$orig_export_symbols" && tmp_export_symbols="$orig_export_symbols" $opt_dry_run || eval '$ECHO "$include_expsyms" | $SP2NL >> "$tmp_export_symbols"' fi if test -n "$orig_export_symbols"; then # The given exports_symbols file has to be filtered, so filter it. func_verbose "filter symbol list for \`$libname.la' to tag DATA exports" # FIXME: $output_objdir/$libname.filter potentially contains lots of # 's' commands which not all seds can handle. GNU sed should be fine # though. Also, the filter scales superlinearly with the number of # global variables. join(1) would be nice here, but unfortunately # isn't a blessed tool. $opt_dry_run || $SED -e '/[ ,]DATA/!d;s,\(.*\)\([ \,].*\),s|^\1$|\1\2|,' < $export_symbols > $output_objdir/$libname.filter func_append delfiles " $export_symbols $output_objdir/$libname.filter" export_symbols=$output_objdir/$libname.def $opt_dry_run || $SED -f $output_objdir/$libname.filter < $orig_export_symbols > $export_symbols fi fi libobjs=$output # Restore the value of output. output=$save_output if test -n "$convenience" && test -n "$whole_archive_flag_spec"; then eval libobjs=\"\$libobjs $whole_archive_flag_spec\" test "X$libobjs" = "X " && libobjs= fi # Expand the library linking commands again to reset the # value of $libobjs for piecewise linking. # Do each of the archive commands. if test "$module" = yes && test -n "$module_cmds" ; then if test -n "$export_symbols" && test -n "$module_expsym_cmds"; then cmds=$module_expsym_cmds else cmds=$module_cmds fi else if test -n "$export_symbols" && test -n "$archive_expsym_cmds"; then cmds=$archive_expsym_cmds else cmds=$archive_cmds fi fi fi if test -n "$delfiles"; then # Append the command to remove temporary files to $cmds. eval cmds=\"\$cmds~\$RM $delfiles\" fi # Add any objects from preloaded convenience libraries if test -n "$dlprefiles"; then gentop="$output_objdir/${outputname}x" func_append generated " $gentop" func_extract_archives $gentop $dlprefiles func_append libobjs " $func_extract_archives_result" test "X$libobjs" = "X " && libobjs= fi save_ifs="$IFS"; IFS='~' for cmd in $cmds; do IFS="$save_ifs" eval cmd=\"$cmd\" $opt_silent || { func_quote_for_expand "$cmd" eval "func_echo $func_quote_for_expand_result" } $opt_dry_run || eval "$cmd" || { lt_exit=$? # Restore the uninstalled library and exit if test "$opt_mode" = relink; then ( cd "$output_objdir" && \ $RM "${realname}T" && \ $MV "${realname}U" "$realname" ) fi exit $lt_exit } done IFS="$save_ifs" # Restore the uninstalled library and exit if test "$opt_mode" = relink; then $opt_dry_run || eval '(cd $output_objdir && $RM ${realname}T && $MV $realname ${realname}T && $MV ${realname}U $realname)' || exit $? if test -n "$convenience"; then if test -z "$whole_archive_flag_spec"; then func_show_eval '${RM}r "$gentop"' fi fi exit $EXIT_SUCCESS fi # Create links to the real library. for linkname in $linknames; do if test "$realname" != "$linkname"; then func_show_eval '(cd "$output_objdir" && $RM "$linkname" && $LN_S "$realname" "$linkname")' 'exit $?' fi done # If -module or -export-dynamic was specified, set the dlname. if test "$module" = yes || test "$export_dynamic" = yes; then # On all known operating systems, these are identical. dlname="$soname" fi fi ;; obj) if test -n "$dlfiles$dlprefiles" || test "$dlself" != no; then func_warning "\`-dlopen' is ignored for objects" fi case " $deplibs" in *\ -l* | *\ -L*) func_warning "\`-l' and \`-L' are ignored for objects" ;; esac test -n "$rpath" && \ func_warning "\`-rpath' is ignored for objects" test -n "$xrpath" && \ func_warning "\`-R' is ignored for objects" test -n "$vinfo" && \ func_warning "\`-version-info' is ignored for objects" test -n "$release" && \ func_warning "\`-release' is ignored for objects" case $output in *.lo) test -n "$objs$old_deplibs" && \ func_fatal_error "cannot build library object \`$output' from non-libtool objects" libobj=$output func_lo2o "$libobj" obj=$func_lo2o_result ;; *) libobj= obj="$output" ;; esac # Delete the old objects. $opt_dry_run || $RM $obj $libobj # Objects from convenience libraries. This assumes # single-version convenience libraries. Whenever we create # different ones for PIC/non-PIC, this we'll have to duplicate # the extraction. reload_conv_objs= gentop= # reload_cmds runs $LD directly, so let us get rid of # -Wl from whole_archive_flag_spec and hope we can get by with # turning comma into space.. wl= if test -n "$convenience"; then if test -n "$whole_archive_flag_spec"; then eval tmp_whole_archive_flags=\"$whole_archive_flag_spec\" reload_conv_objs=$reload_objs\ `$ECHO "$tmp_whole_archive_flags" | $SED 's|,| |g'` else gentop="$output_objdir/${obj}x" func_append generated " $gentop" func_extract_archives $gentop $convenience reload_conv_objs="$reload_objs $func_extract_archives_result" fi fi # If we're not building shared, we need to use non_pic_objs test "$build_libtool_libs" != yes && libobjs="$non_pic_objects" # Create the old-style object. reload_objs="$objs$old_deplibs "`$ECHO "$libobjs" | $SP2NL | $SED "/\.${libext}$/d; /\.lib$/d; $lo2o" | $NL2SP`" $reload_conv_objs" ### testsuite: skip nested quoting test output="$obj" func_execute_cmds "$reload_cmds" 'exit $?' # Exit if we aren't doing a library object file. if test -z "$libobj"; then if test -n "$gentop"; then func_show_eval '${RM}r "$gentop"' fi exit $EXIT_SUCCESS fi if test "$build_libtool_libs" != yes; then if test -n "$gentop"; then func_show_eval '${RM}r "$gentop"' fi # Create an invalid libtool object if no PIC, so that we don't # accidentally link it into a program. # $show "echo timestamp > $libobj" # $opt_dry_run || eval "echo timestamp > $libobj" || exit $? exit $EXIT_SUCCESS fi if test -n "$pic_flag" || test "$pic_mode" != default; then # Only do commands if we really have different PIC objects. reload_objs="$libobjs $reload_conv_objs" output="$libobj" func_execute_cmds "$reload_cmds" 'exit $?' fi if test -n "$gentop"; then func_show_eval '${RM}r "$gentop"' fi exit $EXIT_SUCCESS ;; prog) case $host in *cygwin*) func_stripname '' '.exe' "$output" output=$func_stripname_result.exe;; esac test -n "$vinfo" && \ func_warning "\`-version-info' is ignored for programs" test -n "$release" && \ func_warning "\`-release' is ignored for programs" test "$preload" = yes \ && test "$dlopen_support" = unknown \ && test "$dlopen_self" = unknown \ && test "$dlopen_self_static" = unknown && \ func_warning "\`LT_INIT([dlopen])' not used. Assuming no dlopen support." case $host in *-*-rhapsody* | *-*-darwin1.[012]) # On Rhapsody replace the C library is the System framework compile_deplibs=`$ECHO " $compile_deplibs" | $SED 's/ -lc / System.ltframework /'` finalize_deplibs=`$ECHO " $finalize_deplibs" | $SED 's/ -lc / System.ltframework /'` ;; esac case $host in *-*-darwin*) # Don't allow lazy linking, it breaks C++ global constructors # But is supposedly fixed on 10.4 or later (yay!). if test "$tagname" = CXX ; then case ${MACOSX_DEPLOYMENT_TARGET-10.0} in 10.[0123]) func_append compile_command " ${wl}-bind_at_load" func_append finalize_command " ${wl}-bind_at_load" ;; esac fi # Time to change all our "foo.ltframework" stuff back to "-framework foo" compile_deplibs=`$ECHO " $compile_deplibs" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` finalize_deplibs=`$ECHO " $finalize_deplibs" | $SED 's% \([^ $]*\).ltframework% -framework \1%g'` ;; esac # move library search paths that coincide with paths to not yet # installed libraries to the beginning of the library search list new_libs= for path in $notinst_path; do case " $new_libs " in *" -L$path/$objdir "*) ;; *) case " $compile_deplibs " in *" -L$path/$objdir "*) func_append new_libs " -L$path/$objdir" ;; esac ;; esac done for deplib in $compile_deplibs; do case $deplib in -L*) case " $new_libs " in *" $deplib "*) ;; *) func_append new_libs " $deplib" ;; esac ;; *) func_append new_libs " $deplib" ;; esac done compile_deplibs="$new_libs" func_append compile_command " $compile_deplibs" func_append finalize_command " $finalize_deplibs" if test -n "$rpath$xrpath"; then # If the user specified any rpath flags, then add them. for libdir in $rpath $xrpath; do # This is the magic to use -rpath. case "$finalize_rpath " in *" $libdir "*) ;; *) func_append finalize_rpath " $libdir" ;; esac done fi # Now hardcode the library paths rpath= hardcode_libdirs= for libdir in $compile_rpath $finalize_rpath; do if test -n "$hardcode_libdir_flag_spec"; then if test -n "$hardcode_libdir_separator"; then if test -z "$hardcode_libdirs"; then hardcode_libdirs="$libdir" else # Just accumulate the unique libdirs. case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*) ;; *) func_append hardcode_libdirs "$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" func_append rpath " $flag" fi elif test -n "$runpath_var"; then case "$perm_rpath " in *" $libdir "*) ;; *) func_append perm_rpath " $libdir" ;; esac fi case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-os2* | *-cegcc*) testbindir=`${ECHO} "$libdir" | ${SED} -e 's*/lib$*/bin*'` case :$dllsearchpath: in *":$libdir:"*) ;; ::) dllsearchpath=$libdir;; *) func_append dllsearchpath ":$libdir";; esac case :$dllsearchpath: in *":$testbindir:"*) ;; ::) dllsearchpath=$testbindir;; *) func_append dllsearchpath ":$testbindir";; esac ;; esac done # Substitute the hardcoded libdirs into the rpath. if test -n "$hardcode_libdir_separator" && test -n "$hardcode_libdirs"; then libdir="$hardcode_libdirs" eval rpath=\" $hardcode_libdir_flag_spec\" fi compile_rpath="$rpath" rpath= hardcode_libdirs= for libdir in $finalize_rpath; do if test -n "$hardcode_libdir_flag_spec"; then if test -n "$hardcode_libdir_separator"; then if test -z "$hardcode_libdirs"; then hardcode_libdirs="$libdir" else # Just accumulate the unique libdirs. case $hardcode_libdir_separator$hardcode_libdirs$hardcode_libdir_separator in *"$hardcode_libdir_separator$libdir$hardcode_libdir_separator"*) ;; *) func_append hardcode_libdirs "$hardcode_libdir_separator$libdir" ;; esac fi else eval flag=\"$hardcode_libdir_flag_spec\" func_append rpath " $flag" fi elif test -n "$runpath_var"; then case "$finalize_perm_rpath " in *" $libdir "*) ;; *) func_append finalize_perm_rpath " $libdir" ;; esac fi done # Substitute the hardcoded libdirs into the rpath. if test -n "$hardcode_libdir_separator" && test -n "$hardcode_libdirs"; then libdir="$hardcode_libdirs" eval rpath=\" $hardcode_libdir_flag_spec\" fi finalize_rpath="$rpath" if test -n "$libobjs" && test "$build_old_libs" = yes; then # Transform all the library objects into standard objects. compile_command=`$ECHO "$compile_command" | $SP2NL | $SED "$lo2o" | $NL2SP` finalize_command=`$ECHO "$finalize_command" | $SP2NL | $SED "$lo2o" | $NL2SP` fi func_generate_dlsyms "$outputname" "@PROGRAM@" "no" # template prelinking step if test -n "$prelink_cmds"; then func_execute_cmds "$prelink_cmds" 'exit $?' fi wrappers_required=yes case $host in *cegcc* | *mingw32ce*) # Disable wrappers for cegcc and mingw32ce hosts, we are cross compiling anyway. wrappers_required=no ;; *cygwin* | *mingw* ) if test "$build_libtool_libs" != yes; then wrappers_required=no fi ;; *) if test "$need_relink" = no || test "$build_libtool_libs" != yes; then wrappers_required=no fi ;; esac if test "$wrappers_required" = no; then # Replace the output file specification. compile_command=`$ECHO "$compile_command" | $SED 's%@OUTPUT@%'"$output"'%g'` link_command="$compile_command$compile_rpath" # We have no uninstalled library dependencies, so finalize right now. exit_status=0 func_show_eval "$link_command" 'exit_status=$?' if test -n "$postlink_cmds"; then func_to_tool_file "$output" postlink_cmds=`func_echo_all "$postlink_cmds" | $SED -e 's%@OUTPUT@%'"$output"'%g' -e 's%@TOOL_OUTPUT@%'"$func_to_tool_file_result"'%g'` func_execute_cmds "$postlink_cmds" 'exit $?' fi # Delete the generated files. if test -f "$output_objdir/${outputname}S.${objext}"; then func_show_eval '$RM "$output_objdir/${outputname}S.${objext}"' fi exit $exit_status fi if test -n "$compile_shlibpath$finalize_shlibpath"; then compile_command="$shlibpath_var=\"$compile_shlibpath$finalize_shlibpath\$$shlibpath_var\" $compile_command" fi if test -n "$finalize_shlibpath"; then finalize_command="$shlibpath_var=\"$finalize_shlibpath\$$shlibpath_var\" $finalize_command" fi compile_var= finalize_var= if test -n "$runpath_var"; then if test -n "$perm_rpath"; then # We should set the runpath_var. rpath= for dir in $perm_rpath; do func_append rpath "$dir:" done compile_var="$runpath_var=\"$rpath\$$runpath_var\" " fi if test -n "$finalize_perm_rpath"; then # We should set the runpath_var. rpath= for dir in $finalize_perm_rpath; do func_append rpath "$dir:" done finalize_var="$runpath_var=\"$rpath\$$runpath_var\" " fi fi if test "$no_install" = yes; then # We don't need to create a wrapper script. link_command="$compile_var$compile_command$compile_rpath" # Replace the output file specification. link_command=`$ECHO "$link_command" | $SED 's%@OUTPUT@%'"$output"'%g'` # Delete the old output file. $opt_dry_run || $RM $output # Link the executable and exit func_show_eval "$link_command" 'exit $?' if test -n "$postlink_cmds"; then func_to_tool_file "$output" postlink_cmds=`func_echo_all "$postlink_cmds" | $SED -e 's%@OUTPUT@%'"$output"'%g' -e 's%@TOOL_OUTPUT@%'"$func_to_tool_file_result"'%g'` func_execute_cmds "$postlink_cmds" 'exit $?' fi exit $EXIT_SUCCESS fi if test "$hardcode_action" = relink; then # Fast installation is not supported link_command="$compile_var$compile_command$compile_rpath" relink_command="$finalize_var$finalize_command$finalize_rpath" func_warning "this platform does not like uninstalled shared libraries" func_warning "\`$output' will be relinked during installation" else if test "$fast_install" != no; then link_command="$finalize_var$compile_command$finalize_rpath" if test "$fast_install" = yes; then relink_command=`$ECHO "$compile_var$compile_command$compile_rpath" | $SED 's%@OUTPUT@%\$progdir/\$file%g'` else # fast_install is set to needless relink_command= fi else link_command="$compile_var$compile_command$compile_rpath" relink_command="$finalize_var$finalize_command$finalize_rpath" fi fi # Replace the output file specification. link_command=`$ECHO "$link_command" | $SED 's%@OUTPUT@%'"$output_objdir/$outputname"'%g'` # Delete the old output files. $opt_dry_run || $RM $output $output_objdir/$outputname $output_objdir/lt-$outputname func_show_eval "$link_command" 'exit $?' if test -n "$postlink_cmds"; then func_to_tool_file "$output_objdir/$outputname" postlink_cmds=`func_echo_all "$postlink_cmds" | $SED -e 's%@OUTPUT@%'"$output_objdir/$outputname"'%g' -e 's%@TOOL_OUTPUT@%'"$func_to_tool_file_result"'%g'` func_execute_cmds "$postlink_cmds" 'exit $?' fi # Now create the wrapper script. func_verbose "creating $output" # Quote the relink command for shipping. if test -n "$relink_command"; then # Preserve any variables that may affect compiler behavior for var in $variables_saved_for_relink; do if eval test -z \"\${$var+set}\"; then relink_command="{ test -z \"\${$var+set}\" || $lt_unset $var || { $var=; export $var; }; }; $relink_command" elif eval var_value=\$$var; test -z "$var_value"; then relink_command="$var=; export $var; $relink_command" else func_quote_for_eval "$var_value" relink_command="$var=$func_quote_for_eval_result; export $var; $relink_command" fi done relink_command="(cd `pwd`; $relink_command)" relink_command=`$ECHO "$relink_command" | $SED "$sed_quote_subst"` fi # Only actually do things if not in dry run mode. $opt_dry_run || { # win32 will think the script is a binary if it has # a .exe suffix, so we strip it off here. case $output in *.exe) func_stripname '' '.exe' "$output" output=$func_stripname_result ;; esac # test for cygwin because mv fails w/o .exe extensions case $host in *cygwin*) exeext=.exe func_stripname '' '.exe' "$outputname" outputname=$func_stripname_result ;; *) exeext= ;; esac case $host in *cygwin* | *mingw* ) func_dirname_and_basename "$output" "" "." output_name=$func_basename_result output_path=$func_dirname_result cwrappersource="$output_path/$objdir/lt-$output_name.c" cwrapper="$output_path/$output_name.exe" $RM $cwrappersource $cwrapper trap "$RM $cwrappersource $cwrapper; exit $EXIT_FAILURE" 1 2 15 func_emit_cwrapperexe_src > $cwrappersource # The wrapper executable is built using the $host compiler, # because it contains $host paths and files. If cross- # compiling, it, like the target executable, must be # executed on the $host or under an emulation environment. $opt_dry_run || { $LTCC $LTCFLAGS -o $cwrapper $cwrappersource $STRIP $cwrapper } # Now, create the wrapper script for func_source use: func_ltwrapper_scriptname $cwrapper $RM $func_ltwrapper_scriptname_result trap "$RM $func_ltwrapper_scriptname_result; exit $EXIT_FAILURE" 1 2 15 $opt_dry_run || { # note: this script will not be executed, so do not chmod. if test "x$build" = "x$host" ; then $cwrapper --lt-dump-script > $func_ltwrapper_scriptname_result else func_emit_wrapper no > $func_ltwrapper_scriptname_result fi } ;; * ) $RM $output trap "$RM $output; exit $EXIT_FAILURE" 1 2 15 func_emit_wrapper no > $output chmod +x $output ;; esac } exit $EXIT_SUCCESS ;; esac # See if we need to build an old-fashioned archive. for oldlib in $oldlibs; do if test "$build_libtool_libs" = convenience; then oldobjs="$libobjs_save $symfileobj" addlibs="$convenience" build_libtool_libs=no else if test "$build_libtool_libs" = module; then oldobjs="$libobjs_save" build_libtool_libs=no else oldobjs="$old_deplibs $non_pic_objects" if test "$preload" = yes && test -f "$symfileobj"; then func_append oldobjs " $symfileobj" fi fi addlibs="$old_convenience" fi if test -n "$addlibs"; then gentop="$output_objdir/${outputname}x" func_append generated " $gentop" func_extract_archives $gentop $addlibs func_append oldobjs " $func_extract_archives_result" fi # Do each command in the archive commands. if test -n "$old_archive_from_new_cmds" && test "$build_libtool_libs" = yes; then cmds=$old_archive_from_new_cmds else # Add any objects from preloaded convenience libraries if test -n "$dlprefiles"; then gentop="$output_objdir/${outputname}x" func_append generated " $gentop" func_extract_archives $gentop $dlprefiles func_append oldobjs " $func_extract_archives_result" fi # POSIX demands no paths to be encoded in archives. We have # to avoid creating archives with duplicate basenames if we # might have to extract them afterwards, e.g., when creating a # static archive out of a convenience library, or when linking # the entirety of a libtool archive into another (currently # not supported by libtool). if (for obj in $oldobjs do func_basename "$obj" $ECHO "$func_basename_result" done | sort | sort -uc >/dev/null 2>&1); then : else echo "copying selected object files to avoid basename conflicts..." gentop="$output_objdir/${outputname}x" func_append generated " $gentop" func_mkdir_p "$gentop" save_oldobjs=$oldobjs oldobjs= counter=1 for obj in $save_oldobjs do func_basename "$obj" objbase="$func_basename_result" case " $oldobjs " in " ") oldobjs=$obj ;; *[\ /]"$objbase "*) while :; do # Make sure we don't pick an alternate name that also # overlaps. newobj=lt$counter-$objbase func_arith $counter + 1 counter=$func_arith_result case " $oldobjs " in *[\ /]"$newobj "*) ;; *) if test ! -f "$gentop/$newobj"; then break; fi ;; esac done func_show_eval "ln $obj $gentop/$newobj || cp $obj $gentop/$newobj" func_append oldobjs " $gentop/$newobj" ;; *) func_append oldobjs " $obj" ;; esac done fi func_to_tool_file "$oldlib" func_convert_file_msys_to_w32 tool_oldlib=$func_to_tool_file_result eval cmds=\"$old_archive_cmds\" func_len " $cmds" len=$func_len_result if test "$len" -lt "$max_cmd_len" || test "$max_cmd_len" -le -1; then cmds=$old_archive_cmds elif test -n "$archiver_list_spec"; then func_verbose "using command file archive linking..." for obj in $oldobjs do func_to_tool_file "$obj" $ECHO "$func_to_tool_file_result" done > $output_objdir/$libname.libcmd func_to_tool_file "$output_objdir/$libname.libcmd" oldobjs=" $archiver_list_spec$func_to_tool_file_result" cmds=$old_archive_cmds else # the command line is too long to link in one step, link in parts func_verbose "using piecewise archive linking..." save_RANLIB=$RANLIB RANLIB=: objlist= concat_cmds= save_oldobjs=$oldobjs oldobjs= # Is there a better way of finding the last object in the list? for obj in $save_oldobjs do last_oldobj=$obj done eval test_cmds=\"$old_archive_cmds\" func_len " $test_cmds" len0=$func_len_result len=$len0 for obj in $save_oldobjs do func_len " $obj" func_arith $len + $func_len_result len=$func_arith_result func_append objlist " $obj" if test "$len" -lt "$max_cmd_len"; then : else # the above command should be used before it gets too long oldobjs=$objlist if test "$obj" = "$last_oldobj" ; then RANLIB=$save_RANLIB fi test -z "$concat_cmds" || concat_cmds=$concat_cmds~ eval concat_cmds=\"\${concat_cmds}$old_archive_cmds\" objlist= len=$len0 fi done RANLIB=$save_RANLIB oldobjs=$objlist if test "X$oldobjs" = "X" ; then eval cmds=\"\$concat_cmds\" else eval cmds=\"\$concat_cmds~\$old_archive_cmds\" fi fi fi func_execute_cmds "$cmds" 'exit $?' done test -n "$generated" && \ func_show_eval "${RM}r$generated" # Now create the libtool archive. case $output in *.la) old_library= test "$build_old_libs" = yes && old_library="$libname.$libext" func_verbose "creating $output" # Preserve any variables that may affect compiler behavior for var in $variables_saved_for_relink; do if eval test -z \"\${$var+set}\"; then relink_command="{ test -z \"\${$var+set}\" || $lt_unset $var || { $var=; export $var; }; }; $relink_command" elif eval var_value=\$$var; test -z "$var_value"; then relink_command="$var=; export $var; $relink_command" else func_quote_for_eval "$var_value" relink_command="$var=$func_quote_for_eval_result; export $var; $relink_command" fi done # Quote the link command for shipping. relink_command="(cd `pwd`; $SHELL $progpath $preserve_args --mode=relink $libtool_args @inst_prefix_dir@)" relink_command=`$ECHO "$relink_command" | $SED "$sed_quote_subst"` if test "$hardcode_automatic" = yes ; then relink_command= fi # Only create the output if not a dry run. $opt_dry_run || { for installed in no yes; do if test "$installed" = yes; then if test -z "$install_libdir"; then break fi output="$output_objdir/$outputname"i # Replace all uninstalled libtool libraries with the installed ones newdependency_libs= for deplib in $dependency_libs; do case $deplib in *.la) func_basename "$deplib" name="$func_basename_result" func_resolve_sysroot "$deplib" eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $func_resolve_sysroot_result` test -z "$libdir" && \ func_fatal_error "\`$deplib' is not a valid libtool archive" func_append newdependency_libs " ${lt_sysroot:+=}$libdir/$name" ;; -L*) func_stripname -L '' "$deplib" func_replace_sysroot "$func_stripname_result" func_append newdependency_libs " -L$func_replace_sysroot_result" ;; -R*) func_stripname -R '' "$deplib" func_replace_sysroot "$func_stripname_result" func_append newdependency_libs " -R$func_replace_sysroot_result" ;; *) func_append newdependency_libs " $deplib" ;; esac done dependency_libs="$newdependency_libs" newdlfiles= for lib in $dlfiles; do case $lib in *.la) func_basename "$lib" name="$func_basename_result" eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $lib` test -z "$libdir" && \ func_fatal_error "\`$lib' is not a valid libtool archive" func_append newdlfiles " ${lt_sysroot:+=}$libdir/$name" ;; *) func_append newdlfiles " $lib" ;; esac done dlfiles="$newdlfiles" newdlprefiles= for lib in $dlprefiles; do case $lib in *.la) # Only pass preopened files to the pseudo-archive (for # eventual linking with the app. that links it) if we # didn't already link the preopened objects directly into # the library: func_basename "$lib" name="$func_basename_result" eval libdir=`${SED} -n -e 's/^libdir=\(.*\)$/\1/p' $lib` test -z "$libdir" && \ func_fatal_error "\`$lib' is not a valid libtool archive" func_append newdlprefiles " ${lt_sysroot:+=}$libdir/$name" ;; esac done dlprefiles="$newdlprefiles" else newdlfiles= for lib in $dlfiles; do case $lib in [\\/]* | [A-Za-z]:[\\/]*) abs="$lib" ;; *) abs=`pwd`"/$lib" ;; esac func_append newdlfiles " $abs" done dlfiles="$newdlfiles" newdlprefiles= for lib in $dlprefiles; do case $lib in [\\/]* | [A-Za-z]:[\\/]*) abs="$lib" ;; *) abs=`pwd`"/$lib" ;; esac func_append newdlprefiles " $abs" done dlprefiles="$newdlprefiles" fi $RM $output # place dlname in correct position for cygwin # In fact, it would be nice if we could use this code for all target # systems that can't hard-code library paths into their executables # and that have no shared library path variable independent of PATH, # but it turns out we can't easily determine that from inspecting # libtool variables, so we have to hard-code the OSs to which it # applies here; at the moment, that means platforms that use the PE # object format with DLL files. See the long comment at the top of # tests/bindir.at for full details. tdlname=$dlname case $host,$output,$installed,$module,$dlname in *cygwin*,*lai,yes,no,*.dll | *mingw*,*lai,yes,no,*.dll | *cegcc*,*lai,yes,no,*.dll) # If a -bindir argument was supplied, place the dll there. if test "x$bindir" != x ; then func_relative_path "$install_libdir" "$bindir" tdlname=$func_relative_path_result$dlname else # Otherwise fall back on heuristic. tdlname=../bin/$dlname fi ;; esac $ECHO > $output "\ # $outputname - a libtool library file # Generated by $PROGRAM (GNU $PACKAGE$TIMESTAMP) $VERSION # # Please DO NOT delete this file! # It is necessary for linking the library. # The name that we can dlopen(3). dlname='$tdlname' # Names of this library. library_names='$library_names' # The name of the static archive. old_library='$old_library' # Linker flags that can not go in dependency_libs. inherited_linker_flags='$new_inherited_linker_flags' # Libraries that this one depends upon. dependency_libs='$dependency_libs' # Names of additional weak libraries provided by this library weak_library_names='$weak_libs' # Version information for $libname. current=$current age=$age revision=$revision # Is this an already installed library? installed=$installed # Should we warn about portability when linking against -modules? shouldnotlink=$module # Files to dlopen/dlpreopen dlopen='$dlfiles' dlpreopen='$dlprefiles' # Directory that this library needs to be installed in: libdir='$install_libdir'" if test "$installed" = no && test "$need_relink" = yes; then $ECHO >> $output "\ relink_command=\"$relink_command\"" fi done } # Do a symbolic link so that the libtool archive can be found in # LD_LIBRARY_PATH before the program is installed. func_show_eval '( cd "$output_objdir" && $RM "$outputname" && $LN_S "../$outputname" "$outputname" )' 'exit $?' ;; esac exit $EXIT_SUCCESS } { test "$opt_mode" = link || test "$opt_mode" = relink; } && func_mode_link ${1+"$@"} # func_mode_uninstall arg... func_mode_uninstall () { $opt_debug RM="$nonopt" files= rmforce= exit_status=0 # This variable tells wrapper scripts just to set variables rather # than running their programs. libtool_install_magic="$magic" for arg do case $arg in -f) func_append RM " $arg"; rmforce=yes ;; -*) func_append RM " $arg" ;; *) func_append files " $arg" ;; esac done test -z "$RM" && \ func_fatal_help "you must specify an RM program" rmdirs= for file in $files; do func_dirname "$file" "" "." dir="$func_dirname_result" if test "X$dir" = X.; then odir="$objdir" else odir="$dir/$objdir" fi func_basename "$file" name="$func_basename_result" test "$opt_mode" = uninstall && odir="$dir" # Remember odir for removal later, being careful to avoid duplicates if test "$opt_mode" = clean; then case " $rmdirs " in *" $odir "*) ;; *) func_append rmdirs " $odir" ;; esac fi # Don't error if the file doesn't exist and rm -f was used. if { test -L "$file"; } >/dev/null 2>&1 || { test -h "$file"; } >/dev/null 2>&1 || test -f "$file"; then : elif test -d "$file"; then exit_status=1 continue elif test "$rmforce" = yes; then continue fi rmfiles="$file" case $name in *.la) # Possibly a libtool archive, so verify it. if func_lalib_p "$file"; then func_source $dir/$name # Delete the libtool libraries and symlinks. for n in $library_names; do func_append rmfiles " $odir/$n" done test -n "$old_library" && func_append rmfiles " $odir/$old_library" case "$opt_mode" in clean) case " $library_names " in *" $dlname "*) ;; *) test -n "$dlname" && func_append rmfiles " $odir/$dlname" ;; esac test -n "$libdir" && func_append rmfiles " $odir/$name $odir/${name}i" ;; uninstall) if test -n "$library_names"; then # Do each command in the postuninstall commands. func_execute_cmds "$postuninstall_cmds" 'test "$rmforce" = yes || exit_status=1' fi if test -n "$old_library"; then # Do each command in the old_postuninstall commands. func_execute_cmds "$old_postuninstall_cmds" 'test "$rmforce" = yes || exit_status=1' fi # FIXME: should reinstall the best remaining shared library. ;; esac fi ;; *.lo) # Possibly a libtool object, so verify it. if func_lalib_p "$file"; then # Read the .lo file func_source $dir/$name # Add PIC object to the list of files to remove. if test -n "$pic_object" && test "$pic_object" != none; then func_append rmfiles " $dir/$pic_object" fi # Add non-PIC object to the list of files to remove. if test -n "$non_pic_object" && test "$non_pic_object" != none; then func_append rmfiles " $dir/$non_pic_object" fi fi ;; *) if test "$opt_mode" = clean ; then noexename=$name case $file in *.exe) func_stripname '' '.exe' "$file" file=$func_stripname_result func_stripname '' '.exe' "$name" noexename=$func_stripname_result # $file with .exe has already been added to rmfiles, # add $file without .exe func_append rmfiles " $file" ;; esac # Do a test to see if this is a libtool program. if func_ltwrapper_p "$file"; then if func_ltwrapper_executable_p "$file"; then func_ltwrapper_scriptname "$file" relink_command= func_source $func_ltwrapper_scriptname_result func_append rmfiles " $func_ltwrapper_scriptname_result" else relink_command= func_source $dir/$noexename fi # note $name still contains .exe if it was in $file originally # as does the version of $file that was added into $rmfiles func_append rmfiles " $odir/$name $odir/${name}S.${objext}" if test "$fast_install" = yes && test -n "$relink_command"; then func_append rmfiles " $odir/lt-$name" fi if test "X$noexename" != "X$name" ; then func_append rmfiles " $odir/lt-${noexename}.c" fi fi fi ;; esac func_show_eval "$RM $rmfiles" 'exit_status=1' done # Try to remove the ${objdir}s in the directories where we deleted files for dir in $rmdirs; do if test -d "$dir"; then func_show_eval "rmdir $dir >/dev/null 2>&1" fi done exit $exit_status } { test "$opt_mode" = uninstall || test "$opt_mode" = clean; } && func_mode_uninstall ${1+"$@"} test -z "$opt_mode" && { help="$generic_help" func_fatal_help "you must specify a MODE" } test -z "$exec_cmd" && \ func_fatal_help "invalid operation mode \`$opt_mode'" if test -n "$exec_cmd"; then eval exec "$exec_cmd" exit $EXIT_FAILURE fi exit $exit_status # The TAGs below are defined such that we never get into a situation # in which we disable both kinds of libraries. Given conflicting # choices, we go for a static library, that is the most portable, # since we can't tell whether shared libraries were disabled because # the user asked for that or because the platform doesn't support # them. This is particularly important on AIX, because we don't # support having both static and shared libraries enabled at the same # time on that platform, so we default to a shared-only configuration. # If a disable-shared tag is given, we'll fallback to a static-only # configuration. But we'll never go from static-only to shared-only. # ### BEGIN LIBTOOL TAG CONFIG: disable-shared build_libtool_libs=no build_old_libs=yes # ### END LIBTOOL TAG CONFIG: disable-shared # ### BEGIN LIBTOOL TAG CONFIG: disable-static build_old_libs=`case $build_libtool_libs in yes) echo no;; *) echo yes;; esac` # ### END LIBTOOL TAG CONFIG: disable-static # Local Variables: # mode:shell-script # sh-indentation:2 # End: # vi:sw=2 madp-0.4/PaxHeaders.5405/problems0000644000000000000000000000007412717644140013531 xustar0030 atime=1463765202.453541638 30 ctime=1463765201.025553043 madp-0.4/problems/0000775000372100037210000000000012717644140014435 5ustar00fransfrans00000000000000madp-0.4/problems/PaxHeaders.5405/relay4.dpomdp0000644000000000000000000000007412717644140016213 xustar0030 atime=1463765180.081720318 30 ctime=1463765201.025553043 madp-0.4/problems/relay4.dpomdp0000664000372100037210000000774112717644140017053 0ustar00fransfrans00000000000000# 4-state Relay DEC-POMDP description # # # Maze layout: # 01 03 # 02 || 04 # Maze layout using state names: # l1 r1 # l2 || r2 # Total number of states is 4 # agents: 2 discount: 0.95 values: reward states: l1_r1 l1_r2 l2_r1 l2_r2 start include: l2_r2 actions: shuffle exchange sense shuffle exchange sense observations: door noDoor idle door noDoor idle T: shuffle exchange : l1_r1 : l1_r1 : 0.5 T: shuffle exchange : l1_r1 : l2_r1 : 0.5 T: shuffle exchange : l2_r1 : l2_r1 : 0.5 T: shuffle exchange : l2_r1 : l1_r1 : 0.5 T: shuffle exchange : l1_r2 : l1_r2 : 0.5 T: shuffle exchange : l1_r2 : l2_r2 : 0.5 T: shuffle exchange : l2_r2 : l2_r2 : 0.5 T: shuffle exchange : l2_r2 : l1_r2 : 0.5 T: shuffle sense : l1_r1 : l1_r1 : 0.5 T: shuffle sense : l1_r1 : l2_r1 : 0.5 T: shuffle sense : l2_r1 : l2_r1 : 0.5 T: shuffle sense : l2_r1 : l1_r1 : 0.5 T: shuffle sense : l1_r2 : l1_r2 : 0.5 T: shuffle sense : l1_r2 : l2_r2 : 0.5 T: shuffle sense : l2_r2 : l2_r2 : 0.5 T: shuffle sense : l2_r2 : l1_r2 : 0.5 T: exchange shuffle : l1_r1 : l1_r1 : 0.5 T: exchange shuffle : l1_r1 : l1_r2 : 0.5 T: exchange shuffle : l2_r1 : l2_r1 : 0.5 T: exchange shuffle : l2_r1 : l2_r2 : 0.5 T: exchange shuffle : l1_r2 : l1_r2 : 0.5 T: exchange shuffle : l1_r2 : l1_r1 : 0.5 T: exchange shuffle : l2_r2 : l2_r2 : 0.5 T: exchange shuffle : l2_r2 : l2_r1 : 0.5 T: sense shuffle : l1_r1 : l1_r1 : 0.5 T: sense shuffle : l1_r1 : l1_r2 : 0.5 T: sense shuffle : l2_r1 : l2_r1 : 0.5 T: sense shuffle : l2_r1 : l2_r2 : 0.5 T: sense shuffle : l1_r2 : l1_r2 : 0.5 T: sense shuffle : l1_r2 : l1_r1 : 0.5 T: sense shuffle : l2_r2 : l2_r2 : 0.5 T: sense shuffle : l2_r2 : l2_r1 : 0.5 T: shuffle shuffle : * : * : 0.25 T: exchange exchange : l1_r1 : l1_r1 : 0.25 T: exchange exchange : l1_r1 : l1_r2 : 0.25 T: exchange exchange : l1_r1 : l2_r1 : 0.25 T: exchange exchange : l1_r1 : l2_r2 : 0.25 T: exchange exchange : l1_r2 : l1_r2 : 1.0 T: exchange exchange : l2_r1 : l2_r1 : 1.0 T: exchange exchange : l2_r2 : l2_r2 : 1.0 T: exchange sense : l1_r1 : l1_r1 : 1.0 T: exchange sense : l1_r2 : l1_r2 : 1.0 T: exchange sense : l2_r1 : l2_r1 : 1.0 T: exchange sense : l2_r2 : l2_r2 : 1.0 T: sense exchange : l1_r1 : l1_r1 : 1.0 T: sense exchange : l1_r2 : l1_r2 : 1.0 T: sense exchange : l2_r1 : l2_r1 : 1.0 T: sense exchange : l2_r2 : l2_r2 : 1.0 T: sense sense : l1_r1 : l1_r1 : 1.0 T: sense sense : l1_r2 : l1_r2 : 1.0 T: sense sense : l2_r1 : l2_r1 : 1.0 T: sense sense : l2_r2 : l2_r2 : 1.0 O: * : * : idle idle : 1.0000000000000000 O: sense * : * : * : 0 O: * sense : * : * : 0 O: sense * : l1_r1 : door idle : 0.9 O: sense * : l1_r1 : noDoor idle : 0.1 O: sense * : l1_r2 : door idle : 0.9 O: sense * : l1_r2 : noDoor idle : 0.1 O: sense * : l2_r1 : noDoor idle : 0.9 O: sense * : l2_r1 : door idle : 0.1 O: sense * : l2_r2 : noDoor idle : 0.9 O: sense * : l2_r2 : door idle : 0.1 O: * sense : l1_r1 : idle door : 0.9 O: * sense : l1_r1 : idle noDoor : 0.1 O: * sense : l2_r1 : idle door : 0.9 O: * sense : l2_r1 : idle noDoor : 0.1 O: * sense : l1_r2 : idle noDoor : 0.9 O: * sense : l1_r2 : idle door : 0.1 O: * sense : l2_r2 : idle noDoor : 0.9 O: * sense : l2_r2 : idle door : 0.1 O: sense sense : * : * : 0 O: sense sense : l1_r1 : door door : 0.81 O: sense sense : l1_r1 : door noDoor : 0.09 O: sense sense : l1_r1 : noDoor door : 0.09 O: sense sense : l1_r1 : noDoor noDoor : 0.01 O: sense sense : l1_r2 : door noDoor : 0.81 O: sense sense : l1_r2 : door door : 0.09 O: sense sense : l1_r2 : noDoor noDoor : 0.09 O: sense sense : l1_r2 : noDoor door : 0.01 O: sense sense : l2_r1 : noDoor door : 0.81 O: sense sense : l2_r1 : door door : 0.09 O: sense sense : l2_r1 : noDoor noDoor : 0.09 O: sense sense : l2_r1 : door noDoor : 0.01 O: sense sense : l2_r2 : door door : 0.01 O: sense sense : l2_r2 : door noDoor : 0.09 O: sense sense : l2_r2 : noDoor door : 0.09 O: sense sense : l2_r2 : noDoor noDoor : 0.81 R: * : * : * : * : -1.0000000000000000 R: exchange * : * : * : * : -50 R: * exchange : * : * : * : -50 R: exchange exchange : l1_r1 : * : * : 50 # # relay4.dpomdp # EOF madp-0.4/problems/PaxHeaders.5405/MAISS_Patrol_Single.pgmx0000644000000000000000000000007412717644140020201 xustar0030 atime=1463765180.073720381 30 ctime=1463765201.025553043 madp-0.4/problems/MAISS_Patrol_Single.pgmx0000664000372100037210000016755012717644140021046 0ustar00fransfrans00000000000000 >]]> 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.5 0.0 0.5 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.5 0.5 0.5 0.5 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.5 0.5 0.0 0.0 0.0 0.0 0.0 0.5 0.5 0.0 0.0 0.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.5 0.0 0.5 0.0 0.0 0.0 0.0 0.0 0.0 0.5 0.5 0.0 0.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 0.0 0.0 0.5 0.5 0.0 0.0 0.0 0.0 0.0 0.0 0.5 0.5 0.0 0.0 0.0 0.0 0.0 0.5 0.5 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.9 0.016667 0.016667 0.016667 0.016667 0.016667 0.016667 0.0 0.9 0.016667 0.016667 0.016667 0.016667 0.016667 0.016667 0.0 0.9 0.016667 0.016667 0.016667 0.016667 0.016667 0.016667 0.0 0.9 0.016667 0.016667 0.016667 0.016667 0.016667 0.016667 0.0 0.9 0.016667 0.016667 0.016667 0.016667 0.016667 0.016667 0.0 0.9 0.016667 0.016667 0.016667 0.016667 0.016667 0.016667 0.0 0.9 0.0 0.02 0.02 0.02 0.02 0.02 0.0 0.9 0.0 0.02 0.02 0.02 0.02 0.02 0.0 0.9 0.0 0.02 0.02 0.02 0.02 0.02 0.0 0.9 0.0 0.02 0.02 0.02 0.02 0.02 0.0 0.9 0.0 0.02 0.02 0.02 0.02 0.02 0.0 0.9 0.0 0.02 0.02 0.02 0.02 0.02 0.0 0.9 0.02 0.0 0.02 0.02 0.02 0.02 0.0 0.9 0.02 0.0 0.02 0.02 0.02 0.02 0.0 0.9 0.02 0.0 0.02 0.02 0.02 0.02 0.0 0.9 0.02 0.0 0.02 0.02 0.02 0.02 0.0 0.9 0.02 0.0 0.02 0.02 0.02 0.02 0.0 0.9 0.02 0.0 0.02 0.02 0.02 0.02 0.0 0.9 0.02 0.02 0.0 0.02 0.02 0.02 0.0 0.9 0.02 0.02 0.0 0.02 0.02 0.02 0.0 0.9 0.02 0.02 0.0 0.02 0.02 0.02 0.0 0.9 0.02 0.02 0.0 0.02 0.02 0.02 0.0 0.9 0.02 0.02 0.0 0.02 0.02 0.02 0.0 0.9 0.02 0.02 0.0 0.02 0.02 0.02 0.0 0.9 0.02 0.02 0.02 0.0 0.02 0.02 0.0 0.9 0.02 0.02 0.02 0.0 0.02 0.02 0.0 0.9 0.02 0.02 0.02 0.0 0.02 0.02 0.0 0.9 0.02 0.02 0.02 0.0 0.02 0.02 0.0 0.9 0.02 0.02 0.02 0.0 0.02 0.02 0.0 0.9 0.02 0.02 0.02 0.0 0.02 0.02 0.0 0.9 0.02 0.02 0.02 0.02 0.0 0.02 0.0 0.9 0.02 0.02 0.02 0.02 0.0 0.02 0.0 0.9 0.02 0.02 0.02 0.02 0.0 0.02 0.0 0.9 0.02 0.02 0.02 0.02 0.0 0.02 0.0 0.9 0.02 0.02 0.02 0.02 0.0 0.02 0.0 0.9 0.02 0.02 0.02 0.02 0.0 0.02 0.0 0.9 0.02 0.02 0.02 0.02 0.02 0.0 0.0 0.9 0.02 0.02 0.02 0.02 0.02 0.0 0.0 0.9 0.02 0.02 0.02 0.02 0.02 0.0 0.0 0.9 0.02 0.02 0.02 0.02 0.02 0.0 0.0 0.9 0.02 0.02 0.02 0.02 0.02 0.0 0.0 0.9 0.02 0.02 0.02 0.02 0.02 0.0 0.0 0.9 0.016667 0.016667 0.016667 0.016667 0.016667 0.016667 0.0 0.9 0.016667 0.016667 0.016667 0.016667 0.016667 0.016667 0.0 0.9 0.016667 0.016667 0.016667 0.016667 0.016667 0.016667 0.0 0.9 0.016667 0.016667 0.016667 0.016667 0.016667 0.016667 0.0 0.9 0.016667 0.016667 0.016667 0.016667 0.016667 0.016667 0.0 0.9 0.016667 0.016667 0.016667 0.016667 0.016667 0.016667 0.0 0.9 0.0 0.02 0.02 0.02 0.02 0.02 0.0 0.9 0.0 0.02 0.02 0.02 0.02 0.02 0.0 0.9 0.0 0.02 0.02 0.02 0.02 0.02 0.0 0.9 0.0 0.02 0.02 0.02 0.02 0.02 0.0 0.9 0.0 0.02 0.02 0.02 0.02 0.02 0.0 0.9 0.0 0.02 0.02 0.02 0.02 0.02 0.0 0.9 0.02 0.0 0.02 0.02 0.02 0.02 0.0 0.9 0.02 0.0 0.02 0.02 0.02 0.02 0.0 0.9 0.02 0.0 0.02 0.02 0.02 0.02 0.0 0.9 0.02 0.0 0.02 0.02 0.02 0.02 0.0 0.9 0.02 0.0 0.02 0.02 0.02 0.02 0.0 0.9 0.02 0.0 0.02 0.02 0.02 0.02 0.0 0.9 0.02 0.02 0.0 0.02 0.02 0.02 0.0 0.9 0.02 0.02 0.0 0.02 0.02 0.02 0.0 0.9 0.02 0.02 0.0 0.02 0.02 0.02 0.0 0.9 0.02 0.02 0.0 0.02 0.02 0.02 0.0 0.9 0.02 0.02 0.0 0.02 0.02 0.02 0.0 0.9 0.02 0.02 0.0 0.02 0.02 0.02 0.0 0.9 0.02 0.02 0.02 0.0 0.02 0.02 0.0 0.9 0.02 0.02 0.02 0.0 0.02 0.02 0.0 0.9 0.02 0.02 0.02 0.0 0.02 0.02 0.0 0.9 0.02 0.02 0.02 0.0 0.02 0.02 0.0 0.9 0.02 0.02 0.02 0.0 0.02 0.02 0.0 0.9 0.02 0.02 0.02 0.0 0.02 0.02 0.0 0.9 0.02 0.02 0.02 0.02 0.0 0.02 0.0 0.9 0.02 0.02 0.02 0.02 0.0 0.02 0.0 0.9 0.02 0.02 0.02 0.02 0.0 0.02 0.0 0.9 0.02 0.02 0.02 0.02 0.0 0.02 0.0 0.9 0.02 0.02 0.02 0.02 0.0 0.02 0.0 0.9 0.02 0.02 0.02 0.02 0.0 0.02 0.0 0.9 0.02 0.02 0.02 0.02 0.02 0.0 0.0 0.9 0.02 0.02 0.02 0.02 0.02 0.0 0.0 0.9 0.02 0.02 0.02 0.02 0.02 0.0 0.0 0.9 0.02 0.02 0.02 0.02 0.02 0.0 0.0 0.9 0.02 0.02 0.02 0.02 0.02 0.0 0.0 0.9 0.02 0.02 0.02 0.02 0.02 0.0 0.0 -0.5 -5.0 10.0 -5.0 10.0 -5.0 10.0 -5.0 10.0 -5.0 10.0 -5.0 10.0 -5.0 10.0 madp-0.4/problems/PaxHeaders.5405/example.dpomdp0000644000000000000000000000007312717644140016445 xustar0029 atime=1463765180.07772035 30 ctime=1463765201.025553043 madp-0.4/problems/example.dpomdp0000664000372100037210000002007212717644140017276 0ustar00fransfrans00000000000000# example.dpomdp # ----------- # Frans Oliehoek - faolieho@science.uva.nl # 2006-08-03 # # # This is a Dec-POMDP (.dpomdp) test file, which demonstrates most syntactic # constructs. # Non-demonstrated constructs are mentioned in the comments, therefore this # document also serves as documentation for the .dpomdp file format. # # First we note a few important things: # # 1) the file format is case-sensitive # 2) the first entries in this file are: # agents # discount # values # states # start # actions # observations # These entries should *all* be present exactly *once* and in above *order*. # 3) Other inconsistencies with cassandra's format are mentioned throughout # this file. # 4) The file is 'newline sensitive': new lines should start at the correct # places! # (i.e. no empty lines allowed! if you want space to this: # # ) # 5) Comments should start on a new-line. # 6) Identifiers consist of a letter followed by alphanumerics and '-' and '_' # 7) as a general rule of thumb: 1 number (int or real) is placed on the same # line, multiple numbers (a vector) or matrices, start on a new line. # The keywords "uniform" and "identity" represent vectors/matrices and thus # also are placed on a new line. # 8) Unlike cassandra's format, at the end of transitions, observations and # reward specifications, right before the number we also require a colon. # I.e.: # R: open-right open-right : tiger-left : * : * : 20 # This is because in # R: open-right open-right : tiger-left : * : * 20 # the 20 could also indicate the 20th individual observation of agent 2. # # Allright, here we go! # #The agents. #---------- #Either 1) the number of agents: # agents: %d #or 2) a list of agent identifiers, e.g.: # agents: agent1_name name-of-agent2 ... //TODO:this is not implem. yet! #agents: agent1 the_second-agent agents: 2 # #the discount factor. #------------------- #As this is dependent on the planning horizon (typically #1.0 for finite horizon problems) this is more a property of the planning #problem than one of the dec-pomdps. Nevertheless we include it to be as much #compatiable with cassandra and umass as possible. # discount: %f discount: 1.0 # #values #------ #reward or cost reward type... # values: [ reward, cost ] values: reward # #the states declaration #----------------------- #the number of states or a state list # states: [ %d, ] states: state-one s2 # #The initial state distribution #------------------------------ #NOTE: unlike cassandra, this is not optional and the position is BEFORE the #specification of the actions and observations. #There are 4 ways to specify the starting distribution: # * enumerate the probabilities for each state, # * specify a single starting state, # * give a uniform distribution over states, or # * give a uniform distribution over a subset of states. # #In the last case, you can either specify a list of states too be included, #or a list of states to be excluded. #Examples of this are: # start: # 0.3 0.1 0.0 0.2 0.5 #or # start: # uniform #or # start: first-state #or # start: 5 #or # start include: first-state third state #or # start include: 1 3 indices-mixed-with-names s2 4 #or # start exclude: fifth-state seventh-state start exclude: s2 #start: #0.3 0.1 # #The actions declarations #------------------------ #the (number/list of) actions for each of the agents on a separate line # actions: # [ %d, ] # [ %d, ] # ... # [ %d, ] # # e.g. 3 named actions for agent 1 - 2 unnamed actions for agent 2: actions: agent1-a1 a12 a13 2 #the (number/list of) observations for each of the agents on a separate line # observations: # [ %d, ] # [ %d, ] # ... # [ %d, ] observations: 2 hear-left hear-right #Joint actions #------------- #Although not explicitly specified, joint actions are an important part of the #model. Their syntax is explained here. There are (will be) 3 ways to denote a #joint action: # # 1) by index # In accordence with C++ conventions, indices start at 0. # Because, earlier in this file, only individual actions are specified, we use # a convention as to how the joint actions (and joint observations) are # enumerated: # jaI first agent <- individual indices -> last agent # 0 0 0 ..... 0 0 # 1 0 0 ..... 0 1 #|O_n|-1 0 0 ..... 0 |O_n|-1 # # (note that this ordering is enforced by the way joint observation objects # are created in the implementation. In particular see # MADPComponentDiscreteObservations::ConstructJointObservations ) # # 2) by individual action components # # For now a joint action is specified by its individual action components, these # can be indices (again, starting at 0), names or combinations thereof. E.g. # following the action specification above, a valid joint action would be # "a12 1" # It is also allowed to use the '*' wildcard. E.g., "a12 *" would denote all # joint actions in which the first agent performes action a12. # # 3) the wild-card #It is also possible to use joint action "*" denoting all joint actions. # # #Joint Observations #------------------ #Joint observations use the same syntax as joint actions. # #Transition probabilities #------------------------ #This explains the syntax of specifying transition probabilities. In the below # denotes a joint action, which can be specified using the syntax as #explained above. # # NOTE: in contrast to Tony's pomdp file format, we also require a colon after # the end-state. # # T: : : : %f #or # T: : : # %f %f ... %f P(s_1'|ja,s) ... P(s_k'|ja,s) #or # T: : this is a |S| x |S| matrix # %f %f ... %f P(s_1'|ja,s_1) ... P(s_k'|ja,s_1) # %f %f ... %f ... # ... ... # %f %f ... %f P(s_1'|ja,s_k) ... P(s_k'|ja,s_k) #or # T: # [ identity, uniform ] # #T: * : #uniform T: * : uniform T: a12 1 : s2 : 0.4 0.6 #T: 1 2 : #identity T: 1 2 : 0.2 0.8 0.6 0.5 T: * * : * : * : 0.5 T: 1 1 : 0 : 1 : 0.33333 T: 1 1 : 0 : 0 : 0.66666 T: 1 : 0 : 0.123 0.876 T: 0 0 : 0 : 0.11111 0.88888 T: 2 : identity T: 3 : 0.2222 0.2233 0.2244 0.2255 #Observation probabilities # O: : : : %f #or # O: : : # %f %f ... %f P(jo_1|ja,s') ... P(jo_x|ja,s') #or # O: : - a |S|x|JO| matrix # %f %f ... %f P(jo_1|ja,s_1') ... P(jo_x|ja,s_1') # %f %f ... %f ... # ... ... # %f %f ... %f P(jo_1|ja,s_k') ... P(jo_x|ja,s_k') #this uses the fact that earlier specified entries can be overwritten - this IS explicitly mentioned by cassandra (but not by umass) and is very convenient... #TODO: the current format does not allow for independent transitions/observations - this might also be convenient... O: * * : uniform O: a12 1 : state-one : * * : 0.002 O: a12 1 : state-one : 0 hear-left : 0.7225 O: 0 0 : * : * : 0.9 O: 0 1 : s2 : 0 hear-right : 0.1275 O: 0 1 : 0 : 1 hear-left : 0.1275 O: 1 0 : 1 : * hear-right : 0.0225 O: 1 1 : 1 : 1 * : 0.7225 O: 2 0 : 0 : 0 hear-right : 0.1275 O: 2 1 : 0 : 0 0 : 0.1275 O: 2 1 : 1 : * : 0.0225 O: * 1 : uniform O: a12 1 : s2 : 0.1 0.1 0.1 0.6 O: 1 2 : 0.1 0.8 0.05 0.05 0.6 0.3 0.06 0.04 #The rewards # R: : : : : %f #or # R: : : : # %f %f ... %f #or # R: : : # %f %f ... %f # %f %f ... %f # ... # %f %f ... %f # #here the matrix has nrStates rows and nrJointObservations columns. # #Typical problems only use R(s,ja) which is specified by: # R: : : * : * : %f R: * : 1 : 3 : 4.3 34.2 253 12 R: * : s2 : 4.3 34.2 253 12 5.3 2352 2.3 1.2 R: a12 0 : * : * : * : -2 R: 0 0 : 0 : * : * : -50 R: 0 1: 1 : * : * : +20 R: 0 2: 1 : * : * : 20 R: 1 0: 0 : * : * : -100 R: 1 1: 1 : * : * : -10 R: 1 2: 0 : * : * : -101 R: 2 0: 1 : * : * : -101 R: 2 1 : 1 : * : * : 9 madp-0.4/problems/PaxHeaders.5405/DTPGMX.pgmx0000644000000000000000000000007412717644140015506 xustar0030 atime=1463765180.073720381 30 ctime=1463765201.025553043 madp-0.4/problems/DTPGMX.pgmx0000664000372100037210000004661312717644140016347 0ustar00fransfrans00000000000000 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.0 1.0 1.0 0.0 0.85 0.15 0.15 0.85 0.85 0.15 0.5 0.5 0.5 0.5 0.5 0.5 0.5 0.5 0.5 0.5 0.5 0.5 0.5 0.5 0.5 0.5 0.15 0.85 0.5 0.5 0.5 0.5 0.5 0.5 0.5 0.5 0.5 0.5 0.5 0.5 0.5 0.5 0.5 0.5 -2.0 -101.0 9.0 -101.0 -50.0 -100.0 9.0 -100.0 20.0 -2.0 9.0 -101.0 9.0 20.0 -100.0 -101.0 -100.0 -50.0 madp-0.4/problems/PaxHeaders.5405/MAISS_TopLevel.pgmx0000644000000000000000000000007412717644140017171 xustar0030 atime=1463765180.073720381 30 ctime=1463765201.025553043 madp-0.4/problems/MAISS_TopLevel.pgmx0000664000372100037210000115702512717644140020033 0ustar00fransfrans00000000000000 >]]> 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 2.2222E-4 0.90089 0.0 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 4.4444E-4 0.80178 0.0 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 2.2222E-4 0.90089 0.0 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 4.4444E-4 0.80178 0.0 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 2.2222E-4 0.90089 0.0 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 4.4444E-4 0.80178 0.0 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.86317 0.033333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.72633 0.066667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.86317 0.033333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.72633 0.066667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.86317 0.033333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.72633 0.066667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.90089 0.0 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.80178 0.0 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.90089 0.0 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.80178 0.0 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.90089 0.0 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.80178 0.0 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.86317 0.033333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.72633 0.066667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.86317 0.033333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.72633 0.066667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.86317 0.033333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.72633 0.066667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 2.2222E-4 0.0 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 4.4444E-4 0.0 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 2.2222E-4 0.0 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 4.4444E-4 0.0 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 2.2222E-4 0.0 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 4.4444E-4 0.0 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 2.2222E-4 0.15089 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 4.4444E-4 0.30178 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 2.2222E-4 0.15089 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 4.4444E-4 0.30178 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 2.2222E-4 0.15089 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 4.4444E-4 0.30178 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 0.0 0.0 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 0.0 0.0 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 0.0 0.0 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 0.0 0.0 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 0.0 0.0 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 0.0 0.0 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 0.0 0.15089 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 0.0 0.30178 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 0.0 0.15089 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 0.0 0.30178 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 0.0 0.15089 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 0.0 0.30178 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.16975 0.05 0.0 0.0 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.05 0.3395 0.1 0.0 0.0 0.0 0.5005 0.0 0.0 0.005 0.005 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.16975 0.05 0.0 0.0 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.05 0.3395 0.1 0.0 0.0 0.0 0.5005 0.0 0.0 0.005 0.005 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.16975 0.05 0.0 0.0 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.05 0.3395 0.1 0.0 0.0 0.0 0.5005 0.0 0.0 0.005 0.005 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.0 0.05 0.0 0.16975 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.05 0.0 0.1 0.0 0.3395 0.0 0.5005 0.0 0.0 0.005 0.005 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.0 0.05 0.0 0.16975 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.05 0.0 0.1 0.0 0.3395 0.0 0.5005 0.0 0.0 0.005 0.005 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.0 0.05 0.0 0.16975 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.05 0.0 0.1 0.0 0.3395 0.0 0.5005 0.0 0.0 0.005 0.005 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 0.0 0.0 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 0.0 0.0 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 0.0 0.0 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 0.0 0.0 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 0.0 0.0 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 0.0 0.0 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 0.0 0.15089 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 0.0 0.30178 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 0.0 0.15089 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 0.0 0.30178 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 0.0 0.15089 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 0.0 0.30178 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.025 0.0 0.05 2.5E-4 0.91975 0.0 0.0 0.0 0.0 0.0025 0.0025 0.025 0.0 0.05 2.5E-4 0.91975 0.0 0.0 0.0 0.0 0.0025 0.0025 0.025 0.0 0.05 2.5E-4 0.91975 0.0 0.0 0.0 0.0 0.0025 0.0025 0.05 0.0 0.1 5.0E-4 0.8395 0.0 0.0 0.0 0.0 0.005 0.005 0.05 0.0 0.1 5.0E-4 0.8395 0.0 0.0 0.0 0.0 0.005 0.005 0.05 0.0 0.1 5.0E-4 0.8395 0.0 0.0 0.0 0.0 0.005 0.005 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 2.2222E-4 0.90089 0.044444 0.0 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 2.2222E-4 0.90089 0.044444 0.0 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 2.2222E-4 0.90089 0.044444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 4.4444E-4 0.80178 0.088889 0.0 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 4.4444E-4 0.80178 0.088889 0.0 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 4.4444E-4 0.80178 0.088889 0.0 0.0 0.0 0.0044444 0.0044444 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.0 0.05 0.0 0.91975 0.0 2.5E-4 0.0 0.0 0.0025 0.0025 0.025 0.0 0.05 0.0 0.91975 0.0 2.5E-4 0.0 0.0 0.0025 0.0025 0.025 0.0 0.05 0.0 0.91975 0.0 2.5E-4 0.0 0.0 0.0025 0.0025 0.05 0.0 0.1 0.0 0.8395 0.0 5.0E-4 0.0 0.0 0.005 0.005 0.05 0.0 0.1 0.0 0.8395 0.0 5.0E-4 0.0 0.0 0.005 0.005 0.05 0.0 0.1 0.0 0.8395 0.0 5.0E-4 0.0 0.0 0.005 0.005 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 0.0 0.90089 0.044444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 0.0 0.90089 0.044444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 0.0 0.90089 0.044444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 0.0 0.80178 0.088889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 0.0 0.80178 0.088889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 0.0 0.80178 0.088889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.025 0.0 0.05 2.5E-4 0.91975 0.0 0.0 0.0 0.0 0.0025 0.0025 0.025 0.0 0.05 2.5E-4 0.91975 0.0 0.0 0.0 0.0 0.0025 0.0025 0.025 0.0 0.05 2.5E-4 0.91975 0.0 0.0 0.0 0.0 0.0025 0.0025 0.05 0.0 0.1 5.0E-4 0.8395 0.0 0.0 0.0 0.0 0.005 0.005 0.05 0.0 0.1 5.0E-4 0.8395 0.0 0.0 0.0 0.0 0.005 0.005 0.05 0.0 0.1 5.0E-4 0.8395 0.0 0.0 0.0 0.0 0.005 0.005 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 2.2222E-4 0.90089 0.0 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 4.4444E-4 0.80178 0.0 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 2.2222E-4 0.90089 0.0 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 4.4444E-4 0.80178 0.0 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 2.2222E-4 0.90089 0.0 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 4.4444E-4 0.80178 0.0 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.5 0.5 0.0 0.0 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 2.2222E-4 0.90089 0.044444 0.0 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 2.2222E-4 0.90089 0.044444 0.0 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 2.2222E-4 0.90089 0.044444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 4.4444E-4 0.80178 0.088889 0.0 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 4.4444E-4 0.80178 0.088889 0.0 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 4.4444E-4 0.80178 0.088889 0.0 0.0 0.0 0.0044444 0.0044444 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.86317 0.033333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.72633 0.066667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.86317 0.033333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.72633 0.066667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.86317 0.033333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.72633 0.066667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.5 0.5 0.0 0.0 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.0 0.05 0.0 0.91975 0.0 2.5E-4 0.0 0.0 0.0025 0.0025 0.025 0.0 0.05 0.0 0.91975 0.0 2.5E-4 0.0 0.0 0.0025 0.0025 0.025 0.0 0.05 0.0 0.91975 0.0 2.5E-4 0.0 0.0 0.0025 0.0025 0.05 0.0 0.1 0.0 0.8395 0.0 5.0E-4 0.0 0.0 0.005 0.005 0.05 0.0 0.1 0.0 0.8395 0.0 5.0E-4 0.0 0.0 0.005 0.005 0.05 0.0 0.1 0.0 0.8395 0.0 5.0E-4 0.0 0.0 0.005 0.005 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.90089 0.0 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.80178 0.0 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.90089 0.0 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.80178 0.0 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.90089 0.0 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.80178 0.0 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.5 0.5 0.0 0.0 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 0.0 0.90089 0.044444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 0.0 0.90089 0.044444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 0.0 0.90089 0.044444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 0.0 0.80178 0.088889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 0.0 0.80178 0.088889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 0.0 0.80178 0.088889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.86317 0.033333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.72633 0.066667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.86317 0.033333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.72633 0.066667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.86317 0.033333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.72633 0.066667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.5 0.5 0.0 0.0 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.025 0.0 0.05 2.5E-4 0.91975 0.0 0.0 0.0 0.0 0.0025 0.0025 0.025 0.0 0.05 2.5E-4 0.91975 0.0 0.0 0.0 0.0 0.0025 0.0025 0.025 0.0 0.05 2.5E-4 0.91975 0.0 0.0 0.0 0.0 0.0025 0.0025 0.05 0.0 0.1 5.0E-4 0.8395 0.0 0.0 0.0 0.0 0.005 0.005 0.05 0.0 0.1 5.0E-4 0.8395 0.0 0.0 0.0 0.0 0.005 0.005 0.05 0.0 0.1 5.0E-4 0.8395 0.0 0.0 0.0 0.0 0.005 0.005 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 2.2222E-4 0.0 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 4.4444E-4 0.0 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 2.2222E-4 0.0 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 4.4444E-4 0.0 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 2.2222E-4 0.0 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 4.4444E-4 0.0 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 2.2222E-4 0.15089 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 4.4444E-4 0.30178 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.05 0.0 0.0 2.2222E-4 0.90089 0.044444 0.0 0.0 0.0 0.0022222 0.0022222 0.0125 0.0 0.0 5.5556E-5 0.49317 0.49317 0.0 0.0 0.0 5.5556E-4 5.5556E-4 0.025 0.0 0.0 1.1111E-4 0.48633 0.48633 0.0 0.0 0.0 0.0011111 0.0011111 0.1 0.0 0.0 4.4444E-4 0.80178 0.088889 0.0 0.0 0.0 0.0044444 0.0044444 0.025 0.0 0.0 1.1111E-4 0.48633 0.48633 0.0 0.0 0.0 0.0011111 0.0011111 0.05 0.0 0.0 2.2222E-4 0.47267 0.47267 0.0 0.0 0.0 0.0022222 0.0022222 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.0 0.05 0.0 0.91975 0.0 2.5E-4 0.0 0.0 0.0025 0.0025 0.025 0.0 0.05 0.0 0.91975 0.0 2.5E-4 0.0 0.0 0.0025 0.0025 0.025 0.0 0.05 0.0 0.91975 0.0 2.5E-4 0.0 0.0 0.0025 0.0025 0.05 0.0 0.1 0.0 0.8395 0.0 5.0E-4 0.0 0.0 0.005 0.005 0.05 0.0 0.1 0.0 0.8395 0.0 5.0E-4 0.0 0.0 0.005 0.005 0.05 0.0 0.1 0.0 0.8395 0.0 5.0E-4 0.0 0.0 0.005 0.005 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 0.0 0.0 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 0.0 0.0 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 0.0 0.0 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 0.0 0.0 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 0.0 0.0 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 0.0 0.0 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 0.0 0.15089 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 0.0 0.30178 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.05 0.0 0.0 0.0 0.90089 0.044444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.0125 0.0 0.0 0.0 0.49317 0.49317 5.5556E-5 0.0 0.0 5.5556E-4 5.5556E-4 0.025 0.0 0.0 0.0 0.48633 0.48633 1.1111E-4 0.0 0.0 0.0011111 0.0011111 0.1 0.0 0.0 0.0 0.80178 0.088889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.025 0.0 0.0 0.0 0.48633 0.48633 1.1111E-4 0.0 0.0 0.0011111 0.0011111 0.05 0.0 0.0 0.0 0.47267 0.47267 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.025 0.0 0.05 2.5E-4 0.91975 0.0 0.0 0.0 0.0 0.0025 0.0025 0.025 0.0 0.05 2.5E-4 0.91975 0.0 0.0 0.0 0.0 0.0025 0.0025 0.025 0.0 0.05 2.5E-4 0.91975 0.0 0.0 0.0 0.0 0.0025 0.0025 0.05 0.0 0.1 5.0E-4 0.8395 0.0 0.0 0.0 0.0 0.005 0.005 0.05 0.0 0.1 5.0E-4 0.8395 0.0 0.0 0.0 0.0 0.005 0.005 0.05 0.0 0.1 5.0E-4 0.8395 0.0 0.0 0.0 0.0 0.005 0.005 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 2.2222E-4 0.90089 0.044444 0.0 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 2.2222E-4 0.90089 0.044444 0.0 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 2.2222E-4 0.90089 0.044444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 4.4444E-4 0.80178 0.088889 0.0 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 4.4444E-4 0.80178 0.088889 0.0 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 4.4444E-4 0.80178 0.088889 0.0 0.0 0.0 0.0044444 0.0044444 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.16975 0.05 0.0 0.0 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.05 0.3395 0.1 0.0 0.0 0.0 0.5005 0.0 0.0 0.005 0.005 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.16975 0.05 0.0 0.0 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.05 0.3395 0.1 0.0 0.0 0.0 0.5005 0.0 0.0 0.005 0.005 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.16975 0.05 0.0 0.0 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.05 0.3395 0.1 0.0 0.0 0.0 0.5005 0.0 0.0 0.005 0.005 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.0 0.05 0.0 0.16975 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.05 0.0 0.1 0.0 0.3395 0.0 0.5005 0.0 0.0 0.005 0.005 0.025 0.0 0.05 0.0 0.91975 0.0 2.5E-4 0.0 0.0 0.0025 0.0025 0.00625 0.0 0.0125 0.0 0.49 0.0 0.49 0.0 0.0 6.25E-4 6.25E-4 0.0125 0.0 0.025 0.0 0.48 0.0 0.48 0.0 0.0 0.00125 0.00125 0.05 0.0 0.1 0.0 0.8395 0.0 5.0E-4 0.0 0.0 0.005 0.005 0.0125 0.0 0.025 0.0 0.48 0.0 0.48 0.0 0.0 0.00125 0.00125 0.025 0.0 0.05 0.0 0.46 0.0 0.46 0.0 0.0 0.0025 0.0025 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 0.0 0.0 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 0.0 0.0 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 0.0 0.0 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 0.0 0.0 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 0.0 0.0 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 0.0 0.0 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 0.0 0.15089 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 0.0 0.30178 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.05 0.0 0.0 0.0 0.90089 0.044444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.0125 0.0 0.0 0.0 0.48764 0.011111 0.48764 0.0 0.0 5.5556E-4 5.5556E-4 0.025 0.0 0.0 0.0 0.47528 0.022222 0.47528 0.0 0.0 0.0011111 0.0011111 0.1 0.0 0.0 0.0 0.80178 0.088889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.025 0.0 0.0 0.0 0.47528 0.022222 0.47528 0.0 0.0 0.0011111 0.0011111 0.05 0.0 0.0 0.0 0.45056 0.044444 0.45056 0.0 0.0 0.0022222 0.0022222 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 2.2222E-4 0.0 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.05 0.15089 0.0 2.2222E-4 0.0 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.05 0.15089 0.0 2.2222E-4 0.0 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 4.4444E-4 0.0 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.1 0.30178 0.0 4.4444E-4 0.0 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.1 0.30178 0.0 4.4444E-4 0.0 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 2.2222E-4 0.15089 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 2.2222E-4 0.15089 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 2.2222E-4 0.15089 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 4.4444E-4 0.30178 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 4.4444E-4 0.30178 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 4.4444E-4 0.30178 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 0.0 0.0 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.05 0.15089 0.0 0.0 0.0 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.05 0.15089 0.0 0.0 0.0 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 0.0 0.0 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.1 0.30178 0.0 0.0 0.0 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.1 0.30178 0.0 0.0 0.0 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 0.0 0.15089 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 0.0 0.15089 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 0.0 0.15089 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 0.0 0.30178 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 0.0 0.30178 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 0.0 0.30178 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 2.2222E-4 0.90089 0.0 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 4.4444E-4 0.80178 0.0 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 2.2222E-4 0.90089 0.0 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 4.4444E-4 0.80178 0.0 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 2.2222E-4 0.90089 0.0 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 4.4444E-4 0.80178 0.0 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 2.2222E-4 0.0 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.05 0.15089 0.0 2.2222E-4 0.0 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.05 0.15089 0.0 2.2222E-4 0.0 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 4.4444E-4 0.0 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.1 0.30178 0.0 4.4444E-4 0.0 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.1 0.30178 0.0 4.4444E-4 0.0 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 2.2222E-4 0.15089 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 2.2222E-4 0.15089 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 2.2222E-4 0.15089 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 4.4444E-4 0.30178 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 4.4444E-4 0.30178 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 4.4444E-4 0.30178 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.86317 0.033333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.72633 0.066667 0.0 0.0 0.0 0.0033333 0.0033333 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.025 0.0 0.0 4.1667E-5 0.48706 0.48706 0.0 0.0 0.0 4.1667E-4 4.1667E-4 0.05 0.0 0.0 8.3333E-5 0.47413 0.47413 0.0 0.0 0.0 8.3333E-4 8.3333E-4 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.05 0.0 0.0 8.3333E-5 0.47413 0.47413 0.0 0.0 0.0 8.3333E-4 8.3333E-4 0.1 0.0 0.0 1.6667E-4 0.44825 0.44825 0.0 0.0 0.0 0.0016667 0.0016667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.90089 0.0 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.80178 0.0 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.90089 0.0 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.80178 0.0 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.90089 0.0 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.80178 0.0 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 0.0 0.0 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.05 0.15089 0.0 0.0 0.0 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.05 0.15089 0.0 0.0 0.0 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 0.0 0.0 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.1 0.30178 0.0 0.0 0.0 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.1 0.30178 0.0 0.0 0.0 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 0.0 0.15089 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 0.0 0.15089 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 0.0 0.15089 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 0.0 0.30178 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 0.0 0.30178 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 0.0 0.30178 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.86317 0.033333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.72633 0.066667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.025 0.0 0.0 0.0 0.48706 0.48706 4.1667E-5 0.0 0.0 4.1667E-4 4.1667E-4 0.05 0.0 0.0 0.0 0.47413 0.47413 8.3333E-5 0.0 0.0 8.3333E-4 8.3333E-4 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.05 0.0 0.0 0.0 0.47413 0.47413 8.3333E-5 0.0 0.0 8.3333E-4 8.3333E-4 0.1 0.0 0.0 0.0 0.44825 0.44825 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 2.2222E-4 0.0 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 4.4444E-4 0.0 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.05 0.15089 0.0 2.2222E-4 0.0 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.05 0.15089 0.0 2.2222E-4 0.0 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 4.4444E-4 0.0 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.1 0.30178 0.0 4.4444E-4 0.0 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.05 0.15089 0.0 2.2222E-4 0.0 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 4.4444E-4 0.0 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 2.2222E-4 0.15089 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 4.4444E-4 0.30178 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.05 0.0 0.0 2.2222E-4 0.15089 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 2.2222E-4 0.15089 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 4.4444E-4 0.30178 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 4.4444E-4 0.30178 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.05 0.0 0.0 2.2222E-4 0.15089 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 4.4444E-4 0.30178 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 0.0 0.0 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 0.0 0.0 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.05 0.15089 0.0 0.0 0.0 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.05 0.15089 0.0 0.0 0.0 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 0.0 0.0 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.1 0.30178 0.0 0.0 0.0 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.05 0.15089 0.0 0.0 0.0 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 0.0 0.0 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 0.0 0.15089 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 0.0 0.30178 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.05 0.0 0.0 0.0 0.15089 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 0.0 0.15089 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 0.0 0.30178 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 0.0 0.30178 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.05 0.0 0.0 0.0 0.15089 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 0.0 0.30178 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 2.2222E-4 0.0 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.05 0.15089 0.0 2.2222E-4 0.0 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.05 0.15089 0.0 2.2222E-4 0.0 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 4.4444E-4 0.0 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.1 0.30178 0.0 4.4444E-4 0.0 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.1 0.30178 0.0 4.4444E-4 0.0 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 2.2222E-4 0.15089 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 2.2222E-4 0.15089 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 2.2222E-4 0.15089 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 4.4444E-4 0.30178 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 4.4444E-4 0.30178 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 4.4444E-4 0.30178 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.16975 0.05 0.0 0.0 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.05 0.3395 0.1 0.0 0.0 0.0 0.5005 0.0 0.0 0.005 0.005 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.16975 0.05 0.0 0.0 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.05 0.3395 0.1 0.0 0.0 0.0 0.5005 0.0 0.0 0.005 0.005 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.16975 0.05 0.0 0.0 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.05 0.3395 0.1 0.0 0.0 0.0 0.5005 0.0 0.0 0.005 0.005 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.0 0.05 0.0 0.16975 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.05 0.0 0.1 0.0 0.3395 0.0 0.5005 0.0 0.0 0.005 0.005 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.0 0.05 0.0 0.16975 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.05 0.0 0.1 0.0 0.3395 0.0 0.5005 0.0 0.0 0.005 0.005 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.0 0.05 0.0 0.16975 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.05 0.0 0.1 0.0 0.3395 0.0 0.5005 0.0 0.0 0.005 0.005 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 0.0 0.0 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 0.0 0.0 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.05 0.15089 0.0 0.0 0.0 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.0125 0.037722 0.0 0.0 0.0 0.47433 0.47433 0.0 0.0 5.5556E-4 5.5556E-4 0.025 0.075444 0.0 0.0 0.0 0.44867 0.44867 0.0 0.0 0.0011111 0.0011111 0.1 0.30178 0.0 0.0 0.0 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.025 0.075444 0.0 0.0 0.0 0.44867 0.44867 0.0 0.0 0.0011111 0.0011111 0.05 0.15089 0.0 0.0 0.0 0.39733 0.39733 0.0 0.0 0.0022222 0.0022222 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 0.0 0.15089 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 0.0 0.30178 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.05 0.0 0.0 0.0 0.15089 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.0125 0.0 0.0 0.0 0.037722 0.47433 0.47433 0.0 0.0 5.5556E-4 5.5556E-4 0.025 0.0 0.0 0.0 0.075444 0.44867 0.44867 0.0 0.0 0.0011111 0.0011111 0.1 0.0 0.0 0.0 0.30178 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.025 0.0 0.0 0.0 0.075444 0.44867 0.44867 0.0 0.0 0.0011111 0.0011111 0.05 0.0 0.0 0.0 0.15089 0.39733 0.39733 0.0 0.0 0.0022222 0.0022222 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.025 0.0 0.0 0.0 0.028292 0.47294 0.47294 0.0 0.0 4.1667E-4 4.1667E-4 0.05 0.0 0.0 0.0 0.056583 0.44588 0.44588 0.0 0.0 8.3333E-4 8.3333E-4 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.05 0.0 0.0 0.0 0.056583 0.44588 0.44588 0.0 0.0 8.3333E-4 8.3333E-4 0.1 0.0 0.0 0.0 0.11317 0.39175 0.39175 0.0 0.0 0.0016667 0.0016667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.025 0.0 0.0 0.0 0.028292 0.47294 0.47294 0.0 0.0 4.1667E-4 4.1667E-4 0.05 0.0 0.0 0.0 0.056583 0.44588 0.44588 0.0 0.0 8.3333E-4 8.3333E-4 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.05 0.0 0.0 0.0 0.056583 0.44588 0.44588 0.0 0.0 8.3333E-4 8.3333E-4 0.1 0.0 0.0 0.0 0.11317 0.39175 0.39175 0.0 0.0 0.0016667 0.0016667 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.16975 0.05 0.0 0.0 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.025 0.16975 0.05 0.0 0.0 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.025 0.16975 0.05 0.0 0.0 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.05 0.3395 0.1 0.0 0.0 0.0 0.5005 0.0 0.0 0.005 0.005 0.05 0.3395 0.1 0.0 0.0 0.0 0.5005 0.0 0.0 0.005 0.005 0.05 0.3395 0.1 0.0 0.0 0.0 0.5005 0.0 0.0 0.005 0.005 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.0 0.05 0.0 0.16975 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.025 0.0 0.05 0.0 0.16975 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.025 0.0 0.05 0.0 0.16975 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.05 0.0 0.1 0.0 0.3395 0.0 0.5005 0.0 0.0 0.005 0.005 0.05 0.0 0.1 0.0 0.3395 0.0 0.5005 0.0 0.0 0.005 0.005 0.05 0.0 0.1 0.0 0.3395 0.0 0.5005 0.0 0.0 0.005 0.005 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 0.0 0.0 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.05 0.15089 0.0 0.0 0.0 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.05 0.15089 0.0 0.0 0.0 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 0.0 0.0 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.1 0.30178 0.0 0.0 0.0 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.1 0.30178 0.0 0.0 0.0 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 0.0 0.15089 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 0.0 0.15089 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 0.0 0.15089 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 0.0 0.30178 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 0.0 0.30178 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 0.0 0.30178 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 2.2222E-4 0.90089 0.0 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 4.4444E-4 0.80178 0.0 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 2.2222E-4 0.90089 0.0 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 4.4444E-4 0.80178 0.0 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 2.2222E-4 0.90089 0.0 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 4.4444E-4 0.80178 0.0 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.86317 0.033333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.72633 0.066667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.86317 0.033333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.72633 0.066667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.86317 0.033333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.72633 0.066667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.16975 0.05 0.0 0.0 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.025 0.16975 0.05 0.0 0.0 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.025 0.16975 0.05 0.0 0.0 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.05 0.3395 0.1 0.0 0.0 0.0 0.5005 0.0 0.0 0.005 0.005 0.05 0.3395 0.1 0.0 0.0 0.0 0.5005 0.0 0.0 0.005 0.005 0.05 0.3395 0.1 0.0 0.0 0.0 0.5005 0.0 0.0 0.005 0.005 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.0 0.05 0.0 0.16975 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.025 0.0 0.05 0.0 0.16975 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.025 0.0 0.05 0.0 0.16975 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.05 0.0 0.1 0.0 0.3395 0.0 0.5005 0.0 0.0 0.005 0.005 0.05 0.0 0.1 0.0 0.3395 0.0 0.5005 0.0 0.0 0.005 0.005 0.05 0.0 0.1 0.0 0.3395 0.0 0.5005 0.0 0.0 0.005 0.005 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.90089 0.0 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.80178 0.0 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.0125 0.0 0.011111 0.0 0.48764 0.0 0.48764 0.0 0.0 5.5556E-4 5.5556E-4 0.025 0.0 0.022222 0.0 0.47528 0.0 0.47528 0.0 0.0 0.0011111 0.0011111 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.025 0.0 0.022222 0.0 0.47528 0.0 0.47528 0.0 0.0 0.0011111 0.0011111 0.05 0.0 0.044444 0.0 0.45056 0.0 0.45056 0.0 0.0 0.0022222 0.0022222 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 0.0 0.0 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.05 0.15089 0.0 0.0 0.0 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.05 0.15089 0.0 0.0 0.0 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 0.0 0.0 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.1 0.30178 0.0 0.0 0.0 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.1 0.30178 0.0 0.0 0.0 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 0.0 0.15089 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 0.0 0.15089 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.0 0.0 0.15089 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 0.0 0.30178 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 0.0 0.30178 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.0 0.0 0.30178 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.86317 0.033333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.72633 0.066667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.025 0.0 0.0 0.0 0.48292 0.0083333 0.48292 0.0 0.0 4.1667E-4 4.1667E-4 0.05 0.0 0.0 0.0 0.46583 0.016667 0.46583 0.0 0.0 8.3333E-4 8.3333E-4 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.05 0.0 0.0 0.0 0.46583 0.016667 0.46583 0.0 0.0 8.3333E-4 8.3333E-4 0.1 0.0 0.0 0.0 0.43167 0.033333 0.43167 0.0 0.0 0.0016667 0.0016667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 2.2222E-4 0.0 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 4.4444E-4 0.0 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 2.2222E-4 0.0 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 4.4444E-4 0.0 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 2.2222E-4 0.0 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 4.4444E-4 0.0 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 2.2222E-4 0.15089 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 4.4444E-4 0.30178 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 2.2222E-4 0.15089 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 4.4444E-4 0.30178 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 2.2222E-4 0.15089 0.79444 0.0 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 4.4444E-4 0.30178 0.58889 0.0 0.0 0.0 0.0044444 0.0044444 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 1.6667E-4 0.11317 0.78333 0.0 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 3.3333E-4 0.22633 0.56667 0.0 0.0 0.0 0.0033333 0.0033333 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.16975 0.05 0.0 0.0 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.025 0.16975 0.05 0.0 0.0 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.025 0.16975 0.05 0.0 0.0 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.05 0.3395 0.1 0.0 0.0 0.0 0.5005 0.0 0.0 0.005 0.005 0.05 0.3395 0.1 0.0 0.0 0.0 0.5005 0.0 0.0 0.005 0.005 0.05 0.3395 0.1 0.0 0.0 0.0 0.5005 0.0 0.0 0.005 0.005 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.0 0.05 0.0 0.16975 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.025 0.0 0.05 0.0 0.16975 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.025 0.0 0.05 0.0 0.16975 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.05 0.0 0.1 0.0 0.3395 0.0 0.5005 0.0 0.0 0.005 0.005 0.05 0.0 0.1 0.0 0.3395 0.0 0.5005 0.0 0.0 0.005 0.005 0.05 0.0 0.1 0.0 0.3395 0.0 0.5005 0.0 0.0 0.005 0.005 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 0.0 0.0 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 0.0 0.0 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.05 0.15089 0.0 0.0 0.0 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.0125 0.037722 0.0 0.0 0.0 0.47433 0.47433 0.0 0.0 5.5556E-4 5.5556E-4 0.025 0.075444 0.0 0.0 0.0 0.44867 0.44867 0.0 0.0 0.0011111 0.0011111 0.1 0.30178 0.0 0.0 0.0 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.025 0.075444 0.0 0.0 0.0 0.44867 0.44867 0.0 0.0 0.0011111 0.0011111 0.05 0.15089 0.0 0.0 0.0 0.39733 0.39733 0.0 0.0 0.0022222 0.0022222 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 0.0 0.15089 0.79444 2.2222E-4 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 0.0 0.30178 0.58889 4.4444E-4 0.0 0.0 0.0044444 0.0044444 0.05 0.0 0.0 0.0 0.15089 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.0125 0.0 0.0 0.0 0.037722 0.47433 0.47433 0.0 0.0 5.5556E-4 5.5556E-4 0.025 0.0 0.0 0.0 0.075444 0.44867 0.44867 0.0 0.0 0.0011111 0.0011111 0.1 0.0 0.0 0.0 0.30178 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.025 0.0 0.0 0.0 0.075444 0.44867 0.44867 0.0 0.0 0.0011111 0.0011111 0.05 0.0 0.0 0.0 0.15089 0.39733 0.39733 0.0 0.0 0.0022222 0.0022222 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.025 0.0 0.0 0.0 0.028292 0.47294 0.47294 0.0 0.0 4.1667E-4 4.1667E-4 0.05 0.0 0.0 0.0 0.056583 0.44588 0.44588 0.0 0.0 8.3333E-4 8.3333E-4 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.05 0.0 0.0 0.0 0.056583 0.44588 0.44588 0.0 0.0 8.3333E-4 8.3333E-4 0.1 0.0 0.0 0.0 0.11317 0.39175 0.39175 0.0 0.0 0.0016667 0.0016667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.78333 1.6667E-4 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.56667 3.3333E-4 0.0 0.0 0.0033333 0.0033333 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.025 0.0 0.0 0.0 0.028292 0.47294 0.47294 0.0 0.0 4.1667E-4 4.1667E-4 0.05 0.0 0.0 0.0 0.056583 0.44588 0.44588 0.0 0.0 8.3333E-4 8.3333E-4 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.05 0.0 0.0 0.0 0.056583 0.44588 0.44588 0.0 0.0 8.3333E-4 8.3333E-4 0.1 0.0 0.0 0.0 0.11317 0.39175 0.39175 0.0 0.0 0.0016667 0.0016667 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.679 0.2 0.001 0.0 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.1 0.0 0.2 0.001 0.679 0.0 0.0 0.0 0.0 0.01 0.01 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.17778 8.8889E-4 0.60356 0.0 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.60356 0.0 8.8889E-4 0.0 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.2 0.0 0.0 8.8889E-4 0.60356 0.17778 0.0 0.0 0.0 0.0088889 0.0088889 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.4 0.0 0.0 6.6667E-4 0.45267 0.13333 0.0 0.0 0.0 0.0066667 0.0066667 0.1 0.679 0.2 0.0 0.0 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.16975 0.05 0.0 0.0 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.05 0.3395 0.1 0.0 0.0 0.0 0.5005 0.0 0.0 0.005 0.005 0.025 0.16975 0.05 0.0 0.0 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.00625 0.042438 0.0125 0.0 0.0 0.0 0.93756 0.0 0.0 6.25E-4 6.25E-4 0.0125 0.084875 0.025 0.0 0.0 0.0 0.87512 0.0 0.0 0.00125 0.00125 0.05 0.3395 0.1 0.0 0.0 0.0 0.5005 0.0 0.0 0.005 0.005 0.0125 0.084875 0.025 0.0 0.0 0.0 0.87512 0.0 0.0 0.00125 0.00125 0.025 0.16975 0.05 0.0 0.0 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.1 0.0 0.2 0.0 0.679 0.0 0.001 0.0 0.0 0.01 0.01 0.025 0.0 0.05 0.0 0.16975 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.05 0.0 0.1 0.0 0.3395 0.0 0.5005 0.0 0.0 0.005 0.005 0.025 0.0 0.05 0.0 0.16975 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.00625 0.0 0.0125 0.0 0.042438 0.0 0.93756 0.0 0.0 6.25E-4 6.25E-4 0.0125 0.0 0.025 0.0 0.084875 0.0 0.87512 0.0 0.0 0.00125 0.00125 0.05 0.0 0.1 0.0 0.3395 0.0 0.5005 0.0 0.0 0.005 0.005 0.0125 0.0 0.025 0.0 0.084875 0.0 0.87512 0.0 0.0 0.00125 0.00125 0.025 0.0 0.05 0.0 0.16975 0.0 0.75025 0.0 0.0 0.0025 0.0025 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.0125 0.0 0.011111 0.0 0.037722 0.0 0.93756 0.0 0.0 5.5556E-4 5.5556E-4 0.025 0.0 0.022222 0.0 0.075444 0.0 0.87511 0.0 0.0 0.0011111 0.0011111 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.025 0.0 0.022222 0.0 0.075444 0.0 0.87511 0.0 0.0 0.0011111 0.0011111 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.2 0.0 0.17778 0.0 0.60356 0.0 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.0125 0.0 0.011111 0.0 0.037722 0.0 0.93756 0.0 0.0 5.5556E-4 5.5556E-4 0.025 0.0 0.022222 0.0 0.075444 0.0 0.87511 0.0 0.0 0.0011111 0.0011111 0.1 0.0 0.088889 0.0 0.30178 0.0 0.50044 0.0 0.0 0.0044444 0.0044444 0.025 0.0 0.022222 0.0 0.075444 0.0 0.87511 0.0 0.0 0.0011111 0.0011111 0.05 0.0 0.044444 0.0 0.15089 0.0 0.75022 0.0 0.0 0.0022222 0.0022222 0.2 0.60356 0.0 0.0 0.0 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.15089 0.0 0.0 0.0 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.30178 0.0 0.0 0.0 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.05 0.15089 0.0 0.0 0.0 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.0125 0.037722 0.0 0.0 0.0 0.011111 0.93756 0.0 0.0 5.5556E-4 5.5556E-4 0.025 0.075444 0.0 0.0 0.0 0.022222 0.87511 0.0 0.0 0.0011111 0.0011111 0.1 0.30178 0.0 0.0 0.0 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.025 0.075444 0.0 0.0 0.0 0.022222 0.87511 0.0 0.0 0.0011111 0.0011111 0.05 0.15089 0.0 0.0 0.0 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.2 0.0 0.0 0.0 0.60356 0.17778 8.8889E-4 0.0 0.0 0.0088889 0.0088889 0.05 0.0 0.0 0.0 0.15089 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.1 0.0 0.0 0.0 0.30178 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.05 0.0 0.0 0.0 0.15089 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.0125 0.0 0.0 0.0 0.037722 0.011111 0.93756 0.0 0.0 5.5556E-4 5.5556E-4 0.025 0.0 0.0 0.0 0.075444 0.022222 0.87511 0.0 0.0 0.0011111 0.0011111 0.1 0.0 0.0 0.0 0.30178 0.088889 0.50044 0.0 0.0 0.0044444 0.0044444 0.025 0.0 0.0 0.0 0.075444 0.022222 0.87511 0.0 0.0 0.0011111 0.0011111 0.05 0.0 0.0 0.0 0.15089 0.044444 0.75022 0.0 0.0 0.0022222 0.0022222 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.025 0.0 0.0 0.0 0.028292 0.0083333 0.93754 0.0 0.0 4.1667E-4 4.1667E-4 0.05 0.0 0.0 0.0 0.056583 0.016667 0.87508 0.0 0.0 8.3333E-4 8.3333E-4 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.05 0.0 0.0 0.0 0.056583 0.016667 0.87508 0.0 0.0 8.3333E-4 8.3333E-4 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.4 0.0 0.0 0.0 0.45267 0.13333 6.6667E-4 0.0 0.0 0.0066667 0.0066667 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.025 0.0 0.0 0.0 0.028292 0.0083333 0.93754 0.0 0.0 4.1667E-4 4.1667E-4 0.05 0.0 0.0 0.0 0.056583 0.016667 0.87508 0.0 0.0 8.3333E-4 8.3333E-4 0.2 0.0 0.0 0.0 0.22633 0.066667 0.50033 0.0 0.0 0.0033333 0.0033333 0.05 0.0 0.0 0.0 0.056583 0.016667 0.87508 0.0 0.0 8.3333E-4 8.3333E-4 0.1 0.0 0.0 0.0 0.11317 0.033333 0.75017 0.0 0.0 0.0016667 0.0016667 0.0 1.0 0.0 0.0 1.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 0.0 0.5 0.5 0.0 0.0 0.5 0.5 0.0 0.0 0.5 0.5 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 1.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 1.0 0.0 1.0 0.0 1.0 0.0 0.0 1.0 0.0 1.0 1.0 0.0 1.0 0.0 0.0 1.0 1.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 1.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 1.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 1.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.075 0.0 0.63593 0.25437 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.075 0.0 0.0 0.0 0.8903 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0025 0.0 0.0 0.0 0.0 0.99747 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.075 0.0 0.63593 0.25437 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.075 0.0 0.0 0.0 0.8903 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0025 0.0 0.0 0.0 0.0 0.99747 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.075 0.0 0.63593 0.25437 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.075 0.0 0.0 0.0 0.8903 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0025 0.0 0.0 0.0 0.0 0.99747 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.075 0.0 0.63593 0.25437 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.075 0.0 0.0 0.0 0.8903 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0025 0.0 0.0 0.0 0.0 0.99747 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.58824 0.23529 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.15 0.0 0.0 0.0 0.82353 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.005 0.0 0.0 0.0 0.0 0.99497 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.39 0.3 0.1 0.2 0.01 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.5 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.3 0.0 0.0 0.0 0.7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.01 0.0 0.0 0.0 0.0 0.99 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 1.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 1.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 1.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 1.0 0.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 -5.0 0.0 0.0 0.0 -5.0 0.0 0.0 0.0 -5.0 -5.0 -5.0 -5.0 -10.0 -100.0 0.0 0.0 -5.0 0.0 0.0 0.0 -5.0 0.0 -5.0 -5.0 -10.0 -5.0 0.0 0.0 -5.0 0.0 -10.0 -5.0 -5.0 -5.0 -5.0 -5.0 0.0 -5.0 -5.0 -5.0 -5.0 -5.0 -5.0 -5.0 -5.0 -5.0 -5.0 -20.0 0.0 -5.0 -20.0 0.0 -5.0 0.0 -5.0 0.0 0.0 -5.0 -10.0 -5.0 -5.0 0.0 -5.0 0.0 0.0 0.0 0.0 0.0 0.0 madp-0.4/problems/PaxHeaders.5405/Grid3x3corners.dpomdp.gz0000644000000000000000000000007412717644140020251 xustar0030 atime=1463765180.073720381 30 ctime=1463765201.025553043 madp-0.4/problems/Grid3x3corners.dpomdp.gz0000664000372100037210000021177312717644140021113 0ustar00fransfrans00000000000000;JGrid3x3corners.dpomdpA̒WƉ5${YuW]q-{s\b<^<Ȍd?՟ǿ_ÿ˿_?'>׿?o_[_v?_o?SoO߿ο?O??˟?ӿO?_'_ǿ_;__\?w_O|?/Y99yV?w4~-I?o_A8%SVoYzѺޕh]YDՠww UB] UIQIٕl]a4*ԕ j]_+ջRTC\u*BPWVʻQp?4(~Ci@6-IqTl.jۢJZ(_ \5ڻs-ޝ~dY̵\㪩+kuk >*2BZp-¹vk\T+*BZ\ 5>ՕJ+=תCȵ\\UMQA7-I?Q7׭|mkB p-6n -+iגsiI"smckЎ^򵔾RZ\Kk}-T*RZI_tӒa0S6qT_ +_+ε}(טRW(׊pҹV:JZqU%i5:̵ҹV:Jڦk\WWsQ]VkGkra0Mo*YMԻ穎^}۟c}}ï06ut^; .][֝%tu,E#v# f;uKpݙpܴKҏ<=.pp޲n Ǎiv7it>hzpJhv<-Ώ±Z[ME4ij:6lʲKR'ԋ8t钸M/[I#Kl .q¿3>C.fOPRqwtI[!'`P''''''\\\\\A^9 .]xSZ|ŧ:mq¸ٴǃ'pҿ(>?tCϦtIi]!åK&?{[8 Ӂvq,wӗ,+v$$&^ 0㨒B%Z_pˢb+/8 }J5Ը$+}?r\BP_R/%ҸK/Yƥ/T eV;ElJvӗ,+`^m^TI W^e?/Ȅ p1G ^}k9/pE5|fȄDž[G}ᄃs\zsd_d…N #u48nuu pp]'(KN8*+`N xnC6Łj B+l6mjȄe%p).åt :R'\jKp.åLWJ:\Ipa25J!#%"apХRTZ t%Ͼ(ZRJ~ pӸ(۴1pPCJ{qQipS_'AE!%AHE'c6j 3۟:zj|?൓g/stkMIۉ_Ӯ_n~h.Yhܩ!`ݶ; gDKW;e8n[Ee9;n:wj`8N¥K$pZ&8OuzH:j~ILH}ꦻݬ>p:xPᣅTOh -?gciDăKW *Ou[SDCeI{8C~'bӃ:x(ٔ/Y3"Oq~Ȯ?!OZ-~R~ROjIyJR-~6PMqܩ!!0bψ\VZl[Ee9;lp/)r8t~HRw}vtYT5=#bvH=#bvpI)>)?%??%?%?Es_y $>iSTSZ}J.~\OR4,-v y8!)w~ë3TvI %Gt^qNHA\/iW 2y}r 0 ruZΫ3]ZSxi|]S",ȌSƋ:d*;w^y*9 ЂZc2-L$bʂ̸S$]y$TV T rhA-1JW$ ޒ.! StDcL-ȩ9 Ԃ,|Hz\!dƽ%jiI$}I+d8ڗnDj\ o,vՉ2`6S7K;< 8uJ^w> <rr ]jZS rjAN-ȩ9 1+ w o++++++bAƫcdKCbU' ҂\r\,D/Iq\C©qi4>xIA.-ȥ +Mqe9OYX\!x1dj+MK%i٫Vpdƥj#LXBT 2`@i) "A>:,Ur)RPRp)8v%qTr/[JTJOv vO[jNq!էӷ,Koz b|OguWߋ-x}=7}TcM=6ϝ"NY; PMZ(^솀V- {Q@>=YfXu$t ‹cZEk" $AAun` t>v j/k3DjPh A5(Q%s" Aps4o Fd *KZBkP {<UA9yAD%ۣ,A\6;L.E6M=jxךT }w\m,xEPEЦQ-6}ֆm[xGNY7JJJJ-@(ԋԋԋԋTrTrTrTzTrT@xr̰b#J+Pi*@"XR@"Fk" RJKPEЦQ.6~* Ÿ5=߸64֠M?^me)A/H§,M5pXk)j" ::W w4&8.̍:{ QgO*LRujgJgNvj/ދ:pNoJ xiƗM=/xQlXؠ}҇nƗƺyԗ}Iٗ}Iݗ}Iݗ}Iݗ})ٗX,*+6d9Vԗ[WZ^N %^^NiL8s#{a`Sb☤.FqPb$\}Iٗ} :B'\pՊٗpuܝ'".tH8%I{:{Up  r䄣H&\KN8O+lzʲb٘݌elBp GeD_dA31p).åt :R'\jKp.åLWJ:\I+N8HŎpt•t8ᨬ@} GŖ1IK'\I?ʊopQiL W6sL9ܦbÌcpE1d•r℣pj]np !gSy?/&~nzjCMi3Ix!&K)?$Z?eiWDC*Pi*AQMœdb'K *-A%"hCR Zm*6BqE D,5-ҠCñtC:[ptڙRujg:Lmwv^Dkŝ%߄^`eؘ^%+gUIٗh}%ؗ |h/"} \}֗EK$ %u_BиKQRԸKR且KR丬>j7{%Fuz9SzEL8jz 'jJ'i p.F nǘ} TL :b$/R/pDȄ p.F1.=CL p G:R'\KN86%HKpn*^;$".GQie(iJ?r :qxJh\åt:R'\Kp.år J:\I+p  '^Z!t•t#Ff n-[:J'\I?r w,(j񂖑pmzJDž |hE&Ep;:ń[pG* Z4ǣSAE*:i7wS/xTsޤc%nnjHǃ]RΏMs~ܴϏo݌1?ǃ;i=s~<5|u3>ywcx-zvxVիTiSƦ%׃j*N©[7#yx0F|ϺRTDd)u;',A%.d), Y GLӼ>AX4A,$Km wsH] Ku)XJ 7nKA.\صs.iZRRj]JKu)Y9t W@ߝxt]*mA= R}"KIdf@H "u pj'ԥiSuw]'Hץ{*. "u).֥ԺZRRRtt).\/\/[AXn RJRi]*^ڴP6 "u pc5$MΙK{@z.)"Uyw_(~uQVA6Z-(h.1kO©K-8¬anzmnizU᧮L{V?n?8 C*ppy_ x;| 槮L{E? = 5b?B߼~2m1Lӫ:tߺg{ǃ1w=G6mSN~S_o]?~[dm66ԥ]Gye۴coW-0uempsߕ=Qo 67N#)#={;|$>#p쇑?(ߦ/4*bHFʴ4FHBI #J8$1LEoxs41'{vUNIG.pIUp.=waM$i$q4NI8IN'ie'94Co[CN71H->#AnڳzIq=;  `{$>.^; ԼSOק$9 cONR\zJzq4NI8I'I$iIҜ9'IsN$SpN9ILpt k')$eBM'M8I')$e9IM zyNRI9I')$5]bNR)I8I')}NGA^'Qi޳h9pҼNk')}NGA;ż7N? /S[7bNR\>Mhk'AnCW$I=ӫq҅8d,f8tڝYL{՜dy*&s6|y8m롙Sz<Ճټ˔|PpN3g󷮇z^:,]mW3wu-2?5_9-^rzZƆrZbY2?\/1iz\l,o3MN~zZBY =kUt?|aA A+sHA -h1-6Lkts(8CXC= Z AK.%Kl!hCF%4FZAK#h9m}IA;'Lm,[Rys |0QW4-h؜-hi;^ÂvłƥihAK#hi-4+4+4+dA;++++2VFZMAW7lA+#he Xpe7:Ve p\a%_F>wXj4Gg}ZЀܑ+4= +sG eÂ9-hߺ[B+-h5  [Ҝ_x1nƋ%<ތ[%=b  o,v=:e[~f6p+GO{Q7 =/]bSeʿn.6onBp6ŋXޡk3Qx>g?#471\^m~~tL%ҡpb io^mvo2Mbo-;8_~ 1fzE$|ujv8J X~Qw<;T?x.vaEiEGFǖ f>GA`{2+#j}Fb?<GG=yolg쥑6FHpSF2ʿ 6# c$a$p 1ӴFHBIh#a$\ O{v2Mbk' $1Ӵg').OWNI0:I ' {X18pC㏮k'I$i$q4NIFmIՏNrg'vt{$_5jWv[jW>%A~vƸD,y/pseʿ Ї OS~iNg'S臓zr=}+{մNI8I'I$i$ n:L0)$QtN9IQ\=NRI8I'$ō#feq2NRIm{yNRI9I')$5KN2ʣRq2NRI8IsxNXl^: $˔]B.v$Kp<',6'ILEb$5ʛnMbk'AcIJ;I '9} U!\ǭ6ČilnXOY5ɸtY5Od\Ƒ)/aYmx[bhc,Zcŭj1l<KqmzNd46xOcilهV82?mxUdMa"k#7Ugm\z0N]4^L[8$ngd K^^rn `΋t}o8}wmz}kOX\|,_j=1o^9ř$\-_Gma 7n 3dpgҸ_z ]^$6aq[ͤ3fLBIL3pp pM&a$tG}L ޥnMBIL7Ie8:yL7{&a$t _NrnMb ގZ!nᲠq4nMҸI7I&i$pQWrAxi,/.-MS`]M|&]Y*|}j݄1z|v.Mn/;7A^h>7An:L3 4ƷXp.MnMҸI7I&i$97Isn$͹IDMRIs&MJ>7)&eܤqnRzu+C37)&eܤ>7&{I7)&ܤt>'nR\^}J_I7)}nؔΙyqA|;Jݤ7cLis4~|&MoG7n"?t2Rņ $7anRM&k(xCx ݄5f1{WnNQ͹wf<d]}n|ͷ",'Gyp76_9aٟNtt:ף~0Z&,഻EDz ͡NJ18\'up܃` =87E7_47E7O]?{Kb"Vż߼~Նx17";6_y0\X=AIj<^p+a,6sJmJ6cNж`%́Fy92V9œJ/1/b/b^{%$^si3?P/dfL˜IL3A˖l&cj 4fLb fҿw!^|&a$ n'=!$$atnםch4ƥ.6ċk7A~j?v.Ë3=&I>cKW_ p^&_Cף5 '?n¸ܤ/&q4nMҸI7I&iMҜ97Isn&LMRIs&MJ>7)&eܤqnRz* ͨi[v2nRMJpxnRM/ݤt2t.Ëk7)&Msb;v4Wjvj <7,6V7n?'DDM˫ bk7AۣMJI 7:MPKCx ݄KߺOƭnN؁_Nd<7Ϻy:湈wA} X?wk~IuBO>VK7$n}|d'(8AX숇 O6o18|X!QS\5yp>sLh3j>s`y"롙S:8>53y8gsJ9ln꧙zw.vS)gŎx9E?W!?t+ C(,ֳz/;шh=>,#zH= g1,mJ=SG ZA #h1˫#-тFZLAb(A!hI-b2Y!hi-4Frڨ5ZA;aY0g%pI-h'6Dp-6HЂ+hACNSG rL:zt=4uX§}hAK#hi-4fff,hQԂzVzVzVzVFZ9A!hQⱯofn-he 1F-#heņx hA+B|` 44uqi7 Zp+4}hAC~ާ_ yާZvFA[CƇ.}/ ƇƿY qk π`|hZ/6~9`_6>ġ[Eܭonuk1nw mJӭn G+Mn ~hnSWCUԭ{Tt[ܞ[bzMxmd2?Gchcߡa~rq{Zhw90#?>MWU8 >&?gGkg\O2GKghq~ \[[1yR~"nbr~g#?xi3M~i3?MY##?Gylo$9x-i"]ЭcOtKgLi3ZÐ-Ge>XְѰ4FҬҬҬҬrh4,:::::uo55yq +ae4::"ƌ0FbJX\^RgHw J]0FHXL +<}Xp?0nMְa14/aX|Gw9 7 Kai4,7ȩaAE ;S|MZÀs|!G .6 m0W|V2ioHM C0]kAkXD*gNLUm"_lr!584.9I#iD>ȧ4"CG{Vz%SƇpqy\ęE1E#/Q䁫"z%\WISGS@..8Y<4tS|"C񲶈xbZӈ|OOOOO!a+2+2+2+2+2+"` }Sˈ|/#eDJ.n 8|M855E~p\SFˈ|/#eDJ+/D8ǙE~ |>bEs!EJ+_}z%\wY_Akty?Zg-i+җkJb{ Sx|ɸUgx|V3KCr <>+ɓqԸ<j'.핂K?ڬnW= ̇ӻ6K 90>=>v>~< ?\)RͫU->|*>g=>yOS(>W|N.O< =.~VWVp)>jU;^"'!Sn`=AYrqwei baT,TbSX!Ņ| vZHX #c1eg/X{駱ACǸ}*@Cֱ0:FbX1OC c~g%c1t_cr ͡cmH4:FXˡcpӜ:h#/{XNJ˷Y< i.^c{ ^ìcI5!_c ^XN;d>ݨu,ѱ4444:vFK++++c"0y-zX+#cedr 㣗c5e< 'eTQ2*Vf5ܕѫ1}RYCłKGX+#beDb +1c*>C=~_1使r1V!2yu`l[13gݜxrs{nuKn}2nu(A3w:7t!rn.msnڇ7L5O ,~_i_i_i_i_iU_*{_EbW}<,՞EWsބ_p"L"bǠ{ GrtԯюAa4fsI~VPtI0I3IyHR.O$]OTK'i$\!'i)I:>c1e$~\$M9t,g5!>Q9ڿ8&3]ک9CIz0I_:I}_I~$=yIZ\^P'i'Mi4G2$MeqI.A\$-eFK_z[#Iԯ\&I8i$mDrFlUtI2IZINWy~)1uvIFr!H-˫}D">n?'M|6o|~VWW_$pfM16q(_o¶>"16ټO{G$O7_|~0"\/ b~O/A/(wn*h0*F¨XL+6"V{|Q0*FbX1_mbE"@CƸb  ""@ZX)c|NbkWnD :֮б"=9tiC4:FXˡc;˩cxf=o.iC~j^!:v0:ֶhC:&1YՑ˱:v0:V\^m#XKKKKˡcQRʬʬʬʬjXxQQ22VF,jz9VS̗ǽ22VFX+CY|~VGT"Ǔ2|\HGX+beVc_NO*iZĀlh++}RYZҥ㹿bƿu[<^x/uͳ/P>޷>t6; n}G߈˶ysjOpGzwp2"ޟ(/&ܯWR}+_2*{_GWU_wQ;uX.}ՂF"Ơ7򾙿LqzHquI0I3Ip1`I0I&Ic&ON}[/NN0I&Ic&i1k$< %4Fqs$iZ44MII:KRL҃a8~Dx_:Is&i0OQs&hI\K')>^In'H҃ax/i4Mq4NIs$A4q2NZIk$iD25;IZ&I$i'n$OeLI2NZ#I۩/ܭk>^:I$i$-dEry/~\餥t:ti5fr0~i \c6'  Z#OB p]8A\|M/.^R_bbN <o" >& щsvz(:-΃Ɯ9uLSg]͗}l.-p:Ly~9u<ˆlާbגilPtVAnufg,h\4n9JCJ_x9yA.gJzt!?ts(:ZЀ3e`Ako谠1-0Fbz(8Cǜ:$ht0FZA #h1]C!A (h--W~ʓ2Эi2QOٜfxVuX)8gmҘM\K&ej=܃# 0͜g'We[Czf^!K=Kg,rv2?tk44볔rCN(gg嬴r6 )g6}qkZk6)Y9+-g嬴ՐdkYr=>gf~/ge3=:R3>uq%]$ֳ2zVZMR3G:,h5#\+4=:JJjAm -z3_\Ŝx~*ˇ%K2y?8 .wtW[P9́a(P7_=wj~1}4'.}Z(o.%f_cSxӜ0ht%47>ݩ2n(47_zWx)7b +'ԥm\ mXMMMZN!nWs{ڰ"/`b7 ½&\z)M&ݞ2k721Og7iשYЂݤ]Hg7a$q0nM¸I7 &1d?d3$ޒJ6H1󍛄q0nM¸I7 &1݄SMj%7 &$pnMRIN76|}t2iÚMҸI7&t/ӞW?t8m&Xǀ$._xi)Ġ p>5AnR*fxi|~Zz쇗ik/A~S쵗-]?^ Ǖ^KR{Ij/%'{Gk+Ic%i$91Isb$͉IJ+a%'a'&VRJ9kM+mPJ579+c%eVRJJ[Ii+i%<%Ĥ4ߺMe2^RKK/,6lCcB'&4p-Lkk3)m&{o7'&/&w&_c|&{𕛔>1&at5`p5KW fEڽqk|k$n qV7OƃpZwytͣL7L7W|.6vZ|qsVjCx[ ΃[(݃}o~jC Nf. x3l? ?g{paw,Yry9Zΐusht)g,唳yO!g\f4rf}f}f}RrI,rVf}Vf}Vf}VSFkssZƖ2rVFJYi9+-g5,H = !M|a=+geёz߭f}?aA+nEg=ZА# pO,)hX>N6_XZJ ZY A;E&\9g?1nƋ%<ބ{%=bz xƴ_xW~]:_#3xyj2}~ښӏ=x5PKƛINyC?0;UwMsNyߺѣ:ȃq1Lߕ4014NSwxqK}=? ?\~WNFy5wMo)od|2ڎGr& GKS\ܰ>+o?>l~a&/6i0mMnV1A݄K 3r v:4 pS^ nEM,M1_I7 &a$q0nM8f/MӤUKևy5eۼ[o:K^ 73^KR{Ij/%'W=[R쵕4VJrZs#V'JrX#KIi+)m%԰Z?0͡%bGԳ2^RKxI/)%^µpI 3́)Lb.vʫk3)c&0J%^|}b!S ?t/./6ī9 5.O_ [i&](/'>1An#6ʫnR\= ݤ>1&at5 u!\Ib4ƽnVQAvl[y>2x0nuAm.'ŽoZ76Fc~!!ІvDSܾCpCx xCeax2*kwg 71љ{mGv:^L.|WdM6ns!Ǵq<&ax ?M_?_&hŭ1k} ƃpi,nIΡ%¨6< GG>QCmYq|F ?_CnxΡ%Zq4xcal<06c8/*v8sZ \7Z !$xcal<06ƹ&ZbNCK6DCx ;lm<6M\5'0< _/p4zFM;iKcqwtq05OW:ƑLg 71k61QC;ly6tiquq4lXa/M{8ƑQq;5l8e6Sxji'0ʛר6s=|sƯsɅdi</mm6^}l5i2?.6l>fMMgNi/cel6^Kxii2< Ols{hh26^x/cmpZiih80e;E߄6> 2AI6\lCm.Muq.-9UYƑ8eGTU1i&|`uOͤh 62fRL/]z~Ia&\z LǯnͤDMƁx&y raMk&}"|}bpq\<,b9 pr'&5:MPƇ\C& aqkbfݜ\͹wf<S_c.⽫tw'_T; ߷yQӵ?p?^;i:ף~iUvt֛KV!:1/S^<߉Pp+p=yp΃"8l.y8g)8W_ ΃{^=? +ٜjm\< )js|pȫͣճz^JW#n#bA!osCЀ#/ z҈-̣-cVO #ha-!7WOApCaA =8,h\-0Fb 3 imV҃c-0Fb s+;IЂ( ZhA!hx5-.c Gyг4zFr՗G=ųp3uRгQ^<3RizPpzఞz6ʋfDpvRp-ֳzSN=X4"8ZYYYYJ9!g'arVZJYYYY =+nݧ7s|{ֳzVZjY2P^3.gqs(8ZY=+g{pa%=8z}\< z9igey% +a={- "XЊ˫"6A[CW-(h+y3nU*Jx8@l[`C|=s]TbA_W^/n(/}`ͪGlF/1zWw[ui!^k-/]^:|j?ا'ŶqKW ɋoA47_; '?`ժ'DË9Ux( bon:LO<}I ʥcM4m n+ 67AAXmqstXma(IXWI G7A.珜Bn2APEMbn9MvpnM¸I7 &a$p={ab7+3&GøI7 &a$q0nMb s0|vv̙(Ih7&x$vnM/n6cNqy$1f2˷EBN3 ۜSq6b8سpy!^^ r!^^ f?!ذ.bfKb%K7_mg&Cׯ6K/I%${ŇUżVJҜ91Isb$䰒0ZIVRJJ[Ii+)sbRĤ܉I^Rz* ͨDk/)%e^RKjzI2/1jz WEK֨gj?2^RKG͉/zk>OL_06q`O^_ raO~_ `m'6j?O 7oV೛WnGInuҥk=_B7a\9fxiz0ndŻQny.⽫~`ʃFדGm7I uqZu^ /\=zGy7Ѧd &W>$U?G}PIgl΃` Mi34΃):/y8g2O)^LYѫIjL;wbGnHۯ> 9y}A Da68nH!hAX숇p%mV0Fۣ>-#Â+shA #h-0Sи:,hAX|dN-ha-0Fb ׯS-WYR ZjA!hR=d~k=Kg9lCۚ-;yR'|{Զ~LJeQ zX|bΜg'fYQW-!_=+#c#,rv2_,444볔rCN(gg嬴22rzV!^O:ѳzVZJYM=Kp4ٚz6x~IG}l@GYi=,ޏ?^!r:C-F҂X4SGϐ/6xާ4q1u^0 Zt0^! 眲xi[ n}> K֒~pUry0Ż׿7_/]:LyΣt=2kwKm0owa.bW9c;\2aXo]f¼yRz6?¼yjNys\]Hټxﻘټ2Żl~p }=ټxU懮ĕ]l\la~8͗¼z w!'ܿ vp.~,?1]OKc`A.v~Emq=m`e7(5 n|M:TRO]ǝS͸U‰7MfKx^[%=˹s |Jaʗs'sqO^ ~~KJ3weL|ӞCkxۇxn9l`;r r4eLix7[nodbLûyj({4[D"{7?t4[G"{7ix7D>0qe-7'!/]OnnCûao?\Id懮Q&ws4/Oûh O:$>ڞa{d|if?M{(䧮C׿LW 9˔?g&0KWOëiO{)՗#6~ݷ{1=B"w=݇0v} B;~qf4l^ma>݇0v}ca>݇vixkeh>ǰ{+3*ݧ4vWCcF}fi>ݧ4v}N\ݧ4v_vh>}i/ce쾌״ߺ4)s6}/c5`{aGyޘQe쾌ݗv_}i\Դ{.ݗ2v_kWq4lŜW}/c0 {y{evOv?ʛ8ev_jG^4gix#?ubxݏ}xk7:Lhx#qv_쾴װ0~9o',X[w2~ npY'po7OӁ[h} 2`Ity82빟u˾6{+;F=/ 6x "Λ= q..G8;\y󷮇^Vqz^&yT3s^Ck͗'M|Pqz(⼹xSͻnl.y8o~8?/]yQ< ^G{fiXMGtyLZmhu=4m O]A= \\ORxHSY[f O]O*Gm O]OTolw8TŰA1%0XBKc a,!%İ7u(3[B{0XBKc a,!%q#bq)C-!%2Ц4׋.߆6%4XBNK\<;>% GBޟm08_gm 鍙f ՓgqЖY[pzf-.,[G_rXSCY% zh>kKHc i,!%̻n K4%4XB4g iR[BK8%g e,%2g eʜ%2PjZVz:u mK(c e,%Դ^kX¨-%ԴY& ;e,%2Y[4SYrqHY[$[B{Ct{h>kK@uC[4n֓ m |fKX\Y[nYZB鳄ҖPh kHu Ҭ/_+- .<J8ul O7^Il=ٷ_Oio p9=m_='T MG o2:L0?L<){K){7'*>wn.na}8=_&wēU~Ex.7xi2>.d}a 웶{٘QSGׯP3 xRt(]}c0<8aaxrp^mKׯ\ë8ozrU QӦ }d^Ks^ma>݇0v}ca>Ǵ{wǴQg/}ejca>݇0v}ca>Ǵ{.Ov_|?.}Fm>I4v}/ׯP~}Oci>ݧ4vGmG=jG09 QW=X1>zrU {//^}v{)/v߾1(w>n{ UM&g>ݧ4vœc5zGFO}v_}/c5~5)swnj*ce쾆yoݗ2v_K}/ce쾦sy^}v_GU1}M{.B!,ce쾌ݗv=2bx=rq_d{]zBUd{5sG^^m1l1,v\=*W=>KݗvF_/ƿu'8&YnuTs@V`[I2qav$=-?OOmo:o^'ZϽ|>q瞎L'Q^=Mć]ix8f\蛎=ܴ W@ͫe8n.UjCͫM{ēj^=\lPjs䰚WL{^fēj^mn#n vuyyy ^Wmˋ$j^m .ڼ]&j^m^-m^~tyҫOyRԼz8Uyy^7l~mWm^q46g^=\+>.ͫWxѼzx\&>ƄӼZ4O0ri\."H|'u7&'TfNO>\|=yNe䦝eSsɜix}Nes?ϜM{s*'77pTެ7.e2OytM;ے0^!7iK:s#WzIeӖtśԼKߚ_ 7yKQLWzIfIfIfIfIfIfIfIfIfIfIfIfIfIfIsIϢy5tIƒ.skPWeH+ ;j^񒮘Ӽ%]%]%]%]%칙K4K4K4K4KKOw%e#(j,Fx*ܴGH^!7;ռK2K:i 7t?5U:axҼK:sWzIGYIX17%s&&WzIܴ\ҕJWzIWcIw%KGC o0,ɪ8p%!9a}Bm=۾*_.!~Ij믗)/]>.*/~v)U1_iŶ>_uϧK>󣏫!So]_K׿NS&|绮^ͫ}|7$Q2ǥ|Ii|7n.ݼt=aIp2yecϷ!}ږ{2oRpCO㻹&r4?Lv:_wx0si\e~}I|SmR8FS˴|j{ܐ V)Co bwX~0ەp|Ob_ma,?凱0X~ca,?Ǵ| ~ذ|nC[~hˏafX~Oci,?ׯOa_X~Oci,?姱?W۞`Gm}|oK:j_v1/ݞuzĶ$1Vj|Gg|eՖƗ-;,b#~_mMh|?˭% )姱4sZA\m_:6,hDjOci,?姱47mg9-*/-?S[~2_X~˯a~:zie,嗱_~ӯ;\2_X~/ce,嗱m.b|G,b|״Ŷ1l受nڞ"W[~G^|_mi|Y>|_mCO;,DĖ\0:qi|嗱|bð|b{_}?m0džsKmWZ~Җ_hkXAXˀC&ㅥY njR1fҽn։Ŗ dַT|7ܲ9~8x77l~b.0p#D=O?\l;޸otrz ;yzƙ8o. `bƙ8?\PS7q\Fy-}S7ENqzsЍŖ燓nlnl#tƭEd|'B=͖nBS~\fX7 Kކ=,xZ7'%N}.`_IE.L2Ryz(7B.nяޤ z yq=a yX8kKc a,!%0XBLKQ%Eg;F=MB7%0XBKc 1-al ΰ%aЖbXXBK(nx3ð4XBKHc 9,a>%\hK@R\I`X/F.nEޤ ;Rx*& g-yg78kK@.n8kK@npR%\%4P'tC[BKHc i,!YB4g -!%piԖ,%2P,YB2PXB K(Λ=-%2PjZ8kK(c e,%į8/-%2Y[2S%▗=l QO(8kK8q֖\<9+'E% hDn`K(.-%>K(m 5,FKXCWŸW%oƭNƽN2+Qkv.HOm.I.vIAvpI֟.=O(T'Y T{BjqIotOWO7b|7@#?uyĪ˖? ca,?凱0X~ca,?s=a'Y/[_=*W[~ca,?凱0X~ˏi4eoMa0Z~hm1,o Oci,?+ׯdX~Oci,?姱?o?WO@.\o wX>ՖtՓb|#O]zU>NX~Oci,?^e/.X-?姱4X~Nzs\_v[-?siԖ,嗱2_kX"kX_=:,嗱2_~ՓX~/ce,嗱2_7mg5-˫'Vj/c5- N˖? 7,˫'Vj/ce,y2X[>r$_}\<)+W[>SjG.^x[Ջ͇Ֆ_',jX˖?'ѵ#OKOOgN˖\?=-؆!W[~i/}_kX>׍eS=d2OBƿu[,'v"'Yg?yzh>?⼹z D,ƙ y>Nq|)ΛKCqܴDϛ41 )F_*c^ڭ]Q)-xRvXNj֖t=a _a'/1\kKc a,!%0XBKi qdl A-!%%4QObě%4XBKa zO% ΑB7ERyt{7E%Wqg i,<=IɖKG}{Xo\B糶4rZ|糶4XBKHc iҜ%9KHm 9, R%2Pʜ%9K(sPXBKa 'V1joGm e,%2Pzb*c e,%.c e,%[b>KCY[|IJoK@糶 N1YrS?gm 8Kgm Փb>KK(}PjXA-a >.}~1K0.+gSg%;4n-]G 0rm.|S\7J=}œ=>OO1O:b|uXz6/B mUK36 p@Gz8M{|6hǥ Tfm;S|NhsM?g ENh - A`'I;16ԍgh&'r0>69G_]ܞ{VJP &gu na-Q7{8K-1ԭQhs@Z¨[u na--ng^mhu na-Q0CڽPq(@nA-P7;&guKn9mq=-9Սyi-Pѯf9 /ɉ\<_2 =Xo vb'' x^ji x0DL VP1 @z톼O ni-PCOq=e -YYYVvFuKv+neԭYYYP?"0ԍyeԭQ2VFjۨn5-<Ňŭ=:0fq+#ne x3?z\lu qcNG[q+#nrtC.؋n-#IbhmC#ʭQВ7CCJK6|3nK%S{.Ol^;‹i4;s >"_WL62ǭl?O:́0 ؼoXN4eKظ-`n'2 K72Ll7qi67Q/9 x8ee/E>X|u+ p, ~$_|mp2Ymp ?M-_wGe{ =^|i>O \9p=Ge6]^ڕc1^ס^K8{ c/a% {{ Q 0^K{ g/a%Ĵn K}^0Kh{a/x{ n{Ic/i%q߯ի঱4^r 䴗Qh\ m/qOg{_=G7@ _|} O m ya/\@ rm/Mg/{h{Ic/i%.OR\~R{Ic/i%K4g/i^RK{9>{)c/e쥌2g/e^ʜ9{i/\anLOӯf/e쥌2R^KM{mV^<lx1q2R]ʸ .S2ǥNP?O悼Cm.{ O]OR p%1\,>._{ oނAzKSrFoYCJPQz~jͲO]}sjV7gT0钌Ol OTJ+^ڈBp=ȯ@qQڈB p{NQ^W|}OqySPl~ڈ bNڼt=e=\p=? ziJڼppʰK/S?e՛ ڼg)> ,A6>૕Ib{f^ڈ?b^ɡ 9x=p°=-yc[SKף6 na-M݀8OЮ䍡n3biu na-S0CF)@C𪷘An0"@Z¨[u na-T7.O6 Fu n1 اQ4SݸgroOni-q;T7h, y~ u~ŧ<Ǩ ڈ?&{iuNYk`ꆜ 8m4k7}iuKni-{ u4Q4k4k4kC¨nneԭQ2k2k2kv2msyľQ2VFjӖ&5mCauKO+ŭ7-nOK7G/[ry?Zh[m+m)/S?^!ίm\4VZJjhIm -72c/8^cV*9(gKxބ{%=wiïE78ޓ@4ɛ \miK~dqNo~ci:|'~z0JӔ}S}1W}5sڡ/`s:<Ӕ_lw"6qR\l |epJͳMžt~x?ף.9%A|u+ po-+pv9O\mO6?Li28i:|@{ 4^Fy1}drm/}5^7{v2B*{Ni/i0^K{ c/1v暘2)^F=m/a%0^K{i/ Ja^4^K{)0974^r8) Gvo2/;h{ڡ/@ 3] f/Ӕ܏ {b Ex0{4^r `{).q}^K4g/i^ҜrF{I}R^K{)c/e^ʜ9{)sR^֨_9mPR]ʸKw).eܥt.O'/5eԯ6s/U\ʘKs)c.exؘ.]bs~@e 渧9iK_ p\/]ڠ/>wAA_ǥkoAQҧ.5$޲6PfYwnupW`91t~ҽ<_nruW?\)) iN7}}oHv7R4o.nmn.ns b|nܴG= wsq7Nb|7wn1>䰹{'w8\^yww>1 8_uP=/ʌՇn^m>l "^߅Jm .7]4^X֒O ۽2;\^|Dm9=)9i=GsX̘;a탋{c 8=o qjoGnI_pގmGs_>b|~igx{ ox{oa=0cz;K}VE{܆q1~_a=0x{oa=s;ga}|ۃ0z{hoxsx{oOi=㪯< /;x{oO9}4Q7Q48vekx g15xxMv4ہgv=nہW|#/_su?[joG#y"y;n-W4ޞx{o\^}G/{{ nڣ=qPEszU^z{o?>o/e2^q7p nک!sݦǹs2hĹÜu^x{o/e2^۹|b|y{Mo? hN޶ m(e2ay\}ih?p@>oGǗ=*wx੹fvb_eƔ_7v꽁c톼Ly\^=j+W{;SWz{~Fo_o]#qĕ},5H,C&yHQ#KC\'o?y^ȷ-?O_|n$/<\l[ /?u{ڒ-ۋ*瞇_~z޽A{l`s|lt{i4?x4f6{;7?t=#^m< [Zj6vJW$>;pQY磴j.v8/SwU,˟~?(+ \j}z'`{mlGyC/h{A6^t==1ΰMŴ`>o`{x|>< Gsm/Gzj^F>^i/a%0^KL{ᆊ7< {j|>;@K{ c/a%0^8n2q= ^b ؜^K{a/ŭS\S4^K{a/\崗m/G׿f=4^R^{ OS#^85xa/8#^SސQh{Ic/i%䴗p?=e^K4g/i^ҜrF{I}R^K{)c/e^ʜ9{)sR^(?Iα.\ݥq2R]ʸKw.\O^j|3TgsY|\ /m.e̥ OS_ p mCOS_{ C⯽ 覷 T S~{x ?qŽ-)[J0z|07цo!p x-u/Q7usB-Q7O5& ڥң?G8=JibG~?Up3?4 gr1@hty,m C|> >.Yn'M|6|>peCb۝n4J0na-Qcu-VQ4C݊f^xQ4CT7Z݀S|X#;RZʈ_Z܀T~/6|@AGkRJjhIm -9_J8_JxV2+b (wAچؗ{ ?\l ysǀ G.ڠO1ɀo6 b68#?ty_ x3'yj~@ `s]]ss\J6yߋ)}miڟ/`ex*WEl㰹iڇ/`sC鎩"67 'T]'nŰvew_iWo .`Lې n6e8.^b /]^g{Y\K0E {z榽0^K8{ c/1*` ^Q0ea%0^K8{ c/1,>]G&^b ^^K{a/oxNqj4^K{/賗Gv!҇ Շ#OpoO2ʋb /]^g/)^"<=ݞf/)04H%2xFy_$4%K4g/%pig/e쥌2RK2g/5eq{pOn5݅Fd.eܥq2R]ʸKMww"..\^mR]ʸ @vb?˨pQO/zhszK "\o]Ms6]/S؈/? ~ j#[*[J0z|>fGu3u꜌[ݜSƭݜPxGkeV7O ҷ`6kR۸.LExP2Oȯ}|enНW+m~M\|JhsG~B7TvK<nLټo4߼O?p=4N<ڜ&:S 7&S7h%5Nڼ >D\mꆼt=mrocMN>?1ԍܘ b#>QF¨ruT|XtVv^L na-Q0NbX|HMn|~oFM na-Q0FbI1X݂0[hunx{[uKn9ԭ&-S6L-!.>`궸6989[uC>?&P7.OY݂Cꆜ&^!O -Qv0/FҨ[[[[juˡnaTk2VFʨ[[[[ uk1'\?\[q+#neĭ7.6)n'4q2VFʈE5 yzh q;gW,n_(VFhr]̟m\^|A@͟m'4mŃbHm+rm'aԶ5`e.ƿY Oʃqk ]0N[Kzz֛x7/_㖋 Q0] ?\߆~śyWPկޯ~ԯ~e01^ix=^ix%CJ^UԯZ*רUܯ6mѯE:_,QzTr$wp_G=eme\ z$żt1o&I$i$mIʜk$)2ǥI&Ic$i{Ixq29N0I#I_|$Mi4MI4I&I$i$Mic8xt_:I$i$Mi4MI4I&Ix$E.vI&I$i$Mi4MII:IS'i$-eFb˧IjLR<^&I$i$0rFNq|NLI2IZ#Is1I=ԯx-K')p^".rs\/NPd^HRyE/_S^gseʋ6">n l~_f2ͯs(@@$\lW~$Co)@7Tfm9Nz8͠)@ksN16\lz$,m(x<8VGo+_Ôkނ|Ya⍛">c Xbg1hC.6H !c7n c~ŧm`*6ʿ5o*F¨Xb7nb\Vz^ 31E,"j0XK#biD,4"F҈XK#biD,1Ś">ZĀS|!hC2+-bŋ5E|o"Gr"!bȗn?GXK#biD,4"F҈XK#biD,"ZʈX+#beDV(/aIXC"WD|2"VSĊ/0g5U|U]*Hp@9HQ֔1WF(@CF-c{3J }F\sS ֱ\QHX3:q0d|%nNd|-<nu󕞳<1-Y(J&zwx.Obȶty$=_Aj__Aj_~Iq~ԯ+_\?+_xKWQ〢_GWQyX_v<,ӯE?_)Wx 3t[IsSG4\$m|ƠL7sIG4&s$~$ WU-ѯ\$ 1t~ܑ\ƋXM4^:I$i$e|5M4MI4I&I$i$Mi4MIR8$NI4MI4I&I$i$Miy/_=4^:I$i$Mi4MI4I&IS'i$MeLIҚIZqk&)W&s$-efr,"',2IZ&I$i$m%DrFv~/[Cf*Wgh{ïh=B?\#9m4 Re9𽁍;@6"@) F*@+@;F\ቺïd.6p ǽwm. yW|N)/#p@hG/Rhw=_$&g/"|(&s̜W# ^-~2Ɯ3dl2f3T_YE">ZŐ}/CłG$P7㾸=j?Z¨X b1U9V?Gg؛y?,bS|0"Fbo(biD,4"F҈XK#biD,4"FĀS|!"G&b"-bkxD|!"E G$1naKGXK#biD,4"F҈XK#biD,"VFʈX+#b5DRb(kXo*V܁܁tei+beTTbNg5d]k2_CƂ;vZAڵ0 -cF"1%(/ 4duŧHg^S2N: :V60X3:! _0/ɥ/l `[x~`xg<-½>:~y#~Ҝl~œF.[pOaifWAqn-E79E7(O_qnE1)13^q~8jsqTysJygsqU47qTWENL+%y׷117=⼹o&&nEq;_*Q,=W8X}k8XiU]L ` tEZ䑿5?{܆3/S^]qfoW1)Oag5؏'E["˔WWE38ȯߦ(0"FÈ|){DY^!oo>!8k#1Dխ7a4"Fӈ|O#iD>ȧ4"Fӈ|O#iD>ȧyeʫ"Z䁫"Z4o"\q"ĭ|^.E8Y<)/E΋8kO#iD>ȧ4"Fӈ|O#iD>ȧ4"Fӈ|jO-Eȗ2"_Fˈ| owppksf"GR2"_Fˈ|M/ožbs0̴.98ȷ{"Z䑋{"ZSoS^Cy@ cXҎA!t+y=wCmϽ~?qՕ!baD,1&"F҈XK#biD,4"F҈XK#biD -E x߆hCTWE|1eS|hCE 9zϦ4"F҈XK#biD,4"F҈XK-bE,2"VFʈX kW1nֻ5T.Ɓ;вQ2*VFjX1hUeMk"@,cZ1=@ZƀSe /3h7TiSh^:u K3JI3t.~B|VH+}FYC*'ayC@H,):9 nܣtg6^rupN@n^N_~?a./ac!~a~ bWpw=ԯ4Jӯ4Jӯ4Jӯ4Jӯ4*ӯ~]Wqy?Xâ~~_5ٰIW#IڿIy "?t{Zp}_W;HR./b?v<_d ~Lo{PE6_Go{I|n#RyyOl^mbm's{ï"9s{  @ ex}6"56vH͠S6XaW;U;^QF^H |/(+/)ESƐt{ZG+?dl2|iM2v26}D*>ZƐ8 4!coW|} 瓼S¨Xb=>b튎P{|X(?E, |5ME,4"F҈XK#biD,4"F҈2E 3'!p1i}D*>ZĐ8hC"-b)>ZĐE |Rup?Z҈XK#biD,4"F҈XK#biD,"VFʈX+#b5D] =__Q.U,bќeTQ*V)@bP|q{61>+hC^|@ZŀG41>HN }FYSƸ=j kj"@ZƐi. d(AmXhSu]Dd+}FYCj!D$㱿i^7'ɸӛzɓ;EnyVʧt@]G{R ϶)[̯0Ҿ{AjEAF9կ(^JW >_ԯQ+M*ӯǫ*ӯǫ*ӯ~ kQ;aU ^A.A>NʆCRtL`.a_ͩ_m0I&Ic&i0m8I$~x$ a4f65^#IxqnUtIIriL4I&I$i$Mi4MI4I&I}DcЁANI&I$i$Mi4MI4INRljtI4I&I$i$Mi4MNI:I$i$-5]%p|})L2IZ&Ik&i~n$=QЯ?GK'i$̏ONRޭ'i I|I^]_#I%rF5RzԺL½ǸchV³`Zc{Kx?)|ض?O:!/?|^_< ~X2g{η`|@*>5D*>O|=@bQ6|GM|]HMڼgCs@>.M)46ǻ{|.>_3ʋ]Ajľ&ڼt(@tOu]9ʋ ƂƏQߺ="_=/sܣt=ss-rs285bH.m/M{^o]?ş%).Mp{q]¸Kw .1eq=a.'Sf.a%12x?K-%10\N=-K[xKo-[bxI%4ޒ[rzc[Fys,rxK,/SԼmoI-i% y p?{KpbN7.D2m 8%Kq4\F9 >uAn:y}q4]ҸKNw4.5ʛRS4.iN]K{Ic/i%䰗խ$R^K{)c/eN]ʜ9u)sR^K{)c/5`Kƚ2ʋWk{)c/e쥦pK2y"^K{i/|LeoN{A@ pJ}.c/9a:| i|Sh{Aۣ8 >yAL;i t2esyg/=*+9tY7+O2~XnN`<_9%%f? ڈ?? y7ќ-< 9H܀Fsn{5 FrgP7.O3HҬҨ[uKn-qZʨ[u+neVneVneVneԭQ0,nOK2VFʨ[MuzW,nԭT7>=OZ!H/ݐϯ խQ6:L n]K3H.Omq{(>RJJ[ uË8Vf<_:++XxrG͸U#/P~'o|6Ԝ'o.6pot;KwXOӱQ^_J"NO\lp߼χӣ(Gm [C߼t= "67X0~խ$|5E}62 ^cpn\F|[AY C2xp.z; kwA^-n.m? "\\y\<m.a%1\P2ʛ_\˜Ksi.6ks c.a%4y-K[xKo-[bxI%4ޒ[rxKq/囶QO_84ô?YKsIc.iyo6佝\O]t}1]bW;E wPevRSnF|] 7]ҸKw.\ݥa6Ч.iN]K{Ic/i%䰗խ$R^K{)c/eN]ʜ9u)sR^K{)c/5쥸wwa/~C_ 2R^4^Fzm/^" Sׯv ؈/` S^lE\m O^S tXm R|g/=*P[QYvF~N`[ԥ;g<_q{' z*Wo.ޔr!Ksڏyƻ/Fo~b{R ]Ń߼}W|p!h|m+1Wnn.n}aڣ`㻹'cKS}A&>g4y;18'ᔿh㲹'ᔿnOb|7Zyyq8\?0wQ㻹/Ik)\Wo)6rΝҜGގ\ܔ0Oc18w/_zv&>gMyusS/{{)9i)W{;r탿5oG^$b|#+ o榼y*wx;s]a=~2?ڸ ocI"0x{LoܔWoIkP"0O\^=n%W{{o11z{ o? 4ޞx{oUU3xkhoo7q ~. ù3xW%4ޞۑ޲_hb|.G[voy;>ϵ#? 7u8hoGnʫ[b|W-m1ۑx(Ov&_i=4ޞsz;W^_}ޞۃ94ޞx{oO9 |6 2^x{oB8w7hoGNCb|y;>ۑx$Uvގ\|h|j<C&yHQԥ^$Ը=*Go{։ţߜ"œH]~"~?M=q ;yAؼp/1x=\ΆQ44S94<]ݼsQţ"6n'eh ) Y͗.Op\<+2`*qhE<`kIa/n3-_Koh{A.ecw##DZ~-ohwA~{<0WwE]][q)]GK ^"\7si.A|a.\00\bldsi_{Ko -a%0Ww1's谈0[bz({Q-\4Rw%[xKoI-i%ׯcm9e?u;-t14\ۻbW\5 i8 >uAgv]Ҹ ehw>Pi r}tL}EM 4^K{i/攜iKS4.i%4^rAj}zu%v+5 Ro/$J Dk,CR$2spy1\^ Oß.?] ty1\^./<rGVu;0~~8C?;N@? ȗ3Gn//8_^./KoV_}*狮x-U|=P9\Vi=͟ߙy||7g~><ޯ<|f+grg},As?ylA5y?g~?y?w^?<}4;}gBCcsۑr +sg3m~Öa#ztČ_k3ދF@KF5C>x̝O&\.n3ͦU~k|*ns?cw6[Aq]f>,nׇBVPjkֶirm+mj[mjLj&m&mZs??g^;>wnmi\MP܎g}4A=3:(߹ygrrq;Fvrq;?OQ|vSDrq;rq7Aq.n3l7çswn&n\ݴsSnfnfs3ܹ T ͫy ߙwuuk]!kwu[OO?\ݎ|Ou;PݼUgru;s3 o<|>!M\<| LY~&dnnͫO9]2Q${'G|d_;|w2OG| ׆c;?:aq{W>!7Y >?z?gGw7 }8,?O@3w}Z3}XN;?_`>g S?_\sx{}~1޹`?{9sNw÷]'`yXN; x'T~?Mw~;?M|wC xPѡ3~/׌?[׺OR~{y }r|BuyUμ`}n3W\\W}X?_]|B@y]]{!~|u9Ժ SKեRpu}u5/\?_\ ..Kr>O/.K?s>^[zrB4RR#>--3>-k"-Zj?,?3{7^<~A'_\yq9}_܏|yqY..k>˙l#/.g~o^ƞ^\{~/?gN˙/0W3 WEpuѾ̟;.yX1Dgn}<+3 GwǮR:_T# F>:?CmzJϱ0=;5=~OW.V>лab)4޹!o>:7;;7O x_#~#ш Vߟ8G>~"W3W딳?f\܎[ܐq [Aq+(nGv.c[O?VP [1aVP j[V37ɵԶڵcc3~rm+mVmVmYMPMy',ĿsӮm+.&(n&(ngnyKRs?ׅGVsER&(ngrq;gxwnG~ݹ@9 vu{<~F@Mp&sT7AuT7U^#>ܔ wn;7Cu3T7SunB ?=8 Pݼ>,ߗ^Cu3T7Cun+??=ۑTݼ_H(W37nG~A \ݎ| \Uf>PnnͫO9cQ {Ւgq5{'sKN|2F|=x?sa]W_>ݙog|W}3w5>噿?q<ϙ?nKp\ϗq<%8.p:v5w3˟W?n9If$y~'i$-&zd5I5W}^$LR$՚幟|%\I'$}&a&Jj+Jj&a&$]Ǖ^T=sgJjIj^tgWzMҟ󕯤ޓk<vkJk3̓}AMf׾f|w5<,"fsou/*}Gs;w<|tе(t;EyXsvz;͟Z5;pw;G>zwęz z磃 w~wPx#!q:V3pձ}Xz;>/ߙsV@:]c5{wjױ%ױ:VP ؑua%?5KkVU XA+(c:?XYŮ'1r+bUծbF"kfEV;ЬN1A1"s*=Ig.E|'3+qV;?Yo uP uP 7c1͘fp3f3܌n uP uPǼzױ}X'ߌyy3f(cgD3O.cG~3?f̫oƼ,\<, ;_UqEw"|3|3֫Ԍqחt}w9V|{J=ϛfܧj84q\?p\=_#>~_\{?:ΙۧuDs'iIz>]Z#I=I_3?_kOҹU&hU0$=sGw+$+` &`jMRZtn]I>|%LR$LRI=$ۏ󕯤+$՚WR$5LR$5\I WRÕp%5\I WR$5LR$s?kWRIzI&a&$]Ǖ^tyWR$=s~WyX+_IJ|&kUt,y{__|,y+_;/C#yc;F]zy<(t;;tvZ`:VZt:蝟ra!QAw~8(|t;>._a?@^0'|Pw>л^Zt??/UǮo9v~9 k?<>$ױ3V/X2XMX쟚?QXP XA+(cGYUlm[*V3gUUTUl?OYU|"gVkϪOZ_ObUv5,bgYjI*b"&(b"U<~xwvX7cU34W3_ :(W#O B**ߌ|3v͘Y<,$ #hϏ#yXHFP;f_? ʘi@ymܴ( |3&ScZu5fP uP up3f3܌n 7c1͘fP eP e̻Ï7cel|3UŮar;(|3v毼(|3U~֧1*v>T ؙ o<_ZU?fuhf̹9ߌ9ߌ*?W_ff8"7J3=9j+oh{7Z5w'~Wy{^syZw+c};?yxpuJZ?s33?F?_C?1;u>*;?C?S~~hwyGA?yx\+{~^ۇǨ1?jw~gC?R+o֏:~~~A^~o?q?/U䯧ɪXr>G"G>c=*+O{I+_Ef~6*+?'őus?sV_ irYxW_r7l"_P |"??sUϧW_yx:.>? 9"_Pkc<"{*jgUϧ kyOn^d<\G늬]W"gcC?"溎w C?"w>g/zԣgs?=s.Gwg<<~wg0syAyA.s=xg?'w 9 wE^ȿFPG w;yÝNp'o7 w"o("o("]/IB?;y"?as.+? Eu˹yZWs?WW@~\<7+o?yܼ͎Hk{t^!to>:蝟k<}dw~젹OG6\<ͿwEgۆz|~ۆzMA;o?:蝇7g}|t;|\co~F8׈9תck?{r;}uw?כ3~asyxg e3|\fWjWy?\UTUl?xG"v>1cۏEEl?]xgYj*b"&(b"U]ãAy"AK陿 oe:Ay"ɣVۏ7cg>:(ߌ ꘠ ꘠iױ? ??=]͘fLp3\Ǵk͘꘡fp3f3܌n 7c1͘ʘʘwIiC126+= o U͹~HIU7c^Ul|3f(bg"vۏ7cg7O;s݌XĜoƜoz׌SγΎ^hq=ʽ9׾;9}}}X/?i}z|}z<ܟ(|<>z^wW㪙/|WZq|aq Kp\%8.q p\u=s>8CI}88G|:>x4Ot$=ϼi:gўU#98'iIz>YT0ITkzuVI:T{II?k0iq\=3+_I&+` &`jOZtn?+_I< Ǖ'`jOҕpNRz0TyjM׈+a&a+Jj+a&azOҕwWzMWIjޓtMq+$=Ǖ'?~ƺ|%={+$u:_I{M׌)kJ՟_9οN;idvg|߆coG=E_yX_/@-wO닾{;{3yD9;"/::>t;̝OB?1:A?l{(;@~Fzc6E~=@7OˈGsIˈz磃~򌟂/UǮ'g/u™EyXzgYulϥbEgG2~c}ZG'2vaQY~և2v>3ص'U~'|W+(cevO?ODB*fĄUTUl?X6X,bde1A1A*bO#yEfLyץBh(# oƎ|ObG>g3W3ˋB*晏;1͘ ʘ ʘv[gG2}XF܌ nƔV{31C31C3܌n 7c1͘fp3f31C31C.c+u3]aQ|3]·ar;{2vCkz(O*c5i}Q\\Ŏ<# 'ߌyuDa䛱#bssU^3IEҌ{#=ߊ3F}k(P~m8uD>~{~;?Gϕvn3߅=|q뎮㪑uDq?s׹>'qyq%8.Zq ?|O>_'לӨt$-$;ל5s֚S=IT0I&~:r\WRI:WeL3I?}g$2kOҙ_Y0IT0I'~|ؒ+_I|V ̮mrwտ?++q22222RTF*#Hg3|ϟs +q22222RTF*#Hg3>PsX9v;ŕHe2RtF:#HgdgdgdgdgdgW'ʱs)TF*#He3tF:#;#;#;#;#;#u rw+#+#+#+#+#He2RtF:# rw+#+#+#+#+#He2RtF:#>!VNqedededede2RTF*#Hg3|+3OcS\YYYYTF*#Hg3tFvFvFvFvFvF> rw+#+#+#+#+#He2RtF:# zlb9WFVFVFVFVF*#He2tF:#cMa!p nWp\W5p \5p nb!p nWp\W5p \5p n'Ic!p nWp\W5p \5p n~T rC1/p + kk6p nW_~6rAn;n[p\Wp \5p nm>+-S. yǼ[-p + km6p g\}%if!p nWp\W5p \5p nd?L 7n[- + knm6pq/~rAn;n[p\Wp \5p nm>o^*ܐw n+ +k n}Y~z.rAn;n[p\Wp \5p nm> \y[-p\Wp\5p \m6pϸ~.rAn;n[p\Wp \5p nm>)䆼c^-p \Wp\5p \m6p 3sє rC1/p + kk6p nW}h!p nWp\W5p \5p nW\y[-p\Wp\5p \m6pϸ7Ҽ\y[-p\Wp\5p \m6pϸ5B. yǼ[-p + km6p g\}}{ rC1/p + kk6p n`)䆼c^-p \Wp\5p \m6p 3 h!p nWp\W5p \5p n)䆼c^-p \Wp\5p \m6p 3~.rAn;n[p\Wp \5p nm>q?M 7n[- + knm6pqW\y[-p\Wp\5p \m6pϸWz?M 7n[- + knm6pqw 5B. yǼ[-p + km6p g\{\\y[-p\Wp\5p \m6pϸOqrAn;n[p\Wp \5p nm>?h!p nWp\W5p \5p n/~.rAn;n[p\Wp \5p nm>kgh!p nWp\W5p \5p n\y[-p\Wp\5p \m6pϸjES. yǼ[-p + km6p g\2\y[-p\Wp\5p \m6pϸz}h!p nWp\W5p \5p n|=M 7n[- + knm6pq+_ES. yǼ[-p + km6p g\}~h!p nWp\W5p \5p nZ 7n[- + knm6pqES. yǼ[-p + km6p g\}l?M 7n[- + knm6pqsє rC1/p + kk6p nW_h!p nWp\W5p \5p n\4ܐw n+ +k n}+_ES. yǼ[-p + km6p g\}|h!p nWp\W5p \5p n_z.rAn;n[p\Wp \5p nm>+EC. yǼ[-p + km6p g=M 7n[- + knm6pqES. yǼ[-p + km6p g\}l?M 7n[- + knm6pq})䆼c^-p \Wp\5p \m6p 3+_ES. yǼ[-p + km6p g\)䆼c^-p \Wp\5p \m6p 3^_z.rAn;n[p\Wp \5p nm>+_ES. yǼ[-p + km6p g\sє rC1/p + kk6p nW_~.rAn;n[p\Wp \5p nm~YES. yǼ[-p + km6p g\}Asє rC1/p + kk6p nWvw?M 7n[- + knm6pq|=M 7n[- + knm6pq_z.rAn;n[p\Wp \5p nm>꿯|=M 7n[- + knm6pqsє rC1/p + kk6p nW_z.rAn;n[p\Wp \5p nm>W\y[-p\Wp\5p \m6pϸsѐ rC1/p + kk6p n{\ϟ\4ܐw n+ +k nۉ?~D E"x^Ep\Mp7M&x o:w j05tn(E"."n& n7M&x{pA`jP/Ep\Ep7Mpo7M&N4bй^/"." n& o7M;LiQsC^/Ep\Ep7Mp o7χiQsC^/Ep\Ep7Mp o7*VpA`jP/Ep\Ep7Mpo7M&\l5:7E"x\Ep\7Mp7M&x <ߥD E"x^Ep\Mp7M&x oOpA`jP/Ep\Ep7Mpo7M&Eblih)4(4(4(4(4 Bh`40      %_D~"e>_H ~%$^_L ~5& _NaРРРР@h 4 Fh`4h4h4h4h4h4xF"-cKCKAAAA@h 4 FhhhhhhD|[-ƖBBBBB@h 4 FѠѠѠѠѠ#[- -B@h 40 FAAAAA3Hn[Z B@h`40 FFFFFFg$⛑"l14 Bh`40 HW&Eblih)4(4(4(4(4 Bh`40      RrRhPhPhPhPh 4 Bh`4044444Γ-mТ_txxؽ7<<3O_?Ϳy~ǧo?=O~?O_2~_~w?=?ywO^__~OOyۯ/Ow/O?=|??)?~?~~矿_O(? 9}w|ן]UWN}Ȼy!>݇wC{y7޼כz^o{]y+u彮ו^W{y?=yꞧyꞧ螏螏qu{\ם;=Ͽ͗~y/??7?O~><㯗_~Ws~?ӿ|Q~/_1?׿^׫ ~wDžﮆUӪ2jXnXnXnXnZnZnZnZ,W+˕~߭Ue԰ܴܴܴܴܰܰܰ\Y,W+7[Mʨaaaaiiii\Y,Wᯬ[Mʨaaaaiiii\Y,W_&շ6~ 8k_՗O~S@⯩2S:։ƫo%߰Nu⨃8q q;o5Ufj>ZDZ{m8Һ LSFC|;/4Rg֔Z I^N{9)jڹxgU5DzC~id5/Di\Xzߧܛָ"W[n3UhdcQfZ7QbڰΛ䣰n]l33<̞tי_OCٹl!^rg]Seu"G7o3Gĸg'x!ʝuM2VON{ړlWO~kN0棂|cF.5vgGo]}[}ntYIU;1߳Ó1gk԰NuM9։pxqq'X棌gӞ#gӅ.䣄g|Tl(6gzbYSj}6ď&y;W%sWy?zu蒍4\5UfjX+[qzkEX+:?:+∹u,"?Hw&8QjQB>JX6fjT0(P4R.ĚS!~muEߧwZ6{kU}4|kh5sGXZwԬ7"Fvօlu;@?䗆61;9u^~3խVͶ|zy;(m0A[L/馎T˧ƯS5h_Nwi7{gSθO<\_-r[`M}8ޚkNqg9gfkM<5]%'վ[|rVɚ܆'ϴ=ߔ:n&bI }0lXH _u"Đ/,,^}<ୗ^V}69Yn(y]ޟK]nG{[@fU{sXxV_hhj=>؇g}ЭgEβ5} X1SѾ+OEزzaO+O0ҪmzSnnҮW3֮*Eަ_nV}o9nڧ/-n#{o)zǡ):qo|[omzS:;OMۗc |wgԳwN֪66{)OSxr>GuOO9)!/e9ܳfxM]xoN4`)rTf<5>]%8'ݧ[}zvZܦT}*Vgv)_R pnYtg":`8TPiluöʁgMLMƔբeg"|&gr.oOTdCC[ߧ !}KTCOs=F; 0u}xkN}soN9U> i`j7fMo.rw&(| '(|WC?C6^Vė<}jSʸfO5=Ynr@u}ܤaҀJNqY> 7;7Kn'fKn7)g"|&g"=C6r+}.7!i:Cώ 5=Ynr@u}s-ҀJ>|A>T rsyUmmvϻwє3D>L3_mq}>e!5ܟG;9>ՋRhOPg@E~CҀJ>G߻,Ffo)k $xS?z4ȯk̖MLmJck??#vo Ohdd;rcr|iQ/a񿫅7!>!T?ՋR[~Y`MUztxo):q7t9}޿40闛 nn.,:q^I n}"Kts͒4ܾZyP>C6?3O̭+p_/qKK. {Zj-}p_kщ3a EVi/0Anv7 }np7E'x=PYo\gkyѪt큤1|uuN.eՕJ^i.(G7% 9ɚo)}SSt`zXn&Yq?,7,x {7sCZ_[Oז\ ZܦfϊnC{s?b. K=gVKJaG;G_~}pU5 ]cmSy<(eznxPt }(xSAs4Ģ'xV}C5%xYC,ȯɚeYJӀzhS_;!vx9ݮ)|49&SNr-7;րZ}6CLZt`M(Oˁ rIunzp7E'kk)k{pfڧrv?L~ozukq}}93GYZt' kBNrI{tӭ):qƓȯzS:[˛%oܙݻ{WW{}ߊKg>8 \ ?n;58!: p{}pfND߻Nmbf}抰Lp#LpnE~]爪K^7)Cz۔w!KK9.Q_[Y=?٭,):gf5֢X^M5֢.+^&lٹ!JҘ:wf10eL3D>L3zkj=s;c,>9b3N; z5?4{{ sSV޻ջNщ~l;}o`kqsgr?;+!=3AOP>Aȗ.֗t__+p᧜q')wJ3[nv@}ܱ޿5Zt;5W rsy3 UZ̔3D>L38Kqg=pr ?6kz=[nv@}3րZ>|kB'ffېw)g"|&g"[r$X~?7**}ٳfPkџGzBZ罕-SVL=[nv.ob틔YiLiϻҔ3D>L3r{N.[f0 O9 uG5SV9N;EoxwNa pEئZ\rfZ0+){޽g '(| 'xuӺctsYcRs~'rnj=[nv@}ܱ@8wbkBo ff<Ѭtɭ{N9eL3D>L3ziݱnz楬NLb$U1| mZ;}ܱ(lw);>ئ16fqs,6uΨVz:gt3AOP>A~ntk9к?3e9Ӻ97w=&DMk̿ YXҦxP]o3ly>4= hL-9g粬= -9UOmԇuΖO>?dO>ʁ֏oZ)[f3jU0\g5֢_YmZNkFÛP ٹYr;2+]rw|&g"|&\==G7=^}39S: cf5֢{Co:րZNq&j0Anv.o|*0gv)g"|&g"u8[Y,C(ez;6 vl _sIN;EwOiޝw>|N;Ew{<iLY\:RMyyަf{OP>AO+_skϏo@{???G'a{Ϧ|aJrԴZ.ww&(yz_|b)4-Qꯓ+\rXyǔ'3#,|&g"|&׻?uKwy8l=pz E'N;Ku?t{;5S0cv|{ewyǧq*-=!}G>1\ۘ˘۔YێL<~r;OP>AOP>iݤ9's|/q7Ս{85 ި8{ѝO)X[O*;ٺ۔ۭoSD>L3D>ݯu:\^p\A#ПM~m.{85ޢ8.} %sox[&[Wryr=M.|&g"|&\w+ ]_ʡ7GIOyx1fǩiX%]tޘc8P>%m%WKn39{MY>L3D>Ly*'Ϻ8.秜˙?z!O?u|{ewj+c׵8dw{\ܦ|*͙xL}M<OP>AOP>!_}要_r.}Oqc.r?r=[nv7xwkS5϶6uI?t}bېٕ2nWG7["7㸰sxofqL928D\ܦRoSng)=3AOP>Az%rTr:}qo$j%DMk̿ yi]]Qu8G7q魫 px{85_W~x9O3NOW+?z۔׉~:'؟g,|&g"|&=p}˗ҿg9>)gSs|aJ/r41G{5ۛoqC\>h?^lMZoCgK^w3Ғ3D>L3xZc=o$ٮq| meqޏK;070|fq\;< |fql<6ܹM͞ކgoC{g '(| 'xue~]۟&?ts3oMێʟgf&^S{o>G7=9-rc)n9;5Yhm_v.|qz3|gJN vuO8G߻r>ts4[;A p]U?_z7,:q_ p3͢uovrs˛%mYiLX{޽g '(| 'xusYqf>>k]i8Gߝ|w){o)}:whM M_wo|*:gv9eL3D>L3z६mLC3M_{39spbo#-7;o>?G7O˛o>|M_ M_woNJoS^f{ig"|&grFuonmz6^=`G7OT_R51?>y<+ɻlgEg?YgEtY_wٹ,MgO}lԓ{G'l~w[YY^U <'~y7g&?7Tuٕ3Ҕ3D>L3[Y>G7;w7>{|pOn581yƻfIqfǝ2 pnGE~ݍY\:RM͞ަf{OP>AO+_߅~rോ_ww;I?z)Mif5֪޾o}7Pk~k|kB- 7;71/3+)ugvS.Y>L3D>Lx|S8z8l=vO~y=?)_e˝w^;ǻSu}iq;T~40_K.\,mJcm<OP>AOP>+ݏ7F ]i8G?f)tqOxrϖPk@Uw{Pkщ3ք"d rsyU}SD>L3D>c)g(^P\=P /}W;spnC~-ٳfPk)rPk}5oM([y 7;7K.\ަf{/MY>L3D>L7>Cmus}sJuDMk̿ xP7ӓw},{>G߻'ӳo>`dY߽~<+γϊ>ֳ"}5[˲z9س;Ѫ_;^N״kvMy)n-}q5j?u̖Pk@EU7Ϩk-:q5om_LM7E][xo):qn_Z\MggMl-oN|*w2ՕB}i>s3 rƓG_Q3[nv@}܉O8Oք"7_ rIo_{Mщ3$7E֛"Z,yT^Shvuq9}.赜x_>ZlZ _sk;\ p{t pi" pn'6JLp>}hfE|f.7s e]+moזJUnSngE)=~ɹ1_Xxgl5?RaG\B -7;րZn.8woZj-}2e-7;717+)cUgv߶|&g"|&\=p;3^o=v+}Lqn?L ۺ|w'詺y<7NՁ~P)wgv56 Lױuج47z޽g '(| 'ѕwc}]WJ9z_.)_r4fPk8ZN}ʔSf\LBrU}f;3D>L38KFe{w܆|Mg5֪CR~ܵZ~_ [\|A&͒ $W!=KSD>L3D>x|=_>}19f]o QoC~+'^<'zBxP?zsxSAs4&sYVlϞب'W=eȽ#lO6?=u[z2MO9o ox{Zj-zA8›P`\,@rUPϻ,|&g"|&W{L9t}qH})Wrj sޓրZNq&+ 7;7Kn'fK^?Evf^|&g"|&\=P%^z93pArx} [9tH܆mw)<).w)S;T>ئ16fqs6u2Vz:t3AOP>A~`pۗUz8!?Ÿ:0df͎Suz? &NMn}S{on֛8&蜝^I&OM$xDŽ炬7yL賭7Z.mcЙS[k]V\\>08JՁ3~qe{?4S~[ʋ~m׉fq\0Cnq>8 fkUUG nqapz7}0{7XuS˝۔AO =3!h9 M9}qd/r%r4nG77ĩ?xocB1϶in.˛o48G2ޛoNV~F۔OuSh};׺>VNO+|+}$Um`{85͗I˛o4KޛoP97qL賭7yj7㣛.^$x$xDŽbL7Zަ6oS^Gܻ{]wc/w㟾Imc~{vQoC+~}C{YZo}ü,uD1vxR~x&? & {DŽ>zq=ޘ.^$xŃ9z$xśҁMmѪ66{fv Օ,Nkwe90}T?G{ l¸}pv38.w38.w38՟f}JLp3 #Lp3 c1Lp3ÈuS˝۔Ymm6>'/E_[ w}Mpo};pK̯zY t1[= 䎯?O>?z)sz?=otᇾO9M?~ƹ/r|[lxSurxo9{S}޳ff$ߧn'o,|&g"|&WM}Ks}qnz3θOr fio):qƽzS+{S뭦7KngfK^lٽ,|&g"|&WM{p}c6 ^?'|[lxSq8zxSu=m֛"_ޛ"ٹYr;6+My^|&g"|&\=G7_?5^_=516ukS<Ȗ{>GW;)9kٹ,MgO}lԓY!O>?y~>j{+}(qnmqڳyu(̖Pk@Eխ/O|V8~x̚P[2Anv.o5JܟM{7eL3D>L33`ye_׿S/q=5-7;րZ1Gωk:qKf\LBrUu:[/-Y>L3D>Lx|xB='?pې鵗lZ}C{րZ{|kBש`3[nv.o\ * y^|&g"|&\=O۾SAg9?yL]\ېolDT}|{?syӳo`dsv.jӀz䪧|;r9[>?O>?z|NxCz?ym]ʟ|5ޞ-7;րZ~{oq|U'Nߗ&Tyw5ff%v?=og"|&gr:/Pt\̇S/r1_:af5֪CyN4_kՉ|r`j/rsyuSy8{/MY>L3D>LXW#}\ma(My0fPky}Zj>ք*f\,y̨ަf{/MY>L3D>Lxݣ׳_n j>@טr;՜/58odB%#,9e>T|v]#NokJ9?}qnJ?嘝_:bf͎SSϭٯYx&s^VN\Ϻ9S϶d>U>_%xM:zo;jg[ojMyTn=d0+שI9>19g%Wr4G7] &NMmV &8&J{DŽ>zŃ~=z}&K&,t&,޴~MolV)c6͙ݻ{WW3Ul>tͭXr=殛s:gcf͎SӸt&85g&8&oo{DŽ>zŃ~=z}VK&,g&,sv7ZަoSn{|ʏ}rx9,'gggggggg˳lyo#ly<[-~9,'gggggggg˳lym-ϖg˳.(NOe~?O' |_x;=A~?O'|_/'z?' / NOe~?O' |_x~?O'/ 'z?' / uxtY= ~_|7z.~?O /_FOe~?O' |_NOe~?O' |_x;=A~?O'|_wtY= ~_|z tY= ~_|?~?O'/ |Ewz.~?O /_  ~?/ _FOe~?O' |_;=A~?O'|_Ͽ1)'z?' /  wz.~?O /_ϟ_NOe~?O' |_wz.~?O /_uy~;=A~?O'|_WtY= ~_|zOt>~?O'/ K'z?' /  o]V~?|_tY= ~_|;=A~?O'|_/]V~?|_~?O'/   ~?/   ~?/ }tY= ~_|z+OG'z?' / 3o]V~?|_~?O'/ tY= ~_|zOtY= ~_|7z.~?O /_'z?' / ?~?O'/ /  ~?/ /  ~?/ ~?O'/ x;=A~?O'|_/]V~?|_>ޕKNOe~?O' |__'z?' / utY= ~_|x~?O'/ c_B'z?' / u;=A~?O'|_z~?O'/ wz.~?O /_?btY= ~_|  ~?/ x~?O'/ tY= ~_|:'z?' / =rtY= ~_|z  ~?/ ߟo7z.~?O /_;=A~?O'|_p;=A~?O'|_/'z?' / uX/'z?' / u  ~?/ ]]V~?|_Ek  ~?/ ]_pz.~?O /_/'z?' / u~#ly<[-Ͼo#ly<[-Ͼ wz.~?O /_  ~?/ _v{rzYNNNNNϖg˳]V~?|_o]V~?|_~?O'/ y§+FN/ly<[}$n]V~?|_}|ge99<;<;<;<;=;=;=;=[-ϖg˳J﷑rrxvxvxvxvzvzvzvz<[-ϖg_3k7h~?O'/ 7  ~?/ |tY= ~_| 7z.~?O /_FOe~?O' |_y]V~?|_~?O'/ c]ֆtY= ~_|zy~?O'/ /tY= ~_|z?{~?O'/ chm8=A~?O'|_Ǻ?^/͏#/_G '0N`\qn}a3ׁza-ZS~mH`$0N`8qrikcf[]3 EXa-܃_?s{M`8q(o+k"|GƏik^'0N`8ⴵ3J[ a-Zk9#9Gڸ '0N8mmƼBXa-ZQ6~$qD0'0N`8ⴵ3Jߘa-Zk)P:Uc ;V[$?"r$I\r&%c +wVvdEj-F5k$C99X*?CY/y&qMš5R~(PW +8VX}Ȋԯ55kTNiZBƂ}UpXc 7k5k$3h(8VpXrk ~dk[05k*?M kUc &ס1cŃ=z &.L\XW`CXcJ/ڱ^zK\.q]5zE}UpXcX&.L\U`xע} XcXcą &.CڂW +8VrXɱccccc]ś0<$ +8VpXɱc%Ǻ֋74`(P/р!+8VrXɱccccc]0<$ +8VpXɱ702q0q0qaXׂ j;EC *9TbPPPPPZ Cۀ!+8VrXɱccccc]0ko +9VrXɱıııı J  +8VrXɱcccccUc &V C;x 0qa® J  +8VX}x{v^CX j f_+8VpXib7}0qaą }/oo +M`~h ^&.L\0qaJF 0cJ/ڱƂ,L\0qaׂ %c +M`~hj0;$K\.q]z  0cJڱFX0qa®MJ  +8VX}ЎI`]u*֋79P@/ *0Tp4j6GW%J\յVCŐ78`c &V_->чŐp<ą v-pP`C+8Vp4>/&.L\kxDCc &V_0အp%AY^0k0p +M^0c/&.L\kxDCc &V_0အop%Z/\Cx0VpXib >478lą 78`(P_0!+8VX}x0qa^|k/>O~'};0c0qa®J  +8VX}xv^CXkxr -Xc׋8h0y &.Z0怡!PpXc9`hŻ0u֋w9`(PB/ *0Tp4jGw8l⪄U֊78`(P aX}h\ y!.L\n j f_+8VpXib/}0qaą] ;0<$ +8Vp4 X}x.q]w>zG ;0cJp[-wa%K\W!^CXcJopЎ׋7`Uo}UpXc׋7^>߰/&.L\Ka>Uc*Uc &V_0Ccx!.L\[axp *8TP}x{pW%J\U 3VG8쫂c +MZ2qaą +77^}UpXc7^>9a_&.L\0qao c +M`C;V_/!K\yr  +8Vp4zЎ̾L\0qa® J  +8VX}xv^CXkxr  Xc׋78h0y &.Z0အ\C}x0VpXib>48lą 8`(Pf_*8T`PɡC%J%%% %unP\C+8VpXɱc%Ǻ듿m7䯛|M>&O'  aXXXXXz %c +9Vr4͋  a0qaXׂ  0cJ?m'eą v-opPh(8VpX 0c ºu]78`(Pk0XcJ Xą &.Z0\C}x0VpXib >4w8lą w8`(Pe_*8T`PiB6n,U WuonP\C+8Vp4jFś6qaą] ƛ0k/n +M`|~eą v-pPh(8VpX 7`h;0u֋w8`(Po0!+8VrXɱccccc]_tO +8VpXɱc%Ǻ֋78`(P/!+8VrXɱccccc]0ko +9VrXɱıııı?0s}/ *0TpPɡC%֊6`(P-XcJ+9Vr,q,q,q,qkxgr Xc%J+98888ֵ^CCXcJ+9Vr,q,q,q,qkxsr{m *MIVsh_$J\*qUZ B׀!+8VX}x_(2qaą 76`(P_0؀!+8VX}'SX00qa® 5w6`c &V_0Onؗ &.L\ص`C9w6`C &T_.>цm,U WuokP\C+8Vp4j>4m<ą `7׀\Cm쫂c +M`0c/&.L\kxsr  Xcm`|n!.L\kxwrۗ}QpPC ՗mv/W%JXkxgr XcWm\|n!.L\kxkr  Xc77n۰/&.L\kxr  Xc7noؗ &.L\ص`C9틷7`C *9TbPPPPPZ [0cJ+9Vr,q,q,q,qkxgr Xc%J+98888ֵ^Cz aXc%JKKKK)Dmadp-0.4/problems/PaxHeaders.5405/2generals.dpomdp0000644000000000000000000000007412717644140016675 xustar0030 atime=1463765180.073720381 30 ctime=1463765201.025553043 madp-0.4/problems/2generals.dpomdp0000664000372100037210000000606212717644140017530 0ustar00fransfrans00000000000000# This is a Dec-POMDP (.dpomdp) file for the Dec-Tiger problem. # For more detailed documentation, see test.dpomdp in the parser subdirectory # (src/parser). # Allright, here we go! # #The agents. #---------- #Either 1) the number of agents: # agents: %d #or 2) a list of agent identifiers, e.g.: # agents: agent1_name, name-of-agent2, ... agents: 2 # discount: %f discount: 1 #.0 # values: [ reward, cost ] values: reward # states: [ %d, ] states: s_small s_large # #Examples of this are: # start: 0.3 0.1 0.0 0.2 0.5 # start: first-state # start: 5 # start: uniform # start include: first-state third state # start include: 1 3 # start exclude: fifth-state seventh-state start: uniform # #The actions declarations #------------------------ #the (number/list of) actions for each of the agents on a separate line # actions: # [ %d, ] # [ %d, ] # ... # [ %d, ] actions: observe attack observe attack #the (number/list of) observations for each of the agents on a separate line # observations: # [ %d, ] # [ %d, ] # ... # [ %d, ] observations: o_small o_large o_small o_large #Transition probabilities # T: : : : %f #or # T: : : # %f %f ... %f P(s_1'|ja,s) ... P(s_k'|ja,s) #or # T: : this is a |S| x |S| matrix # %f %f ... %f P(s_1'|ja,s_1) ... P(s_k'|ja,s_1) # %f %f ... %f ... # ... ... # %f %f ... %f P(s_1'|ja,s_k) ... P(s_k'|ja,s_k) #or # T: # [ identity, uniform ] T: * : uniform T: observe observe : identity #Observation probabilities # O: : : : %f #or # O: : : # %f %f ... %f P(jo_1|ja,s') ... P(jo_x|ja,s') #or # O: : - a |S|x|JO| matrix # %f %f ... %f P(jo_1|ja,s_1') ... P(jo_x|ja,s_1') # %f %f ... %f ... # ... ... # %f %f ... %f P(jo_1|ja,s_k') ... P(jo_x|ja,s_k') O: * : uniform O: observe observe : s_small : o_small o_small : 0.7225 O: observe observe : s_small : o_small o_large : 0.1275 O: observe observe : s_small : o_large o_small : 0.1275 O: observe observe : s_small : o_large o_large : 0.0225 O: observe observe : s_large : o_large o_large : 0.7225 O: observe observe : s_large : o_small o_large : 0.1275 O: observe observe : s_large : o_large o_small : 0.1275 O: observe observe : s_large : o_small o_small : 0.0225 #The rewards #or # R: : : : # %f %f ... %f #or # R: : : # %f %f ... %f # %f %f ... %f # ... # %f %f ... %f # #Typical problems only use R(s,ja) which is specified by: # R: : : * : * : %f R: observe observe: * : * : * : -1 R: attack attack : s_small : * : * : +5 R: attack attack : s_large : * : * : -20 R: attack observe: * : * : * : -10 R: observe attack: * : * : * : -10 madp-0.4/problems/PaxHeaders.5405/dectiger.dpomdp0000644000000000000000000000007312717644140016600 xustar0029 atime=1463765180.07772035 30 ctime=1463765201.025553043 madp-0.4/problems/dectiger.dpomdp0000664000372100037210000000740012717644140017431 0ustar00fransfrans00000000000000# This is a Dec-POMDP (.dpomdp) file for the Dec-Tiger problem. # For more detailed documentation, see example.dpomdp # Allright, here we go! # #The agents. #---------- #Either 1) the number of agents: # agents: %d #or 2) a list of agent identifiers, e.g.: # agents: agent1_name, name-of-agent2, ... agents: 2 # discount: %f discount: 1 #.0 # values: [ reward, cost ] values: reward # states: [ %d, ] states: tiger-left tiger-right # #Examples of this are: # start: 0.3 0.1 0.0 0.2 0.5 # start: first-state # start: 5 # start: uniform # start include: first-state third state # start include: 1 3 # start exclude: fifth-state seventh-state start: uniform # #The actions declarations #------------------------ #the (number/list of) actions for each of the agents on a separate line # actions: # [ %d, ] # [ %d, ] # ... # [ %d, ] actions: listen open-left open-right listen open-left open-right #the (number/list of) observations for each of the agents on a separate line # observations: # [ %d, ] # [ %d, ] # ... # [ %d, ] observations: hear-left hear-right hear-left hear-right #Transition probabilities # T: : : : %f #or # T: : : # %f %f ... %f P(s_1'|ja,s) ... P(s_k'|ja,s) #or # T: : this is a |S| x |S| matrix # %f %f ... %f P(s_1'|ja,s_1) ... P(s_k'|ja,s_1) # %f %f ... %f ... # ... ... # %f %f ... %f P(s_1'|ja,s_k) ... P(s_k'|ja,s_k) #or # T: # [ identity, uniform ] T: * : uniform #T:open-right open-right : #uniform T: listen listen : identity #Observation probabilities # O: : : : %f #or # O: : : # %f %f ... %f P(jo_1|ja,s') ... P(jo_x|ja,s') #or # O: : - a |S|x|JO| matrix # %f %f ... %f P(jo_1|ja,s_1') ... P(jo_x|ja,s_1') # %f %f ... %f ... # ... ... # %f %f ... %f P(jo_1|ja,s_k') ... P(jo_x|ja,s_k') O: * : uniform O: listen listen : tiger-left : hear-left hear-left : 0.7225 O: listen listen : tiger-left : hear-left hear-right : 0.1275 O: listen listen : tiger-left : hear-right hear-left : 0.1275 O: listen listen : tiger-left : hear-right hear-right : 0.0225 O: listen listen : tiger-right : hear-right hear-right : 0.7225 O: listen listen : tiger-right : hear-left hear-right : 0.1275 O: listen listen : tiger-right : hear-right hear-left : 0.1275 O: listen listen : tiger-right : hear-left hear-left : 0.0225 #The rewards #or # R: : : : # %f %f ... %f #or # R: : : # %f %f ... %f # %f %f ... %f # ... # %f %f ... %f # #Typical problems only use R(s,ja) which is specified by: # R: : : * : * : %f R: listen listen: * : * : * : -2 R: open-left open-left : tiger-left : * : * : -50 R: open-right open-right : tiger-right : * : * : -50 R: open-left open-left : tiger-right : * : * : +20 R: open-right open-right : tiger-left : * : * : 20 R: open-left open-right: tiger-left : * : * : -100 R: open-left open-right: tiger-right : * : * : -100 R: open-right open-left: tiger-left : * : * : -100 R: open-right open-left: tiger-right : * : * : -100 R: open-left listen: tiger-left : * : * : -101 R: listen open-right: tiger-right : * : * : -101 R: listen open-left: tiger-left : * : * : -101 R: open-right listen: tiger-right : * : * : -101 R: listen open-right: tiger-left : * : * : 9 R: listen open-left: tiger-right : * : * : 9 R: open-right listen: tiger-left : * : * : 9 R: open-left listen: tiger-right : * : * : 9 madp-0.4/problems/PaxHeaders.5405/README0000644000000000000000000000007312717644140014465 xustar0029 atime=1463765180.07772035 30 ctime=1463765201.025553043 madp-0.4/problems/README0000664000372100037210000000034112717644140015313 0ustar00fransfrans00000000000000The files ending in .gz need to be decompressed before use. See http://masplan.org/problem_domains for more problem domains. A description of each of the problems can be found in the reference that is mentioned in each file. madp-0.4/problems/PaxHeaders.5405/fireFighting_2_3_3.dpomdp.gz0000644000000000000000000000007312717644140020723 xustar0029 atime=1463765180.07772035 30 ctime=1463765201.025553043 madp-0.4/problems/fireFighting_2_3_3.dpomdp.gz0000664000372100037210000015240412717644140021561 0ustar00fransfrans00000000000000FfireFighting_2_3_3.dpomdp|AOWE#N{UM,ZE6HG9DϻiwN>|Ͱw;WW/_tۺyuufO>zr8uK'Na8 xڜ;ԙ_m.wmwǻt=fڮ~}MNs4;1q7q^ċxN~8~DуƒA zPx=D    Z`z0=LӃÃ`zpxpxpxpxpxLsfMM܁"^ī0?qT?UуAA z=(<DBBBBх؅؅؅ E.](Rfff....]]]]8ptх0LsfMM܁"^ī݃ƒCvavq,̎/EWǻօOsfMM܁"^ī?=I\%z=DуƒA zPxPxPxPxВӃ`z0=LӃÃÃÃCv1Gͧ9 &n&x/qxhvRWDуA z= Ebbb....](PtBK]]]]8000ptavavavх GQi츉;"^ċxu{PxPx.4gavMx/E:=8<8<.w|0;n&n"^顝8N*уA z=Dуƒƒƒƒ<LӃ`z0= 4gavMx/E:I\%z=DуƒA zPxPxPxPx....]]]](PtBх|G4gavMx/E:.]x 4gavMx/E:=(<(Z/]/Y/}+^/}_Z/E^NoEӿ"c )֞n 6<-֦zk%FZG5̑4o0GҼkJp'nw5#Oiޡ`4~vy.s˃]djJ6vl.xvl4 6lLpl/XPa\[P[|0vTxGS`XuaK`F.M ]bՅ.Qxè]a4_muʜĸ^r|')unj$o%oHraTKd #^ǭW')1Kt1hy4+ZOcmKK|VzbZ=+/3 a+/3tD`j=K"1zD`j=K"YyLx)P["AI6k|2i  ڬT5[z4jXnKJox:۲ܓo'"Oic~NZBwL;ȣ;ȣ;ij{D cxt;'FwI`V]r?m@Ol]yEl9mZ7W'kv<4<4`<4=ui6TBP A%TX3J2 R1y8>QؖK9?{dǟ-J%)v9ʩ])qV.iM(G(vʩ]qV.iDkgU06ś0?vL7iM;^k/g5Nk}c[=dAY}z(+YmszYlSdiL*]eaې [0w^:^$z^:^:^ģz^:^:^XeVoU/qca2Ijd&bս4(|%Xmu/MU/G*\< qm``aH@R~3-&cK2-Hb`4 cS$˫{m1`[.t0g09$F:p:p:p~ Yϱ]2-&cd[ &rb<5 Դ\DY`i"Y̱:Owϸ>a~Ԃ%(g"IFdlIF`Il5 c)1SO_BFDKBAL\5?zExgo5{9^f >D< >(X= |$jɇ8O$|!pfoh3-8PG ރ|,)fC SCV4G 哛Xދ 5彨:2]})xE>ڗvMoڗvch_{QGRދ¾i_{QuGnD/]/FT+#6K2|V={c{y/c(彨h״h_g*MҮq Ky/ h_{oڗ^TGѾ | 7ȗhȗp#%kq㍨ȍΉx#*v:QhoDEnp9Uܬq2Ik_lMr>Q7fUuzoDynn6ۻ^{Uc:~%9ߕGKsC:͘[x¶4z3 s OF* V1e +kז繰< vKck)ώ17`K鵔g^K0Fk h-0&g~W=8g=/o-iրY>kg ?|րO:vN|¨<>zp[:j^Ƒ|yD[&@n0y'#-Y>wA5=b_6]>pq /MѮiѾk|/vߴ/Ѿ7N/]w8%q%q{'"|/X{pDPҴ6KѾ } 1|/G3e7KpD'}oD#_~/hȗ.Y= oq~!reNޣwMp;d]np*nָn餵/>׍&Y71 7fLrvoh5[&M,ӈ~h.-[֠5( ~ښdW .)-k&%S)O'}u=%|ߤY8k'\quDhw7!E[Jk@i (5N(ԈR* q4|_є=zgD /i,Љ K!CϤ?D--bZZ4I(3?2><#-9LuĖTzfdIZĖTxfb\GXho}OE%Hܝ;HƬS7u`L ]6 DwT$K),3(@]ƹgBsq |*S 8O|>>ª-By>O|Gd(]mI We %KhlM544k\fW8kDf2X>ؗNͺnؗN C`_R߁ |_* |_2v(%vmkR%ȗԤAAM '4PY#:5k>ؗt_kKC`_R%pЬ} | | |LK=ȗ؍~ZaKMD_rjE$~FiUI![uYm˭7jY~4q?*I˒h1w`cFݬ-#qn.Fm813K\(iucL+L{D 453<5D%4sj|*#֭>™8$˧>,qf~+4 @>{,1S61W@s**#f Ad;nz铛E],jC(YFtj|/SS>ؗ,gQnؗ,j`_ !|eFdI4-%=oˬ~BEq%=҈N͚%}kEY>ؗ,uݰ/=/Y}ȗ؍~ZaKMD_(#Ad*QhDIn]FQ9Mܨqu$.KAn jFJROU4΍[nō T&v c2~pvǗnh^ǭMl&+ Gk`棞fmR2حlĭlt/\/OWKwl׆麵ὤ{vmx/Y[E_2XtO'l髹lKd{IzVOE_2X|B rmo"ޑEmZE6GE&[n|lc:y~#7M]q>T48_﨧z>cFs.98M|*S T>0𩀏:vV|vغc <;Xn~Pl[Cw|{KvvN͎Kujv;,Ҭ5KfҩY ҩqKRT/UKRT/UK (#FoDc"_j7sibo WW;1!^5S}I|/uþd!|/{'KOK7|mݰ/{'6qK (3FoDc"_j _q$KeJ;]-.#ܨe~7j\]F*IFܨ!FAnGܨuXxoݧT5`r'7ɦ᩹&*45uTggu|FSOn4ǁ|'Y>Q5wu{>c<;Xn&+c6l[Cw|3]7=N͎E],jC(YFtj|/5Kf]7K!|/Y}IϢlݰ/YT/' ȗ 0%&#R{'$4sn]fgQw89Ftj|/s.Kf]7K&};`_ҳ([7Kމ1} |8aEdQ/'6ȗl$DJv٪~Ae!7j\]F*Ikf r>Q7f~5UzDqnܺ pK,n.gݧT5[}Lޯ?Y\q;5+͝[x|ijٮM[K?d׆ۘE{vR {jI!sH6`ntk7it "6o"f#"-7 KM6~Z׼;|?~MS" R R,'H Rz(hb~}.h~?C |Vo8>[.Te)GS21*~.PRO!CL<}{h P W B?MjC: t`50FgKmRse?oh2Ǖ <xnӾgRUfR*TA *UPi핪*uPJTR:JU%^IW͵ʱ^$^=9 +f x-PON=yTgL[ *o%+[zJPbJVǮD%J*C f\3mny$&5(9+0Ar@ ߔƍ vK+4r{C}`Qn?YI}~2SMI1P̱O,-d2c8Kܶ'Yd$$ՐZe`37Xwl%Y❈YzYYV},;d>,ǬVY*'tt5KhsKV-o:4l 6kws&xWrϢ0we^ s>9 ȋ$E}/4>yr)^̍23+JtY⮤>q+O%JgYҢdJ,iQ2U+سw%VzY⮤>q+O%JgYҢdJ,iQ2M([Fn^Эb[%ni*1X▆b&rW20Jvv]5' 0i&V53+%ڲ6LDBg6JT̖3-qOoOuC?\?FLv}o"O(iWIZ1U6(*yEC1Qқc$=CU0n5A 0u?PıZ܍7MjMJk>O [x#Xxsv(sZ4='-鉧`Kz8%;4=gv-Y`Kz8%;u4_<@򓙎FYICKԵs]|GyfNQw¹9Ski#4K#4K#4Kl_Ďi`!l ?3d"Kl/u4_'hTu+ 0isp98\;ᾪ* *%vL}5g[}UA_,%}#bFuE}#bKK1 *AwۤX@XRApӐqv1|@CzUPZUPZUPZ%nţwcn2ލyj0%nCSQb~MQ\84x 5SW1[ZzA'8u|9e=5饬䳊|V泋|<rJ@Ve,,MՉ4:*zIr^ZE//tU*z2UKK=&j^o]Ӑ|p/=|!YUt|$/ 4Sr`n1)7`̍?t7F#c5-72lTfy7;KN;|b^p5#>i Y#&@g|Či삏b 1'G>fwj(sÙE$#f & 2*4474.}Z[Jz%wl /SؗVKz](wl /ؗޚ&ST%{գC|efߔk`%&F`_2`_zl /—k}ɼj}I߇5|/5)ʗ{/ e/XK,%7E/Knj,ɰb 4HȍZ?/48)#ܨ2Z?y5)#ܨ2)ϰ i *ʀ=.H5Wž!w4D%K~g>c.NbQ.] ?Y>r16GyRC.(c|$>r ,dƁRVf 1g0a17%51q5+5F($6*|IEY>ؗ^}idKz/d KoMʧ% Sʗ;_/XK,f$4}Y qt^dK{ ؗsؗvKf/*d?j}Igk}魉`_zkR>/iJT @ g"'q+\$z͆{D$XK-ɛb'o~5zSmD] -!7ZYo#h})FSxUF M1֚b-7ŀZK%äZLJ%7pz00ݽ+K9o>9f|rNR*T ,U`OH00[+m4 Ȓ]pؘײ4/miT_Yu @k 鿴3#  Wj3?z~Ifk5Ǜ`8}LSZ͍ մ~d͒B(d7*ة\&jj?s59K[ۜ%mΒ|v%/߄*K^!$~lL:*}~,Iclsk19Kҁۜ%&*K^UOpT'H_mV8<5` טl\Υy|Tr2]1 jtpx<`!jJÁf֦bJjhm/*F8s~GTk*$0`ZoxWuޕT܏ w%#c{/]IŨD^)EVa%E] 7|<+K8FkDri6K8/FkDr\K4Y*ijNH(x%Z't"]-Hf<Ųmɕ"˭x{]mon=;g^_1K xc |c%[Tcľ17FAX/R^oΖR^K ^KxɶKy2/龃&f2VxI7,xi^}{i^ZlQ2/K5$%/ p;`0ōAnf7jƸ%{~`#g<UT"069jkI{6a.:s. svqQt8}CntR@}*GF} }}-YGܓG}MIdUn%v$CE\l ictBыZ.D/ʨ6%ϑ]Kz]K j#\55c\1S}\b MdE`3yR40f7 jT=QmDK` Cdڠ>8VK<^%3gdڠ>8vT(sB0 vR߭2)BYN?NJ2b+/X͟Kn?zr$É}RpiIȍ*FBcWnTb=FQWHzpZ1ʭ;l`6{&ÍI@r#g2i -STMk'y}Vyƹ=ft@}f=|jG9)F(9>߂-( 垤c]uRVN3IIF &,s3( d.J:3+Jft#|j%|.j`/Kf`/]"^3Em$ 0 s\HI<0 KW|%&_.FpMAT9d  c@O`\ zj:JE5>ڗ/@s!A=$(bFJ\/ṏ_\/9Ǒz \1n#!~Ȫ 0 /B%N]l0u;|PA9ɇZ!׾a͵'s >sr>t{$˩'-õbM[mJv\g{Ln 3#^挒&^PJ{$f6Qɦ7MYy3!p)#& ƍ&un™8&Iȧ>A>*:mƺ | C`ʆ(Pa*j6!hَ[tjvn5Sޏuj8kDfScҩYScqؾT/UKRT/UKRQ(% Dy"_j7}YuM aS鳨9CIEiDf%=|l_ߡbl_:5vK, ؾSl_gQsKWKxE"_{/A*G,&[q(ɍΑ JVV䃨U4DIn]ps-seN%]$1>nQS%]OヨU4kn]fpK,nnݫҨjbw0ߥ{]G5iz=Vg>6T|ij&+xa>♅kOt1q+[VA/4KRTA/UKRTA/UKnfRJQ/VM^ދ[i|^]6`fµٽ6p'VmE&̍w"y`+3ss[ȧE 6#tیZE6G"醥&7_><ߕI7 ij|㼽OgiWkcS s#׃cԨs|. "#Jw!֐7“O|9Q!Qcs|hdfC|ȶ5aM4 A{v*S#vӬq]~4ScY#:5k>/5ۗNͺn/; |_* |_*%qEQTȗƉM4XKMNHh0.gQuމ1CIEiDf%ç|l_u} 7q>/%}u} |l__'QKxE|oDEd+n|% ߀ JVV䃨U4DIn]ps-ke5.s*521>nQS%]OヨU4kn]fpK,n.3LUiT5[}L{߿Kz¬iq޾;5+3Zxc>ٌkOؕG<0µ'JcJ VsnuV z^* z^* z 73)p{q+[tbzN/Oŭ4N>v/.\KEk{I^}X[KB+z6"yBƻ rmo"ޑEmo"f#yIˍtRƛ߯¿_;}h*\ZVAJTAJ$SY!lq溘|}F[|*S \Wm`ՔA/u[Yc}(cjM V% hLqAëeL졑qzԮȈv]#}iu}iq>/UKRT/UKRT/v(%E?,SkR% h/ bbƻ~@U[5vѮؾU)ۗwcC} |l_2n/VK+%rZEej #_j$-%v\MCȭQ*?| n]DSu͵,~4qsH5Uҵ.K\c6fneN%]O{|n2oÍ]r{sFI;6҃wx{MS3]s TijC>ǩgu|n@P>ꇾ@# 8<p#|zFp9x|>r"rˆQ"f HnyĈ0hLV/C#5Z5]cǑKFcҮfҮ8|l_* |_* |_Q QKދ~X0&K"_gQ {hgQs>ˆv%|ǟ}xׯiL>/(%|Eؾd4rl_Z/(%zEej #_j$-%~s 7~+eR%A .sſseN%]$1~5qs݌DMt=DI|nu-ۻ^btWQ0ݫqq M!i|NQi34Oَ>4f>h c#SKt1!iDU&VA/=4rV z^* z^* znf^ۋL ČI쫱ٽd4f>v/=%KxGD=xy%7)`n|o237|`yf|: maܸ4޼gN\V7sx[#7M7-oguTgWR3Z0 -@ʧ>AGZ7t|cYa "(=eC֐]&WyĞ2!ӸUKF#ȸvVojqdDFcҮؾkپk8ۗ* |_* |_QKG2F_Py"_j2ywBw07@#NqJh|l_w(ۗoҺپDޝP8|l_"N0>/oҺپDޝP8|l_/ND/Q qB|$n}3\/AnLeR%ֻvTn]ps-_eN%]h&7!uCfrs=|nu-@/1Ҩjbw-?#^dpclkq#9k]=AtDVt}cDT];g|= cg|r@ Ya/n/; |_* |_*%A=b|8DEd7FìY. 1܏WȈv%rcҮfqؾDޝ`|l_gQn/w'8&ۗVK (%z qB|$n rA(X.*h7~u͵!7׸̩k_4b4c j?*z?\s2[bqwIϾ{񏨩T8+8GPLV (U@JPRPPZPZPZ63J}BueN4ZtW@+#Z)1@&J jN 6\efz?i[Gl3 AA ߴ_ inWl? jbH" lSLs *l`c #t`?e._:.Mec.}kBإ)\ f]%0Ro.X咚(tWI'vI{-vv'Jtp\V.6e72e;T-nϷ`gY–jÀ-d*Y5ʭӇ%j#޵9 9HG[3.y560y G $QB"(tpIJnyb56O.^ɭqy*pD +%]4YxWrkl%lK %lKv%Q%qIƍd͢ ɍRPjs v%lf5Be[ܺ]6]+ Ρ^i;M5is3' 1 @ f?\A(Ə3[8Q+'Nr┸gvBqcw5)qRNwRҶ4 HҸ#w44 m]*_ug>yF+g_s~Pmg J3Lf'A6u"qx6fDF^2"#/KCr^BmyɈ @њa $&>  L \K[Xw%-6fEVYo1=oK[dL{d͌\l%- {m1- Ll[ 3Oә t*OƫuM R R R uGIE)ݭzNu)]窃SZTҾjj4q5ZǰZ݋5׽ G}SCeθiv?$?m1 kܞyl)SL#GJxyrx@ $_R`_1m pi pݽomN0߽Mf[Zq%ꈭ阋1NZM2:)NIwGSD)X-)hupJ;:(%[o)|}h\>vj44_$A M;jvnauįouDs:̩^BK:TntpJv{(%v~512:8%p~28%p~0QJj`#ϯ`44x~Ē+[LfK6 xk e,Q7 6PDb2[ &+FłA{-vL7'9}ǜ.3 Rtw:8%N[T01:8%6 N--Fh\|nb44>X$hnQbt}s2cPw̩,;S-pSR)uܢŎ9)dpJln1(%(c]?007g%U`KXXKw`,cغ0]uu+XWۍ1 ; V2&wM!ʲaUx}F_WaUx}^_Wv\*X& Ubf)()(i+FI(i%m}Ea{_)ZW&7v6wfbc~sd.9iwKsm GcJZ7QT}ɑ-u#[eYN(^.#[:cKȖNs,Kӯ4tPiT]Tiu Igz!XrHf7f_㘚 2SءAiIOӅO~𓆟f{~'Z7~} a"ExQ ƺ[>ҵ` ֟{ih CU{E g)?\Jc.7GKQsuA?\*GKRa?\oЏ<@ cZ9?q,"@A@ףfq]Kui`K5G] I`ih-t Kr?AKx/b?v>cw8~.=0ҋq]sԏݥDKO֥.W߫ui`7 8"&&y[$oL61Ǜ,vz p51Ǜ9܈M榌GܠMfmb77n3%;Э0J&譤Ynr0uׁuSw"ST)?O"#e~*$2T# y?="a!>jFTW$3LS歂.uF3bd]\կߥhR]K]Rgd?v:#ُݥ~.uFcw3KS-E]*HսQy#gQPtE EaQ&gQ"#ُݥ~.mERgd?v:#ُݥ{rZ]'TKQ>w~ԥIގ(mb J$o z81Ǜ9pMkb77bs) on&xs61[4%[Ia4L&[翷ː碶:39 8sq:s9Pe$V ,U`KXwFEY< KslK~%c[ٜcpuMsuD4WsLKԝ75֫\S9"sݓ\q0 z /#ՂcbL 1ߓ2}F9?H~Q!~jG5~~ܢQG_ua+w .,ki'ۘXdA:Rxj%}~p6]ҧ.wic%}"~p6]ҧUwic%(uf]jXj%8i.{R۝hLk hQlw15蒹.m 񃻤3Y?KC.{?K1kf]jXj%8i._RoO_Ro#hv/o`юمAoi~|FvasP7\'II:dE}lLM dmcsS'~2JJ9?j=kէ2Y?j/aQ5r~P~D52m'bc+mvatd2c:UxN&T?ޥt]:~pN&t2ܥ.Lwdb?K'u5O|ԥF]7xC Hu̢4sW>z3 ̕EiQoĊ֠Kf.YT~p=ބ!~p,]2.{ C.AQ4DXj%7ĀI(c *"o~%u,DF1⍆cWLj7o4e#h:FѬuxqm![(]%Dɏ,ey0SqG$p)#x tJ~ϗssݳar|(LqpIg<̏P[.R.R.ᒼ9HQY.wTpE`H$vIޣfmq6j lԴd3 0* *0FyKN_=a Մ<%WaՄa&w׷z%}wQ&s&y;̹{a܍ĕy2qJ~dS,&Aq5J~!`?@ϳ'%'(zaR ǨQc)0c΢K0c? ֥ su.),Kgѥ2O%eK`?u~.)]R SwIgեQK._MV]5pe=.(0W.ʋz] wQ~.)]C]R SwI2O%eUF-6Zui`تKC.QĐEǐ|eM y\Dq&kb6\kX㭍om&xk6[5ڸm@ kz{ >J9,`2|1-I0&/3^Ycy8!v3VYc3O,2OyG2OyNyNzU8abiM. Qʷ|&|'o'f6LDX[Y'׉%uboiX[e'ډ%vboiX[qd^tdawddz$f&>T误 C#3llV!i5)`KR%1H}nv˻:XW|ЌھZ\qyU2sa I[-vXFW ;*BySyqkg8jK bq8oqz44*\R=~'v O<*z(g%%ؗ%,HatoERx 4Zj/FkW 1mηjs &~Gm~L"L#~~gM^]?p$ƸBZ:c6}W*O߉'%@5*zI%˸z^cªx7YY|7o2L-%Μj{ `^ﲡ%YwR">mik뤹ȴx¤-m3z56Oښ͍67b ƒYs\fzDנqJ ֦옌Gt yzDZ$0W-1O~VVKYel=q/z^ZE/g%qTRU/*HDuy]z^obmq/wT[KJ-%njz t ^H~PN6BD? 0 w"V>{ 2)#o6"iNy ۰͜l"wU6w}/վmZvh4>G9c9, ڶT%.pIK*\=\p`#FvLʥxXr6Q6Q0 j oai qgIG_wNno[zd?-ޑ1<3<-<~#ں#cxpB}-&kXd*2,\ʝHyKp)wAI~A VbF0W/čFހ膤1Fcvo@tCҰps"vQd婱ܝXQ2a0R"XJa( %J2d)cT,z9W/ @ [le k0v߿x¬0OǧxRUwllC¨K+xJdqU M?JGl+UN%6Љ`MU0ѦF+fsҝu_޶3kg' O4<{JT¨F0*Q)JaT:TeUJRҨF4*QWSSW#۹WMv+{W03oƀ 'uy=`;6[ ¨o%+[zJPb**JVGD%r*C &\mji6'IΜފsߋk6dAr0 TS0 FބK9}6x8&iȌ}Sԇ!3ܔd3+ Tb܂J&!3m[},ExJR8K2Y *K=0U 6sُxWV2/O%މOg%e'Β̿Cfʒxj|BG7([3ϱ-:4`KҘsKVmv7nw%. sz7l`U3ԨY@^,| ),| #> S`S+ }w%{33+JtY⮤>q+O%JgYҢdJ,iQ2U+سw%VzY⮤>q+O%JgYҢdJ,iQ2M([Fn^Эb[%ni*1X▆b&rW20JvG;qs s`4 +њڙmY&Vm3%[sX*f˙~8W7|c`O1sZY0Q 䣤ߒNc[6(ꖼ!F~v&c[>cL|K3Yݒ{ <ɍ1SZI99 :bDS9U 1*xeD]N[m9[mb9[8q;y[4=Ui9ؒ^"'dAMݣQzlIoi-q"Kvu4_p8&4:(u)rJ+J+J+djPR*T (yZ+i5~xmZŏMax毥JMs찵VMns]7ͱN;Ԩn'䳂|ԋX7Os Ȍe^bOE'ipVL{i^¿i>v/VK=| 3zie8 z^|cRTA/9 z^UK 4Sfv;dfnnCwSnn2/S~CIu'݋z}jׇ9b[_{\79b;a뀏^`5_|5@16I9|A/&O| >#i3P3 %H15HU`hx70.|ZDJx"} ؾOؾ_s!)6KxǍ%|;]#}iר|"_oTJDDWzDd*ȗL~ڮшY!Ƶk4Vd8P3I)6K}R>/y | e)ۗ,}L>/OKWRȗ2VȗL%RI r\`IrW`I MneBSI\e7ĺZ?y55.se7ܺXxm(LbtW0 U)gɦYsU;}GT⡹}vۙ[^Hd5DșL>ȓ>ȍ#!Y@kh䃼G, :d*%b6 !SY1Q1(mh^Ƶk4Vd/j͡D>/^cًc3ؾ_"{QKx/}E|l_5*ȗJDDb|Tb/5ƭ_5FƵk4VԮ(=42]#}_* |_* |i|l_52ۗv]|DK?Qn1Cϴ?Z?*U?¬cB/ߣK*Vեt[QJ t(ۄE-$mYD$ndMэ #5aD7Z&FKلhA0-kFtm€nM"zM"M"Mѻ"7=cmx]w`>s{W>?00N8fB*=JOS*=J{"7v N)T:JP*` ;&kY[4*LE+0KFq|gWa&܎86q)gQ&kI1ܥUИtW{ct'b|~q^2{K {7%3*/aXyɯ$IN%/8SxI)&{^oIa%?W$}.s[ꊤoF `(x!Im gl˸ԓl,O/Tr21 v-mr! ;@A[/J@Ȝ_g9QnKd0EyC#5SyD CW}k(R bfo< c.N"Vpۑ 1icrmb&`Cu]M?ы -Ot"وJGF55TA.^h4~fcҊsiLr}.`@(|7){?-ڊ)B-׊ielD%If#\ tidlPKe>8tkdlPK+fOKsB1r}w[ Zg%jOtV^*7Gn|%G1Ox?-RrB]Kjp1J 72yյ 73ܬjLp(4f#gR0$7{&I d#⓾A=HO%y; mF[I&rR+6eE鈑`E.*Bff.*ff`f(.jR᣽t^ʻ(䣽6G{,(⣽wQ"^3Em$ 1 Ćw!Pa.5C.7xP]#ئKu^D!.5Ì= s3f~.Et)K]RD"ѥ.5]j 3wGu 0 /B%N]l0u$Q `_ 0 7 nP_oAȯӚ W2qfLtfJc3^\L:*-ZZݝxc{CF Sy!%1$$$1H B4` ıӁ v8W+xe2^yѭ gJ'mp aU}F_WUx}^_c2{_Ŕ*|03FIiFIG_Ͱ2J*2J:j}`jag_ X^Zͫ_L?c#')=ncˡ~.}Ǐݥa?v30҇q]Kcw2EQ*`KƢ. ?4x㧰7#.L] 1Ǜ,B 1Ǜ1on>z 1Ǜ5on3%[=Ia'iL$h@dss'ޙYQLb~Ng~2Q?'35Idd?S LP ?S{DFÒC]jFTW$3LׅX`tLFvQh.Jd4W.jERgd?v:#ُݥ~.uFcw3K]'`K.4歂.UХ TA*R]Kt.uFcw3K]Rgd?v:#ُݥΨ~.Z*`K?-ޖE 1۲1_D-(sB 1Ǜ/ons)C 1Ǜ5on3%{$tOpI&=[m?s9'3a搅*EX:X:X:%z,U`KXR*DoQ%~wlƯem\]26͕Ư,uMalokld:b~u! zxM*9؛7?˼a]Y~Bg~Vg~5>C%RcO5~ԢPG7 :0וWiy*0x,2ǻ.'w?KK]0|"~p> 4VܥC.7xK+R\WQ Ң.wti]AY.K]aܥI]0|&.}wi~p> 񃻤.K s]E]‹7 HKoaGo|q↹:fyWţ78q\o#h h-؁Aocz2Fkv`m_ѲF<%$9zhLI&woYdc^;39kO2ڍiM؇Yr' e~Vgj~)?zSL3H܏JPW1וȌҥ6L H;0ϛE*(\ͳYTeFduxF1FcMYLj7o4k#h~m0 CWDoڏ"-Z<́@IvTQi#EwT IIRzG?{?k}fkT> |MK}۰9n (%RJ (%$ P*@ PPVҲМ=e)\hOF-ʱg W*@_}UzhLW|%W1}lJv_談AH_ݾVԺ}cC}0rW19'O"4SjjP%RJ (%|B P*@ P*@IUYJ{_r\\{_9n. 7W7_hi]:,>~[yV?Y.<42OhXYwǞ$''=K fIL4F4Ku*dU ̒ߘh<,%28yY*0Kbf1YTh ͒QjF.QČEffsl?Wdsmy[ YNvrȓ/'z=[_Lѭ0 vjp])  }żʌqxX?OG6~d<qQ#V6vĄ #XGřLNscԕe6qn&0Ƽ]oM~2̕މhQFG[Q(]ҷMvq&]7avq&]ҷtvq&]7vq&CT]nU쇿U%{ _uia̛iiBE-];I`?q&] wi2Oܥ`?q&] wi2OܥP?U7K_}w_uiațߡKoqpYs y{Ϳ?oi34\Kon҈m,?غ H[5& oM⮯.}&w׷z%M>IӾg&cb c^̞0m5dnsU))>Ae~jdU#~T Y?%(zaԒ Ǩ+Qc.0c]6fEAwQZd%s'dK~.M4'dK~.M4¨KhK ƪ.-y;ENѥSt]:ENѥSt]:E&] wi2Oܥ`?q&] wi2OܥP?UF-U]@\U]Z5Vuia"Jyv/!o(%dm,kc4_KX-Moi6xK[An1 T C e%V/%7^Rt# &u7dRz#O&0{N/N=*{ߙ'e*y*ycw9O,Grh5_ L%`1{ TA*RY Kd,U TA*RYHQ=w5XA:RY Kd,uA:RY7HQ\5X%}[vu h]l4fga06[d&{IojzS7݇&udF<1_os2_7!Tg{ژgyQ.''Sr8! Ѣ\ :ȥr\ :ȥr\ vK;FΥ#cҎsiعcd}\1>v.U(r逩ZEoahI. QH&6lD0I7u;anFsts#9u:ann0G77Nh'͍ 3tK"4K44L4LBzgg9oOe~os}cSaPRk (u@C`7a.ǯW+ |2_W+ |2_W+ |uSa[@3Z**္^P1JJPj:([: s2`&k=W׷Y;a?2C ht1^PRb{c~cD_S%K̨I>BJ i ͵[Nt  L\5Il|~XnX7bd2<05wXlbJ\CTE|S(z d1*b FSY:LJX^s%#T\I|l/U%!/- 1 vM"yp5) #jv[Ckl oƋ+Lh{6k-^Y=`R/NLڬ0-ܸ51(LWg:?A·O>A g1 f.EOQ<WGUFV#$ިlدw~u_Wqyp_Wqyp_cVdlدw~!vf:v>vd9R1=XG1?1 d ~qb`&)]A|F+]AF+]q>vA1Vwt' LRһH8V*+|"d/7sh#+_oxF߈WV Z I\3r 0'17F&!T 0 vAG#B@N@sǺǸǹǹG/>}\oqڟx޷k w l㎘ڏkAr0 ޔzƤ읒<<.L`*9̑9N6ǿ 8GsU8p΁9r 6ZX¦R.xr|;\CLr=/C˓ $=*bxA<.ANO|4#}\AQ>Hh 'sK޳_߿ Oމg~:cYvヤvAvA9c c|V>5yEb;q>8 'rbEe!r eԶ =K~>: 'y ܎xj?A/|+;|`O4AS`-{~_Կޛf<)y)'|^/- 1|p/|P'+<|"u1A0"E"͸!Yzס?Pp1]w's$9njEI< EY>Br7_r> 狊tj'$_􎀇BY00?(W*FSWW狮Ǿ _G ICM⣣NYN&DI'r}rtTۿF:?pcCduӭ?A) {#T~G%1]~sT?x3A湏A}w}#x/Aѯ:?< @Lcw;5V狒EYNrqET</*;ҟ%>\C-~;@ y|spE芷7_tM/J͆f-&_K _ 0_d}Aſ?r~mIX܉O;+zp>#C _!#`KW}<_Q0 Cs;\G+OґmY6ic_4{?hU,6Q',LbOK!^Hc8bHs/*m#/ @}Em:N4Q)" }+}ES\_4` '?x ty~`E3rnONH̀/ (DžC_t3\?ԹH/H*3_t@t/3"8iƈp*-bG: H/;#rXvE? TnRy"|9Q醋sϱ A`oA_I COvx3}pE.(Al ыSϛ> V}9x)l|NO>{?ӲC$E7\_`tl_Ty}[-}-7h} E3IM'Q QE/zua.5JssbXEsHj*\tQ9pUn8Ӂ;s&p9 'BOp7~bY{"ceRa?ĂXAeE7D>HCrp/}xF3M`ڶ= H_t3I~8\tQ9pv0m[r?LW`Yis_/a 'gG"v_4i"v_ +m;/\E'}!Y_2d}|E'y~I-님E )EAS3]u~4~53YE֢ݧm>EO x>>|}ac\f(Eւ0"a}H8gh'uB!3Ɖ20+8ہqH7H߬/0McP9~h<ַ) YRH hdx#Y/RpM/x-klYwf1l>8p2͏xc->-Z<^@<2{;Ġ/2pWfJu>Fӆ\"Q0 Cǰ LI-R;f8/uxM`2// Eo_T4|hjrEa"60EV|>)./E3}8]/_}/ {(28} E'|Vjh'd29Bx@Mྞ '}nEetOpc3|4/*\tQ>hɍ>"N/E_D vVќ_4Ex}/k̋}z>ڕk߼?0bwoE'־q>7ahqh'yy_4`K}xs8K6Gy߹p27kC0=B}1<>km}0%acӾ $;~<#p{9vd<.AO>('0N==J ڇ5}0drT}~P!Ald<"o}aI ^)2nh0/"򜅉/2c #vu[^wV#GTH_ E*THr?H|Zlxy)YyͭTHH?0:L#'[9_܈}A{Ԣ}e/Y1hEۋ(_m|Qjt<Dv] )Mup#l_O[}5/:|qY}z>NY8m"0>"ժDžU,GK6_p>ai{>Eä@Cga߄z<1E&P`20>t0x',ApߠyX}p>SNO)p/pp} _I,P8_u]" } ?PW|q׵oN_t͏ me<}`&}`mk 2`CT}9-&ѓj8S@^"y," ]EEE/&|4>_d }08\dET&@}EAb >"] >"+_6Hy=~^_tط"U/l`=H;hya9rLc>EHsHs&eQe4A7wq/z2>E/R/ WA8h"C8̸m$aG"tEWHk_aԀɸ,>}_`ܷu=tE_dmV}0 \Pw}0 ·k?aopq ` ]|-"y𞁆Y{ lwNb' dN]+PH\O<ȀQ@6TVؗ4k?R>~`$ڇ"ENb'^h$v]&8_t͏ me<}`&}`m> xUp[L'/qY M E XEQn1 OK$aĐ $߼*FqBQKs w|$E'8 nx\`#{GE5|>ڴ~N;־`.jߜd(yE,F8_AkZ-k7xNpp}uE x/Wj;_h u/*x|QՕ1d<5|Qx_]pH"_poON(ǁqd@k߁7tݩ}g>P~/eoݫ}s>މ>e06>7ܽڇ &N}'_t~x/Wj;_h u/*x:Q潣˘|Qv8{/Y~q׫QPTR 6@j 5jmhYwQACR Tm RP;j(5=XVڍvWLJngϙi ~7)ݢwbj$nݢڍvWLlG"Pwg{SԎ]@ ԡVR 6@j vם]wqflK"sUswqζPS.sIUv.>٢:I-~(ݤwjM~Z(قٿ:j0Z @jAnU1D|Rzk |B B@Hj;sjxg'RHm" {,޻z$YTzmU >+T}V)fPL-̂^AR T?GR@wBA5;)|'Sf8]AR T?GR@wBA5;)|'Sf8]YƻYƖb7wuol)-Rm-Hn7N`vyWL}V)*{LyWƖj R@-vo܂${fGw*#TY0+5xw;RUl=-@սZʻ޸Im ̎0޸Gλ7vyGλ7PyWƖj){$y'0;[O@j 6DjM6z{@9v{>ꋏR}W}V)fPPYB1g0 >{fJR NwJ5; |PPL-w |wfJR NwJ5; |PPL-w |wRa}w*>#YZʻ;RޝPKyw; ɻnoܰ*eF;JGXyR@YJ5gbj.`} FQ埵}c`ʻQYK5wj)mAwc&0;¼mn쫸SI9N SP-IwwS0 ?۰?QQPHm UHm"&T[]zX5?~{}sI,V madp-0.4/problems/PaxHeaders.5405/oneDoor_2_7_0.20_0.00_0_2.dpomdp.gz0000644000000000000000000000007412717644140021242 xustar0030 atime=1463765180.081720318 30 ctime=1463765201.025553043 madp-0.4/problems/oneDoor_2_7_0.20_0.00_0_2.dpomdp.gz0000664000372100037210000006220412717644140022075 0ustar00fransfrans00000000000000;JoneDoor_2_7_0.20_0.00_0_2.dpomdp_]ɑOA X"% '՘PEJE!Y0?gȈ<~q@WVŕgGFγ?x}>_ӻO?/ow_ݗǿ}?}a׏|y_Ͽ|>|~?/_ 맿|?~o?]/?o_,o_BO {yϻc{}`˲x~/|7//_Q=?_~zoǻO_>{7?~/_?|OBn|| 럿g{gW/e_,^Qjj7+_Q_QB}ono~E411[ƫjx9^vW;mxs9^;ǫjvW;ǫaxs9^yyܿ9o>/5/?Ǐ_Ki?}/>I?r_ _>~|Oc?}t|C?10`>Cyu2dj΢cZc-z?/![3-ü>ws<  = Ѣ~CQF0߅8F%//x1=0sv cyc^oEE0")F7E7E;ԢlҨuw][}wbyZ``VY` z` ( 9`~>^1K,@4ЇV Xc# (98K,X Qkqk@:AX`4>Q@L4F@ 0k,q HD;yF-Vaɲ(ށu~,md9Z lK C@@ 0t (i^iۥk}w>y\1IwC;UBfOyhX?%udрCgkkD[vGx%1ڐ>4'j`W5 mijsK?`bרe=r G=ZMs-sI:KF%fQM*8G6 }n`4]+bרumH:Ҏ{;V =ܮQk+7_2 cL2BsM=6gQ٨lTbfv L ΦTCnרSIB/'Do4E˒N ȯr_` t yT j߭Q C5Jl=hqh:@ZGj} hzm wLϻAWmª?XI.E:}e>=!Kѧ[&,}g/U]UssJ{˷/8K,@ol,u8EI- *&:y &8Ay` ·@:xk[f?BehI5m/da~ XrOQ{y+=sE$$ ei_Z@z,4e*Eg1[Ħ-|ѴW_[J pwWVr.K3*z;&x//y=Ŗ72R X:d ԑGY yў.]j/#Ơe#~%{9/f;O@WL3s1#T-:NJ,:Ŋ-QN OQ7} xL|q6,Ǫӄl[ ;o/8F%/6+F:Z[W1E[0; ݫ# g5bT BUY` ͢5$LA"~+MtrVX@0]`,NP &$u48%^8Pn5;K{ XgqJY N1ёAA@qH$$Pk  C:lUGu}FhN]yw@]ozY8 Qkllh:yB oX.'7#|F 7[zae,W q!W YCsvUF<;YM 6*v]փp/7 u7Lqjh}?-.JF%f3Tpl@(0*v]׶=s1 п´jلjrC% jP WhPޝsi0gJF%f3;4 },m`4Zz5v]?$I?a.Dok"&$ [0'ܗ/ MȣjQ:(kM(bq bwT7!pt "J= qฌ8=), N5G!;ȃ^:DcZ`,(^>ӪĮMφH:`i)΢]'@"+8fiqd?w 59mX(w1m$VY#cZ߃J9e'׉ v)BiQ; r?|o@Q/ː|ɂ^܁u~! )3Ah <>&x`O} b)uqEx@Oj;_tw]p:<2{zq1HqM߿pHk4}n v O5ι1w rcK''m^mEw*3%&|F`W%UBEPJ>ڣuUdأ`miQ̲1)ݮ# NozԪ0Z#O/%B @ҪҪcS$@;8>̥& o -Z]R2q٦vm˟0IIRn:8z.-\ȃz5[I;?!dҳãO' >~Xsf iݿ?T3/ɞ mR^Ot$l֨mXk@Ex$Ń *w} gGSKsx!@Q[ibQ͢?4,I7\︫vIm.$<'NPlkxq/vd`ç8IIlЄU@݀ pix<Qd5FLj\<^/u 46ev? QQ;&C4l͚8-^_'͔ў՜}70Ts!i$'U^E pExBB<{ZWv@:N9jf]f lS: ju3Rw1ߥ NO/'txS Bu%e_<^O>1&ws NM$-pwWV G<]˲ۂ׻Cp𔪳ɣ~nu<2Hp կxr %6scdxI{~i6ֈB ~ۯ^_7h$m.EOB+[EwaQ/]2vU5,%4%i$9h&Y뺡&k֣U||SnvZOF >X{: 2;Lܧ>[ fx(Po*>2cx(q,;xQqYOv"+ډx݁ 2 Ftx`0S$wdخh>9GQLؙ|qS#s@U>Ff˺^0b˦2rץst9:oe,tU(Me~n!TZ0k ]g~-[jzPvC/]a3[ȕ;tfs.E{vogKсJ{:gP+#)ֈlssLMP{=JRPe(' 9X oS -ʳ?LӾGۥ}D6!;.bs3\ז[0'ͻ5[{rTqiy\Mym ҸeyNveQ٤x[xDפ癤\B r#T33'Wˎ裌\@DnA4P8r:SģBLsCt1iߘSj;hتf^b͸V8ynf)k\;U- ptIʼn{ } yޒ˝CsѪN vLQ!nݩUI5iFU۫|Cj,Y%D;ti1!VtꆌpAuDo 1^2D 2YG%0S}dF-YEC Ho`j]{řj!2G)6aK ߍL ;VH3yit yDn1)Vf)VHoM rlRl'ydؒpXFY Da]Ft(d&vBٴi]e9Jds0%r^!D:F(,BLn JX$-{xq{`>CZK,^-e.<y#xѶ4tնtO,^-eѕb77"[1 r0ro @W}sȧ1r[Bێ7 0%oSoӹFN]. ,qh mZk{Fav [d: Y$n-}'_`$xv1xl.u:c^A `{D;Eiњ?c!dD1˲cD1@UB&6M1JNcg;/%-HUEωTC/&UC&ay@J"d@ Reڃm؜uBv句'`V q3NSo :.1;R Iw+i7OǓ~#8퇽\z0"r{@Sl^@Hnt yT j5r%ȼ{?xkش{bl$[9O,*Δ\}RfªO7"@YN&Ȧе8!$RS[A,.p5m)In<1 "sPTvUQf.9qrxt_եN[J;x]n.xzAc^]Ds dH;xkHZ 4K0:FrJy9Bc-(GE(H9mYVIfMBfX͹y#B):TH@wJ肜Vrtu- ҡxHYťU:Yf]f lW: ju3ન[hn m uJ8-v|74î RX]N ԼR]>ԥ"[NVGT&H.Y y}$pN!~Awt]hk5r!b;F:hh;A 'uD AAkl ש,w5aQbcR8qhCruzwm:CogieA`~Ip UtI'' yp8Kɛre-ﾕ/^ӧ]: Jtj;|}UcB!]a03- s:rǹiVӷ3sw3Jlʢ5"y\>Y1+ > yO7aڣ$Q: ,F$#U* ,b| ̤v;W&!J;qmy%;yymIwߣtpfk!5y>y7֐[M}jh){˲=D܄sSAnj; "Dg"xXG4 ۢ$^udslgCYGqvr>rڶv,e[g=՘G,z*Pl]Y3g\ledU8QvTY-DUud΅mXmA-mXm"%'vMoڄ}& uNS>椻{ fbisosjyKl4UAm]V{1guVO8(EVضD Yf*:l~4NhKzL+`DUaFLYcZc-jxr&̆Bg/fg/5_5}7:Í[ ֨x#Xcm רŦ}OȯDѢ'＞DxʲIVt<-RHo;`ERnkJ-y=`mk5"zwF}a}z7P7oLt;Oj[xFRv3OmiאM^MtΣ 컒қPmiMiod? ;>ҥ9#ӠLpUiV\^qGɶQJl%۶g_Jм"ٵ̼+B)OJ؍RF)v6Oʠp@,6J͏v|no`wy9ԧxN`Jx@ O`j"GkCV^}][3Qw7NlFEx#XtkTb< n0RɝŴZ$כ<<{~@*zU]>O[W3{$M=<6FlnJnQE}=)ZcmHT; FɨlL9 ['߻\PzOz=\C-ZsHG;GO33s2C5>%*)w̎Z׍<6QI k7Mz>[xn [DXG;F /'U-O!Ic(xWG ?Bp~wpm/ B Fhמ@$]Z$x;Pgzru4^P,gtZWelߓ޸s/ˎ,>YHGڦ iL7s"[z)`Zc-b4NxZLa5G3_EV^#~U76~K-ͳ&vQ%0e0;FZ WMae /@3P>8\ 렅Cp[jnF=68Rb[P̡GjoɟE/y%(%T;ͪOVg3Jfe>{l)d$kg>k jxS5%z+Q^?sJoLq0>uTrJZl i8c#Ԝ5/!C5)^|l"m(湧e!AauywM_ ̠w~Kp,2y E^`%RGV  X:d҂([[*+8οEĽ< N׸ Id63j &7$gs,= .b,̓0'<V|g\夋N>!zϸ@J7|Fx`LZj0?@P],{- C1)-Tm\!K$HCH(P?/@k2GpQԕyw@;7AT+".BMK{`{sۨ?|E7 t J1g1[#{;9W:{ҵ>? `cqɔ pm;Borg8OtH)#+,,>S{gjoD[ɿhCo$nМi@n/ a;~F.AxݜZaZ5lBsFŮ 3*)+4Wv!̤9D6gJF%f3pd@ lJ5v]?$I?a.MH3SAoH9 CUFm cFM[-^}Y_OX_ziy72V5Jr.S<(yY">%Pi;@X>_3IYԍy*|JU9q;~)IDYET[&,66h*^]D5 c|Fj 5Pk_(+ H^~// [&j GzpnjZl>;Xu/}gD|NgE x0K Dr{nwh6n("75K`e[Ξ_ |j |*ƢTpj}}Yn;_qY z{_RK~IU!C@@Q/t ȇQAM/pZ^b hB!y*+p)]c"z^_[!w @A[7*0FlC@;OIY:/p4`鐥ڥ AӝWXr/s4B{gGĭڌμB:yO YR2o$h @§lB px 4@ck?|_>[ մ8C{T|G|%nW>d(LOAc5mڲO8nDx*II{mz&n1&Dz([eC-japdt {~QFn nTP O;-/epO笫_n0ϸ@h/G{DsUʩ 5 x5#g2@tcrL:袧7.)IΣ3z{uSL"-x:,srT49_X wmckw}jѠLpo{4R1xW(oA~]:/(qF`dܹ/޸s̵' K!I1j n0 cy;:=#Us[{ㄷKH5 pR-y{Ф`^jHzw$N1 p߅.gez~s|xho ocWen*a7gAYUx{'(gʜ >zHrͪ)omYswX~QW%~m=b{.\gm[|ZgD5ƞϦ,.H .س۬s.\ԜW~qN˖LV֠4>Xڠ4'rY7U\RXyS*<.(;(n=ѕU|4Ċir>/Y1'ӫBlѫν=Iz_;J(CVkp;xA > xYmHX=U8Ze:Ey& AH_wW9U}XK=m{D@TZ`$-$u4946;QzE^Kĉ@hcS[3(4ġ#tABAUEQ@ #'ZvozY6`a{ €yE=8]Rڛ:jw`#|F 7[Ԁvr0Èpq? g I:{ҷ{ "W x/ҷ Mr?'ug7ЦmZyqH$8@tY|&ĉ![ц,^I6dF͉ >[aKn`؎zFŮQzP?+y8="ez50-;v]b׵m#9؄ H?0z6rFŮ  S+4T@N94NȎJF%fQ8S2 }c`4Zz5v]?$I?a.Dok"`*}-M\Ko3ݾ yT Ӝ5jۥm{?cq}C! =i8BkbUGZ4&[c|eq]~C;F`SrVsodB3DhjC}F@{IUb׌gC HV-,^AY+uBY$TGxe$lzJ8! v"v kAZoKjwi/y]~ l h3ig*)-~yM ,Vh9-=g%Oi B!y*+pdf"=ixYv[RuvLVH!H;/p44R͋TvIT{~N6m^f}[mkvg){gGĭ+Sm^ySgN muhuXYJ",׎_@[=-B'^"qbk_^NzE 4,4Gkz/WUśг{6y2V2>U]sMo5]E oU|,;` Xo;i u(Tʚ v)BiQ; r_eU]tق]At;nӜ5Axq&zw&x[>GGly:r:rv\-X`U(d&MMNx2FsK,6ql%Hn ϼ5BxGGF͢WAh^uv<;U;m\\ wCHxm3`<{ w I9%%B~tjln^bO$'D*WTUq`K4.KA%FxI&ݮu8̏NOo5X[NY1 mxR5&:=<3Hn!: wL(V$wLP٪GhkYH IF#w>7 wTYeH{`^;w ӻq:ydn!`<gb)zeD+p4F|/VMOōx'k@ =u 8[3o߿pHk~|*D;ڢO8^}hN@4 }f¢  lv40sĵG%-mK߈byrD1S@]iJ8fHo3^z)O/F`W~2^s1 п´jؔj踔j蘔j.0U@}ɎeS2>Ly$nmH gڭR2qaݡWCΦB9R;tOhjK[{GY'TU-3H/V'plE}mm6 SdiF] K)] DjAG84"Y3H~o喙|ѕeA!:E\JttDo)[/Lޔqk2ԢKDn#qjgyKUMiZ~-Nt@N7KԾqtƱx r%a9K}^93Uyf\ϫlʲnD6 J}1(5{%BHNh5uD0ΦY$d_3~D'EKlBCF2##ϨVT4umxvS F(O<rj\ꖽU mTch/Ql;dz*zȵ=Y/ '@-Cʕd { ؆Udl-gKnqY̆<[q&Vh`ijBIwhv39-8F*[>l̊?O$ĹG 79duVO8֘G 3D!v(XzTb2pGjO72S&x\Z!@ 4ݚcR͚S6!ޚ٤t9N$"$W#$|r6:̲\-X 2;h`.0@!6ٴBȦM,Qt5&͆.Ru/ t$ڄ5ڄnFad$7wQ"oY`(նY jmn!Vոɒ: mdŀ5 Fm [ܐc Ԧo^M 'źYfq=xJ.tUq`B rsH-*pK=HDdZȋsj܄ ~+|cQ*"EWs֘DnrnK),BQ7(noH$&/lUG]}G1y7-D9GZ)E-a[t86pi-.:tlqu`@w!D{l;$ Uȉ金; F>)BF{+~cQΧm:t}©+Ӻ~\:@NI}e,Bѩ` ˢL8ƨ] 7d͉U HXS:-)[#+=_.e[~1 {9=xۣ v-:Eiњ? C!F,#bI>]abvl[H˶‚/a绗gҧs_2 cL\B9˴%Mb&T)gXz&g>Yabw6:.;R Vng?q,NE^C.=X Vq@/l^@Hnt yT j5RY9kFM['ƦHz0\ b4X3%*AS㍈+PS< ))t-twr8K0'n,rk#- 7CQe.UE9?jsw<H͹4R]n.ؠP/b͹iE܆ kqkHEyZϭj rGvY:vū)9YLlfl9z7/CtD.ȉR* H$,jsRÁ*aYgtBDYIW"G48W*8e.Dr:Ҭ_RJuSl=~yn=*.XZ=^=^.A9@u-ބ\++ XXp׹\p8; `O w@;ic(n!+م{*v)l?ۖ ~9h=kc }[mkv#B+[Y;5%WLŃE8PS#l Y{ڶ,;h~#(o~Vh'+v?ϟn*G+4V}Dq#Bcg¹|6zc ^Az|P'/mtZ S;uX(wg;eSXv Z{,;iNַ'wʈX wێCdE;Q;DD3YnAt5`iΒSR,k1DΒ)1qQw[hߨ%;/nu$ 0(:!64ݲ82v03Q <#Ftp w[r}9QT\ ˖uګ`~mn\&GV_]f.k@Cn]td7"d ogieA`~Ip UtI' yp8KӪre-)_ 뽦O-C-tjH)=˲ ߋwk]%4 !Ft tuDÈ. C=]Oڝm3/}4yJ3yMY}MbV#Ӑt=JMo(iBkͭmDJ1Xe* ,JgEfu]ȓWˤΕ=#IΣv#2#ϨVT9&yy<ש@ 1 PKAyҜʟ(]0$,4'd2(U3!U 팅dvQFn&:^D.룁0ƑdK9~\ZuxTҜ%mD$eqqJLA୎WL4aO$$((!/`DÈD*naDg'G%?;C^սӉq)*ĭ;.v&,@nit94\ơ+Å1]Ky!3pB0k$:KÖ4lIÖDjprZKMVmþIf*pAOpBmE{zH-zidXM[l뫋TOWJf8 F< P|{na/a \xXҔa9̛Eakݻ*hE o{&ߩ|˻J]- WeYܷwߣtðg5ugƚ<85ESZZnʻїe'{|c eЧݰv8DD-h˷E%uI|l?j#Ά!o*#jm[niwB\:ZuSyD̢6ޕ5l{f@YȵVF_!j{ JmGBQgAZh\v4]o;Y}!cKΣgڹs4#^yBdl\m"0THb3'EsVؾ}F9-kF6k*h-Ȣ@汹 K5&١Yc5d1oòSk?>i˧1#(Z8w1磟-r>*|b9hEًb/>,؋b/>,8I:{gҵ,aK=dRL5;(O>9(O7쓣O>9(O>9x>9(O>9(O7;=Ĝf:/u]žs>))?ݟoۧ/kmadp-0.4/problems/PaxHeaders.5405/Access_Synch.pgmx0000644000000000000000000000007412717644140017050 xustar0030 atime=1463765180.073720381 30 ctime=1463765201.025553043 madp-0.4/problems/Access_Synch.pgmx0000775000372100037210000005704112717644140017711 0ustar00fransfrans00000000000000 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 1.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 1.0 0.0 0.0 1.0 0.0 1.0 0.95 0.05 1.0 0.0 0.0 0.3333333333 0.3333333333 0.3333333333 1.0 0.0 0.0 1.0 0.0 0.0 0.3333333333 0.3333333333 0.3333333333 0.2 0.8 0.8 0.2 1.0 0.0 0.0 1.0 0.0 1.0 0.95 0.05 0.0 0.0 1.0 0.0 0.2 0.2 0.0 0.6 0.2 0.6 0.0 0.2 0.6 0.2 0.0 0.2 0.0 0.0 1.0 0.0 0.1 0.1 0.0 0.8 0.1 0.8 0.0 0.1 0.8 0.1 0.0 0.1 0.2 0.2 0.6 0.0 0.0 0.0 0.2 0.6 0.2 0.0 0.0 0.0 0.6 0.2 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.2 0.2 0.6 0.0 0.0 0.0 0.2 0.6 0.2 0.0 0.0 0.0 0.6 0.2 0.2 0.0 10.0 -10.0 -10.0 10.0 0.0 10.0 -10.0 0.0 -10.0 10.0 madp-0.4/problems/PaxHeaders.5405/Mars.dpomdp.gz0000644000000000000000000000007312717644140016333 xustar0029 atime=1463765180.07772035 30 ctime=1463765201.025553043 madp-0.4/problems/Mars.dpomdp.gz0000664000372100037210000026762712717644140017207 0ustar00fransfrans00000000000000;JMars.dpomdpAJ$W<`Zi s{]C-f5Zͮz2gBfvU40VZ{A3 wAw׿׿?o_????poO}ӿo{ß/OGԫZX?ۿ??ßo_˿X__˟??O_?׿?O???o_?gOOm'>v 9Oo"V7z[?ܿvjH?>Ư|]C?CL{ P( QD1pe~}5e*FQiPZH-@iJ ~QC!cgDc@B1O h@"Ȉ #'O3?TP@HRHK!-RHK"-1q5s?TH9w_q5-z9c4 1?ߖsw!Q0@q_ E*)QjZ)@o/H-@iJ @ƞab28f=&"؁(=5@nj@"ȸܭm4J9#J9w/4R4JBZi)DZ i)Ͽs/c˹g+*ݬ2FrܿvjH[5| 9c4O? mƷEH# hk1%m߁h'&RiRHK"-ҒHK!-tq%t_hSݸҖtOc3?']"p ?4EH# ly`F%BJ b %(1c)F!Xo{%G(=<D " rۿe(ֶTTHHTHTHRHK!-RHK"-wkI2kUwΏk7%_7q.8F?5EH# h04h43.mg߬Ĭ%8pJ.Z0Ђ `-h@ &`̷(&b78?n 5H&hYv|R5lвasMp-}o@z'4톇Mjݔ]wiܥq]wiܥq̫{b_'63Ob)e^wOm&؉1gާw@O;)0l?<vj8n]5`-h@ Z0ЂLh-0H ; -0 6ľ7/H){b5N|[ɟw.}G3;gߤO '5ҭK `-h@ Z0Ђ -6F1~~͐asEF4^X;aH{S&nR&nR&nR&nJ.4ҸK.4Ҹ?=?-Ͻ1t6I ͹|71JX@$Ͷa[Nl[ǟ?_G;@Qiir37U $CO?CO?CO?$jHԡf|3=} -0hōohf>ak%֐V!%Jb($JbºTx{*;-ֵm{Ѓܶս[ǕKׄ}X6ۓGNdh½ KKcqV#/qpJ.R.r \-h@%\ȅgc5a3߂6Z2a$Tf>-6si?1$CD.xlOm撰K. 4ҰK. 4OJGwsAnsyfkn)Rm'8CZO{).l?0>hz${J? Su֐r \-h@Z.F.lG?}~ f\hŰ7ג #nn귓f̗"EfnR5UZ5UZ5UZ5USviإa]viإaI箘g rSn=mvazR5aNl)^@>ROt[Cai)r3ᤆSu֐r \-h@Z.F.l-ΎqwU ,W*ͽLp{ut|4h,!\b.9 OdZI=H)sIإa]viإa]'y:l?)m=mvazR5aNl)^C@>ROt[Cai)r3ᤆSu֐r \-h@Z.F.lώqX ,W*ͽLp{u3t|6y)UZ5UZ5UZ5UZ5%a]viإa]vi؟owdRcn)]Cr]a>%К!Т!'J5UZ5UZ5UZ5USviإa]viإaI޿m$VŸ~{J͡. RRʼ&-PܠBn=R:۾־oQI tR!-h@Z.r \B%\~gsR0dgR1d͵dHh 2yIOZ.$]hsAȴ*zR撰K. 4ҰK. 4O|OJm hsAnK ԃ2 t:dKgs>9!Ͼ7qN~  KKc~Nj8[j )h@Z.r \Z.aBM?cܽ!8˕!h%F2d0Gfh͐YK6OԪIԪIԪIԪ) 4ҰK. 4ҰK$.! }I鷹z\fwp{)[JCkjTa}t2Э[ϰNq9f/KɞSu֐r \-h@Z.F.d^<9k)2/% bZ3d^|Z4dn KZABY&CDUf{$ҰK. 4ҰK. &+kz\2 t:dK鿦2qN{J[ϰNq9f/Kɞϐ-Su֐r \-h@Z.F.d29k)2/9Z1d͵dHh 2/>m -2~rTZ5UZ5UZ5UZ5%a]viإa]vi؟} rm9}76׶}T Rʼ6-1[R5/Y ;.tk3.-S`~` #5pJ.Z0Ђ `-h@ &`Ǿwd3Z5dVg{͓¶ߓ9G=wsAдRzRҸK.4ҸK.4Ȯ$mhsAnsԃ2 wKt̖MUdqN~ KKcoBI '5ҭK `-h@ Z0Ђ #0~> Gs-0!8ڧLC|}o^yjݤMjݤMjݤMjݤMiܥq]wiܥq]'Nm%}=Ѓvܽ4 wKt̖MEdqNkľqism_!==$)ݺTkh@ Z0Ђ `-0 #n;l)2/e fZ5d^|Z6dn͓Ҍmc}7 M%7(a-4ҨK.4꒨Kd@Mf>'OR͡_!k2!OTY!! CJ %1PCI %1y=Z}ļy wͯCoo0cߨ+G0ަpfmd?<7/ݼdsh@ Z0 `-Ђ!{aF1d_6oȖ #WỸT h^yR㙕03 Y}ćf. 4ҰK. 4ҰK$|wCm!}Gۼ=l׀ݓEƦ%usom/hI]74l{${R?1n^9`-H@ Z0ЂLhy=0 qqwdKɄ 7/; c2Y ѼdԪIԪIԪIԪIҰK. $ҰK. 4OROO극's~N~ޛ>F#ޖhOk2'sQ48ٴNt%O5#- qfmdO'ܼt͡-h@ Z0Ђ `B ̋@QLŐ}[aOɄ k,ECX=!UC<)mj(lۆqćf񰔹4ҰK. 4ҰK. k 5Imܭ7y =ڶɦ%us/q/hI]74l{${R?K7/Z0Ђ `-h@ &`ȼxńQ ׸8Lɐ}HR4djȼ"R5dnS&jR&jR&jR&jJ. 4쒰K. 4Ұ?IӓmI_SZ\ʼ[}Ieus8c'-"q&pin^9hE-H@Z4ТMhѐy6֢ #_q=EF4d;T c2{͓|fO1B14ҰK. 4ҰK. ؿ7jؿO }R5`~6'؉1_Łox8܁CC8u4K7/Z4Т hE-h@&hbjs){b?ǓNKqvOZbpM8 4/ݼdsh@Z4 hE-Т!}EF4dR4aDCjq#KՐy0!7/<)j()\8}RҰK. $ҰK. 4Obm=O 1^=F#62'aőox8ܑC3Xs`BKZ%uh y}0#_qI }@RdU4CF3Rk Rk Rk %ꔨK.4ҨK.$꒨?)7?=r-ٸC \ʼtφӒ.:fk1u=cВ8m/;rhany%CZ6в le-hل ^-0!5'lȆۏׁZ̃ =yIow(V3~y!}ЇLm.e.4ҸK.4ҸK̫{z?˳qi>djs){z?ۼOKDqvxAKȷ}ȡay楛l-h@Z6в leZ6dylȆ8G>o #n?^&wh2R7dVw%MjݤMjݤMjݤMjݔ]wiܥq]wiܥqq?M?4AB2y =wp[OKD⬛bһ8m ;rhany%CZ6в le-hل ǝ^-0!5xM6ad 4-uCAY^޼d|n,iPCI %1P'~_zڽ=Is$!n5P]IlmlZ%:lmq.LhIW940U0 &%-h @KZ!Q7 #0 5#n?^Fwh2*!OtY!! CJ %1PCI %1I瞙v^ysAp[GABi^+mL!'}{K'k 1moqx'gs'{͡Uh@Z5ЪV j¨&j~(gs|'z2_9Wn #n!$uC1p> ݛlÉq{:~CA =sҾK.4ҸK.4Ҹ?i5pqO d$/KXʼ6-1[v5Ym_KNd^|hm!8}<O<==NK7/Z5ЪV jUh@&j¨6Ƿxz'՞&0Y  2@R7d7/RɼvbpLt,>OgOgssK6 le-h@Z6в #0!jGeF!՞&0!!p H 9K6OO۶Ń@zg̥q]wiܥq]wiܟ<7㐟<7 2 wKt̖}^x9-Гy趷Z} ' Ξh'l-h@Z6в leF6adC>ʎF!՞&0!!p H 9K6OԺIԺIԺIԺ)4ҸK.4ҸK.n U~{zY2ABr[I})pNlvRɼ"pLt0> %-h @K5$0#~qDIJW{NƛHVHjfh@j @j @j DuiԥQF]uiԥQD]';mϖ~Rm)7L =Hjs)pKlIǸz2g inOOhb Opʎ} 醞1n-0!lIݐy!z }o^yRCqǤXn1kBzRҸK.4ҸK.4O dC~kqzRn靎9@?q+{)dr> OsʎL sZ6adCU!$uCf޼dԺIԺIԺIԺIҸK.4ҸK.4w?!v6[z?-AB\ʼ6ܜ#&ҷc4_ =ǃ3Ǵ@՟OWOh-zЃݐ%kCݒ.%hWmlq+{)d^|_km8}| xQ\2%-h @DFa$@>/ʎj#I jωr@ }UX ͐'{:ܬ֐V!%Jb($Jbk#MφyZ6|a^|[_?}H,XBc͟Dm}q-֯b,%jFlT58FPA&5̯Dؓ4C 74nhиq2&>'M(aDKḱC/`iQ.'ہ Ъ&z&skz>)7yfR yBn`?$h,戆% nĒKƥ۞3VA&5̯,x74nhиqC ;<mђgs'; @ZaK v}55ɬ2޼di-VA&5\`34C 74nhиq2V='M(aDKḱDhAy \O@ϊiJ j2}5{S&nR&nR&nR&nJ.4ҸK.4Ҹ?Ғmk-ٿxk8Xa 嶿^mXRc)ٸT5b3zƊ3>dklzFfhиqC 74Z&WZaD,>B Vn}h_a j27/$h,`׻[J?&1vl\)}\[8Lk/o=O34phC xh9y}0 [qKY i2@ZuD~s_ ̋o|6[|"ly{V?vaBzM;ۿ}/4K/ 42K/ ϭ7dk-[_ ?}H,XBcݰrۯI dRn{, %}RfhC84r&HZZatK5nlvBko8Cj?&{tO{^?$ vΟzRK/ 4/ 4w?ujy4?k(Ǵq @c 6Gm#wX)ٸT5sm.40s5贼C 8 phC˙̋amݒ}XIi2@Zq(~)l2/)Zd^އTNjVNjVNVNj^xiु^xiु2-}޸uɑ?}H,XBcrۯ&5K5^#=g8Lk9tz^fhC84r&HZZatK5nr? cM<i/;mR] 6U^ߛlZ9Z9Z9iZ9Sxiु^xुno)ߴꓐ-drlq @c 6Ѱrۯx1y}k\y}\[8Lk/o=O34phC xh9|>nGZdxÉh8B `Mݧ84ph <-`A&5O7žݧ84ph < FaKvߏ-k2@ZKqMf&sk4!)`?ymR ybͨ=fSZviإa]v%aIh6F-mSW 40hn{VC3αo>pR)ݺT5"3z3>$ə}84ph <<Җnh=B˚o8c"zmGheYeyDzqBZCZSZKXKb($Jb(\Oɟ̜?Z{ϋ11>4h4aw*48zm9d%kD }m2an5wIK† 64lh0!aCO2ah*BKb8)c"zmoEp gjVAjVAjQAJ)a]viإa]vI%aGJmܺsdcaiq@ sSy7n!+a]#b=Nk } | ;K^64lhаaCÆ vh}|W/|GZdIhB3d8~Y!! CJ %1PCI %1N{S(ɼ +z2=5̟z5t0o{gq_8oG{6n]fFmD0/[=734phC x醑.׫lRdߍ-k2ZKq MfYWhi/iQIf=Ŧ,KVNiु^xie^'+稏?pۿJۯ!srq^i}o : ۞Gg۱=D'N֥Z-afkī'=O34phC x醑.W'90nJU|C:C 84phaFdީ37 ù?SԢuk k}7OkjW OO 84phaCFaK?Ӂq[:x 2B:xZ>8>&342Ɍ~|{?$f1)hzM{TNj^xiु^xiुo6fp'i^ɝy s?n : ^j$ ۾pR)ݺT5̽uWOy]ӓ4C 84pnzt`䖪&8&hN8GZdVg{S+'rR+'rR+'rR+'rJ/ 4K/4?YDLfp3;~ uH}ᤆSuk k{w$ 'i 84ph0C#0%-UMq+eM\7|1q>s"ɬ%VNjVNjVNVNj^xiु^xiुoqτfp'8N㼆mn : ^j$ ۾pnb֥Z-afkī'C 84phaFd^z9Mnj22-k2ZKq Mfidhit~OxN7b|L) 4K/ Kgw>ٿSgw55t0o{[T۾pR)ݺT5̽uW?#8a4쾷nm#a0ަ5nݖCVºggsRdRd͵|ɗh'B+\wo^yjVNjVNjQNjVNiु^xie^'+Է=[gdw5̟Э`_= ۾ rJX035l'5 Z^64lhаaCÆ v!ٯnlqW*%J\K11q>"d8C3(纛Ҫ0PCI %1PCI ,M_mװu11Eݸ۶q`{Kamhy8sݽykNZ3dk+gQO:4tСCC= sFLc[k8>fwh)o2Zd'3D퓦O 5=\Q}Is%1*^^zie^zie6,Ѻ%_xi>_ڍƁ9m/49nhz:x,n^yk'eN>JcF=ovhaCC : &3s090>n0&|9ܡ<8k}KOz>)yrGy-}$KC/4KC/ OF-AE\]> ZDnIgk sL|7.G s>^nslCͻu{n6ܼtqO#"0}zС@ : t衅Mf0'`r`J~Za4LsCKyyp&;0'{kZ=ՓF=ՓZ=ՓF=iSzie^zie迥"萙'ASL|ai/}6qox9qC 6ۼ楛lF{X1i>`f :4tha@-l2op8NHq"i8>xwh)o2ZdFdoS'zҨ'zR'zҨ'zJC/ KC/ 2}oY~N8ٿk=k?%{w1{0QO!]2JwX[[=RocI4Z!C 8p4h1nW;:{4O'Ba<J`Y we=MK;_ъ6C?npN((Gr4(Gr4Ѹ /~;kvxچ:vO?8;az8i:PCk( V(( }4i"( ahрG 8;mp'Rg6@=ڛgY 0K٣tlp~7RcsvQF9ehQF9h\HN8՚~|:[6Ա{nƂ;q=zᨧ鐮C;-ꣀ{[l1Ҥ= pLG 8p4h[םJ=h;;'EæjowXf%c,v_$d=ҩ+ҩ+ҩ+ҩ+(G24(Gr4B;`5;oB_PYwt갌c= ptHסLQ@D=PP@6iD8&Q@ЀC 8p4­vNa#͓aS{X7x<,1`;/GԕN]ԕF]ԕN]ԕN]hQFhQF9WTؾ,v%} ȯcm}mC7>q= pS:Ǣt(amQdôD[l1Ҥ= ȃvG p4hрn %J=hp'Eæjg|=,1`;*zdڳ-#9.aȔ)ܱ:QQF9hQF9hq_wRb:h#C/ F uRwܞcaOURU;-ꣀla+>FGyЎ9hрC 8p4­v7҄zXmwOhVoʇ`V;FR`=e;ZlB{aEvz4GK%q{K?Q>rQ(CrJS(M*f*floEJԡ_xYچ:vx_u1^Hu޶;=|c2-l/f#M lX%8 p(PG4pBfxNX+{5x QlXŲgQ3;FdC8Fi$Fh$Fi$5Q(G2Q(G4|[hm>١s`?y_P:}{`p=4u(ӡt}~ca>FGIc04hЀGp㎺zXmsQU;{;a!=JH~ҽcTw؟8ǣH᎝QQF9hQF9hqUS~kv܉O6Ա{NOO8`{8i:PCk V)( }4i "ƨ ahрG 8;-uZg)u⿩=35 v+QGRERHJ#)4HJ#3֏}^CcmC6vp=Mtt(amay\cHv1i< p4hрncvZumi'ê=J`Y P {SW:uSWuSW:uSW:uQF9ehQF9h\Z[׺ Bz;^qT c|a㞏cXʼjDwwLTaPCOH7 ڱw(a}M{AxMi;ja 8p,X:gev[o^ 'Rgn2`f;PJ,viN[鴕F[鴕N[鴕N[eXcQEXcQE9W=I~"8x`izH`z?iUTPmjW*zڼCK9B85cI{T 804hрG#J= ~vOMn%ê=h|g3+Y pkGiqE$Q<$F 7oK;(G24(Gr4{Qtqo=[^~h7,8X㧌c *M_z_O w(a6cZ[G}4i dsрG 8p4hzXii-vS{XG[Rр3+Y @kzdX![iIrۦ;\\B9 (PB9 )peׅQ\qܯ={[^jϝh`=9B *M_b_&ʱw(a6cZ[G堀}4icsрG 8p4hzXiw-v7фS{Xm_Q `f%c3Kvb;ZtJtJtJtJr4(G r4(G+1<~^|* V `z?jsBU8T8K9xcT"1Ҥ0URG 8 p)@S+װre=2;[m)6bك7y0fv `2N#4N#i4N#4Bj (PB (PBi {~q\~@x<΃}Wmj 1$0¡J!]2JwX"{yMi_9&wp4hЀGR+ucje(2`خ`VA<Y R`yzmZ|CuHp#)r4(Cr4(Gв%XS?5sU5cnS{%NOǏؕ!QAU:P}mcpT kH 1i рG 8p4hzXm7SC;ƦjgچJ`f; գtlӲ03=R-)kHp#)r4(Cr4(GG~qh.C:wV5ccjԥOUTP鐮C;,=fG}4i "ƨ  8p4`hрGFX:{45O>ncl]0jvmkj̬v `f)CP=JHtJ4JtJt*Gr4(Gr4Ѹo?-ePW'q{MhgGK_ǧ * ptHסLks3P@^>FGIcT 804hрG#J=h;m" 160U;{675fV;0ءb{SW:uSWuSW:uSW:uQF9ehQF9h\Y_W?w VAh״m Mvv X㘨  *Mtt(a6G1C8*5cI{T4FhрC 8p4J=ك?7$ 10U;{v85fV;0ءvc{$PpUǕ(#ntҎr4(G r4(G+89@{W B}lcmjK]j+8&0¡J!]2JwX"{ ByMiD8&QA6p4hЀGR+u i;-v- FaN3,vGIU5WV(8^eUTPc2/Q kH¨VI8 0(QM!\ʕ=~(-Dva#* (WfvAAD*LQn[Vzn[Vz6-W۷< n(6Ir<(ǣr<( x 8F9pC|7 풩cmyڮEyT` sPO_ăFiE~co}A`3If­p+=Jíp+=Jғy5y  EoP#xQG9xQG9Wu1*蟝*P_ê*XQAݨ={a6,-,d{z[hdn]amaC Ldi{Q?Q?yW&H.('7 L8h~EYψVf­p=zíp=zޓxXڜ\\Ii$FRIi$\rr\vC n(r]O.h.ksiB6NW oO8\jLdi?#|;G#EXႝH4XfG ,"xFZE43LTn[{n[{:x㑎G:x㑎G9xQG9xQUGX1$npC]uD Uڱ6FN : qk ˨#^G8`g"#OC(:":~~)",pN$xR,3YwX}vag<#Xe: íp=zíp=zO#t{(8Geh[J;qeȱ6ϫ>lyo6ϰ*zٕvl}&bqҿ:7?l=@~GM$D'mN6}7HYuLx>Z3O{n[{n[p9gP6?<#P9ģDxQG9xQG9W8hH w1ʈpO}3XG/#|^FNϫX?4}7ϰ2"zevl}&bGQF.su3l=1c7{&v"6ɾYuq,ѺIOȾ`;x>{p=r-p=r-d2͑Q6 8Gģ]QG9xQG9xqUAH'4WyGjVCv,>z/#U̓GG.p=x2;>1y_s(2"2G9H𤴓r3Y95>[na'6Z .DN$xRI,웛UppG-7q5"``)r-p=r-p=9Jz/#՟dHeDǫc3'5׌r/# /#{P$N ;طr3YзfApG-7~5``)r-p=r-p=t1y_s(2"2EoQk1 };)7}` qTr;W# Vf-p=r-p=rH#t|ڮ6GG.|p=x;>1yږEyl8|pv@]l3 ;wUppG,7 t0n[{n[{ 7cD~Gj@*(ǣr<(ǣr<{}38;ԋL$88,p;/z,"(n@qD[{n[{n㑎G:x㑎G:xQG9xQG9x\M5ԺuD8 EvAO[y { 9w=>{GG .p=X:>1yڮ#tqaء?%vNaQGq :8-tlíp+0 íp+04qH!tqH!5q(ǡrq(ǡ4GsW6# Gwl.*XG|t^}~dt2cWc3ό*fUm^P/3 ;c3[f@QpWq;L3Q{n[{n[x㑎G:x㑎G:xQG9xQG9Wxg}379FpC.Ii2/>r!6Cl~{GG .p=X:>1y_/a80Ps;'0kb`ǀ8e-tlíp+0 íp+04,FRIi$FRIi$E/YߎN9={{XzQ3`sQFHPYEP;w3Sgq3Qf-p=r-p=rܓyt̛WU G:xQG9xQG92M[!G/#o~v[ ID@ix2r Hcxl}:}ʈDx2``2"0ȧQ(reqO?Hp&ûiFP;y3UwP{3Q{n[{n[xj̛WV G:xQG9xQG9WY^Gnpϧ-KaԐ_~z av!.Rޞ͇=$(g~' !"2KGH~\A!oznJ`; Ű7A-tlíp+0 íp+0484fhshDIi$FRIi$\ߞYȬG& wtҎ4}{veO ]6\`sdWq.z3(/P C n"a'zvAT/~0Pt0n[{n[{G:x㑎G:xQG9xQG9xqՑx:8Fy-'⧣jnpO(XQG~MNfxl}/1auD!x<f0GQuDud m H؉>`pw;wf@e: íp=zíp=zO#t{y8#pC;x:Gix:kww0cPW*g|aK# ̀E09ꈈ# #[PS\l#bop ;h;FiE7S @t(LTn[{n[{:x㑎G:x㑎G9xQG9xQUGutIq\ es)8kA]\! UCkBx73`@"" #tALq[O)ﰀ; Ű7A-tlíp+0 íp+048_ 639Y"I4HJ#)4Hηw&=߾l>T13ͱ+DwNɆ3Ow[[C9,_A"U Qg ](Տ#|73 ~?-pņgM#4"awP{3Q{n[{n[xvv8F?% <~QQG9xQG9xqvM}39F9M|9PNK;בs.5yRo\_DX3=bÂD69@6<Ȼ%գtP$?7L$(fB`r;wXf@v1`f LTn[{n[{6tǗy,yPb/vvQG9xQG9x\ '܉bpCci*KuȹM{o#ܥU ˱{dž d3d3ʣ=]:E2U>3 ~?-p`r;wXf@-f LTn[{n[{:x㑎G:x㑎G9xQG9xQU.ڏjWy&7}pCӖͥKp5kȯcL棆pV)8$f G d0(&Fx9PNH  Ű2A-tlíp+0 íp+04qH!tqH!5q(ǡrq(ǡ4}j?-4MC*c ={F3a_&ѹKc d?lsdtlFy\3`d;J3 ;M f`r;wXf@7T2D[{n[{n'7>Gy QQG9xQG9xq~Z ?}Ց1i⛲ч 7T:GiT9J;בs tZ<ׅ~Ҫ=A]< #ٌ# #[P$8J]u3 ;M fa,7|e x{Cu(LTn[{n[{ܖ6CCSKK#)4HJ#)JMr+?; jpCsv,r>z6&˹Kc dIf0G.fG.=fG.z"ǀǡ#%fv&A lvATvRe: íp=zíp=zO#t}5r:6=C*c :rodHբ=A{ҿy^G^GT^GH}:{L$(}C-Pv XnaL(b'Pp=zíp=zítTiR%8G5׆9yo !ܥU ɱ{ǃ?yQC2# I٧C J 윀ծiLAia1` P ;,tB6 íp+0 Cs! j3/m66K$FRIi$FRɕ@#Vg2=i3رy/- dp"#Or db5ZqZ !+Y{-wCdKbzܑ7Ǘ8sߎ 1޼8~I@1鰌@!ǫ_8e* _~@q****xq3ӱP"GJxҎr<(ǣr<(ǣ\ G֣בn7gc\__uD Cy'g {l+z!+ףtcd#bz#bcԑ_SOtF^ K㧟;q h qŋS@UuD******k8F9ka@ n(rDP*(ǣr<(ǣr8]Y%C~lI7TiG9xQG9xQU/z|9^֣&\;6^H28dav%8j(cmdcD$[!CtZQH6fN^ O?+.PL:,-PH, q҂(6 8e;aV8aV8aV8aV8a%cӁPbזxpwq(ǡrq(ǡ4:qNMOmpm=zy.Dmc\aD Cy6a=Z!K\=Q@D=vk:䬍( ģ'8#/ӟr(&($?8iJ `U@2 + + + +x'~73994HJ#)4H9/ߡbG{~{NO6ر{V 9 <׎W$ Y{-- KDj646- N^ }O?+.PL:,-PH,7q҂(8e;aV8aV8aV8aV8a㑎G:x㑎G:xQG9xQG9x\48FR\[^HNOǒ6ر{V 9 <׎t!+ףtcd+$bsB9@28das+g3gY:dzB"zlD s_#-($ģ':#/}S)@1鰌@!HZǾ\rXL#p 'p 'p 'p 't28dasCg3gOke)9ct.Y ai mq\}≀D@谌B@H +B7@ $@ $@ $48b739Y"I4HJ#)4H z&D?%kk`<Z ^quYAEa{gtq\l\D=k:N3^#!v-!?pGJ _qN]q!pŤw0d%i@2w0 'p 'p 'p 'p݉'cdz7?]}'4ykqGX;%b_!K\=k:F^Hc6GˡI^|Ŏq!.~^nI` ɀKZI VZ+L#p 'p 'p 'p 'dGqgVHD=k:rع͑rhds඗oG]wU(&($.u(?]'FXNXNXNXNXp9@C<.n"GˡGH8PC98PCiW?k|'9{e5Jg^1z<왈3~iI,r=JX"Ư=f G.&Q@6n{;~Ʈ.Xuq#.PLz-PH\;%\'-PՕUV8aV8aV8aV8aV2ܣmv&2(GJs. UQG9xQG9xqGk@s/祮Q; qGXi~fDLKK:d鐕Q1~M19 pv4 B9@pK7vu Ľqb;mB2i-:iD2 + + + +sRHJ#)4HJ#o ܻ)eO]/|g2^ў/r#,b0g"ȒkK(c6_[ G2.I&7n{;~Թ.XumF\F[ $-'-Xi:Q(V8aV8aV8aV8aV:x㑎G:x㑎G9xQG9xQǕ'~n U/Mz; |U/Da}=1yƯI)F4X]RGK99 pvI2 B9@pۋwu m6Ťw0d%i_8iJ b\FYFXNXNXNXNXx㑎G:x㑎G:xQG9xQG9W?kK ErU=hgp=zELfLzCY{,=f G!B9@pۋR`ˍ@1@!pIZ\NZX]\e:aV8aV8aV8aV8a㑎G:x㑎G:xQG9xQG9x\-w7s{#VyB£c1yڇ3gY:dzD_D8vksTG! [x]]qF\F[ $-k.'-XiH2 + + + +H#to-)S/=G^ў/ GXifDLKq~Y``dzD_ٯ-(}mjC`/$`mVB]qw7 h ~+-Py7@ + + + +H#t}wyJ{#Vy{B£=c| GXifDLK>9KD9B2Jp,40vwR jě'P̞ 9@ʉpL~ &(B8} ~|C0KV"zaN^N^N^N^̣*cVcq]ч wtҎr<(ǣr<(ǣOx߃wǸ￶=k=)'ޣ/j" ,pt=(ףtc$W1{9Qɣ7h<N__Ԁ+/zzyW8yW8yW8yW8ye.[prv~vmpC;x:GiG9xQG9xQU5N֣3ݓz=,j"pH#]r=JX[G9=HAc|/ XN^˫ ,up#/z#p 'p 'p 'p 't&e)9 61i>0 Vr_gƻ3>T XN$":'p" 'p" 'p" !4tqH!tqH!5rq(ǡrq(͡4+swpS=aǸ= v;6|/_"pH#]r=JX[G!=H|A}|(/ XN^˫ ,/QW8yW8yW8yW8yW:x㑎G:x㑎G9xQG9xQU5T؁w뉵 vRh+ ,p|LRrm%b?}a Vɢp*ka_3>+TXN$":'p" 'p" 'p" !4$b/f66K$FRIi$FR'꯯=O ==8^qu$ِ"{Ы'~>1Ъ Kg A <Y8d㧝'hzD_Q-pP^5jds9k{N^kэU8yȷ׎csUX]QX]hF]`uF]N]N]N]N]p.phx 7ᑎG9xQG9xQǕt}Ws}eU5WV3U"{d>wTI^K]G%˒-8@?fG`'ȝM~TKt2NӨ?Ǜm^c2ON0˟vi]W]!Bv +dWȮ]? 3>q.ߟK -(G>Ѵ}4iMhq޿?_'8&}KgƟU&>~{|$/Y~㧙s)x _Wh]'oiMs_OE^~2Ofۤ?6|g#vӮ ]>~i`WȮ]!Bv +dW}渚ϼǹ>=-Z Q}4iMhG>Ѵۼ&}/Oվ%3WH7;#yBdO3^4=O*]uR&q_O+E?hs>N$~2O>]l?>3x^F zSa˟z_z +WH^!Bz'nϼǹ}:sR}4iMhG>Ѵ}<?&G|7sw|5+oG" +gϽq2|E_{uT7 Υ;=N'WO9Gg/_&>7e˟z`?&WH^!Bz +W};}K}~#8 -(G>Ѵ}4iMh=G|7sw|Af$Bd!_3^8=O*]uR'q_+E?hs>N$~2O>al?>3x^F zSa˟z_z +WH^!Bzձw3>q.ߟ\*hMhG>Ѵ}4iϿ/վ%CW2#ǯE" ߗ>=u s^ v܃?] $nKӒ,Ώ- `$QJr$!IB$ I$$I=dC}/k~˙_Ij&除gIz&除g\G|7^?Wz_>Ȍd>Y,DVE_=_FJuRJyx9exzO~e˟~ `Q/u^kGW4}+WH^!Bz U}hE(G>Ѵ}4iMhG><ܤG|7q;xAf$5Bd!(+4|78|]{zyWw_F/ Fz^'O1|EW^!Bz +WH^E(G>Q}hMhG>Ѵ}4i?﫴ǟ>ÿw|X~EAf$5Bd!(+4|7|ߔ+8z|L{"xd?:%>H/^0h +WH^!Bz ҫhE(G>Q}iMhG>Ѵ}4yK{Y#=c-wj_O+2#/E" }EW4}E_{uW7 Υ;=NཏK F;3/uS?>|3x^F zSaL_WH^!Bz +W>Q}hE(G>Ѵ}4iMh$H~Oj_oH7k#yBdE_QM_Wh]oqMs_!x8?H2O~c_>`Q/u^kwW4}+WH^!Bz U}hE(G>Ѵ}4iMhG><ܥ=E'}׿]߯d>Y,DVE_=_F'ߔ+8z8>^?/3+d/_?vu^2^F zSaL_WH^!Bz +W>Q}hE(G>Ѵ}4iMhsGuwq;xH7k#yBdE_QM_Wh]oqMs_!x8?AU_FO/rf#zS ^ÿØ+@^!Bz +WH}hE(G>Q}4iMhG>Ѵj Hwd<x|/9%>M|H^d!Y}[[_W𹾮o𹽯+8z``=#>ojh?-h%%yqF%$'H$$IH$!IBdC==呤fIz&除gIz ==\/_ 0U3ft5 t={Fn@73gFό=3z=@fkFg{Fgc_E./oa>60FsF00Fshn #hAFshn a47a #h a4704a470FsF00sxn chCsxn a<7a ch a<7014a<70s00sxn chCsxn a<7a ch a27L0 4La27L0&s&00&sdn h@&sdn a27La h a27L0 4La27L0&s&0ajn憩a a 憩ajn)h)h憩ajna ajn憩ajn)hajn憩a a 憩ajn)h)haznaaznaznihaznaaaznihihaznaaznaznih߯ /X_a} X?~_~ 7^֟#G?#G?1c?g? 1c? 1c? 'O? 'O? 'O ) ) ) ) ) )iiiiii?5^: oX߰a}_~߰~ ?#G?#G?#G? 1c? 1c? 1cO? 'O? 'O? 'O?SO?SO?SO?SO?SO?SO? 4O? 4O? 4O? 4O? 4O? 4M?g^u 7oX߰a/X` oXa{\_?#G?#G?#? 1c? 1c? 1c'O? 'O? 'O?  ) ) ) ) ) )iiiiii~_[ oX߰a}_~߰~ ?#G?#G?#G? 1c? 1c? 1cO? 'O? 'O? 'O?SO?SO?SO?SO?SO?SO? 4O? 4O? 4O? 4O? 4O? 4M^=^/X_a} X?~_~ 7#G?#G?#G? 1c? 1c? 1c? 'O? 'O? 'O?SO?SO?SO?SO?SO?SO? 4O? 4O? 4O? 4O? 4O? 4O??_u{~u߯ /X_a} X?~_~ 7#G?#G?#G? 1c? 1c? 1c? 'O? 'O? 'O?SO?SO?SO?SO?SO?SO? 4O? 4O? 4O? 4O? 4O? 4O???7x^~]`} 7oX?~` /X`oXa#G?#G?#G?1c? 1c? 1c?  'O? 'O? 'O?) ) ) ) ) ) iiiiiiW|]z ׿׿ ~]/ ~o7 ~?G~AG?#AG?#AG?#AG?#AG?#AG?#C?1 c蟟?XDC>DC>L0ô>L0ô>B#>B#}hE(G>Q}4iMhG>>D}>\xkz JWD}%+Q_ +}@_=+Q_=@}%+Q_JWD}%+Q_JWD}%+Q_JWL}e+S_W2L}>``zaWO0WO0PA_W2L}e+S_W2L}e+S_W2L}eP_*W UB}P_*W UB}꫟_NzaWO0'}'}>B}UB}P_*W UB}P_*W*ꫢ*ꫢ*ꫢ*ꫢ*ꫢ*ꫢ*ꫢ*ꫢ*'}> *諢*ꫢ*ꫢ*ꫢ*'}> *諢*ꫢ*ꫢ*ꫢjꫦjꫦjꫦjꫦjꫦjꫦjꫦjꫦj'}> *諦jꫦjꫦjꫦjꫦjꫦjꫦjꫦj'}> a;Eo @4C4C4C44444#4#4#4#4hFьE3f4h W"D^y%J+W"D^y%J+W"D^y%J+W&L^2ye+WO0`^2ye+W&L^2ye*UȫW!B^ y0zaxl^=0 y*UȫW!B^*ȫ"*ȫ"*ȫ"z~1`^yUUWE^yUUWE^5yUWM^5yUWM^5yUWM^5yUWM^5yUWM^5yUWM^='D`XJ4C4C4C44444#4#4#4#4hFьE3f4h W"D^y%J+W"D^y%J+W"D^y%J+W&L^2ye+W&`^2ye+W&L^2yeUȫW!B^ y*y2L3'B^ y*UȫW!B^ yUUWE^yUUWE^yUUWE^yUUWE^y|  "*ɫ&jɫ&jɫ&jɫ&j< UWM^5yUW|w . D3D3D3D3L3L3L3L3B3B3B3B3f(Q4iFӌ=y%J+W"D^y%J+W"D^y%J+W"D^2ye+W&L^2y +W&L^2ye+W&B^ y*UȫW!fW 3W!B^ y*UȫW!B^*ȫ"*ȫ"*ȫ"*ȫ"*ȫ"*ȫ"jɫ&jɫ&jɫ&jɫ&jɫ&z>6f^=3~~K;0000(Q4hFьM3fDC>L0ô>L0ô>B#>B#>Q}hE(G>Ѵ}4iMhG\xkOp }<'>D}%+Q_JWD}%+Q_JW` zaWO0JWD}%+Q_JWD}%+Q_W2L}e+S_ }@_='}>L}e+S_W2` zaWO0W2L}e+S_W2L}e+S_*W UB}P_*W UB}P_ }@_='} zaWO0 }@_*W UB}P_*W UB}ꫢ*ꫢ*ꫢ*ꫢ*ꫢ*ꫢ*ꫢ*ꫢ*ꫢ*ꫢ*ꫢ*ꫢ*ꫢzaWO0 }@_='}>` *ꫢ*ꫢ*ꫢ*ꫦjꫦjꫦjꫦjꫦjꫦjꫦjꫦjꫦjꫦjꫦjꫦjꫦzaWO0 }@_=諦jꫦjꫦjꫦj'}>` ;𺃦_w !!!aaaaQ4hFьM3f4y+W"D^y%J+W"D^y%J+W"D^y%J+W&L^2ye+W&L^2ye+W&L^2yeUȫW!B^ y*UȫW!B^zax *UȫW!B^ yUUWE^yUUWE^yUUWE^y|0zax|0zaxUUWE^yUWM^5yUWM^5yUWM^5yUWM^5y|0zaxUWM^5y|ϵ}(;0000(Q4hFьM3ff^=0*ȫ"*ȫ"jɫ&jɫ&jɫ&jɫ&jɫ&z>f^=0z>3k/ ӌЌЌЌЌE3fh4iF3D^y%J+W"D^y%J+W"D^y%J+W"L^2ye+W&L^2ye+W&L^2ye+W&B^ y*UȫW!B^ y* 3'fW!B^ y*Uȫ"*ȫ"*ȫ"*ȫC`UWO0*ȫ"*ȫ&jɫ&jɫ&jɫ&jɫ&jɫ&jɫK?w>_׿ /X߰a}X` /Xaq}?=x}XG?#G?#? <^֟1c? 1c?  'O? 'O? 'O?) ) ) ) )oO?SO? 4O? 4O? 4O? 4O?dׇginJ￣|%x}XG`} 7oX?~` /X`oXa#G?#G?#G?1c? 1c? 1c?  'O? 'O? 'O?) ) ) ) ) ) iiiiii粼_o~]`} 7oX?~` /X`oXa#G?#G?#G?1c? 1c? 1c?  'O? 'O? 'O?) ) ) ) ) ) iiiiii˙___˂jF׌]3ft]3gt tzf3gF5׌^3z53z=ހހ#0FshnAF0Fshn a #hAhn a474a a470F040FshnAF0Fshn a #hAxn a<714a a<700140sxnC0sxn a chCxn a<714a a<70014L0&sdn@&0&sdn a h@dn a27L 4La a27L0&0 4L0&sdn@&0&sdn a h@057L Ss0 S0 Ss057L Ss4LA4L Ss057L S0 S057L Ss057LA4LA*c|0?̜熩ajn憩a a aznihihaznaaznaznihaznaaaznihihaznaa?Xk~=_/X_`} X?~` /X`oX#G?#G?#G? 1c? 1c? 1c? 'O? 'O? 'O? ) ) ) ) ) )iiii?6>?Gקg_Wׇu /X߰a}X` /Xaq}?#G?#G?#G? 1c? 1c? 1c? 'O? 'O? 'O ) ) ) ) ) )iiiiii~]`} 7oX?~` /X`oXa#G?#G?#G?1c? 1c? 1c?  'O? 'O? 'O?) ) ) ) ) ) iiiiii?~]`} 7oX?~` /X`oXa#G?#G?#G?1c? 1c? 1c?  'O? 'O? 'O?) ) ) ) ) ) iiiiii}5&&&&&&&&&&&&L(P4hBÄ Mz pI%K.\$pI%K.\$pI%K.\dp%K .\2dpɥ'&.\2dr%K& .\2dr)RK!.\ r)RKO0L] r)RK!B.\ r)RK.TRK.TRK.TRK.TRK.TRK.TRK .5RK .5RK .5RK .5RK .5RK .5û? AS𛂯;0000(Q4hFьM3fQ}hE(G>Ѵ}4iMyzkOpCWOp jD}%+Q_JWD}%+Q_JWD}%+Q_JWD}%+Q_JWD}%+Q_JW2L}e+S_W2W 2 z W2L}e+S_W2L}e+S_W2L}e+S_W2L}e+S_*W UB}P_*W UB}P_ +}@_ }@_*WO_1*WO0 *P_*W UB}P_*W UB}UWE}UWE}UWE}UWE}UWE}UWE}UWE}UWE}UWE}UWE}UWE}UWE}UWE}UWE}UWE}UWE}UWO_1` TWE}UWE}UWE}UWE}WM}WM}WM}WM}WM}WM}WM}WM}WM}WM}WM}WM}WM}WM}WM}WM}WM}WM}WM}WM}WO_1`_?D (ffffffffffff(Q4hFӌM3z!J+W"D^y%J+W"D^y%J+W"D^ye+W&L^2ye+W&L^2ye+W&L^2y*UȫW!B^ y*UȫW!B^ y*UȫW!B^ yUUWE^yUUWE^yUUWE^yUUWE^yUUWE^yUUWE^yUWM^5yUWM^5yUWM^5yUWM^5yUWM^5yUWM^5yC[30Ew !!!aaaaQ4hFьM3f4yȫ'f<5 +W"D^y%J+W"D^y%J+W"L^2ye+W&L^2ye+W&L^2ye+W&B^ y*UȫW!B^ y*UȫW!B^ y*UȫW!*ȫ"*ȫ"*ȫ"*ȫ"*ȫ"*ȫ"jɫ&jɫ&jɫ&jɫ&jɫ&jɫ&~~w;@w !!!aaaaQ4hFьM3f4y+W"D^zax J+W"D^y%J+W"D^ye+W&`^=02ye+W&L^2ye+W&L^ y*UȫW!B^ y*UȫW!B^ y*UȫW!B^yUUWE^yUUWE^yUUWE^yUUWE^yUUWE^yUUWE^5yUWM^5yUWM^5yUWM^5yUWM^5yUWM^5yUWM^-}(;0000(Q4hFьM3fDC>D0ô>L0ô>L#>B#>B(G>Q}hEhG>Ѵ}4i=CWOpCWOp }<'>D}%+Q_JWD}%+Q_JWD}%+Q_JWD}%+Q_JWD}%+Q_JWL}e+S_W2` zaWO0W2L}e+S_W2L}e+S_W2L}e+S_W2L}e+S_*W UB}P_*W UB}P_ }@_='}P_='}>`UB}P_*W UB}P_*W*ꫢ*ꫢ*ꫢ*ꫢ*ꫢ*ꫢ*ꫢ*ꫢ*ꫢ*ꫢ*ꫢ*ꫢ*ꫢ*ꫢ*ꫢ*ꫢ*'}>` *ꫢ*ꫢ*ꫢ*ꫦjꫦjꫦjꫦjꫦjꫦjꫦjꫦjꫦjꫦjꫦjꫦjꫦjꫦjꫦjꫦjꫦjꫦjꫦjꫦjꫦzaWO0 }@_=n?w"LI0w}G|/ لlB61fd3l& [-d f{nE7Fo ⇮/7{8qψ01&މ>ܔلlB6!Mfd3ٌlF6#[-d قluŦ6'͟qZ*𿅟cbLIOi5!M&fٌlF6#d قla[l|2B;]_Ǔq '|gD`Rx2NM&d لlF6#fd3قlA [-V7dx2v<s:'$;9dV لlb6fd3LlA [-f v>!'#Do8p<=x2ljcLO) لlB6!fd3ٌlF [-d f;srO9؎'455555}-|91&d'㴚M&d،lF6#fb قlA0[nEw>!zOƁ/8Ǔ >NܯcLO) لlB6!fd3ٌlF [-d f;srO9؎'455555}`R|2~FǓqZM&dDlF6#ff3قlA [-V7d;'@dx'k<#Ęz'ǓqJlB6!M&d3ٌlF6#-d قlAَ'\lǓqN.8%llllll? D(#;bB1P Lh&4  Äa0a0 aIx>4)(7xt3\Yn,t{:ErUg\Yn,u:˅reg\Yn,v{;ŝrug\Yn,w;rgó\Yn,x"D(xg\PL(&j! ̈́fB3B#a0L& f! @z.7|(!_W31q>_Ϝ ߋ3W} 2Gᨮ|}qA1PL(& ̈́fB3L&  Äa0a AtW4F̈́̈́̈́̈́̈́̈́?gAdQ]wńbB1B!Lh&4z!4 Äa0a a rO|ūBco <|a"s+ ńbB1Lh&4 ̈́a0a0L& @x>_&D7|DcLLLLLLsRD(xh\PL(&j! ̈́fB3B#a0L& f! @z.(!yS/5nq(L#Q8+z_ĄbB1P Lh&4  Äa0a0 a xY3c3c3c3cߌ:e9 GuE{) ńbB1Lh&4 ̈́f0a0L&  k |=_;Kݐ_E ńbB-BB3Lh&Bh$  Äa,A_̰܋<Hv~~q;%?gEAdQ]LޕPL(&j! ̈́fB3B#a0L& f! @x<_! +D>yΚf<+OY{QpTWtW#1PL(& ̈́fB3Lh&  Äa0auE 3;y>Ԝ\sy57y>D(gS ńbB1Lh&4 ̈́f0a0L&  k <| |.}1j&l&l&l&l&l&|0o]9 GuExj\PL(&j! ̈́fB3B#a0L& f! @z./(!_?⭩9f1ϽCY#s^g] ńbB1B!Lh&4z!4 Äa0a a SAt3:'Y3c3c3c3cߌ{!9| "sS$& ńbB1Lh&4 ̈́a0a0L& @z.(!_?yǬo"D7\揆ffffffŸ 2Gᨮ?'j\PL(&j! ̈́fB3B#a0L& f! @z./(!_?}9fWOu$ϽCs&>D(׽+1PL(&B($4 ̈́fB/F0a0L&B$|}*nzF1kflflflf|<$?]SAdQ]^yĄbB1PL(&4 ̈́fB30L&  Äa+e7|l_>՜\ߍ)9| "s^g2ĄbB1P Lh&4  Äa0a0 a ǬoeO9 GuEńbB1B!Lh&4z!4 Äa0a a r|Tsr:xH+ާ ߧיTbB1P Lh&4  Äa0a0 a rjΚf՜y>>՜\sSMYTpTWteO5.(& ńbB3Lh&4 Äa0a0L&|.}*nƨ,}*Q8+:2ոPL(& ̈́fB3Lh&  Äa0asyOE z./k5g}se5'\ϵ 2Gᨮ_>U}*Q8+zIO5.(&  ̈́fB3 0L&   k <| |.欙oSAdQ]1 ńbB1Lh&4 ̈́f0a0L&  k |=_Tݐ_yǬo"566666e9 GuEY{XbB1PL(&4 ̈́fB30L&  Äa_e7빼Ú92Ú|.=)9| "sγńbB1PLh&4 ̈́fB3a0L&  Ä5eMx>566666e9 GuE}Z ńbB-BB3Lh&Bh$  Äa,A_e7xjNYSh\TpTW:VbB1P Lh&4  Äa0a0 a Vs7^?ת>D(gȎ<.(&  ̈́fB3 0L&   k <݌uw<_u<_n)9| "s^gS ńbB-BB3Lh&Bh$  Äa,A+D7|h ոPL(&B($4 ̈́fB/F0a0L&B$|]SQvCxjNYS|T 2Gᨮu&>ոPL(&B($4 ̈́fB/F0a0L&B$|}*nܧffffƾ+ާjO9 GuE<, ńbB-BB3Lh&Bh$  Äa,A_>e7u>_^ԑ!9|/ "s^g] ńbB1B!Lh&4z!4 Äa0a a EAt3:c7| 2GᨮK1FbB1PL(& ̈́fB3L&  Äa0a r/܋VsEEx>^Ԕe9 GuEY{QbB1PL(&4 ̈́fB30L&  Äa2ߋ&<|/j 2ߋ,S ńbB1Lh&4 ̈́f0a0L&  k |={QݐTs7\Tsre|)9| "sγ̟O5.(& ńbB3Lh&4 Äa0a0L&|.}*n̟O5F̈́̈́̈́̈́̈́̈́g_O9 GuEY#1PL(& ̈́fB3Lh&  Äa0aLx>)(y<$?goAdQ]yHL(& ńbB3Lh&4 Äa0a0L&|.-n|Dsy 2߂ȑwEńbB1B!Lh&4z!4 Äa0a a r5=|9)9| "s ńbB1PLh&4 ̈́fB3a0L&  Ä5$d7LB6P;\Gv1ϳ<&^o 2Gᨮ|n ńbB1B!Lh&4z!4 Äa0a a {9 s4x5.7yֿ| "s2 ńbB1Lh&4 ̈́a0a0L& @xeMxe5F̈́̈́̈́̈́̈́̈́?goAdQ]빌k5.(&  ̈́fB3 0L&   k |^oQvC~{Xsr:+=#9ϵaAdQ]|{XbB1PL(&4 ̈́fB30L&  Äa_gu&!(g[yb<\|{e\_| "sqA1PLPHh&4 ̈́^a0a0L0HX^x @x9kflflflf8SsD(1 ńbB1Lh&4 ̈́f0a0L&  k <2Â&<2ffffffŸ 2Gᨮ\n ńbB1B!Lh&4z!4 Äa0a a {ln==x<'׬\ߍ)9| "s+ߧ ńbB1Lh&4 ̈́a0a0L& @:݌3 @y_9ϳ<&y;+YTpTWz}qA1PLPHh&4 ̈́^a0a0L0HX^yn 9ffffƾϳ<$?gaAdQ]\{XbB1PL(&4 ̈́fB30L&  ÄaϳD(WO5.(& ńbB3Lh&4 Äa0a0L&u&!_g|割uӚu1v|/ 9 GuE1 ńbB1Lh&4 ̈́f0a0L&  k <޿Bt_! cLLLLLLsvD(gyĄbB1PL(&4 ̈́fB30L&  Äaϳ'u&uI#9I?9 GuE3ńbB1B!Lh&4z!4 Äa0a a {^#n=yGs7yGSsFD(2H ńZfB3LH&  ÄY5g?<ߜffffƾϳwN%'ʼdYRsS N-Z8pz N/Y8pf™3 gMh m4q!x Mz <=/BQ%˒՝;߆©S N-^8pz g,Y8pfYC8;뼏a>F7뼏M:Cw,E,KVw:SS N-Z8pz N/Y8pf™3 gM: : > g/p se^,YON-Z8pj N/^8pf™3 g,5q >gOY/p g/p>/Q%˒՝;7rZ8pj) Nof,Y8pf欉~~~ {zW>F׻1/u!zN-_K%;{ھwS N-8Ŝ^8pz̙3 g,8Ü5qO-Ԏa3_vyS;Fuj9|ً2/Y}j׼N-Z8q9pz3 g,Y8q9k|Ol|>ư^H{!텴Ά9|2/Y}6ټN-Z8q9pz3 g,Y8q9k|wd+y_B i/=;M>×(e^;2-Z8pj© N/^8pz™3 g,Y8k|+_> ƖKl@z?z?9|2/Yukj©S N/^8pz3 g,Y8pfᬉ}ޗp@}=о;~bD7U19ZA%˒՝}̴pj©S N/^8pz3 g,Y8pfᬉ|?yl<ؘ g/p sޗnyɲdugu©S N-^8pz g,Y8pfY:s6p g/p sޗnyɲdugqM-Z8pjsz 7N3g,Y8pf sz?O@z??=<ߕ=|W>GjSd^,YޝN-Z8pjsz 7N3g,Y8pf s>S;=|1Nߗש. eާkj©S N/^8q9pf™3g&{98_l<o6B i/=;/7 eokj©S N/^8q9pf™3g&yul|1셴^H{!uއ9]7ȼdYynZ8pj) Nof,Y8pf欉|3 r3ywggzW|&-7 eާokj©S N/^8q9pf™3g&]> }jc N-~2N-~6;K%;{ZyM-Z8pjsz 7N3g,Y8pf szo͟Fzo9^H{!텴H_ޙ{gyɲdug󎟢6S NmbN/^8pzi™3 glaΚ8_?Yu޷;gs i/B3/ e{(cS N-Z8pz N/Y8pf™3 gMwwN癟hst<=}w,KVw:˽qM-Z8pj N/^8pf™3 g,5q;C8@:ctݔ>Dy_A%˒՝i©S N-^8pz g,Y8pfY~|?y3^8{셳^8{|rc 2/YuާL N-Z8pj N/^8pf™3 gΚ8_}yuާ^8{셳^8uK%;{)©S N-Z8pz ,Y8pf™&yy'ϏMz??F7F7뼏M:|]7ȼdYy2-Z8pj© N/^8pz™3 g,Y8k|_> ~^秬^8{셳^8ܒK%;{)©S N-Z8pz ,Y8pf™&y_> uޏuާ^8{셳^8ܯK%;{ݷpJ N-Z8q9pz3 g,Y8q9k|>׍u+va]9:ߗV=v%,KVwzJ/6S N-Z8pz ,Y8pf™&>SvSn{}wt99_oMyrK2/Y>)=S NmbN/^8pzi™3 glaΚ8_u簇穝{yjO)zNr 2/Y|JN-Z8pj N/^8pf™3 g,5qOv׍~Sz{}w6G7])zr 2/Y;-Z8pj) Nof,Y8pf欉d3&Y^H{!텴H_}uK%;{=ߗnZ8pj© N/^8pz™3 g,Y8k|d/wƬ^8{셳^8uK%;{?߇=Z8pj©S N/8͜Y8pf™3Y:s6q=q^H{!텴e,KVwz/w5pj©S N/^8pz™3 g,Y8p:s6p g/p sޗnyɲdug;۸N-Z8q9pz3 g,Y8q9k|n\7 os~Οd^,Y)X©S N-^8pz g,Y8pfYnF-HyOu/Nsޗkyɲdug4X©S 6N1N/^8pz4sf™3 g60gMXp@}?^o)7ֲXK%;{=kZ8pj© N/^8pz™3 g,Y8k|)Xh_o:|cm~{-7 e^O#cm\S N-Z8pz N/Y8pf™3 gMS;p@}Wyz {}w6G7뼟qއ9ˍ5ȼdYy_nkj©S N/^8pz3 g,Y8pfᬉ}޷kXh_o:|cmXK%;{+kZ8pj) Nof,Y8pf欉oB6p~w 9셴^H{!uor 2/Y}okj©S N/^8q9pf™3g&y_)do^H{!텴ynuK%;;ϏN-Z8pj N/^8pf™3 g,5q< ^8{셳^8{|r 2/YuޗnZ8pj© N/^8pz™3 g,Y8k|d/wƬ^8{셳^8uK%;{?N-Z8q9pz3 g,Y8q9k|9a[9睿urW)zNrc 2/Y}jsN N-Z8q9pz3 g,Y8q9k|ZfN^vsj{gyɲdugSS N-Z8pz N/Y8pf™3 gMS;p@}Wxl{}w6G7뼟qއ9ˍ5ȼdYy2-Z8pj© N/^8pz™3 g,Y8k|뼏aw|3:=},KVw~WΟ6S NmbN/^8pzi™3 glaΚ8_;[(dwg=9셴^H{!u[/w e}٣S N-8Ŝ^8pz̙3 g,8Ü5qD!8_}6B i/=;ud^,Yi©S N-^8pz g,Y8pfY/w 8_^mlz셳^8{9]7ȼdYy_>m\S N-Z8pz N/Y8pf™3 gMul|#{)녳^8{셳Οr 2/Y~Z8pj) Nof,Y8pf欉: 氇owmr- 2/Y}4uoA N-Z8q9pz3 g,Y8q9k|Mf^Gsr 2/Y}4ٸN-Z8q9pz3 g,Y8q9k|h 9罎[d^,Yh5qM-Z8pjsz 7N3g,Y8pf s>51 kbst{1:]0ȼdYwKcS N-Z8pz N/Y8pf™3 gM 8-A6p[^8{셳^8{|r 2/Yuޗ`Z8pj© N/^8pz™3 g,Y8k|98_}y^8{셳^8{|r 2/Yuޗ=©S N-^8pz g,Y8pfY/w 8_^}z셳^8{9]0ȼdYy_>l\S N-Z8pz N/Y8pf™3 gMl|#{)녳^8{셳/w e޿Z=©S 6N1N/^8pz4sf™3 g60gM_m5Kst{jmrm 2/Y}4#5pj©S N/8͜Y8pf™3Yhn}4j=u4y4-7 e^Gϣ9S NmbN/^8pzi™3 glaΚ8_Gu4簇ќ{y4h.7 eGoXkj©S N/^8q9pf™3g&nXQ8&߰{h #zd^,Y1©S N-Z8pz ,Y8pf™&wK 8-Y/p g/p>},KVw:SS N-Z8pz N/Y8pf™3 gM>g:S g/p g/y_A%˒՝rl\S N-Z8pz N/Y8pf™3 gMl|.ؘ g/p sޗ`yɲdug©S N-^8pz g,Y8pfY/w 8_} 6fp g/p.d^,YWk`Z8pj) Nof,Y8pf欉o`R8ry__ە- +[st{1/S;D?r 2/YujB i/==}w,KVw>98;9pjsz 7N3g,Y8pf s:˽3y?y^H{!텴H_};K%;;N-Z8pj N/^8pf™3 g,5q~F@̏a&=_7G7sޗ{gyɲdug;©S N-^8pz g,Y8pfYC8;뼏a>F7뼏M:Cd^,Y/A6S N-Z8pz ,Y8pf™&yQ87)yksts;=)zrc 2/Yuޗ ©S N-^8pz g,Y8pfYo7(P}s]99_=},KVw:ߣ©S N-^8pz g,Y8pfYuߣl|n{c g/p g/y_nA%˒՝(5pj©S N/^8pz™3 g,Y8p:ߣl|QY/p g/p~d^,YyL N-Z8pj N/^8pf™3 gΚ8ywY/p g/pIc[jfӇ: s@y Qg;-m5S8NS48 N48 ΀3 8΀3<9uK+αO{ow[y۸M})p "vippgrfwbxխ}^Zfhv6ҭ )p ipipgpiι%\WoюJkz߿;\-mM)p ȩipirzwgpٝ9Jn:[Oo>iKnݖfhv6pV)p )pipgpgp末[-|Kӭ[h[^~op4C ?c>S8NS48 N 8΀3 9;Osνӭ uޟ7V_}xK\-mb>S8NS48 N48 ΀3 8΀3<9WKk[,oюk=αbbmihm-:[})p "vippgrfw{Ogbηl=?ovtOoZ4ܝg )p ippgp9jٶX--]-ڱszzc{Iۻwg[3@;o8NS48 N49;΀3 8CӜ;ek/H/H/H/Ho~^o -~w֟)p )pipgpgp{ζVcYowg[3@;o?S8NS48 N 8΀3 9;OsVc5xxAzAzAzAztK}Xۚyxk)p ipipgpiαފs콷.8/8/8/8/8/8{/ֶfhv6Z)p "vippgrfw{8{k~x~5C ~o3NS8N48 N 8΀3 8Ӝc{o9]p^p^p^p^p^pߺmm[LS8ENN48 Nӻ3 8΀3<9[q֜֟zAzAzAztuJnkhm_g )p ippgp9{+αފs[}ۚy|Wr)pڝip&wgpgșy{o",Y>W3Kz]w땜Wr[3@;o]ô?S8NS48 N 8΀3 9;Os• uvu[j[o]Ԃ[Z}M8NS8 N48 N3 8΀3 8OsnHjج=-{z߽*[mihmcpV)p )pipgpgp{_bν/YkE;^+{U;ܺ-mV3NS9; N48MN΀3 8ΐ34t[~XmMwVop4C ڼ )pڝip&wgpgșysvE:W[-?sՖ[-ܝ-mnݚ)p )pipgpgp末]b.Yt{c5ұ^z;ܝ-m3NS8N48 N 8΀3 8ӜsK,ҹ%6{hkzc5ʱ~{ZLS8ENN48 Nӻ3 8΀3S8NS48 N 8΀3 9;Os~}i} [[nݖfhv6^.{NS8ENN48 Nӻ3 8΀3<9[q֜ctVzAzAzAzt}u3ܺ-|m)p ipipgpgys콷{8vyyyyy;\-m5S8NS48 N48 ΀3 8΀3<9[qVc]p^p^p^p^p^puK3@;oϗk"S8NS48 N 8΀3 9;Os{-鸷y߫UlK• -jM)p ȩipirzwgpٝ9jJn:WߺjKnݖfhv6Wߺg )rjwipޝgp!gviιZ>5\}KzX}4V~ kK3@;o/3NS9; N48MN΀3 8ΐ34\-| uvV%?ovVo-Z;[y;ܝg )p ippgp9jζX#qjE;RZOs>{/w;[y;ܝg )p ippgp9ҶXs}KE;ZOs}>њ=pw4C k8NS8N48 N 8΀3 8Ӝc[,ұ-6w=ޢW{O~{Z&p )p ippgp9ޗXsKlֱw=ı^{Mr}; ܝ-mu8NS48 N49;΀3 8CӜ;ei9^-ұ~{ZͽΖ;NS48 N 8΀3 9;OsҊsk E:^opw4C >S8NS48 N 8΀3 9;OsVc5{HK.֖fhv6_g )rjwipޝgp!gviαފs콷{{Ií -Z8NS8N48 N 8΀3 8ӜcnK+αOw$]p^p^p^p^p^pWrK3@;o{8NS8 N48 N3 8΀3 8Os-8Dkfhv6u)p ipipgpiαw\;|[m} -ᾮ>S8NS48 N48 ΀3 8΀3<9붴{u-m8NS48 N49;΀3 8CӜfE:mZuނBڿgp%4C r$p )rjwipޝgp!gviιZb;gp=ښڿgp4C ֭>S8NS48 N 8΀3 9;Os.HjZjXmM/dvX;p4C b>S8NS48 N 8΀3 9;Os.HjZjXmM/dv;;pw4C >S8NS48 N 8΀3 9;Os.HjZjXmM/dv;p=4C z>S8NS48 N 8΀3 9;Os.HjZjXmM/dv;p4C 3NS9; N48MN΀3 8ΐ34\-} uqv(^XmM_ZZy\yg)pڝip&wgpgșys>l:W8VZO/eY-c-{Q)p )pipgpgpg,8K+}Fm= ->S8NS48 N48 ΀3 8΀3<9XK+αwǪ/c-NS8N48 N48΀3 8΀4wK+ޗV߽vyyyyy;\r-m5S8NS48 N48 ΀3 8΀3<9[qVc]p^p^p^p^p^p7`K3@;o{oM8NS8 N48 N3 8΀3 8OsVc{k -[8NS8N48 N 8΀3 8Ӝc{o9opw4C NS8N48 N48΀3 8΀4{o9[qvyyyyy;\-m5S8NS48 N48 ΀3 8΀3<9[qVc]p^p^p^p^p_C madp-0.4/problems/PaxHeaders.5405/Access_Large_Synch.pgmx0000644000000000000000000000007412717644140020162 xustar0030 atime=1463765180.073720381 30 ctime=1463765201.025553043 madp-0.4/problems/Access_Large_Synch.pgmx0000775000372100037210000007310412717644140021021 0ustar00fransfrans00000000000000 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 1.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 1.0 0.0 0.0 1.0 0.95 0.05 1.0 0.0 0.0 0.3333333333 0.3333333333 0.3333333333 1.0 0.0 0.0 1.0 0.0 0.0 0.3333333333 0.3333333333 0.3333333333 1.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.2 0.8 0.0 0.0 0.2 0.8 0.0 0.0 1.0 1.0 0.0 0.0 0.8 0.2 0.0 0.0 0.8 0.2 0.0 1.0 0.95 0.05 0.0 0.0 1.0 0.0 0.2 0.2 0.0 0.6 0.2 0.6 0.0 0.2 0.6 0.2 0.0 0.2 0.0 0.0 1.0 0.0 0.2 0.2 0.0 0.6 0.2 0.6 0.0 0.2 0.6 0.2 0.0 0.2 0.2 0.2 0.6 0.0 0.0 0.0 0.0 0.0 0.2 0.6 0.2 0.0 0.0 0.0 0.0 0.0 0.6 0.2 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.2 0.8 0.0 0.0 0.0 0.0 0.0 0.0 0.8 0.2 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.2 0.2 0.6 0.0 0.0 0.0 0.0 0.0 0.2 0.6 0.2 0.0 0.0 0.0 0.0 0.0 0.6 0.2 0.2 0.5 0.5 1.0 0.0 0.2 0.8 0.8 0.2 0.0 -1.0 -1.0 0.0 5.0 -5.0 -1.0 -5.0 5.0 0.0 -1.0 -1.0 0.0 5.0 -5.0 -1.0 -5.0 5.0 5.0 -1.0 -1.0 0.0 madp-0.4/problems/PaxHeaders.5405/GridSmall.dpomdp0000644000000000000000000000007412717644140016671 xustar0030 atime=1463765180.073720381 30 ctime=1463765201.025553043 madp-0.4/problems/GridSmall.dpomdp0000664000372100037210000022732212717644140017530 0ustar00fransfrans00000000000000# Meeting in a 2x2 grid DEC-POMDP description # GridSmall.dpomdp # Problem appeared in (Bernstein, Hansen & Zilberstein, IJCAI 2005). # This is the version with 2 observations per agents (Amato, # Bernstein & Zilberstein, AAMAS Workshop on Multi-Agent Sequential # Decision Making in Uncertain Domains (MSDM) 2006). # # .dpomdp description converted from .posg description provided at # http://rbr.cs.umass.edu/~camato/decpomdp/GridSmall.posg # Fixed rounding errors (e.g., replaced 0.63999 with 0.64). agents: 2 discount: 0.9 values: reward states: 16 start: 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 actions: up down left right stay up down left right stay observations: nnnnnynnn nnnynnnnn nnnnnynnn nnnynnnnn T: up up : 0 : 5 : 0.01 T: up up : 0 : 6 : 0.01 T: up up : 0 : 4 : 0.08 T: up up : 0 : 9 : 0.01 T: up up : 0 : 10 : 0.01 T: up up : 0 : 8 : 0.08 T: up up : 0 : 1 : 0.08 T: up up : 0 : 2 : 0.08 T: up up : 0 : 0 : 0.64 T: up down : 0 : 6 : 0.06 T: up down : 0 : 5 : 0.01 T: up down : 0 : 4 : 0.03 T: up down : 0 : 10 : 0.06 T: up down : 0 : 9 : 0.01 T: up down : 0 : 8 : 0.03 T: up down : 0 : 2 : 0.48 T: up down : 0 : 1 : 0.08 T: up down : 0 : 0 : 0.24 T: up left : 0 : 6 : 0.01 T: up left : 0 : 5 : 0.01 T: up left : 0 : 4 : 0.08 T: up left : 0 : 10 : 0.01 T: up left : 0 : 9 : 0.01 T: up left : 0 : 8 : 0.08 T: up left : 0 : 2 : 0.08 T: up left : 0 : 1 : 0.08 T: up left : 0 : 0 : 0.64 T: up right : 0 : 5 : 0.06 T: up right : 0 : 6 : 0.01 T: up right : 0 : 4 : 0.03 T: up right : 0 : 9 : 0.06 T: up right : 0 : 10 : 0.01 T: up right : 0 : 8 : 0.03 T: up right : 0 : 1 : 0.48 T: up right : 0 : 2 : 0.08 T: up right : 0 : 0 : 0.24 T: up stay : 0 : 4 : 0.1 T: up stay : 0 : 8 : 0.1 T: up stay : 0 : 0 : 0.8 T: down up : 0 : 9 : 0.06 T: down up : 0 : 10 : 0.06 T: down up : 0 : 8 : 0.48 T: down up : 0 : 5 : 0.01 T: down up : 0 : 6 : 0.01 T: down up : 0 : 4 : 0.08 T: down up : 0 : 1 : 0.03 T: down up : 0 : 2 : 0.03 T: down up : 0 : 0 : 0.24 T: down down : 0 : 10 : 0.36 T: down down : 0 : 9 : 0.06 T: down down : 0 : 8 : 0.18 T: down down : 0 : 6 : 0.06 T: down down : 0 : 5 : 0.01 T: down down : 0 : 4 : 0.03 T: down down : 0 : 2 : 0.18 T: down down : 0 : 1 : 0.03 T: down down : 0 : 0 : 0.09 T: down left : 0 : 10 : 0.06 T: down left : 0 : 9 : 0.06 T: down left : 0 : 8 : 0.48 T: down left : 0 : 6 : 0.01 T: down left : 0 : 5 : 0.01 T: down left : 0 : 4 : 0.08 T: down left : 0 : 2 : 0.03 T: down left : 0 : 1 : 0.03 T: down left : 0 : 0 : 0.24 T: down right : 0 : 9 : 0.36 T: down right : 0 : 10 : 0.06 T: down right : 0 : 8 : 0.18 T: down right : 0 : 5 : 0.06 T: down right : 0 : 6 : 0.01 T: down right : 0 : 4 : 0.03 T: down right : 0 : 1 : 0.18 T: down right : 0 : 2 : 0.03 T: down right : 0 : 0 : 0.09 T: down stay : 0 : 8 : 0.6 T: down stay : 0 : 4 : 0.1 T: down stay : 0 : 0 : 0.3 T: left up : 0 : 9 : 0.01 T: left up : 0 : 10 : 0.01 T: left up : 0 : 8 : 0.08 T: left up : 0 : 5 : 0.01 T: left up : 0 : 6 : 0.01 T: left up : 0 : 4 : 0.08 T: left up : 0 : 1 : 0.08 T: left up : 0 : 2 : 0.08 T: left up : 0 : 0 : 0.64 T: left down : 0 : 10 : 0.06 T: left down : 0 : 9 : 0.01 T: left down : 0 : 8 : 0.03 T: left down : 0 : 6 : 0.06 T: left down : 0 : 5 : 0.01 T: left down : 0 : 4 : 0.03 T: left down : 0 : 2 : 0.48 T: left down : 0 : 1 : 0.08 T: left down : 0 : 0 : 0.24 T: left left : 0 : 10 : 0.01 T: left left : 0 : 9 : 0.01 T: left left : 0 : 8 : 0.08 T: left left : 0 : 6 : 0.01 T: left left : 0 : 5 : 0.01 T: left left : 0 : 4 : 0.08 T: left left : 0 : 2 : 0.08 T: left left : 0 : 1 : 0.08 T: left left : 0 : 0 : 0.64 T: left right : 0 : 9 : 0.06 T: left right : 0 : 10 : 0.01 T: left right : 0 : 8 : 0.03 T: left right : 0 : 5 : 0.06 T: left right : 0 : 6 : 0.01 T: left right : 0 : 4 : 0.03 T: left right : 0 : 1 : 0.48 T: left right : 0 : 2 : 0.08 T: left right : 0 : 0 : 0.24 T: left stay : 0 : 8 : 0.1 T: left stay : 0 : 4 : 0.1 T: left stay : 0 : 0 : 0.8 T: right up : 0 : 5 : 0.06 T: right up : 0 : 6 : 0.06 T: right up : 0 : 4 : 0.48 T: right up : 0 : 9 : 0.01 T: right up : 0 : 10 : 0.01 T: right up : 0 : 8 : 0.08 T: right up : 0 : 1 : 0.03 T: right up : 0 : 2 : 0.03 T: right up : 0 : 0 : 0.24 T: right down : 0 : 6 : 0.36 T: right down : 0 : 5 : 0.06 T: right down : 0 : 4 : 0.18 T: right down : 0 : 10 : 0.06 T: right down : 0 : 9 : 0.01 T: right down : 0 : 8 : 0.03 T: right down : 0 : 2 : 0.18 T: right down : 0 : 1 : 0.03 T: right down : 0 : 0 : 0.09 T: right left : 0 : 6 : 0.06 T: right left : 0 : 5 : 0.06 T: right left : 0 : 4 : 0.48 T: right left : 0 : 10 : 0.01 T: right left : 0 : 9 : 0.01 T: right left : 0 : 8 : 0.08 T: right left : 0 : 2 : 0.03 T: right left : 0 : 1 : 0.03 T: right left : 0 : 0 : 0.24 T: right right : 0 : 5 : 0.36 T: right right : 0 : 6 : 0.06 T: right right : 0 : 4 : 0.18 T: right right : 0 : 9 : 0.06 T: right right : 0 : 10 : 0.01 T: right right : 0 : 8 : 0.03 T: right right : 0 : 1 : 0.18 T: right right : 0 : 2 : 0.03 T: right right : 0 : 0 : 0.09 T: right stay : 0 : 4 : 0.6 T: right stay : 0 : 8 : 0.1 T: right stay : 0 : 0 : 0.3 T: stay up : 0 : 1 : 0.1 T: stay up : 0 : 2 : 0.1 T: stay up : 0 : 0 : 0.8 T: stay down : 0 : 2 : 0.6 T: stay down : 0 : 1 : 0.1 T: stay down : 0 : 0 : 0.3 T: stay left : 0 : 2 : 0.1 T: stay left : 0 : 1 : 0.1 T: stay left : 0 : 0 : 0.8 T: stay right : 0 : 1 : 0.6 T: stay right : 0 : 2 : 0.1 T: stay right : 0 : 0 : 0.3 T: stay stay : 0 : 0 : 1.0 T: up up : 1 : 4 : 0.01 T: up up : 1 : 7 : 0.01 T: up up : 1 : 5 : 0.08 T: up up : 1 : 8 : 0.01 T: up up : 1 : 11 : 0.01 T: up up : 1 : 9 : 0.08 T: up up : 1 : 0 : 0.08 T: up up : 1 : 3 : 0.08 T: up up : 1 : 1 : 0.64 T: up down : 1 : 7 : 0.06 T: up down : 1 : 4 : 0.01 T: up down : 1 : 5 : 0.03 T: up down : 1 : 11 : 0.06 T: up down : 1 : 8 : 0.01 T: up down : 1 : 9 : 0.03 T: up down : 1 : 3 : 0.48 T: up down : 1 : 0 : 0.08 T: up down : 1 : 1 : 0.24 T: up left : 1 : 4 : 0.06 T: up left : 1 : 7 : 0.01 T: up left : 1 : 5 : 0.03 T: up left : 1 : 8 : 0.06 T: up left : 1 : 11 : 0.01 T: up left : 1 : 9 : 0.03 T: up left : 1 : 0 : 0.48 T: up left : 1 : 3 : 0.08 T: up left : 1 : 1 : 0.24 T: up right : 1 : 7 : 0.01 T: up right : 1 : 4 : 0.01 T: up right : 1 : 5 : 0.08 T: up right : 1 : 11 : 0.01 T: up right : 1 : 8 : 0.01 T: up right : 1 : 9 : 0.08 T: up right : 1 : 3 : 0.08 T: up right : 1 : 0 : 0.08 T: up right : 1 : 1 : 0.64 T: up stay : 1 : 5 : 0.1 T: up stay : 1 : 9 : 0.1 T: up stay : 1 : 1 : 0.8 T: down up : 1 : 8 : 0.06 T: down up : 1 : 11 : 0.06 T: down up : 1 : 9 : 0.48 T: down up : 1 : 4 : 0.01 T: down up : 1 : 7 : 0.01 T: down up : 1 : 5 : 0.08 T: down up : 1 : 0 : 0.03 T: down up : 1 : 3 : 0.03 T: down up : 1 : 1 : 0.24 T: down down : 1 : 11 : 0.36 T: down down : 1 : 8 : 0.06 T: down down : 1 : 9 : 0.18 T: down down : 1 : 7 : 0.06 T: down down : 1 : 4 : 0.01 T: down down : 1 : 5 : 0.03 T: down down : 1 : 3 : 0.18 T: down down : 1 : 0 : 0.03 T: down down : 1 : 1 : 0.09 T: down left : 1 : 8 : 0.36 T: down left : 1 : 11 : 0.06 T: down left : 1 : 9 : 0.18 T: down left : 1 : 4 : 0.06 T: down left : 1 : 7 : 0.01 T: down left : 1 : 5 : 0.03 T: down left : 1 : 0 : 0.18 T: down left : 1 : 3 : 0.03 T: down left : 1 : 1 : 0.09 T: down right : 1 : 11 : 0.06 T: down right : 1 : 8 : 0.06 T: down right : 1 : 9 : 0.48 T: down right : 1 : 7 : 0.01 T: down right : 1 : 4 : 0.01 T: down right : 1 : 5 : 0.08 T: down right : 1 : 3 : 0.03 T: down right : 1 : 0 : 0.03 T: down right : 1 : 1 : 0.24 T: down stay : 1 : 9 : 0.6 T: down stay : 1 : 5 : 0.1 T: down stay : 1 : 1 : 0.3 T: left up : 1 : 8 : 0.01 T: left up : 1 : 11 : 0.01 T: left up : 1 : 9 : 0.08 T: left up : 1 : 4 : 0.01 T: left up : 1 : 7 : 0.01 T: left up : 1 : 5 : 0.08 T: left up : 1 : 0 : 0.08 T: left up : 1 : 3 : 0.08 T: left up : 1 : 1 : 0.64 T: left down : 1 : 11 : 0.06 T: left down : 1 : 8 : 0.01 T: left down : 1 : 9 : 0.03 T: left down : 1 : 7 : 0.06 T: left down : 1 : 4 : 0.01 T: left down : 1 : 5 : 0.03 T: left down : 1 : 3 : 0.48 T: left down : 1 : 0 : 0.08 T: left down : 1 : 1 : 0.24 T: left left : 1 : 8 : 0.06 T: left left : 1 : 11 : 0.01 T: left left : 1 : 9 : 0.03 T: left left : 1 : 4 : 0.06 T: left left : 1 : 7 : 0.01 T: left left : 1 : 5 : 0.03 T: left left : 1 : 0 : 0.48 T: left left : 1 : 3 : 0.08 T: left left : 1 : 1 : 0.24 T: left right : 1 : 11 : 0.01 T: left right : 1 : 8 : 0.01 T: left right : 1 : 9 : 0.08 T: left right : 1 : 7 : 0.01 T: left right : 1 : 4 : 0.01 T: left right : 1 : 5 : 0.08 T: left right : 1 : 3 : 0.08 T: left right : 1 : 0 : 0.08 T: left right : 1 : 1 : 0.64 T: left stay : 1 : 9 : 0.1 T: left stay : 1 : 5 : 0.1 T: left stay : 1 : 1 : 0.8 T: right up : 1 : 4 : 0.06 T: right up : 1 : 7 : 0.06 T: right up : 1 : 5 : 0.48 T: right up : 1 : 8 : 0.01 T: right up : 1 : 11 : 0.01 T: right up : 1 : 9 : 0.08 T: right up : 1 : 0 : 0.03 T: right up : 1 : 3 : 0.03 T: right up : 1 : 1 : 0.24 T: right down : 1 : 7 : 0.36 T: right down : 1 : 4 : 0.06 T: right down : 1 : 5 : 0.18 T: right down : 1 : 11 : 0.06 T: right down : 1 : 8 : 0.01 T: right down : 1 : 9 : 0.03 T: right down : 1 : 3 : 0.18 T: right down : 1 : 0 : 0.03 T: right down : 1 : 1 : 0.09 T: right left : 1 : 4 : 0.36 T: right left : 1 : 7 : 0.06 T: right left : 1 : 5 : 0.18 T: right left : 1 : 8 : 0.06 T: right left : 1 : 11 : 0.01 T: right left : 1 : 9 : 0.03 T: right left : 1 : 0 : 0.18 T: right left : 1 : 3 : 0.03 T: right left : 1 : 1 : 0.09 T: right right : 1 : 7 : 0.06 T: right right : 1 : 4 : 0.06 T: right right : 1 : 5 : 0.48 T: right right : 1 : 11 : 0.01 T: right right : 1 : 8 : 0.01 T: right right : 1 : 9 : 0.08 T: right right : 1 : 3 : 0.03 T: right right : 1 : 0 : 0.03 T: right right : 1 : 1 : 0.24 T: right stay : 1 : 5 : 0.6 T: right stay : 1 : 9 : 0.1 T: right stay : 1 : 1 : 0.3 T: stay up : 1 : 0 : 0.1 T: stay up : 1 : 3 : 0.1 T: stay up : 1 : 1 : 0.8 T: stay down : 1 : 3 : 0.6 T: stay down : 1 : 0 : 0.1 T: stay down : 1 : 1 : 0.3 T: stay left : 1 : 0 : 0.6 T: stay left : 1 : 3 : 0.1 T: stay left : 1 : 1 : 0.3 T: stay right : 1 : 3 : 0.1 T: stay right : 1 : 0 : 0.1 T: stay right : 1 : 1 : 0.8 T: stay stay : 1 : 1 : 1.0 T: up up : 2 : 4 : 0.06 T: up up : 2 : 7 : 0.01 T: up up : 2 : 6 : 0.03 T: up up : 2 : 8 : 0.06 T: up up : 2 : 11 : 0.01 T: up up : 2 : 10 : 0.03 T: up up : 2 : 0 : 0.48 T: up up : 2 : 3 : 0.08 T: up up : 2 : 2 : 0.24 T: up down : 2 : 7 : 0.01 T: up down : 2 : 4 : 0.01 T: up down : 2 : 6 : 0.08 T: up down : 2 : 11 : 0.01 T: up down : 2 : 8 : 0.01 T: up down : 2 : 10 : 0.08 T: up down : 2 : 3 : 0.08 T: up down : 2 : 0 : 0.08 T: up down : 2 : 2 : 0.64 T: up left : 2 : 4 : 0.01 T: up left : 2 : 7 : 0.01 T: up left : 2 : 6 : 0.08 T: up left : 2 : 8 : 0.01 T: up left : 2 : 11 : 0.01 T: up left : 2 : 10 : 0.08 T: up left : 2 : 0 : 0.08 T: up left : 2 : 3 : 0.08 T: up left : 2 : 2 : 0.64 T: up right : 2 : 7 : 0.06 T: up right : 2 : 4 : 0.01 T: up right : 2 : 6 : 0.03 T: up right : 2 : 11 : 0.06 T: up right : 2 : 8 : 0.01 T: up right : 2 : 10 : 0.03 T: up right : 2 : 3 : 0.48 T: up right : 2 : 0 : 0.08 T: up right : 2 : 2 : 0.24 T: up stay : 2 : 6 : 0.1 T: up stay : 2 : 10 : 0.1 T: up stay : 2 : 2 : 0.8 T: down up : 2 : 8 : 0.36 T: down up : 2 : 11 : 0.06 T: down up : 2 : 10 : 0.18 T: down up : 2 : 4 : 0.06 T: down up : 2 : 7 : 0.01 T: down up : 2 : 6 : 0.03 T: down up : 2 : 0 : 0.18 T: down up : 2 : 3 : 0.03 T: down up : 2 : 2 : 0.09 T: down down : 2 : 11 : 0.06 T: down down : 2 : 8 : 0.06 T: down down : 2 : 10 : 0.48 T: down down : 2 : 7 : 0.01 T: down down : 2 : 4 : 0.01 T: down down : 2 : 6 : 0.08 T: down down : 2 : 3 : 0.03 T: down down : 2 : 0 : 0.03 T: down down : 2 : 2 : 0.24 T: down left : 2 : 8 : 0.06 T: down left : 2 : 11 : 0.06 T: down left : 2 : 10 : 0.48 T: down left : 2 : 4 : 0.01 T: down left : 2 : 7 : 0.01 T: down left : 2 : 6 : 0.08 T: down left : 2 : 0 : 0.03 T: down left : 2 : 3 : 0.03 T: down left : 2 : 2 : 0.24 T: down right : 2 : 11 : 0.36 T: down right : 2 : 8 : 0.06 T: down right : 2 : 10 : 0.18 T: down right : 2 : 7 : 0.06 T: down right : 2 : 4 : 0.01 T: down right : 2 : 6 : 0.03 T: down right : 2 : 3 : 0.18 T: down right : 2 : 0 : 0.03 T: down right : 2 : 2 : 0.09 T: down stay : 2 : 10 : 0.6 T: down stay : 2 : 6 : 0.1 T: down stay : 2 : 2 : 0.3 T: left up : 2 : 8 : 0.06 T: left up : 2 : 11 : 0.01 T: left up : 2 : 10 : 0.03 T: left up : 2 : 4 : 0.06 T: left up : 2 : 7 : 0.01 T: left up : 2 : 6 : 0.03 T: left up : 2 : 0 : 0.48 T: left up : 2 : 3 : 0.08 T: left up : 2 : 2 : 0.24 T: left down : 2 : 11 : 0.01 T: left down : 2 : 8 : 0.01 T: left down : 2 : 10 : 0.08 T: left down : 2 : 7 : 0.01 T: left down : 2 : 4 : 0.01 T: left down : 2 : 6 : 0.08 T: left down : 2 : 3 : 0.08 T: left down : 2 : 0 : 0.08 T: left down : 2 : 2 : 0.64 T: left left : 2 : 8 : 0.01 T: left left : 2 : 11 : 0.01 T: left left : 2 : 10 : 0.08 T: left left : 2 : 4 : 0.01 T: left left : 2 : 7 : 0.01 T: left left : 2 : 6 : 0.08 T: left left : 2 : 0 : 0.08 T: left left : 2 : 3 : 0.08 T: left left : 2 : 2 : 0.64 T: left right : 2 : 11 : 0.06 T: left right : 2 : 8 : 0.01 T: left right : 2 : 10 : 0.03 T: left right : 2 : 7 : 0.06 T: left right : 2 : 4 : 0.01 T: left right : 2 : 6 : 0.03 T: left right : 2 : 3 : 0.48 T: left right : 2 : 0 : 0.08 T: left right : 2 : 2 : 0.24 T: left stay : 2 : 10 : 0.1 T: left stay : 2 : 6 : 0.1 T: left stay : 2 : 2 : 0.8 T: right up : 2 : 4 : 0.36 T: right up : 2 : 7 : 0.06 T: right up : 2 : 6 : 0.18 T: right up : 2 : 8 : 0.06 T: right up : 2 : 11 : 0.01 T: right up : 2 : 10 : 0.03 T: right up : 2 : 0 : 0.18 T: right up : 2 : 3 : 0.03 T: right up : 2 : 2 : 0.09 T: right down : 2 : 7 : 0.06 T: right down : 2 : 4 : 0.06 T: right down : 2 : 6 : 0.48 T: right down : 2 : 11 : 0.01 T: right down : 2 : 8 : 0.01 T: right down : 2 : 10 : 0.08 T: right down : 2 : 3 : 0.03 T: right down : 2 : 0 : 0.03 T: right down : 2 : 2 : 0.24 T: right left : 2 : 4 : 0.06 T: right left : 2 : 7 : 0.06 T: right left : 2 : 6 : 0.48 T: right left : 2 : 8 : 0.01 T: right left : 2 : 11 : 0.01 T: right left : 2 : 10 : 0.08 T: right left : 2 : 0 : 0.03 T: right left : 2 : 3 : 0.03 T: right left : 2 : 2 : 0.24 T: right right : 2 : 7 : 0.36 T: right right : 2 : 4 : 0.06 T: right right : 2 : 6 : 0.18 T: right right : 2 : 11 : 0.06 T: right right : 2 : 8 : 0.01 T: right right : 2 : 10 : 0.03 T: right right : 2 : 3 : 0.18 T: right right : 2 : 0 : 0.03 T: right right : 2 : 2 : 0.09 T: right stay : 2 : 6 : 0.6 T: right stay : 2 : 10 : 0.1 T: right stay : 2 : 2 : 0.3 T: stay up : 2 : 0 : 0.6 T: stay up : 2 : 3 : 0.1 T: stay up : 2 : 2 : 0.3 T: stay down : 2 : 3 : 0.1 T: stay down : 2 : 0 : 0.1 T: stay down : 2 : 2 : 0.8 T: stay left : 2 : 0 : 0.1 T: stay left : 2 : 3 : 0.1 T: stay left : 2 : 2 : 0.8 T: stay right : 2 : 3 : 0.6 T: stay right : 2 : 0 : 0.1 T: stay right : 2 : 2 : 0.3 T: stay stay : 2 : 2 : 1.0 T: up up : 3 : 5 : 0.06 T: up up : 3 : 6 : 0.01 T: up up : 3 : 7 : 0.03 T: up up : 3 : 9 : 0.06 T: up up : 3 : 10 : 0.01 T: up up : 3 : 11 : 0.03 T: up up : 3 : 1 : 0.48 T: up up : 3 : 2 : 0.08 T: up up : 3 : 3 : 0.24 T: up down : 3 : 6 : 0.01 T: up down : 3 : 5 : 0.01 T: up down : 3 : 7 : 0.08 T: up down : 3 : 10 : 0.01 T: up down : 3 : 9 : 0.01 T: up down : 3 : 11 : 0.08 T: up down : 3 : 2 : 0.08 T: up down : 3 : 1 : 0.08 T: up down : 3 : 3 : 0.64 T: up left : 3 : 6 : 0.06 T: up left : 3 : 5 : 0.01 T: up left : 3 : 7 : 0.03 T: up left : 3 : 10 : 0.06 T: up left : 3 : 9 : 0.01 T: up left : 3 : 11 : 0.03 T: up left : 3 : 2 : 0.48 T: up left : 3 : 1 : 0.08 T: up left : 3 : 3 : 0.24 T: up right : 3 : 5 : 0.01 T: up right : 3 : 6 : 0.01 T: up right : 3 : 7 : 0.08 T: up right : 3 : 9 : 0.01 T: up right : 3 : 10 : 0.01 T: up right : 3 : 11 : 0.08 T: up right : 3 : 1 : 0.08 T: up right : 3 : 2 : 0.08 T: up right : 3 : 3 : 0.64 T: up stay : 3 : 7 : 0.1 T: up stay : 3 : 11 : 0.1 T: up stay : 3 : 3 : 0.8 T: down up : 3 : 9 : 0.36 T: down up : 3 : 10 : 0.06 T: down up : 3 : 11 : 0.18 T: down up : 3 : 5 : 0.06 T: down up : 3 : 6 : 0.01 T: down up : 3 : 7 : 0.03 T: down up : 3 : 1 : 0.18 T: down up : 3 : 2 : 0.03 T: down up : 3 : 3 : 0.09 T: down down : 3 : 10 : 0.06 T: down down : 3 : 9 : 0.06 T: down down : 3 : 11 : 0.48 T: down down : 3 : 6 : 0.01 T: down down : 3 : 5 : 0.01 T: down down : 3 : 7 : 0.08 T: down down : 3 : 2 : 0.03 T: down down : 3 : 1 : 0.03 T: down down : 3 : 3 : 0.24 T: down left : 3 : 10 : 0.36 T: down left : 3 : 9 : 0.06 T: down left : 3 : 11 : 0.18 T: down left : 3 : 6 : 0.06 T: down left : 3 : 5 : 0.01 T: down left : 3 : 7 : 0.03 T: down left : 3 : 2 : 0.18 T: down left : 3 : 1 : 0.03 T: down left : 3 : 3 : 0.09 T: down right : 3 : 9 : 0.06 T: down right : 3 : 10 : 0.06 T: down right : 3 : 11 : 0.48 T: down right : 3 : 5 : 0.01 T: down right : 3 : 6 : 0.01 T: down right : 3 : 7 : 0.08 T: down right : 3 : 1 : 0.03 T: down right : 3 : 2 : 0.03 T: down right : 3 : 3 : 0.24 T: down stay : 3 : 11 : 0.6 T: down stay : 3 : 7 : 0.1 T: down stay : 3 : 3 : 0.3 T: left up : 3 : 9 : 0.06 T: left up : 3 : 10 : 0.01 T: left up : 3 : 11 : 0.03 T: left up : 3 : 5 : 0.06 T: left up : 3 : 6 : 0.01 T: left up : 3 : 7 : 0.03 T: left up : 3 : 1 : 0.48 T: left up : 3 : 2 : 0.08 T: left up : 3 : 3 : 0.24 T: left down : 3 : 10 : 0.01 T: left down : 3 : 9 : 0.01 T: left down : 3 : 11 : 0.08 T: left down : 3 : 6 : 0.01 T: left down : 3 : 5 : 0.01 T: left down : 3 : 7 : 0.08 T: left down : 3 : 2 : 0.08 T: left down : 3 : 1 : 0.08 T: left down : 3 : 3 : 0.64 T: left left : 3 : 10 : 0.06 T: left left : 3 : 9 : 0.01 T: left left : 3 : 11 : 0.03 T: left left : 3 : 6 : 0.06 T: left left : 3 : 5 : 0.01 T: left left : 3 : 7 : 0.03 T: left left : 3 : 2 : 0.48 T: left left : 3 : 1 : 0.08 T: left left : 3 : 3 : 0.24 T: left right : 3 : 9 : 0.01 T: left right : 3 : 10 : 0.01 T: left right : 3 : 11 : 0.08 T: left right : 3 : 5 : 0.01 T: left right : 3 : 6 : 0.01 T: left right : 3 : 7 : 0.08 T: left right : 3 : 1 : 0.08 T: left right : 3 : 2 : 0.08 T: left right : 3 : 3 : 0.64 T: left stay : 3 : 11 : 0.1 T: left stay : 3 : 7 : 0.1 T: left stay : 3 : 3 : 0.8 T: right up : 3 : 5 : 0.36 T: right up : 3 : 6 : 0.06 T: right up : 3 : 7 : 0.18 T: right up : 3 : 9 : 0.06 T: right up : 3 : 10 : 0.01 T: right up : 3 : 11 : 0.03 T: right up : 3 : 1 : 0.18 T: right up : 3 : 2 : 0.03 T: right up : 3 : 3 : 0.09 T: right down : 3 : 6 : 0.06 T: right down : 3 : 5 : 0.06 T: right down : 3 : 7 : 0.48 T: right down : 3 : 10 : 0.01 T: right down : 3 : 9 : 0.01 T: right down : 3 : 11 : 0.08 T: right down : 3 : 2 : 0.03 T: right down : 3 : 1 : 0.03 T: right down : 3 : 3 : 0.24 T: right left : 3 : 6 : 0.36 T: right left : 3 : 5 : 0.06 T: right left : 3 : 7 : 0.18 T: right left : 3 : 10 : 0.06 T: right left : 3 : 9 : 0.01 T: right left : 3 : 11 : 0.03 T: right left : 3 : 2 : 0.18 T: right left : 3 : 1 : 0.03 T: right left : 3 : 3 : 0.09 T: right right : 3 : 5 : 0.06 T: right right : 3 : 6 : 0.06 T: right right : 3 : 7 : 0.48 T: right right : 3 : 9 : 0.01 T: right right : 3 : 10 : 0.01 T: right right : 3 : 11 : 0.08 T: right right : 3 : 1 : 0.03 T: right right : 3 : 2 : 0.03 T: right right : 3 : 3 : 0.24 T: right stay : 3 : 7 : 0.6 T: right stay : 3 : 11 : 0.1 T: right stay : 3 : 3 : 0.3 T: stay up : 3 : 1 : 0.6 T: stay up : 3 : 2 : 0.1 T: stay up : 3 : 3 : 0.3 T: stay down : 3 : 2 : 0.1 T: stay down : 3 : 1 : 0.1 T: stay down : 3 : 3 : 0.8 T: stay left : 3 : 2 : 0.6 T: stay left : 3 : 1 : 0.1 T: stay left : 3 : 3 : 0.3 T: stay right : 3 : 1 : 0.1 T: stay right : 3 : 2 : 0.1 T: stay right : 3 : 3 : 0.8 T: stay stay : 3 : 3 : 1.0 T: up up : 4 : 1 : 0.01 T: up up : 4 : 2 : 0.01 T: up up : 4 : 0 : 0.08 T: up up : 4 : 13 : 0.01 T: up up : 4 : 14 : 0.01 T: up up : 4 : 12 : 0.08 T: up up : 4 : 5 : 0.08 T: up up : 4 : 6 : 0.08 T: up up : 4 : 4 : 0.64 T: up down : 4 : 2 : 0.06 T: up down : 4 : 1 : 0.01 T: up down : 4 : 0 : 0.03 T: up down : 4 : 14 : 0.06 T: up down : 4 : 13 : 0.01 T: up down : 4 : 12 : 0.03 T: up down : 4 : 6 : 0.48 T: up down : 4 : 5 : 0.08 T: up down : 4 : 4 : 0.24 T: up left : 4 : 2 : 0.01 T: up left : 4 : 1 : 0.01 T: up left : 4 : 0 : 0.08 T: up left : 4 : 14 : 0.01 T: up left : 4 : 13 : 0.01 T: up left : 4 : 12 : 0.08 T: up left : 4 : 6 : 0.08 T: up left : 4 : 5 : 0.08 T: up left : 4 : 4 : 0.64 T: up right : 4 : 1 : 0.06 T: up right : 4 : 2 : 0.01 T: up right : 4 : 0 : 0.03 T: up right : 4 : 13 : 0.06 T: up right : 4 : 14 : 0.01 T: up right : 4 : 12 : 0.03 T: up right : 4 : 5 : 0.48 T: up right : 4 : 6 : 0.08 T: up right : 4 : 4 : 0.24 T: up stay : 4 : 0 : 0.1 T: up stay : 4 : 12 : 0.1 T: up stay : 4 : 4 : 0.8 T: down up : 4 : 13 : 0.06 T: down up : 4 : 14 : 0.06 T: down up : 4 : 12 : 0.48 T: down up : 4 : 1 : 0.01 T: down up : 4 : 2 : 0.01 T: down up : 4 : 0 : 0.08 T: down up : 4 : 5 : 0.03 T: down up : 4 : 6 : 0.03 T: down up : 4 : 4 : 0.24 T: down down : 4 : 14 : 0.36 T: down down : 4 : 13 : 0.06 T: down down : 4 : 12 : 0.18 T: down down : 4 : 2 : 0.06 T: down down : 4 : 1 : 0.01 T: down down : 4 : 0 : 0.03 T: down down : 4 : 6 : 0.18 T: down down : 4 : 5 : 0.03 T: down down : 4 : 4 : 0.09 T: down left : 4 : 14 : 0.06 T: down left : 4 : 13 : 0.06 T: down left : 4 : 12 : 0.48 T: down left : 4 : 2 : 0.01 T: down left : 4 : 1 : 0.01 T: down left : 4 : 0 : 0.08 T: down left : 4 : 6 : 0.03 T: down left : 4 : 5 : 0.03 T: down left : 4 : 4 : 0.24 T: down right : 4 : 13 : 0.36 T: down right : 4 : 14 : 0.06 T: down right : 4 : 12 : 0.18 T: down right : 4 : 1 : 0.06 T: down right : 4 : 2 : 0.01 T: down right : 4 : 0 : 0.03 T: down right : 4 : 5 : 0.18 T: down right : 4 : 6 : 0.03 T: down right : 4 : 4 : 0.09 T: down stay : 4 : 12 : 0.6 T: down stay : 4 : 0 : 0.1 T: down stay : 4 : 4 : 0.3 T: left up : 4 : 1 : 0.06 T: left up : 4 : 2 : 0.06 T: left up : 4 : 0 : 0.48 T: left up : 4 : 13 : 0.01 T: left up : 4 : 14 : 0.01 T: left up : 4 : 12 : 0.08 T: left up : 4 : 5 : 0.03 T: left up : 4 : 6 : 0.03 T: left up : 4 : 4 : 0.24 T: left down : 4 : 2 : 0.36 T: left down : 4 : 1 : 0.06 T: left down : 4 : 0 : 0.18 T: left down : 4 : 14 : 0.06 T: left down : 4 : 13 : 0.01 T: left down : 4 : 12 : 0.03 T: left down : 4 : 6 : 0.18 T: left down : 4 : 5 : 0.03 T: left down : 4 : 4 : 0.09 T: left left : 4 : 2 : 0.06 T: left left : 4 : 1 : 0.06 T: left left : 4 : 0 : 0.48 T: left left : 4 : 14 : 0.01 T: left left : 4 : 13 : 0.01 T: left left : 4 : 12 : 0.08 T: left left : 4 : 6 : 0.03 T: left left : 4 : 5 : 0.03 T: left left : 4 : 4 : 0.24 T: left right : 4 : 1 : 0.36 T: left right : 4 : 2 : 0.06 T: left right : 4 : 0 : 0.18 T: left right : 4 : 13 : 0.06 T: left right : 4 : 14 : 0.01 T: left right : 4 : 12 : 0.03 T: left right : 4 : 5 : 0.18 T: left right : 4 : 6 : 0.03 T: left right : 4 : 4 : 0.09 T: left stay : 4 : 0 : 0.6 T: left stay : 4 : 12 : 0.1 T: left stay : 4 : 4 : 0.3 T: right up : 4 : 13 : 0.01 T: right up : 4 : 14 : 0.01 T: right up : 4 : 12 : 0.08 T: right up : 4 : 1 : 0.01 T: right up : 4 : 2 : 0.01 T: right up : 4 : 0 : 0.08 T: right up : 4 : 5 : 0.08 T: right up : 4 : 6 : 0.08 T: right up : 4 : 4 : 0.64 T: right down : 4 : 14 : 0.06 T: right down : 4 : 13 : 0.01 T: right down : 4 : 12 : 0.03 T: right down : 4 : 2 : 0.06 T: right down : 4 : 1 : 0.01 T: right down : 4 : 0 : 0.03 T: right down : 4 : 6 : 0.48 T: right down : 4 : 5 : 0.08 T: right down : 4 : 4 : 0.24 T: right left : 4 : 14 : 0.01 T: right left : 4 : 13 : 0.01 T: right left : 4 : 12 : 0.08 T: right left : 4 : 2 : 0.01 T: right left : 4 : 1 : 0.01 T: right left : 4 : 0 : 0.08 T: right left : 4 : 6 : 0.08 T: right left : 4 : 5 : 0.08 T: right left : 4 : 4 : 0.64 T: right right : 4 : 13 : 0.06 T: right right : 4 : 14 : 0.01 T: right right : 4 : 12 : 0.03 T: right right : 4 : 1 : 0.06 T: right right : 4 : 2 : 0.01 T: right right : 4 : 0 : 0.03 T: right right : 4 : 5 : 0.48 T: right right : 4 : 6 : 0.08 T: right right : 4 : 4 : 0.24 T: right stay : 4 : 12 : 0.1 T: right stay : 4 : 0 : 0.1 T: right stay : 4 : 4 : 0.8 T: stay up : 4 : 5 : 0.1 T: stay up : 4 : 6 : 0.1 T: stay up : 4 : 4 : 0.8 T: stay down : 4 : 6 : 0.6 T: stay down : 4 : 5 : 0.1 T: stay down : 4 : 4 : 0.3 T: stay left : 4 : 6 : 0.1 T: stay left : 4 : 5 : 0.1 T: stay left : 4 : 4 : 0.8 T: stay right : 4 : 5 : 0.6 T: stay right : 4 : 6 : 0.1 T: stay right : 4 : 4 : 0.3 T: stay stay : 4 : 4 : 1.0 T: up up : 5 : 0 : 0.01 T: up up : 5 : 3 : 0.01 T: up up : 5 : 1 : 0.08 T: up up : 5 : 12 : 0.01 T: up up : 5 : 15 : 0.01 T: up up : 5 : 13 : 0.08 T: up up : 5 : 4 : 0.08 T: up up : 5 : 7 : 0.08 T: up up : 5 : 5 : 0.64 T: up down : 5 : 3 : 0.06 T: up down : 5 : 0 : 0.01 T: up down : 5 : 1 : 0.03 T: up down : 5 : 15 : 0.06 T: up down : 5 : 12 : 0.01 T: up down : 5 : 13 : 0.03 T: up down : 5 : 7 : 0.48 T: up down : 5 : 4 : 0.08 T: up down : 5 : 5 : 0.24 T: up left : 5 : 0 : 0.06 T: up left : 5 : 3 : 0.01 T: up left : 5 : 1 : 0.03 T: up left : 5 : 12 : 0.06 T: up left : 5 : 15 : 0.01 T: up left : 5 : 13 : 0.03 T: up left : 5 : 4 : 0.48 T: up left : 5 : 7 : 0.08 T: up left : 5 : 5 : 0.24 T: up right : 5 : 3 : 0.01 T: up right : 5 : 0 : 0.01 T: up right : 5 : 1 : 0.08 T: up right : 5 : 15 : 0.01 T: up right : 5 : 12 : 0.01 T: up right : 5 : 13 : 0.08 T: up right : 5 : 7 : 0.08 T: up right : 5 : 4 : 0.08 T: up right : 5 : 5 : 0.64 T: up stay : 5 : 1 : 0.1 T: up stay : 5 : 13 : 0.1 T: up stay : 5 : 5 : 0.8 T: down up : 5 : 12 : 0.06 T: down up : 5 : 15 : 0.06 T: down up : 5 : 13 : 0.48 T: down up : 5 : 0 : 0.01 T: down up : 5 : 3 : 0.01 T: down up : 5 : 1 : 0.08 T: down up : 5 : 4 : 0.03 T: down up : 5 : 7 : 0.03 T: down up : 5 : 5 : 0.24 T: down down : 5 : 15 : 0.36 T: down down : 5 : 12 : 0.06 T: down down : 5 : 13 : 0.18 T: down down : 5 : 3 : 0.06 T: down down : 5 : 0 : 0.01 T: down down : 5 : 1 : 0.03 T: down down : 5 : 7 : 0.18 T: down down : 5 : 4 : 0.03 T: down down : 5 : 5 : 0.09 T: down left : 5 : 12 : 0.36 T: down left : 5 : 15 : 0.06 T: down left : 5 : 13 : 0.18 T: down left : 5 : 0 : 0.06 T: down left : 5 : 3 : 0.01 T: down left : 5 : 1 : 0.03 T: down left : 5 : 4 : 0.18 T: down left : 5 : 7 : 0.03 T: down left : 5 : 5 : 0.09 T: down right : 5 : 15 : 0.06 T: down right : 5 : 12 : 0.06 T: down right : 5 : 13 : 0.48 T: down right : 5 : 3 : 0.01 T: down right : 5 : 0 : 0.01 T: down right : 5 : 1 : 0.08 T: down right : 5 : 7 : 0.03 T: down right : 5 : 4 : 0.03 T: down right : 5 : 5 : 0.24 T: down stay : 5 : 13 : 0.6 T: down stay : 5 : 1 : 0.1 T: down stay : 5 : 5 : 0.3 T: left up : 5 : 0 : 0.06 T: left up : 5 : 3 : 0.06 T: left up : 5 : 1 : 0.48 T: left up : 5 : 12 : 0.01 T: left up : 5 : 15 : 0.01 T: left up : 5 : 13 : 0.08 T: left up : 5 : 4 : 0.03 T: left up : 5 : 7 : 0.03 T: left up : 5 : 5 : 0.24 T: left down : 5 : 3 : 0.36 T: left down : 5 : 0 : 0.06 T: left down : 5 : 1 : 0.18 T: left down : 5 : 15 : 0.06 T: left down : 5 : 12 : 0.01 T: left down : 5 : 13 : 0.03 T: left down : 5 : 7 : 0.18 T: left down : 5 : 4 : 0.03 T: left down : 5 : 5 : 0.09 T: left left : 5 : 0 : 0.36 T: left left : 5 : 3 : 0.06 T: left left : 5 : 1 : 0.18 T: left left : 5 : 12 : 0.06 T: left left : 5 : 15 : 0.01 T: left left : 5 : 13 : 0.03 T: left left : 5 : 4 : 0.18 T: left left : 5 : 7 : 0.03 T: left left : 5 : 5 : 0.09 T: left right : 5 : 3 : 0.06 T: left right : 5 : 0 : 0.06 T: left right : 5 : 1 : 0.48 T: left right : 5 : 15 : 0.01 T: left right : 5 : 12 : 0.01 T: left right : 5 : 13 : 0.08 T: left right : 5 : 7 : 0.03 T: left right : 5 : 4 : 0.03 T: left right : 5 : 5 : 0.24 T: left stay : 5 : 1 : 0.6 T: left stay : 5 : 13 : 0.1 T: left stay : 5 : 5 : 0.3 T: right up : 5 : 12 : 0.01 T: right up : 5 : 15 : 0.01 T: right up : 5 : 13 : 0.08 T: right up : 5 : 0 : 0.01 T: right up : 5 : 3 : 0.01 T: right up : 5 : 1 : 0.08 T: right up : 5 : 4 : 0.08 T: right up : 5 : 7 : 0.08 T: right up : 5 : 5 : 0.64 T: right down : 5 : 15 : 0.06 T: right down : 5 : 12 : 0.01 T: right down : 5 : 13 : 0.03 T: right down : 5 : 3 : 0.06 T: right down : 5 : 0 : 0.01 T: right down : 5 : 1 : 0.03 T: right down : 5 : 7 : 0.48 T: right down : 5 : 4 : 0.08 T: right down : 5 : 5 : 0.24 T: right left : 5 : 12 : 0.06 T: right left : 5 : 15 : 0.01 T: right left : 5 : 13 : 0.03 T: right left : 5 : 0 : 0.06 T: right left : 5 : 3 : 0.01 T: right left : 5 : 1 : 0.03 T: right left : 5 : 4 : 0.48 T: right left : 5 : 7 : 0.08 T: right left : 5 : 5 : 0.24 T: right right : 5 : 15 : 0.01 T: right right : 5 : 12 : 0.01 T: right right : 5 : 13 : 0.08 T: right right : 5 : 3 : 0.01 T: right right : 5 : 0 : 0.01 T: right right : 5 : 1 : 0.08 T: right right : 5 : 7 : 0.08 T: right right : 5 : 4 : 0.08 T: right right : 5 : 5 : 0.64 T: right stay : 5 : 13 : 0.1 T: right stay : 5 : 1 : 0.1 T: right stay : 5 : 5 : 0.8 T: stay up : 5 : 4 : 0.1 T: stay up : 5 : 7 : 0.1 T: stay up : 5 : 5 : 0.8 T: stay down : 5 : 7 : 0.6 T: stay down : 5 : 4 : 0.1 T: stay down : 5 : 5 : 0.3 T: stay left : 5 : 4 : 0.6 T: stay left : 5 : 7 : 0.1 T: stay left : 5 : 5 : 0.3 T: stay right : 5 : 7 : 0.1 T: stay right : 5 : 4 : 0.1 T: stay right : 5 : 5 : 0.8 T: stay stay : 5 : 5 : 1.0 T: up up : 6 : 0 : 0.06 T: up up : 6 : 3 : 0.01 T: up up : 6 : 2 : 0.03 T: up up : 6 : 12 : 0.06 T: up up : 6 : 15 : 0.01 T: up up : 6 : 14 : 0.03 T: up up : 6 : 4 : 0.48 T: up up : 6 : 7 : 0.08 T: up up : 6 : 6 : 0.24 T: up down : 6 : 3 : 0.01 T: up down : 6 : 0 : 0.01 T: up down : 6 : 2 : 0.08 T: up down : 6 : 15 : 0.01 T: up down : 6 : 12 : 0.01 T: up down : 6 : 14 : 0.08 T: up down : 6 : 7 : 0.08 T: up down : 6 : 4 : 0.08 T: up down : 6 : 6 : 0.64 T: up left : 6 : 0 : 0.01 T: up left : 6 : 3 : 0.01 T: up left : 6 : 2 : 0.08 T: up left : 6 : 12 : 0.01 T: up left : 6 : 15 : 0.01 T: up left : 6 : 14 : 0.08 T: up left : 6 : 4 : 0.08 T: up left : 6 : 7 : 0.08 T: up left : 6 : 6 : 0.64 T: up right : 6 : 3 : 0.06 T: up right : 6 : 0 : 0.01 T: up right : 6 : 2 : 0.03 T: up right : 6 : 15 : 0.06 T: up right : 6 : 12 : 0.01 T: up right : 6 : 14 : 0.03 T: up right : 6 : 7 : 0.48 T: up right : 6 : 4 : 0.08 T: up right : 6 : 6 : 0.24 T: up stay : 6 : 2 : 0.1 T: up stay : 6 : 14 : 0.1 T: up stay : 6 : 6 : 0.8 T: down up : 6 : 12 : 0.36 T: down up : 6 : 15 : 0.06 T: down up : 6 : 14 : 0.18 T: down up : 6 : 0 : 0.06 T: down up : 6 : 3 : 0.01 T: down up : 6 : 2 : 0.03 T: down up : 6 : 4 : 0.18 T: down up : 6 : 7 : 0.03 T: down up : 6 : 6 : 0.09 T: down down : 6 : 15 : 0.06 T: down down : 6 : 12 : 0.06 T: down down : 6 : 14 : 0.48 T: down down : 6 : 3 : 0.01 T: down down : 6 : 0 : 0.01 T: down down : 6 : 2 : 0.08 T: down down : 6 : 7 : 0.03 T: down down : 6 : 4 : 0.03 T: down down : 6 : 6 : 0.24 T: down left : 6 : 12 : 0.06 T: down left : 6 : 15 : 0.06 T: down left : 6 : 14 : 0.48 T: down left : 6 : 0 : 0.01 T: down left : 6 : 3 : 0.01 T: down left : 6 : 2 : 0.08 T: down left : 6 : 4 : 0.03 T: down left : 6 : 7 : 0.03 T: down left : 6 : 6 : 0.24 T: down right : 6 : 15 : 0.36 T: down right : 6 : 12 : 0.06 T: down right : 6 : 14 : 0.18 T: down right : 6 : 3 : 0.06 T: down right : 6 : 0 : 0.01 T: down right : 6 : 2 : 0.03 T: down right : 6 : 7 : 0.18 T: down right : 6 : 4 : 0.03 T: down right : 6 : 6 : 0.09 T: down stay : 6 : 14 : 0.6 T: down stay : 6 : 2 : 0.1 T: down stay : 6 : 6 : 0.3 T: left up : 6 : 0 : 0.36 T: left up : 6 : 3 : 0.06 T: left up : 6 : 2 : 0.18 T: left up : 6 : 12 : 0.06 T: left up : 6 : 15 : 0.01 T: left up : 6 : 14 : 0.03 T: left up : 6 : 4 : 0.18 T: left up : 6 : 7 : 0.03 T: left up : 6 : 6 : 0.09 T: left down : 6 : 3 : 0.06 T: left down : 6 : 0 : 0.06 T: left down : 6 : 2 : 0.48 T: left down : 6 : 15 : 0.01 T: left down : 6 : 12 : 0.01 T: left down : 6 : 14 : 0.08 T: left down : 6 : 7 : 0.03 T: left down : 6 : 4 : 0.03 T: left down : 6 : 6 : 0.24 T: left left : 6 : 0 : 0.06 T: left left : 6 : 3 : 0.06 T: left left : 6 : 2 : 0.48 T: left left : 6 : 12 : 0.01 T: left left : 6 : 15 : 0.01 T: left left : 6 : 14 : 0.08 T: left left : 6 : 4 : 0.03 T: left left : 6 : 7 : 0.03 T: left left : 6 : 6 : 0.24 T: left right : 6 : 3 : 0.36 T: left right : 6 : 0 : 0.06 T: left right : 6 : 2 : 0.18 T: left right : 6 : 15 : 0.06 T: left right : 6 : 12 : 0.01 T: left right : 6 : 14 : 0.03 T: left right : 6 : 7 : 0.18 T: left right : 6 : 4 : 0.03 T: left right : 6 : 6 : 0.09 T: left stay : 6 : 2 : 0.6 T: left stay : 6 : 14 : 0.1 T: left stay : 6 : 6 : 0.3 T: right up : 6 : 12 : 0.06 T: right up : 6 : 15 : 0.01 T: right up : 6 : 14 : 0.03 T: right up : 6 : 0 : 0.06 T: right up : 6 : 3 : 0.01 T: right up : 6 : 2 : 0.03 T: right up : 6 : 4 : 0.48 T: right up : 6 : 7 : 0.08 T: right up : 6 : 6 : 0.24 T: right down : 6 : 15 : 0.01 T: right down : 6 : 12 : 0.01 T: right down : 6 : 14 : 0.08 T: right down : 6 : 3 : 0.01 T: right down : 6 : 0 : 0.01 T: right down : 6 : 2 : 0.08 T: right down : 6 : 7 : 0.08 T: right down : 6 : 4 : 0.08 T: right down : 6 : 6 : 0.64 T: right left : 6 : 12 : 0.01 T: right left : 6 : 15 : 0.01 T: right left : 6 : 14 : 0.08 T: right left : 6 : 0 : 0.01 T: right left : 6 : 3 : 0.01 T: right left : 6 : 2 : 0.08 T: right left : 6 : 4 : 0.08 T: right left : 6 : 7 : 0.08 T: right left : 6 : 6 : 0.64 T: right right : 6 : 15 : 0.06 T: right right : 6 : 12 : 0.01 T: right right : 6 : 14 : 0.03 T: right right : 6 : 3 : 0.06 T: right right : 6 : 0 : 0.01 T: right right : 6 : 2 : 0.03 T: right right : 6 : 7 : 0.48 T: right right : 6 : 4 : 0.08 T: right right : 6 : 6 : 0.24 T: right stay : 6 : 14 : 0.1 T: right stay : 6 : 2 : 0.1 T: right stay : 6 : 6 : 0.8 T: stay up : 6 : 4 : 0.6 T: stay up : 6 : 7 : 0.1 T: stay up : 6 : 6 : 0.3 T: stay down : 6 : 7 : 0.1 T: stay down : 6 : 4 : 0.1 T: stay down : 6 : 6 : 0.8 T: stay left : 6 : 4 : 0.1 T: stay left : 6 : 7 : 0.1 T: stay left : 6 : 6 : 0.8 T: stay right : 6 : 7 : 0.6 T: stay right : 6 : 4 : 0.1 T: stay right : 6 : 6 : 0.3 T: stay stay : 6 : 6 : 1.0 T: up up : 7 : 1 : 0.06 T: up up : 7 : 2 : 0.01 T: up up : 7 : 3 : 0.03 T: up up : 7 : 13 : 0.06 T: up up : 7 : 14 : 0.01 T: up up : 7 : 15 : 0.03 T: up up : 7 : 5 : 0.48 T: up up : 7 : 6 : 0.08 T: up up : 7 : 7 : 0.24 T: up down : 7 : 2 : 0.01 T: up down : 7 : 1 : 0.01 T: up down : 7 : 3 : 0.08 T: up down : 7 : 14 : 0.01 T: up down : 7 : 13 : 0.01 T: up down : 7 : 15 : 0.08 T: up down : 7 : 6 : 0.08 T: up down : 7 : 5 : 0.08 T: up down : 7 : 7 : 0.64 T: up left : 7 : 2 : 0.06 T: up left : 7 : 1 : 0.01 T: up left : 7 : 3 : 0.03 T: up left : 7 : 14 : 0.06 T: up left : 7 : 13 : 0.01 T: up left : 7 : 15 : 0.03 T: up left : 7 : 6 : 0.48 T: up left : 7 : 5 : 0.08 T: up left : 7 : 7 : 0.24 T: up right : 7 : 1 : 0.01 T: up right : 7 : 2 : 0.01 T: up right : 7 : 3 : 0.08 T: up right : 7 : 13 : 0.01 T: up right : 7 : 14 : 0.01 T: up right : 7 : 15 : 0.08 T: up right : 7 : 5 : 0.08 T: up right : 7 : 6 : 0.08 T: up right : 7 : 7 : 0.64 T: up stay : 7 : 3 : 0.1 T: up stay : 7 : 15 : 0.1 T: up stay : 7 : 7 : 0.8 T: down up : 7 : 13 : 0.36 T: down up : 7 : 14 : 0.06 T: down up : 7 : 15 : 0.18 T: down up : 7 : 1 : 0.06 T: down up : 7 : 2 : 0.01 T: down up : 7 : 3 : 0.03 T: down up : 7 : 5 : 0.18 T: down up : 7 : 6 : 0.03 T: down up : 7 : 7 : 0.09 T: down down : 7 : 14 : 0.06 T: down down : 7 : 13 : 0.06 T: down down : 7 : 15 : 0.48 T: down down : 7 : 2 : 0.01 T: down down : 7 : 1 : 0.01 T: down down : 7 : 3 : 0.08 T: down down : 7 : 6 : 0.03 T: down down : 7 : 5 : 0.03 T: down down : 7 : 7 : 0.24 T: down left : 7 : 14 : 0.36 T: down left : 7 : 13 : 0.06 T: down left : 7 : 15 : 0.18 T: down left : 7 : 2 : 0.06 T: down left : 7 : 1 : 0.01 T: down left : 7 : 3 : 0.03 T: down left : 7 : 6 : 0.18 T: down left : 7 : 5 : 0.03 T: down left : 7 : 7 : 0.09 T: down right : 7 : 13 : 0.06 T: down right : 7 : 14 : 0.06 T: down right : 7 : 15 : 0.48 T: down right : 7 : 1 : 0.01 T: down right : 7 : 2 : 0.01 T: down right : 7 : 3 : 0.08 T: down right : 7 : 5 : 0.03 T: down right : 7 : 6 : 0.03 T: down right : 7 : 7 : 0.24 T: down stay : 7 : 15 : 0.6 T: down stay : 7 : 3 : 0.1 T: down stay : 7 : 7 : 0.3 T: left up : 7 : 1 : 0.36 T: left up : 7 : 2 : 0.06 T: left up : 7 : 3 : 0.18 T: left up : 7 : 13 : 0.06 T: left up : 7 : 14 : 0.01 T: left up : 7 : 15 : 0.03 T: left up : 7 : 5 : 0.18 T: left up : 7 : 6 : 0.03 T: left up : 7 : 7 : 0.09 T: left down : 7 : 2 : 0.06 T: left down : 7 : 1 : 0.06 T: left down : 7 : 3 : 0.48 T: left down : 7 : 14 : 0.01 T: left down : 7 : 13 : 0.01 T: left down : 7 : 15 : 0.08 T: left down : 7 : 6 : 0.03 T: left down : 7 : 5 : 0.03 T: left down : 7 : 7 : 0.24 T: left left : 7 : 2 : 0.36 T: left left : 7 : 1 : 0.06 T: left left : 7 : 3 : 0.18 T: left left : 7 : 14 : 0.06 T: left left : 7 : 13 : 0.01 T: left left : 7 : 15 : 0.03 T: left left : 7 : 6 : 0.18 T: left left : 7 : 5 : 0.03 T: left left : 7 : 7 : 0.09 T: left right : 7 : 1 : 0.06 T: left right : 7 : 2 : 0.06 T: left right : 7 : 3 : 0.48 T: left right : 7 : 13 : 0.01 T: left right : 7 : 14 : 0.01 T: left right : 7 : 15 : 0.08 T: left right : 7 : 5 : 0.03 T: left right : 7 : 6 : 0.03 T: left right : 7 : 7 : 0.24 T: left stay : 7 : 3 : 0.6 T: left stay : 7 : 15 : 0.1 T: left stay : 7 : 7 : 0.3 T: right up : 7 : 13 : 0.06 T: right up : 7 : 14 : 0.01 T: right up : 7 : 15 : 0.03 T: right up : 7 : 1 : 0.06 T: right up : 7 : 2 : 0.01 T: right up : 7 : 3 : 0.03 T: right up : 7 : 5 : 0.48 T: right up : 7 : 6 : 0.08 T: right up : 7 : 7 : 0.24 T: right down : 7 : 14 : 0.01 T: right down : 7 : 13 : 0.01 T: right down : 7 : 15 : 0.08 T: right down : 7 : 2 : 0.01 T: right down : 7 : 1 : 0.01 T: right down : 7 : 3 : 0.08 T: right down : 7 : 6 : 0.08 T: right down : 7 : 5 : 0.08 T: right down : 7 : 7 : 0.64 T: right left : 7 : 14 : 0.06 T: right left : 7 : 13 : 0.01 T: right left : 7 : 15 : 0.03 T: right left : 7 : 2 : 0.06 T: right left : 7 : 1 : 0.01 T: right left : 7 : 3 : 0.03 T: right left : 7 : 6 : 0.48 T: right left : 7 : 5 : 0.08 T: right left : 7 : 7 : 0.24 T: right right : 7 : 13 : 0.01 T: right right : 7 : 14 : 0.01 T: right right : 7 : 15 : 0.08 T: right right : 7 : 1 : 0.01 T: right right : 7 : 2 : 0.01 T: right right : 7 : 3 : 0.08 T: right right : 7 : 5 : 0.08 T: right right : 7 : 6 : 0.08 T: right right : 7 : 7 : 0.64 T: right stay : 7 : 15 : 0.1 T: right stay : 7 : 3 : 0.1 T: right stay : 7 : 7 : 0.8 T: stay up : 7 : 5 : 0.6 T: stay up : 7 : 6 : 0.1 T: stay up : 7 : 7 : 0.3 T: stay down : 7 : 6 : 0.1 T: stay down : 7 : 5 : 0.1 T: stay down : 7 : 7 : 0.8 T: stay left : 7 : 6 : 0.6 T: stay left : 7 : 5 : 0.1 T: stay left : 7 : 7 : 0.3 T: stay right : 7 : 5 : 0.1 T: stay right : 7 : 6 : 0.1 T: stay right : 7 : 7 : 0.8 T: stay stay : 7 : 7 : 1.0 T: up up : 8 : 1 : 0.06 T: up up : 8 : 2 : 0.06 T: up up : 8 : 0 : 0.48 T: up up : 8 : 13 : 0.01 T: up up : 8 : 14 : 0.01 T: up up : 8 : 12 : 0.08 T: up up : 8 : 9 : 0.03 T: up up : 8 : 10 : 0.03 T: up up : 8 : 8 : 0.24 T: up down : 8 : 2 : 0.36 T: up down : 8 : 1 : 0.06 T: up down : 8 : 0 : 0.18 T: up down : 8 : 14 : 0.06 T: up down : 8 : 13 : 0.01 T: up down : 8 : 12 : 0.03 T: up down : 8 : 10 : 0.18 T: up down : 8 : 9 : 0.03 T: up down : 8 : 8 : 0.09 T: up left : 8 : 2 : 0.06 T: up left : 8 : 1 : 0.06 T: up left : 8 : 0 : 0.48 T: up left : 8 : 14 : 0.01 T: up left : 8 : 13 : 0.01 T: up left : 8 : 12 : 0.08 T: up left : 8 : 10 : 0.03 T: up left : 8 : 9 : 0.03 T: up left : 8 : 8 : 0.24 T: up right : 8 : 1 : 0.36 T: up right : 8 : 2 : 0.06 T: up right : 8 : 0 : 0.18 T: up right : 8 : 13 : 0.06 T: up right : 8 : 14 : 0.01 T: up right : 8 : 12 : 0.03 T: up right : 8 : 9 : 0.18 T: up right : 8 : 10 : 0.03 T: up right : 8 : 8 : 0.09 T: up stay : 8 : 0 : 0.6 T: up stay : 8 : 12 : 0.1 T: up stay : 8 : 8 : 0.3 T: down up : 8 : 13 : 0.01 T: down up : 8 : 14 : 0.01 T: down up : 8 : 12 : 0.08 T: down up : 8 : 1 : 0.01 T: down up : 8 : 2 : 0.01 T: down up : 8 : 0 : 0.08 T: down up : 8 : 9 : 0.08 T: down up : 8 : 10 : 0.08 T: down up : 8 : 8 : 0.64 T: down down : 8 : 14 : 0.06 T: down down : 8 : 13 : 0.01 T: down down : 8 : 12 : 0.03 T: down down : 8 : 2 : 0.06 T: down down : 8 : 1 : 0.01 T: down down : 8 : 0 : 0.03 T: down down : 8 : 10 : 0.48 T: down down : 8 : 9 : 0.08 T: down down : 8 : 8 : 0.24 T: down left : 8 : 14 : 0.01 T: down left : 8 : 13 : 0.01 T: down left : 8 : 12 : 0.08 T: down left : 8 : 2 : 0.01 T: down left : 8 : 1 : 0.01 T: down left : 8 : 0 : 0.08 T: down left : 8 : 10 : 0.08 T: down left : 8 : 9 : 0.08 T: down left : 8 : 8 : 0.64 T: down right : 8 : 13 : 0.06 T: down right : 8 : 14 : 0.01 T: down right : 8 : 12 : 0.03 T: down right : 8 : 1 : 0.06 T: down right : 8 : 2 : 0.01 T: down right : 8 : 0 : 0.03 T: down right : 8 : 9 : 0.48 T: down right : 8 : 10 : 0.08 T: down right : 8 : 8 : 0.24 T: down stay : 8 : 12 : 0.1 T: down stay : 8 : 0 : 0.1 T: down stay : 8 : 8 : 0.8 T: left up : 8 : 1 : 0.01 T: left up : 8 : 2 : 0.01 T: left up : 8 : 0 : 0.08 T: left up : 8 : 13 : 0.01 T: left up : 8 : 14 : 0.01 T: left up : 8 : 12 : 0.08 T: left up : 8 : 9 : 0.08 T: left up : 8 : 10 : 0.08 T: left up : 8 : 8 : 0.64 T: left down : 8 : 2 : 0.06 T: left down : 8 : 1 : 0.01 T: left down : 8 : 0 : 0.03 T: left down : 8 : 14 : 0.06 T: left down : 8 : 13 : 0.01 T: left down : 8 : 12 : 0.03 T: left down : 8 : 10 : 0.48 T: left down : 8 : 9 : 0.08 T: left down : 8 : 8 : 0.24 T: left left : 8 : 2 : 0.01 T: left left : 8 : 1 : 0.01 T: left left : 8 : 0 : 0.08 T: left left : 8 : 14 : 0.01 T: left left : 8 : 13 : 0.01 T: left left : 8 : 12 : 0.08 T: left left : 8 : 10 : 0.08 T: left left : 8 : 9 : 0.08 T: left left : 8 : 8 : 0.64 T: left right : 8 : 1 : 0.06 T: left right : 8 : 2 : 0.01 T: left right : 8 : 0 : 0.03 T: left right : 8 : 13 : 0.06 T: left right : 8 : 14 : 0.01 T: left right : 8 : 12 : 0.03 T: left right : 8 : 9 : 0.48 T: left right : 8 : 10 : 0.08 T: left right : 8 : 8 : 0.24 T: left stay : 8 : 0 : 0.1 T: left stay : 8 : 12 : 0.1 T: left stay : 8 : 8 : 0.8 T: right up : 8 : 13 : 0.06 T: right up : 8 : 14 : 0.06 T: right up : 8 : 12 : 0.48 T: right up : 8 : 1 : 0.01 T: right up : 8 : 2 : 0.01 T: right up : 8 : 0 : 0.08 T: right up : 8 : 9 : 0.03 T: right up : 8 : 10 : 0.03 T: right up : 8 : 8 : 0.24 T: right down : 8 : 14 : 0.36 T: right down : 8 : 13 : 0.06 T: right down : 8 : 12 : 0.18 T: right down : 8 : 2 : 0.06 T: right down : 8 : 1 : 0.01 T: right down : 8 : 0 : 0.03 T: right down : 8 : 10 : 0.18 T: right down : 8 : 9 : 0.03 T: right down : 8 : 8 : 0.09 T: right left : 8 : 14 : 0.06 T: right left : 8 : 13 : 0.06 T: right left : 8 : 12 : 0.48 T: right left : 8 : 2 : 0.01 T: right left : 8 : 1 : 0.01 T: right left : 8 : 0 : 0.08 T: right left : 8 : 10 : 0.03 T: right left : 8 : 9 : 0.03 T: right left : 8 : 8 : 0.24 T: right right : 8 : 13 : 0.36 T: right right : 8 : 14 : 0.06 T: right right : 8 : 12 : 0.18 T: right right : 8 : 1 : 0.06 T: right right : 8 : 2 : 0.01 T: right right : 8 : 0 : 0.03 T: right right : 8 : 9 : 0.18 T: right right : 8 : 10 : 0.03 T: right right : 8 : 8 : 0.09 T: right stay : 8 : 12 : 0.6 T: right stay : 8 : 0 : 0.1 T: right stay : 8 : 8 : 0.3 T: stay up : 8 : 9 : 0.1 T: stay up : 8 : 10 : 0.1 T: stay up : 8 : 8 : 0.8 T: stay down : 8 : 10 : 0.6 T: stay down : 8 : 9 : 0.1 T: stay down : 8 : 8 : 0.3 T: stay left : 8 : 10 : 0.1 T: stay left : 8 : 9 : 0.1 T: stay left : 8 : 8 : 0.8 T: stay right : 8 : 9 : 0.6 T: stay right : 8 : 10 : 0.1 T: stay right : 8 : 8 : 0.3 T: stay stay : 8 : 8 : 1.0 T: up up : 9 : 0 : 0.06 T: up up : 9 : 3 : 0.06 T: up up : 9 : 1 : 0.48 T: up up : 9 : 12 : 0.01 T: up up : 9 : 15 : 0.01 T: up up : 9 : 13 : 0.08 T: up up : 9 : 8 : 0.03 T: up up : 9 : 11 : 0.03 T: up up : 9 : 9 : 0.24 T: up down : 9 : 3 : 0.36 T: up down : 9 : 0 : 0.06 T: up down : 9 : 1 : 0.18 T: up down : 9 : 15 : 0.06 T: up down : 9 : 12 : 0.01 T: up down : 9 : 13 : 0.03 T: up down : 9 : 11 : 0.18 T: up down : 9 : 8 : 0.03 T: up down : 9 : 9 : 0.09 T: up left : 9 : 0 : 0.36 T: up left : 9 : 3 : 0.06 T: up left : 9 : 1 : 0.18 T: up left : 9 : 12 : 0.06 T: up left : 9 : 15 : 0.01 T: up left : 9 : 13 : 0.03 T: up left : 9 : 8 : 0.18 T: up left : 9 : 11 : 0.03 T: up left : 9 : 9 : 0.09 T: up right : 9 : 3 : 0.06 T: up right : 9 : 0 : 0.06 T: up right : 9 : 1 : 0.48 T: up right : 9 : 15 : 0.01 T: up right : 9 : 12 : 0.01 T: up right : 9 : 13 : 0.08 T: up right : 9 : 11 : 0.03 T: up right : 9 : 8 : 0.03 T: up right : 9 : 9 : 0.24 T: up stay : 9 : 1 : 0.6 T: up stay : 9 : 13 : 0.1 T: up stay : 9 : 9 : 0.3 T: down up : 9 : 12 : 0.01 T: down up : 9 : 15 : 0.01 T: down up : 9 : 13 : 0.08 T: down up : 9 : 0 : 0.01 T: down up : 9 : 3 : 0.01 T: down up : 9 : 1 : 0.08 T: down up : 9 : 8 : 0.08 T: down up : 9 : 11 : 0.08 T: down up : 9 : 9 : 0.64 T: down down : 9 : 15 : 0.06 T: down down : 9 : 12 : 0.01 T: down down : 9 : 13 : 0.03 T: down down : 9 : 3 : 0.06 T: down down : 9 : 0 : 0.01 T: down down : 9 : 1 : 0.03 T: down down : 9 : 11 : 0.48 T: down down : 9 : 8 : 0.08 T: down down : 9 : 9 : 0.24 T: down left : 9 : 12 : 0.06 T: down left : 9 : 15 : 0.01 T: down left : 9 : 13 : 0.03 T: down left : 9 : 0 : 0.06 T: down left : 9 : 3 : 0.01 T: down left : 9 : 1 : 0.03 T: down left : 9 : 8 : 0.48 T: down left : 9 : 11 : 0.08 T: down left : 9 : 9 : 0.24 T: down right : 9 : 15 : 0.01 T: down right : 9 : 12 : 0.01 T: down right : 9 : 13 : 0.08 T: down right : 9 : 3 : 0.01 T: down right : 9 : 0 : 0.01 T: down right : 9 : 1 : 0.08 T: down right : 9 : 11 : 0.08 T: down right : 9 : 8 : 0.08 T: down right : 9 : 9 : 0.64 T: down stay : 9 : 13 : 0.1 T: down stay : 9 : 1 : 0.1 T: down stay : 9 : 9 : 0.8 T: left up : 9 : 0 : 0.01 T: left up : 9 : 3 : 0.01 T: left up : 9 : 1 : 0.08 T: left up : 9 : 12 : 0.01 T: left up : 9 : 15 : 0.01 T: left up : 9 : 13 : 0.08 T: left up : 9 : 8 : 0.08 T: left up : 9 : 11 : 0.08 T: left up : 9 : 9 : 0.64 T: left down : 9 : 3 : 0.06 T: left down : 9 : 0 : 0.01 T: left down : 9 : 1 : 0.03 T: left down : 9 : 15 : 0.06 T: left down : 9 : 12 : 0.01 T: left down : 9 : 13 : 0.03 T: left down : 9 : 11 : 0.48 T: left down : 9 : 8 : 0.08 T: left down : 9 : 9 : 0.24 T: left left : 9 : 0 : 0.06 T: left left : 9 : 3 : 0.01 T: left left : 9 : 1 : 0.03 T: left left : 9 : 12 : 0.06 T: left left : 9 : 15 : 0.01 T: left left : 9 : 13 : 0.03 T: left left : 9 : 8 : 0.48 T: left left : 9 : 11 : 0.08 T: left left : 9 : 9 : 0.24 T: left right : 9 : 3 : 0.01 T: left right : 9 : 0 : 0.01 T: left right : 9 : 1 : 0.08 T: left right : 9 : 15 : 0.01 T: left right : 9 : 12 : 0.01 T: left right : 9 : 13 : 0.08 T: left right : 9 : 11 : 0.08 T: left right : 9 : 8 : 0.08 T: left right : 9 : 9 : 0.64 T: left stay : 9 : 1 : 0.1 T: left stay : 9 : 13 : 0.1 T: left stay : 9 : 9 : 0.8 T: right up : 9 : 12 : 0.06 T: right up : 9 : 15 : 0.06 T: right up : 9 : 13 : 0.48 T: right up : 9 : 0 : 0.01 T: right up : 9 : 3 : 0.01 T: right up : 9 : 1 : 0.08 T: right up : 9 : 8 : 0.03 T: right up : 9 : 11 : 0.03 T: right up : 9 : 9 : 0.24 T: right down : 9 : 15 : 0.36 T: right down : 9 : 12 : 0.06 T: right down : 9 : 13 : 0.18 T: right down : 9 : 3 : 0.06 T: right down : 9 : 0 : 0.01 T: right down : 9 : 1 : 0.03 T: right down : 9 : 11 : 0.18 T: right down : 9 : 8 : 0.03 T: right down : 9 : 9 : 0.09 T: right left : 9 : 12 : 0.36 T: right left : 9 : 15 : 0.06 T: right left : 9 : 13 : 0.18 T: right left : 9 : 0 : 0.06 T: right left : 9 : 3 : 0.01 T: right left : 9 : 1 : 0.03 T: right left : 9 : 8 : 0.18 T: right left : 9 : 11 : 0.03 T: right left : 9 : 9 : 0.09 T: right right : 9 : 15 : 0.06 T: right right : 9 : 12 : 0.06 T: right right : 9 : 13 : 0.48 T: right right : 9 : 3 : 0.01 T: right right : 9 : 0 : 0.01 T: right right : 9 : 1 : 0.08 T: right right : 9 : 11 : 0.03 T: right right : 9 : 8 : 0.03 T: right right : 9 : 9 : 0.24 T: right stay : 9 : 13 : 0.6 T: right stay : 9 : 1 : 0.1 T: right stay : 9 : 9 : 0.3 T: stay up : 9 : 8 : 0.1 T: stay up : 9 : 11 : 0.1 T: stay up : 9 : 9 : 0.8 T: stay down : 9 : 11 : 0.6 T: stay down : 9 : 8 : 0.1 T: stay down : 9 : 9 : 0.3 T: stay left : 9 : 8 : 0.6 T: stay left : 9 : 11 : 0.1 T: stay left : 9 : 9 : 0.3 T: stay right : 9 : 11 : 0.1 T: stay right : 9 : 8 : 0.1 T: stay right : 9 : 9 : 0.8 T: stay stay : 9 : 9 : 1.0 T: up up : 10 : 0 : 0.36 T: up up : 10 : 3 : 0.06 T: up up : 10 : 2 : 0.18 T: up up : 10 : 12 : 0.06 T: up up : 10 : 15 : 0.01 T: up up : 10 : 14 : 0.03 T: up up : 10 : 8 : 0.18 T: up up : 10 : 11 : 0.03 T: up up : 10 : 10 : 0.09 T: up down : 10 : 3 : 0.06 T: up down : 10 : 0 : 0.06 T: up down : 10 : 2 : 0.48 T: up down : 10 : 15 : 0.01 T: up down : 10 : 12 : 0.01 T: up down : 10 : 14 : 0.08 T: up down : 10 : 11 : 0.03 T: up down : 10 : 8 : 0.03 T: up down : 10 : 10 : 0.24 T: up left : 10 : 0 : 0.06 T: up left : 10 : 3 : 0.06 T: up left : 10 : 2 : 0.48 T: up left : 10 : 12 : 0.01 T: up left : 10 : 15 : 0.01 T: up left : 10 : 14 : 0.08 T: up left : 10 : 8 : 0.03 T: up left : 10 : 11 : 0.03 T: up left : 10 : 10 : 0.24 T: up right : 10 : 3 : 0.36 T: up right : 10 : 0 : 0.06 T: up right : 10 : 2 : 0.18 T: up right : 10 : 15 : 0.06 T: up right : 10 : 12 : 0.01 T: up right : 10 : 14 : 0.03 T: up right : 10 : 11 : 0.18 T: up right : 10 : 8 : 0.03 T: up right : 10 : 10 : 0.09 T: up stay : 10 : 2 : 0.6 T: up stay : 10 : 14 : 0.1 T: up stay : 10 : 10 : 0.3 T: down up : 10 : 12 : 0.06 T: down up : 10 : 15 : 0.01 T: down up : 10 : 14 : 0.03 T: down up : 10 : 0 : 0.06 T: down up : 10 : 3 : 0.01 T: down up : 10 : 2 : 0.03 T: down up : 10 : 8 : 0.48 T: down up : 10 : 11 : 0.08 T: down up : 10 : 10 : 0.24 T: down down : 10 : 15 : 0.01 T: down down : 10 : 12 : 0.01 T: down down : 10 : 14 : 0.08 T: down down : 10 : 3 : 0.01 T: down down : 10 : 0 : 0.01 T: down down : 10 : 2 : 0.08 T: down down : 10 : 11 : 0.08 T: down down : 10 : 8 : 0.08 T: down down : 10 : 10 : 0.64 T: down left : 10 : 12 : 0.01 T: down left : 10 : 15 : 0.01 T: down left : 10 : 14 : 0.08 T: down left : 10 : 0 : 0.01 T: down left : 10 : 3 : 0.01 T: down left : 10 : 2 : 0.08 T: down left : 10 : 8 : 0.08 T: down left : 10 : 11 : 0.08 T: down left : 10 : 10 : 0.64 T: down right : 10 : 15 : 0.06 T: down right : 10 : 12 : 0.01 T: down right : 10 : 14 : 0.03 T: down right : 10 : 3 : 0.06 T: down right : 10 : 0 : 0.01 T: down right : 10 : 2 : 0.03 T: down right : 10 : 11 : 0.48 T: down right : 10 : 8 : 0.08 T: down right : 10 : 10 : 0.24 T: down stay : 10 : 14 : 0.1 T: down stay : 10 : 2 : 0.1 T: down stay : 10 : 10 : 0.8 T: left up : 10 : 0 : 0.06 T: left up : 10 : 3 : 0.01 T: left up : 10 : 2 : 0.03 T: left up : 10 : 12 : 0.06 T: left up : 10 : 15 : 0.01 T: left up : 10 : 14 : 0.03 T: left up : 10 : 8 : 0.48 T: left up : 10 : 11 : 0.08 T: left up : 10 : 10 : 0.24 T: left down : 10 : 3 : 0.01 T: left down : 10 : 0 : 0.01 T: left down : 10 : 2 : 0.08 T: left down : 10 : 15 : 0.01 T: left down : 10 : 12 : 0.01 T: left down : 10 : 14 : 0.08 T: left down : 10 : 11 : 0.08 T: left down : 10 : 8 : 0.08 T: left down : 10 : 10 : 0.64 T: left left : 10 : 0 : 0.01 T: left left : 10 : 3 : 0.01 T: left left : 10 : 2 : 0.08 T: left left : 10 : 12 : 0.01 T: left left : 10 : 15 : 0.01 T: left left : 10 : 14 : 0.08 T: left left : 10 : 8 : 0.08 T: left left : 10 : 11 : 0.08 T: left left : 10 : 10 : 0.64 T: left right : 10 : 3 : 0.06 T: left right : 10 : 0 : 0.01 T: left right : 10 : 2 : 0.03 T: left right : 10 : 15 : 0.06 T: left right : 10 : 12 : 0.01 T: left right : 10 : 14 : 0.03 T: left right : 10 : 11 : 0.48 T: left right : 10 : 8 : 0.08 T: left right : 10 : 10 : 0.24 T: left stay : 10 : 2 : 0.1 T: left stay : 10 : 14 : 0.1 T: left stay : 10 : 10 : 0.8 T: right up : 10 : 12 : 0.36 T: right up : 10 : 15 : 0.06 T: right up : 10 : 14 : 0.18 T: right up : 10 : 0 : 0.06 T: right up : 10 : 3 : 0.01 T: right up : 10 : 2 : 0.03 T: right up : 10 : 8 : 0.18 T: right up : 10 : 11 : 0.03 T: right up : 10 : 10 : 0.09 T: right down : 10 : 15 : 0.06 T: right down : 10 : 12 : 0.06 T: right down : 10 : 14 : 0.48 T: right down : 10 : 3 : 0.01 T: right down : 10 : 0 : 0.01 T: right down : 10 : 2 : 0.08 T: right down : 10 : 11 : 0.03 T: right down : 10 : 8 : 0.03 T: right down : 10 : 10 : 0.24 T: right left : 10 : 12 : 0.06 T: right left : 10 : 15 : 0.06 T: right left : 10 : 14 : 0.48 T: right left : 10 : 0 : 0.01 T: right left : 10 : 3 : 0.01 T: right left : 10 : 2 : 0.08 T: right left : 10 : 8 : 0.03 T: right left : 10 : 11 : 0.03 T: right left : 10 : 10 : 0.24 T: right right : 10 : 15 : 0.36 T: right right : 10 : 12 : 0.06 T: right right : 10 : 14 : 0.18 T: right right : 10 : 3 : 0.06 T: right right : 10 : 0 : 0.01 T: right right : 10 : 2 : 0.03 T: right right : 10 : 11 : 0.18 T: right right : 10 : 8 : 0.03 T: right right : 10 : 10 : 0.09 T: right stay : 10 : 14 : 0.6 T: right stay : 10 : 2 : 0.1 T: right stay : 10 : 10 : 0.3 T: stay up : 10 : 8 : 0.6 T: stay up : 10 : 11 : 0.1 T: stay up : 10 : 10 : 0.3 T: stay down : 10 : 11 : 0.1 T: stay down : 10 : 8 : 0.1 T: stay down : 10 : 10 : 0.8 T: stay left : 10 : 8 : 0.1 T: stay left : 10 : 11 : 0.1 T: stay left : 10 : 10 : 0.8 T: stay right : 10 : 11 : 0.6 T: stay right : 10 : 8 : 0.1 T: stay right : 10 : 10 : 0.3 T: stay stay : 10 : 10 : 1.0 T: up up : 11 : 1 : 0.36 T: up up : 11 : 2 : 0.06 T: up up : 11 : 3 : 0.18 T: up up : 11 : 13 : 0.06 T: up up : 11 : 14 : 0.01 T: up up : 11 : 15 : 0.03 T: up up : 11 : 9 : 0.18 T: up up : 11 : 10 : 0.03 T: up up : 11 : 11 : 0.09 T: up down : 11 : 2 : 0.06 T: up down : 11 : 1 : 0.06 T: up down : 11 : 3 : 0.48 T: up down : 11 : 14 : 0.01 T: up down : 11 : 13 : 0.01 T: up down : 11 : 15 : 0.08 T: up down : 11 : 10 : 0.03 T: up down : 11 : 9 : 0.03 T: up down : 11 : 11 : 0.24 T: up left : 11 : 2 : 0.36 T: up left : 11 : 1 : 0.06 T: up left : 11 : 3 : 0.18 T: up left : 11 : 14 : 0.06 T: up left : 11 : 13 : 0.01 T: up left : 11 : 15 : 0.03 T: up left : 11 : 10 : 0.18 T: up left : 11 : 9 : 0.03 T: up left : 11 : 11 : 0.09 T: up right : 11 : 1 : 0.06 T: up right : 11 : 2 : 0.06 T: up right : 11 : 3 : 0.48 T: up right : 11 : 13 : 0.01 T: up right : 11 : 14 : 0.01 T: up right : 11 : 15 : 0.08 T: up right : 11 : 9 : 0.03 T: up right : 11 : 10 : 0.03 T: up right : 11 : 11 : 0.24 T: up stay : 11 : 3 : 0.6 T: up stay : 11 : 15 : 0.1 T: up stay : 11 : 11 : 0.3 T: down up : 11 : 13 : 0.06 T: down up : 11 : 14 : 0.01 T: down up : 11 : 15 : 0.03 T: down up : 11 : 1 : 0.06 T: down up : 11 : 2 : 0.01 T: down up : 11 : 3 : 0.03 T: down up : 11 : 9 : 0.48 T: down up : 11 : 10 : 0.08 T: down up : 11 : 11 : 0.24 T: down down : 11 : 14 : 0.01 T: down down : 11 : 13 : 0.01 T: down down : 11 : 15 : 0.08 T: down down : 11 : 2 : 0.01 T: down down : 11 : 1 : 0.01 T: down down : 11 : 3 : 0.08 T: down down : 11 : 10 : 0.08 T: down down : 11 : 9 : 0.08 T: down down : 11 : 11 : 0.64 T: down left : 11 : 14 : 0.06 T: down left : 11 : 13 : 0.01 T: down left : 11 : 15 : 0.03 T: down left : 11 : 2 : 0.06 T: down left : 11 : 1 : 0.01 T: down left : 11 : 3 : 0.03 T: down left : 11 : 10 : 0.48 T: down left : 11 : 9 : 0.08 T: down left : 11 : 11 : 0.24 T: down right : 11 : 13 : 0.01 T: down right : 11 : 14 : 0.01 T: down right : 11 : 15 : 0.08 T: down right : 11 : 1 : 0.01 T: down right : 11 : 2 : 0.01 T: down right : 11 : 3 : 0.08 T: down right : 11 : 9 : 0.08 T: down right : 11 : 10 : 0.08 T: down right : 11 : 11 : 0.64 T: down stay : 11 : 15 : 0.1 T: down stay : 11 : 3 : 0.1 T: down stay : 11 : 11 : 0.8 T: left up : 11 : 1 : 0.06 T: left up : 11 : 2 : 0.01 T: left up : 11 : 3 : 0.03 T: left up : 11 : 13 : 0.06 T: left up : 11 : 14 : 0.01 T: left up : 11 : 15 : 0.03 T: left up : 11 : 9 : 0.48 T: left up : 11 : 10 : 0.08 T: left up : 11 : 11 : 0.24 T: left down : 11 : 2 : 0.01 T: left down : 11 : 1 : 0.01 T: left down : 11 : 3 : 0.08 T: left down : 11 : 14 : 0.01 T: left down : 11 : 13 : 0.01 T: left down : 11 : 15 : 0.08 T: left down : 11 : 10 : 0.08 T: left down : 11 : 9 : 0.08 T: left down : 11 : 11 : 0.64 T: left left : 11 : 2 : 0.06 T: left left : 11 : 1 : 0.01 T: left left : 11 : 3 : 0.03 T: left left : 11 : 14 : 0.06 T: left left : 11 : 13 : 0.01 T: left left : 11 : 15 : 0.03 T: left left : 11 : 10 : 0.48 T: left left : 11 : 9 : 0.08 T: left left : 11 : 11 : 0.24 T: left right : 11 : 1 : 0.01 T: left right : 11 : 2 : 0.01 T: left right : 11 : 3 : 0.08 T: left right : 11 : 13 : 0.01 T: left right : 11 : 14 : 0.01 T: left right : 11 : 15 : 0.08 T: left right : 11 : 9 : 0.08 T: left right : 11 : 10 : 0.08 T: left right : 11 : 11 : 0.64 T: left stay : 11 : 3 : 0.1 T: left stay : 11 : 15 : 0.1 T: left stay : 11 : 11 : 0.8 T: right up : 11 : 13 : 0.36 T: right up : 11 : 14 : 0.06 T: right up : 11 : 15 : 0.18 T: right up : 11 : 1 : 0.06 T: right up : 11 : 2 : 0.01 T: right up : 11 : 3 : 0.03 T: right up : 11 : 9 : 0.18 T: right up : 11 : 10 : 0.03 T: right up : 11 : 11 : 0.09 T: right down : 11 : 14 : 0.06 T: right down : 11 : 13 : 0.06 T: right down : 11 : 15 : 0.48 T: right down : 11 : 2 : 0.01 T: right down : 11 : 1 : 0.01 T: right down : 11 : 3 : 0.08 T: right down : 11 : 10 : 0.03 T: right down : 11 : 9 : 0.03 T: right down : 11 : 11 : 0.24 T: right left : 11 : 14 : 0.36 T: right left : 11 : 13 : 0.06 T: right left : 11 : 15 : 0.18 T: right left : 11 : 2 : 0.06 T: right left : 11 : 1 : 0.01 T: right left : 11 : 3 : 0.03 T: right left : 11 : 10 : 0.18 T: right left : 11 : 9 : 0.03 T: right left : 11 : 11 : 0.09 T: right right : 11 : 13 : 0.06 T: right right : 11 : 14 : 0.06 T: right right : 11 : 15 : 0.48 T: right right : 11 : 1 : 0.01 T: right right : 11 : 2 : 0.01 T: right right : 11 : 3 : 0.08 T: right right : 11 : 9 : 0.03 T: right right : 11 : 10 : 0.03 T: right right : 11 : 11 : 0.24 T: right stay : 11 : 15 : 0.6 T: right stay : 11 : 3 : 0.1 T: right stay : 11 : 11 : 0.3 T: stay up : 11 : 9 : 0.6 T: stay up : 11 : 10 : 0.1 T: stay up : 11 : 11 : 0.3 T: stay down : 11 : 10 : 0.1 T: stay down : 11 : 9 : 0.1 T: stay down : 11 : 11 : 0.8 T: stay left : 11 : 10 : 0.6 T: stay left : 11 : 9 : 0.1 T: stay left : 11 : 11 : 0.3 T: stay right : 11 : 9 : 0.1 T: stay right : 11 : 10 : 0.1 T: stay right : 11 : 11 : 0.8 T: stay stay : 11 : 11 : 1.0 T: up up : 12 : 5 : 0.06 T: up up : 12 : 6 : 0.06 T: up up : 12 : 4 : 0.48 T: up up : 12 : 9 : 0.01 T: up up : 12 : 10 : 0.01 T: up up : 12 : 8 : 0.08 T: up up : 12 : 13 : 0.03 T: up up : 12 : 14 : 0.03 T: up up : 12 : 12 : 0.24 T: up down : 12 : 6 : 0.36 T: up down : 12 : 5 : 0.06 T: up down : 12 : 4 : 0.18 T: up down : 12 : 10 : 0.06 T: up down : 12 : 9 : 0.01 T: up down : 12 : 8 : 0.03 T: up down : 12 : 14 : 0.18 T: up down : 12 : 13 : 0.03 T: up down : 12 : 12 : 0.09 T: up left : 12 : 6 : 0.06 T: up left : 12 : 5 : 0.06 T: up left : 12 : 4 : 0.48 T: up left : 12 : 10 : 0.01 T: up left : 12 : 9 : 0.01 T: up left : 12 : 8 : 0.08 T: up left : 12 : 14 : 0.03 T: up left : 12 : 13 : 0.03 T: up left : 12 : 12 : 0.24 T: up right : 12 : 5 : 0.36 T: up right : 12 : 6 : 0.06 T: up right : 12 : 4 : 0.18 T: up right : 12 : 9 : 0.06 T: up right : 12 : 10 : 0.01 T: up right : 12 : 8 : 0.03 T: up right : 12 : 13 : 0.18 T: up right : 12 : 14 : 0.03 T: up right : 12 : 12 : 0.09 T: up stay : 12 : 4 : 0.6 T: up stay : 12 : 8 : 0.1 T: up stay : 12 : 12 : 0.3 T: down up : 12 : 9 : 0.01 T: down up : 12 : 10 : 0.01 T: down up : 12 : 8 : 0.08 T: down up : 12 : 5 : 0.01 T: down up : 12 : 6 : 0.01 T: down up : 12 : 4 : 0.08 T: down up : 12 : 13 : 0.08 T: down up : 12 : 14 : 0.08 T: down up : 12 : 12 : 0.64 T: down down : 12 : 10 : 0.06 T: down down : 12 : 9 : 0.01 T: down down : 12 : 8 : 0.03 T: down down : 12 : 6 : 0.06 T: down down : 12 : 5 : 0.01 T: down down : 12 : 4 : 0.03 T: down down : 12 : 14 : 0.48 T: down down : 12 : 13 : 0.08 T: down down : 12 : 12 : 0.24 T: down left : 12 : 10 : 0.01 T: down left : 12 : 9 : 0.01 T: down left : 12 : 8 : 0.08 T: down left : 12 : 6 : 0.01 T: down left : 12 : 5 : 0.01 T: down left : 12 : 4 : 0.08 T: down left : 12 : 14 : 0.08 T: down left : 12 : 13 : 0.08 T: down left : 12 : 12 : 0.64 T: down right : 12 : 9 : 0.06 T: down right : 12 : 10 : 0.01 T: down right : 12 : 8 : 0.03 T: down right : 12 : 5 : 0.06 T: down right : 12 : 6 : 0.01 T: down right : 12 : 4 : 0.03 T: down right : 12 : 13 : 0.48 T: down right : 12 : 14 : 0.08 T: down right : 12 : 12 : 0.24 T: down stay : 12 : 8 : 0.1 T: down stay : 12 : 4 : 0.1 T: down stay : 12 : 12 : 0.8 T: left up : 12 : 9 : 0.06 T: left up : 12 : 10 : 0.06 T: left up : 12 : 8 : 0.48 T: left up : 12 : 5 : 0.01 T: left up : 12 : 6 : 0.01 T: left up : 12 : 4 : 0.08 T: left up : 12 : 13 : 0.03 T: left up : 12 : 14 : 0.03 T: left up : 12 : 12 : 0.24 T: left down : 12 : 10 : 0.36 T: left down : 12 : 9 : 0.06 T: left down : 12 : 8 : 0.18 T: left down : 12 : 6 : 0.06 T: left down : 12 : 5 : 0.01 T: left down : 12 : 4 : 0.03 T: left down : 12 : 14 : 0.18 T: left down : 12 : 13 : 0.03 T: left down : 12 : 12 : 0.09 T: left left : 12 : 10 : 0.06 T: left left : 12 : 9 : 0.06 T: left left : 12 : 8 : 0.48 T: left left : 12 : 6 : 0.01 T: left left : 12 : 5 : 0.01 T: left left : 12 : 4 : 0.08 T: left left : 12 : 14 : 0.03 T: left left : 12 : 13 : 0.03 T: left left : 12 : 12 : 0.24 T: left right : 12 : 9 : 0.36 T: left right : 12 : 10 : 0.06 T: left right : 12 : 8 : 0.18 T: left right : 12 : 5 : 0.06 T: left right : 12 : 6 : 0.01 T: left right : 12 : 4 : 0.03 T: left right : 12 : 13 : 0.18 T: left right : 12 : 14 : 0.03 T: left right : 12 : 12 : 0.09 T: left stay : 12 : 8 : 0.6 T: left stay : 12 : 4 : 0.1 T: left stay : 12 : 12 : 0.3 T: right up : 12 : 5 : 0.01 T: right up : 12 : 6 : 0.01 T: right up : 12 : 4 : 0.08 T: right up : 12 : 9 : 0.01 T: right up : 12 : 10 : 0.01 T: right up : 12 : 8 : 0.08 T: right up : 12 : 13 : 0.08 T: right up : 12 : 14 : 0.08 T: right up : 12 : 12 : 0.64 T: right down : 12 : 6 : 0.06 T: right down : 12 : 5 : 0.01 T: right down : 12 : 4 : 0.03 T: right down : 12 : 10 : 0.06 T: right down : 12 : 9 : 0.01 T: right down : 12 : 8 : 0.03 T: right down : 12 : 14 : 0.48 T: right down : 12 : 13 : 0.08 T: right down : 12 : 12 : 0.24 T: right left : 12 : 6 : 0.01 T: right left : 12 : 5 : 0.01 T: right left : 12 : 4 : 0.08 T: right left : 12 : 10 : 0.01 T: right left : 12 : 9 : 0.01 T: right left : 12 : 8 : 0.08 T: right left : 12 : 14 : 0.08 T: right left : 12 : 13 : 0.08 T: right left : 12 : 12 : 0.64 T: right right : 12 : 5 : 0.06 T: right right : 12 : 6 : 0.01 T: right right : 12 : 4 : 0.03 T: right right : 12 : 9 : 0.06 T: right right : 12 : 10 : 0.01 T: right right : 12 : 8 : 0.03 T: right right : 12 : 13 : 0.48 T: right right : 12 : 14 : 0.08 T: right right : 12 : 12 : 0.24 T: right stay : 12 : 4 : 0.1 T: right stay : 12 : 8 : 0.1 T: right stay : 12 : 12 : 0.8 T: stay up : 12 : 13 : 0.1 T: stay up : 12 : 14 : 0.1 T: stay up : 12 : 12 : 0.8 T: stay down : 12 : 14 : 0.6 T: stay down : 12 : 13 : 0.1 T: stay down : 12 : 12 : 0.3 T: stay left : 12 : 14 : 0.1 T: stay left : 12 : 13 : 0.1 T: stay left : 12 : 12 : 0.8 T: stay right : 12 : 13 : 0.6 T: stay right : 12 : 14 : 0.1 T: stay right : 12 : 12 : 0.3 T: stay stay : 12 : 12 : 1.0 T: up up : 13 : 4 : 0.06 T: up up : 13 : 7 : 0.06 T: up up : 13 : 5 : 0.48 T: up up : 13 : 8 : 0.01 T: up up : 13 : 11 : 0.01 T: up up : 13 : 9 : 0.08 T: up up : 13 : 12 : 0.03 T: up up : 13 : 15 : 0.03 T: up up : 13 : 13 : 0.24 T: up down : 13 : 7 : 0.36 T: up down : 13 : 4 : 0.06 T: up down : 13 : 5 : 0.18 T: up down : 13 : 11 : 0.06 T: up down : 13 : 8 : 0.01 T: up down : 13 : 9 : 0.03 T: up down : 13 : 15 : 0.18 T: up down : 13 : 12 : 0.03 T: up down : 13 : 13 : 0.09 T: up left : 13 : 4 : 0.36 T: up left : 13 : 7 : 0.06 T: up left : 13 : 5 : 0.18 T: up left : 13 : 8 : 0.06 T: up left : 13 : 11 : 0.01 T: up left : 13 : 9 : 0.03 T: up left : 13 : 12 : 0.18 T: up left : 13 : 15 : 0.03 T: up left : 13 : 13 : 0.09 T: up right : 13 : 7 : 0.06 T: up right : 13 : 4 : 0.06 T: up right : 13 : 5 : 0.48 T: up right : 13 : 11 : 0.01 T: up right : 13 : 8 : 0.01 T: up right : 13 : 9 : 0.08 T: up right : 13 : 15 : 0.03 T: up right : 13 : 12 : 0.03 T: up right : 13 : 13 : 0.24 T: up stay : 13 : 5 : 0.6 T: up stay : 13 : 9 : 0.1 T: up stay : 13 : 13 : 0.3 T: down up : 13 : 8 : 0.01 T: down up : 13 : 11 : 0.01 T: down up : 13 : 9 : 0.08 T: down up : 13 : 4 : 0.01 T: down up : 13 : 7 : 0.01 T: down up : 13 : 5 : 0.08 T: down up : 13 : 12 : 0.08 T: down up : 13 : 15 : 0.08 T: down up : 13 : 13 : 0.64 T: down down : 13 : 11 : 0.06 T: down down : 13 : 8 : 0.01 T: down down : 13 : 9 : 0.03 T: down down : 13 : 7 : 0.06 T: down down : 13 : 4 : 0.01 T: down down : 13 : 5 : 0.03 T: down down : 13 : 15 : 0.48 T: down down : 13 : 12 : 0.08 T: down down : 13 : 13 : 0.24 T: down left : 13 : 8 : 0.06 T: down left : 13 : 11 : 0.01 T: down left : 13 : 9 : 0.03 T: down left : 13 : 4 : 0.06 T: down left : 13 : 7 : 0.01 T: down left : 13 : 5 : 0.03 T: down left : 13 : 12 : 0.48 T: down left : 13 : 15 : 0.08 T: down left : 13 : 13 : 0.24 T: down right : 13 : 11 : 0.01 T: down right : 13 : 8 : 0.01 T: down right : 13 : 9 : 0.08 T: down right : 13 : 7 : 0.01 T: down right : 13 : 4 : 0.01 T: down right : 13 : 5 : 0.08 T: down right : 13 : 15 : 0.08 T: down right : 13 : 12 : 0.08 T: down right : 13 : 13 : 0.64 T: down stay : 13 : 9 : 0.1 T: down stay : 13 : 5 : 0.1 T: down stay : 13 : 13 : 0.8 T: left up : 13 : 8 : 0.06 T: left up : 13 : 11 : 0.06 T: left up : 13 : 9 : 0.48 T: left up : 13 : 4 : 0.01 T: left up : 13 : 7 : 0.01 T: left up : 13 : 5 : 0.08 T: left up : 13 : 12 : 0.03 T: left up : 13 : 15 : 0.03 T: left up : 13 : 13 : 0.24 T: left down : 13 : 11 : 0.36 T: left down : 13 : 8 : 0.06 T: left down : 13 : 9 : 0.18 T: left down : 13 : 7 : 0.06 T: left down : 13 : 4 : 0.01 T: left down : 13 : 5 : 0.03 T: left down : 13 : 15 : 0.18 T: left down : 13 : 12 : 0.03 T: left down : 13 : 13 : 0.09 T: left left : 13 : 8 : 0.36 T: left left : 13 : 11 : 0.06 T: left left : 13 : 9 : 0.18 T: left left : 13 : 4 : 0.06 T: left left : 13 : 7 : 0.01 T: left left : 13 : 5 : 0.03 T: left left : 13 : 12 : 0.18 T: left left : 13 : 15 : 0.03 T: left left : 13 : 13 : 0.09 T: left right : 13 : 11 : 0.06 T: left right : 13 : 8 : 0.06 T: left right : 13 : 9 : 0.48 T: left right : 13 : 7 : 0.01 T: left right : 13 : 4 : 0.01 T: left right : 13 : 5 : 0.08 T: left right : 13 : 15 : 0.03 T: left right : 13 : 12 : 0.03 T: left right : 13 : 13 : 0.24 T: left stay : 13 : 9 : 0.6 T: left stay : 13 : 5 : 0.1 T: left stay : 13 : 13 : 0.3 T: right up : 13 : 4 : 0.01 T: right up : 13 : 7 : 0.01 T: right up : 13 : 5 : 0.08 T: right up : 13 : 8 : 0.01 T: right up : 13 : 11 : 0.01 T: right up : 13 : 9 : 0.08 T: right up : 13 : 12 : 0.08 T: right up : 13 : 15 : 0.08 T: right up : 13 : 13 : 0.64 T: right down : 13 : 7 : 0.06 T: right down : 13 : 4 : 0.01 T: right down : 13 : 5 : 0.03 T: right down : 13 : 11 : 0.06 T: right down : 13 : 8 : 0.01 T: right down : 13 : 9 : 0.03 T: right down : 13 : 15 : 0.48 T: right down : 13 : 12 : 0.08 T: right down : 13 : 13 : 0.24 T: right left : 13 : 4 : 0.06 T: right left : 13 : 7 : 0.01 T: right left : 13 : 5 : 0.03 T: right left : 13 : 8 : 0.06 T: right left : 13 : 11 : 0.01 T: right left : 13 : 9 : 0.03 T: right left : 13 : 12 : 0.48 T: right left : 13 : 15 : 0.08 T: right left : 13 : 13 : 0.24 T: right right : 13 : 7 : 0.01 T: right right : 13 : 4 : 0.01 T: right right : 13 : 5 : 0.08 T: right right : 13 : 11 : 0.01 T: right right : 13 : 8 : 0.01 T: right right : 13 : 9 : 0.08 T: right right : 13 : 15 : 0.08 T: right right : 13 : 12 : 0.08 T: right right : 13 : 13 : 0.64 T: right stay : 13 : 5 : 0.1 T: right stay : 13 : 9 : 0.1 T: right stay : 13 : 13 : 0.8 T: stay up : 13 : 12 : 0.1 T: stay up : 13 : 15 : 0.1 T: stay up : 13 : 13 : 0.8 T: stay down : 13 : 15 : 0.6 T: stay down : 13 : 12 : 0.1 T: stay down : 13 : 13 : 0.3 T: stay left : 13 : 12 : 0.6 T: stay left : 13 : 15 : 0.1 T: stay left : 13 : 13 : 0.3 T: stay right : 13 : 15 : 0.1 T: stay right : 13 : 12 : 0.1 T: stay right : 13 : 13 : 0.8 T: stay stay : 13 : 13 : 1.0 T: up up : 14 : 4 : 0.36 T: up up : 14 : 7 : 0.06 T: up up : 14 : 6 : 0.18 T: up up : 14 : 8 : 0.06 T: up up : 14 : 11 : 0.01 T: up up : 14 : 10 : 0.03 T: up up : 14 : 12 : 0.18 T: up up : 14 : 15 : 0.03 T: up up : 14 : 14 : 0.09 T: up down : 14 : 7 : 0.06 T: up down : 14 : 4 : 0.06 T: up down : 14 : 6 : 0.48 T: up down : 14 : 11 : 0.01 T: up down : 14 : 8 : 0.01 T: up down : 14 : 10 : 0.08 T: up down : 14 : 15 : 0.03 T: up down : 14 : 12 : 0.03 T: up down : 14 : 14 : 0.24 T: up left : 14 : 4 : 0.06 T: up left : 14 : 7 : 0.06 T: up left : 14 : 6 : 0.48 T: up left : 14 : 8 : 0.01 T: up left : 14 : 11 : 0.01 T: up left : 14 : 10 : 0.08 T: up left : 14 : 12 : 0.03 T: up left : 14 : 15 : 0.03 T: up left : 14 : 14 : 0.24 T: up right : 14 : 7 : 0.36 T: up right : 14 : 4 : 0.06 T: up right : 14 : 6 : 0.18 T: up right : 14 : 11 : 0.06 T: up right : 14 : 8 : 0.01 T: up right : 14 : 10 : 0.03 T: up right : 14 : 15 : 0.18 T: up right : 14 : 12 : 0.03 T: up right : 14 : 14 : 0.09 T: up stay : 14 : 6 : 0.6 T: up stay : 14 : 10 : 0.1 T: up stay : 14 : 14 : 0.3 T: down up : 14 : 8 : 0.06 T: down up : 14 : 11 : 0.01 T: down up : 14 : 10 : 0.03 T: down up : 14 : 4 : 0.06 T: down up : 14 : 7 : 0.01 T: down up : 14 : 6 : 0.03 T: down up : 14 : 12 : 0.48 T: down up : 14 : 15 : 0.08 T: down up : 14 : 14 : 0.24 T: down down : 14 : 11 : 0.01 T: down down : 14 : 8 : 0.01 T: down down : 14 : 10 : 0.08 T: down down : 14 : 7 : 0.01 T: down down : 14 : 4 : 0.01 T: down down : 14 : 6 : 0.08 T: down down : 14 : 15 : 0.08 T: down down : 14 : 12 : 0.08 T: down down : 14 : 14 : 0.64 T: down left : 14 : 8 : 0.01 T: down left : 14 : 11 : 0.01 T: down left : 14 : 10 : 0.08 T: down left : 14 : 4 : 0.01 T: down left : 14 : 7 : 0.01 T: down left : 14 : 6 : 0.08 T: down left : 14 : 12 : 0.08 T: down left : 14 : 15 : 0.08 T: down left : 14 : 14 : 0.64 T: down right : 14 : 11 : 0.06 T: down right : 14 : 8 : 0.01 T: down right : 14 : 10 : 0.03 T: down right : 14 : 7 : 0.06 T: down right : 14 : 4 : 0.01 T: down right : 14 : 6 : 0.03 T: down right : 14 : 15 : 0.48 T: down right : 14 : 12 : 0.08 T: down right : 14 : 14 : 0.24 T: down stay : 14 : 10 : 0.1 T: down stay : 14 : 6 : 0.1 T: down stay : 14 : 14 : 0.8 T: left up : 14 : 8 : 0.36 T: left up : 14 : 11 : 0.06 T: left up : 14 : 10 : 0.18 T: left up : 14 : 4 : 0.06 T: left up : 14 : 7 : 0.01 T: left up : 14 : 6 : 0.03 T: left up : 14 : 12 : 0.18 T: left up : 14 : 15 : 0.03 T: left up : 14 : 14 : 0.09 T: left down : 14 : 11 : 0.06 T: left down : 14 : 8 : 0.06 T: left down : 14 : 10 : 0.48 T: left down : 14 : 7 : 0.01 T: left down : 14 : 4 : 0.01 T: left down : 14 : 6 : 0.08 T: left down : 14 : 15 : 0.03 T: left down : 14 : 12 : 0.03 T: left down : 14 : 14 : 0.24 T: left left : 14 : 8 : 0.06 T: left left : 14 : 11 : 0.06 T: left left : 14 : 10 : 0.48 T: left left : 14 : 4 : 0.01 T: left left : 14 : 7 : 0.01 T: left left : 14 : 6 : 0.08 T: left left : 14 : 12 : 0.03 T: left left : 14 : 15 : 0.03 T: left left : 14 : 14 : 0.24 T: left right : 14 : 11 : 0.36 T: left right : 14 : 8 : 0.06 T: left right : 14 : 10 : 0.18 T: left right : 14 : 7 : 0.06 T: left right : 14 : 4 : 0.01 T: left right : 14 : 6 : 0.03 T: left right : 14 : 15 : 0.18 T: left right : 14 : 12 : 0.03 T: left right : 14 : 14 : 0.09 T: left stay : 14 : 10 : 0.6 T: left stay : 14 : 6 : 0.1 T: left stay : 14 : 14 : 0.3 T: right up : 14 : 4 : 0.06 T: right up : 14 : 7 : 0.01 T: right up : 14 : 6 : 0.03 T: right up : 14 : 8 : 0.06 T: right up : 14 : 11 : 0.01 T: right up : 14 : 10 : 0.03 T: right up : 14 : 12 : 0.48 T: right up : 14 : 15 : 0.08 T: right up : 14 : 14 : 0.24 T: right down : 14 : 7 : 0.01 T: right down : 14 : 4 : 0.01 T: right down : 14 : 6 : 0.08 T: right down : 14 : 11 : 0.01 T: right down : 14 : 8 : 0.01 T: right down : 14 : 10 : 0.08 T: right down : 14 : 15 : 0.08 T: right down : 14 : 12 : 0.08 T: right down : 14 : 14 : 0.64 T: right left : 14 : 4 : 0.01 T: right left : 14 : 7 : 0.01 T: right left : 14 : 6 : 0.08 T: right left : 14 : 8 : 0.01 T: right left : 14 : 11 : 0.01 T: right left : 14 : 10 : 0.08 T: right left : 14 : 12 : 0.08 T: right left : 14 : 15 : 0.08 T: right left : 14 : 14 : 0.64 T: right right : 14 : 7 : 0.06 T: right right : 14 : 4 : 0.01 T: right right : 14 : 6 : 0.03 T: right right : 14 : 11 : 0.06 T: right right : 14 : 8 : 0.01 T: right right : 14 : 10 : 0.03 T: right right : 14 : 15 : 0.48 T: right right : 14 : 12 : 0.08 T: right right : 14 : 14 : 0.24 T: right stay : 14 : 6 : 0.1 T: right stay : 14 : 10 : 0.1 T: right stay : 14 : 14 : 0.8 T: stay up : 14 : 12 : 0.6 T: stay up : 14 : 15 : 0.1 T: stay up : 14 : 14 : 0.3 T: stay down : 14 : 15 : 0.1 T: stay down : 14 : 12 : 0.1 T: stay down : 14 : 14 : 0.8 T: stay left : 14 : 12 : 0.1 T: stay left : 14 : 15 : 0.1 T: stay left : 14 : 14 : 0.8 T: stay right : 14 : 15 : 0.6 T: stay right : 14 : 12 : 0.1 T: stay right : 14 : 14 : 0.3 T: stay stay : 14 : 14 : 1.0 T: up up : 15 : 5 : 0.36 T: up up : 15 : 6 : 0.06 T: up up : 15 : 7 : 0.18 T: up up : 15 : 9 : 0.06 T: up up : 15 : 10 : 0.01 T: up up : 15 : 11 : 0.03 T: up up : 15 : 13 : 0.18 T: up up : 15 : 14 : 0.03 T: up up : 15 : 15 : 0.09 T: up down : 15 : 6 : 0.06 T: up down : 15 : 5 : 0.06 T: up down : 15 : 7 : 0.48 T: up down : 15 : 10 : 0.01 T: up down : 15 : 9 : 0.01 T: up down : 15 : 11 : 0.08 T: up down : 15 : 14 : 0.03 T: up down : 15 : 13 : 0.03 T: up down : 15 : 15 : 0.24 T: up left : 15 : 6 : 0.36 T: up left : 15 : 5 : 0.06 T: up left : 15 : 7 : 0.18 T: up left : 15 : 10 : 0.06 T: up left : 15 : 9 : 0.01 T: up left : 15 : 11 : 0.03 T: up left : 15 : 14 : 0.18 T: up left : 15 : 13 : 0.03 T: up left : 15 : 15 : 0.09 T: up right : 15 : 5 : 0.06 T: up right : 15 : 6 : 0.06 T: up right : 15 : 7 : 0.48 T: up right : 15 : 9 : 0.01 T: up right : 15 : 10 : 0.01 T: up right : 15 : 11 : 0.08 T: up right : 15 : 13 : 0.03 T: up right : 15 : 14 : 0.03 T: up right : 15 : 15 : 0.24 T: up stay : 15 : 7 : 0.6 T: up stay : 15 : 11 : 0.1 T: up stay : 15 : 15 : 0.3 T: down up : 15 : 9 : 0.06 T: down up : 15 : 10 : 0.01 T: down up : 15 : 11 : 0.03 T: down up : 15 : 5 : 0.06 T: down up : 15 : 6 : 0.01 T: down up : 15 : 7 : 0.03 T: down up : 15 : 13 : 0.48 T: down up : 15 : 14 : 0.08 T: down up : 15 : 15 : 0.24 T: down down : 15 : 10 : 0.01 T: down down : 15 : 9 : 0.01 T: down down : 15 : 11 : 0.08 T: down down : 15 : 6 : 0.01 T: down down : 15 : 5 : 0.01 T: down down : 15 : 7 : 0.08 T: down down : 15 : 14 : 0.08 T: down down : 15 : 13 : 0.08 T: down down : 15 : 15 : 0.64 T: down left : 15 : 10 : 0.06 T: down left : 15 : 9 : 0.01 T: down left : 15 : 11 : 0.03 T: down left : 15 : 6 : 0.06 T: down left : 15 : 5 : 0.01 T: down left : 15 : 7 : 0.03 T: down left : 15 : 14 : 0.48 T: down left : 15 : 13 : 0.08 T: down left : 15 : 15 : 0.24 T: down right : 15 : 9 : 0.01 T: down right : 15 : 10 : 0.01 T: down right : 15 : 11 : 0.08 T: down right : 15 : 5 : 0.01 T: down right : 15 : 6 : 0.01 T: down right : 15 : 7 : 0.08 T: down right : 15 : 13 : 0.08 T: down right : 15 : 14 : 0.08 T: down right : 15 : 15 : 0.64 T: down stay : 15 : 11 : 0.1 T: down stay : 15 : 7 : 0.1 T: down stay : 15 : 15 : 0.8 T: left up : 15 : 9 : 0.36 T: left up : 15 : 10 : 0.06 T: left up : 15 : 11 : 0.18 T: left up : 15 : 5 : 0.06 T: left up : 15 : 6 : 0.01 T: left up : 15 : 7 : 0.03 T: left up : 15 : 13 : 0.18 T: left up : 15 : 14 : 0.03 T: left up : 15 : 15 : 0.09 T: left down : 15 : 10 : 0.06 T: left down : 15 : 9 : 0.06 T: left down : 15 : 11 : 0.48 T: left down : 15 : 6 : 0.01 T: left down : 15 : 5 : 0.01 T: left down : 15 : 7 : 0.08 T: left down : 15 : 14 : 0.03 T: left down : 15 : 13 : 0.03 T: left down : 15 : 15 : 0.24 T: left left : 15 : 10 : 0.36 T: left left : 15 : 9 : 0.06 T: left left : 15 : 11 : 0.18 T: left left : 15 : 6 : 0.06 T: left left : 15 : 5 : 0.01 T: left left : 15 : 7 : 0.03 T: left left : 15 : 14 : 0.18 T: left left : 15 : 13 : 0.03 T: left left : 15 : 15 : 0.09 T: left right : 15 : 9 : 0.06 T: left right : 15 : 10 : 0.06 T: left right : 15 : 11 : 0.48 T: left right : 15 : 5 : 0.01 T: left right : 15 : 6 : 0.01 T: left right : 15 : 7 : 0.08 T: left right : 15 : 13 : 0.03 T: left right : 15 : 14 : 0.03 T: left right : 15 : 15 : 0.24 T: left stay : 15 : 11 : 0.6 T: left stay : 15 : 7 : 0.1 T: left stay : 15 : 15 : 0.3 T: right up : 15 : 5 : 0.06 T: right up : 15 : 6 : 0.01 T: right up : 15 : 7 : 0.03 T: right up : 15 : 9 : 0.06 T: right up : 15 : 10 : 0.01 T: right up : 15 : 11 : 0.03 T: right up : 15 : 13 : 0.48 T: right up : 15 : 14 : 0.08 T: right up : 15 : 15 : 0.24 T: right down : 15 : 6 : 0.01 T: right down : 15 : 5 : 0.01 T: right down : 15 : 7 : 0.08 T: right down : 15 : 10 : 0.01 T: right down : 15 : 9 : 0.01 T: right down : 15 : 11 : 0.08 T: right down : 15 : 14 : 0.08 T: right down : 15 : 13 : 0.08 T: right down : 15 : 15 : 0.64 T: right left : 15 : 6 : 0.06 T: right left : 15 : 5 : 0.01 T: right left : 15 : 7 : 0.03 T: right left : 15 : 10 : 0.06 T: right left : 15 : 9 : 0.01 T: right left : 15 : 11 : 0.03 T: right left : 15 : 14 : 0.48 T: right left : 15 : 13 : 0.08 T: right left : 15 : 15 : 0.24 T: right right : 15 : 5 : 0.01 T: right right : 15 : 6 : 0.01 T: right right : 15 : 7 : 0.08 T: right right : 15 : 9 : 0.01 T: right right : 15 : 10 : 0.01 T: right right : 15 : 11 : 0.08 T: right right : 15 : 13 : 0.08 T: right right : 15 : 14 : 0.08 T: right right : 15 : 15 : 0.64 T: right stay : 15 : 7 : 0.1 T: right stay : 15 : 11 : 0.1 T: right stay : 15 : 15 : 0.8 T: stay up : 15 : 13 : 0.6 T: stay up : 15 : 14 : 0.1 T: stay up : 15 : 15 : 0.3 T: stay down : 15 : 14 : 0.1 T: stay down : 15 : 13 : 0.1 T: stay down : 15 : 15 : 0.8 T: stay left : 15 : 14 : 0.6 T: stay left : 15 : 13 : 0.1 T: stay left : 15 : 15 : 0.3 T: stay right : 15 : 13 : 0.1 T: stay right : 15 : 14 : 0.1 T: stay right : 15 : 15 : 0.8 T: stay stay : 15 : 15 : 1.0 O: * : 0 : nnnnnynnn nnnnnynnn : 1.0 O: * : 1 : nnnnnynnn nnnynnnnn : 1.0 O: * : 2 : nnnnnynnn nnnnnynnn : 1.0 O: * : 3 : nnnnnynnn nnnynnnnn : 1.0 O: * : 4 : nnnynnnnn nnnnnynnn : 1.0 O: * : 5 : nnnynnnnn nnnynnnnn : 1.0 O: * : 6 : nnnynnnnn nnnnnynnn : 1.0 O: * : 7 : nnnynnnnn nnnynnnnn : 1.0 O: * : 8 : nnnnnynnn nnnnnynnn : 1.0 O: * : 9 : nnnnnynnn nnnynnnnn : 1.0 O: * : 10 : nnnnnynnn nnnnnynnn : 1.0 O: * : 11 : nnnnnynnn nnnynnnnn : 1.0 O: * : 12 : nnnynnnnn nnnnnynnn : 1.0 O: * : 13 : nnnynnnnn nnnynnnnn : 1.0 O: * : 14 : nnnynnnnn nnnnnynnn : 1.0 O: * : 15 : nnnynnnnn nnnynnnnn : 1.0 R: * : * : 0 : * : 1.0 R: * : * : 5 : * : 1.0 R: * : * : 10 : * : 1.0 R: * : * : 15 : * : 1.0 madp-0.4/problems/PaxHeaders.5405/broadcastChannel.dpomdp0000644000000000000000000000007312717644140020245 xustar0029 atime=1463765180.07772035 30 ctime=1463765201.025553043 madp-0.4/problems/broadcastChannel.dpomdp0000664000372100037210000001175112717644140021102 0ustar00fransfrans00000000000000# This is a Dec-POMDP (.dpomdp) file for the broadcast channel problem. # For more detailed documentation, see example.dpomdp # Allright, here we go! # #The agents. #---------- #Either 1) the number of agents: # agents: %d #or 2) a list of agent identifiers, e.g.: # agents: agent1_name, name-of-agent2, ... agents: 2 # discount: %f discount: 1 #.0 # values: [ reward, cost ] values: reward # states: [ %d, ] # format is Sab where a=1 <-> agent 1 has a message states: S00 S01 S10 S11 # #Examples of this are: # start: 0.3 0.1 0.0 0.2 0.5 # start: first-state # start: 5 # start: uniform # start include: first-state third state # start include: 1 3 # start exclude: fifth-state seventh-state # TODO:check the start-state start: S11 # #The actions declarations #------------------------ #the (number/list of) actions for each of the agents on a separate line # actions: # [ %d, ] # [ %d, ] # ... # [ %d, ] actions: send wait send wait #the (number/list of) observations for each of the agents on a separate line # observations: # [ %d, ] # [ %d, ] # ... # [ %d, ] observations: Collision No-Collision Collision No-Collision #Transition probabilities # T: : : : %f #or # T: : : # %f %f ... %f P(s_1'|ja,s) ... P(s_k'|ja,s) #or # T: : this is a |S| x |S| matrix # %f %f ... %f P(s_1'|ja,s_1) ... P(s_k'|ja,s_1) # %f %f ... %f ... # ... ... # %f %f ... %f P(s_1'|ja,s_k) ... P(s_k'|ja,s_k) #or # T: # [ identity, uniform ] # # The from state does not affect the probabilities of the next state # (if action send is performed) T: send send : * : S00 : 0.09 #=0.1 * 0.9 T: send send : * : S10 : 0.81 #=0.9 * 0.9 T: send send : * : S01 : 0.01 #0.1 * 0.1 T: send send : * : S11 : 0.09 #0.9 * 0.1 # T: send wait : S11 : S11 : 0.9 #0.9 * 1.0 T: send wait : S11 : S01 : 0.1 #0.1 * 1.0 T: send wait : S01 : S11 : 0.9 #0.9 * 1.0 T: send wait : S01 : S01 : 0.1 #0.1 * 1.0 # T: send wait : S10 : S11 : 0.09 #0.9 * 0.1 T: send wait : S10 : S01 : 0.01 #0.1 * 0.1 T: send wait : S00 : S11 : 0.09 #0.9 * 0.1 T: send wait : S00 : S01 : 0.01 #0.1 * 0.1 T: send wait : S10 : S10 : 0.81 #0.9 * 0.9 T: send wait : S10 : S00 : 0.09 #0.1 * 0.9 T: send wait : S00 : S10 : 0.81 #0.9 * 0.9 T: send wait : S00 : S00 : 0.09 #0.1 * 0.9 # T: wait send : S11 : S11 : 0.1 #1.0 * 0.1 T: wait send : S11 : S10 : 0.9 #1.0 * 0.9 T: wait send : S10 : S11 : 0.1 #1.0 * 0.1 T: wait send : S10 : S10 : 0.9 #1.0 * 0.9 # T: wait send : S01 : S11 : 0.09 #0.9 * 0.1 T: wait send : S01 : S10 : 0.81 #0.9 * 0.9 T: wait send : S00 : S11 : 0.09 #0.9 * 0.1 T: wait send : S00 : S10 : 0.81 #0.9 * 0.9 T: wait send : S01 : S01 : 0.01 #0.1 * 0.1 T: wait send : S01 : S00 : 0.09 #0.1 * 0.9 T: wait send : S00 : S01 : 0.01 #0.1 * 0.1 T: wait send : S00 : S00 : 0.09 #0.1 * 0.9 # T: wait wait : S11 : S11 : 1.0 #1.0 * 1.0 T: wait wait : S01 : S11 : 0.9 #0.9 * 1.0 T: wait wait : S01 : S01 : 0.1 #0.1 * 1.0 T: wait wait : S10 : S11 : 0.1 #1.0 * 0.1 T: wait wait : S10 : S10 : 0.9 #1.0 * 0.9 T: wait wait : S00 : S11 : 0.09 #0.9 * 0.1 T: wait wait : S00 : S01 : 0.01 #0.1 * 0.1 T: wait wait : S00 : S10 : 0.81 #0.9 * 0.9 T: wait wait : S00 : S00 : 0.09 #0.1 * 0.9 # #Observation probabilities # O: : : : %f #or # O: : : # %f %f ... %f P(jo_1|ja,s') ... P(jo_x|ja,s') #or # O: : - a |S|x|JO| matrix # %f %f ... %f P(jo_1|ja,s_1') ... P(jo_x|ja,s_1') # %f %f ... %f ... # ... ... # %f %f ... %f P(jo_1|ja,s_k') ... P(jo_x|ja,s_k') # # what is the factor for the noisy observations? # I'm now assuming that P(Collision | send send) = 0.9 per agent O: * : * : Collision Collision : 0.01 # O: * : * : No-Collision Collision : 0.09 # O: * : * : Collision No-Collision : 0.09 # O: * : * : No-Collision No-Collision : 0.81 # O: send send : * : Collision Collision : 0.81 # O: send send : * : No-Collision Collision : 0.09 # O: send send : * : Collision No-Collision : 0.09 # O: send send : * : No-Collision No-Collision : 0.01 # #The rewards # R: : : : : %f #or #or # R: : : : # %f %f ... %f #or # R: : : # %f %f ... %f # %f %f ... %f # ... # %f %f ... %f # #Typical problems only use R(s,ja) which is specified by: # R: : : * : * : %f # R: send send : * : * : * : 0 R: wait wait : * : * : * : 0 R: send wait : S11 : * : * : 1 R: send wait : S10 : * : * : 1 R: send wait : S01 : * : * : 0 R: send wait : S00 : * : * : 0 R: wait send : S11 : * : * : 1 R: wait send : S10 : * : * : 0 R: wait send : S01 : * : * : 1 R: wait send : S00 : * : * : 0 # madp-0.4/problems/PaxHeaders.5405/prisoners.dpomdp0000644000000000000000000000007412717644140017037 xustar0030 atime=1463765180.081720318 30 ctime=1463765201.025553043 madp-0.4/problems/prisoners.dpomdp0000664000372100037210000000540112717644140017666 0ustar00fransfrans00000000000000# This is a Dec-POMDP (.dpomdp) file for the Prisoner's dilemma. # For more detailed documentation, see test.dpomdp in the parser subdirectory # (src/parser). # #The agents. #---------- #Either 1) the number of agents: # agents: %d #or 2) a list of agent identifiers, e.g.: # agents: agent1_name, name-of-agent2, ... agents: 2 # discount: %f discount: 1 #.0 # values: [ reward, cost ] values: reward # states: [ %d, ] states: NULL_STATE # #Examples of this are: # start: 0.3 0.1 0.0 0.2 0.5 # start: first-state # start: 5 # start: uniform # start include: first-state third state # start include: 1 3 # start exclude: fifth-state seventh-state start: uniform # #The actions declarations #------------------------ #the (number/list of) actions for each of the agents on a separate line # actions: # [ %d, ] # [ %d, ] # ... # [ %d, ] actions: StaySilent Betray StaySilent Betray #the (number/list of) observations for each of the agents on a separate line # observations: # [ %d, ] # [ %d, ] # ... # [ %d, ] observations: O_StaySilent O_Betray O_StaySilent O_Betray #Transition probabilities # T: : : : %f #or # T: : : # %f %f ... %f P(s_1'|ja,s) ... P(s_k'|ja,s) #or # T: : this is a |S| x |S| matrix # %f %f ... %f P(s_1'|ja,s_1) ... P(s_k'|ja,s_1) # %f %f ... %f ... # ... ... # %f %f ... %f P(s_1'|ja,s_k) ... P(s_k'|ja,s_k) #or # T: # [ identity, uniform ] T: * : uniform #Observation probabilities # O: : : : %f #or # O: : : # %f %f ... %f P(jo_1|ja,s') ... P(jo_x|ja,s') #or # O: : - a |S|x|JO| matrix # %f %f ... %f P(jo_1|ja,s_1') ... P(jo_x|ja,s_1') # %f %f ... %f ... # ... ... # %f %f ... %f P(jo_1|ja,s_k') ... P(jo_x|ja,s_k') #O: * : #uniform O: StaySilent StaySilent : * : O_StaySilent O_StaySilent : 1.0 O: StaySilent Betray : * : O_StaySilent O_Betray : 1.0 O: Betray StaySilent : * : O_Betray O_StaySilent : 1.0 O: Betray Betray : * : O_Betray O_Betray : 1.0 #The rewards #or # R: : : : # %f %f ... %f #or # R: : : # %f %f ... %f # %f %f ... %f # ... # %f %f ... %f # #Typical problems only use R(s,ja) which is specified by: # R: : : * : * : %f R: StaySilent StaySilent : * : * : * : -1 R: StaySilent Betray : * : * : * : -10 R: Betray StaySilent : * : * : * : 0 R: Betray Betray : * : * : * : -5 madp-0.4/problems/PaxHeaders.5405/dectiger_skewed.dpomdp0000644000000000000000000000007312717644140020142 xustar0029 atime=1463765180.07772035 30 ctime=1463765201.025553043 madp-0.4/problems/dectiger_skewed.dpomdp0000664000372100037210000000755212717644140021003 0ustar00fransfrans00000000000000# This is a Dec-POMDP (.dpomdp) file for the *skewed* Dec-Tiger problem. # skewed meaning that the start distribution is 80%/20% # For more detailed documentation, see test.dpomdp in the parser subdirectory # (src/parser). # Allright, here we go! # #The agents. #---------- #Either 1) the number of agents: # agents: %d #or 2) a list of agent identifiers, e.g.: # agents: agent1_name, name-of-agent2, ... agents: 2 # discount: %f discount: 1 #.0 # values: [ reward, cost ] values: reward # states: [ %d, ] states: tiger-left tiger-right # #Examples of this are: # start: 0.3 0.1 0.0 0.2 0.5 # start: first-state # start: 5 # start: uniform # start include: first-state third state # start include: 1 3 # start exclude: fifth-state seventh-state start: 0.8 0.2 # #The actions declarations #------------------------ #the (number/list of) actions for each of the agents on a separate line # actions: # [ %d, ] # [ %d, ] # ... # [ %d, ] actions: listen open-left open-right listen open-left open-right #the (number/list of) observations for each of the agents on a separate line # observations: # [ %d, ] # [ %d, ] # ... # [ %d, ] observations: hear-left hear-right hear-left hear-right #Transition probabilities # T: : : : %f #or # T: : : # %f %f ... %f P(s_1'|ja,s) ... P(s_k'|ja,s) #or # T: : this is a |S| x |S| matrix # %f %f ... %f P(s_1'|ja,s_1) ... P(s_k'|ja,s_1) # %f %f ... %f ... # ... ... # %f %f ... %f P(s_1'|ja,s_k) ... P(s_k'|ja,s_k) #or # T: # [ identity, uniform ] T: * : uniform #T:open-right open-right : #uniform T: listen listen : identity #Observation probabilities # O: : : : %f #or # O: : : # %f %f ... %f P(jo_1|ja,s') ... P(jo_x|ja,s') #or # O: : - a |S|x|JO| matrix # %f %f ... %f P(jo_1|ja,s_1') ... P(jo_x|ja,s_1') # %f %f ... %f ... # ... ... # %f %f ... %f P(jo_1|ja,s_k') ... P(jo_x|ja,s_k') O: * : uniform O: listen listen : tiger-left : hear-left hear-left : 0.7225 O: listen listen : tiger-left : hear-left hear-right : 0.1275 O: listen listen : tiger-left : hear-right hear-left : 0.1275 O: listen listen : tiger-left : hear-right hear-right : 0.0225 O: listen listen : tiger-right : hear-right hear-right : 0.7225 O: listen listen : tiger-right : hear-left hear-right : 0.1275 O: listen listen : tiger-right : hear-right hear-left : 0.1275 O: listen listen : tiger-right : hear-left hear-left : 0.0225 #The rewards #or # R: : : : # %f %f ... %f #or # R: : : # %f %f ... %f # %f %f ... %f # ... # %f %f ... %f # #Typical problems only use R(s,ja) which is specified by: # R: : : * : * : %f R: listen listen: * : * : * : -2 R: open-left open-left : tiger-left : * : * : -50 R: open-right open-right : tiger-right : * : * : -50 R: open-left open-left : tiger-right : * : * : +20 R: open-right open-right : tiger-left : * : * : 20 R: open-left open-right: tiger-left : * : * : -100 R: open-left open-right: tiger-right : * : * : -100 R: open-right open-left: tiger-left : * : * : -100 R: open-right open-left: tiger-right : * : * : -100 R: open-left listen: tiger-left : * : * : -101 R: listen open-right: tiger-right : * : * : -101 R: listen open-left: tiger-left : * : * : -101 R: open-right listen: tiger-right : * : * : -101 R: listen open-right: tiger-left : * : * : 9 R: listen open-left: tiger-right : * : * : 9 R: open-right listen: tiger-left : * : * : 9 R: open-left listen: tiger-right : * : * : 9 madp-0.4/problems/PaxHeaders.5405/fireFighting_2_4_3.dpomdp.gz0000644000000000000000000000007312717644140020724 xustar0029 atime=1463765180.07772035 30 ctime=1463765201.025553043 madp-0.4/problems/fireFighting_2_4_3.dpomdp.gz0000664000372100037210000202413612717644140021564 0ustar00fransfrans00000000000000 FfireFighting_2_4_3.dpomdp|AW%z,7FcbFE-ڔH6. I^v\8R8ߟ׿7~?=wE?8߾^?=w/{_xBo/o>w镧ߏ|/}xo{|^~x|3^d^o>xȷ=?_W|_<ݏKٓ<}"9#9#H>+J[48 nYQߨo77F}F}QߨoZߨo7M7oZߴ/K/K/K/KKKKKK{#Ȟȑɑi|$Gi|%_W-=ip <ϊF}Q_s7ȈI|$G}Qߨo-< E}Q_s>G>Gsis>GiiϹg7ȈIɑɑ&G|$&_W|%"?Co7>}DFdOR#H>F}g>C,E}Q_3AdD$E>#H/g>C/g=}'Ȟȑɑi|$Gi|%_W--<+F}F}QߨoZߨo7MF}i}MOϾ////}F=I#9#9#H>+J[g{HxF}|^ڈ 2"{"G|$wߨo7>?{8 nY/h}9}9h}Nh}9}N}N}>}Fo #9#9M>#H>M+JE~N[yV7zٓH>#F}Qߨ7Hx/}>oDFdOR#H>/}4~9o} "#')r$Gr$Gr|$G||%_W|ip <ϊF}QߴQߨo77F}F}QߨoZߴi}>sE}Q_Z_E}Q_Z_E}Q_Z_E}Q_Z_Z_Z_Z_Zߺ>"#')r$Gr$Gr|$G||%_W|{ipϳQߨo 2"{"G|$wߨo7>=ip G|#ȞG|$E}Q_->}Fh>}FLgh>}3gh>ϴ}3mg7ȈIɑɑ}QߨoF=奯N[y#Dr$Gr$w_E}Q_G+J{H|PeȈIɑɑ&G|$&_W|%"א-<+F}F}QߨoZߨo7MF}i}M7}Q_E}i}Q_E}i}Q_E}i}Q_E}i}i}i}i}i}>?UAdD$EHHN#H>O+Jo}! N[yV7z}DFdOR#H>F}}48 nY/h}9}9h}Nh}9}N}N}>}DFdORHH4H>#4J+xa8 nYQߨo7}qDFdOR#H>F}! N[yA=I#H>/xaH嬏/=AdD$EHHN#H>O+Jo48 nYQߨo77F}F}QߨoZߨo7M7oZߴϿϾ////}F=I#9#9#H>+J[g{HxF}|^ڈ 2"{"G|$wߨo7>?{8 nY/h}9}9h}Nh}9}N}N}>}Fo #9#9M>#H>M+JE~N[yV7zٓH>#F}Qߨ7Hx/}>oDFdOR#H>/}4~9o} "#')r$Gr$Gr|$G||%_W|ip <ϊF}QߴQߨo77F}F}QߨoZߴi}>sE}Q_Z_E}Q_Z_E}Q_Z_E}Q_Z_Z_Z_Z_Zߺ>"#')r$Gr$Gr|$G||%_W|{ipϳQߨo 2"{"G|$wߨo7>=ip G|#ȞG|$E}Q_->}Fh>}FLgh>}3gh>ϴ}3mg7ȈIɑɑ}QߨoF=奯N[y#Dr$Gr$w_E}Q_G+J{H,>}(AdD$EHHN#H>O+JokHxF}i}Qߨo7o7F}Qߴi}M뛋////u< }oٓ9#9#9M>#H>M+JE~48 nYQߨo7}F=I#H>o7z4g/z}9h9h}9m}9h9m9m9F=I#9#9#H>+J[g{HxF}g7ȈI|$G}QߨoL{Hx/}F|#ȞG|$E}Q_L{Ht}ٓ9#9#9M>#H>M+JEU4gE}QߨoZߨo7MF}i}Qߨo7oZߴi}zE}Q_Z_E}Q_Z_E}Q_Z_E}Q_Z_Z_Z_Z_Zߺ>"#')r$Gr$Gr|$G||%_W|{ipϳQߨoKDFdOR#H>F}|-< E}Q_s>G>Gsis>GiiϹgh>}3gh>3ghi3gϴ}3miLg.o7>HHF}g>/mD=奯N[y 2"{"G|$w_E}Q_3m! N[ 2"{"Gr$Gr$G|$ɧW|%_ɷȿ{@o7MF}i}Qߨo7o7M7oZ_3>}Q_E}Q_E}Q_E}Q_ 2"{"Gr$Gr$G|$ɧW|%_ɷϾ-<+F}>"#')|$GrF}Q_s>C,E}Q_s7ȈI|$G}Q_E}i|ip: 3ghi3gϴ}F3g>}F3miLg>}F|#Ȟȑɑ7F}hoٓX^z4g/z?B$Gr$GrE}Q_>+J}48 n?o~W/>~@.o<׹Y=7nO.W.W.W.W.W.W.W}xpx_\/.]X'0000000000000000000000000{=rq\C.!{=rq\C.!{=rq\C.!{=cO^}7/oy1O?V߿w|W?yx?~/^^?xm?k|[1 D-&o,? >|5 l0;befmgug}h酶^h;zzB%?k>sz^]L.&fr;0?1@ 7k .Th:+{~}W>/4ܷB?޿}goA?޿}pg/m4g/_[KA?_2ޗ׆U +W_ +W_ +ק,(w붧;o /___ B>gA@ D+$,:F6l,_ 7]_W_W_W_W__5_5_k?_k8鲵qϽ?=~< / o?῁o࿁o࿁o࿁o࿁/_ /_ /_ /_ /_ >o ku/~q}~pyk~J~?AZ -,2G}y?߯7?}ߗx_/}?}K< 7¿/77o¿/7{ s _/b}g?x_}?@?/ a( E-76$4%~[͕ѩ4?/ _>_7oop3ooo>?ooop3ooo>?ooo~{{׿/>{>'O?D_ /_пwoF{}#<__/y????????@@DDDDD{O/////ߟ]B_%/ Kq?ߞ%/ K_%/ K_%/ K_%/W+_ Wӿ=︿+_ W+_ W+_ W+_ W+_ W+_ W+_ W+_ W+_qy|ۏ_u'w@~     ?O' B~!E/''''/_ȿ!!!!!###/;ww&7 Mo&7 Mo&7 Mo&7 Mo&7| ;7w]]]]]]]]qy ˿ߏ|ϻ~{>ΛM=o@~  w~{' / [-o [-o [6 mo6 mo6 mo6 mo6 moWT??u/9s'w{8-[J&?|y_qE~_|Λ:78s/q|wq>K~*& / / / / / / / / / ^w/9o o7 owv֯_X~aݯ?eoOO//KKKKK++++++++++g~?M?2"2$߈~# 7&߄~2"2%ߌ~3QwȿBaĻ# z+G>wȿBaĻ##F'^ z[?x;}BaĻ##Nxտ?s=__ߟϧ~ߟϗ~ߟχ~?ۘۘۘۘۘ;;;;;;;;;;ս?zo?O'/_/77O/0 _`/0 _`/07070707070磾|ӷo=OEx>[?>ҏK|η|ͷ|̷|˷jbIM/%51ؿ&TbI%TbI%TbI%TbI%TbI%o|z~^/7ꧯ֯~+_a WX֯~ 뷰~ 뷰~ W:WtwBjw۽}w_뎶;=vOtg۝ngmcv;kYۘƬv6fv0kY;ig`N;kvY;vfv0kkÎ#E~n&r{^꿗W?V{/ѻ}}}}}}ݏp?{w?~ 'g>{ W_p_p}w_p_p_p_p_p_pzw~ op~ wz?pgY/z ^`Y/z ^`X/z֋`X/z֋gX/z ^gY/z ^`Y/z ^`X/z֋`X/z֋gX/z ^gY/z ^`Y/z ^`Xo7z```=덞XoXoXoFzg```ѳYoXoXoXo7z```?6ߏը_Zz|A zoooȟ^@@󧕟?䣗| |BOԛHԛ}MDMSo"&Ro"fz7z7ԛHԛHS/zK^HD%R/K^"}%R/z>HDezK^"OD%R/z٧^"HS/zK^HD%R#b~WnEoaw[ҿoQw=˷Ozc?`?`?u\?z7'w>~@ ];/(w_P:ٿz]v_ewWo````:_}0 q߰aw:?}2qꩯ@}+P_ WUO}+P_ Wz+P_ W@}S_ W@}꫞ W@}+P_W@}+P_@}+P_ W=@}+P_ Wꩯ@}+P_ WUO}+P_ WoԷ@} Է@} Է@} Է@}[[[[=-P-P-P-PooooVO} Է@} Է@} Է@} ԷX9OiQꫯc|oӼ'_ /_7o ??O5]zw?? 'O ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;=^FϾf~@@@@@BBBB?O'/_пA_/7777O?vd|wȿ@/ _ ȿ@/ _ ȿ@/ _ ȿ@/ _ ȿ@/]^czȿȿȿȿȿȿȿȿxl]~?_/ ׿z׿׿B ~B?GMDMDMDMDMDMDMDMDMDM_"ȿD%/K_"ȿD%/K_"ȿD%/K_"ȿD%/K_"ȿD%/Ksz籏ks#zNL/N@[!; }|}ER _x^~A=yw K a^>~{Ro;}_! WȿB+_! WȿB+_! WȿB+_! WȿB+_! Wȿ/FkG-B-B-B-B-B-B-B-g6ߏ77OxKo@@@DD?яۘۘۘۘۘ;;;;;;;;;;w}z_|n'''' ~B  ~AAAAACCCC@@@ _ ȿ@/ _ ȿ@/ _ ȿ@/ _ ȿ@/ _ ȿ@/7777777777qy/w7z????????اObw?|Oߟ/v; ?/7e??o6o6opmmmΗ zw8_Sez~|O;;;?/7wwe??pΗ;;zwww8_So~x~ ?k>?.IyBI>_!uChBZ:ahahahahajajajaj!uHCjRZ::\ZKpi.åu֡u(CiJPZ:aiaiaiaiakakakakhhhh!ē}O>!C<Ox2ēǿ~HlR<Ox2ē! d'C<Ox2ē! d'C<Ox2ē 2$Ԟ2$Ԟց F8'''''''''''''''''''''''''''''2$Ԟ4$Ԟ4$Ԟ4$Ԟ4$Ԟ4$Ԟ2$Ԟ4$Ԟ2$Ԟ2$Ԟ4$Ԟց E'ONLLLLLLLLLL<2"Ԟ2"Ԟ2"Ԟ4"Ԟ2"Ԟ4"Ԟ4"Ԟ4"Ԟ4"Ԟ2"Ԟ2"Ԟ2"Ԟց F8'''''''''2"Ԟ4"Ԟܡ 0  7kA)W$'E=)IQOzRԓuR~źA#gط4w`2 &2 !Cp  BnA#1 3RdE2B  [ZZZo ׁk C2 e0a*TPPPPTTTT9r2dɐ!'CN 9r2dɐ!'CN 9r2dH-qfuANL9r2dɔ)'SNL9r2dɔ)'SNL9r2dɔ)'SNL9r2dɔ)'SNL9r{ XoׄŁ_a(P C2U7p0!ҿkPTKR>Q2|a)R K2leʰdɒ%'KN,9Yrdɒ%'KN,9Yrdɒ%'KN,9Yrdɒ%'KN,9Yrdɒ%'KN,9Yrr%'\rr%'\rr%'\rr%'\rr%'\r8Aɯsq1[ K}zeʠ-C+P  ߁Ggn2-T}?y#zeeI[T}?yye[Nn9䖓[Nn9䖓[Nn9䖓[Nn9䖓[Nn9q)C\-l9rdɖ-'[Nl9rdɖ-'[Nl9rdɖ-'[Nl9rdɖ-'[Nl9r8|_e{a? m0ajChChCjCjG>PPڰaiֆ CP':9ɡNurCP':9ɡNurCP':9ɩNNurST':9ɩN~_~ Qn-!Eb3xk?DX1ڷ RRRR K2,eʰa+VVVVF'7\2q8uqvg8?];yr<9Gxk^?~O^O뽾~/[7%_zW7% 2ß2#2ß2#?A 0TXSsV\?s?s?sɿ8F>s!T$Ą a0vXUÎyPPQQQQQQx2' BP(2' Bar#9E0H$Hc/RJm uԑ-1ZXja6ZjaZjaF Z-ZhjB?:pm???pZZ-8pZh!BP B-ZhaZjaZhaZjaZHh!BT R-Z;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;ncrǖ;ܱ-wlcrǖ;ܱ-wlcrǖ;ܱ-wlcrǖ;ܱ-wlcrǖ;ܱ-wlcrǖ;ܱ-wlcrǖ;ܱ-wlcrǖ;ܱ-wlcrǖ;ܱ-wlcrǖ;ܱ-wlc FxSPPPC" E0a*TDTTT .ERBRRRK",E؈a+VFVVFCt 1DCt 1DCt 1DCt 1DCt 1DCt 1DCt 1DCt 1DCt 1DCt 1D:qCt8D:qCt8D:qCt7K~x3=07l9T~8PT~KkX jXa*38ְQ~8հUV ]g@/qQ~8ЪU~KjC ~~8p28pj5OS B5ja-3paπ^XD cgTT S5ıD kgTCT kg@/q9eS9eS9eS9e9eS9eS9eS9e9eS9eS9eS9e9eS9eS9eS9e9eS9eS9eS9e LYd"SȔE,2e LYd"SȔE,2e LYd"SȔE,2e LYd"SȔE,2e LYd"SȔE,2e LYd"SȔE,2e LYd"SȔE,2e LYd"SȔE,2e LYd"SȔE,2e LYd"SȔE,2e?_{sg=00>/ϝS/G'^"?/qKz!CPB= 0PC= 0PC=L0TS=L0TS=zH!CTR=\Rzå.pK=z(PCRJ=,RK=,RK=lV[=lV[=zhCV=|%,d'K>YɒO|%,d'K>YɒO|%,d'K>YɒO|%,d'K>YɒO|%,d'K>YɒO|%,d'K>YɒO|%,d'K>YɒO|%,d'K>YɒO|%,d'K>YɒO|%,d'K>YɒO.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O.O>]~^z7{&՟UPPPʰa)R [2le)گ C2 e0a*T '8-Nnqr['8-Nnqr['8ŎN2~8f'[lq'[lq'[lq'[lq'[lq'[lq'[lq'[lq'[lqSo^32222 e0a(T S22222\p)å 22222,eXʰa)V [2222428d!N8d!N8d!N8d!N8d!N8d!N8d!N8d!N8d!N8d!NqrC'89!NqrC'89!NqrCroYjYcﾞz}8fXʀNo [z^hmAﻟI}8ex}!1}8eʀO^[2Le'DNRqSqrS'89)NNqrS'89)NNqrSo N2)N8d)N8d)N8d)N8d)N8d)N8d)N8d)N8d)N8Bl/'췁 N:aꄩR'Nt¥J'NX:a鄭Nh8,di'K;YNv,di'K;YNv,di'vri'vri'vri'vri'vri'?=0~{:wa)R K2leʰ!Cχ BBBB2 e0a*T SRRRR-Nnqr['8-Nnqr['8-Nnqr-N8d-N8d-N8d-N8d-N8d-N8d-N8d-N8d-N8d-N8du? hZgD\Xz=ֿ#C_r'\x3yMB=z!CPC= 0PC= 0PS=L0TS=L0TR=zH!CTzå.pK=\RJ=z(PCRK=,RK=,R[=lV[=lVZ=zhCF! d'C>ɐO|2! d'C>ɐO|2! d'C>ɐO|2! d'C>ɐO|2! d'C>ɐO|2! d'C>ɐO|2! d'C>ɐO|2! d'C>ɐO|2! d'C>ɐO|2! d'C>ɐO|2C>9C>9C>9C>9C>9C>9C>9C>9C>9C>9C>9C>9C>9C>9C>9C>9C>9C>9C>9C>9㡋/X }`}[(e(e(e(eXʀc [p=p̰+ 2d?0 C2{a*C*.R)NNqrS'89)NNqrS'89)NNqr)N8d)N8d)N8d)N8d)N8d)N8d)N8d)N8d)N8d)N8dFԆ#? G*^J/QxyjC9CPB=za{RK=,8GzaVxgw{hC'H=8PɒO|z$gԃ|%,d'K>GBN='K>YɒO|z$gԃ|%,d'K>GBN='K>YɒO|z$gԃ|%,d'K>GBN='K>YɒO|z$gԃ|%,d'K>GBN='K>YɒO|z$gԃ|%,d'|R z#SK>K>z$gԃ|r'|r'|r'HO.O.OПS%\%\%#?K>K>롋o=<}!_OkJ/QxCRJ=z(PazXazXazazCVZ=zhaǃBx[C=B=z!CPzazazazaR=zH!CT[>[>[>[>[>[>[>[>[>[>[>[>[>[>[>[>[>[>[>[>ɖO|-ld'[>ɖO|-ld'[>ɖO|-ld'[>ɖO|-ld'[>ɖO|-ld'[>ɖO|-ld'[>ɖO|-ld'[>ɖO|-ld'[>ɖO|-ld'[>ɖO|-ld'>;{20a(P S2Leʐʐʐʐp)å 2\PPPPʰa)R [2le)ѯ d!N8d!N8d!N8d!N8d!N8d!N8d!N8d!N8d!N8) '89!NqrC'89!NqrCo.|8<(|+^32222,ec [{a+C+t~342צ28e3pp22222 e0a(T S22222S'89)NNqrS'89)NNqrS'SLq2'SLq2'SLq2'SLq2'SLq2'SLq2'SLq2'SLq2'SLq2'SLq2'eW}8ϺB ee_qUS z&)C*w?>pp)~?)C)~?)R~q-S J : |28)8Yd%N8Yd%N8Yd%N8Yd%N8Yd%N8Yd%N8Yd%N8Yd%N8Yd%N>.x˰N%N.qrK\'8%N.qrK\'8( mtB鄥N:a _~;}B'N:a脩NH:A;[;[;[;[;ldk'[;Nvldk'[;Nvldk';?^N~y=!tB脡N:a .p NX:a넭Z'4Ndh'C;Nv2 dh'C;Nv2 dh'C;ɡɡɡɡɡ!>%K2222,eXʰa)V [222242E;dx<-=pxkPPPP C2 e0a*TTTTTqrS'89)NNqrS'89)NNqrSdG|eHq d)N8d)N8d)N8d)N8d)N8d)N8d)N8d)N8d)N8yoR]:!t C'L0uB NtB K',u 'v,di'K;YNv,di'K;YNv,N.N.N.N.N.zp>x^ K2qk [5C+C+>Wǿe/]?dx\4׶feeee0lڏ_3Leʀo6URRͦ58-Nnqr['8-Nnqr['8-Nnquo/: d-N8d-N8d-N8d-N8d-N8d-N8d-N8d-N8d-N68?KEڭ<'!!!a(.Vʀc|bRp=p̀Oϥ 8f7a).ͦʀ c|Zp=p̀o6u8eM.'uQ=p N8:cq2I]y3!N{A qRu d8f'CE18.!N{A7y'uQ=p NqRu 'uQ=p NqRu / _O(tԏo6#'M G'N0tm׏oユ'v=S;9S;9S;9S;9S;Nv2Ldj'S;Nv2Ldj'S;Nv2g?{Џk^O:a脡N:!uBK'\:tB鄥N:a J;YNv,di'K;YNv,di'K;YNvri'vri'vri'vri'vri'vAoc`'LJ^Oпݏ`z=Av?>vnLJ^OO>>zz|䓏 Ir[;[nzk'uMon魝-7Irӭ-7Irӭ-7Irӭ-7Irӭ-7Irӭ-7Oy L . &CM 5j2dP&CM59PCMM??C_~gyuY~?ۇX̩8UnTNډS=q'Nũqjhw854N ɟ[B17Bi?/?=>\W+k3Q8 4ؔx-0NmĮ&^ȨӖ7nllnl95w|ߛ6/l^ܼaa aa aa aa aa+tXÊVB;a+tXÊVB;a+tXÊVB;a+tXÊVB;a+tXÊVB;a/KXo; pq`f k&f k&f k&f k&f k&l#a Hf6m&l#a xn6?8\5oߟ߫W7WoGk^`5?;\Ճp߫N> V_j t߫;5~N^X_{jt߫fmvfmvfmvfmvfmvfmvfmvfmvfmvfm6ha lf6ٰ͆m6ha lf6ٰ͆m6ha lf6ٰ͆m6ha lf6ٰ͆m6ha lf6ٰ͆m?ºoT7/_ҿIIIIIG?oҿK#G/! _B/! _B/! _B/! _B/! _B/)K_R/)K_R/)K=9---##pC~H>$OɧK%yo K[𷄿%-o %W_ %W_ %W_ %W_ %W_ ￨??'O|H>%__/ɗ?H%ߒߒߒ??[kᯅZkᯅZkᯅZkᯅZkᯅ𷅿-mo [𷅿{JOy^6zS^~r[4Oyy ,Oyy#G;w#oFoFoFoFoF/~~2O/?2ooC_ ~!/\rB_K~)/\YxuM_2`xPxp80N ' a$l1a [LBń-$l1aVHX1aVHX1aVHX1aVHX1aVHX1aߛMw0?B{p{H{H{r{r{J{J;O2u6>pSmGSV$yEr`чO,.g?onܾ}K;\].J~jӋw-?EmOU]5{S]׵uͮkq]]׵uͮkq]ZNg|6q]]5u-kq]]mvfmqmvvqmS;n붸n6n붸n6n붸n6q9ȍGa\cooqטx 5#11Ń!xJƸǣ11ř#u;BaPw# S7B0u# S7B0u# S7B0u# S7B0u# S7B0uԭ?\d=}yߍϏyY~C,?dOY~S,?edKdKdKd/Y~K_,d^ρ !{ 2#}32#}37#}2#}s2'}s7'}s7'}Qns7 -#X)"Dy001o7 ~@/P} T_; \P}u>/P} T__ %_ %_ %w|?믳~?~}]O~ _x7^x}_|A@ D3٪_l 8y4Vϫ@?џ_/ _/ _/{{?r8?O'A?>oo苾| _W+ _W+ _oooooooooou~{~~S/?obbbbbQۺE=R5݇;`#_}r-6777F~|?^_B~ ?OOOO'D> mo6 mo6 mkkkkkkkkk3׿|y^O؟؟a o _`/0 _`/0 _`70707070707n8废q>:-?oY},za-(///////_B /F7oooooooos:oo?s?@'O?D ՟&o&o&o&o&o&o&o&o&o&/ K_%/n?%/ K|~O K_%/ K_%/ K_%/ K_%/ K_w?_vS_%/ K_%/ K_wn_}^~׿~u?@O?D'''''''''__/_B oF77777777 W+_x??+_x?+_ W+_ W+_ W+_ W+_y??+_ W+_ W+߂-߂-߂-߂-߂wC߂-߂-D=-߂-߂-߂-߂-߂-߂-߂-߂-߂-|/ߗ/y/ F~#E뜿_B~ ?OOOO'D> mo6 mo6 mkvS>_ 5_ 5_ 5_ 5_ 5_ 5_ 5_ 5_W?_C}~@@@@@DDDD~"?O_ȿ!B~!_/////oooo7>_w{?S>________7 ~|o7 ow;)|[u;)|[{HOߺoDOߺ/@n<󿺝vS_Χy??2Ou;)n<域&7 Mo&7 Mo&7 %_ ΧxnK< %_ %_ %_ %_ %_ %_ %_ %_߇???? /ؿ W0+_a W0+_a Woaoaoaoaoa~V븺ڧ[羮quWq5kj>^}V}V}V}V}V}V}V}V}V}V}Vm7>e]{/g?_w|Msz =>>>>>><'9:_H^: 뜾 }Nsz#qf]Y`]uqf]Y`]uqf]Y`]u2_/2$PAjAd{< : KQӰq]uaE\q]uaE\q]uaE\q]uaE\q]uaE\q]uaE\q]ueU\Wq]ueU\Wq]ueU\Wq]ueU\Wq]ueU\Wq];ԯ'ןRq%\s}XH\ԇ#Jnꆩnꆩnꖩ[nꖩ[nꖩ[nꖩ[nꖩ[ +tWW89Gr+rGބ]z:smG w$?[Ia _%}~{s燷o_xu~{燷_x}~{燷x>=< S0 SS0 S0< S0 SS0 S0< S0 SS0 S0< S0 SS0 S0< S0 SS0 S0y-L0y-L0y-L0y-L0y-L0X{dY=|>_n^/77xu~:gx?????O16ۘocm̿16ۘocm̿16k̿k̿k̿k̿k̿k̿k̿k̿k̿k̿k̿k̿k̿k̿k̿k̿k̿k̿k̿k̿>Ͽ}?|d_>zߟO~7~_o~?п@ /п@ /п@ /п@ /п@ o@7п o? __~~'~}oD&7ѿMo%_%_%_%_%_A|'~|g~|O>q]>sZ~W_W_W_W_W_п-o [Bп}}?_Z?+>}ο9>~᝿Nj.>p\|???p?p?p???q?q?qNj'.>qO\|>^|o\ſqo\_Nj.p/\| p p p qqqNj7.qo\||q$8^ /@xq$8^ /@xq$8^ /@xq$8^ /@xq$8^ /@xq$8^ /@xq$8^ /@xq$8^ /@xq$8^ /@xq$8^ /@xHxLx7@x7@x7@xHxLx7@x7@x7@xHxLx7@x7@x7@xHxLx7@x7@x7@xHxLx7@x7@x7@xv㟯~_Gc|>޷/?'?xVݾzu~:g o?7;|&οp/ _8οt___8_8_8_8_8_8_:)&ϯtݝ+]7loooooܖ?oK|W򕺛|87οqo87~?oC{J_nS{׻~|>_?>???xq>88?p_t887|R/g'''''w|>oqw[z8'?qO8?ug7oM 7&߄oM 7ߔg7oM 7&߄oM 7ߔg4|.OoM 7&߄oMz>g7&߄oM 7&߄Soͳg7&߄oM 7&߄So%_%_%_%_%_%__i|8?p:#<.KKKKKz>˳KKKKKKK˳˳KKKKKKK˳˳KKKKKKK˳˳KKKKKKK˳|]>    )s@y      )yy      )O/=~}tp7__y_n殮\?t|?p?p?pC??q?q?q?uy'?qO\S>_qo\uup/\K׿׿p ׿p ׿p ׿t|׿q׿q׿q[o\߸7qu+_JWg+_ Wu+_JWg+_ Wu+_JWg+_ Wu+_JWg+_ Wu+_JWg+_ W   K      K      K>a̻>3oau?{{޾Ş7=U}?{?oq#׻\~sŸO|7;Ϗ%\h@7}zS (4Fw ~K (5`Ѐ,4` XhBЀ,4`K XjR>n{׀Ϗܝ=~h-Nc.w o4`~zS6р[51jV>k|׀ܝY~h}N.w 7h}ԀF /]t9V 7wi ϧ;?7'?vϟO ؟7~zCЀ?7`ޜU  s 4 Ѐ@ 4 Ѐ@ 4 Ѐ[}߀PB 5`0Ѐ 4` h@0Ѐ 4`C jP>u~׀/ݝD.iN ow O4`ZzS&0р{5jT>n~׀ϯݝp04w' H4Oj@|ްׯppNp n8 '7pNp n9-' n8 '7pNp n8 '7r[NppNp n8 '7pNp n9-' n8 '7pNp n8 '7r[NppNp n8 '7pNp n9-'NNNNNN[N[N܀@ 4 Ѐ@ 4 Ѐ@ 4 ЀPB 5NNNNNN[N[NNNNNNNN[NNNNNNN[N[NNNNNNNN[NNNNNNN[N[NNNNNNNN[NNNNNNN[N[NNNNNNNN[N/O~sς-{99_A/9?ߜs ~i[oɽO!;p+VN:DN:DN:DN;D3x׉N|N\y u>/8ubpħ#|^pubO؉+No>.8v r?S'.iN|ZN\]'wϿ;9|^quKG;q1wq]ܟyc'>=S'&;ߝ%>8v:yc#4 8Ż].OԉW|ñfyWx׉]NbW;q1wY:N\,y\g|^p4>؉Oԉmw'~+8ǻN,u:>.8vcyc'>S'N\,]'>ot{qyw;":qO{8vG>/8uj$:qC݉_c'.^7=O3؉; Nɧ=;i(:quw޵/yũ!!!!!!AADN:DN:DN:DN;!!!!!!AsZ z̐ y̐ y̐ y̐ y̐ y̐ y̠ z̠ z̐ y̐ y̐ y̐ y̐ y̐ y̠ z̠ z̐ y̐ y̐ y̐ y̐ y̐ y̠ z̠ z̐ y̐ y̐ y̐ y̐ y̐ y̠ z̠ z̐ y̐ y̐ y̐ y̐ y̐ y̠9Éc=fc .P$BI%J"D0$Jb($Lb0$Jb*$Lb2T$RIH%J"D2x+x+x+7x3R$JI(%QJD1$XJb)$XLb1$Jb+$Lb3V$ZIh%JD+cĘ%,1f1YdcĘ%,1f1YdcĘ%,1f1YdcĘ%,1f1YdcĘ%,1f1YdcĘ%,1f1YdcĘ%,1f1YdcĘ%,1f1YdcĘ%,1f1YdcĘ%,1f1Yd%\b%\b%\bE\d%\b%\b%\bE\d%\b%\b%\bE\d%\b%\b%\bE\d%\b%\b%\bE\du][7:u+wK+_$UJB+_$UL+_KI,%RKI,%b[Iok+ |m%$JB+_$JB+_$B[/$yB[/%yJ"D(P$BI&1PCI %1PI &1>1T%QJD)R$IXJb)$XJb)$Jb+$Jb+$6h%JD+V$I!;Y! NI[pJk!Y)P$BI%J"D0$Jb($Lb0$Jb*$Lb2T$RIH%J"D2 1cN1cN1cN2$cN1cN1cN1cN2$cN1cN1cN1cN2$cN1cN1cN1cN2$cN1cN1cN1cN2$c3Ř)L1f1Sd$c3Ř)L1f1Sd$c3Ř)L1f1Sd$c3Ř)L1f1Sd$c3Ř)L1f1Sd$c3Ř)L1f1Sd$c3Ř)L1f1Sd$c3Ř)L1f1Sd$c3Ř)L1f1Sd$c3Ř)L1f1Sd$cuQYXaύ}xDz-z`~[nM'6!|Cw "ԊP+B"ԊP+B"Ԋ`+"؊`+jP+Z1ԊV bCjP+[1؊V bjT+ZL۴Z1ՊVLbSlHO8blEVZ|۴RH"ՊT+RH"يCvqnEV$[V+j[|VmZoVՊZV+jś>0iVي7[f+J(ԊvݦUjEVZQjEV\s+(؊V,bKXjR+ZԊV,bXlb+[؊VlbsMk[jV+ZՊV\*s+6[يVZjE϶MՊV+ZhՊV+>`iV4[lE%Yr%Yr%Yr%Yr%YrEYtEYtEYtrlEVZjEVZjEV[lEV[!Yr%Yr%Yr%Yr%YrEYtEYtEYt%Yr%Yr%Yr%Yr%YrEYtEYtEYt%Yr%Yr%Yr%Yr%YrEYtEYtEYt%Yr%Yr%Yr%Yr%YrEYtEYtEYt%Yr%Yr%Yr%Yr%YrEYtEYtEYt%Yr%Yr%Yr%Yr%YrEYtEYtEYt%Yr%Yr%Yr%Yr%YrEYtEYtEYt%Yr%Yr%Yr%Yr%YrEYtEYtEYtKnsm.%6\rKnsm.E6\twlEVZjEVZjEV[lEV[!6\rKnsm.%6\tnsm.%6\rKnsm.%6\tnsm.%6\rKnsm.%6\tnsm.uQ7ߗZfR"o>ݷE>o/_X7_ZwUE)R(Q(FRKQ,EbQ,FV[QlEfQlFъE+V(Q4hE_b~!B(KQ엢/F"E(P(QF1PCQ E1`Q F1TSQLE1dQLF"E*T(Q$HF!ܢ-ܢ-ܤMܤ-ܢ-ܢ-ܤMܤ-ܢ-ܢ-ܤMܤ-ܢ-ܢ-ܤMܤ-ܢ-ܢ-ܤMܤmhE-lf6٤mhE-lf6٤mhE-lf6٤mhE-lf6٤mhE-lf6٤mhE-lf6٤mhE-lf6٤mhE-lf6٤mhE-lf6٤mhE-lf6٢+2~‚Gˎ{^} ?|} ҂,-~߿>G>nNW=5VtﻄjEZjEZjEZkEZ bCP-j1TZ b`-k1XZ|ޢ1=ZL&߷Gۼj1Uۄ?\ZLrZ\?btw蓵okSO"U;gnN"U{?\d-wzZ|޼_=jV->o~{$_ZU?\7kf-.7 wf-ެok S/բT{7(o.բTϻ?\b-ܑoPzZ,bKXR-jTZ,bXb-kXZ|>ߡ=Zl) GۼjU,<\ZlZ\Cyw蛵جnk%SoբUGF(onբUχN<\f-</QzZ,gr,gr,gr,gr,gr-gr-gr-grFZjEZjEZkEZk,gr,gr,gr,gr,gr-gr-gr-gr,gr,gr,gr,gr,gr-gr-gr-gr,gr,gr,gr,gr,gr-gr-gr-gr,gr,gr,gr,gr,gr-gr-gr-gr,gr,gr,gr,gr,gr-gr-gr-gr,gr,gr,gr,gr,gr-gr-gr-gr,gr,gr,gr,gr,gr-gr-gr-gr,gr,gr,gr,gr,gr-gr-gr-grY!9d9,CsrYA9h9-srP-B"TP-B"TP-"X`-"X Y!9d9,CsrYA9h9-srY!9d9,CsrYA9h9-srY!9d9,CsrYA9h9-srļ.oOSb>/~Z\$ݑ\uq|^5J̧Mw7=>~Og]ܝEbVy׋ϯ|^pbiwyZ^\-&νX^\-]/O;<81zԋOԋƼ;^|j^\5&νh^\5]/{qј^\<]/>|{yyw$'^1zqO81W{qw>/ԋȼ7oSd>/8"2̋?ES/"i^\Dc/"g^ܝEdVz1/&&Iw>?MC/dɼ<&i2z1&i^̋|^qż̛^S/nN}^Laũ^zE^zE^{EЋ`/2z1ԋOԋ˼;^|^\]&ν^\]]/{qq^\d]/>%v{2yyw$g_)3zqO8"3W{qw>/2ԋͼnf>/8b3􋻼?mS/6i^\lc/6ק_ܝfVz!9;|SswNI9;'}swN)9;|SswNI9;'}swN)9;|SswNI9;'}swN)9;|SswNI9;'}swN)9;|SswNI9;'}swNΔLΔLΔLΔLΤLΤLΤLΤL "ԋP/B"ԋP/B"؋`/"؋`/LΔLΔLΔLΤLΤLΤLΤLΔLΔLΔLΔLΤLΤLΤLΤLΔLΔLΔLΔLΤLΤLΤLΤLΔLΔLΔLΔLΤLΤLΤLΤLΔLΔLΔLΔLΤLΤLΤLΤLΔLΔLΔLΔLΤLΤLΤLΤLΔLΔLΔLΔLΤLΤLΤLΤLΔLΔLΔLΔLΤLΤLΤLΤLEg}BׂSJ_ ~㕾KkM+~yD;E(P,Yfb(,b0,b*,b2,&"E*T,Y$Hf,,,,̢E)R,Y(fQb),Xb1,Xb+,b3,6̢E+V,Y4hfʢĝ%,qg;Y"wĝ%,qg;Y"wĝ%,qg;Y"wĝ%,qg;Y"wĝ%,qg;Y"wĝ%,qg;Y"wĝ%,qg;Y"wĝ%,qg;Y"wĝ%,qg;Y"wĝ%,qg;Y"ws;s;s;s;s;s;s;s;s;s;s;s;s;s;s;s;s;s;s;s;s]q9wY\rqw!\]O/=_~|wY\/qE)R,JY(fQ̢RKY,ebY,fV[YlefYlfE+V,ZY4hf̢~!B, Y엲/e_bE(P,BYf"PCY e1`Y f1TSYLe1dYLf1E*T,RY$Hf"s;s;7s;7s;s;s;7s;7s;s;s;7s;7s;s;s;7s;7s;s;s;7s;7s;[wɝMlrg;[wɝMlrg;[wɝMlrg;[wɝMlrg;[wɝMlrg;[wɝMlrg;[wɝMlrg;[wɝMlrg;[wɝMlrg;[wɝMlrg;rY|/xׂz翛}-{ZO/qXg+E(P,Yfb(,b0,b* k1 k9 {1 }RY_ Y_ Y+YV|ׂc|ׂs|c||;;;W;k),Xb1,Xb+ |k1 |k9 }{1 }sZY_ Y_ Y+Y3ĝ! qg; w3ĝ! qg; w3ĝ! qg; w3ĝ! qg; w3ĝ! qg; w3ĝ! qg; w3ĝ! qg; w3ĝ! qg; w3ĝ! qg; w3ĝ! qg; ws;s;s;s;s;s;s;s;s;s;s;s;s;s;s;s;s;s;s;s;s|b׭n\=ny.ޤ.(biKX.v]l.hx]\}ק:?8".bhC.v1]L".HBsjvN95;f윜SsjvN95;f윜SsjvNٙٙyy.4;#z^q܅fgjv&ggrvfgjv&ggrvfgjv&ggrvfgjv&ggrvfgjv&ggrvfgjv&ggrvfgjv&ggrvfgjv&ggrv~6YZ0`jAj[ J l-h,(%YJd)R$KI,%YJr)ɥ$\Jr)7XM}ZcNӂo/O [̻(J{X=lak[{h{wSఇ {!B{0=LajS{H!R{Мܚ[srkNnɭ95'֜ܚ[srkNnɭ95'֜ܚ[srkNdkNdkNdkNdkNdkNdkNdkNdkNdkNdkNdkNdkNdkNdkNdkNdkNdkNdkNdkNdcNs ~Ww BzWzWz+^WxJPzWXzWz+4^!P'C u2P'C u2P'C u2P'C u2P'C urCP':9ɡNurCi$ @ׂq=@ׂ@ׂ kq=iZpׂB{?= ajׂ1ง4'ԜSsrjNNɩ995'ԜSsrjNNɩ995'Ԝ999999999999999999991?J|EݽEh=0=LajS{Cj=[{xko=PCi=,aiK{X=Ck=diNdiNdiNdiNdiNdiNdiNdiNdiNdiNdiNdiNdiNdiNdiNdiNdiNdiNdiNdiN.ɥ94'Ҝ\KsriN.ɥ94'Ҝ\KsriN.ɥ94'w ZS/A߾B^a^aZxn^a W+ +LBRNnur[V':ɭNnuV'[luV'[luV'[luV'[luV'[lt+|/+^! C0 S0 WH[+^ K [ WhBN:dN:dN:dN:dN:P':9ɡNurCP':y +n_~_>u oWߗPݾ}+LWO/=}WO/}{ST':9ɩNNurSLu2T'SLu2T'SLu2T'SLu2T'SLu2T'SM sX0`jAj[ J l-h,(%YJd)R$KI,%YJr)ɥ$\Jr)mOnsA7AZ߂& _ osx%k.}PWޏ}P߫E)R,Y(fQb),Xb1,Xb+,b3,6̢E+V,Y4hfb~! NY|-8d_k),Ve"E(`,Yb(,b0,b*,b2,&He"E*d,Y$wnqwnq&wnr&wnrwnqwnq&wnr&wnrwnqwnq&wnr&wnrwnqwnq&wnr&wnrwnqwnq&wnr&wnrg;[w6ɝMlrg;[w6ɝMlrg;[w6ɝMlrg;[w6ɝMlrg;[w6ɝMlrg;[w6ɝMlrg;[w6ɝMlrg;[w6ɝMlrg;[w6ɝMlrg;[w6ɝMlqg>oʯa]sk/~nA-'(,#^?oMo~F>`q>riw}LaRxیW ҚjT3&1ٌfL6c͘ld3&1ٌϛ6r>yی=J5#Ռd3H6#ٌd3H6#ٌd3m3.6͸ܦ.V3lƛxo6fٌ7f3lƛAm3.7͸<.R3J(6،b3(6،b3(6،f,5cKXjR3،f,6cXlb3،χY60>orیˍVjV36ٌfl6clf36ٌG6򈑻>osیoj5Ռf3h6ٌf3h6ٌf3Z9А 9А 9А :Р :Р :Р :Р :РzxʩfjFflFflFfl9yɁ^shȁhЁhЁhЁhЁhЁhȁhȁhȁhЁhЁhЁhЁhЁhȁhȁhȁhЁhЁhЁhЁhЁhȁhȁhȁhЁhЁhЁhЁhЁhȁhȁhȁhЁhЁhЁhЁhЁiyɁ^GxhȁhЁhЁhЁhЁhЁhȁhȁhȁhЁhЁhЁhЁhЁhȁhȁhȁhЁhЁhЁhЁhЁ9!:@rtЁ:A:@ttЁ~=ԌP3B5#ԌP36#،`36#،`36Cۼ@/qMKtȁ:A:@ttЁ:A:@rCtȁ:A:@ttЁ:A:@rCtȁ:A:@ttЁ:A:.ﷲ5ﷲ߯T}-=T}5~}~߸~-{Ow_0Ja(Q F1bKa,ba,b[alfalf0Zah F3V0 a˜/1_ c|)b0Ba #F0`Ca 1`a 1`SaL1daL1d0RaH #F2d")"I$I$I")"I$I$I")"I$I$I")"I$I$I")"I$I$IMh@S$$& 4IIMh@S$$& 4IIMh@S$$& 4IIMh@S$$& 4IIMh@S$$& 4IIMh@S$$& 4IIMh@S$$& 4IIMh@S$$& 4IIMh@S$$& 4IIMh@S$$& 4II}% ~P^uI ~n8_os׫__"^o=H˛;}W=_5㊟w U#TP5BU#X`5V#X`5V#X`5P51Tj Vc`51Xj Vcm5>?t{o~^pMoA'1Yˍ͟qd5&q9m5T;jLV>yh='nOV#Y}ޟqFj\['>Yd5>o8[ϯkޞ[ոy{j\ }W;Q)8VXb5.Ow_FKXR5Tj,VcXb5Xj,VcOg76oO~GUGrmج8VcոhVYc7nq7ѪFɆlhɆlhɆmhцmhцmhцmhцmhцmhFjFjFjFjȆlhɆlhɆmhцmhцmhцmhцmhцmhɆlhɆlhɆmhцmhцmhцmhцmhцmhɆlhɆlhɆmhцmhцmhцmhцmhцmhɆlhɆlhɆmhцmhцmhцmhцmhцmhɆlhɆlhɆmhцmhцmhцmhцmhцmhɆlhɆlhɆmhцmhцmhцmhцmhцmhɆlhɆlhɆmhцmhцmhцmhцmhцmhɆlhɆlhɆmhцmhцmhцmhцmhцm ]K6tɆ.EhCm ]6tц.EhCm U#TP5BU#X`5V#X`5V#X`5Ր ]K6tɆ.EhCm ]6tц.EhCm ]K6tɆ.EhCm ]6tц.EhCm ]K6tɆ.EhCm ]6tц.EhCmλj|~?eﷸUvޝIw_dݙ\e>Noq}R_daVqwn\mݙ\qv>8vj;qvVqwݸ>/ԍR7>uS7Lqѝ+ݸ}qѝn\u]7qѝn\|]7>}{yWyw&u%~+ݸ}qn\}]7;<8u"<ۣ Nݸ ϻ3>.|^qUx>؍<8u*/8tc_͙3;nԍ}58uc_ašjS7Lqq+ݸ:}qqn\]7qqn\]7>nv{yWyw&'w%~+ݸJ}qn\]7O;<8ub=yۣ NݸZϻ3>.|^qz>؍<8uj=q}v_aũ[^tˋnyM/E7^tӋnzM/E7[^tˋnyM/E7^tӋnzM/E7[^tˋnyM/E7^tӋnzM/E7[^tˋnyM/E7^tӋnzM/E7[^tˋnyM/E7^tӋnzM/E7myіmyіmzѦmzѦmzѦmzѦmzѦmzѦP7Bu#ԍ`7v#؍`7v#؍`7v# yіmyіmzѦmzѦmzѦmzѦmzѦmzѦmyіmyіmzѦmzѦmzѦmzѦmzѦmzѦmyіmyіmzѦmzѦmzѦmzѦmzѦmzѦmyіmyіmzѦmzѦmzѦmzѦmzѦmzѦmyіmyіmzѦmzѦmzѦmzѦmzѦmzѦmyіmyіmzѦmzѦmzѦmzѦmzѦmzѦmyіmyіmzѦmzѦmzѦmzѦmzѦmzѦmyіmyіmzѦmzѦmzѦmzѦmzѦmzі]?'YS_ ;^{*7M5~?i}zL#F0`4i 1`i 1`iL1diL1diHL#F2d4i[iƛiƛiƛi(QLF1b4i,bi,bilfilfihLF3f4ZiX4ĢA hE,d X4ĢA hE,d X4ĢA hE,d X4ĢA hE,d X4ĢA hE,d X4ĢA hE,d X4ĢA hE,d X4ĢA hE,d X4ĢA hE,d X4ĢA hE,d                S>Ҹ<.#:+>^5~5 Kh4Ji(QLF1b4XJc14XLc14Jc346Lc34ZihLF3f4 iҘ/1_Jc|)R4BiL#F0`4Jc04Lc04ҘJc24&ӘLc24RiHL#F2d4ĢS,:ɢ,:ɢ,:ɢ,:ŢS,:ɢ,:ɢ,:ɢ,:ŢS,:ɢ,:ɢ,:ɢ,:ŢS,:ɢ,:ɢ,:ɢ,:ŢS,:ɢ,:ɢ,:ɢ,b&Y4ɢIMhE,b&Y4ɢIMhE,b&Y4ɢIMhE,b&Y4ɢIMhE,b&Y4ɢIMhE,b&Y4ɢIMhE,b&Y4ɢIMhE,b&Y4ɢIMhE,b&Y4ɢIMhE,b&Y4ɢIMhE,ܑ&FMJz'8}MoJ#F0`4i1Pi 1`i 1FLOѿ'ߩ47w2 L'oϋL}?/~3 ~^]JC}E4yw1 ~^Ri,bi,>/L}oϋ7E߭4yw3 ~^L}7EK,Zb"YȢE-hEK,Zb"YȢE-hEK,Zb"YȢE-hEK,Zb"YȢE-hEK,Zb"YȢE-hEK,Zb"YȢE-hEK,Zb"YȢE-hEK,Zb"YȢE-hEK,Zb"YȢE-hEK,Zb"YȢE-hEXtEYtEYtEYtEXtEYtEYtEYtEXtEYtEYtEYtEXtEYtEYtEYtEXtEYtEYtEYtE'j~f|ZnFWn]J(n6m,nck6Zhn6.Owor}z6Bn#61m ncjۘ6RHn#64E7ݜ[StsnN)5E7ݜ[StsnN)5E7ݜ)ڜ)ڜGDnSXmh6hs6hk6hs6hk6hs6hk6hs6hk6hs6hk6hs6hk6hs6hk6hsws~<ۄ?{x?@W?W?Vjh? ~ .)ԛ{.vQl1@yQlGvQlG=؎b;(cKXlb;۱؎v,cXlb;۱؎v,c[l1Qymclf;6۱َqlf;6۱َV;Zhجۼhَf;hَqlGvav|-8c혗LjԎv|8{š_+N^q8vqjC;VԎP;B#؎`;#؎`;#؎08˱v1Ԏv cl`;1؎v cl`;1ՎvLؽۼ&1َvLcl8clGv$qy m^v$ۑlGv$ۑlq8#َd;+rtҕNIW:J']+ttҕNIW:J']+rtҕNIW:J']+ttҕNIW:J']+rtҕNIW:J']+ttҕNIW:J']+rtҕNIW:J']+ttҕNIW:J']+rtҕNIW:J']+ttҕNIW:J']iʕ\iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]鿇jGvlGvlGvlGvȕ\iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]iʕ\iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]iʕ\iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]iʕ\iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]iʕ\iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]iʕ\iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]iʕ\iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]iʕ\iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]iҕ&]Boλ/[ _' _׿#G0`8q 1`q 1`qL1dqL1dqHƑ#G2d8qǛqǛqǛqǛq(QG1b8q,űbq,ƱbqlűfqlƱfqhьG3f8ZqHE*-RiJTZ"HE*-RiJTZ"HE*-RiJTZ"HE*-RiJTZ"HE*-RiJTZ"HE*-RiJTZ"HE*-RiJTZ"HE*-RiJTZ"HE*-RiJTZ"HE*-RiJTZ".Q".R".R".R".Q".R".R".R".Q".R".R".R".Q".R".R".R".Q".R".R".R"9"v_U+\szx^?s|K+O.?w6|G]w}x?O~\.7N_GdNQF8֣Xb=.7뾭Nw_GKXb=Xz,cXb=Xz,c@NYz\n~{,;݆Yz\nc=6YoqocN߬GN7Ѭ8֣Yf=.Nw߬G&wؗ/C=W/7ڿ;}r]+T}Y>NZqC=w/C=WGzGzGz#X`=1Xz c`=1Xz c`=>+q[Coq[Do?Yd=.=DoCO#Y?qGz\r[D?Yd=dM75ݴtӚnZMkiM75ݴtӚnZMkeM75ݴtӚnZMkiM75ݴtӚnZMkeM75ݴtӚnZMkiM75ݴtӚnZMkeM75ݴtӚnZMkiM75ݴtӚnZMkeM75ݴtӚnZMkiM75ݴtӚnZMkڲMkڴMkڴMkڴMkڴMkڴMkڴMkڴMkڡzGzGzGzGMkڴMkڴMkڴMkڴMkڴMkڴMkڴMkڲMkڴMkڴMkڴMkڴMkڴMkڴMkڴMkڲMkڴMkڴMkڴMkڴMkڴMkڴMkڴMkڲMkڴMkڴMkڴMkڴMkڴMkڴMkڴMkڲMkڴMkڴMkڴMkڴMkڴMkڴMkڴMkڲMkڴMkڴMkڴMkڴMkڴMkڴMkڴMkڲMkڴMkڴMkڴMkڴMkڴMkڴMkڴMkڲMkڴMkڴMkڴMkڴMkڴMkڴMkڴ-kگۏws?+V{=_?Zs^{X|ŝ}~IXX1~y׏`?#؏`?#؏`?#؏`?#؏`?.ZyűW-zw.hÊS?Zq~\aũW-z׏~\s?^oaߞŋ>8E/^ԏ}DZ/zXqՋӿx~\]?._K=}^qUޝy#w_aũW1c?.bԏy#w+ѻ~\u{3؏;GRÊS?fq~\aũW3z׏GNbFWqUwN/jyűW5zw.gܥ~Q~\>ÊS?jgܝE>8F؏}^qՍޝb?.nԏ}DZ7zXqՍc7܏k+ѻs>w.=8*GqEVqw>w/rqŹW;z׏nObGWqwr}];zXqՎ>؏=8jGq}_c?4O4O4O4O4O4O4O4O#؏`?#؏`?#؏`?#؏`?4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O?tПA:O?tПA:OG~G~G~G~?tПA:O?tПA:O?tПA:O?tПA:O?tПA:O?tПA:OՎ}l߳ج'W+~#W>ob<>6G1bMiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiOG>&"7>^ZG<=_7y#G0`-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"tOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOt] uu}]ϭW1}W1}by,汘by,汘f̃_yk3}5W3}5W3}OKyl~tOKyl~t#G0`miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO7>뾂w+~w+~v}ܽKp}>1}LcrGr}$Ǜxso}QGq},cqX>6}4Gs}ipip^pyS!Wyyyyyyyyyyyyyyyytpyz}>8OOx\q<tpy:8O<0O]{q<,?{~Vg}c0dMS8qJ'N)8)q)qJhW鿻&_i~ݮwwqqqyyO}\8yrڧɵk'>O}\8yrt~X8^?|ݿqן߯|q>p\}~~~'~'~'~|y'>qO\}߸7|up/\}~~2'{ {  {  {Qn; -a'MoH-=*uf4=oooooy}̭sZ/z ^sz ^h@z1^h@Z/z1^̭h@Z/z ^̭sZ/z ^sz ^h@z1^h@Z/z1^̭h@Z/z ^̭sZ/z ^sz ^h@z9^hD%Z/z9^έhD%Z/zK^έs%Z/zK^szK^hDz9^hD%Z/zn8ůf3׌/ g|hz|>s' |f~3~[ނf-Xoz [`z [ނl-Xoz{ކ6a=[oz۰߯o|z۰ޞa mXo۰ކ6gmXoz۳6a z۰ކl mXoz{ކ6a/s' |f~3~/࿀g_|fXz;w`z;ށlXzgށw`3[z;ޙw`X;ށwfXz;w`zֻޅl ]Xzwޅ.wa;[zֻޝwa ]X<{a}Ӗ|W<{ϤOs7^?_ç9`?b/_c|c}>9''''''''/_ؿa oؿc7 WB+_ WB+_ WB+_ WB+_ WB+_F5k_F5k_F5k_F5k_F5k_F5k_F5k_F5k_F5k_F5ףK=ƕ//1|O??O o /_ /__"˯|_______ %_ %_/ߴć^)%_ %_ ߟO~>v_/7|=1 C1 D3Yz6S c "!         _____ cϽoa~/{??2"`12"`?k㺲d]B'֧KʪNߏcv{DN̟0 /_1c}_ȿB+_! WȿB+_! WȿB+_! WȿB+_! WȿB+_!           ~Ϳ_*\_~7߸q}_\~'>q}zo߆6 mo 5_ 5_ 5_ 5_ 5_7~6߿p6??}sO??`'?Ob??}ӾOO?_.>~ a/쿰]O?} /a~i _7oc?};^Oo쿱>?xaxa _w _~/xi/ >~?/ _w _~/xi/ >~?/ _w _[[{O >~?ooo77Ͽ/ݭw7仧n?쿰 /쿰 /a _/c7o쿱o쿱ywVެo~yyua``?`'?Ob'b'b ˻kn} K_%/ K_%/ Kw]o|>_]^|>w%/ K_%/ K_%/ K_%/ K_%/ K-w]}>_%/ K_I~?}=_k^O[`~`~`~`O̟?1b~b~b~b~b _/_0a7777y~! WȿB+$wG+_! WȿB+_! WȿB+_! WȿB+B-B-B-B-$wG-B-B-B-B '/W7spZO9~D_a ?sO_oc7DO>~cysyx?a???)??}`?b'?O?)??}O ?smm6o6o6'?x?a o_?s_5'?5 ?5 k_~ k_?s_5'?5 ?5 k_~ k_?s_>_^kyy߯ח>o~}pn``?`'?Ob'b'b/_ a_a_a _/a7oc7c7/ _/ _w}> O?qo _.}i/ _/ _/ _/ _]{_wy>O/ _oooooooo|ܛo.}i>fq?ooooo.}_~u~~'6 mo߆6_ 5_ 5_ 5_ 5_ +p|/8 /_@~ 7߀~ 7~^G5 /_0c<~_v3~_v7?0?0?0?0`'O̟?1?1?1?1?17777777777K_"ȿD%/n>~ȿD%/K_"ȿD%/K_"ȿD%/K_"ȿD%/v3?0|_̟?1b?~^~aWa߿^ Ϸ???ژ1c?Ͽ {|# {|# {|# {|# {|# {|# {|# {|# {|#?G-9~[?s0xa>__~Gn_>p}~ mo߆6 5_ 5_ 5_ 5_ 5_}_}.7߯o|:>U_?1b/a _____0a7oߘߘߘߘ _ ȿ@/|ȿ@/ _ ȿ@/ _ ȿ@/ _ ȿ@/7777wy|.w777w~S>?ڻߧZ?>}4պ|nϿO}??~.߯瓼%u~OϿ߯k?0bϿ??~&'y?GMO>~?<}47x>i>o"||_"||<瓼#.߯K_RIOIOIOIOIOIOIO7?|?\?q׿p /\po\߸W_W_W_W_W_-o [߂-o_>::^]z^z޸W?ߪzq:p8^=p<^=quN\}چk^Gmxm}چ赆赆赆赆赆赆赆赆赆>{mSއo-^t<}L>yyy _^u^^y<}oLߘ}ޘqκ8g] Y笋s.uqκ8g] Y笋s.uqκ8g] Y笋s.uqκ8g] Y笋s.uqκ8g] Y笋s.uuuY7uuuY7uuuY7uuuY7uuuY7uG7up:_p>_qy/xqp<_>qy/O\~v݄ugMn]7yv݄캄캄캄캄캄캄캄캄캄캄^ ί?z88<q8>0|8<_0<00| q>1<1puNB W+$\!puNB W+$\!puNB W+$\!puNB W+$\!puNB W+$\!19n!19n!19n!19n!19n!֏ f[߇Wޚ9}_o5L6cޚ>>q"~kZu}w_}av_}auv/~a}7vo~c}}w}c7v}w_9|y&q8>>y~`yO~b<>O>ϬϬzzzϬϬzzzϬϬzzzϬϬzzzϬϬzzzg35Xz k^g35Xz k^g35Xz k^g35Xz k^g35Xz k^g35Xz k^g35Xz k^g35Xz k^g35Xz k^g35Xz k^z~O}}w_~XQweq?0~`y?1~boo8^ H8^ H?Իnz:Yl?;///_ /7o> {}y@|J:@A ()PR`AXP`AXR`C 6P`C R@C  4h)P`~fx?Y? ?+~^A  (P @@!P`@P`H!&P`B &P`J) $H(P @B)L8L8L8ńSL8L8L8L8ńSL8L8L8L8ńSL8L8L8L8ńSL8L8L8L8ńSL`&0 &L0a SL`&0 &L0a SL`&0 &L0a SL`&0 &L0a SL`&0 &L0a SL`&0 &L0a SL`&0 &L0a SL`&0 &L0a SL`&0 &L0a SL`&0 &L0a SL|7yd?ټ.pnd , B X0L,`bS H, R xa/, (,,,`aK X6 h,B$,$a! IXJB$,$a! IXJB$,$a! IXJB$,$a! IXJB$,$a! IXJ…$\H…$\J…$\H…$\J…$\H…$\J…$\H…$\J…$\H…$\JK_y{{kg }~??o~^_r{7߸Qxe  '9<Lpin>O -O&(`2A%\y4h J&;\DPa?p 8ON&{įm~NH o+|_RsBk>_{_)̟|跮tw8>k[x犠+.}+.+\1!W bCrŐ+\1AW btŠ+.-+\qr&q?GW\ħ]]q\1KKxϗ g8芟㈣+..wHR1>O9R2>O93޹<4󕏷;5>8g8K++^tťs|rtťu|rtťxs}w٥z8ow||qtqiGW\+;W]q)!]q!]qi"\qynGv"z۝l#G]|qtť|NSSTwrťs?GW,(G]q(vqtŵsŦ+.5+.E+.]+.Ϸ.m坞?_%|ӟ}㈣+~6#tO8Z޹Ko#4^#3JR(IQ$EQE)XbI%)XbQE)ؒbK-)ؔbSM)ZRhIђ%ES-)_b~A)_b~IE)BRI"$EPA)bH!)bPA)bJ))bRI)RRHI"%ERI)DS9ES9E9I9ES9ES9E9I9ES9ES9E9I9ES9ES9E9I9ES9ES9E9Imh3E)Lf6mh3E)Lf6mh3E)Lf6mh3E)Lf6mh3E)Lf6mh3E)Lf6mh3E)Lf6mh3E)Lf6mh3E)Lf6mh3E)Lf6+n>[̛?9!Guy_ӈ qw~r7SS?.o FwY![\ 4h-BEag[mMS"h![ bCŐ-l1d![ bŠ-m1h)[LbSŔ-l1e)[LbŤ-&m1i;'lqgEN<8"e-xI[$mq}㔣-H;[\~@ydlqyӈ-^Kag[hmq}#㔣-^ŋ_P}f%[lqy7ӈ-J(~]mQEwT8c>mkyM_\z)G_\z)G_\;_\~}];A[i?G_8Zd;/}q)2|/M/!I7ھ47O8t_z4|q[/qž67xqžqd>O9ReĨRe O#Ye>8?x*A_\{8KwB\%-JZ(iQԢEQKZ,iŒZ,jŢ[ZliŖZljŦ--ZZhiԢES Z/h焓_bI-gi"EHA-ZbH!-bPA-bJ)-bRI-&Hi"EJI-Z$wnqwnq&wnr&wnrwnqwnq&wnr&wnrwnqwnq&wnr&wnrwnqwnq&wnr&wnrwnqwnq&wnr&wnrg;[w6ɝMlrg;[w6ɝMlrg;[w6ɝMlrg;[w6ɝMlrg;[w6ɝMlrg;[w6ɝMlrg;[w6ɝMlrg;[w6ɝMlrg;[w6ɝMlrg;[w6ɝMlq<6F ls߫~c^xj?g|F3<1/;/~pogf?EP {^}ŐCZ i1ŠZ j1ŔSZLi1ŤZLj/~pogf?ER {^}KZKZŋZŋZ(iQҢEQE-Z,iŒKZ,jŢZliŖ[ZljŦZhiҢESM-ZZ3ĝ! qg; w3ĝ! qg; w^}3ĝ!>3g-ȝA<6V qg;Cy}f-Z;w3ĝA rg;w3ĝA rg;w3ĝA rg;w3ĝA rg;yylw[ w3ĝ! qg; ws;s;s;s;s;s;s;s;[-ĝC9ĝgf?s;/;B9ĝCy}f-Z;s;s;s;s;_7Oog]ݐ*J(U,bqZ*6W*Zh˃V138"*bhC\*V1UL"*HB99S99S99S99S99Leg2;ٙTv&3JޮBy}U(;Sٙdv3Lfg*;Sٙdv3Lfg*;Sٙdv3Lfg*;Sٙdvy>\}kߝCCwC/;Pu;иCɓ%O5PZCi KkXZְ5lak 5ZCc k_XZCh 505 ah SkZ֐ZCj 5֠ɩɩɩɩɩɩɩɩɩTNr2Ld*'S9TNr2Ld*'S9TNr2Ld*'S9TNr2Ld*'S9TNr2Ld*'S9| ^ ߻zw/͈n)R"DHA%J )1ĐCJ )1ĠJL)1ĔSJL)1ĤJH)R"DJI%JKJKJKJċJ()QRDIE%J,)ĒKJ,)ĢJl)Ė[Jl)ĦJh)RDKM%ZJĘ%,1f1KYd"cĘ%,1f1KYd"cĘ%,1f1KYd"cĘ%,1f1KYd"cĘ%,1f1KYd"cĘ%,1f1KYd"cĘ%,1f1KYd"cĘ%,1f1KYd"cĘ%,1f1KYd"cĘ%,1f1KYd"c.1c.1c.1c.2"c.1c.1c.1c.2"c.1c.1c.1c.2"c.1c.1c.1c.2"c.1c.1c.1c.2"c^~z +yIw']ݗ/ ]DiEE,-bq[Z"6ZDkEq]"q]"ZDhE1E -bpSZ"&ZDjE$J̭ḼJ̭ḼJ̭ḼJ̭ḼJ̭LVbl%f+1[LoDoļFvLVbl%f+1[LVbl%f+1[LVbl%f+1[LVb|LW>'|wͺ wQO-""1E .bjSZ"RH-""^ZKxi/."J(.biKXZ"El."Zh-" %f01CJPb3 %f01CJPb3 %f01CJPb3 %f01CJPb3 %f01CJPbs(1s(1s(1s(1s(1s(1s(1s(1s(1s(1s\o` >'|o>'| 4?~ NϔFI%-JZ(jQԢŒKZ,iŢZ,jŖ[ZliŦZljEK--ZZ4hjԢ ZO8h>%-旴)G-BZi"EPA-bH!-bPA-bJ)-&bRI-RZHi"ERI-ĝS9ŝS9ɝ9ɝ9ŝS9ŝS9ɝ9ɝ9ŝS9ŝS9ɝ9ɝ9ŝS9ŝS9ɝ9ɝ9ŝS9ŝS9ɝ9ɝܙw3ŝILrg;ܙw3ŝILrg;ܙw3ŝILrg;ܙw3ŝILrg;ܙw3ŝILrg;ܙw3ŝILrg;ܙw3ŝILrg;ܙw3ŝILrg;ܙw3ŝILrg;ܙw3ŝILrg;yyxͷ>'|ek7_񽊻]v*bhC\*V1UL"*HUW*J(*VU,bk[\*Zh*JYbv,fg1;/]$U0;KYbv,fg1;KYbv,fg1;KYbv,fg1;KYbvs);s1;s);s1;U(;O]s);s1;s);s1;s]tBi?9cQZFqee,.cq[\26ZFse3NxqZ2B.#21e .cj˘\2RH.#2))))))))))Jf6Smh3E)Jf6Smh3E)Jf6Smh3E)Jf6Smh3E)Jf6Smh3E[)Z_cpߟE">gxgC?R OCS?eR#FPA5j1Ɛj 1Ơj 1ƔjL1ƤjLR#FRI5j$H////QRFQE5j(ƒj,Ƣj,ƖjlƦjlRFSM5j4hbY4ȢA hE,bY4ȢA hE,bY4ȢA hE,bY4ȢA hE,bY4ȢA hE,bY4ȢA hE,bY4ȢA hE,bY4ȢA hE,bY4ȢA hE,bY4ȢA hE,:ĢC,:Ȣ,:Ȣ,:Ȣ,:ĢC,:Ȣ,:Ȣ,:Ȣ,:ĢC,:Ȣ,:Ȣ,:Ȣ,:ĢC,:Ȣ,:Ȣ,:Ȣ,:ĢC,:Ȣ,:Ȣ,:Ȣ,:~j\@\3.ekQ\Fqe,-cqX\26e\Fse/,c~iK˘_\Fhe\21eL-cr˘\Fje$\Rt2E'St2ERt2E'St2ERt2E'St2ERt2E'St2ERt2E'St2ES)Ld&S4Mh2ES)Ld&S4Mh2ES)Ld&S4Mh2ES)Ld&S4Mh2ES)Ld&S4Mh2E_?'|x?gS:+>Ϧ}Fhȿί{ N|͇)/8y(z9es/S~h?h~kKIw|]'me!gs4+{9#h9._r4GAs cC4Ǡ91hAs c4Ǡ91hAsLR}nS4Ǥ959&1iIs\)GsLc:q/GsLOenqi>=^~8l9q/Gs$͑4ESH#i?`5&wx z}V/?zr6Njxןb=h9.?zr4Njx?Vvkwo>/V8ʻ^~8l9@q/GsQ4gxS(h?5Hw z}>V/?(|r6Ǣ9q^X4Ǣ9.?|r4Ǣ9ͱe-slc4Ǧ96ͱiMslc4Ǧ96󇱷|Qs[AOpǷChiO|r4GMs\~HO?$SZ>8g?g)wۥ}}nNkozi@qi@qm@rtǵsGyy }n N!oz@q@q@rtǵsǢ;.;.;.;q@tǥ}rtǥ}rtǵ}tStSwO9c_[ǽܱ-;gܱ/-;}rtǥsyw۵S۽^j)Gw\j)Gw\kǽqAtǥ}rtǥ}rtǐ;1Aw ctǠ;?tǠ;1Aw\;wLZ):KvmBFv&y&y&q/Gw\;w$qiBqiBݡt+J7ͮt+J7ͮt+J7ͮt+J7ҭt+J7ͮt+J7ͮt+J7ͮt+J7ҭt+J7ͮt+J7ͮt+J7ͮt+J7ҭt+J7ͮt+J7ͮt+J7ͮt+J7ҭt+J7ͮt+J7ͮt+J7ͮt+J7VWJ]i+mvٕͮ6fWJ]i+mvٕͮ6VWJ]i+mvٕͮ6fWJ]i+mvٕͮ6rǐ;1Aw ctǠ;1Aw cPWJ]i+mvٕͮ6fWJ]i+mvٕͮ6VWJ]i+mvٕͮ6fWJ]i+mvٕͮ6VWJ]i+mvٕͮ6fWJ]i+mvٕͮ6VWJ]i+mvٕͮ6fWJ]i+mvٕͮ6VWJ]i+mvٕͮ6fWJ]i+mvٕͮ6VWJ]i+mvٕͮ6fWJ]i+mvٕͮ6VWJ]i+mvٕͮ6fWJ]i+mvٕͮuB}¿y?g~sߏy?g ?glN+A9r#(GP!9cPA9cP)9&嘔cRI9&嘔cRI9r$Hʑ#)GRxQxQxQxQE9r(Q(GQ%9XcQE9XcQ-96ؔcSM96ؔcSM9r4hє)GK4HA* RiJT4HA* RiJT4HA* RiJT4HA* RiJT4HA* RiJT4HA* RiJT4HA* RiJT4HA* RiJT4HA* RiJT4HA* RiJT!*A*A*A*!*A*A*A*!*A*A*A*!*A*A*A*!*A*A*A*qy?JO7/>[>{￱}7ǛJ~)3/y3{)NYJ~= ?glNi9ӿ丼F/;}pE{q}㔣=(?yE{q}㔣=(";{\t-cg>y}㔓=>gpл.h=/yrGA{"O{9#h=/yrGA{ cǠ=1hA{ c?`A{ cǔ=&1iI{LcǤ=&1iI{Lc"w@K#ikE푴Gy^H#ikE푴GjM'[t5lM'[t5lM'[t5lM'[t5jM'[t5lM'[t5lM'[t5lM'[t5jM'[t5lM'[t5lM'[t5lM'[t5jM'[t5lM'[t5lM'[t5lM'[t5jM'[t5lM'[t5lM'[t5lM'[t5M4ٚ&[dklMi5M4ٚ&[dklMi5M4ٚ&[dklMi5M4ٚ&[dklMi5!{ cǠ=1hA{ cǠ=1h4ٚ&[dklMi5M4ٚ&[dklMi5M4ٚ&[dklMi5M4ٚ&[dklMi5M4ٚ&[dklMi5M4ٚ&[dklMi5M4ٚ&[dklMi5M4ٚ&[dklMi5M4ٚ&[dklMi5M4ٚ&[dklMi5M4ٚ&[dklMi5M4ٚ&[dklMi5M4ٚ&[dklMi5M4ٚ&[dklMi5}]K?)^RF']wgqO񺔢Sn4}=#O{Yӿ)7)ͽOV}rVNӠ?oyrǥ}r4򴗣??iqVqǠ?1A cǠ?1A c^wNҋ>O9ҋ>O9ڋ>k/zI\z)G\z)g\;\~];Moqbyy^wH)G\)g\;\u];M_#S4SGrǵNjqqfqji}rjNӢ?yrǥ}r9򴗣??sqjqn}rnNE\:8K7NkֵQ|OfE=z(QԣGQE=XcQE=XcQM=6cSM=6cSM=z4hԣGK%=_cI%=_cQA=z#GPA=cPA=cPI=&cRI=&cRI=z$H#GR&n&n&n&n&n&n&n&n&n&n&n&n&n&n&n&n&n&n&n&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|g{s;#x=1x{L#y=^Nj(ޣx{,chޣuO> 4ӠO> 4ӠO> 4ӠO> 4ӠO> 4AtЧ>O}:At}3>t<3%Q\Gqu,cqX\:6ױu4\Gsu/sa3NqZGpu\:1uLcr\Gru$ב\t2O't2O't2O't2O't2O't2O't2O't2O't2O't2Oyd&4]O}EK'}39cmiO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&.y猿b3{/36y@|<[;=z#GPA=cPA=cPA=&cRI=&cRI=z$H#GRI=^E=^E=^E=^E=z(QԣGQE=XcQE=XcQE=6cSM=6cSM=z4hԣGS-=| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOO:-猿O'K>븛R\Gquױu,cq\:6\Gsuq}:q}u\Gpu cp\:&1u$ב\Gru0O't2O't2O't2O't2O't2O't2O't2O't2O't2O'4i2Oyd&4-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ'꡷^^>܍^>VsQ׼O$Qzy_H~Z9㨇k'?Ǣzzl걩Ǧzl걩GSsQ׼O$Qzy_H~Kz|8D{_g=z#GPA=cPA=cPA=&cRI=&cRI=z$H#GRI=ȧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|z}"M>ɟqԃ|ɧ|ɧ|ɧ|ɧ|ɧM>miO|&6ɧM>miO|&6ɧ'A>miOO$QiOO$Ճ|&^H|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&^H~ɧM>>G=ȧM>miO|&6ɧ >Wi}߿>uƿuM #:\:1uLcrH#:xq/u:(u,cq\:6ױ:h`4< i0Oyco<>:< i0Oy`4< i0Oy`4< i0Oy`4< i0Ot0Ot0Ot0Ot0OO8]t3````C}}Xñy8cñ:[cpO{? sR&NI8'u$O@qRhG'I?_h.t:^O}Oίå>_Kx8]:ӥxi.'7ͣMyrYӬi4s9[Q8δN_O|o{uRN qpyݬng7룛f}v>Yݬng7룛f}v>Yݬng7룛f}v>Yݬng7룛f}v~>w?b~y{z?0~`?0?0?>9?ϟ?~?0```b'柘b'柘?1b'O̟77777777777777777777 K_%/ K_%/ K_%/ K_%/ K_%/ K_%/ K_%/ K_%/ K_%/ K_%/ן⿯' \~'>q} _p}߸~}+_a Wؿ+_a Wؿ+_aoaoaoaoaoan3׿>)ĸ=O)o////_PB7oooosSBssB?P@'OOOOOԇm߆m߆m߆m߆m߆m߆m߆m߆m߆m_5 k_3Tw{S}_5 k_5 k_5 sD?~n^gO?PD/ԿPB /_PF\? _/ _n~}(>/ _/ _/ _ooooooƧoo~?7럟z>PPO ꟟Bp~QQQQ?_^,?꟟.~@#_??QD K_%/ K_%/ K_%/ K_%/ K_%/ ] w.] w.] w.] w.] w.+_ W+_ W+_ W+_ W+_ W[[[[[[[[[[~_~?a_?////_PB7oooos>q?^O?PD5 k_5 k_5 k_5 k_5 k_=sz~~~@Oԟ?Q~~~~_~~~~B oߨQ~~~~/ _/ K^?ԇ/ _/ _/ _ooooooUooo9#?y~8oy|????r>_4a /_a_a_c7ߘc7ߘ1c7oo/zN?߾ޮ??~?0```b'柘b'柘?1b'O̟77777777777777777>;= %/ K_%/ K_%/ K_[%NO>_4?/wz%/ K_%/ K_%/ K_%/ K_% }S%/׍}_7=k0??0`?0?0?1O?1O̟?1b'Oa _0/_0a /̿0 /̿0 /̿1o̿1oߘ1c7+_ W+_ W+_ W+_ W+_ W+_ W+_ W+_ W+_ W+_ W                    /|<׿_/\po\߸߾~'O\k_cؿ5k_cؿ5k_cy>_7|=|^p@@@@ԟ?QDDDDD /ԿPBBBBB /ߨQFFFF>_/ _I^^?Շ/ _/ _/ _oooooo|O77w{S=O /_PF\|\|?PD777777777%/ K_%/>Շ>T%/ K_%/ K_%/ K_wٿ}c\?pO\>q/\_p o\q}>__ؿ+_a Wؿ+_a Wؿ          k_cؿ5k_cؿ5k_cϟ~'p _~7o\ؿ/ _`ؿ/ _`ؿo`o`o`o`o`Oן}nt'<]+O=翿nϏOO\>q=ob&ob&ob&ob&obؿ%/K_bؿ%/K_bؿ%rݟoW~_:uS@]W?u~D/ԿPr//?u/?u7o?u\+_ W+_n|+R+_ W+_ W+_ W[[[[[[履|oooOoϏ{>׵ yPB}^?ߨQ\s}~?P?Oԟ?Q~~~~>o6o6o6o6o6o6o6o6o6o5 k_5 k_5 k_5 k_5 k_x~U??x}_x~ /_@~o@H_~ߏ<\~\?p'O\ؿؿؿؿؿ%/K_bؿ%/K_bؿ%/|>p}~/\_~+_a Wؿ+_a Wؿ[ؿ[ؿ[ؿ[ؿ[ؿ|?׍tՅꅫꍫxuTz:Wǫǫ'Չkkkkk}ܵƮq]kZwk}ܵƮq]kZwk}ܵƮqkϯ~eZ/oy}ǹxx8cy.>Q|xxxu,~_(~x׹xx:_ c}.Q|xxxp 8\.pp 8\.pp 8\.pp 8\.pp 8\.pÍÍ 8܀ÍÍ 8܀ÍÍ 8܀ÍÍ 8܀ÍÍ 8܀+O\t.ί|ʯs s7||||({{q.(((?(?'O(gכp כpyv כp כgכp כpyv כp כgכp כp<^p<^p<^p<^p<^p<^p<^p<^p<^p<^pwA׿bCs@@@q.?P~@y.?Q~D\z׫\z׫\z׫\z׫\z׫\z׫\z׫\z׫\z׫\z[g[p[puv[p[g[p[puv[p[g[p[p||.6׿]}zw<~a /__a_ay7c77o1~c}?y?ys`8?0~```yb'Ɵb''O?1~b3mPmPmPmP>SmPmPmP3mPmPmPmP>SmPmPmP3mPmPmPmP_A} kP_ננ5A} kP_A} kP_ננ5A} kP_A} kP_ננ5A} kP_A} kP_ננ5A} kP_A} kP_ננ5A} 35o_r{??0`?0?0?1O?1O̟?1b'Oa _0/_0a /̿0 /̿0 /̿1o̿1oߘ1c7 _/ _/ _/ _/ _/ _/ _/ _/ _/ _/77777777777777777777׿_I{/\po\߸ϟ\?pO\>q=ob&ob&ob&ob&obؿ%/K_bؿ%/K_bؿ%?y_CܷǍ1?QD_ /_QF}_+_ Wg<Շݞ=TW+_ W+_ W+_       w{ S})$O  <տS?TPPPPB 7oߨQQQQosxocxP?P?P?P?P@'Oԟ?Q?Q?Q?Q?Q k_5 k_wdS}퓱O k_5 k_5 k_5׷/{e~|׷_}>ǿvAзo}RdO (P @Hw} (0 L(0 L(0  $H(P @J8?.)pI=~R@A%J ,(p~'XP`A%PO l([ l)P@C  h(`0& 0a CL`0& 0a CL`0& 0a CLx'& 0a Lb޾2I0a L`0Ą& 0a L`0Ą& 0a L`0Ą& 0a L`0Ą& 0a L`0Ą& 0a L`0ĄL8L8L8CL8ĄL8L8L8CL8ĄL8L8L8CL8ĄL8L8L8CL8ĄL8L8L8CL8ĄL8L8L8CL8ĄL8L8L8CL8ĄL8L8L8CL8ĄL8L8L8CL8ĄL8L8L8CL8ĄL8L8L8SL8ńL8L8L8SL8ńL8L8L8SL8ńL8L8L8SL8ńL8L8L8SL8ńL8L8L8SL8ńL8L8L8SL8ńL8L8L8SL8ńL8L8L8SL8ńL8L8L8SL8ń &L0a L`0ń &L0a L`0ń &L0a L`0ń &L0a L`0ń &L0a L`0ń &L0a L`0ń &L0a L`0ń &L0a L`0ń &L0a L`0ń &L0a L`0ń<k|'[ s_>P{}W'=ﷄ$Hp~' $I $'~`@ $`H &$`B $`J $$HH %AJ R$ % .IpIo}$AA% J$X$X`A% $X`Cw ~`C $ؒ`K 4$hHВ%AC@:,aKtX@:,aKtX@:,aKtX@:,aKtX@:,aKtX@:,aKtX@:,aKtX@:,aKtX@:,aKtX@:,aKtX:\:\:\%:\:\:\:\%:\:\:\:\%:\:\:\:\%:\:\:\:\%:\u>i?izKptxK] $(HP$AI $X`A $X`I 6$ؐ`C $ؒ`K 4$hHВ%ACs`%?g y 9Kt|$H A@! B$`@ $`H! $`B &$`J) $HH !AB) R$nnnnnnnnnnnnnnnnnnnnatؠ6E-:latؠ6E-:latؠ6E-:latؠ6E-:latؠ6E-:latؠ6E-:latؠ6E-:latؠ6E-:latؠ6E-:latؠ6E-:laܿ$2|Lz>vWǷ;|'z|S"\ߟۘGj3~U>?O (=O=>;qC槵IT?PҮIovZ kZy^;ݿy^{uZFNz6p\?Ïǵ(-yZC{ü{^[TOZLZLZLZLZLZLZLZ( 3r޾DǵPJ9_D6y-rSיL9)g( 3rRPJ9C)g( 3rS`L9)g( 3rRPJ9C)g( 3rS`L9)g( 3rRPJ9C)g( 3rS`L9)g( 3rRPJ9C)g( 3rS`L9)B)g( ok~q-rR7>y^ 8S`9rC)P9rC)P9r)`9r)`9rC)P9rC)P9r)`9r)`9rC)P9rC)P9r)`9r)`yZZZZ\ɵ\ɵ\ɵ\ C)P9rC)P9r)`9r)`9r[-|s[i[vkߟZsSQ/sn^C̷>#U~{=N?-|ڋ^Ŗji/n){gO2y/)[罸8=|i/c>TcƘ{1_<=|ǽǘc>^ŗ^r̷;q/?9˜罸o}cu^܂̧h-|d{ڋ/sdyދ{z^܃iO{1oI^8ż%?I-|i/I^8O2q/=|ddN{܋[EO?^ܢ̷;(q/B{(e^ܣ̷>{q2_q܋{:q/nY^ -|-|q/2bh/eyދ{y/Y={q2_=^L^L^L^L^O^L^L^L^̧H-|f{ڋ/sfyދ{z^i{s*;Ωs*;ɼs2;'ɼs2;'Ωs*;Ωs*;ɼs2;'ɼs2;'Ωs*;Ωs*;ɼs2;'ɼs2;'Ωs*;Ωs*;ɼs2;'ɼs2;'Ωs*;Ωs*;ɼs2;'ɼs2;'Tޙ;Syg*L坩3wdޙ;yg2Lɼ3w&Tޙ;Syg*L坩3wdޙ;yg2Lɼ3w&Tޙ;Syg*L坩3wdޙ;yg2Lɼ3w&Μڋڋڋڋ܋ɽ܋ɽ܋ɽ܋ɽPޙ;Syg*L坩3wdޙ;yg2Lɼ3w&Tޙ;Syg*L坩3wdޙ;yg2Lɼ3w&Tޙ;Syg*L坩3wdޙ;yg2Lɼ3w&Tޙ;Syg*L坩3wdޙ;yg2Lɼ3w&Tޙ;Syg*L坩3wdޙ;yg2Lɼ3w&Tޙ;Syg*L坩3wdޙ;yg2Lɼ3w&y<$WSP.]b.b.&Hu"EK]\b(uQE.Xb.bV.](yg;YΒwE,yg;YΒwE,yg;YΒwE,yg;YΒwE,yg;YΒwE\%\E\%\E\%\E\%\E\%\E\'®|7ß6:0ہ;~)9j>>yʿ!C%-JZ(jQԢEQ%-XbIE-XbQ--bKM-6bS--ZZhjԢEK-?b@#-?bP!-BZj"EP!-bHA-bP)-bJI-&bR)-RZHj"ER qwnqwnr&wnr&wnqwnqwnr&wnr&wnqwnqwnr&wnr&wnqwnqwnr&wnr&wnqwnqwnr&wnr&wŝ-lqg;&wŝ-lqg;&wŝ-lqg;&wŝ-lqg;&wŝ-lqg;&wŝ-lqg;&wŝ-lqg;&wŝ-lqg;&wŝ-lqg;&wŝ-lqg;w +s~{߿j[ρ_5MVNZ߿&|"EH!-ZjbH!-bPA-bJ)-bRI-&"EJ)-Z$Hj%-.jqQZ\ԢEI%-Z(jQbI%-XbQE-XbK--bSM-6ԢEK--Z4hj"ĝ! qg; w3ĝ! qg; w3ĝ! qg; w3ĝ! qg; w3ĝ! qg; w3ĝ! qg; w3ĝ! qg; w3ĝ! qg; w3ĝ! qg; w%OZ;o_?_V3ȝC9ĝC9ĝ9ȝ9ȝC9ĝC9ĝ9ȝ9ȝC9ĝC9ĝ9ȝ9ȝ/}ByG-ĝ۷g-ȝy'-ĝ}By}qւ9ȝ_m~çͤ_^O|M.J](vR],vV]lvEV_v{]|N]u"PC] v1TS]Lv1ET.];s;'s;s;'s;s;'s;s;'s;s;'3)Lzg;SޙΤw&3)Lzg;SޙΤw&3)Lzg;SޙΤw&3)Lzg;SޙΤw&3)Lzg;SޙΤw&w^΋y;/y%w^΋y;/y%w^΋y;/y%w^΋y;/y%w^΋y;/y%%,zg;KY΢w%,zg;KY΢w%,zg;KY΢w%,zg;KY΢w%,zg;KY΢ws;s;s;s;s;s;s;s;s;s;sO=}c$ωS(uQE.Xb.bV.]}ס.~ubP.]b.b.&Hu"E ywnzwnywnzwnywnzwnywnzwnywnzwMlzg;[ΦwMlzg;[ΦwMlzg;[ΦwMlzg;[ΦwMlzg;[Ζw?ߒ?t{|z{bu8wƏ..'ޏ]Lu1d.R]$Hvq |s΍S߹{܅sc,u=pB߹1~wn8w?.Z]4huΐw3! yg;ΐw3! yg;ΐw3! yg;ΐw3! yg;ΐw3! yg;9C9蝃9C9蝃9C9蝃9C9蝃9C9蝃yg>>qk?8EI j!)Y r$w3ŝ)Lqg;ܙ$w3ŝ)Lqg;ܙ$w3ŝ)Lqg;ܙ$w>3ŝ)Y rg;oBܙw?iZ3ɝ)Lqg;Sܙ$w&3ɝ)Lqg;Sܙ$w&3ɝ)Lqg;Sܙ$w&3ɝ)Lqg;Sܙ$w&3ɝzS[ťw~O˹*!-BZ'-Z;'NZ i19pbPA-SZLi1ŔZLj1Ť)-RZHi"ER9ps'NZ(i(jQBύ8iŒxnIE-s'NZli9pbSM---ZZhiԢES%,qg;KY"wȝ%,qg;KY"wȝ%,qg;KY"wȝ%,qg;KY"wȝ%,qg;KY"wȝ%,qg;KY"wȝ%,qg;KY"wȝ%,qg;KY"wȝ%,qg;KY"wȝ%,qg;KY"wȝKܹĝKܹĝܹȝܹȝKܹĝKܹĝܹȝܹȝKܹĝKܹĝܹȝܹȝKܹĝKܹĝܹȝܹȝKܹĝKܹĝܹȝܹȝߒ!O'J(bغ-Zhb"x[ bH"y mvnmvnmvnmvnmvlngk;vlngk;vlm=gہr''HP.] u1`]Lu1d]Hu"ť..uq](uQRK],vV[]lvEV.Z]3A zg;CΠw3A z>];y?qBΠw3! zg;CΠw3! zg;CΠw3! zg;s;s;s;s;s;s;oyByc!A=籋?X指ߘHR.],ub]luf]hu'O]tqdĩP.]b.b.&Hu"E ywNzwNywNzwNywNzwNywNzwNywNzw3ILzg;SޙΤw3ILz];>8u!Lyg;ޙΔw&3)Lyg;ޙΔw&3)Lyg;ޙΔw&3靿?y9П@; aSwC;\å;Pu;иCi'K;YNv,di'K;YNv,di'K;YN.N.N.N.N.N?w=\TCRzXazaZ=zhaz?PB=zazazH!COnOnOnOnOnOnOnOnOnO|-ld'[>ɖO|-ld'[>ɖO|-ld'[>ɖO|-ld'[>ɖO|-ld'[>ɆO?>wxs`r==?M5j"PCM 51TSML51DT&M\jRDR&M,5RMl5VMh5jD1Cr̠c3! :f1Cr̠c3! :f1Cr̠c3! :f1Cr̠c3! :f1Cr̠c3! :c9c:c9c:c9c:c9c:c9c:渽/ OyQjDbKM,5b[Ml5f&ZMh51?NM4'&BM5lb&lb&l"DT&S9嘓9S9嘓9S9嘓9S9嘓9S9嘓r̔c3)L9f1r̔c3)L9f1r̔c3)L9f1r̔c3)L9f1r̔c3)L9f1y?SwX~;-Q/%cpߠ/*!)BRI"(EPCR I1$ŐCR J1(ŠSRLI1%ŔSRLJ1)Ť))RRHI")ER$%).IqIR\%)JR(IQ(EQKR,I$ŒKR,J(Ţ[RlI%Ŗ[RlJ)Ŧ-)ZRhIђ)ES%,f6KY"miH%,f6KY"miH%,f6KY"miH%,f6KY"miH%,f6KY"miH%,f6KY"miH%,f6KY"miH%,f6KY"miH%,f6KY"miH%,f6KY"miHKDKDKHHKDKDKHHKDKDKHHKDKDKHHKDKDKHHORÊ. xo{|'Zi{EH!-BZj"ŐCZ i1ŠZ j1ŔSZLi1ŤZLj1EJ)-RZ$Hj"s;s;7s;7s;s;s;7s;7s;s;s;7s;7s;s;s;7s;7s;s;s;7s;7s;[wɝMlrg;[wɝMlrg;[wɝMlrg;[wɝMlrg;[wɝMlrg;[wɝMlrg;[wɝMlrg;[wɝMlrg;[wɝMlrg;[wɝMlrg;?Axk_?[o1t[Lb[$oqoQEKX-6oѺE ngh;v3 ngh;v3 ngh;99999y{Ji?i~O||*REbK],ub[]luf.Z]4huq{TS]a.B]v1P] v1T]Lv"Ed)I)I)I)I)ILyg;ޙΔw3ILyg;ޙs{wޟ3)Lzg;SޙΤw&3)Lzg;SޙΤw&3)Lzg;SޙΤw&.ۯujuc.B]v1P] v1T]Lv"Ed..vQEbK],ub[]luf.Z]4huQΒw%,yg;YΒw蝷g=QTFQE53OGOj,Ƣj,{r}>@zRcSM56TcS-5j4hTFKw?qY?"={'Nj89qR#r}>FzR#FPA5j G\TcPA5TcJ)5&՘TcRI5&՘T#FJI5j$HTC,Ţ,ɢ,ɢ,ɢ[,Ţ,ɢ,ɢ,ɢ[,Ţ,ɢ,ɢ,ɢ[,Ţ,ɢ,ɢ,ɢ[,Ţ,ɢ,ɢ,ɢ-mhE,d&6Yɢ-mhE,d&6Yɢ-mhE,d&6Yɢ-mhE,d&6Yɢ-mhE,d&6Yɢ-mhE,d&6Yɢ-mhE,d&6Yɢ-mhE,d&6Yɢ-mhE,d&6Yɢ-mhE,d&6YŢxWIω5>'j|N88!8!8!88!8!8!88!8!8!88!8!8!88!8!8!88!8!8!88!8!8!88!8!8!88!8!8!8bY4ȢA hE,bY4ȢA hE,bY4ȢA hE,bY4ȢA hE,bY4ȢA hE,bY4ȢA hE,bY4ȢA hE,bY4ȢA hE,bY4ȢA hE,bY4ȢA hE,:ĢC,:Ȣ,:Ȣ,:Ȣ,:ĢC,:Ȣ,:Ȣ,:Ȣ,:ĢC,:Ȣ,:Ȣ,:Ȣ,:ĢC,:Ȣ,:Ȣ,:Ȣ,:ĢC,:Ȣ,:Ȣ,:Ȣ,3;ʓzD\:1>UEo'9~O|{5ߟQ9?QC8Q(GQE9?'r,ʱ(Ǣr,ʱ%*9qcSM96ؔcSM9r4hє)GKxc+M>'Nr8{$A'9~Oɡo58#(GPA9|NcPA9cJI9&嘔cRI9&嘔#%GRI9r$HʑCT:IT:IT:IT:IST:IT:IT:IT:IST:IT:IT:IT:IST:IT:IT:IT:IST:IT:IT:IT:I)*MRiJT$&4I)*MRiJT$&4I)*MRiJT$&4I)*MRiJT$&4I)*MRiJT$&4I)*MRiJT$&4I)*MRiJT$&4I)*MRiJT$&4I)*MRiJT$&4I)*MRiJT$&4Iwr\Xxnpbq7 unD_9Br#(GPA9cPA9cPA9䘔cRI9&嘔cRI9Rr$Hʑ#)GRI9.qQr\(E9Jr(Q(GQE9XcQE9XcQE9ؔcSM96ؔcSM9Zr4hє)GS-9JTZ"HE*-RiJKTZ"HE*-RiJKTZ"HE*-RiJKTZ"HE*-RiJKTZ"HE*-RiJKTZ"HE*-RiJKTZ"HE*-RiJKTZ"HE*-RiJKTZ"HE*-RiJKTZ"HE*-RiJtJtJtJtJtJtJtJtJtJtJtJtJtJtJtJtJtJtJtJtJ_[ϴ'\ķGO+=;Ѯrb~ߗ?: N׷M{|~vFOq'}Cwq=nףw ~zq$i=$}ӏՑF뱸wOz߁h.i=$}ӏ 뱹w~zߑi=qm=q{~߯o{X};=x۷> {{c߲=qZ|봧UOm/;]*l?'9Xv|qOE#Tg܏{*z~RRѷiqOE_;==}q?۴ǢO1Xg;XŢ1Eߦ==}XǢoӞcr?&cr?&cr?&cr?&cr?&cr?&cr?&cr?&>Gr?6`܏ovz܏{0z~܃ѷiqOF~ܓѧ'8-}܏dm~ܓNqOF_q܏{26y?~>lqF_q܏[4O46q?kG8=}li?㞍>l㞍lq??۴g㞍lm~ѧ܏{8܏{8z~܏ovz܏{8z~ѷiqOGtg܏{:z~hѷiqOG_;==}q?۴4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0?܏܏܏܏܏܏܏4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0?Ot0?Ot0?Ot0?Ot0?Ot0?Ot0?Ot0?Ot0?Ot0?Ot0?Ot0?Ot0?11111111Ot0?Ot0?Ot0?Ot0?y>TZ~^\Jb>},b}lf}4hQG}1G`>} 1`}L1d}$H#tO'tO'tO'tO'tO'tO'tO'tO'tO'tO~Ӥ&4I?MiO~Ӥ&4I?MiO~Ӥ&4I?MiO~Ӥ&4I?MiO~Ӥ&4I?MiOux;}Oi>cVY^=}ky*A=z#GPz 1Ǡz 1ǠzL1ǤzL1ǤI=z$H#GRE=.qQz\E=z(QԣGQz,걨Ǣz,걨Ǣzl걩Ǧzl걩ǦM=z4hԣGSE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧNOz?Oz?>_Oz(QԣGQE=zXcQE=XcQE=cSM=6cSM=6hԣGSM=z?cH#=?cH#=#GPA=zcPA=cPA=cRI=&cRI=&H#GRI=z$ n&n&n&n&n&n&n&n&n&n&n&n&n&n&n&n&n&n&n&niO|&6ɧM>miO|&6ɧM>miO|&6ɧM>mI{ ;_ 6?_zOUzO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|o ~҃|zG=ȧ*G=ȧ->ݟov{oP~*~XO}c>c>&#Gd>.q}\Gb>Xc>6c>}4h#A? iO~Ӡ4A? iO~Ӡ4A? iO~Ӡ4A? iO~Ӡ4A? iO~ӠtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'4I?MiO~Ӥ&4I?MiO~Ӥ&4I?MiO~Ӥ&4I?MiO~Ӥ&4I?MiO~Ӥ& vω=ߟ9}c>}1`} 1d}L#Gd>.QGb},b}lf>}4hQӢE?-iO~ZӢE?-iO~ZӢE?-iO~ZӢE?-iO~ZӢE?-iO~觋~觋~觋~觋~觋~觋~觋~觋~觋~觋~n?'*NZC8ه9qCGf>ωS[ww}ı}ރ}N>'}Ng}L1d>}$HA?M?M?M?M?M?M?M?M?M?Ӧ6M?miO~Ӧ6M?miO~Ӧ6M?miO~Ӧ6M?miO~Ӧ6M?miO~Ӿbwk{>'/'ޫqx~e^z#9q#GP={ǠzG=C?81ǤzL1ǤzL#GRI=z$HqQzG=.qQ={GQz>QE=|z,NXcQ={ǦzG=6C8ԣGSM=z4h 4ȧA> iO| 4ȧA> iO| 4ȧA> iO|z I*G=ȧA>QiO|z{ 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| ?4ȧA>QiOtOtOtOtOtOtOtOtOtOtOtOtOOMxԃ|:ȧ|z{A>?Q  UzOtIO8<{iNZ>(QC?8Qԣ{Ǣz'=XC?=qcSM=zl8ԣGSM=z4h1AO?sOC8#{Ǡz'=C=qcRI=&cRI=&#GRI=z$Hԃ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧwr[|:G=&Gq{x{lc{Q=-iqO{Z=-iqO{Z{{{{{'z;v[pSb>}Xc>c>6hG?ÉS>}1`} 1d}L#GdM?M?M?M?M?M?M?M?M?M?miO~Ӧ6M?miO~ޟtt8q~Ӧ6M?miO~Ӧ6M?miO~Ӧ6M?miO/}{9]{[2ǧ*>}1`} 1d}L#Gd>.QGb},b}lf>}4hӠ4A? iO~Ӡ47q(N B;'IqR蟏g#x2=|W|ysX\2o9^2k3Qn#9 JlJ{߲Q[$fq77onnlnlnnnl~X}l~>6>6>66677lks59V{zqj~wx/?Won旇suckCc柀ˏ՟:z/?WW柁Ճ'VAՉS{:mfmfmfmfmfmfmfmfmfmf6kY͚mhf5۬f6kY͚mhf5۬f6kY͚mhf5۬f6kY͚mhf5۬f6kY͚mhf5۬f-|Xԟu!C?JK/鿤%K/ҿK/! _B/! _B/! _B/! _B/! _B!!!!!!!!!!>пˆnS$$$%%ߒov9G!|J>%/Mo S7)M/RK/RK/RK/RK/RK5/)OOɧS/ɗKKK[[-| %W_ %W_ %W_ %W_ %W𷄿%-o K[wۧtm)/߿C|޶{ۻsm!ﶋ攗VS^nYNyymJ9o [𷅿-mo [kᯅZkᯅZkᯅZkᯅZkᯅ_>Y>e=e%[֛C_ y~!/<B_æc^/^W1L^v<?y'=}^Λ@OȏvO=n'rOr[\WdɅEOv]-*>E߇OrwTo/>|jnǚOU뾏=EuŮ+q]]WוuŮ+q]]WוuŮ+q]]WוuŮ+q]]WוuŮ+q]r/P} T_/P} T_@Ż@/P} T_/P} T_@Ż@/P} T__? ?O'_/ 迁迁迁迁;Ə`ߍ777777777777777&_B+/+_ w|oWWB+_ WB+_ WB+_ WB+_ WBV??+_ WB+_ WB+_ WB+q?m?8~`?O'~aOb ~cE&7 Mo߄&7 Mo߄&7 Mo߄&7 Mo߄&7 Mo;\-o [߂-o [߂6m?>OOOO////oooo7~l{Bx~b?????_/ ߆6 mo߆6 mo߆6ῆ/7_ 5_ 5_ 5_ 5_ 5_ 5_ 5_ 5_ 5oq~B~w~?u_q~[%on׿uB_q~[-on׿umO}=m_lnGsW=:q~,_(u?.\ /࿀ /࿀ /࿀ /࿀ /࿀ /࿀ /࿀ /࿀ /࿀;n\|!u-pO/ῄK/ῄK/ῄK/ῄK|_g~uy>?Q#D=%&%c.7:| Hn[^_ߘߘoy҇?|b77777K_bؿ%/K_bؿ%/K_b|_|`~`~`~b~b>10a0___ߘߘoy+_a Wؿ+_a Wؿ+_aoaoaoaoaoa|>j|:|>_/7777F~|>:!?''''D~"6 mo6 mo6_ 5_ 5_ 5_ 5_ 5_ 5_ 5_ 5_ 5_ Ͽ||:~~|b|a~a~a~c~c1/ _`ؿ/ _`ؿ/ؿؿؿؿؿ߯q?>-?o=?~y-(///////_B /F7oooooooosW:vCs:????????@?D'O?????????7777w_vS߄M߄M߄M߄M߄M߄M߄M߄M߄M߄M߄M߄M߄M߄%~gW%/ ߯w_?/ K_%/ K_%/ K_%/ K_%/ K_?WK_%/ K_%/ K_%/ K_w~~׿~?n~u~?@?D'O__________B /_F7o>g Wx+_ W+_ W+_ W+_ W+_ W<?+_ W+_ W+_ W+߂߂-߂-߂A              w_g}|?u;E BBBBBFFFF~#s~s?@~ ?ȟȟȟȟO'|o6 mo6 mo~kkkkkkkkk3u?g~~3u_߯~ ?OOOO'D / BBBBBFFFF~#s~߇z/ / / / / / / / / /~!7 o7 oO~[ϯv?Sowz?LO׿u_)n#=_~ߺO~[v?C>~!?~u~?Wq~u)_y?Wa~5 Mo&7 Mo&7 Mo1o[<'_ %_ %_ %_ %_ %_ %_ %_ %_ %w~Y|8''  | Wؿ+_a Wؿ+_a Wؿoaoaoaoaoay8:iN_zq<<>>}|VYYYYYYYYYYYקEY:~^gE9=HqNHHyNHHsz~/_Hsz uN_}N>98.ά .8.ά .8.ά .8.ά2$P2$P2_/2$P2$P/ u:2$PQ㺎u aVF=ugΰ8Ϻ8Ϻ ̺8Ϻ8Ϻ ̺8Ϻ8Ϻ ̺8Ϻ8Ϻ ̺qu<fY7γn` ̺qu<fY7γn` ̺qu<f_?/yyo/}߾}~>}>8=q~oo?nuܺs&Z7ϭhpq><@ޯ?q<~p_[u><~pχǿޯq>z~8|_WzWzuzWzWWzWzuzWzWWzWzuzWzWWzWzuzWzWWzWzuzWzSoa-LSoa-LSoa-LSoa-LSoa-LO>G|~|~_8po8~7߯?8~8?qO'8~ocm̿16ۘocm̿16ۘocm̿k̿k̿k̿k̿k̿k̿k̿k̿k̿k̿k̿k̿k̿k̿k̿k̿k̿k̿k̿ۗogIwxO _x7޿@ /п@ /п@ /п@ /п@ /п o@7п o|k / xߙz~xOD&7ѿMo_%_%_%_%_%{P7῿/2ݽ|Dw/{?{2oܽw:ܽwBW_W_W_W_W_ [Bп-o [߷~;|޿x}#6o#F~5kȯ_#F~}ίO_޷/_:/q8_|.>px|?p?p?px|?q?q?qy<_|'.>qſſp/\ ſpu:_| _.px| p p px|qqq}>_|߸7.G‹3/@x ^G‹3/@x ^G‹3/@x ^G‹3/@x ^G‹3/@x ^G‹3/@x ^G‹3/@x ^G‹3/@x ^G‹3/@x ^G‹3/@x ^77΄7@x7@x7@x77΄7@x7@x7@x77΄7@x7@x7@x77΄7@x7@x7@x77΄7@x7@x7@x7nGߗs?_5_x~?|.yϪ_?y>?^u/a _/inz߷d'EwIM> K_7Ž&moI_~RwOc7ocyoC{'MM>~yޯ??qy`?`no~- rK|`````hnO߷wM>?????S?_}K&'?Ob'??yoM 7&߄oM 7oM 7&߄oMy&߄oM 7&߄oMy&߄oM 7&߄oMy&߄oM 7&߄oMߛN<ny߲y/ _a߯?}s8}?.KKKKKK<     )gg      )gg      )gg      ){ϿY_ }6+ |z߀_^q?p\C??p?p?p?t|?q?q?qSןO\ן'?up/\ p/\K_/\ _t| ׿p ׿p ׿pK׿׿q׿q׿q׿u}7qo\_g+_ Wu+_JWg+_ Wu+_JWg+_ Wu+_JWg+_ Wu+_JWg+_ Wu+_J      K      K   ?ygFVݾn6n?~~3k~ۋ=7os{z_^~?s (4ЀB (4ЀB (4ЀBJ (5Ԁ5K.w;\ |.,4nO?5` ]_r,5떾w ?Co |_sKx O hFoI|׀\n6x[ ]rf}|Ѐ"]n4р*?ԀF /]_tV }|sϹן~~9;~hs>?7Ĺh@h@h@jms~|&nv@}0Ѐ|ߦןlPu|n'pyM~?xKx O hD~׀n6xS ]vÉ\|ӀON4 р?ԀD a]?yTR 8; '7pNp n8 '7r[Np pNp n8 '7pNp n8-'>; '7pNp n8 '7r[Np pNp n8 '7pNp n8-'>; '7pNp n8 '7r[Np ϱ/~ןן~C_n@ ,84NNNNNN[N[NNNNNNNN[NNNNNNN[N[NNNNNNNN[NNNNNNN[N[NNNNNNNN[NNNNNNN[N[NNNNNNNN[NNNNNNN[NNtςgƂ9Ŀ5,ß, r柭,Ou~S+Dφ]}:qwu>.8v#ԉoԉ|:c'S'NN\c'.f?o7؉ۏ N§s8v>/8uj :qSݎ_/8u :q{ݎ_c'.?½o؉Aۏ˝v NXħs8v#>/8uj:qݎ_\c'.>7o؉Sۏ Nxŧs8v,>/8u:qݎ_c'.N|;N\,~::q1Opķk|^p6u؉o|^q9uF[m;qwq ]ytN|N\]'w|^qBuN[!;q1wq3].ytN|N\]'w|^qKuFW[m&;qqwq[]vy?tN|N\]'w|^qDN:ԉN]p{ N]p{Nԉ}'>+8t y̐ y̐ y̐ y̐ y̐ y̐ z̠ z̠ y̐ y̐ y̐ y̐ y̐ y̐ z̠ z̠ y̐ y̐ y̐ y̐ y̐ y̐ z̠ z̠ y̐ y̐ y̐ y̐ y̐ y̐ z̠ z̠ y̐ y̐ y̐ y̐ y̐ y̐ z̠ z̠ y̐ y̐ y̐ y̐ y̐ y̐ z̠ z̠ y̐ y̐ y̐ y̐ y̐ y̐ z̠ z̠ y̐ y̐ y̐ y̐ y̐ y̐ z̠ z̠ y̐ y̐ y̐ y̐ y̐ y̐ z̠ z̠?{N.8uw:^pS'~:^ ?,a<~ςq?}4>Ῥy\Οy9[QJD)R$JI(&RKI,%RI,&V[Il%VIl&JD+V$ZI4h%1S NI$1AGI&J"D(P$BI&1PCI %1PI &1TSIL%1TIL&J"D*T$RI$H&!Ɯb)Ɯb)ƜbIƜd)Ɯb)Ɯb)ƜbIƜd)Ɯb)Ɯb)ƜbIƜd)Ɯb)Ɯb)ƜbIƜd)Ɯb)Ɯb)ƜbIƜdc3Ř)L1f1dc3Ř)L1f1dc3Ř)L1f1dc3Ř)L1f1dc3Ř)L1f1dc3Ř)L1f1dc3Ř)L1f1dc3Ř)L1f1dc3Ř)L1f1dc3Ř)L1f1ds7I|.ws t:~k'm'wۻ$>+yD(P$BI%L"PCI %1PCI &1TSIL%1TSIL&1D*T$RIH%L"KIKIKIċID)R$JI(%QLRKI,%RKI,&V[Il%V[Il&D+V$ZIh%LD1KYbcĘE,2f1KYbcĘE,2f1KYbcĘE,2f1KYbcĘE,2f1KYbcĘE,2f1KYbcĘE,2f1KYbcĘE,2f1KYbcĘE,2f1KYbcĘE,2f1KYbcĘE,2c.1c.1c.1"c.2c.1c.1c.1"c.2c.1c.1c.1"c.2c.1c.1c.1"c.2c.1c.1c.1"c.2y. |]tw[N[;%R$JI(%QJD1$򵔄Vb[JB+_[Iok+ |m&V[j%V[j&$A$x/8${1P$BI%J"D0$}=1`>JBSI{* }sO&cT>N%cT>N&cn1cn1cn1cn2&cn1cn1cn1cn2&cn1cn1cn1cn2&cn1cn1cn1cn2&cn1cn1cn1cn2&cŘ-l1f1[d&cŘ-l1f1[d&cŘ-l1f1[d&cŘ-l1f1[d&cŘ-l1f1[d&cŘ-l1f1[d&cŘ-l1f1[d&cŘ-l1f1[d&cŘ-l1f1[d&cŘ-l1f1[dc7BoJwuwi>.$:IN"xC'1tC'1xS'1uS'1yHD$'It/ċ'Q:INxK'tK'x['u['yhD$Z'qyI\xw#OB341C381C341C381C341C381C341C381C341C381C341C381C341C381C341C381C341C381/;qyIhbM̡981&shbM̡981&}'[?? ^ |/H~<30>7~gş)R$JI(%QLRKI,%RKI,&V[Il%V[Il&D+V$ZIh%LNև$w>$!$~x/8$!c$BI%J"D0`CI %1PCI %1`SIL%1TSIL%1d$RIH%J"D2db)Ɯb)Ɯb)ƜdIƜb)Ɯb)Ɯb)ƜdIƜb)Ɯb)Ɯb)ƜdIƜb)Ɯb)Ɯb)ƜdIƜb)Ɯb)Ɯb)ƜdIL1f1Sbc3ɘIL1f1Sbc3ɘIL1f1Sbc3ɘIL1f1Sbc3ɘIL1f1Sbc3ɘIL1f1Sbc3ɘIL1f1Sbc3ɘIL1f1Sbc3ɘIL1f1Sbc3ɘIL1f1Sbc3ɘI{w}g ܸ!^H'O.!^XsckO[?Ew 樂ߣZjEVZjEVZjEV[lEV bC~mZCjP+Z1ԊV 08blT+Z1Պgݦ5ՊVLbSjd+Fz:s+&[1يVZjEgM+ՊT+RH"ՊT+>$,έH"يd+^jKxϪMVԊZR+^jKxf=Ź/V؊R+J(ԊR+J(ԊR+J(؊b+(؊V,b0MkKXjR+ZԊV\tV,bjV+Z<۴ZՊVlb[lrOgqnf+6[يV+ZhviZjEVZjE=ŹV4[jGNx/8l+V ԊԊVC+>+U_?ԊS+>+N,͒,͒,͒,͒,͢,͢,͢,͒,͒,͒,͒,͒,͢,͢,͢,͒,͒,͒,͒,͒,͢,͢,͢,͒,͒,͒,͒,͒,͢,͢,͢,͒,͒,͒,͒,͒,͢,͢,͢,͒,͒,͒,͒,͒,͢,͢,͢,͒,͒,͒,͒,͒,͢,͢,͢,͒,͒,͒,͒,͒,͢,͢,͢,͒,͒,͒,͒,͒,͢,͢,͢,GޝZ^pزx/8l:ĩ:ĩ Nx/8၇V|VԊϊC++N8Bnsm.%6\rKnsm.E6\tKnsm.%6\rKnsm.E6\tKnsm.%6\rKnsm.E6\tKnsm.%6\rKnsm.E6\t.o~/E~a`j]V)R(JQ(FQRKQ,ERQ,FV[QlEVQlFE+V(ZQhFьѧ(~]pb (?b0P(BQE"E0(b((b0(b*(&b2T(RQHE"E2 mnmn&mn&mnmnmn&mn&mnmnmn&mn&mnmnmn&mn&mnmnmn&mn&mhE-lf6٤&mhE-lf6٤&mhE-lf6٤&mhE-lf6٤&mhE-lf6٤&mhE-lf6٤&mhE-lf6٤&mhE-lf6٤&mhE-lf6٤&mhE-lf6٤m߇ο˼_NU 6y?s?G dsswcďNnOwwÊv=~ƿG "TP-B"TP-B"X`-"X`-+m-atC}oFybw~+8X Yΐ Yΐ Yΐ Yΐ YΠ ZΠ ZΠ ZΠ Yΐ Yΐ Yΐ Yΐ YΠ ZΠ ZΠ ZΠ Yΐ Yΐ Yΐ Yΐ YΠ ZΠ ZΠ ZΠ Yΐ Yΐ Yΐ Yΐ YΠ ZΠ ZΠ ZΠ Yΐ Yΐ Yΐ Yΐ YΠ ZΠ ZΠ ZΠ Yΐ Yΐ Yΐ Yΐ YΠ ZΠ ZΠ ZΠ Yΐ Yΐ Yΐ Yΐ YΠ ZΠ ZΠ ZΠ Yΐ Yΐ Yΐ Yΐ YΠ ZΠ ZΠ ZΠ Yΐ Yΐ Yΐ Yΐ YΠ ZΠ ZΠ ZΠ?{Z.8wj^pS-~kY+x8BsrY!9d9,CsrZA9h9-CsrY!9d9,CsrZA9h9-CsrY!9d9,CsrZA9h9-CsrY!9d9,CsrZA9h9-"1j] >EbmYwyK~FuWt% wyE<]/Ϻ/8j1N܋|^qb؋<81z{m֘ Nh̻-<.oԋ|:s/.yűWy׋.v1+Nx̻^|8vۿ=S/.nK.Oc>/81N܋|^qcċ]xÊS/."߿Ծoԋȼے3/ Ņ8"2W{qw>n/"Ћ^zԋC/~z^pw^.8B9ԋ^|Vz^qgũy׋P/US/.*nKBV Ņ82W{qUw2+N̻^|>vۿ]S/..nK.Oe>/82N܋|^qe䋻]ÊS/.2oԋ̼ے˳/ Ņ8"3W{qw>n/2ԋͼnf>/8b3􋻼mS/6$ν^\m]/O<8BswN)9;|򝓾swNI9;'}SswN)9;|򝓾swNI9;'}SswN)9;|򝓾swNI9;'}SswN)9;|򝓾swNI9;'}SswN)9;|򝓾swNI9;'}^zԋC/~z^pw^.8B9ԋQ/>+x8 ΔLΔLΔLΔLΤLΤLΤLΤLΔLΔLΔLΔLΤLΤLΤLΤLΔLΔLΔLΔLΤLΤLΤLΤLΔLΔLΔLΔLΤLΤLΤLΤLΔLΔLΔLΔLΤLΤLΤLΤLΔLΔLΔLΔLΤLΤLΤLΤLΔLΔLΔLΔLΤLΤLΤLΤLΔLΔLΔLΔLΤLΤLΤLΤLΔLΔLΔLΔLΤLΤLΤLΤ||oOhz/>|{ K#3#>+fqW(P,BYf"PCY e1`Y f1TSYLe1dYLf1E*T,RY$Hf"KYKYŋYŋYE)R,JY(fQ̢RKY,ebY,fV[YlefYlfE+V,ZY4hf̢E;KYwȝE,rg;KYwȝE,rg;KYwȝE,rg;KYwȝE,rg;KYwȝE,rg;KYwȝE,rg;KYwȝE,rg;KYwȝE,rg;KYwȝE,rg;KYwȝE,rw.qw.q"w.r"w.rw.qw.q"w.r"w.rw.qw.q"w.r"w.rw.qw.q"w.r"w.rw.qw.q"w.r"w.r<'.s2{=~eq}],JY(eQ̢E1bKY,eRY,fb[YleVYlff,ZYhe̢E3VY.8e{!,>+Ye^q"E(P,Yfb(,b0,b*,b2,&"E*T,Y$HfBܹŝ[ܹŝܹɝܹɝ[ܹŝ[ܹŝܹɝܹɝ[ܹŝ[ܹŝܹɝܹɝ[ܹŝ[ܹŝܹɝܹɝ[ܹŝ[ܹŝܹɝܹɝ-lqg;[&w6ɝ-lqg;[&w6ɝ-lqg;[&w6ɝ-lqg;[&w6ɝ-lqg;[&w6ɝ-lqg;[&w6ɝ-lqg;[&w6ɝ-lqg;[&w6ɝ-lqg;[&w6ɝ-lqg;[&w6ŝ+o,x{A=fN#N7f'E(P,Yfb( ^pBg8fϟ,wc;{9 ★>RY,ws;g1 }^p|/8gw~V;o>fQʢE)b,YX|/8fw;?+Yg+ |^pB8fwΟV~{1 |YqB! qg;C w3ȝ! qg;C w3ȝ! qg;C w3ȝ! qg;C w3ȝ! qg;C w3ȝ! qg;C w3ȝ! qg;C w3ȝ! qg;C w3ȝ! qg;C w3ȝ! qg;C w3ȝC9ĝC9ĝ9ȝ9ȝC9ĝC9ĝ9ȝ9ȝC9ĝC9ĝ9ȝ9ȝC9ĝC9ĝ9ȝ9ȝC9ĝC9ĝ9ȝ9ȝ+߷ʻYJY OXOOh}BB u2P'C u2P'C u2P'C u2P'C u2P':9ɡNurCP':9/Ь> ^Yzgy/8C^p OXOOh}BB u2P'C u2P'C u2P'C u2P'C u2P':9ɡNurCP':9n?~]v o%O_`~|ן>a'_//~xu''_/~xu''_ST':9ɩNNurSdN:dN:dN:dN:dN:ןooJÂS R ^ZPZ`kAcA)R$KI,%YJd)RKI.%RKIn{r{? {AML? >{V5?zן >}P_E)R,Y(fQb),Xb1,Xb+,b3,6̢E+V,Y4hfK,9d{!,+NYe^q"E(P,Yfb(,b0,b*,b2,&"E*T,Y$HfBܹŝ[ܹŝܹɝܹɝ[ܹŝ[ܹŝܹɝܹɝ[ܹŝ[ܹŝܹɝܹɝ[ܹŝ[ܹŝܹɝܹɝ[ܹŝ[ܹŝܹɝܹɝ-lqg;[&w6ɝ-lqg;[&w6ɝ-lqg;[&w6ɝ-lqg;[&w6ɝ-lqg;[&w6ɝ-lqg;[&w6ɝ-lqg;[&w6ɝ-lqg;[&w6ɝ-lqg;[&w6ɝ-lqg;[&w6ŝ+yƿ ƿ \ }nA'O,#~dA>>F}yK[Q<CQ<ߍſG 5#ԌP3B5#Ԍ`36#،`36#،`3m3.7Rk͸x.f 5cl`31،f 6cm3.'͸.fL5c͘ld3&1ٌfL6cm3.7͸.T3RH6#ٌd3H6#ٌd3H6#ٌ[6r+oSpیm z/5f،b3^lƋx/6f،R3J(5ԌR3J(6،b3(6،b3(6،&6؄oqی-=ZjR3،f,6cXlb3،Y60orیˍVjV36ٌfl6clf36ٌG6򈑻osیoj5Ռf3h6ٌf3h6ٌf3Zx?dЌS8z/84򘎻~^phc3>+x85ԌϊC3>+{_ p:ʩ<ʱr%zymZr!tAtAtAtAtAr!r!r!tAtAtAtAtAr!r!r!tAtAtAtAtAr!r!r!tAtAtAtAtAr!r!r!tAtAtAtAtAr%zylmZr!tAtAtAtAtAr!r!r!tAtAtAtAtAr!r!r!tAtAtAtAtAr!r!r!tAtAtAtAtA~^ph屰wi.85Ќf|V^qj{ũf|VԌϊC3>+xc3@/OK۴@ttЁ:A:@tCtȁ9!:@ttЁ:A:@tCtȁ9!:@ttЁ:A:@tCtȁ9!:@ttЁ:A:@t8U{߻O nO>+F}qϊ?a,k(Q F1b0a,Ra,balValfah F3f0Za60~˜? c(0˜? #F(P0a c(0 c00 c*0˜ c20&Ø #F*T0a$H C:ES:I:I:IS:ES:I:I:IS:ES:I:I:IS:ES:I:I:IS:ES:I:I:I)Mh@$$& 4I)Mh@$$& 4I)Mh@$$& 4I)Mh@$$& 4I)Mh@$$& 4I)Mh@$$& 4I)Mh@$$& 4I)Mh@$$& 4I)Mh@$$& 4I)Mh@$$& 4I [ry^nyR?7?s￟=#|͇y$♾=wUqşFjFjFjFj}j|Ov翟Tpn{JVc;y?DZnո~On1X[VJ;j|ߔvK._T |ո<՘d5.7GJw?Yj|aTr?/8U[rmj$qyF{VMOV#YV皷;R5.-os_Ƌո+x8U㳂G9UPj|V^qgũ%Z%ZEZEZEZEZEZEZ%Z%ZEZEZEZEZEZEZ%Z%ZEZEZEZEZEZEZ%Z%ZEZEZEZEZEZEZ%Z%ZEZEZEZEZEZEZ%Z%ZEZEZEZEZEZEZ%Z%ZEZEZEZEZEZEZ%Z%ZEZEZEZEZEZEZ%Z%ZEZEZEZEZEZE~PC5~^pS5~YqشϊC5+NQN8TTϊC5+N8UC6tɆ.%dCm ]6tц.EhCm ]K6tɆ.%dCm ]6tц.EhCm ]K6tɆ.%dCm ]6tц.EhCm ]K6tɆ.%dCm ]6tц.EhCm ]";۝ >UvIw_ds=H3}tw'uEvV]7.n|n\mݞq+ݸ8vb;+Nݸλnqn\t]7|ߺyWy'קu%~ѝ+ݸ8v;+Nݸλn\qyXqwuѷ[;qw{r}^]؍|/8u<܎/yűWxn\aũWy׍s;v<+NݸHϻn|v뿥S7nOOK"=WqqEzVqwݸ>n/ԍnz>/8uj=쎻/yűWxn\aũWy׍;vb=+Nݐ[^tˋnzM/E7^tӋnzM/E7[^tˋnzM/E7^tӋnzM/E7[^tˋnzM/E7^tӋnzM/E7[^tˋnzM/E7^tӋnzM/E7[^tˋnzM/E7^tӋnzM/E7h Nx/8tЍn|V8{ũn|V(n|V?{ũn|V!/-/M/M/M/M/M/M/-/-/M/M/M/M/M/M/-/-/M/M/M/M/M/M/-/-/M/M/M/M/M/M/-/-/M/M/M/M/M/M/-/-/M/M/M/M/M/M/-/-/M/M/M/M/M/M/-/-/M/M/M/M/M/M/-/-/M/M/M/M/M/M/{}gYSۿ+>(o揟7׿O>ljL#F0`4i 1`i 1`iL1diL1diHL#F2d4iKiƋiƋiƋi(QLF1b4i,bi,bilfilfihLF3f4ZiX4ĢA hE,d X4ĢA hE,d X4ĢA hE,d X4ĢA hE,d X4ĢA hE,d X4ĢA hE,d X4ĢA hE,d X4ĢA hE,d X4ĢA hE,d X4ĢA hE,d                S>Ҹ<.#:+>^3k3'.1(QJF1b4iXJc)4XLc14Jc+46Lc346hJF3f4iҘ?HQ4+Ni|VҘ?JF(P4iL#PCi 1`i 1TSiL1diL1F*T4i$HL#XtE'YtE'YtE'YtEXtE'YtE'YtE'YtEXtE'YtE'YtE'YtEXtE'YtE'YtE'YtEXtE'YtE'YtE'YtES,b$&Y4ɢIMhES,b$&Y4ɢIMhES,b$&Y4ɢIMhES,b$&Y4ɢIMhES,b$&Y4ɢIMhES,b$&Y4ɢIMhES,b$&Y4ɢIMhES,b$&Y4ɢIMhES,b$&Y4ɢIMhES,b$&Y4ɢIMhE_ߨy{om i]{om i>om iޥYq[+F(`4iLc( 5FL ѿ_io47d+FJѿiod4}׋iE_/Ji(QLF1b4E_i4}bk+ }_/L}mZif諙/jXĢE-hE,Zd"XĢE-hE,Zd"XĢE-hE,Zd"XĢE-hE,Zd"XĢE-hE,Zd"XĢE-hE,Zd"XĢE-hE,Zd"XĢE-hE,Zd"XĢE-hE,Zd"XĢE-hE,Zd".."."."..".".".."."."..".".".."."."o|fKyZnş}^4R:iOxKxx[yyhF4Zqyi\}wӫWO#tF4Nc4Oc4Nc4&Oc4R]8ov|V^qjgšv|VЎ"6ԎϊC;+N8#ԎP;#؎`;#؎`;#؎`;cCl1sy cl`;1؎؎v cSjd;.ݻkld;&1َv\xvLcH#Վd;.!+َd;H#َd;>+x8ov|`vطQ;>+x8Ҕ+MҤ+MҤ+MҤ+MҤ+MҤ+MҤ+MҤ+MҔ+MҤ+MҤ+MҤ+MҤ+MҤ+MҤ+MҤ+MҔ+MҤ+MҤ+MҤ+MҤ+MҤ+MҤ+MҤ+MҔ+MҤ+MҤ+MҤ+MҤ+MҤ+MҤ+MҤ+MҔ+MҤ+MҤ+MҤ+MҤ+MҤ+MҤ+MҤ+MҔ+MҤ+MҤ+MҤ+MҤ+MҤ+MҤ+MҤ+MҔ+MҤ+MҤ+MҤ+MҤ+MҤ+MҤ+MҤ+MҔ+MҤ+MҤ+MҤ+MҤ+MҤ+MҤ+MҤ+MҔ+MҤ+MҤ+MҤ+MҤ+MҤ+MҤ+MҤ+}Ϳ繵繵nWٖnW 3D{ş8~ #G0`8qc08c08㘊c28&㘌c28&Hő#G2d8q$x)x1x1x1(QG1b8qXc18Xc18؊c386،c386hьG3f8q(QiJTZ"HE*-QiJTZ"HE*-QiJTZ"HE*-QiJTZ"HE*-QiJTZ"HE*-QiJTZ"HE*-QiJTZ"HE*-QiJTZ"HE*-QiJTZ"HE*-QiJTZ"HE*]E*]E*]E*]E*]E*]E*]E*]E*]E*]E*]E*]E*]E*]E*]E*]E*]E*]E*]E*]E*]sZ[8箄??3gl"}͇yxU|>׵/ӟQJ(֣Xb=(֣Xb=(֣Xb=(֣Xb=}[˷n75v[.v }yc=hrz\tzS=O?PϊC=+N8YqظS=+NQN8cz|VYqGzGzGzGzcnqycG1n硷c9<DZc=&1Y32nq}OcڸGun'둬qGz\r[D6?Yd=dM75ݴtӚnZMkiM75ݴtӚnZMkeM75ݴtӚnZMkiM75ݴtӚnZMkeM75ݴtӚnZMkiM75ݴtӚnZMkeM75ݴtӚnZMkiM75ݴtӚnZMkeM75ݴtӚnZMkiM75ݴtӚnZMk?c=>+8TϊC{8T TϊC=Gx8PϊS=dMִiMִiMִiMִiMִiMִiMִiMִeMִiMִiMִiMִiMִiMִiMִiMִeMִiMִiMִiMִiMִiMִiMִiMִeMִiMִiMִiMִiMִiMִiMִiMִeMִiMִiMִiMִiMִiMִiMִiMִeMִiMִiMִiMִiMִiMִiMִiMִeMִiMִiMִiMִiMִiMִiMִiMִeMִiMִiMִiMִiMִiMִiMִiMִeMִiMִiMִiMִiMִiMִiMִiM[ִ~.o?{vϊ9M?>+g}gş??QtmVIbc{_ͻ~\]?X~\ݾq~\yq~\]?X~\]?.?:}^qUY#w_aũW-x~\aũW-z׏FvEWqw v/^yűW/z/קܥ~~\yq~\]?O}\qUݿ~\ݾ\7rEVqqEVqw>on/bqŹW3z׏ݣnwbFWq5wr}]3zXqՌ>DZ3zXqՌđݿ~\]?~\ݾqQ~\yqQ~\]?~\]?.}^qՍ#w_aũW7x~\aũW7z׏SGvFWqwpv/ryűW9z/ܥ~~\yq~\]?}\qՎrݿ~\ݾ\yn/vqű~|VYq{ũ~|VR8ЏS?+N_pߏϊC?>+]qiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПiПЏϊC?+Nx8{ũ~W^qgԏS?>+8wŹtПA:O?tПA:O?tПA:O?tПA:O?tПA:O?tПA:O?tПA:O?tПA:O?W;c>+s>ȫϊ?~L?ob>6<}lVbMiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧ7<>+>q{(\{(\{{ >~{ >~Y'ӻ-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOPwyz_kLqܺO.}(Q̣G1bmiO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6j[Zw[LWwwG G<<<<<y<;i+yyyyyyyyyyyyyyyyyy'ܝ!wG>q<8O<tpy:8O<tpqqxm^kkuxm^ۇt`N)8epNS>q (N SB؝SB8%{K?apﯞ}j_·?=:G|u<:yG#|>Gxߛ|?#nt}#q>rr|a8y 63lg<ϰya8y 63lg<ϰya8y {}Mϋ?o7q~Cx3<_~>tCC/?x?/?:·C ~|y<A=χ z|<8y4il>O}f8y4il>O}f8y4iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii_Y-,f__[Y/,fK3C||/<oo_ÿ 5k_ÿ 5k_ÿ >?Q_ ?7?O oO7߄M7߄M7߄M7߄M7߄-߂ -߂ -ߵq^F/1q^k?/ﵻq^ 8~wmѼxUߵR^<m߆m߆mw߁w߁w߁w߁w߁Տ? '7`~ /_0`~ +̯0 d__/Wx ̀/K%x!^%x<7x ނc….R`_(2&P-p"P(ԁ0v͇[ n:2_™(ԁ nN 'sÉ2_™(Lp&xK8% "P™-LpQv6n Q 1i~VȕT ,d]K.;K.;K.;K׉*_37?_i>x^?ǽ@T~ܫ~~ޫ'~'>D'OTuu___׽B /T_~ݫ__~_~߫7ߨ~7ߨF7oTzuw\z+^z{T=\8)=\z+^]';=\z׫ Wp\z׫ Wp\z׫ Wp\z׫ Wp\z׫}Spxp\zuw^ Wp\zuw^ Wp\zzz z z zz@T=\8)=\o\o>BzqSzނ-ނ뭻뭻-ނ-ނ-ނ뭻뭻-ނ-ނ-ނ뭿e; cʪ߶/l/l7߶?}q>}`l?ߟ~~bomwmPozwmPozwmPozwmPozwmPoz;kPASA;kPASA;kPASA;kPASA;kPASAN???EOu?/|~{{W^?(?P~@ǽ((˟('ʟ(^~D'O(u/_(_(_(^~B /_(_(_(7(7(7o(Q~F}/?/`} X_n}`}`} X_n}`}`} X_n} X_//`} X_n} X_//`} X_n}`}`} X_n} X_//`} X_ooooܭ}~?}^B /_P__7ߨ7ߨF7oߨQ_<_<_׽u@?P'꟨'꟨D'Oԟ?Q~߄M߄M߄M߄M߄M߄M߄M߄MB|KO777777777%/ K_bO Ǟ%x!S>´|%/ K_%/ K_%/ K_%/ K_%/ ;^hw)/ K_%/ K_%/ Kyz@^zd~1o??O?b// /쿰 /쿱oؿc__wm + + + + + + + +-o ;p?-o [-o [?]?]a /쿰 o쿱7oؿ _?``'b'6 mo6 mo6 5_ 5wPi}kkkkkkkk_OH}<z?`$/O7>^og }~0//t>^쿰oy4Oy2_o_|y /HH/_______7<~7 ow<>>_>7>ϗ>|x>?O|~'>%/1K_b󗘿%/1K_b󗘿%/1~{}/Ͼ/Ͽ<˵7uo< y]7 uoؼוpu'\pՕpu'\pՕpu'\pՕpu'\pՕpu'\pՕpu'\pՕpu'\pՕpu'\pՕpu'\pՕpu'\p­+֝p [ ܺn @­+֝p [ ܺn @­+֝p [ ܿ_{ tx~_~ݫ?^T}ܫ{T>PW?T?P@T?PW?OT?QDOT?Q}ޫ{'OT>Q6\o6\o6\o6\o6\o6\o?T;:w/6\o6\o6\o6\o6\o6\oz}w5\z k^zoJ;Hz}w?5\z p5\z p5\z p5\z p5\z p5\z p5\z p5\z}w2ߗc?c+l~ܷ~`}'>'Olu_}a}_~߷~c}c}> P/@N P/ P/@N P/ P/@N P/ P/@N P/ P/@N Poܩ7@ Poܩ7@ Poܩ7@ Poܩ7@ Poܩ7@ Poſ:}?u/}//}/}PkԽB /_(PPB /PB {oQFoQ~o(Q~F^Cwu/xCu/x_?!T~(?P~@{?P@?P?QDO?QDD'O(?Q&o&o&o&oޭo&o&o&oΗ>ă/};^a}n}7a}7a}7a}77a}7a}7a}7a}y%/a} KX_֗w;_w8)xqʇ>ă};a}y%/a} KX_֗wKX_֗%/a}y%/a} KX_֗wKX_֗%/a}y`}+cW~|X_ޭ/a} KX_֗֗%/a} KXк/u~_BBBڧ?P@'꟨'꟨'Oԟ?QD____ /_PB__7ߨ7ߨ7oߨQF}+_ W z?/[/ ;_(wpo W+_ W+_ W+_ W+_ w!|C>+_ W+_ W[[[[[[[[[[[[[[[[[[[[;OȺu>{Lc?\_By_c ^_o!8~~8??t4ʏ/'ueo6 mo6 mo_ 5y݇kkkkkkkk󯾎__O??`?O?'O//_ؿa /쿰o쿱7__________7 o7 owC:Αx?APO //>^쿱:2xcϿu%Àq`8Wy2_O_|~&7 Mo&7 Mo&_ %wK?w+e/K/K/K/K/K/K/K/;v?|~O|Ͽ _7>0+_a W0+_a W0[[[[[ˇ1@ J ,,[ 4h,D/ zY @hX`j0[1[1[1[1[ؘ$6&5IlMbc[ؘ$6&5IlMbc[ؘ$6&1xGO~c~} 'Gg~nxaүg /= Ѓ@B= ԃPz0Ѓ `C=P&z0уL`S=T=H уDR=H ՃT^ =x/ԃzR =(ЃBJ=(ԃRzЃ,`K=XR6zуl`[=V=hуFZ=hՃFĀ'<1!O ybx)"xybKXĂ'<O,ybKXĂ'<O,ybKXĂ'<O,ybKXĂ'<O,ybKXĂ'D|<|%CĒ'<O,xb XĒ'<O,xb XĒ'< KK x"x&y'.y'.x'.x'.y'.y'.x'.x'.y'.y'# ƳSW]$8&1qL`8&1qo?%4O SBBRR ,%H`+VFFVFuOp!B  %J0`"T`8 &N0qSL`8 &N0qSL`8LL11?%SLL01SLL01SLL01SLL01SLL01SLL01SLL01SLL01SLOt`*~v>pt @?;'(}~IR>O|-%ϳ{>]$J''|~IJ'X`b%&|~I &X`b%&X`b%&X`b%&X`b%&X`b%&X`b%&X`b%&X`b%&&.1q _KL\`&.0qKL\`g|@iX`kGi8s}Z @hX`j0[1[1[1[1[ؘ$6&5IlMbc[ؘ$6&5IlMbc[ؘ$6&1ﷁ|؛]~έ  B B  $J0`"DS   R R ^HB`!BK 6l$J CL 11CL 11CL 11CL 11CL 11CL 11CL 11CL 11CL 11CL 1qLb8!&1qLb8!&1qLb_M_pT!>^m  ?~ϗ#~H_|AzPAzЃ,`K=XRzуl`[=VzA4zA4z=8^Ѓu  ~AzAz@z0Ѓ `C=D&z0уL`S=A$zAz1E(E(E0E0P)SLJ1b2E*E*E2E2K)^JbSRRSS,XJb1V)6SRR4SRYbgEvYbgEvYbgEvYbgEvYbgEvYbgEvYbgEvYbgEvYbgEvYbgEv.s\d;عEv.s\d;عEv.s\dqc ~vqc ~Nvb)~f?qKB?'t]hY;.)cRl3&)J)J)))R,XLb+V)Z)Z))Z)R/_J""""b(P)RLL1""""Bb&;7ٹ-vns[b&;7ٹ-vns[b&;7bgMv6bgMv6bgMv6bgMv6bgMv6bgMv6bgMv6bgMv6bgMv6bgMv9Ro OCisI&yiI&yiI&yiI&yiI&yiI&yiI&yiI&y~\#kLgz+7tsN7tsN7tsN7tsN7tsNsڜ699misNsڜ699misNsڜ朶uay5k 1k$H/Q\klFs9 ipNs489 ipNs489 ipNs:8s:8s:8s:8s:8sz~q :-t{\Co=_7Þ1-]kO_緲אoT=!?}߆z\C~SSSSSJ)ly%'s#[^9-ЖWrNyj+9<啜SJ)ny%'6Ig;&H;ؼuGŞ{ZiŞ{ZiŞ.t=]bO_<_=_kX\cq56hZci5k\cp5&H\s9s9s9s9s99misNsڜ699misNsڜ699misN[sZ_:es;wz|k```9s )#uC&yJc2R99lB' <)#uEC&yZc2Ry9lB'uFp5 C;k脡5t:a}u5 C;k脡5s489 ipNs489 ipNstpNtpNtpNtpNtpNt蔑}>7tO)#|1N9s,X̱C :ed<)#ߩc1b:ed?SFc2w)#|n)~sOl2sssss 1c0Ns蔑}>7C]t>Ant<&O7yMnt<&O7yMnt7}>Y####c0`9tHg؏k,w\ C;nk`~Zc>}Fp5 C;k脡58s:9s:9s:9s:9s&499MirNs&499MirNs&49Ԟ8vy\#Fp5 C}Nl5tPg<_//n2qq\&??&Ogꎡ0uPwc;L1꒩KC]2uiK. uԥ.4%SdPL]꒩KC]2ui&s+t 2x1x/7ćcx1ue+ uԕ2SWbPWL]ꊩ+C]1ue+ uԵ65S׆fPL]L<<<^Ͽ9t2eoߦM1c_ӿ.AcA +Tn/0c譋 7Am_/~c````bbbboпAoпAoпAoпAoпA /_пA /_пA /_пA /_пA /_пoK>]>|v/  /W_ +W_ +W_ 5k_ÿ zA~^_~~ս!?]"?=+={uvnvntt>+}@oFvV\;kյځkwuµv]]p]vW~2!2L5i 2!L52!L52!L5i<#S}425¹2<#SC2$`;2$`;2o~2"`;:@Icﾮdo ~P<酧~q~>~q~OxY/<}}7~q~yu&zD^7nMyu}uun{ݼ^7{un{ݼ^7{un{ݼ^7{un{ݼ^7ֽ׭{[u n{ݺ^ֽw秣-uuzB[^n-=1~6?Fּ>q߾p߾q{oy=q>p{o/~w݆uwmn]}w݆n/UO~_Ǐ,89~|k< ަOp?/ԷƏxOܿ?߿_>?:?~xx; ,~`Xmz,~`X?#?O,~bX'OX'?O-zZ7=3???ﾧXXX{O'u~x+,~a _X_]M/,~a _X٧AH{{X>y/yX^us/ؽe~|w}^r_;{s /=(p@p@/9 -_: 䀐H8 ငH8 ငH8 နRH9`0 8`p0 8`Cr~h㕷 (8 (8e~7PpWPr n0 &7`Lp n0 &7b[Lpߙ`Lp n0 &7`Lp n1-& n0 &7`Lp n0 &7b[Lpߙ`Lp n0 &7`Lp n1-&3 &7`Lp n0 &7b[Lp 6` 6` 6` 6` 6` 6` ` `ߙ` 6` 6` 6` 6` 6` 6` ` vp@ $p@ $p@ $r@)ܙ` 6` 6` 6` 6` 6` 6` ;LLLLLL[L[LLLLLLLL[LLLLLLL[L[LLLLLLLL[LLLLLLL[LWw&` &` &` &` &` &` &b-&`Ŀ,I%%y~k?g-/ |}=/~oϳ}_}O8߃4:ū 0 0 0 0 0 0 C0 C0 0 0 0 0 0 0 C0 C0 0 0 0 0 0 0 C0 C0 0 0 0 0 0 0 C0 C0 0 0 0 0 0 0 C{Sz0 0 0 0 0 0 C0 C0 0 0 0 0 0 0 S0 S0 0 0 0 0 0 0 S0 S0 3၄Hx ၄Hx ၄Hx 偔RHy0 0 0 0 0 0 S0 W>ū 0 0 0 0 0 0 S0 S0X[_Ǯ|o ~:o U?.sY*'P`B &P`J)XP`AXP`I%6P`C 6P`K- 4h(P@C Ɵ]sW`+0# (P @@! $H(P @B)P`@P`H! ((PP@A% 2@&Ȅp e¡L8 2@&Ȅp e¡L8 2@&Ȅp e¡L8 2@&Ȅp e¡L8 2@&Ȅp e¡LXȄLXȄLXȄLXʄLXȄLXȄLXȄLXʄLXȄLXȄLXȄLXʄLXȄLXȄLXȄLXʄLXȄLXȄLXȄLXʄLXȄLXȄLXȄLXʄLXȄLXȄLXȄLXʄLXȄLXȄLXȄLXʄLXȄLXȄLXȄLXʄLXȄLXȄLXȄLXʄLO?'O?p pO?q oܿq? Mo߄&7 Mo߄&7 Mo [߂-o [7̗Ͽϟϟx'/<x7x~9?x~'x~x_x~6Fom6Fom6FkFkFkFkFkFkFkFkFkFkFkFkFkFkFkFkFkFkFkFkϟ/?/?'O?p pO?q oܿq______ %_ %_~kox~Ue> }=>+5?{o[C_2_^G-{6ɟ?CH3>Lq&0 ~BLp?c8c낛 L0e)&?Hc>Lq &X0 ~~S6 }}]p3 Ld_G=[O"m`&0 6La.>`[&2 Le)>߼O"2ņ &haߙfasas_L2A _ ?`"}>`n/& /w1Q_/A ^p1v?HۿE܏{SDϟ ~=o>?_y0G}_sz/>@.8^P~)H $ ~"\C/@#\p I^]pA $\pA $\pA)\rA)\p@ 8 s\0Pm~7P (:||pǃJ>L/\pP\ E}|悃 M >ZA >ⱉ,r|p.ws #\p`I^]ppfA >ⱙ0r|p ~\p.87`mWd.8*n /\pl'||+ꂃ psA&yu\plҁVa| >႟hm~7h 4:|pN v8';`pN)v8;bpN v8';`pN)v8;b1 ႄ .H 삄 .H 傔 R.H 傔 ';`pN v8';bSpN)v8';`pN v8';bSpN)v8';`pN v8';bSpN)v8';`pN v8';bSpN)v8';`pN v8';bSpN)v8';`pN v8';bSpN)v8';`pN v8';bSpN)v;\` p.v;\bKp.%v;\` p.v;\bKp.%vʋ .H ႄ .H ႄ .H 傔 R.H v;\` p.v;\bKp.v;\` p.v;\bKpG=S*}՝zu?.e1!LH0!SLI  ,H K,I!lH![lIА!AC Z$hHp [.s`Kp@  HH $H $AH $$HH %AJ $`@ $`H $(HP$AIÍt7F:J[p+nÍt7F:J[p+nÍt7F:J[p+'?Ht7q2J[p+nÍt7F:J[p+6a#6a#6a+a+6a#6a#6a+a+6a#6a#6a+a+6a#6a#6a+a+6a#6a#6a+a+6a#6a#6a+a+6a#6a#6a+a+6a#6a#6a+a+6a#6a#6a+a+6a#6a#6a+a#?ǖP _y~r_~oB~o7j} K_~]̿QMlpA 687f 686!lpn6!lA $lA $lA)lA)l0` `6 l0`! `C6 lpl`42lP7lP6(٠dskn6(٠dcso= >7|`lpl2 >G687fl lp ӄ &lpn|66 F`S686.ރL 6X7,`/`K687f%,`6ذ 6la l`[6ز le-lx25lа74lа6h٠esn6h٠aE PE PE PE PE QE QE QE QE PE PE PE PE QE QE QE QH a 6H al 6H e R6H e @1@1@1@1@C1DC1DC1DC1@1@1@1@1@C1DC1DC1DC1@1@1@1@1@C1DC1DC1DC1@1@1@1@1@C1DC1DC1DC1@1@1@1@1@C1DC1DC1DC1@1@1@1@1@C1DC1DC1DC1@1@1@1@1@C1DC1DC1DC1A1A1A1A1AS1ES1ES1ES1A1A1A1A1AS1ES1ES1ES16H a 6H a 6H e R6H e @1A1A1A1AS1ES1ES1ES1A1A1A1A1AS1ES1ES1ES1J`J{)?7~6?t2 =ࠄo%F|*北6u~ |p Ӂ q|p`LeWī}FӼ>8|so>88|p2NVo#|ppi|pl |Mx _GӼ >8} 7 Lꃃx7u86-8Puǹ}0_&x8P[7s.>*|+|σL+|Xǀ`><eWīF`Ӽ Ⴤ>H Ⴤ>H 僔R>H 僔R>Hࠅ>A q-|惃>`-|-|+ꃃpA _y |pl Ӂ ֱo>8p >8x.|+n>8p4o>O ^߿K߰T0QTS,TPRKlTQV[4*hTЪQ߷L+|^ *U QAT *` *(UP=q'ġ8zPO=q'ġ8zPO=q'ġX艅XꉥX艅XꉥX艅XꉥX艅XꉥX艅XꉥX艅XꉥX艅XꉥX艅XꉥX艅XꉥX艅Xꉥ9~K{L_kϿb--mϷgʿ A@! B4i AB) R4Hi0 h0C iPРAA% J4(ihhii0Lh0SLi ,hK,ilh[liРAC- Z4hh0'rDNȉS9q*'Nĩ8'rDNȉS9q*'Nĩ8'rDNȉS9q*'Nĩ8'rDNȉS9q*'Nĩ8'rDNȉS9q*'Nĩ8'rDNȉS9q*'Nĩ8'rDNȉS9q*'Nĩ8'rDNȉS9q*'Nĩ8'rDNȉS9q*'Nĩ8'rDNȉS9q*'NĩrBN\ȉK9q)'.ĥrBN\ȉK9q)'.ĥrBN\ȉK9q)'.ĥrBN\ȉK9q)'.ĥrBN\ȉK9q)'.ĥx3=܈<~oLU0U쁿*X` 6*ت`?UЪQA'zb'zb'zb'zb'zb'zb'zb'zb'zb'zb'zb'zb'zb'zb'zb'zb'zb'zb'zb'zb'&zb'zb'&zb'zb'&zb'zb'&zb'zb'&zb'zbO_HWEVg# Ʒʿq?ӗ8S`į nLip?渠K`į n,ilh[lip?cРAKuMv'??_448: .|]pv?1A@g낛! $4Hh AJ) 4`@ 4`H! l}~cA% 7 J 'ā8rPNʉC9q 'ā8rPNʉC9q 'ā8rPNʉC9q 'ā8rPNʉC9q 'ā8rPNʉC9 9 9K9K9 9 9K9K9 9 9K9K9 9 9K9K9 9 9K9K9 9 9K9K9 9 9K9K9 9 9K9K9 9 9K9K9 9 9K9K93>|9r/q>G{soy> *U QAT T0TP *(UATQU0QDSLUPBK,UQF[lUШQAF=q'Nĩ8'zTO=q'Nĩ8'zTO=q'Nĩ8'zTO=q'Nĩ8'zTO=q'Nĩ8'zTO =q'.ĥzRO\ =q'.ĥzRO\ =q'.ĥ~ROT=}ﯺϚW?=y~@~uo3ߕ# 5a!>߿LFLG ҟa_aSF8~q6ë_jQ7#La?7d=s<{oFX0’jsF8~[:KFX2† ӆ6a1–pb#la[F87#l[OF8L?pxZcW)oi3B-#jF84yfF?_fy0>~&[xxe^F7xm7#󄤗oF ?#\u.;EOF8~+ Sa;K/ߌ0BKQo3<ƫ^G!dFH!aFH!aRFH!eRFH!e0`# aF00d!# aCF2~dS29cu|w|ꌃ||rƖ3[80Wg 8PL8`{Wg8}3>۫3c '?^~5F:$Oh:`3;㠛^q18lo1 1 1 2  2  2  2  2  1 1 1 2  2  2  2  2 AWgrF)gg$tFIg$tFIg$!b!b!bAdAdAdAdAd!b!b!bAdAdAdAdAd!b!b!bAdAdAdAdAd!b!b!bAdAdAdAdAd!b!b!bAdAdAdAdAd!b!b!bAdAdAdAdAd!b!b!bAdAdAdAdAd)b)b)bIdIdIdIdId)b)b)bIdIdIdIdIdrF)grFIg$tFIg$tFIg$!b)b)bIdIdIdIdId)b)b)bIdIdIdIdIdy _'~]o]ue{࿋+IW| +z?1~WL1%ƔbL1)Ƥb,$ƒb,(Ƣbl%Ɩbl)Ʀbh)FSM1Zb?c$#11Hb#(FPA1bH#)FRI1b 1$Ɛb 1(Ơb(Q(FQE1b(%С:@`L t(%С:@`L t(%С:@`L t(%С:@`L t(%С:@`L @K @ @ @ @K @ @ @ @K @ @ @ @K @ @ @ @K @ @ @ @K @ @ @ @K @ @ @ @K @ @ @ @K @ @ @ @K @ @ @ st×n`_{+ymx~7nċſW|XyWk|hqd}'1ed֘Ƥ55ަzƤ5&q:֘qƓ56Zƒ5γ6^F[c8xXyWk,Zc[زƖ5eMklZcشƦ56iMklZcYO8^|ҫe58^F[i539ަzFMkrqF-kL):ECh 4tNI:IC'i$ 4tN):ECh 4tNI:IC'i$ 4tΔ5RHY#e55HZ#i5HZ#i5 S4tNI:IC'i$ 4tNI:IC'i S4tNI:IC'i$ 4tNI:IC'i S4tNI:IC'i$ 4tNI:IC'i S4tNI:IC'i$ 4tNI:IC'i S4tNI:IC'i$ 4tNI:IC'i S4tNI:IC'i$ 4tNI:IC'i S4tNI:IC'i$ 4tNI:IC'i ]K4t.EHCi" ]4t.EHCi ]K4t.EHCi" ]4t.EHCiJY#e5RHY#i5HZ#i5HZ#i5 ]K4t.EHCi" ]4t.EHCi ]K4t.EHCi" ]4t.EHCi:`5w<:`G<Nx+_c׃7sE|?I󤎷{m|&Oz:ƿW^l|^|Z)oY/Cܽq'oLz7aӃ^  L2${x}^q 'oW=u ϧ yNxy>y#Ԏ޽q J8Oxyꍔ7RHy#卤7Hz#鍤7Hz#鍤7Hz#z>yc|Z!om7NAouwoҫ7>||Ʊۓ^|Zؒ7쎗!878x|18l[\tnrM.E7&䢛\tnrM.E7[\tnrM.E7&䢛\tnrM.E7[\tnrM.E7&䢛\tnrM.E7[\tnrM.E7&䢛\tnrM.E7[\tnrM.E7&䢛\tnrM.E7hhh6h6h6h6h6h6hhh6h6h6h6h6h6hF)o$FIo$FIo$FIohh6h6h6h6h6h6hhh6h6h6h6h6h6hhh6h6h6h6h6h6hhh6h6h6h6h6h6hhh6h6h6h6h6h6hhh6h6h6h6h6h6hhh6h6h6h6h6hϥ}u>J]+ææj>l*T#FPA5jHT#FRI5j 1Ơj 1Ơj(QTFQE5j|Gj|Ƈj|Ƈj|ƇjL1ƤjL1Ƥj,Ƣj,ƢjlƦjlƦjhTFSM5Zjh(h0h0h0h(h0h0h0h(h0h0h0h(h0h0h0h(h0h0h0h(h0h0h0h(h0h0h0h(h0h0h0h(h0h0h0h(h0h0h0h*&h2&h2&h2h*&h2&h2&h2h*&h2&h2&h2h*&h2&h2&h2h*&h2&h2&h2/5v!zŷ)SeL1YdKe,Xb[elYf2e4h1GeV+e,#XFd2e 1X`e(Q,X`좃]tv.:E`좃]tv.:E`좃]E]E]E]E]E]E]E]E]E]E]E]E]E]E]E]E]E]E]E]E].?^? ?۬×ǯ+fW|'FHA5jT#FJI5j$HTcH!5TcPA5TFIE5j(QT#5>RC5>TC5>TC5>TcJ)5&՘TcRI5&՘TcI%5XTcQE5XTcK-56TcSM56TFKM5j4hRc*Ne,:E'd̢Yt*Ne,:E'd̢Yt*Ne,:E'd̢Yt*Ne,:E'd̢Yt*Ne,:E'd̢Yt*Ne,:E'd̢Yt*Ne,:E'd̢Yt*Ne,:E'd̢Yt*Ne,:E'd̢Yt*Ne,:E'd̢Yt).e,Eb]̢Yt).e,Eb]̢Yt).e,Eb]̢Yt).e,Eb]̢Yt).e,Eb]̢YtO_r3H>|%:Bӗ\k2&˘,c2X,c26,UFf2Ge?,#TF`2Re$H,c2,TFb2E7f[]tnv.E7f[]tnv.E7f좭..좭..좭..좭..좭..좭..좭..좭..좭..좭..OvM; ~]]-y M1:F~?W|?F_W|u+WMEsGs?6y#s4LJ8^z8qaǸCs|h=͓^S8yWsLc rcDZ {>4ϗqI%sI>y<\O :'}rG}}quǁAg{uG)w$ݑtGIw$ݑtGIw$ݑtGIw$ݑtB1>;N:'}rǠ;>۫;^}ꎃ>I>y\O:' }rG } }ꎃquABg{uX+dtAV:JY +dtAV:JX+dtAV:JY +dtAV:JX+dtAV:JY +dtAV:JX+dtAV:JY +dtAV:JX+dtAV:JY +dtAV:JKJJJJJJJJKJJJJJJJJ+厔;H#鎤;H#鎤;H#鎤;HCJJJJJJJJKJJJJJJJJKJJJJJJJJKJJJJJJJJKJJJJJJJJKJJJJJJJJKJJJJJJJJ? } ½^oY~u?u?Iu?^'#(GPA9rʑ#)GRI9r$H1$Ǡr 1(Ǡr Q(GQE9r(1%ǤrL1)ǤrLʱ$Ǣr,ʱ(Ǣr,ʱ%Ǧrlʱ)Ǧrlђ)GSM9r4h1J'Sd*Lt2NT:J'Sd*Lt2NT:J'Sd*Lt2NT:J'Sd*Lt2NT:J'Sd*Lt2NT:J'Sd*Lt2NT:J'Sd*Lt2NT:J'Sd*Lt2NT:J'Sd*Lt2NT:J'Sd*Lt2NTJSb*]Lt1.TJSb*]Lt1.TJSb*]Lt1.TJSb*]Lt1.TJSb*]Lt1.TCD\o"6ƿo%^1.ӭ~++]oy}fw_W|:yc'&1i9Fm=&1i^1iI{LjqǤ=&q$dNO-csW{,cA"c8yjE{,cشǦ=6iM{lcشǦ=6iM{l8Lkڣi9Lm=hy>_}늋=Lvq"ocucljfWu?N.:'}Ǡ?.>۫?.^}ꏃ>|-I>msW`E獼WzyW`uwdQOdim?86'}LJ8Oy}đ18l8?;Ny>c#@^q9:}'}ǹؓb'}ZEϩ#oc\q',c}}qG_g{IGq@IGֶ9ym?N:䏦?ΓG^g{AG+̧t0|:O`>̧t0|:O`>̧t0|:O`>̧t0|:O`>̧t0|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|3qEW+ؼuŤNj:餦Nj:餦.j颦.jj|+&ǘcq169FkC/c:Fp1c 18FqO7}Mntӧ>O>mӦO>mӦO>mӦO>mӦO>mӖO>+VW$xŇWL^x+5 j4iPӠAM5Mj4iRӤ#IsW|wcr1cs11p1c$cp1AtЧ>O}:A}ZiѧE}ZiѧE}ZiѧE}ZiѧE}ZiѧE~F]/9+_OOO #XGd:u$c:(QXG:&똬c:Xc:6جcf:u짓tN~:O'd?짓tN~:O'd?짓tN~:O'd?짓tN~:O'd?짓tN~:O'd?]짋t.~Ob?]짋t.~Ob?]짋t.}Oq1Xcs1c8}c1c$H181cЧ>O7}Mntӧ>mӦO>mӦO>mӦO>mӦO>mӦO[>|}^}׿m1c 18FqcL8cl5FЧA}iЧA}iЧA}iЧA}iЧA}iҧI&}iҧI&}iҧI‡羯w_k_W|i~SduL1Ybu,ֱXfulֱYGf:Zu?cQuŭ`:uH֑#YG:cb:u`?짃t~:O`?짃t~:O`?짃tiiiiiiiiiiiiiiiiiiii{_W| _=#9Fr1(Q1>cr1Xcs1cƘO'}:INtҧ>O'}:INtҧ>O'}:E.tѧ>]O}E.tO/i1&Xcq16hc#8Frc Q8}Mntӧ>O7}ӦO>mӦO>mӦO>mӦO>mӦO>moW|2#+wmzzJ`:u$H֑#Y`u 1XGb:u|XLJu|XLJuL1Ydu,ֱXbulֱYfu4hѬUGiiii)~~~~~~~~~~~~~~~~~~~?yy i&i&i&i&i~uO~uu cl]qc轓+c轓+c$H18zO}:AtЧ>O>-ӢO>-ӢO>-ӢO>-ӢO>-ӢO?~~%=uonI;]M%}=߻_}'GPA=z#GRI=z$HcPA=cPA=ԣGQE=z(QC=>C=>C=>C=>cRI=&cRI=&cQE=XcQE=XcSM=6cSM=6ԣGSM=z4hc2N|:O'd>̧t2N|:O'd>̧@/z0Ns7ǹ0N|:Od>=w| d>̧t2N|:O'd>̧t2N|:O'd>̧t2N|:O'd>̧t2N|:O'd>̧m/z0Nsǹ0N|:O'd>̧t2N|:Ob>]̧t1.|Ob>]̧t1.|Ob>=w7} b>]̧ɒ/z0.sǹ0.|Ob>]̧t1.|OSC8ǹG\r1}̧t3n|O7f>̧t3n|O7f>̧z0ñǹ0n|O7f>̧t3n|OOOOOOOOO<Qǹ06i36i3<|zw8f>mf>mf>mf>mf>mf>mf>mf>mf>mf>mf>mf>mf>mf>mf>mf>mf>mf>m$G=Oϳ|̧|̧|̧|̧|̧|ʧ]+:w:z_OO #XGd:u$c:(QXG:&똬c:Xc:6جcf:u`? `? `? `?=w:zk~~~~~~~~~~~~~~~~~~ztX:O4O4O4O4wF~]S7:OA|~]+oweN1ǤzL1Ǥz,걨Ǣz,걨Ǣzl걩Ǧzl걩Ǧz4hԣGSM=Zz?e{M+nz#GPA=z$H#GRI=z 1Ǡz 1Ǡz(QԣGQE=z0|:O`>̧t0|:O`>̧t0|:O`>̧t0>|z8|:O`>̧t0|:Oi1i1i1i1i1i1i1i1i1A?|z8b>-b>-TG=OS|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|Z̧|zyz\OOOOOOܑI4'=>G|y\߳}oM#GPA=zH#GRI=z$cPA=cPA=(QԣGQE=zPPPPcRI=&cRI=&XcQE=XcQE=cSM=6cSM=6hԣGSM=z̧t2N|:O'd>̧t2N|:O'd>=w$ԃt2NsG1z0NsGG=O'd>=w$d>̧t2N|:O'd>̧t2N|:O'd>̧t2N|:O'd>̧t2N|:O'd>=w$ԃt2NsG1z0N|:O'd>̧t2N|Ob>]̧t1.|Ob>]̧t1.sGG=Ob>=w$b>=w$ԃt1.sG1z0.|Ob>]̧t1.sG֑-:w\]S&똬c:Xc:6جc:u4hѪGu4_#XG`:u$H1X`u QXGb짛tn~O7f?짛tn~O7f?짛tnf?mf?mf?mf?ms':O]4/W`?mf?mf?mf?mf?mf?mf?mf?mf?mf?mf?mf?mf?mf?m8낇+S1c$cp1>1&ǘcq169FkO> 4ӠO> 4ӠO> 4ӠO> 4ӠO> 4ӤO>M4ӤO>M4ӤO>co+xq+S&q_W\똬cuŵ:6جc:uh縯+uTq_WVGuŵ`:u$H1X`u QC;}]qX`?짃t~:O`?짃t~:O`?짃OOOOOOOOOOOOOOOOOOOOst˧>G/|[#8Frc Q8Ƈc|8c,8c4h1INtҧ>O'}:INtҧ>O'}:INtҧ>]O}E.tѧ>]:wW|o^oc||{.uEVcR}MI=&cRE=О;WXcQE=cSM=6cSM=6hC{|_qӣGS-=H=!HGz|]qW=zОW#GPI=z$H#GRA=cPA=cPE='7=z(Qԃt3n|O7f>̧t3n|O7f>̧t3n|O7f>̧t3n|O7f>̧t3n|O7f>̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|ʧHz|_ˌz|_]|]q3پc|A+5}#GPuUA=zH#GRI=z$cPA=cPA=(QC{|]qգGQE=>C='W=>C=>C=&C{B~]qcRI=&cQE='W=XcQE=6cSM=6cSM=z4О_W\hԣGK`> `> `> `> `> `> `> `> `> `> `> `> `> `> `> `> `> `> `> `> `> `> `> `> `> `> `> `> `> `> `> `> `> `> `> `> `> `> `> `> d>Md>Md>Md>Md>Md>Md>Md>Md>Md>Md>Md>Md>Md>Md>Md>Md>Md>Md>Md>Msw NGW)uh>w:zZb5ϝޯֱYfulѬCF:ΝڅϝޯC:u$H֑c:Xvs+u~:O`?짃t~:O`?짃t~:OOOOOϝ`?=w:zZiiiiiiiiiiiiii~wFʿW߄㤼 ?;#coӯ+w߿|#GPA=z#GRI=z$H1Ǡz 1Ǡz QԣGQE=z(1ǤzL1ǤzL걨Ǣz,걨Ǣz,걩Ǧzl걩ǦzlԣGSM=z4h1O'd>̧t2N|:O'd>̧t2N|:O'd>̧t2N|:O'd>̧t2N|:O'd>̧t2N|:O'd>̧t2N|:O'd>̧t2N|:O'd>̧t2N|:O'd>̧t2N|:O'd>̧t2N|Ob>]̧t1.|Ob>]̧t1.|Ob>]̧t1.|Ob>]̧t1.|Ob>]̧t1.|zHG|y^\wF^n]I=&cRI=&cRE=XcQE=XcQM=6cSM=6cSM=z4hԣGKsG'=H+.z;qcGPA=z#GRI=z$H#Ǡz 1Ǡz 1GQE=z(Qԣf>̧t3n|O7f>̧t3n|O7f>̧t3n|O`>ܑ̧}̧t3n|O7f>̧OOOOOOOOܑQf>msG1z06#̧|̧c\`>mf>mf>mf>mf>mf>mf>mf>mf>mf>mf>mf>mf>mf>mf>mf>mf>msGG=OOǸ|̧|̧|̧|̧|ȧ?g=W|?-++}u<=%XG`:u$H֑c:XGb:>:>:&똬c:Xc:6جc:u4hѪ#O4O4O4O1s+uiiiiiiiiiiiiii&i&i&i&cW`?Md?Md?Md?K?]?1?gyl\>ggٺ|/mWanMi7qN䉛>q(n MzPʛB~Dߟۭzݺۭzknۭ|~kny5ۭzkn77MqsӸi4n77榺nn榺nn榺nn榺nn榺nn Ԩ{nq97qyoussy^ouy_ozs_oWͻayuؼ;l^6Wͻayuؼ;l^6Wͻauuغ;l][Wauuغ;lo>7yy]o^}7vw1oq97qyou}wؾ:lwa}wX_wa}wX_wa}wX_wa}wX_wa}wX_wa}wXa珿_>q|'x|<~u|???oX2#`=QvݺT j( d;V%o&ݧ3d(vaMrݏ_8~787oz ^ z ^ z ^ z ^ z ^ z ^ z ^ z ^ z ^ z ^ =Ro RoSo Ro =Ro RoSo Ro =Ro RokOwutt /_8_878q~}?~~?p?qO8?q~ȿȿȿȿȿȿȿȿȿȿK_"ȿD%/K_"ȿD%/K_"ȿD%/K_"ȿD%/K_"ȿD%/z|>y>/|}_A~ +WЯ_A[oA?_?煟//o|_{<~>????O< mo߆6ῆkῆkῆkῆkῆkyç|~~'~~?~/|~~7~~?/࿀ /࿀ /࿀ /࿀ /࿀߀7 o߀W>|wDžu?pxu=|_8|}=|8|?~p߿}/'y?q?>p|~?O?qy?>q|HH}OHHH}OHHH^#H^#H^#H^#H^#H^#H^#H^#H^#H^#ԛ>W_]ϟ1? oyoq?p\C??p?p?p?t~?q?q?qSןO\ן'?up\p\G_/\ _t~ ׿p ׿p ׿pK׿׿q׿q׿q׿u}7qo\w _/q/ _Bw _/> _ѧ/ _Bw _/q/ _Bw _/q/ _Bn/ ߸ ; ߸   |?/'?<}|g7/\_ xsMOWx7s䀂N:{/{x  ̐+(pq}7/}8c_:};? y)f+ǝNegqN>Neqvv8^:|v]7]7]7U<9 xꀣx;?ې^z mɃ> 6ee6elk0yꀣy;yw&0 L8`p&0 L9`S{p@Gc`GGG#26vOH8h^:N: NtD'8 NtD'8 NtD'8 NuST'8D'8 NtD'8 NtD'8 NtT'8 Nu NtD'8 NtD'8 NtD'8 NuST'8D'8 NtD'8 NtD'8 NtT'8 Nu>':]yOWNp':oNp:Np{'`LtN0 &:D'`LtN0 :wN0 &:D'`LtN0 &:D'S`{'`LtN0 &:D'`LtN0 :? L8`p&0 L8`rp> o}BtN0 &:oN0 &:T'S`;D'`LtN0 &:D'`LuN0 LtN0 &:D'`LtN0 &:T'S`;D'`LtN0 &:D'`LuN0 LtN0 &:D'`LtN0 &:T'Sxr:D'x? &:D'W]s:D'S`Lu>+W9J% ƇKW>G{c_~}Y_ߎԵ߃8j |%777Y=y {9ꁳ{;恣{A?_tgGG2OYpYq&<0 Lx`&<0 Ly`SQ=x ၣ{0ၳ{恣{恣{?˿'$h|恣|恣|?+',x_zߎy(<ၣ|pg G G 2OYpYqQ>xၣ|аၳ|恣|恣|?k'4-p@aJ, 0Kl 1[4h 1K  4 04L 05@bR 7p# p# 7p# p# 7p# p# 7p# p# 7p# $l$a+ IHF$l$a+ IHF$l$a+ IHF$l$a+ IHF$l$a+ IHF6Sk>'>e/.wP @@ )0 (0C )0 L(0S L)P @B  H)((()PP@A () ,(K ,) l([ l)P@C  h(`0& 0a CL`0& 0a CL`0& 0a CL`0& 0a CL`0& 0a CL`0& 0a CL`0& 0a CL`0& 0a CL`0& 0a CL`0& 0a CL8L8L8L8ĄCL8L8L8L8ĄCL8L8L8L8ĄCL8L8L8L8ĄCL8L8L8L8ĄCL8{P=(p|eA+x"ۂ@A ((PR ,( ,) l( l)@C  4h(R+0 ̯+0 /(0@@ (R  (0 )0 L(0 L)0@B  $H(R p 'p 'p p 'p 'p 'p p 'p 'p 'p p 'p 'p 'p p 7?(&.:b"~_VsA6_U~MA?x>$K<e f_@'zvM7w 6߶~M]ă.e o68R^ญyyvǍ7wJ6q' ;o68^S{jVS68ގ|=fn w2&lpmq7WO6H};f ;wOAeb^q7w/_mp?|d;fx=f5xk:Z7{GG+Gk2Gd}x;fy=f9yk:{GG3Gs2Gdy;fz=f=z k:ڥw{GG;G{2Gd z;f {=fA{AG cGGCG2Gd 툛 -bE,"ZBXh -bE,"ZRXj -bE,"ZBXh -bE,"ZRXj -bE,"ZBXh -bE,"ZRXjS>`6 ߶gL`6 l0e)L`h -bE,"ZBxxK<[??-gKr~|ptoG ]!&|AGM / _ _.ꃣ&|_YqYq>`GO / _ _.ꃣ'|_qqQ>`GQ /, ( _, _.ꃣ(|_YqYq>უ)|ჳ)|惣)|想)|-M7M*>=*W__>/>GU _.}T>}VoG\|Ϫ툛]჌]7]7]\}ptO> ߎ ߎ( |0,|qgYGYgYrWe|poG|poG|0 L`>&|0)L`S>|pԅ>H dL _ _.ꃣ.|Ag]vg]v7č>qO7č>qOĭ>qOĭ>qO7č>qO7č>qOĭ>qOĭ>qO7č>qO7č>qOĭ>qOĭ>qO7č>qO7č>qOĭ>qOĭ>qO7č>qO7č>qOĭ>qOĭ>qOl>'6F}bOl>'V[}bOl>'6F}bOl>'V[}bOl>'6F}bOl>'V[}bO L`>&|0)L`S>|0>'6F}bOl>'V[}bOl>'6F}bOl>'V[}bOl>'6F}bOl>'V[}bOl>'6F}bOl>'V[}bOl>'6F}bOl>'V[}bOl>'6F}bOl>'V[}bO_ϟ6O-|8!0A` &`h &&`j $&HM > >0Aa &X`i 6&ؘ`k 4&hMИ L eb(P&21L eb(P&21L eb(P&21L eb(P&21L eb(P&2q 2q(2q 2q(2q 2q(2q 2q(2q 2q(2q\w'y7ey=_vZn{DA 4(iPҠ ,hK,ilh[liAC 4hiҠk0̯ /h0A@ 4i  h0C i0Lh0SLi0AB 4Hi 8q'8q8q8q'8q'8q8q8q'8q'8q8q8q'8q'8q8q8q'8q'8q8q8q'&81ʼn)NLqb'&81ʼn)NLqb'&81ʼn)NLqb'&81ʼn)NLqb'&81ʼn)NLqb'&81ʼn)NLqb'&81ʼn)NLqb'&81ʼn)NLqb'&81ʼn)NLqb'&81ʼn)NLqb?98kW5?'.˸ 4h AH! 4`@ 4`H! &4`B 4`J) $4Hh AJ) > > ># ># 4(hPРAI% 4X`A 4X`I% 64`C 4`K- 44hhРAK X'8ĉ%N,qb X'8ĉ%N,qb X'8ĉ%N,qbϷ?hNuEpb X'8ĉ%N,pb X'8ĉ%N,pb X'8ĉ%N,pb X'8ĉ%N<8|g ĉ%N} 5XN\N\%N\%N\N\N\%N\%N\N\N\%N\%N<8|O ĉK;2_\4'.pʷ/8D.h}>G0 6X`c 46 s Ah 6`j -'n8qˉNr-'6rbÉ-'6rbÉ-'6rbÉ-'6rbÉ-'6rbÉ '?W4}^?y++0A` &`h &&`j $&HM > >0Aa &X`i 6&ؘ`k 4&hMИ L eb(P&21L eb(P&21L eb(P&21L eb(P&21L eb(P&2q 2q(2q 2q(2q 2q(2q 2q(2q 2q(2睬Oğ~[#>MP0Ai ,L4lL5 &hLS&.}TOkm B&`` &`b &HL 5AjdD&NeT&NdD&NeT&NdD&NeT&NdD&NeT&NdD&NeT&&21LLeb"T&&21LLeb"T&&21LLeb"T&&21LLeb"T&&21LLeb"T&~7[k|8!0A` &`h &&`j $&HM > >0Aa &X`i 6&ؘ`k 4&hMИL,eb) XR&2L,eb) XR&2L,eb) XR&2L,eb) XR&2L,eb) XR&2q!2q)2q!2q)2q!2q)2q!2q)2q!2q)2q?DIO_LWv{h{K|;'k4(hPРAI% J,h ,iKlhli[44hhРAK- 쯻kw 4_`A 4h AH! 4`@ 4`H! &4`B 4`J) $4Hh AJ) ʼn[ʼn[ʼn[ʼn[ʼn[ʼn[ʼn[ʼn[ʼn[ʼn['68-Nlqb['68-Nlqb['68-Nlqb['68-Nlqb['68-Nlqb['68-Nlqb['68-Nlqb['68-Nlqb['68-Nlqb['68-NlqbG_3?gub?ߗvA@ 4i  h0C i0Lh0SLi0AB 4Hi ||G|G|AA 4(iPҠ ,hK,ilh[liAC 4hiҠA'81ĉ!N qb'81ĉ!N qb'81ĉ!N qb'81ĉ!N qb'81ĉ!N qb'81ĉ!N qb'81ĉ!N qb'81ĉ!N qb'81ĉ!N qb'81ĉ!N q'p'p'q'q'p'p'q'q'p'p'q'q'p'p'q'q'p'p'q'qߍ}<+οGޣAi 6`k } 6`h 6HlNr8)'N8qʉNrb‰)'&rb‰)'&rb‰)'&rb‰)'&rb‰)'&rȖ<>}'&L 4 M04LM05Ab R|0|4G&(LP4 ,M4lM5Ac 2L,eb! XR&2L,eȖ [\&@&2L,db!KXB&2L,db!KXB&2L,db!KXąL\ĥL\ąL\ĥL\ąL\ĥL\-O '/LL\ĥL\+OOOৌ{80Aa &X`i 6&ؘ`k 4&hMИx> &M`` &`b & 1Ab [[[[&2Lldb+[F&2׉&@&~_pV&2Lleb+V&2Lleb+V&2Lleb#x5K]8?{U{U~# 4h AH h0C i0Lh0SLi0 $4Hh AJhhii 4(hPҠAI ,hK,ilh[li 44hhҠAKN pb'81ĉN pb'81ĉN pb'81ĉN pb'81ĉN pb'81ĉN pb'81ĉN pb'81ĉN pb'81ĉN pb'81ĉN pb'81ĉ88C8ĉC8ĉ88C8ĉC8ĉ88C8ĉC8ĉ88C8ĉC8ĉ88C8ĉC8ĉ88C8ĉC8ĉ88C8ĉC8ĉ88C8ĉC8ĉ88C8ĉC8ĉ88C8ĉC8ĉ88S8ʼnS8ʼn88S8ʼnS8ʼn88S8ʼnS8ʼn88S8ʼnS8ʼn88S8ʼnS8ʼn88S8ʼnS8ʼn88S8ʼnS8ʼn88S8ʼnS8ʼn88S8ʼnS8ʼn88S8ʼnS8ʼn NLpb'81ʼn NLpb'81ʼn NLpb'81ʼn NLpb'81ʼn NLpb'81ʼn NLpb'81ʼn NLpb'81ʼn NLpb'81ʼn NLpb'81ʼn NLpb'81ʼn=k\ÿ|;zTNk  ¯#~~O"D!$BH!B" 0 €C" 0$C"L0!„S"L0%”S"$DH!%BJ)R"| "| G"|$G"|$G"D(P$BI%J", ‚K",$’K"l!†["l%–["4Dh%BK-"@b,cKX"1@b,cKX"1@b,cKX"1@b,cKX"1@b,cKX"1@b,cKX"1@b,cKX"1@b,cKX"1@b,cKX"1@b,cKX"1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1DQO# /bOx $ίG.BAJ"D(P$‚ ",$’K",$†"l%–["l%BC Z"Dh!"쯻}aAD&B@B"D!$€" 0$C" 0$„"L0%”S"L0%BB R"DH!%q7qqq7q7qqq7q7qqq7q7qqq7q7qqq 1E-blc 1E-blc 1E-blc 1E-blc 1E-blc 1E-blc 1E-blc 1E-blc 1E-blc 1E-blc|EKd>/)Y[zYseuBVE)+a~ z[}/O)^)?'kZ{;PI?_ixqoܭq"ەܭq{z~i)Wk\q^^QqrY+]Gh㵹z=jz?jz͋Q= ގ[l[,ޮn{>_Yٽr꽟rQ=Ye|e<|;n_|;n|5MkE)Wk])7kPjCCmh 64؆`lCmh 64؆PjCCmh 64؆`lCmh 64؆PjCCmh 64؆`lCmh 64؆o|Ɣ51e)kkLZc֘Ƥ5&1iIkLZcjCCmh Rߎ[mh =_z%wk K[OZmh 64ԆPlCmh 64؆`lCmh 64ԆPlCmh 64؆`lCmh 64ԆPlCmh 64؆`lCmh 64ԆPlCmh 64؆`lCmh =+d 64Ԇ~;n 6|ܭ64؆~?j 6t jCС6t lC6t lC6t lC6t jCС6t lC6t lC6t lC6t jCС6t lC6t lC6t lC6|g51e)kLYc֘Ƥ5&1iIkLZc֘С6t jC6t lC6t lC6t lCQv>Y.ovO爧+|9#~~kO8S<ηK)?GoZ;ye)ײxϯG䍒7IВ7j;_θ{l;_Ozl;.|FgzgzG%ou瓠K|9|=ꍳ|78S8S8'oly;_}wo})Wo}ۥܽqwrwrQx>y卣|卿 ϗ38 S8 ϷK{(<YxrYxr<oy4ZpWrl<_Oycۥ\1+.y6ܼ17!o瓠!oUyqYyrYy]G荠777C8:'AWrgzgv)wo7qv\qv\1)oLycޘƤ7&1IoLzcޘƤ7&qOHyh=My医77R8ZGo$q\q\^tEz^tE'{^tE'{^tE'{ѩ^tEz^tE'{^tE'{^tE'{ѩ^tEz^tE'{^tE'{^tE'{ѩ^tEz^tE'{^tE'{^tE'{ѩ^tEz^tE'{^tE'{^tE'{T/EShM^4ً&{d/EhM^4ً&{T/EShM^4ً&{d/EhM^4ً&{T/EShM^4ً&{d/EhM^4ً&{ќƔ71IoLzcޘƤ7&1IoLzcP/EShM^4ً&{d/EhM^4ً&{T/EShM^4ً&{d/EhM^4ً&{T/EShM^4ً&{d/EhM^4ً&{T/EShM^4ً&{d/EhM^4ً&{T/EShM^4ً&{d/EhM^4ً&{T/EShM^4ً&{d/EhM^4ً&{ϟ__o+~ʕ+~d5N #8Fp1cp1&ǘcr1c$hp(Q8Fq1Xcq16cs1c(h1E)ZLRS-h1E)ZLRS-h1E)ZLRS-h1E)ZLRS-h1E)ZLRS]J]L]J]L]J]L]J]L]J]L]ckxY3!,ߜ+~g=~?<絾OxXyo犒%5j(QTFQ%5XTcQE5XTcQ-5TcSM56TcS-5j4hTFK^wSׂ˜/.kMV^qS#FHA5jTcH!5TcPA5TcJ)5&՘TcRI5&՘T#FJI5j$HTC,:Ţ,:ɢ,:ɢ,:ɢS,:Ţ,:ɢ,:ɢ,:ɢS,:Ţ,:ɢ,:ɢ,:ɢS,:Ţ,:ɢ,:ɢ,:ɢS,:Ţ,:ɢ,:ɢ,:ɢ)MhE,d$&Y4ɢ)MhE,d$&Y4ɢ)MhE,d$&Y4ɢ)MhE,d$&Y4ɢ)MhE,d$&Y4ɢ)MhE,d$&Y4ɢ)MhE,d$&Y4ɢ)MhE,d$&Y4ɢ)MhE,d$&Y4ɢ)MhE,d$&Y4ɢG,!~Ȣ,!~ȢG,!~Ȣ,!~ȢG,!~Ȣ,!~ȢG,!~Ȣ,!~ȢG,!~Ȣ,!~ȢG,!~Ȣ,!~ȢG,!~Ȣ,!~ȢG,!~Ȣ,!~ȢG,!~Ȣ,!~ȢG,!~Ȣ,!~Ȣ%-hE,Zd"YȢ%-hE,Zd"YȢ%-hE,Zd"YȢ%-hE,Zd"YȢ%-hE,Zd"YȢ%-hE,Zd"YȢ%-hE,Zd"YȢ%-hE,Zd"YȢ%-hE,Zd"YȢ%-hE,Zd"YȢK,Ģ,Ȣ,Ȣ,ȢK,Ģ,Ȣ,Ȣ,ȢK,Ģ,Ȣ,Ȣ,ȢK,Ģ,Ȣ,Ȣ,ȢK,Ģ,Ȣ,Ȣ,Ȣ.I__9i_0m'9~)OBM^G9~&O?Q(GQE9r(ʱ$Ǣr,ʱ(Ǣr,ʱ%Ǧrlʱ)Ǧrlђ)GSM9r4h nr|9279~kM9~kUA9r#(GP!9cPA9cP)9&嘔cRI9&嘔cRI9r$Hʑ#)GRQ&nR&nR&nR&nQ&nR&nR&nR&nQ&nR&nR&nR&nQ&nR&nR&nR&nQ&nR&nR&nR&IM*mRiJTڤ&IM*mRiJTڤ&IM*mRiJTڤ&IM*mRiJTڤ&IM*mRiJTڤ&IM*mRiJTڤ&IM*mRiJTڤ&IM*mRiJTڤ&IM*mRiJTڤ&IM*mRiJTڤc|w_9~VAWOyԃ+6OEA9r#(GP!9cPA9cP)9&嘔cRI9&嘔cRI9r$Hʑ#)GRPPPPE9r(Q(GQ%9XcQE9XcQ-96ؔcSM96ؔcSM9r4hє)GK4HA* RiJT4HA* RiJT4HA* RiJT4HA* RiJT4HA* RiJT4HA* RiJT4HA* RiJT4HA* RiJT4HA* RiJT4HA* RiJT!*A*A*A*!*A*A*A*!*A*A*A*!*A*A*A*!*A*A*A*EL =ÊK?|_˿+O/yWtR)?1V|r)kiۏ5+J O$=ߴt'鿞ry/z\qO<|/x=j='{;k$=_=t)W{F\q=^գ=W>;S8O㸋{/O>I]O{ ryz\qo>|'/#}=j='{4q>Iڴygz)W{wׯrqh=;S8O|݃=wym^Oc])7{o{=Gg)zJZZ?VA蓦AՊrيrي^G+菠?V?V픻?Z8k'MW-vg-zg-z-W?q֢\q֢o1ILcǤ?&1ILcǤ?&qOH,F4Mb픫?b?bZ8G$q\qoq6Og3};ꏳ}=ꏳ}?flF_OlFNFQY>iZ_)W)W\qT(F_OFNF菳}tuo\qv\qvrэ>cg7zg7vg9M蓦};ꏳ}=ꏳ}?r8S8ѷS8'4qO6W;vg;zg;z-W?8S8ѷS(؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?ILc|Ǥ?&1ILcǤ?&؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-b؟.b؟.b؟.b؟.b؟.b؟.b؟.b؟.b؟.b؟.b؟.b؟.kǤ?&1ILcǤ?&1ILb؟.b؟.b؟.b؟.}V|_,_W|k>R8Gqs,α8slα99s4hͱ4Ks/#8Gps 18sL199s$H<<<<<<<<<Zw?s|~;;o{WySz#GPA=cPA=cPA=&cRI=&cRI=z$H#GRI=>C=>C=>C=>C=z(QԣGQE=XcQE=XcQE=6cSM=6cSM=z4hԣGS-=| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOIOzi~ړ>Ww8Kt'}IE=z(QԣGQE=XcQE=XcQM=6cSM=6cSM=z4hԣGK%=_c~I%=_c~QA=z#GPA=cPA=cPI=&cRI=&cRI=z$H#GR$N$N$N$N$N$N$N$N$N$N$N$N$N$N$N$N$N$N$N$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$.'=ȧG}MiOzۊ$7=ȧI>o+zO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>M_o ~҃|~W &쾭f++WLHpEqEM5-jZԴiQӢEM.j颦.j"a?(Qcq=6ܣGk=~#{L1GrO7}Mntӧ>O>mӦO>mӦO>mӦO>mӦO>mӖO>q=cr={$p(Qcq=6ܣGkO> 4ӠO> 4ӠO> 4ӠO> 4ӠO> 4AtЧ>O}:AtUv#V({lܣV\cp=&#Grtҧ>O'}:INtҧI&}iҧI&}iҧI&}iҧI&}iҧI&}iҧçO9Y)+OyxY~scp9cr9&瘜#9Gr9>9>9s(Qcq9Xcs96؜9Gs9yZb󴘧<-i1OyZb󴘧<-i1OyZb󴘧<-i1OyZb󴘧<-i1OyZb󴘧<-i1Ot1Ot1Ot1Ot1Ot1Ot1Ot1Ot1Ot1Ot1OבsZw[Oi8ǯߧO'}:INtҧI&}iҧI&}iҧI&}iҧI&}iҧI&}iҧ=9cp=&#Grp=Xcs={(ӢO>-ӢO>-ӢO>-ӢO>-ӢO>]O}E.tѧ>]Oo?4$[{. 9s(α8s,α9slќ9Gs844^:Gp9s 18sL19s$HΑ#9t3O7t3O7t3O7t3O7t3O7t3O7t3O7t3O7t3O7t3Oyf6󴙧{VyCO*>{uzP+s 19sLΑ#9Grzb[+s|8V|9Ķ-W\XCOl+>{u9s4hњO,>{mb [~<0Ϸ^qy'`o:O,>{u)Y|S>|9|f+s0O-W\` [~<0Ϸ^qc1O-W\` [~<0Ϸ^qy'`o:{|F[WLN::A~=ûW,-G=z(QԣGQz,걨Ǣz,걨Ǣzl걩Ǧzl걩ǦM=z4hԣGS84\&=~M%=W#GPA=zcPA=cPA=cRI=&cRI=&H#GRI=z$ n&n&n&n&n&n&n&n&n&n&n&n&n&n&n&nmG=ȧ|z>qR&n&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&Fԃ|叓O|&ߊԃ|鏓O|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&Ooxԃ|O|>gNjY3ǿ~(~_=~V)N #GPA=zcPA=cPA=cRI=&cRI=&H#GRI=z$PPPP(QԣGQE=zXcQE=XcQE=cSM=6cSM=6hԣGSM=ziO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA>A>A>A>A>A>A>A>A>A>A>A>A>A>A>A>A>A>A>A>A>{xW;⺇⺇Gs|zz{L#}:S{utҧ|O=ӤO=ӤO=ӤO=ӤO=ӤO'z]_|[翦O#8s 18sL19Gr9s|8LJs|8LJs(Q8s,α8slα9Gs9Zs󴘧<-i1OyZb󴘧<-9瓎.+ns0OyZb󴘧<-i1OyZb󴘧<-i1OyZb󴘧<-b.b.b.b.b.b.9瓎.+ns0Ot1O|Jǿ#?reOtJq9s,α8slα9s4hќ598rYq#8Gp9cp9&瘜cr9s$HΑyyyyyyyyyy8Gp9cp9&瘜cr9s$HΑ9>9>8Gq9Xcq96؜cs9s4hњ#< i0Oy`4< i0O?< i0Oy`4< i0Oy`4< i0Oy`4< i0Ot0Ot0Ot0Ot0Ot0Ot0O?<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<9>8Gq9Xcq96؜cs9s4hњ<-i1OyZb󴘧<-i1OyZb󴘧<-i1OyZb󴘧<-i1OyZb󴘧<-i1OyZbt1Ot1Ot1Ot1Ot1Ot1Ot1Ot1Ot1Ot1O|G;N99s(α8s,α9slќ9Gs绯8l4V\#8Gp9cp9&瘜cr9s$`nfnfnfnfnfnfnfnfnfni3Oyf6󴙧.}n}~{‡g)_N ꡧgꡧgMSz1⪇7O1ǠzL1ǤzL1ǤI=z$H#GR꡷|꡷MSz|LJz]W\])W=zXCow^qCow\XcQM=vW=v>~UM=6hԣGSM=z)>>A> iO|S}{UiO| o^qՃ| 4ȧ| o\  }~c o^qՃ| 4ȧA>W\ 4ȧA> iOW=ȧA> iO|S}{UiO| ߊԃ|S}oֿrՃ|A>W{OtOtOW=ȧ|:ȧ|:ȧ|ʷ~A>A>A>=tO>~U Ooxԃ|:ȧ|`Ox?tOIOz~|s%&=+'=N|;]E=z(QԣGQE=XcQE=XcQM=6cSM=6cSM=z4hԣGK%=_c~I%=W\_w=z#GPA=cPA=cPA=&cRI=&cRI=z$H#GRI=ȧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|9mS+~+V1{L#LJ{|Gq{,=Z{}ZiѧE}ZiѧE}ZiѧE}ZiѧE}ZiѧE.tѧ>]O}E.tѧ瓎޵||O:)9>ttYqcqi']V؜CoIG9s4hњ|||O:Co.IG9Л|em9&瘜cr9s$`M𽙧y||ofn)ߛyy7fnfM𽙧yS yfMf6of6|IG9||7󴙧<໙>ۇ}W]5HqU)2U W*U\WOWUqmel?8Ӻl]v]v]v_v_?۷;?ߧ?ןώώgW_ͫWyռj^}5W_ͫ꫼*ʫ?Qnc1 h˲x-v6~ 132 U]U]U]U]U]U]U]U]y[&ӅӍitpj6qWjUwո]5qWwuqWwuqWwuZ~;}~6ƯY|1199bɗds1yJda8Y0ya7&oNޜ\\\\tذÆ6A ;latذÆ6A ;latذÆftafftafftafftafftafftafftafftafftafftaf盦_>ߎ~ z ӯ@ +Я@f;@;@_L_L_} +?L 'П@ ;w@߁e7@ 7@?L?L?~ 'Лfzqw=BSz ]O]O)t=Bw=qSz ]O)t=]OBSz ]O)t=qw=BSz ]O]O)t=Bw=qSz ]O)t=]23$39j@D+M-h1ԏT}^ 'z m=m 'z ''z 'zzgzy[zgzm=ogzggzgzzgz}d?;;|^c0?a={=|^{>=k yyüa0= ^z]@ T/z^v T/P^z_T<W^z+TPBW^zuWPB ^z]2!P2!P(Lz2!P(Lz&K= Rτ@1 0$VP;Y|Hn=z[b=z 㳯Uf%cylтC°NW_{Gz#}}v2%`)2%`~XoFz3֛2'`=2'`=2'`=A 0W\2_zzzzzzzzzzzzzz2#P(zfJ=3RQn0+P g[`+&v*l mXozz۰ކ6a gmXoz۰ކ6kXaz 5װ^?[ag5װ^zlkX/OӖ?y/ߟݓgiο~9o7 ?3{͟gk >;? _/////////?? 'O7A oߠ7A oߠ7A oߠ7A oߠ7A o_A_A_A_A_A_A_A_A_A_A_A_A_A_A_A_A_A_A_A_A[ۣy5ug׺n_/////?`'Oa _~co~y޿ܨfˍ(o +࿂ +࿂ +࿂ +࿂ +࿂ +࿂ +࿂ +࿂ +࿂ 2f[/o [߂-o [߂-o[ߜo|~2'1 0D3%3wB_߼Jϝu'`}_/ _W+ _W+ _W+]~_Cy|Wyq/E@?ПO'~/EB?]z뺒veཛྷ@*v}<9M>şBQ1 /ߘ1c>/_! WȿB+_! WȿB+_! WȿB+_! WȿB+_! WȿB[ȿ[ȿ[ȿ[ȿ[ȿ[ȿ[ȿ[ȿ[ȿ[ȿ[/w~e/\po\߸ \?pO\>q= mo߆6ῆkῆkῆkῆkῆkW|&>?x{x?}W``O~??O~?bb}~i' ?}]Oa/_a_a/~wy?a _oxy?77~iwc}FF/ _o{?/{O/ _f _?}_o{?/O/ _ _?}_ >~?>~ >~?ooo77w?} ߸}n}ݭ7=7wwO|f_a_a _/a7oc7c7?f};-o7>~:}??`?Ob'?O?O?MMMMMMMMMMMMMMMMMMM%ޛ%vߛ%/ K_.[z%/ K_%/ K_%/ K_%/ K_%.︾[/ K_%/ K_%/ K_%/ K$>o5/'?0?0?0?0`'O̟?1?1?1?1?1/a /_0c<|[ȿ[ȿ[ȿ[ȿ[ȿ[ȿ[ȿ[ȿ[O9刺_Ͽn}pz_ /쿰 /a}~?i _7~?ao쿱>?}?O9}?}??O9~`O>~'??~O?O9~?o6o6o6o6o6o6o~ ?smm_~7 kO9~? k_k_5x?a5 kO9~? k_k_5x?a5 kO9~? k_/q7>^}??`?Ob'?O?O?_ a/ /쿰 /쿰/a _oc7o쿱o>]t/ _/ _/ _/ _/ _qo _.}i/ _/ _/ _]w7wy>>fq?ooooooooooooo./WЯ_A~ +WoA[oApn/\po\߸׿|Շ~'O\߆6 mo_ 5_ 5_ 5_ 5_ 5g篻OOx}>/_@~ /߀~ 7߀~uy?߼}^0000a 7oߘ1111yl7xy?̟?1b|DMDMDMDMDMDMDMDMDMD%~n>/K_"ȿD%/K_"ȿD%/K_"ȿD%/K_"ȿD%/Kw=>?tc7~aϯ?~w???za߿^ Ϸ???ژ~aWc߿ {|??W# WȿBȿBȿBȿBȿBȿBȿBȿBȿ=>ǟ=> {|#?G-9~|?ssp}߸~}\~'>q}zo߆6 mo 5_ 5_ 5_ 5_ 5_W̧~>O+0?0?0?0`'O̟?1?1?1?1?1/a /_0c~j]_{7Wڛx>a>_R}iu~OϿ߯k>~~MO>~?<}47x>i>o"||D$ȿko$x~I%'y?G%'y?G%'y?G%'y?G%'y?G%'y?G%'y?G%'y?G%'y?G]_'?ػ\?p'O\/\_p o\q}>___W_W_W_W_-o [߂}S}sΗ._.7.}Uϗ>]gmn]}v݆ugmϮkϮkϮkϮkϮkϮkϮkϮkϮkϮ5Ϸyqzq>0}`yyy _^u^^y<}oLߘ}ޘuκ:g]! YW笫suuκ:g]! YW笫suuκ:g]! YW笫suuκ:g]! YW笫suuκ:g]! YW笫suuu Yuuu Yuuu Yuuu Yuuu YuW}O==?Y_e=?Q:ﾰ /쾰y/~a _yo~c>ﾱo쾱>~w}yu8>}yuݿWvyv}`v?λ~`v?ϻO~b'vy'v}b'vf}f ` ` `}f}f ` ` `}f}f ` ` `}f}f ` ` `}f}f ` ` `>^Yz k^`>^Yz k^`>^Yz k^`>^Yz k^`>^Yz k^`>^Yz k^`>^Yz k^`>^Yz k^`>^Yz k^`>^Yz k^gۿq 򋻿_a7xݍ'Oy _:///_ /7o>ۻԻf| z ^ z ^ z ^ z ^ z ^ z ^ z ^ z ^ z ^ ~ f@]~w3~ 9Ro RoSo Ro 9Ro RoSo Ro Wއ;YS?Su0~a}1~c>oo2>>|}0}0>yy<>1>1>1z7z7ϩ7z7zz7z7ϩ7z7zz7zK^"K^"K^"K^"K^"K^"K^"K^"K^"K^"k9Ϝ?mY漏k3_so ???`'?ObO?O?a/_ /쿰 /쿰 _/a 7oco쿱o쿱+_ W+_ W+_ W+_ W+_ W+_ W+_ W+_ W+_ W+_ W[[[[[[[[[[[[[[[[[[[[ӣn.k\?|k毛y]t7000a 7oߘ1111/񹙿/ṙ0?0?0?0?0`'O̟?1?1?1?1?1g[o7ȿF5k_#ȿF5k_#ȿF5k_#ȿF5k_#ȿF5?# , B X0L,`bS H, R xa/, (,,,`aK X6 h,@0$ $a IJ@0$ $a IJ@0$ $a IJ@0$ $a IJ@0$ $a IJ$H$J$H$J$H$J$H$J$H$Jqype> g}:?];@A ()PR`AXP`AXR`C 6P`C R@C  4h)Pfg.o~Y ̯ |焃 (P @H (0 (0 L(0 L(0  $H(P @J` &` &` &b)&` &` &` &b)&` &` &` &b)&` &` &` &b)&` &` &` &b)&L0a L`&0ń)&L0a L`&0ń)&L0a L`&0ń)&L0a L`&0ń)&L0a L`&0ń)&L0a L`&0ń)&L0a L`&0ń)&L0a L`&0ń)&L0a L`&0ń)&L0a L`&0ń)&|f?ټ~3͟l^f{8o7yX@` ,`` Z&0$X@b^Z@aPZl,`c Z@c4X@! IXHR$,%a! IXHR$,%a! IXHR$,%a! IXHR$,%a! IXHR$,%B.$B.%B.$B.%B.$B.%B.$B.%B.$B.%֯ȼ=33>?sx7n߉woܿy׿(nӄa 14?Or}BC*` .-؍ &(`Kp J&(=lh ~"C;/O/?d,L`%\4h%,Lp2o>OH-O&0 .?xX&2O&2 ~:Cށ;/5Q!>,&>~0&x&x?` |NN&p0AL0AL0AL2A!L2\ݙ]D7p݉xy'L`=d L GL`xxg7n>BǛ-aO&H a'2A)\~4h R&@cn4Fcn4Fcn4[Vcn5[Fcn4Fcn4Fcn4[Vcn5[Fcn4Fcn4Fcn4[Vcn5[Fcn4Fcn4Fcn4[Vcn5[Fcn4Fcn4Fcn4[Vcn5[q&xޏk}}yǹ|?}Y{0 >'` '|N8a1l4ư6Fch a1l4ưVcj a1l4ư6Fch a1l4ưVcj a1l4ư6Fch a1l4ưVcj a1l4ư6Fch a1l4ưVcj a1l4ư6Fch a1l4ưVcj a1l4ư6Fch a1l4ưVcj a1l4ư6Fch a1l4ưVcj a1l4ư6Fch a1l4ưVcj a1l4ư6Fch a1l4ưVch O ~N柏s¿?' ?k4+?J~Nh5C;gȟN}S~>[W\:;W\qi wO8M㈣+.].w>O9>O9R޹LRi;]>8wu8Ky++]q)]q]qi\qyGv۝nG]K|qtťM|>4StSԊw<{#wz~NW#].>8R/>kx犤+.+.%+.=+.ϣ.M㝞_x]㈣+~#O88޹EW\:)GW\Z)GW\;W\q,w8㈣+..Vw(RB>O9RC>O9D޹»E;F>8w8K#++]qi%]q%]q&\qyGv)'۝'G]|qtť|גԔSStw<#wz~N#X>8Y>kky犦+.+.+,=}#> ߋ'WOЈ+^.N/sSNxqr猓+mP6Cf un3m`6f vn3mP6Cf un3m`6f vn3mP6Cf un3m`6f vn3mP6Cf un3m`6f vn3mP6Cf un3m`6f vn3mP6Cf un3m`6f vn3mP6Cf un3m`6f vn3mP6Cf un3m`6f vn3mP6Cf un3m`6f vns| 'WO8+O8}F\}4}3+>g\ns6͡ns6͡ns6ns6͡ns6͡ns6͡ns6ns6͡ns6͡ns6͡ns6ns6͡ns6͡ns6͡ns6ns6q.>s¿=?'@焟}yֈ%?gO?3JR(IQ$EQE)XbI%)XbQE)ؒbK-)ؔbSM)ZRhIђ%ES-)>$ ')_b~I%)I"$EHA)RbH!)bPA)bJ))bRI)&HI"%EJI)R$mNmNmN$mNmNmNmN$mNmNmNmN$mNmNmNmN$mNmNmNmN$mNf6Smh3IILf6Smh3IILf6Smh3IILf6Smh3IILf6Smh3IILf6Smh3IILf6Smh3IILf6Smh3IILf6Smh3IILf6Smh3IIL&u ?+1o}B /; O(ψ?}4#~>қ~r7SS~>B"d-B"d-B"h-"h-.Fwِ-lqyӈ-l1d{%vqŠ-mq}㔣-m1h&lqg6e)[\24h)[L]m1iI[\68hI[LΉ;[\ctlO#H"e'vqEI[\?8h-P}f/%[\D4hl-ox/E[\H8hm-J(٢d-J(٢d-J(ڢh-(ڢh-.o'wْ-lqy[ӈ-ld+vqŢ-mq}k㔣-mh˻+lq ge-[\_4h-[l]miM[\c8hM[l6;[\~DylѲO#h٢e[-vqEM[\l8h-Z/}3{p-O8}'l> '[ԗl9`}3-gmrZRYj9K-g,r[bYl9-g,rZRYj9K-g,r[bYl9-g,rZRYj9K-g,r[bYl9-g,rZRYj9K-g,r[bYl9-g,rZRYj9K-g,r[bYl9-g,rZRYj9K-g,r[bYl9-g,rZRYj9K-g,r[bYl9-g,rZRYj9K-g,r[bYl9-g,rZRYj9K-g,r[bYl9-g, xp'>dNxp '[O8h}Kq>d3P˹r.K-R˹r.K-R˹r.-b˹r.-R˹r.K-R˹r.K-R˹r.-b˹r.-R˹r.K-R˹r.K-R˹r.-b˹r.-R˹r.K-R˹r.K-R˹r.-b˹r.-纔w3w~gP7;ionm|Q???xƯs= ߧ~C}bw]8w8k/-/SSԘwCԘw.򾋧G_1G}]Ky'/.oxqqy6ξwSSwRCw|qyӈ/~#;/qŵȼEw^O9b '_O8/'|}Z/s}>'_|^NqťʼE*NА/~W#]e>8Ze>mky狠/.U/.U/.]/.Ϻ.]杠CiG_8eb7_O9Rf,Rf :˻/F}|q}񰍳/e/&}q}㔣/.e/.m/.V.m杠)_\~4m㈣/m}qm3|SSP߹wn[}V߹wn[}f߹wn}f߹wn}V߹wn[}V߹wn[}f߹wn}f߹wn}V߹wn[}V߹wn[}f߹wn}f߹wn}V߹wn[}V߹wn[}f߹wn}f߹wn}V߹wn[}V߹wn[}f߹wn}f߹wn}g '_O8/'|}Z|9CCxq/>gp/'_|8B}glwV;}gl;w6f;[}glwV;}gl;w6f;[}glwV;}gl;w6f;[}glwV;}gl;w6f;[}glwV;}gl;w6f;[}glwV;}gl;w6f;[}glwV;}gl;w6f;[}glwV;}gl;w6f;[}glwV;}gl;w6f; M}_>߇ M}&_>?_9cp?-\!-BZi"EPCZ i1ŐZ j1ŠSZLi1ŔZLj1Ť)-RZHi"ER/i/i/j/j%-JZ(iQԢEQKZ,iŒZ,jŢ[ZliŖZljŦ--ZZhiԢES! qg;C w3ȝ! qg;C w3ȝ! qg;C w3ȝ! qg;C w3ȝ! qg;C w3ȝ! qg;C w3ȝ! qg;C w3ȝ! qg;C w3ȝ! qg;C w3ȝ! qg;C w3ȝC9ĝC9ĝ9ȝ9ȝC9ĝC9ĝ9ȝ9ȝC9ĝC9ĝ9ȝ9ȝC9ĝC9ĝ9ȝ9ȝC9ĝC9ĝ9ȝ9ȝ+?[ [[ot[lb[n1p[n-o1u[n9)wNsʝr;9Δ;L3Δ;L3Δ;L3Δ;L3Δ;L3׷;?Qpđ'?ygH "*Z*W1ULbrH"*xi/U*J(U,bqZ*6W*ZhRv,eg);YRv,eg);YRv,eg);YRv,eg);YRv,eg);YΥ\\Υ\\Υ\\Υ\\Υ\\;a.wUEKX-6oѺE _E[ bSE[ȝr;ܹ-wns˝lΖ;lΖ;lΖ;lΖ;lΖ;[ =s'9/Z!t?=w"EHA-Zj1ŐCZ i1ŠZ j1ŔSZLi1ŤZLj"EJI-Z$Hj/i/i/j/jQҢEIE-Z(jŒKZ,iŢZ,jŖ[ZliŦZljҢEKM-Z4hiw3ĝA rg;w3ĝA rg;w3ĝA rg;w3ĝA rg;w3ĝA rg;w3ĝA rg;w3ĝA rg;w3ĝA rg;w3ĝA rg;w3ĝA rg;9ĝC9ĝC9ȝ9ȝ9ĝC9ĝC9ȝ9ȝ9ĝC9ĝC9ȝ9ȝ9ĝC9ĝC9ȝ9ȝ9ĝC9ĝC9ȝ9ȝ9~c|iqyrF~v|~x==(iQҢEIE-ZXbI%-XbQE-bK--bSM-6hiҢEKM-Z_ ZO8c~II'-BZi"EPA-bH!-bPA-bJ)-&bRI-RZHi"ERI-ĝS9ŝS9ɝ9ɝ9ŝS9ŝS9ɝ9ɝ9ŝS9ŝS9ɝ9ɝ9ŝS9ŝS9ɝ9ɝ9ŝS9ŝS9ɝ9ɝܙw3ŝILrg;ܙw3ŝILrg;ܙw3ŝILrg;ܙw3ŝILrg;ܙw3ŝILrg;ܙw3ŝILrg;ܙw3ŝILrg;ܙw3ŝILrg;ܙw3ŝILrg;ܙw3ŝILrg;yym?'h>g[ݐ*B"U bpZ*&W1*RH"V*^\ŋ(*XZ*WUlbsh*Z*,fg1;KYbv,fg1;KYbv,fg1;KYbv,fg1;KYbv,fg1;/[Rv^|qΥ\\Υ\\Υ\\Υ\\] q.}B|w~wu-M{S_3~y{/NZ(iQҢEQE-XbI%-XbQE-bK--6bSM-ZZhiҢES--O:h> '-'~IAG-BZi"EPA-bH!-bPA-bJ)-&bRI-RZHi"ERI-ĝ[ܹŝ[ܹɝܹɝܹŝ[ܹŝ[ܹɝܹɝܹŝ[ܹŝ[ܹɝܹɝܹŝ[ܹŝ[ܹɝܹɝܹŝ[ܹŝ[ܹɝܹɝwŝMlrg;wŝMlrg;wŝMlrg;wŝMlrg;wŝMlrg;wŝMlrg;wŝMlrg;wŝMlrg;wŝMlrg;wŝMlrg;[9/;sߣj>g7gf??;'Ocoi"EPA-Z i\O8j7`3oqbP {^}^p>ހ=~YI-yylxx>3g-Z [-^%-^E-^E-^ԢEI%-Z(jQbI%-XbQE-XbK--bSM-6ԢEK--Z4hj;-Bw^xA rg;Cw3ȝA rg;Cw3ȝA rg;Cw3ȝA rg;Cw3ȝA rg;Cw3ȝA rٷZ;C3oqւw3ĝ! rg;w3ĝ! rg;w3ĝ! rg;c!3oqb;[-ĝC9ĝgf?s;s;s;s;s;s;s;s;s;s;s;s;s;/;uvi^x|ƿU )*XZ*WUlbsh*ZS*B"*V1U bjS\*RH"*S99S99S99S99S9yy*Ry}.U(;Sٙdv3Lfg*;Sٙdv3Lfg*;Sٙdv3Lfg*;Sٙdv3Lfg*;Sٙdv~?~pBN!t; aSwH!uJw(aKwغZwhܡɒ'K,yɒ'K,yɒ'K,yɒ'K,yɒ'K,yrɓK\'<%O.yrɓK~~pBN>]w#Jk(ְ5,ak [kZZkh&rZO8}i 5ZCh CkZ05Laj 5֐ZCj ɭɭɭɭɭɭɭɭɭɭld+'[9VNrld+'[9VNrld+'[9VNrld+'[9VNrld+'[9VNr̯1x ?wWR~0u;Kwx;t;la;4dȓ!O<dȓ!O<dȓ!O<dȓ!O<dȓ!O<9!OyrȓC'<9!OM?Oſ z<ȺQZCi 5ְ5,ai [kZZCk 54a k>ᴆ5ZCh 5 ah CkZ05֐ZCj 5('rr*'rr*'rr*'rr*'rr*'rr*'rr*'rr*'rr*'r2Ld*'S9TNr2Ld*'S9TNr2Ld*'S9TNr2Ld*'S9TNr2Ld*'S9TNr;>w{Op.3FFK3矃!!%BJ)R"DPCJ )1ĐCJ )1ĠSJL)1ĔSJL)1Ĥ)%RJH)R"DR/)/)/)/*%%JJ()QRDQKJ,)ĒKJ,)Ģ[Jl)Ė[Jl)Ħ-%ZJh)RDS%,1f1KYbcȘ%,1f1KYbcȘ%,1f1KYbcȘ%,1f1KYbcȘ%,1f1KYbcȘ%,1f1KYbcȘ%,1f1KYbcȘ%,1f1KYbcȘ%,1f1KYbcȘ%,1f1KYbcȘKĘKĘKĘȘKĘKĘKĘȘKĘKĘKĘȘKĘKĘKĘȘKĘKĘKĘȘ|}¿}v^~z qoBoQZDiE,-biKX\"EZDkE\~zE\~zEZDhE -bhC\"1EZDjE(1s+17s+1s+17s+1s+17s+1s+17s+1s+17 ѻE ѻE4l%f31[JVb6l%f31[JVb6l%f31[JVb6l%f31[JVb6l%f+1_~nqջ |}BF{"B-"E -bhZ"1"RH-""^Zċ(-"XZ"El-bkh-"Z%f(1CLPb3 %f(1CLPb3 %f(1CLPb3 %f(1CLPb3 %f(1CLPb3J̡JJ̡JJ̡JJ̡JJ̡J ?7 ?#}}4W38%>Sn %-JZ(iQԢEQKZ,iŒZ,jŢ[ZliŖZljŦ--ZZhiԢES Z|p}A U/i9 N9j"EHA-Zj1ŐCZ i1ŠZ j1ŔSZLi1ŤZLj"EJI-Z$Hj!)II))II))II))II))IIw3ŝ)Lrg;ܙw3ŝ)Lrg;ܙw3ŝ)Lrg;ܙw3ŝ)Lrg;ܙw3ŝ)Lrg;ܙw3ŝ)Lrg;ܙw3ŝ)Lrg;ܙw3ŝ)Lrg;ܙw3ŝ)Lrg;ܙw3ŝ)Lrg;ܙn9g/㽮O^猟U}]UV\EpCZ*W1ULbrUV\Er/UWQZEiUWU,bq[Z*6WZEkUVqy(*Jy}*YRv,eg1;YRv,eg1;YRv,eg1;YRv,eg1;YRvmܭb);Oʸ[bv.eRv.fbv.eRv.fbv.eRv.fbv.eRv.fbvs؟N8 >uZ2(.e,.cqZ262h.3x?ᴌe8.#2.ch\21eL.#2H.C))[))[))[))[))mh3E)Jf6Smh3E)Jf6Smh3E)Jf6Smh3E)Jf6Smh3E)Jf6S~Vg'YԾ?!s؏g|0n)t=5o1nT#FPA5j 1Ơj 1ƠjL1ƤjL1ƤjHT#FRI5jKjƋjƋjƋj(QTFQE5j,Ƣj,ƢjlƦjlƦjhTFSM5ZjX4ĢA hE,d X4ĢA hE,d X4ĢA hE,d X4ĢA hE,d X4ĢA hE,d X4ĢA hE,d X4ĢA hE,d X4ĢA hE,d X4ĢA hE,d X4ĢA hE,d                ߨyG# }/Ż^~$8l9?z/Es\~ny>9cq/Gslc>O9c[s\v~A䭠'm!gs44'{9i9.?$~r4G-s|?Sd }Aσ[g>'s|^Nxq4RCZjH i!-6ņؐbCZlH i!-6ņؐRCZjH i!-6ņؐbCZlH i!-6ņؐRCZjH i!-6ņؐbCZlH i!-6ņؐRCZjH i!-6ņؐbCZlH i!-6ņؐRCZjH i!-6ņؐbCZlH i!-6ņؐRCZjH i!-6ņؐbCZlH i!-6ņؐRCZjH i!-6ņؐbCZlH i!-6ņؐRCZjH i!-6ņؐbCZlH i!-6ņؐRCZjH i!-6ņؐbCZlH i!-6ņؐ~9d }A[ACxq2猃3Nxq2猃9>g>'s|^Nxq4ҥt!]lHņt!]lHņt!]lHņt!]lHҥt!]lHņt!]lHņt!]lHņt!]lHҥt!]lHņt!]lHņt!]lHņt!]lHҥt!]lHņt!]lHņt!]lHņt!]lHץ3ydw۵S۽^ )??uǥ}2~~Hv}Kqʿg)wۥ}攟%w\;E4S4S6{9ڀ޹Kkz{TSTSV{9Z޹c y y}nNk;oz@q@q@rtǵsǦ;.;.;.%;.3ܮ%蝢שR>O9R>O9Z>k z玦;.%;.%;`<}s{`~^)'w8sA'w|;gyi%>'w\j;wqA R>O9R>O9Z>k z玠;.5;.5;.=;.ܮ=蝢B҃>O9҃>O9ڃ>kzAw\z)Gw\z)Gw\;w\z];E/}rtǥ}rtǵ}"SS4w<s6w^^~KgܡՕ6fWJ]i+mvٕͮ6fWJ]i+mvՕ6fWJ]i+mvٕͮ6fWJ]i+mvՕ6fWJ]i+mvٕͮ6fWJ]i+mvՕ6fWJ]i+mvٕͮ6fWJ]i+mvՕ6fWJ]i+mvٕͮ6fWJ]i+mvՕ6fWJ]i+mvٕͮ6fWJ]i+mvՕ6fWJ]i+mvٕͮ6fWJ]i+mvՕ6fWJ]i+mvٕͮ6fWJ]i+mvՕ6fWJ]i+mvٕͮ6fWJ]i+mu}5}5})#(GPA9r1$Ǡr 1(Ǡr 1%ǤrL1)ǤrLʑ#)GRI9r$H////Q(GQE9r(ʱ$Ǣr,ʱ(Ǣr,ʱ%Ǧrlʱ)Ǧrlђ)GSM9r4h 4HA* RiJT 4HA* RiJT 4HA* RiJT 4HA* RiJT 4HA* RiJT 4HA* RiJT 4HA* RiJT 4HA* RiJT 4HA* RiJT 4HA* RiJT:DT:HT:HT:HT:DT:HT:HT:HT:DT:HT:HT:HT:DT:HT:HT:HT:DT:HT:HT:HT:./G ߿#߿3>g N_%rŽ_%364ҜUrQGE{QGE{QGE{QGE{\^$rg뷝>E{,")G{,cy^XǢ=/yrǢ=qyȝ=_w6iDiM{U"O{9cJqشe"w~kڣiDѴGy^hڣiDѴG _猃3}q猃=>gp3N)'{|8|p3Nxq N9#d=#h=#h=#h=J;{\z cWgp3=g9SPklMi5M4ٚ&[dklMi5M4ٚ&[TklMi5M4ٚ&[dklMi5M4ٚ&[TklMi5M4ٚ&[dklMi5M4ٚ&[TklMi5M4ٚ&[dklMi5M4ٚ&[TklMi5M4ٚ&[dklMi5M4ٚ&[TklMi5M4ٚ&[dklMi5M4ٚ&[TklMi5M4ٚ&[dklMi5M4ٚ&[TklMi5M4ٚ&[dklMi5M4ٚ&[TklMi5M4ٚ&[dklMi5M4ٚ&[ӿ猟|r3~r}18ewx19e,FŽ,NsϔO}FsJs/)ӿǵGVNӠ?.?.?^wҊ>O9Ҋ>N9ZOZi:FqEwk/z?oyrǥ}r6򴗣??&q}㔣?.㔳???K蝦I\78K1O9?oynuqnqr}rrNM\;8K9'|8}38}3qg9{9?؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-t}3猃3Nxq猃?g9?g9O}3?8b؟.b؟.b؟.b؟.b؟.b؟.b؟.b؟.b؟.b؟.b؟.b؟.b؟.b؟.b؟.b؟.ڎ޼6k]ϛZkyڬu-o^h޼6k]ŧ)YGQE=z(QcQE=XcQE=XcSM=6cSM=6ԣGSM=z4hcI'=g_cI%=_#GPA=zcPA=cPA=cRI=&cRI=&#GRI=z$Hԃ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ŧ?|s?hݞ?Ȼ3c=H{x=X=6y=Z4ӠO> 4ӠO> 4ӠO> 4ӠO> 4ӠO>O}:AtЧ>Oۧz<ʑOg3>SnJquQ\:ױulcs\Gsu4Z:>g1u\Gpu cp\:&1u$ב\Gru0O't2O't2O't2O't2O't2O't2O't2O't2O't2O'4]O}E.tѧ>]t79o3~x{l/x3UԣGQE=z(걨Ǣz,걨Ǣz,걩Ǧzl걩ǦzlԣGSM=z4hA=>:sa/3Nz|=z|~Au#GPA=zcPA=cPA=cRI=&cRI=&#GRI=z$Hԃ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧ|ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ŧu=~_=>g{߽ݍ{y{ghzGPA=z#Ǡz 1Ǡz 1ǤzL1ǤzL1GRI=z$H#NjzNjzNjzNjzGQE=z(QԣǢz,걨Ǣz,걨Ǧzl걩Ǧzl걩GSM=z4hԣGO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA>                    IG7%)'=owS(:ױu,cs\:h:O:[:O:z>㸎:#u cp\:&1:H#dNdNdNdNdNdNdNdNdNd^ttd^t|qd&4-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|ZE>]E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]o[?gv/zy_H|[x~{D[=z(QԣGQz3z}}"=z,z3z}}"=zlz3z}}"=z4{D;=>g_sa/'?g#GPA=zcPA=cPA=cRI=&cRI=&H#GRI=z$ n&n&n&n&n&n&n&n&n&n&n&n&n&n&n&n&n&n&n&nwz4ɧM>>'=|o 6ɧ'?ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧ'A>miOO$QiO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO+~~_a:븛\Gpu1u cp\:&ב\Gru$:^\NjxquQ\GqX\:ױulcsu4\Gk'ޭ#ק>q^4< i0Oy`4< i0Oy`4< i0Oy`4< i0Oy`4< w8y:y:y:y:y:y:y:y:y}/?tp<|:ܧ},Q8G(SuPqT*RQqjtjG@WG:^[kuvkxm~^Gqvky6ڣWyj}G_W}U}G_W}U}G_W}U}G_W}U}G_W}U}_tsys8Oq>L<}bOoL8g].us9YȺ8g].us9YȺ8g].us9YȺ8g].us9YȺ8g].us9YȺqκqκȺqκqκȺqκqκȺqκqκȺqκqκȺ[\Vٺp:_p>_qy/usqp<_>qy/O\~v݄ugMn]7yv݄캄캄캄캄캄캄캄캄캄캄~߇6V?鬾vp<_>qy/O\:_up:_p>_qy/uv]uuv]uuv]uuv]uuv]uuv]uuv]uuv]uuv]uuv]u׭\ή[p:nu׭߶̺'V?o5~7Y /_1c}y?0b2&`1"`?2&` M2!`?AjQ D+EcbHQ?72ÿ 7o 7oe\/}Oo>#ѧ}a7 o}Ͼ/W_B +W_B +W_F5k_Fz=D~?_O^om~"yQzq>=/|rq_I~`XV??V?~`C㋆ݟXXX_M????'zZ;=㍐;^_OOoަw[՟X՟X՟Z_=]B<.O~b~6'V?O~bS[ڧI[<`?XVwoӻip'y~zVA+~a _X?!xm _XV_=< ?xZ_X_X_Z?qyZ<;zooM?~?'{OwlU07VVo~cX aQϫՏV?~`XV?~h///////////////B////////////////B//////////{Y_Y߹-/////B////////////////BoY߸qg}o 7X`}o 7{}~`XV?~`Z;y,ʓxO;p?p'{m⼷n=[M?@az/z뿰?nw[@@m6 Ha~C4<[=DzoOVm"o ^'{X]O;?''{m⽷n=[Mw7oM 7&oM 7w7oM 7&oM 7w7oM 7&oM 7w7oM 7&oM 7w7oM 7&oM 7;;KKKKKKK2?{^?`Z__%_%_%_%_%_%____%_%_%_%_%_%____%_%_%_%_%_%____%_%_%_%_%_%____%_%_%_%_%_%____%_%_%_%_%_%____%_%_%_%_%_%____%_%_%_%_%_%_qF{^_J r '`??Oq``??0h>Ob'柘b'柘j?`0__a_i>/a _ߘ71ok}c7ߘc7_WWWWG+B;N~?_!__!_!_!_)=_!_!_!__!_!_!_)=_!_!_!__!_!_!_)? J JoB[ o!-俅=-俅B[KoB[ o!-俅=-俅B[KoB[ o!-俅/^h?? \ֱ[z|o_e/ğnނ7`8~P;??s@;ֿ怂 8vyꀒJXw,8` Xp,8` Xp䀟;?8˃Bps7l8`/9`8vy-l98~P ??s@ ׿怆8vyꀖ?w}[ \8`;ؿ‿򡾋7|.8 8 8 B9 qw0 8`p0 9`Cp쟟9`8vpWL9`?wpۃB $ph $ph2H8RH97`Lp n0 &7`Lp n1-&Lp n0 &7`Lp n0 &b7`Lp n0 &7`Lp n1-&Lp n0 &7`Lp n0 &b7`Lp n0 &7`Lp n1-&w&` &` &` &` &` &` &b-&bwp@p@p@!r 6` 6` 6` 6` 6` 6` ` `ߙ` 6` 6` 6` 6` 6` 6` ` 6` 6` 6` 6` 6` 6` ` `ߙ` 6` 6` 6` 6` 6` 6` ` 6` 6` 6` 6` 6` 6` ` `ߙ` 6` 6` 6` 6` 6` 6` ` 6` 6` 6` 6` 6` 6` ` `ߙ` 6` 6` 6` 6` 6` 6` ` Ŀ,u{$o w ^r%e{VK?S5~@<@<@<@!<<0={~<wzoSz@8^}@k8so8߃&x`?ny@o\=p )^=p@[*=ht@5'78?![}7{ pߦxO__o|~ԗ{_>?|~>>'>'>'>om6Fom6Fom}??_^~/?t?le 4L0A?3}>}p3A-4L0~1`>wcSݻ ^?/&{ouw3 ~Pf7\LuL0AL0AL0A!L2A&ēH&0 L0` W(O&0 L0d! lL{'&Lp 0 L`&;L0ac%2 L0e?z2/DJBa $L0A? 6 &8yZ” R&H e b8A '1 pN b8A 1"SpN b8A '1 pN b8A 1"SpN b8A '1 pN b8A 1"SpN b8A '1 pN b8A 1"SpN b8A '1 pN b8A 1"Sp&a&a&a&a&a&aaaAb & ` ޳ & ` B& d B&1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1L1LAs[ /Em׿-'|;&W~":@#/e\pA\pA\pA!\rA!L.8*`/\p0 '||+ꂃ ps&yu\pl' )P ( o}pq_Goࠂ.86xP~*|pA?n.Qt7\\pPn.8$.8 UT:*X?L/\p`|Xm~7X ,:||p̓J|Xc#)\ . ~r\pp.87\mW` .8*./\p,'||+ ps&yuA\plAVa|y悃 >`?n.8[Wdu 26ɫ 4c˭4ǦS<7h Do@o^]pn.8$o.(;,;,;,;,;,;,;,;\pA\pA\rA!\raaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa.v;\` p.v;\bKp=₀ . . B. 䂐 B.p.v;\` p.%v;\b p.v;\` p.%v;\b p.v;\` p.%v;\b瑽ϔ{6m >G68*ރLlpnlpl2 J6(m J6(` 6X l`,`K6X ld%,x2m`la [j-lm leco=԰A&lаA&/ڠe MF٠e 1@1@1@1@1DC1DC1DC1D#` 6 ` 6 ` B6 d B61@1@1@1@1DC1DC1DC1D1@1@1@1@1DC1DC1DC1D1@1@1@1@1DC1DC1DC1D1@1@1@1@1DC1DC1DC1D1@1@1@1@1DC1DC1DC1D1@1@1@1@1DC1DC1DC1D1@1@1@1@1DC1DC1DC1D1@1@1@1@1DC1DC1DC1D(Eq"P8@(ECq"Q!8DGlAlA!lA!l(Eq"P8@(ECq"Q!8D(Eq"P8@(ECq"Q!8D(Eq"P8@(ECq"Q!8DA lp A ?׿}`\As {e%|+1{ Vm/i~LL?? |P>80[Wp _y |>N'|N6NV'|惃N>xA>ν>>8@[W{p _yA |p A ֱso>8H>8w)|+sn>8H4/>*ylz[y>/`ěN惀> > B> 䃐B> >`,|XXmWīX:,|-|ԃL-|X 8Ox惃N>A>c9|p$|p2\V9o#|pi|8'xO 샀B> 䃐B> 䃐<1<1<1<1S<1S<1S<1S<1<1<1<1<1S<1S<1S<1S<1<1<1<1<1S<1S<1S<1S<1<1<1<1<1S<1S<1S<1S<1<1<1<1<1S<1S<1S<1S<1<1<1<1<1S<1S<1S<1S<1<1<1<1<1S<1S<1S<1S<1<1<1<1<1S<1S<1S<1SP4Kl 5@c}G 00L  5 'n9qÉ[Np7Ć[Nl8Ć[Nl8Ć[Nl8Ć[Nl8Ć[Nl8wkz|oFz<*U` *` * QAT > > *(UP` *X` *تQAV =1C=1=1C=1=1C=1=1C=1=1C=1=1C=1=1C=1=1C=1=1C=1=1C=1z@OC=q'ġ8z@OC=q'ġ8z@OC=qy{X`c4? 0@h`j)'N8qʉNr8)'&rb‰)'&rb‰)'&rb‰)'&rb‰)'&rb‰)'~~B׿ _0>!PAP *` &*` $*HU > >PAR *X` 6*ب` 4*hUШ =K= =K= =K= =K= =K= =K= =K= =K= =K= =K=q'.ĥzBO\K=q'.ĥzBO\K=q'.ĥϞq__uqߵu̷ F}OQРAA% J4(i ,hK,ilh[liРAC- Z4hh5>\h@|  4h AH! 4`@ 4`H! &4`B 4`J) $4Hh AJ) 7rFNȉ[9q+'nĭ7rFNȉ[9q+'nĭ7rFNȉ[9q+'nĭ7rFNȉ[9q+'nĭ7rFNȉ[9q+'nĭȉȉʉʉȉȉʉʉȉȉʉʉȉȉʉʉȉȉʉʉȉȉʉʉȉȉʉʉȉȉʉʉȉȉʉʉȉȉʉʉ 9=>|ỂOT TA *` &*`D R***(TPTA *X` 6*ت`F Z4*@O PO<^|=|K艁ꉡ艁ꉡ艁ꉡ艁ꉡ艁ꉡ艁ꉡ艁ꉡ艁ꉡ8zPO O'?p=q'ġ8zPO=q'ġ~j^PO K J*X` *ب` *hTШUAoW0+z G*T T@ U0TDLU0UAD R'Nĩ8'zDOS=q'Nĩ8'zDOS=q'Nĩ8=1S=1=1S=1=1S=1=1S=1=1S=1=1S=1=1S=1=1S=1=1S=1=1S=1?oi~}~}uK__}]׷D[7o ~}}?D@ 4i  h0C i0Lh0SLi0AB 4Hi ||G|G|AA 4(iPҠ ,hK,ilh[liAC 4hiҠA!'rb!'rb)'rb)'rb!'rb!'rb)'rb)'rb!'rb!'rb)'rb)'rb!'rb!'rb)'rb)'rb!'rb!'rb)'rb)'rb!'rb!'rb)'rb)'rb!'rb!'rb)'rb)'rb!'rb!'rb)'rb)'rb!'rb!'rb)'rb)'rb!'rb!'rb)'rb)'rBN\ȉ 9q!'.ĥrBN\ȉ 9q!'.ĥrBN\ȉ 9q!'.ĥrBN\ȉ 9q!'.ĥrBN\ȉ 9q!'.ĥrⱗϜs#U *(UPBK,UQF[lUШQAFJ? ^oU PAP T0TPLT0UT *HUzVO=q'nčzVO=q'nčzVOlFOlVO|9r/q>G{soy> *U0P@C U0QDSLU QATTAUQ *(UPBK,UQF[lUШQAFX艥XꉅX艥XꉅX艥XꉅX艥XꉅX艥XꉅX艥XꉅX艥XꉅX艥XꉅX艥XꉅX艥X =q'.ĥzRO\ =q'.ĥzRO\ =q'.ĥ~ROd>]Wg ~^WmryDvX|T_o#Ta~g?X~2d]B`=LA7#P2^pRǏ_Gdp`#d8>aKFX2,Fa?dz><6D{z7#lao3<ƫW^Ga[Fœ 3a[/ߌ0Bk o3<ƫ7M^GeϗYIi<^a!5)e/F{aof}Rxunx7 #0B#0B!#2B!#2B!# aF0€0`!# aCF20d!#|ǯdyB;E>Lx&0e^pR[#܌0e)#|OdyBe>LxFHxSmW#x527#2Y dq,n EY"[dq,n-E7Y dq,n EY"[dq,n-E7Y dq,n EY"[dq,n-E7Y dq,n EY"[dq,n-E7Y dq,n EY"[dq,n-EdAdAdAdE[dE[dE[dE[dE#0B#_g#2B!#2B!# "-"-"-"-" "-"-"-"-" "-"-"-"-" "-"-"-"-" "-"-"-"-" "-"-"-"-" "-"-"-"-" "-"-"-"- ρ9ikkuq4uÿ~Ίew|/^י{'JkM(ߍؚ?:#䌐3B9#䌐3:#茠3:#茠3:》OrƁu`|1>9cd|f|4quƁg{uAqlA3=Wg8L8~ꌃ||rƱ^|Zן/?o#\q'g4qיޝqJ8Wg}7ghhhhhhhh@۫3B9#䌐3B:#茠3:#茠3:# 1 1 1 2  2  2  2  2  1 1 1 2  2  2  2  2  1 1 1 2  2  2  2  2  1 1 1 2  2  2  2  2  1 1 1 2  2  2  2  2  1 1 1 2  2  2  2  2  1 1 1 2  2  2  2  2  1 1 1 2  2  2  2  2 bC t1!:@ d t2A:@ !grF!gtFAgtFAgtFbC t1!:@ d t2A:@ bC t1!:@ d t2A:@ bC t1!:@ d t2A:@ uB _7[(NI俎IwǷA\wIwGI%1b(Q(ƒKb,(Ƣb,(Ɩ[bl)Ʀbl)FK-1b4h%11@Gb?cĘ(FH!1b#(ƐCb 1(Ơb 1(ƔSbL1)ƤbL1)FJ)1b$H#)TJ t2N&:@TJ t2N&:@TJ t2N&:@TJ t2N&:@TJ t2N&:@S 4@S 4@ 4@ 4@S 4@S 4@ 4@ 4@S 4@S 4@ 4@ 4@S 4@S 4@ 4@ 4@S 4@S 4@ 4@ 4@S 4@S 4@ 4@ 4@S 4@S 4@ 4@ 4@S 4@S 4@ 4@ 4@S 4@S 4@ 4@ 4@S 4@S 4@ 4@ 4@?I_/~_)=|7\r]o߆?6Xo>oSyuL:~F!kFAkFAkFAk1d!k YcCƠ51hAk ZcƠ5qdJOzMYc/#ܭ1iIkdMnIkLZ<+u5&1iČ'kTz+e5S3^F[#i5Γ3ަzFIkgqFIkghyWk|hqd}'J(YYxIv>-nI/CxuzOyR۫7%oiaqη!8q7q׹޽qJ8pWo}Wo Ozia?u q;󼎷޽qJ8xꍃwx>yx?Ix>-lsbwoMo'vxWzybWo}7ox>xc6=otϙ/C\Owܼ3;z>{7o̎1n|!oFAoFAoFAoF|Ɛ7C8wo8\8{Wo}7>۫7cw'S;^{ㄞOޘyr\8{Wo'wq=g{A=qlA=69e7N䍤7γ;zA=+z۫7E⢛\tnrM.E7&䢛\tnrM.E⢛\tnrM.E7&䢛\tnrM.E⢛\tnrM.E7&䢛\tnrM.E⢛\tnrM.E7&䢛\tnrM.E⢛\tnrM.E7&䢛\tnrM.-.-.M.M.M.M.M.M.!oFAooFAoFAo!.-.M.M.M.M.M.M.-.-.M.M.M.M.M.M.-.-.M.M.M.M.M.M.-.-.M.M.M.M.M.M.-.-.M.M.M.M.M.M.-.-.M.M.M.M.M.M.-.-.M.M.M.M.M.M.-.-.M.M.M.M.M.M.ϚGIzǿU}4}}z[߇M?FHA5jTcH!5TcPA5TcJ)5&՘TcRI5&՘T#FJI5j$HT#5>RC5>TC5>TC5>TFIE5j(QTcI%5XTcQE5XTcK-56TcSM56TFKM5j4hR#ECY4EY4EY4EY4ECY4EY4EY4EY4ECY4EY4EY4EY4ECY4EY4EY4EY4ECY4EY4EY4EY4ECY4EY4EY4EY4ECY4EY4EY4EY4ECY4EY4EY4EY4ECY4EY4EY4EY4ECY4EY4EY4EYt(e,:E`̢Yt(e,:E`̢Yt(e,:E`̢Yt(e,:E`̢Yt(e,:E`̢Yt猎!_ow|>$_|>}Jb2e,XbelYfeh,U2[︖*#XF`Ce 1X`SeL1Yd2e$H.:E'dꢓ]tNvѩ.:E'dꢓ]tNvѩ.:E'dMudMvdMudMvdMudMvdMudMvdMudMvdMudMvdMudMvdMudMvdMudMvdMudMvd~oßmwˇD}[?i;}R#FPA5j1Ɛj 1Ơj 1ƔjL1ƤjLR#FRI5j$HQRFQE5j(ƒj,Ƣj,ƖjlƦjlRFSM5j4hQʢ,Z̢,Z̢,Z̢,Zʢ,Z̢,Z̢,Z̢,Zʢ,Z̢,Z̢,Z̢,Zʢ,Z̢,Z̢,Z̢,Zʢ,Z̢,Z̢,Z̢,Zʢ,Z̢,Z̢,Z̢,Zʢ,Z̢,Z̢,Z̢,Zʢ,Z̢,Z̢,Z̢,Zʢ,Z̢,Z̢,Z̢,Zʢ,Z̢,Z̢,Z̢,Eb]̢Yt1.f,Eb]̢Yt1.f,Eb]̢Yt1.f,Eb]̢Yt1.f,Eb]̢Yt1.f,~Fͧ/$ZGL|k!KU*XFbKe,Xb[elYf2e4hGe?*ca2e1T`e 1UdeL*#YFdꢛ]tnvѭ.E7fꢛ]tnvѭ.E7fꢛ]tnvVmvfmvVmvfmvVmvfmvVmvfmvVmvfmvVmvfmvVmvfmvVmvfmvVmvfmvVmvfmuOvM; ~]-ǟ@ߛ~wc u)MS~o$u_'߿ro}+aï;6[{&lw5G!s4GAs4GAs4GAs1dY>5dAs 䞯c\1hAs4Ǡ9N>Rƣ9ה93Az:4zd4q&/q5Ǥ9&UGsDI9CAz:Is$q:ٻ98y\բ1H#i/0=ɓ^<iKRc\9>4*dǩ {>Cs|oo*<ikc\Q4G rhXDž=^{j9X2ǒ9̱hEs,cX4Ǣ9ͱhEs,c 9_f=e`yq5Ǧ96qL:ٻ96q +c\ͱiMs|1՞j<i˷c\4G+idDž=^$~j9Z!  !  !  !  !  !  !  !ϖWs2GAs4GAs4GAs4G"!B"AB$AB$AB$AB$AB$AB$AB"!B"AB$AB$AB$AB$AB$AB$AB"!B"AB$AB$AB$AB$AB$AB$AB"!B"AB$AB$AB$AB$AB$AB$AB"!B"AB$AB$AB$AB$AB$AB$AB"!B"AB$AB$AB$AB$AB$AB$AB"!B"AB$AB$AB$AB$AB$AB$AB"!B"AB$AB$AB$AB$AB$AB$AB:DH!$tAB:HH !$tABF#d9#h9#h9#h9DH!$tAB:HH !$tAB:DH!$tAB:HH !$tAB:DH!$tAB:HH !$tAB:dc?'NOs=Umk䎿w|ʓ^}d8{zZow1w:tA@qI@V莃ꎃWzuA@Ǹ ﳽ@OXrlj@Vv'}>c}}quǁ@g{u@q@Vc}}ꎃqu@g{uAqg AV<~i'}>WzuAǸ〠ﳽcAyRЇqs'}yRw|qq<(lo}yP1n}!wtGAwtGAwtGAwtG}rǐ;N89Ww88l88{Ww};>۫;c?'NOs=AWw 8@l8@{Ww };>۫;c'NqOs=IWw$Iw$}Ww$ҫ;> }bStNIV:J'Y$+dtNIV:J'Y$+bStNIV:J'Y$+dtNIV:J'Y$+bStNIV:J'Y$+dtNIV:J'Y$+bStNIV:J'Y$+dtNIV:J'Y$+bStNIV:J'Y$+dtNIV:J'Y$+M+M$+M$+M$+M$+M$+M$+M$+͐;B#莠;;#莠;#莠;+M$+M$+M$+M$+M$+M$+M$+M+M$+M$+M$+M$+M$+M$+M$+M+M$+M$+M$+M$+M$+M$+M$+M+M$+M$+M$+M$+M$+M$+M$+M+M$+M$+M$+M$+M$+M$+M$+M+M$+M$+M$+M$+M$+M$+M$+M+M$+M$+M$+M$+M$+M$+M$+M+M$+M$+M$+M$+M$+M$+M$+MρB.}pw[OO~O; #(GPA9rcPA9cPA9嘒cRI9&嘔cRI9&Hɑ#)GRI9r$HPPP(Q(GQE9rXcQE9XcQE9ؒcSM96ؔcSM96hє)GSM9r(b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*-b*]Jt1.TJSb*]Jt1.TJSb*]Jt1.TJSb*]Jt1.TJSb*]Jt1.TJSb*]!"_JN}qFtywc yls|V7u_w\&81nbwD^g{;nb}':_w\u!{GA{GA{GA{GCǠ=1hA{ cǠ=1hA{ cǡ"O8}lCEƸc8yyW{LcDZ"O8_},i=X1H#iX^푴G"c\푴GtnRMjIM7&5ݤtnRMjIM7&5ݢtnRMjIM7&5ݤtnRMjIM7&5ݢtnRMjIM7&5ݤtnRMjIM7&5ݢtnRMjIM7&5ݤtnRMjIM7&5ݢtnRMjIM7&5ݤtnRMjIM7&5mQ&5mR&5mR&5mR&5mR&5mR&5mR&5mR&5=#h==#h=#h=5mR&5mR&5mR&5mR&5mR&5mR&5mR&5mR5mR&5mR&5mR&5mR&5mR&5mR&5mR&5mR5mR&5mR&5mR&5mR&5mR&5mR&5mR&5mR5mR&5mR&5mR&5mR&5mR&5mR&5mR&5mR5mR&5mR&5mR&5mR&5mR&5mR&5mR&5mR5mR&5mR&5mR&5mR&5mR&5mR&5mR&5mR5mR&5mR&5mR&5mR&5mR&5mR&5mR&5mR5mR&5mR&5mR&5mR&5mR&5mR&5mR&5mQ焢}l+}ǿu_wYmZ6ƿ;?b_wYu߯=V~T+nclv|?#菠?#菠?#菠?#菠?N,AXimqb18?q`^q`J8WXuw\[O\im'?qE1^qpJ8Oyꏃ>|-I>msW`I獼WzyW`uwdQOdim?86'}LJ8Oy}đ18l8?;?gqljFQyl8{WgqǁF_g{F菓>?N6:'}Ǣ?6>۫?6^}ꏃ>pI>?ܑ18?6q;:۫?8^#c\qq';=)vѧmNyꏓ>^qJ8Oyꏃ ? ? ? ? ? ? ? ? #菠?#菠?#菠?#菠? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? A~:O ?䧃tA~:O ?䧃tGAGAGAGAA~:O ?䧃tA~:O ?䧃tA~:O ?䧃tA~:O ?䧃tA~:O ?䧃tA~:O ?䧃tqf}omuǿ{ߺ>6>6oMu?͚GQE=z(QcQE=XcQE=XcSM=6cSM=6ԣGSM=z4hc#=1HGz?#GPA=zcPA=cPA=cRI=&cRI=&#GRI=z$Hԃt2N|:O'd>̧t2N|:O'd>̧t2N|:O'd>̧t2N|:O'd>̧t2N|:O'd>̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧?s;w 1yG(ޱx;5-jZԴiQӢEM5]tQEM5]tz#̧;cXcq16hP︎#8cL19FrO7}Mntӧ>O>mӦO>mӦO>mӦO>mӦO>mӖO>+w 1yG(ޱx;5 j4iPӠAM5tPAM5tH_;cXcq16hccp1&ǘ#9Fr tҧ>O'}:INtҧI&}iҧI&}iҧI&}iҧI&}iҧI&}iҧÅ1OO#XG`u 1X`uL1Yd:u$HaaQXGbu,ֱXbulֱYf:u4hQ~Z~Z~Z~Z~Z~Z~Z~Z~Z~Z~Z~Z~Z~Z~Z~Z~Z~Z~Z~Ob?]짋t.~Ob?]짋t.~Ob?]11Xcs1c8}c1c 18c$HAntӧ>O7}MnӦO>mӦO>mӦO>mӦO>mӦO>m ox_>w1c 18c$HQ8cl9FsA}iЧA}iЧA}iЧA}iЧA}iЧ>O}:AtЧ>8\k/>XGb:Xc:6جc:u4hѪcQ{ǭ;nu#X`u 1XduL1YGd:uN~:O'd?짓tN~:O'd?짓tN~:O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O_=¯;x18cL#9Ƈc|8Fqc,91Zc}ZiѧE}ZiѧE}ZiѧE}ZiѧE}ZiѧE.tѧ>]O}E.tѧ=}zNk(8cl51q#8Fp1ǘcr1Mntӧ>O7}M6}iӧM6}iӧM6}iӧM6}iӧM6}iӧ-֟eȷ;w|):u1X`u 1YduL֑#YGdaa:u(ֱXbu,ֱYfulѬYGV~~~sgOa? `? `? `? `? `? `? `? `? `? `? `? `? `? `? `? `? ~:O`??wy~:O`?짃t~:O`?C{ņ~uu1qc꽓;c18zzO'}:INtҧ>O>M4ӤO>M4ӤO>M4ӤO>M4ӤO>M4ӤO?~ݒvh7׹[_w|S1E~{;>aA=z#GPA=cPA=cPI=&cRI=&cRI=z$H#GRPPPPE=z(QԣGQE=XcQE=XcQM=6cSM=6cSM=z4hԣGKb>-b>-b>-b>-ӟ'|Z̧.xsa>-b>-b>-b>-b>-b>-b>-b>-b>-b>-b>-b>-b>-b>-b>-b>-b>-b>-b>-b>-b>-b>-ӟ|Z̧箑sa>-b>-b>-b>-b>-b>-b>-b>-b>-b>-|Ob>]̧t1.ӟ|O]E|Ob>y̧q.̧t1.|Ob>]̧t1.|Ob>]̧t1.G=ߠ=q4mǹ}x{.Oz?QԣGQE=z(걨Ǣz,걨Ǣz,걩Ǧzl걩ǦzlԣGSM=z4hqǹ8~#=Hw\#GPA=zcPA=cPA=cRI=&cRI=&H#GRI=z$`>̧t3n|O7f>̧t3n|O7f>̧t3n|O7f>̧t3n|O7f>̧t3n|O7i36i36i36i36i3f<|z8f>mf>mG=O3B|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|zy>\OOOOOOOOOO[t;=K}s^NGwSuc:c:&똬#YGd:>:>:u(Qc:Xc:6جYGf:4O4Oϝ`?=w:zZiiiiiiiiiiiiiiii~:OcNGw\`?짃t~:O`?짃tWć+MS&6oӯ;\~]}-E=z(QԣGQz,걨Ǣz,걨Ǣzl걩Ǧzl걩ǦM=z4hԣGS8O|͋iOs#=q뎛A=z#GPz 1Ǡz 1ǠzL1ǤzL1ǤI=z$H#GŖt2N|:O'd>̧t2N|:O'd>̧t2N|:O'd>̧t2N|:O'd>̧t2N|:O'd>Md>Md>Md>Md>MG=OS|̧|̧|zy\O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4O4OS`>=O- i2&i2&i2&i2&i2&i2&i2&i2&i2&i2;?q&HOs9ϛ˹#[{{Oz|A=z#GPz 1Ǡz 1ǠzL1ǤzL1ǤI=z$H#GRE=z(QԣGQz,걨Ǣz,걨Ǣzl걩Ǧzl걩ǦM=z4hԣGS|Z̧|Z̧|Z̧|Z̧z0i1;qՃOOOOOOOOOOOOOOOOOOOOO`>-b>=w$i1i1i1i1i1i1i1i1i1.|Ob>]̧t1;?|O#W=O#̧t1;qՃt1.|Ob>]̧t1.|Ob>]̧t1;?lֹ:>XGb:Xc:6جc:u4hѪGu4_#XG`u 1X`uL1Yd:u$H~O7f?짛tn~O7f?짛tn~O7f?mf?mf?=w}rǭf?mf?mf?mf?mf?mf?mf?mf?mf?mf?mf?mf?mf?mf?mf?mV?snxc}J>#8cL19Fr1c,8c4hiЧA}iЧA}iЧA}iЧA}iЧA}:AtЧ>O}:Aco+xq;ӧq_w\(ֱXbu,ֱYvZf:s:Zu?cj縯;nu|q#XG`:c:&q_w\똬#YvZG~:O'd?짓tN~:O'd?짓tN~:O'i&i&i&i&i&i&i&i&i&i&i&i&i&i&i&i&i&i&i&i&O}^'8Fp1ǘcr1>1cXcq16hӢO>-ӢO>-ӢO>-ӢO>-ӢO>-tѧ>]O}E.tѧ>]~>ߋT}/c|J^E=zhϝ;nz(QԣǢz,걨Ǣz,걨Ǧzhϝ;nzl걩Ǧz4h=wԣGS֞w\#=A=z#GPz 1Ǡz 1ǠzL=!1ǤzL#GRI=z0n|O7f>̧t3n|O7f>̧t3n|O7f>̧t3n|O7f>̧t3n|O7f>̧OOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO[A;[;=;.{f|=1u>}ǷOz#GPA=z 1Ǡz 1ǠzL1ǤzL1GRs뎫I=z$H=!QԣGQE=z,걨Ǣz,걨Ǣzl걩Ǧzl걩GS뎫M=z4ḩ|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|:O`>̧t0|:O`>̧t0|:O`>̧t0|:O`>̧t0|:O`>̧t0|zt.]u<}JNGw\Xc:جCF:uh>w:zVǹSS:uc:cNGw\H֡]xk짓tN~:O'd?짓tN~:O'd?짓tNd?Md?Ms:Oϝ~~~~~~~~~~~~~~~~짟󝑇+?uz78)o}<]u-GPA=zcPA=cPA=cRI=&cRI=&#GRI=z$HC=>C=>C=>C=>ԣGQE=z(QcQE=XcQE=XcSM=6cSM=6ԣGSM=z4hңOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOt1.|Ob>]̧t1.|Ob>]̧t1.|Ob>]̧t1.|Ob>]̧t1.|Ob>]ܑ̧Q{'=8觹ﻵ1{E=z(QԣGQz,걨Ǣz,걨Ǣzl걩Ǧzl걩ǦM=z4hԣGSOz?c_w\8w$#=s]A=z#GPA=cPA=cPI=&cRI=&cRI=z$H#GR|O7f>̧t3n|O7f>̧t3n|O7f>̧t3n|O7f>̧t3n|O7f>̧t36i36i36i36i3;?|̧|zH>Uf>=w$ԃOܑ}̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|̧|zHi36#W=OOOOOOOOOl~}wwO #XG:c:&똬cd:u$(QXG:Xc:6جcf:u`? `?=w}u{~~~~~~~~~~~~~~~~:O`?Nu$qt~:O`?짃tqg6ϟvq.vn]wUWS\Rq*ZVVոj"֟WWڟٺ>Ϯ>g+|}?Wߟq}v\gy}6٫Wyռj^}2ƛa6meHb7_7X|zgۤlj}ھZm_VWjj}ھZm_VWjj}ھZm_VWןyhl^njuW*۬*۬*۬*۬*۬vnmVjY?+/W~-w9;gywww>Oj\흫sw>g?.sw9;Σ<;γ<;Ϋ; ;-Nϰ3 ;-Nϰ3 ;-Nϰ3 ;-Nϰ3 ;-Nϰ3ZU˰V=êeX a3ZU˰V=êeX a3ZU˰V=êeX a3ZU˰V=êeX a3ZU˰V=êeX a3,^[\~.]?ݣ{w=p}wg}w_W/~wp w=qw}w?OܽWݫ{uX=g]uEϺY`]uѳ.zX`]uX=g]uEϺY`]uѳ.zX`]uX=g]u֍ugX7z֍u`Y7z nugY7֍ugXM?[p=?O|O^W?>?ğﺉ}Mtnfu]7wB׭n]uﺅ[}-tnVu ][wB׭j9z_zs}>}?כ\nfK_os=}{f7?כ\nf[_os}}ݳg]K.Y=K.{eϺ˞uٳ.g]K.Y=K.{eϺ˞uٳ.g]K.Y=Kn=6Xݳn`vϺݳnu=vϺ mn=6X7~`}?7~`}7ͩ_7w`?o~O?~ݫt}w`? _7w`??~z֝u;`YwzugYw֝ugXwz֝u;`]uXW=g]uwO{6~ܽg]+YW= +zUϺ uճg]+YW= +zUϺgx+bկW"6^ӧ?ğ+bկW"6^x+bկW"6^ǧ??vEl}. t]].uw]@Eu]}. tnFu]7w@׍n~"{y^֗̇$ H( UFlUApT@B W_כ@ (` (` X(` 'H8A)Np$" 'H8A)Np$" 'H8A).p $\" H@%.p $\" H@%.p $\" H@%.p $\" H@%.p $\" H@%v_yp,] }>'w$H @ @B H` H` H`"&H`"XH`!XH`!.$p! \HRH$H @"DR H`#6H`#8H 8H ($PH@!BJ H8a Np„&0)'L8a Np„&0)'=-0 'L8a SNr„&0 'L8a SNr„&0 'L8a SNr„&0 'L8a SNr„&0 'L8a SNr„&0 'L8a SNrSDO Np„&0)'L8a Np„&0)'p 'p 'p 'r-'p 'p 'p 'r-'=Up 7p 7p dSp 'p 'p-'r 'p 'p 'p-'r~K6tdafߔaS (` 8(ࠀ (P(P@W_y ( P@ (`& (` X(`$<" Hx@#$<" Hx@#$<"aHX"aHX"@ K$,@ K$,@ K$,@ K$,@ K$,@ K$,@ K$,@ $nj}2oo_~ׯn?{վxWx;$H @ @B $0@ $0PC L$0D L$0TS ,$B ,$RK \HB.$p)K $H$H @"DR l$F l$V[ $pA $pQG ($PH@!B 0' 8a Nr0' 8a Nr ' 8a CNr€T!0' 8a CNp€0' 8a CNp€0' 8a CNp€0' 8a CNp€0' 8a CNp[̞*0' 9a Np€0' 9a p p p p p p p p V N8N8CN87=U'p'p!'r'p'p'p!'rqsn*mrTwO $H$H @"DR l$F l$V[ $pA $pQG ($PH@!B W}W| W| /%H @ @ %0@ $0@C %0D L$0DS L%B ,$BK ,%'p 'p 'p)'r 'p 'p 'p)'r 'p 'p 'p)'r 'p 'p 'p)'r 'p 'p 'p)'r'\p'\p'\p%'\r'\p'\p'\p%'\r'sB8.8.9.8O p p p p p p p p p p p p p p p p p p p p p p p p p p _|_Ӛ|\SmͿN}( T@ 0TDL0UB ,T.pK$ H( UFlUApT@B $H a)&H a)u~BS a H a H a H a H a H a H a HA np$  Hg׻@dO$  7HA npc{7ol޿c{7ol޿c{7ol޿`&8H 8J7ol޿c{l?`{l?`{?5 $0@ $0P L$0D L$0T`{m?p'fu?!~{z@}$0@ $0@C %0D L$0DS L%o_o>az@}$o_o>az@}$o_o>az@}$o_o>az@}$pA $pAG %o_o>az@}=0' 8a CNr€0' 8a CNrq o%' 84'z0Ӏh0' 8a CNr€0' 8a CNr€0' 8a CNr€0' 8a CNrq o%' 84' 8a Npp p p p p p p p ~Cpq߮w ~Mp'zp $'p'p'p!'rqAY~=IJ~<~?m>?m>ܠnϪ}*ࠀ 8*nݏz}AݺP$/כ'~?m>ܠn)}*` *`& *nO|AݺTH8A Np$  'H8A Np$  'H8A Np $\  H@.~ޗ] p@.p $\  H@.p $\  H@.p $\  H@.p|m}f0 0Ah &`j &0 &ؘ`k &(LP щNLtbD':1щNLtbD':1щNLtb7:q7:q7:q7:q7:q:l]:}pD R*ب` *8ࠂ *(TPTANxTp?4⡂R *U0P@C U0QDSLUPBK,U&0GL<`x&0GL<`x&0GL,0KL,0KL]bb&Xbb&Xbb&Xbb&Xbb&Xbb&Xbb&Xbb_yC\&M00LM0&4AblMp0 :1ԉN ubCP':1ԉN ubCP':1ԉN u@'u@'u@'u@'u@'uk 溽 "5w|Uk$*HT UFlUUAUpTAB W_]7/TpS *U0P@C U0QDSLUPBK,U&N0qSL`8 &N0qSL`8 &N0qSL\`&.0qKL\`]O7/S}L\`&.1q L\`&.1q L\`&.1q L\`xr?8u}i {] C*` &*` *^R${]*7^ץ Kd+U^F6ڪd렂 *8PAQJ``"x6^ &ⵍWzo`"x7^ &&bb &͍Wzu`"^xw7^ &ݍWzy`"^x7^ &Wz}`"^x7^L-&kzDb^xm0pw8^L;-&%jjjjjjm/G`ok`h`hi &&}G}xԉxԉxԉxԉxԉN,ubKXR':ԉN,ubKXR':ԉN,ub ~y _@@LT8!&1qLbG<8k2RMM@@XH7OyM}@SA<8o2RNN@ɜ@ɜXH9O T0TP@ɼ&>_H:S's8u2c's8v2s's8w2's8x2's8y2's8z2's8{2'00Oud.0Oud.0Oue.0Pue.0'Pue.0GPue.0gPue^j_^X˫_ }y4LMЯվվڗWڗVWj_޶>Mp4AڗVD':1щNLtbD':1щNLtbD':q:q:q:q:q:]_ב/?}g\5ۀ}߇ƺ *HUQF[lUpPAGUPPABnk*zSֻ] *U0P@C U0QDSLUPBK,U&0GL<`x&0GL<`x&0GL,0KL,0KL,0KL,0KL,0KL,0KL,0KL,0KL,0KL,0 L;xy廄^u9ΗyAO^[gïi#w2d A(P 2` 2`( &2`" 2`* 2X`! 2X`) .dp! \R2 $2Hd A*T 62`# 2`+ 28 28( 2(dPȠA)R Ā'<1!O ybĀ'<1!O ybĀ'<1!O ybĀ'<1!O ybĀ'<1!O ybĀ'<1!O ybĀ'<1!O ybĀ'<1!O ybĀ'<1!O ybĀ'<1!O ybep ˉ|v=d A"D R2HeFldV[lepAdpQGePȠA!B J2(dp^}gp^}gp^༐y!R 2d A(P d0@C e0PLd0DSLe0T ,dBK,eRO<O<#O<#O<O<O<#O<#O<O<O<#O<#O<O<O<#O<#O<O<O<#O<#O,xb XĒ'<%O,xb XĒ'<%O,xb XĒ'<%O,xb XĒ'<%O,xb XĒ'<%O,xb XĒ'<%O,xb XĒ'<%O,xb XĒ'<%O,xb XĒ'<%O,xb XĒ'<O<Ӌ?Isn~uߟ9*;m@W@ U0TDLU0UAl߹JT;3e*;3a*}~S}v"SxS}C}iOTpPQGYOپs?L 11L 11)O2m@W`b!&`b!&`b!&`b!&`b!&`b!&`b!&0qCLb8!&Nd{L@o &1qL`8~sθ;~7;>n|{3=θ3~wO7π#.遟]Mxz3xz= 28( 28ʠzzAz h>"xh2?כ f & 'x2e?=d> 2` 2`( &2`" 2`* ~wO7π#.x'Nx'Ny'Ny'Nx'Nx'Ny'Ny'Nx'Nx'Ny'Ny'Nx'Nx'Ny'Ny'Nx'Nx'Ny'Ny'.x'.x'.y'.y'.x'.x'.y'.y'.x'.x'.y'.y'.x'.x'.y'.y'.x'.x'.y'.y'.x'.x'.y'.y'.x'.x'.y'.y'.x'.x'.y'.y'.x'.x'.y'.y'.x'.x'.y'.y'O/?=pnug\xz/>θO_7.<=d0@ d0PC e0DLd0TSLe?=|&<=e> כ?=d g@Azכ {@ h2x_o>czx2MdpAGepQgx_o2]xz3{ OLxbĔ'<1 OLxbĔ'<1Ӌ2'N/z@4x;&ybdOLxbĔ'<1 OLxbĔ'<1 OLxbĔ'<1 OLxbĔ'<1Ӌ2'N/z@4Ą'<1)OLy'nx'nx'ny'ny'nx'nx'ny'ny Ӌ^o2'ny x;&y'/>[[剷ӋN$_%i_-B%J0PP C% 0QT S%LPR K%,pK%\*R R%JHQV [%lpPQ G%P(TBB :c:c:c:c:c:c:c:c:c:ct8@!:qt8@!:qtx;gp~G|Z N:گUπwvS R)RHJ!B*6RJa+RJa+R8J(R8J(B J)R(PJB!q_)WY]M Su&M M )RJ!B(P ) 0P C) 0P )L0T S)L0T ),R K),R p wr)wr)wr)wp wr)wr)wr)wp wr)wr)wr)wp wr)wr)wr)wp wr)wr)wr)w\pw\r%w\r%w\r%w\pw\r%w\r%w\r%wq~ Kx;);.3t)qqqqqqqqqqqqqqqqv$S p%w\r`_gR;.;.;.;.;.X~>C0t;멄P B% 0TP C%L0UT S%,TR K%\(R JTBT R%lUV [%pTQ G%J(P*PB):蘢c):蘢(DA._t%):蘢c):蘢c):蘢c):蘢c):蘢c):蘢c):蘢E-:nq[tܢD_t%[tܢ7E-:nq߶߾ue>]A;o3|}p+~"B"T R)RHJa#RJa+RJ R8J(R8JB!R J)R(PHΫOἐy!B  )RH!B(P B)RHa RJa(RHa"RJa*RXHa!RXJa)R;;;;;;;;;;;;;;;;;;;;c Xrǒ;ܱ%w,c Xrǒ;ܱ%w,c Xrǒ;ܱ%w,c Xrǒ;ܱ%w,c Xrǒ;ܱ%w,c Xrǒ;ܱ%w,c Xrǒ;ܱ%w,c Xrǒ;ܱ%w,c Xrǒ;ܱ%w,c Xrǒ;ܱ%w,c^79ggWi}guW}9G+}L#F(`4iLc(4Lc04Lc*4&ӘLc24&ӘLc)4XLc14XLRҸ4.q1i\L#F*d4i$HLc+46Lc346L(48L048LF)b4i(QJ#! hE.tѠ]4! hE.tѠ]4! hE.tѠ]4! hE.tѠ]4! hE.tѠ]4! hE.tѠ]4! hE.tѠ]4! hE.tѠ]4! hE.tѠ]4! hE.tѠ]tE\tE]tE]tE]tE\tE]tE]tE]tE\tE]tE]tE]tE\tE]tE]tE]tE\tE]tE]tE]~j>#?yѣFEeψ <іqTae?"З$?#2G~Жq?zQ <,і1T`e 1UdeL?6З'?#2DINRtS$E'):EINRtS$E'):EINRtK]"E)DE.Rtc E,>!.Rt]"E)H%.Rt]"E)H%.Rt]"E)H%.Rt'9>9|hv%u[g}7&~F|ߙgD5 >+3KOu|Fi๎?#4Jc04Lc04ҘJc24&ӘLc24'=>ϊg=mxψ.π♏?#4gD3K3xψ. <Ѧ? >+3KO|Fi9?#48J048L04'B>ϊgBS!mx.ψ&\4IMhE.tє\4IMhE.tє\4IMhE.tє\4IMhE.tє\4IMhE.tє\4IMhE.tє\4IMhE.tє\4IMhE.tє\4IMhE.tє\4IMhE.t-rMtMtMt-rMtMtMt-rMtMtMt-rMtMtMt-rMtMtMt Oi͈fkst[l7#Ѓ!]|0dq͈. =`fD |0~v3K(48L048LCl=r?ѥC6 ݌hҸу!Møѥq?ѥC ݌!܏nFti 1`i 1`iL1diL1diCGu7#4`!㺛]r#=tC=tC=tC=r#=tC=tC=tC=r#=tC=tC=tC\~w3K.z㼛]r#=tC=tC=tC-hE.ZtѢ]E-hE.ZtѢ]E\~w3K.Ztq͈. hEG~7#4E݌Ґ\E-hE.Ztђ\E-hE.Ztђ\E-hE.Ztђ\E-hE.ZtOiEG7#4EތҐ\E-hE.ZrѸH_g|>>>>>]>]>]>]>]>]>]>]>]>]ӿ :⳵|iq}|K`:u 1X`uL1Ydu,ֱXbu\bXGd:ulֱYfuqXau(QT]|ԑi4uDWyG<|A&yiI&y_GtuI}]i?uDWyA&y_GtuI]i?uDS&O7y_Gtu<1#:M]&O~4눮tbW}.vqslq89Js{9s 18s,α8OOOOO}Zbا>-iO}Zbا>-iO}Zbt^{ğC*xa]luc:c:&똬c:XbX:u$H֑c:6ج㰎:8XGb:< 4 O< 4 O<.uAyiAyiAyiAyiAyiAyiAy Oy:At< O~ yz?c Oy:At<GA=XG|_8F~h16m㰎:8XHGuh/޾Gtuc&ms:c:&똬c~h>1S=<)~AN򔯿}h O'y:INt|{D[yS=o<+p#:Em"Ot| {D[yS=<])߃A./}h Oy7GuMiO}d&4٧>MiO}dnfnfnfnfnfnllllllllllll_x_XN6N6N6NNNNNNNNN{6:c N?õõõC<=!OyzC<=!OyzC<-"O<-"O<-~]1ЏuEyZiEyZiEyZiEyZiEyZiEyZiEyZ|idٱ󥵓cKk':cL;;˛]Z;MiO}d&4٧>MiO}d&4٧>MiO7tO7tO7tO7tO7tOvϷ'GK y-ùo|Οwm:u$جc:68㰎:(QXGw]?#:Ku#XG:c:&똬c:Xc<=!OyzC<=!OyzC<=iEyZiEyZiEyZiEyZiEyZiEyZiEyZiEyZiEyZiEyZzh]l]lscp9&Xcqs\#9Gr968p9}`4ا> iO}`4ا> iO}`tOtOtOtOtOt~~ػ}{>X#YGd:6جc:8㰎:u(QcT|R:uc:c:&똬c:X<$O'y:INt<$O'y:INt<$O'yE.t<]"OyE.t<]"OyE.t<]"OyE.t<]"OyE.t<]"OyzhTutFfg#XG`u 1X`uL1Ydu,ֱXbX:.֑#YGdulֱYfuqXa:u(ՑiI&yiI&yiI&yiI&yiI&yiI&yiI&yiI&yiI&yiI&yMnt<&O7yMnt<&O7yMnt릛릛릛릛릛؏suuuuuu9瘜craaaaaا>-iO}Zbا>-iO}Zbا>-g_##N>#h=c:Ck']v֡ψ.Z;yhgDwGuh3N#:vEk'mZ;|Ftw{DWGAyiAyiAyiAyiAyiAyiAyiAyiAyiAy Oy:At< Oy:At< Oy:AG49^Ck'sN#:vա|Ftuh=Ck']Z;yhgDS{DWgDWN#:v1X`u ֡|Ftuh=Ck']$O'y:INt<$O'y:INt<$O'y:E.t<]"Oy:fDWyE.t<]"OyE.t<]"OyE.t<]"OyE.Һuinz]Z7;cr9nz]Z7.^MKץuҺui~p^M}d&4٧>MiO}d&4٧>MiO}d&tO7tO7tO7tO7tO7t=總iq96؜p9s8/qk9s 18s,α8OOOOO}Zbا>-iO}Zbا>-iO}Zb4; y}==}c:uc:똬c:&Xc:X:.qd:u$جc:68㰎:(QXG O< 4 O< 4:{x O< 4 O< 4 O< 4 O< 4 O< 4 O< 4 O< 4 Oy:At< O; O}< Oy:At<{.|ow=ΡF}zodw=q8Gq72Þ{xq4ﻲcr9MsOޜS7'>>{xsO\S7>{xsO\S7>{xsO\S7o}ػ<=xyScac:c:&똬c0{hXbaqda֑c0{hج㰎:8XvGuHGtu$y)O{h Oo~ iO}`4ا> iO}`tOtOtOtOtOthd47ψ9#:vN6O{hɾGuhdl֡=vy{DWɞZ;<=Ck':cl֡=vy{D[N$Oy{D[y:SANGu<$O'y:SA.Gtu,t<=<t<])O{h Oy#:E4t<=<])O{h Oy#:E4ɾv/|F49^Z;ٗNψ:cكwgDWN}i3Ck'ɾvա}id_Z;ɾv/|Ftuhds|N>#:v/Kk'MI&yiI&yiu͈4$O=>=>=>=>=bا>-iO}Zbا>-iO}Zbا>={{=19bq#GF3 f4i0`L3 f:`f:_x\O#s$؜cs9(Q㯽,Gts18sLα8>>>>>]>]>]>]>]>]>]>]>]>]>*e#.Hq84"i2dL&3Mf4i2L73t3Loz.vH<}qslq89Js4ă9scp9&Xcqaaaaaا>-iO}Zbا>-iO}Zbا>-i0G޺q&]w.=18M:zCI=Es7麿cq&]=Ρߤn9t8~` )` )` )` )` )>35ا|`S>[CMki }7jewӚnZ}75dNf:b.fb.fb^vRԥo'uIOCN~rvRԥo'uI]vRԥo'uI]vRSз.~;IiO}d&4٧>MiO}d&4٧>MiO}>>>>>o')[NS6plN6pl~;N:vumq~;68~;N:S>N:S>N:Sbrl;eا)[>N*)wVOS}ʝUSbrlT;eo7?#n|7g3MwF?#t3 f4i0`L3t0L3M+\..^..VBQQ!ER1ESAETQEh}?Y6f5ڬFhmVjY6kmVjY6f5۬VjZmV'UjZmVjY6GjWG{uWW{jf{uWO{fmVfmVfmVfmVfmVjY6f۬surwǧq\W^m8?Gǣx?n;v;}Nawi;VmUavXVmUavXVmUavXVmUavXVmUavXk~x3|S8?ocuc?>|>|>???~|?'>ć ~/|__>g[e۪d pnR(c9}_~O~8~_8p~o~8|78|}?| /w ^ ŝNxq'/@x ^ /w ^ % / /@x+^χ^ /@x ^w‹;ŝ /@xq'^ /@x ^w‹;ŝ /@xq'^ /@x ^ӟ'^ o o o oooƝƝƝooo o o oooF o ooo> o oooƟpw?@?8ttޮpy?~8'N?qu?~ _8Np}?~87Nqoqoϯ~>ur>>p>pq?~8N?p>O>qO>q/p /p;`%X/z ;`%X/z ;`%X/z ;`%X/z ;`%X/z ֫;՝ W`Xz֫;՝ W`Xz֫;՝ W`Xz֫;՝ W`Xz֫;՝ W`Xz֫;՝ W`Xz֫;՝ W`Xz֫;՝ W`Xz֫;՝ W`Xz֫;՝ W`XzK?>??>/}|[7ѺyoDuMn[7ѺyoDuMn[7ѺyoDֽu [-n[кuoBֽu [1H.w\_+yO\~|~9Lur߿oA?T7ur];]?ݏ;]?oǏ;]?p;]?pq?>_?p?qO?qǯ<]p<]p;mPmPmPmP߾SmPmPmP;mPmPmPmP߾SmPmPmP;mPmPmPmP_ߩA} kP_ננ5A} kP_ߩA} kP_ננ5A} kP_ߩA} kP_ננ5A} kP_ߩA} kP_ננ5A} kP_ߩA} kP_ננ5A} ;;9׏6~_}>6k888?p'Ο8'Ο8_8_8p?8O8'?q/ _8οpo87οq7878}?/ _/ _/ Ղ/W >/ _/ _/ _/ _/ __6p~_w| Ń _ Ll`bSX6 ll`c[hlȯ~/2l 60 m Hm (m01 05 01 05 01 05 01 05 01 05 0 4 0 4 0 4 0 4 0 4 0 4 0 4 0 4 0 4 0 4 ?L&GI$`~4 ?L&GI$`~4 ?L&GI$`~4 ?L&GI$`~4 ?L&GI$`~4 '&$SpbNL‰I85 '&$SpbNL‰I85 '&$SpbNL‰I85 '&$SpbNL‰I85 '&$SpbNL‰I85 &$\Kpa.L…I4 &$\Kpa.L…I4 &$\Kp?r~^zM?m$O&60 ,l`aK66hluy/l 60 m Hm (mpcnL­I1 7&$ܚpcnL­I1 7&$ܚpcnL­IؘIؘIؘIؘIؘIؘIؘIؘIؘIؘIؘIؘIؘIؘIؘIؘIؘIؘIؘIؘI_>;x_1~??yf{y?oB @ $J @ $0@ %0@"D $H$J @!B ($PJ | | |G |D L$0D L%0B ,$B ,%F l$F l%@#F 4h$J@ L`0!& 1a L`0!& 1a L`0!& 1a L`0!& 1a L`0!& 1a L`0!& 1a L`0!& 1a L`0!& 1a L`0!& 1a L`0!& 100010001000100010001zs-}wBo}NO ]w_oC8?/z'/yw\p`C |iA>V?<K!vR_\/>?=/xfP?_~zgo/%8Y<<!<ޮ_Jp<3y\^_KpQK BϷO_חOpJ* }{ /y(AÇ9oKp~ͿBoj7<]/:oR<¿\ƞ̇8 R<7~>=ȇEx~)a㍥!xx*ا .%8DC |Ӄ|A8!bޮ_Jp+!r^_KpoO~zRD %H QD %H QD %H UT R%H UC=PC]mB{~)^{~-JP*!\Jc0 c0 c0 c0 c0 c2)c2)c2 c0 c0 c0 c0 c0 c2)c2)c2 c0 c0 c0 c0 c0 c2)c2)c2 c0 c0 c0 c0 c0 c2)c2)c2 c0 c0 c0 c0 c0 c2)c2)c2cX0cX0cX0cX0cX0cX2%cX2%cX2cX0cX0cX0cX0cX0cX2%cX2%cX2cX0cX0cX0cX0cX0cX2%cX2%cX2ǗH? QD _$J(A$J(AJ*AaEaEoVÒ1<2%cX2cX0cX0cX0cX0cX0cX2%cX2%cX2cX0cX0cX0cX0cX0cX2%cX2%cX2cX0cX0cX0cX0cX0cX2%cX2%cX2cX0cX0cX0cX0cX0cX2%cX2%cX2Ǐk<ư` ư` q+a>TÒ1,a-?AFSa}ߐ?|sa_~{_}|/>Ã9낟=P-T//-8ãh߮_Zp(k_\Zp(Zp*N-8K '( po/-8߿t .-8S Zp:$ZhA$ZhA$ZhAZjAVV|x -8K +o-8K +ԂR N+҂C >Z|x>h߮_Zphk_\Zph|ԂS .-h__ZpxGa|~i_|]piZ0Ղ .-Xh)__ZpGa|~i!_|]pi!ZԂS .0-hi__ZpGa|~ia_|]piaZՂ .P-hT//-8ãh߮_Zpk_\ZpZp-ppN w8';ppN)w8;ppN w8';ppN)w8;ppN w8';ppN)w8; ŗ$ZhA$ZhA$ZjAZjAppN w8';ppN)w8;ppN w8';ppN)w8;ppN w8';ppN)w8;ppN w8';ppN)w8;ppN w8';ppN)w8;ppN w8';ppN)w8;\p p.w;\p p.%w;\p p.w;\p p.%w;\p p.w;\p p.%w;\$ZhA$ZhA$ZjAZjAp p.w;\p p.%w;\ǍQ_RGaq:>ko9ߏÂ?0k"&"`""`!"X`!"X`#6"؈`#"؊A#F"hEЈ`#u=u="^p A @"E` "` " A"D"HEA!B "(EPtAtAtE[tEtAtAtE[tEtAtAtE[tEtAtAtE[tEtAtAtE[tE :latؠE :latؠE :latؠE :latؠE :latؠE :latؠE :latؠE :latؠE :latؠE :latؠA?/}_} nyA Z__uwo__uC//,5?⿯,x}gKn ~_Qjp'K 58a[ 58_kp"K IRP g 558e<< ~@ g)/ZiK 9O5[i~\j0TC 58I\x0$jp<{~L_kp>{]p\O_jp<[|Adzɗ6B go/58k Χ .58>ՠT [ g5x0?x58ҿ.xT|g558p(ޯL/ZSk.O5G~\j0UÜ=< ~F {58K T|g[58 C 58 [ 04jp_kp*u!!!!!!!!!A$jA$jAjAj!!!!!!!!!!!!!!!!!!q"X8`,Eq"Y!8d,Eq"X8`,Eq"Y!8d,Eq"X8`,Eq"Y!8d,E#QD 5H QD 5H QT R5H UT R5Hq"X8`,Eq"Y!8d,E㰄58߇/a8!]cpZ— ^ԃ[.iCMЃ{}OMr҃C>< ?|h·em&| _\zpx‡|z—a8!]/o n=8S\!(|(|[p! zp~|)|x=8LKNSkNSփ>Ճ.xA\p !+|+|[p zp|o8,|xxo/=8e=8eۂ[Yԃ7S. уD=H уD=H ՃTR=H ՃTR=HЅ=(ԅ//=8tP ߮_zp— \{p·u )))) )))) )))) )))) ))))XXXXX%X%X%X%XXXXX%X%X%X%XXXXX%X%X%X%X$z܃D=H уTR=H ՃTR=H ĂO,ĂO,ĂO,ĂO,ĒO,ĒO,ĒO,ĒO,ĂO,ĂO,ĂO,ĂO,ĒO,ĒO,ĒO,ĒO,ĂO,ĂO,ĂO,ĂO,ĒO,ĒO,ĒO,ĒO,ĂO,ĂO,ĂO,ĂO,ĒO,ĒO,ĒO,ĒO,ĂO,ĂO,ĂO,ĂO,ĒO,ĒO,ĒO,ĒO,ĂO,ĂO,ĂO,ĂO,ĒO,ĒO,ĒO,ĒOG|`?, t q 7(|tL`K7ظ 7h`SMhT'8ĉ&N5qSMhT'8ĉ&N5qSMhTą&.5qKM\hRą&.5qKM\hRą&.5q[MhV7č&n5q[MhV7č&n5q[MhVMl5VMl5VMl5VMl5VMl5F?~i׿7u=/< p n0t R7(ܠtn &n0u,`[7hܠq@CM 41@CM 41@CM 41@CM 41@CM 41ā&5qCMhP8ā&5q_~\$?L`jS;Xvl`k[;h젱;ȯ뾃K; B;v0;H  ;(LLLLLLLLLLLLLLLLLLL,L,L,L,L,L,L,L,L,L,L,L,L,L,L,L,L,L,L,L,L<^Z;O0 ~?~a'2d A(P 2` 2`( $2Hd A*T 2(dPȠA)R > > > > &2`" 2`* 2X`! 2X`) 62`# 2`+ 42hdȠA+V &8q'8q8q8q'8q'8q8q8q'8q'8q8q8qh>eN N<8q8q'8q'8q8q8q'8q'8q8q8q'8q'8q8q8q'8q'8q8q8q'8q'8q8q8xS N]O8q8q8q8q8q8q8q8q8q8q8q8q8qOP^}v~CwK- 2Yp`* [ ,eIR-ͯ 62g% -ͯ 2YpɠtfW~]d_ /{ bς K2-@ bςK 2- 2y? . e A"D R2HePjޯ 2(ePʠ81 NLpbS'&81 NLpbS'&81 NLpbS'&81 NLpbS'&81 NLpbS'8N,pbKX'8N,pbKX'8N,pbKX'ߗ8N]3{mm n;_o;L^pA`&fbh&fb`&fbh&fb`&fbh&fb`&fbh&fb`&fbh&fb`&fbh&fb`&fbh&fb`&fbh&fb`&fbh&fb`&fbh&fLC3qh&ā84fLC3qh&ā84fLC3qh&EZ\k4O;5^z[iL`bS;vl`c[;Acv__t/;ZpA`vv0$vAjvPAi`&&fbj&fbb&&fbj&fbb&&fbj&fbb&&fbj&fbb&&fbj&fba&fbi&fba&fbi&fba&fbi&fba&fbi&fba&fbi&fba&fbi&fba&fbi&fba&fbi&fba&fbi&fba&fbi&fϝ?xs珞;=wϝ?xs珞;Lev;=w'~?|>#O'~?|>#O'~?ĉ81fL3qj&Nĉ81fL3qj&Nĉ81fL3qj&Nĉ81fL3qj&Nĉ81fL3qj&Ną0fL\ 3qi&.ą0fL\ 3qi&.ą0fL<>UV}9gm>qߟ c-z|YR ~D<zS낟S|?xiE?}OESOFp E*V}=ŭ[E*ŸT?SL"4'?OQ"rkZEhxNz[ZEhC/ >{x|ϗ"u=_tʾV_ .E^^㸯{{\ǧ"SL"ӧ"SD"p>}9"p<~=ŭ""SLE(Ÿ@pZ\0T"" a"$(B"$(B"*B"*B*"P(B*"P(B{9"phS܊P*B0fq,n a7Y2[fq,n-eY0fq,n a7Y2[fq,n-eY0fq,n a7Y2[fq,n-eY0fq,n a7Y2[fq,n-eY0fq,n a7Y2[fq,n-eYlņYlņYlņYlŖYlŖYlŖYlŖYlŖYlņYlņYlņYlŖYlŖYlŖYlŖYlŖYlņYlņYlņYlŖYlŖYlŖYlŖYlŖYfa[fo#|92-x~)nEYlņYlņYlņYlņYlŖYlŖYlŖYlŖYlņYlņYlņYlņYlŖYlŖYlŖYlŖYlņYlņYlņYlņYlŖYlŖYlŖYlŖYlņYlņYlņYlņYlŖYlŖYlŖYlŖYlv0 x|S`fe\ 2wVņY_9OL?!׿oD~$3@-ݥS~_O1uۂߏCuЄ@urքC>4!ЄC/dx×#\:|[pi¡_Oqk©ܚpÇ& 4p/oM8Cp Owrkro .M8)nM8ۂ[MH4!фDMH4!ՄTRMH5!ՄTRMH5!ՄT{ЄB{rք>4Є/dx×#\=|[pia_OqkiܚpÇ&|ЄC\5ЇM >|_pԇ/G6/}҄CքS-5Mh_ߚpÇ&L4 .&\pSܚp÷& M8[Є&}%S ڄۂKz[Nք >4a A|~kaф /dxė#\A|[pia_Oqkiܚp(ć&4p(ė& & }%S!ڄۂKz[N҄c 8ƀc 8ƀc 8Ɛc 9Ɛc 9Ɛc 9Ɛc 9Ɛc 9ƀc 8ƀc 8ƀc 8Ɛc 9Ɛc 9Ɛc 9Ɛc 9Ɛc 9ƀc 8ƀc 8ƀc 8Ɛc 9Ɛc 9Ɛc 9Ɛc 9Ɛc 9~}քDMH4!фDRMH5!ՄTRMH5!ՄTRMH5111C1C1C1C1C1111C1C1C1C1C1111C1C1C1C1C1111C1C1C1C1C1111C1C1C1C1C1111C1C1C1C1C1cpq18!8crCq19!8cpq18!8crCq19!8cpq18!8crCq19!85[MH4!фDMH5!ՄTRMH5!ՄTRMH5!88cpCq19!8crCq1??\}mχsq=&v0L`a ;X6vlZ;h ;ȯ ;/ B;``;;H  ;(젴0315S311315S311315S311315S311315S30 34K30 34K30 34K30 34K30 34K30 34K30 34K30 34K30 34K30 34K3s|]?p]m]Z99n?c 禿|ޟ~/>yx=-낟Ss|C ~B x>TA{%PZPBU8z[BUU&χ*bwV*PYpUPz=ŭ CUŸTD*B 'qZTRU8*ŸTxߪPŸ\TyKU8 *P*P}Ue~U8 zKU|rk>GU8潞VQo|-[&p|Cnp>~9õ SU|*LUa wz>To U8 zKKU8UXRz[T[=wV*P_{%ĭ*z *lUa z=ŭ [UتŸ *4ШŸ *Ъ^pB ***Ш„mq6N)8elmSq6N)8elmq6N)8elmSq6N)8elmq6N)8elmSq6N)8elLT!QDUHT!UTRUHU!UTRUHU!UTRUmq6N)8elmSq6N)8elmq6N)8elmSq6N)8elmq6N)8elmSq6N)8elmq6N)8elmSq6N)8elmq6N)8elmSq6N)8elmq6N)8elmSq6N)8elm\ q6.%۸dlm\Kq6.%۸dlm\ q6.%۸dlm\Kq6.%۸dlm\ q6.%۸dlm\Kq6.%۸dlJT!QDUHT!UTRUHU!UTRUHU!UTRUm\ q6.%۸dlm\Kq6.%۸dl:lC/|鰉o!6 }>tsNr?{n1Nt낟St.B.%\pSܺp .F .F%(>tՅ(.u4/v/҅(օ(.x>]W~>>!}(.S)օR|[ޅ}(S\O҅)>tχvp|SHS|]p_q_Nm S|=ŭ S|]p!p|CLT|~I]8)C*.uᔊ/v/҅C*օS*.t!хD]Ht!ՅTR]Hu!ՅTR]Hu!ՅTR]HuЊ](tЊo/)Z .Zu V|9ĵ iŷ.Z.Zu q;nx-w[q;ny-wq;nx-w[q;ny-wq;nx-w[q;ny-wq;nx-w[q;ny-wq;nx-w[q;ny-wlxdžwlxdžwlyǖwlyǖwlyǖwlyǖwlyǖwlyǖwlxdžwlxdžwlyǖwlyǖwlyǖwlyǖwlyǖwlyǖwlxdžwlxdžwlyǖwlyǖwlyǖwlyǖwlyǖwlyǖwD]Htz)ՅTR]Hu!ՅTR]Hu!ՅTR]Huޱޱ[ޱ[ޱ[ޱ[ޱ[ޱ[ޱޱޱ[ޱ[ޱ[ޱ[ޱ[ޱ[ޱޱޱ[ޱ[ޱ[ޱ[ޱ[ޱ[ޱޱޱ[ޱ[ޱ[ޱ[ޱ[ޱ[ޱޱޱ[ޱ[ޱ[ޱ[ޱ[ޱ[ޱޱޱ[ޱ[ޱ[ޱ[ޱ[ޱ[ޱ뿏8zP̗?u"B[ma` C[[Hm! [(m>G[h mab S[-,mac [[[hm14C1414C1414C1414C1414C1414C1414C1414C1414C1414C14tCq`:Mǡ84tCq`:Mǡ84tCq`:Mǡ84tCq`:Mǡ84tCq`:Mǡ8415S1515S1515S1515S1515S1515S1515S1515S1515S1515S15 ӱ4Kӱ4 ӱ4Kӱ4 ӱ4Kӱ4 ӱ4Kӱ4 ӱ4Kӱ4 ӱ4Kӱ4 ӱ4Kӱ4 ӱ4Kӱ4 ӱ4Kӱ4 ӱ4Kӱ4yizϷm>Bh -0- mah -Bj -PBi l-|0-Lmaj [X-lmak -Bc qj:NMǩ81tqj:NMǩ81tqj:NMǩ81tqj:NMǩ81tqj:NMǩ81t qi:.Mǥ0t\ qi:.Mǥ0t\ qi:.Mǥ鸎g֣~|W,?a>O^կwymD )L0T S)L0B ),R K),F )lV [)lB#F Z)RhJ)/k%R_H{%@ B)RJ!B(RJa(RJa(D R)RHJ!B*B J)R(PJB);n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;n;6ر-vlc[b;6ر-vlc[b;6ر-vlc[b;6ر-vlc[b;6ر-vlc[b;6ر-vlc[b;6ر-vlc[b;6ر-vlc[b;6ر-vlc[b;6ر-vlc[b;z^s]`cy>ǿ+~gY/yƿ+~?"+;˧y\G~=V<NJq^̟eOv_q+lj|VIc9yk9O8^zz'#o 8<=( OiWq>yǵrϝq]?^xTT9ho 8==(rWq>|ǵrO)ˑ,}ŵӧrq8FxXb9'+8?xc<[p/A9Wq}\qڅr[SQO8m yzP>F~rFur}ŭy,LJP7+8S9&?=y[p/ǩ Џ}ŭhzǵz_q+ǡq?k9TMOqxkc\{_q+^q-ǩWqXro|Z>U-OJs|_q+ǩ%_q-i.Wqr4qr iȐ iА iА iА iА iА iА iА iȐ iА iА iА iА iА iА iА iȐ iА iА iА iА iА iА iАdTT9RH#Yd9H#Yd9H#Yd9HC4dHC4hH4hH4hH4hH4hH4hH4hHC4dHC4hH4hH4hH4hH4hH4hH4hHC4dHC4hH4hH4hH4hH4hH4hH4hHC4dHC4hH4hH4hH4hH4hH4hH4hHC4dHC4hH4hH4hH4hH4hH4hH4hHo* iȐ U iА 4hH/, iА !2CtАAC:hH !4tАAC:hH !2CtАAC:hH !4tАAC:hH !2CtАAC:hH !4tАAC:hH k&OH#Ud9H#Yd9H#Yd9H#Yd9dH !4<>(4tАk9hH 8 k;؎v}ŭ}jR;R+n8ӣ؎STT+8c;q*v[ˁtOf;N֎ӁڎӁpl@WqHЧv}]qk)Af;N ֎SڎS㐠h㔠+.Â>ׂK;/ Ҏ<-ãy}ťyZ}ڑ}]qkG+.ӂРO/ ֎S>=*v}ŭ}ǵ}]qmǡAlǩAWqxЧv /֎Ӄ>=*8=[;Nk;NڎÃ>c}_qkGv$ۑlGv$ۑlGv$ۑlGv$ۑlaBQj_&uŭ }zT8M[;Nk;NڎÄ>؎ӄC4J4J4J4J4J4J4J4JS4J4J4J4J4J4J4J4JS4J4J4J4J4J4J4J4JS4J4J4J4J4J4J4J4JS4J4J4J4J4J4J4J4JKJJJJJJJJKJJJJJJJJKJJJJJJJJ+ՎT;?s/H#َd;H#َd;H#َd;+-Ң+-Ң+-Ң+-Ң+-Ң+-Ң+-Ң+-Ғ+-Ң+-Ң+-Ң+-Ң+-Ң+-Ң+-Ң+-Ғ+-Ң+-Ң+-Ң+-Ң+-Ң+-Ң+-Ң+-Ғ+-Ң+-Ң+-Ң+-Ң+-Ң+-Ң+-Ң+-Ғ+-Ң+-Ң+-Ң+-Ң+-Ң+-Ң+-Ң+-Ғ+-Ң+-Ң+-Ң+-Ң+-Ң+-Ң+-Ң+-~{A|DoY!~oQ{=~>8>8>8>8☌c28&㘌c28Xc18Xc18،c386،c38Zq4hьG3f8tJ'tJ'tJ'tJtJ'tJ'tJ'tJtJ'tJ'tJ'tJtJ'tJ'tJ'tJtJ'tJ'tJ'tJtJ'tJ'tJ'tJtJ'tJ'tJ'tJtJ'tJ'tJ'tJtJ'tJ'tJ'tJtJ'tJ'tJ'tJtJtJtJtJtJtJtJtJtJtJtJtJtJtJtJtJtJtJtJtJA/J.i<*N}x5pNdyy5ptkWGAOJ.i ~Y_\?ՃovZ'ǿ$ovZsz^q|}ŭ3zNxNrYq|:׼|N|nZ>8_xXi.+n8=ՃowZzi_W\q>|ǵzH;9eŭdzڧz4q>}_qai|Z>8xXf=zYC=6?OR}eát +nاmxǭ+.؇xC4.+n8S=}zzaCV^W\qڗ}\qzt>eŭz?OOV$==,x>]k=Nk=N_Vh=փ݇󺬸#Ud=H#Yd=H#Yd=H#Yd=H㰄O(+n8MR"_W\q}\qzzNVYMkiM75ݴtӚnZMkiM75ݴtӚnYMkiM75ݴtӚnZMkiM75ݴtӚnYMkiM75ݴtӚnZMkiM75ݴtӚnYMkiM75ݴtӚnZMkiM75ݴtӚnYMkiM75ݴtӚnZMkiM75ݴtӚiӚ6iӚ6iӚ6iӚ6iӚ6iӚ6iӚ6iӚiӚ6iӚ6iӚ6iӚ6iӚ6iӚ6iӚ6iӚiӚ6iӚ6iӚ6iӚ6iӚ6iӚ6iӚ6iӚvz$^ꑬGz$둬Gz$둬Gz$!kڴMkڴMkڴMkڴMkڴMkڴMkڴMkڴ-kڴMkڴMkڴMkڴMkڴMkڴMkڴMkڴ-kڴMkڴMkڴMkڴMkڴMkڴMkڴMkڴ-kڴMkڴMkڴMkڴMkڴMkڴMkڴMkڴ-kڴMkڴMkڴMkڴMkڴMkڴMkڴMkڴ-kڴMkڴMkڴMkڴMkڴMkڴMkڴMkڲuJ7+Z;O?W~}\~Vdo+~?+~ʿߏ>N>~~f+ϣ؏ӊ>_yxo+8rS}_qiE_qiEWqX~4VmŽ}_5EV\qjѧO-֏SڏSТ8k?ۊ{?H#ُd?H#ُd?H#ُd?H#ُd?N1ԏb?o+8R)FWq}\q~b~bmŽ}_8eFV\qѧőO3֏ӌڏӌ08q?ۊ{?N5ԏ~sKTO#Oj}ŭ}ǵ}_qǡFqӣѷ~nã}[qFWGR?[?N7k?N7֏Í>ՑGto+8S?ݑG/9ڏS>=.<~~ru~r}ŭ}#O)GVqѧ~4}[qiGf?N;֏ӎڏӎ㰣h㴣o+Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ?d?H#ُd?H#ُd?H#ُd?H#Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ? Ӡ?tПA:O?tПA:O?tПA:O?tПA:O?tПA:O?tПA:O?~$G~$G~$G~$GtПA:O?tПA:O?__}bX=6y=Z/׊=cH#y=`O=M4dO=M4dO=-bO=-bO=-bO=-bO=-bO=Þ~{aO?=Þ~{aO?=Þ~ɞNt=dO'{:ɞNt=dO'{:ɞNt=]bO{Ş.t=]bOj|?'|ǯ~{LcX=6ѼG~*v,#x=1x=(ޣxt=fO7{͞nt͞6{i͞6{i͞6{i͞6{i͞6{i~j/aW#>1} #>H>(}|>&1}LcqX>6}l>h#8O48O48O48O48O48O48O48O48O48O48O48O48O48O48O48O48O48O48O48Otpy:8O<tpy:8O<tpy:8OL|"w_9oyNZ{z_c2<&c2<&Xc1<Xc1<c3<6c3<6ḥG3fMiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>=ߋȧE>=ȧE>=?WȧE>=?ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>=?SȧE>=?ȧE>#?sߟz~+?}{/:>s߯>`I>I>I>I>I>I>I>I>I>I>I>I>I>I>I>I>I>I>I>I>I>I>I>I>I>I>I>I>I>I>I>I>I>I>I>I>I>I>I>E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]u69?y?=}N׊>>&1},cqX>6}4Gs}/{eK⺏>#} cpH#>(><ݜtsny9O7<ݜtsny9O7<ݜts6is6is6is6is6is6is6is6is6is6is6is6is6is6is6is6is6is6is6is6ik_ʟV?^_Uy+?gyx^g3ϟ?yeOy:#ϊ[<uYqc0 iO| 4ȧA> iO| 4ȧA> iO| OyO|k 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧ}KS <ȧA>            _tO&<ȧ|:ȧ}SA>W5 kOyӞ{7F<ό<Ϸe2<&c2<&c1<Xc1<Xc3<6c3<6̣G3fMiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Zӿ)iO|z~#c"o$ʃ|Z"HȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>ɟ ȧ7?A>-iO}x~V|~ZGG{QLJ=y{4ѺdO'{:ɞNt=dO'{:ɞNt=dO'{:ɞ.t=]bO{Ş.t=]bO{Ş.t=]fO7{͞nt=fO7{͞nt=fO7{͞6{i͞6{i͞6{i͞6{i͞6{i7@u~.x==Hޣx=>LJ=x{lޣy== 4`O= 4`O= 4`O= 4`O= 4`O{:t=`O{:ӡwn+W\C^qGOW\!>^q{{OW\&{iɞ&{iɞ&{ZiŞ{ZiŞ{ZiŞ{ZiŞ{ZiŞ{zϊ{翷xϊW}}#G0`k~VlX5dyL1dyL汘by,汘by,汙fyl汙fyḷG3fmiO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO?_kU"x=1x=(ޣx=&1y{,chޣu`O= 4`O= 4`O= 4`O= 4`O= 4t=`O{:t?+_߱gY_?+~e1{5<&1b"<XCDbyW\c3ky4̣{5VMiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"my|>s4o{}sᴟ>W׷>#G0`I>I>I>I>I>I>I>I>I>I>I>^ N$tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'o{}ʃ|:ɧ|z~cI>E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]ӿ)".myOtOק<ȧ|ȧ緽>A>]E>]o |}O+&1y{,chޣu{ZqG{ c{$QGfO7{͞nt=fO=mfO=mfO=mfO=mfO=mVOzz{={+POW\~C=^qzz{{i{i{i{i{i=`O{:t=8u~x{Lcؼ=h#t_+#x{ #y=(ރ=M4dO=M4dO=MbO=-bO=-bO=-bO=-bO=-sw?ۊw?%%Jp}>1}$Gr}QGq}|>>>&1},cqX>6}4Gs}Ly:9O'miO|&6ɧM>miO|&6ɧM>miO|z1iO_}̃|&6\c&ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>m<ȧM>=!1iO|uyxϊ?G~{iYO'ӧ<><><><&c2<&c2<Xc1<Xc1<6c3<6c3 iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtO紾W紾W.9W>>&1},cqX>6}4Gs}_G~iV\Gp}1} cp}$Gr}QGqyyyyyyyyyyZyZyZyZyZyZyZyZyZyZyZyZyZyZyZyZyZyZyZyZy׷=<:}Ή<<<[ũ#`N<̃3`I>I>I>I>I>I>I>I>I>I>I>[g N+yO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'tO'oi~ʃ|:ɧ篸?A>I>E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]E>]ӿ)"tOtO6<ȧ|zcE>]E>ɟ8?3tړ>W:13#O=m|_HdyL1dyL汘by,汘by,汙fyl汙fyḷG3fmiO|&6ɧM>miO|&6ɧM>miOF<ȧM>myO|ӿ)iO|z~#c&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6o$ʃ|&Hɧ->_N++W$WW|brL3 f4i0`Lf:`f:`f:i2dL&3Mf4i2dL3-fZ̴i1bL~N+++>\1bq֊L'3t2L'3t2L'3]t1L3]t5W|e==x{lޣy=_>#x{ #y=(ރ=fO7{͞nt=i͞6{i͞6{i͞6{i͞6{i͞6{i=:u֊}+}Gp>Gr}$QGq}>>LJp>&},cq>6Gs}yyyyyy}ip2O48O48O48O48O48O48O48O48O48O48O48O48O<tpy:8O<p^y:8O̓y:8O<Ǵ| S|W>&1},cqX>6}4Gs}_G~i}Gp} cpGr}$Gq}Qir&ir&ir&ir&ir&ir&ir&ir&ir&iriqiqiqiqiqiqiqiqiqiqiqiqiqiqiqiqiqiqiqiqVcH#y=cX=6y=ZdO'{:ɞNt=dO'{:ɞNt=dO'{:Ş.t=]bO{Ş.|+IiM<Қ>ARZX>HJkshh|'>6y/Sz+}#}>3ϝGr}.y9O7<ݜtsny9O7<ݜtsny9O7is6is6is6is6is6is6}p6_3W8O9O9O9O9O9O9O9O9O9O9O9O}Ͽ>~x}^O?>#} cpH#>(>p}|}LcrX>}lcsh>Z< < < < < <=< < < < < < < < < < < < < y:8O<tpy:8O<=y:8O<uo9Ÿ]yXynb_CGt(!5לT\kTqj\>]׬5;#Wӕ_g{u^uoۿͯۿ뿍;66ګ*kګ*kګkګkګkګ2L+ |1n1 +Y+Rx4q:ЫCz*|y?0^///7Dhl\q5l\q5l\q5l\q5l\q5 k,Y\fq5 k,Y\fq5 k,Y\fq5 kQn8 D-[`zz%6sf}n>Y۬m6sf}n>Y,~Sg??{}_/? /}^^Ϗ3~?<' ~?g: ~___yƟ_g}3~o7}Ə/`}@?~O_//`} X_l} X_//`} X_l} X_//`} X_l} X_//`} X_l} X_/֗]'5^?a} KX_l} KXu@a} KX_l} KX_֗%/֗%/a} KX_l} KX_֗%/?wʿк=x=?a`7  o7?~gk#O~?g39? ?O'_/ :+_ WL+_ W+_ W+_ W+_ W+_ W W+_ W+_ W+_ W}ׯ߯|%'/_ؿccOMMMMMMMMM-----}\}F1ևB@O) F~#_P{'&wD~"?????_/ 迍迍迍迍迍迍迍迍迍迍W&S"7k_F5k_F5k_F5k_F5k_ˏ{Dqw@~ ?O' B~!_!""""!!!!####o9DM~>N/ _@/ _@/ _@/ _@/ _>Ζ'lM~D%/K_D%/K_9|{/q| 7SF~#| {S?Q8t+A 1zK0%atvM?1~TD9O''~~ %/ K_%/ K_%/ K_%/ K_%/ K_{^{^{^{^{^{^{^{^{^{^+_ W+_ W+_ W+_ W+_ W[[[[[[[[[[?z}]?/_PF77779~?P@'Oԟ 5 k_5 k_5 k_5 k_5 k_g7Ous@@@@ԟ?QDDDDDP/////_PB7oooos^/ _/ _/ _/ _/ aO?|_G~^~u<뿟?}~n_a_/a _7occ7c7_~_t~yM'=]9a``?`'?Ob'b'b n <MMMMMMMMMMMMM]~_y~?;}'/ K_%/ K_%/ K_%/ K_%/ K_%/%/ K_%/ K_%/ K_%/ {]߯w_{``?`?Ob'b'b'_ a/_a_a/a _oc7c7cy+_ W+_ W+_ W+_ W+_ W+_ W+_ W+_ W+_ W+_ W                    ~W /\p7o\\?p'O\ۘۘۘۘۘ51k_cט51k_cט51}O|<(y9*׿?P?P?P?P@'Oԟ?Q?Q?Q?Q?Q/ /_PF\z>In/ _/ _/ _/ _/ _<~9 ߀ ߀ ߀ ߀ ߀ ߀ ߀ ߀]~~~~B oߨQ~~~~_w~|?PD777777777w}M]~|S? K_%/ K_%/ K_%/ K_%/ K_wy￟7?Srw\~'>q}_~/0 _`/0 _`/0<_W]_~_']~]r>\r߿.]kb&ob&ob&ob&ob&/1K_b󗘿%/1K_b󗘿%/1K_b.|__y|Ûu{{]sW?QCw_z /?u=_7ꟿovsFF_~~߿n+_ W+_ W+_ W+_ W+_ wM6mn[[[[[[[[տws>?~ /?F}^?oo?ss~9~?Pϟ'O?~~ϟ5 k_5 k_5 k_5 k_5 k_U~~~x}z7^ /_@~ 7߀~ wH=_~Gnpz\?qc&ob&ob&ob&ob&/1K_b󗘿%/1K_b󗘿%/1K_b.|˻~'O\_p}߸~}0+_a W0+_a W0+_aoaoaoaoaoa7_zc||}ϗ^>]ۘ}ۘ}ۘ>O]cO]cO]c'OTsWsF>W^8{].u^8{].u^8{].u^8{].u^8{].ugggggggggg<+\~w?fW׿,+_\~B\~F}.((<~*\~@\~Dy.(((v כp כgכp כpyv כp כgכp כpyv כp ˳%\/z ˳%\/z ˳%\/z ˳%\/z ˳%\/z ˳%\/z ˳%\/z ˳%\/z ˳%\/z ˳%\/z ݧG_ǟ޾_~zŹ|||8(?P~<(?Q~|'''ʿ_(B׹|||:_(P~>(Q~|77|]z+^]z+^]z+^]z+^]z+^]z+^]z+^]z+^]z+^]z+:ނ-ނ뭳-ނ-:ނ-ނ뭳-ނ-:ނ-ނ\gO9?1^_tS׿O /l /lu/la olc7>ools?_9oyg~`~`l`?۟'?Olby~b'~b' ۠ ۠ ۠ g۠ ۠ ۠ ۠} ۠ ۠ ۠ g۠ ۠ ۠ ۠} ۠ ۠ ۠ 35A} kP_נ>S_נ5A} 35A} kP_נ>S_נ5A} 35A} kP_נ>S_נ5A} 35A} kP_נ>S_נ5A} 35A} kP_נ>S_נ5A}}s_k׿߯{?``?`'?Obb'b' a/_a_a_/a _7occ7c7/ _/ _/ _/ _/ _/ _/ _/ _/ _/ _ v߿>Bw:\_~7߸q}|\?p'O\%/1K_b󗘿%/1K_b󗘿%/17g׿>7gvs@@@@ԟ?QDDDDDP/////_PB7oooos#7 w9x~ W+_ W+_ W+_ W+_ WrMArSoooooooo.տ]~xWPPPPB 7oߨQQQQ/9?/0?PDwYM]~|S k_5 k_5 k_5 k_5 k_}y!~=?~yF_O,? A_D{@@ )R`@O (0C )0|'&P`B)H(p>I  H)SޯxAxAxI ((PP@Ig=_?) ,)ޯP`C Rć' 4h(Ra7 \}0& 1a /SL`0!& 1a L`0!& 1a L`0!& 1a L`0!& 1a L`0!& 1a L`0!& 1a L`0!& 1a L`0!& 1a L`0!& 10001000100010001000100010001000100010001N0N0N0N1N0N0N0N1N0N0N0N1N0N0N0N1N0N0N0N1N0N0N0N1N0N0N0N1N0N0N0N1N0N0N0N1N0N0N0N1a L`&0)&L1a L`&0)&L1a L`&0)&L1a L`&0)&L1a L`&0)&L1a L`&0)&L1a L`&0)&L1a L`&0)&L1a L`&0)&L1a L`&0)&L13wx-{3s^Ö[g||%O {Z}$H A@! B$| H0$CLHp>LI &$`J) ϓ}~ !AB) R O $K$AA $(IP$ _?I K,I$g _?I![lI%ACޯ$hHА%AK:,a tXD:,a tXD:,a tXD:,a tXD:,a tXD:,a tXD:,a tXD:,a tXD:,a tXD:,a tXD t@ t@ tDKtD t@ t@ tDKtD t@ t@ tDKtD t@ t@ tDKtD t@ t@ tDKtDG =ng .4M^h%(HP AA% J$X`A $X`I% $ؐ`C 6$ؐ`K- $hHА!AC- Z4$sAy y t > $H A@! B H0  H0$CLH0!LH0%S$$HH !AB) R7p7ppp7p7ppp7p7ppp7p7ppp7p7ppA :latآA :latآA :latآA :latآA :latآA :latآA :latآA :latآA :latآA :latآ60~6M~v{wut߿I=? >%5K}/k}ľY6[~^1$VThl6z|Fwc T߽`c/ߎEh,.X\X\?<8=cX\pݛnwz(tXav,qi籸~yj<E8sfcqhu7euu۝^>=8~|{y,<=cq,X\>nލ*wz]>޽>yvOw8ſjo"5OvDZ7$hO<5i{j<0DZu=%һ˯E~wo%|q, oǢ5hi籸OmP>8 qDZ>f, c^p;<4>4iDZPDZ>z8{q,rRPJ9/OA|q,rRy <{ǂ)g0 3rRPJ9C)g( 3rS`L9)g0 3rRPJ9C)g( 3rS`L9)g0 3rRPJ9C)g( 3rS`L9)g0 3rRPJ9C)g( 3rS`L9)g0 3rRPJ9C)g( 3rS`L9)g0 3rRPJ9C)g( 3rS`L9)g0 3rRPJ9C)g( 3rS`L9)g0 3rRPJ9C)g( 3rS`L9)g0>~f, c^p;<4>iDZPDZ>L8{q,rC)Pyycs(>i`9r^0|X0L9RΡs(J9RΡs(J9Rs0L9Ss0L9RΡs(J9RΡs(J9Rs0L9Ss0L9RΡs(J9RΡs(J9Rs0L9Ss0L9%ļ? {b޽|Kb>ո]? >%nO?\\Ç>#Ukx tno\\R̻(%ż{WKsqI1pS۹(Ṙ}b>ykx\\Sc\\b̻wui..1soy;Ksa繸ƘO}c>8qǹws5]ݚKt\c\'|y.9S繸昏85|q..A\d޽Ow8ſA\?A>sq 2<5|q.AnOs104Yp0GsYq y\|V4DwsKye>8FsD<5|<(ǹF=%˼dw\\̧;,v.?Y>sq2<5|q.Ynsq 3bj..aݻ:50ǹ7̼O\\̧>sq 3qk\\̻H%ͼ{WSsqI3p۹Ḣ}f>ykx\\ByT9wNSyT9wN坓yd9wN杓yd9wNSyT9wNSyT9wN坓yd9wN杓yd9wNSyT9wNSyT9wN坓yd9wN杓yd9wNSyT9wNSyT9wN坓yd9wN杓yd9wNSyT9wNSyT9wN坓yd9wN杓yd9wNx/8şx/8ς\4ga.>+q.+NsYq\|VByg*L坩3wTޙ;yg2Lɼ3w&dޙ;Syg*L坩3wTޙ;yg2Lɼ3w&dޙ;Syg*L坩3wTޙ;yg2Lɼ3w&dޙ;Syg*L坩3wTޙ;yg2Lɼ3w&dޙ;Syg*L坩3wTޙ;yg2Lɼ3w&dޙ;Syg*L坩3wTޙ;yg2Lɼ3w&dޙ;Syg*L坩3wTޙ;yg2Lɼ3w&dޙ;Syg*L坩3wTޙ;yg2Lɼ3w&dޙ;Syg*L坩3wTޙ;yg2Lɼ3w&dޙ;_b.+ÂqOHP.] u1`]Lu1d]Hu"K]ŋ]ER.],ub]luf]huE;KY΢wE,zg;KY΢wE,zg;KY΢wE,zg;KY΢wE,zg;KY΢wE,zw.yw.zw.yw.zw.yw.zw.yw.zw.yw.z纜?mZɬJoO5t'OV97^!-BZi"EPCZ i;? NZ j18i1Ŕ8ŤZ)-RZςI-Z/i87ŋZ΍8iQҢEIE-Z(jŒ87ŢZ[Zlis? NZlj΍8iҢ΍,8iԢ΍8hQwĝE,rg;YwĝE,rg;YwĝE,rg;YwĝE,rg;YwĝE,rg;YwĝE,rg;YwĝE,rg;YwĝE,rg;YwĝE,rg;YwĝE,rg;ܹĝKܹĝKܹȝܹȝܹĝKܹĝKܹȝܹȝܹĝKܹĝKܹȝܹȝܹĝKܹĝKܹȝܹȝܹĝKܹĝKܹȝܹȝܹ+y/[QEKX-6oѺE4;s[o1t[Lb[$oܜέܜέܜέܜέܜt65lMgs:[ٜt65lMgs:[ٜt65霗s}f=- x^̻".B]v1P] v1T]Lv"Ed/uR/vb.J](vR],vV]lvEVs}yX.! zg;CΠw3! zg;CΠw3! zg;CΠw3! zg;CΠw3! zg;/uq}M>+];s;s;s;s;s;s;s;r*mY+1]R.]Xb.b.6huE˹'w]YrXq"E`.b.b.R]HvB9坓9S9坓9S9坓9S9坓9S9坓9靗u+N];SޙΤw3ILzg;SޙΤw3ILzg;SޙΤw3ILzg;SޙΤw3ILzg;SޙΤw`?5݂Bw0uRwx/ݡtt;lݡuJ3YLf4,di&K3YLf4,di&K3YLfri&fri&fri&fri&fri&fr;?7hY_7k; >%DRJ=,RK=lV[=zhAz?CPB= 0PC=L0TS=zH!Ճ|r'|r'|r'|r'|r'|r'|r'|r'|r'|r'[>ɖO|-ld'[>ɖO|-ld'[>ɖO|-ld'[>ɖO|-ld'[>ɖO|-ld'Ϸ7=|c.^{A|j6j"D`CM 51`SML51d&RMH6R/5R/6QjDbKM,5b[Ml5f&ZMh5r̐c3! 9f1r̐c3! 9f1r̐c3! 9f1r̐c3! 9f1r̐c3! 9f19C9䘃9C9䘃9C9䘃9C9䘃9C9䘃9.Â=a?,~y{A|j<5GR&M,5RMl5VMh5jğ?ğ&_>6j"D`CM 51`SML51d&RMH6!ǜr)ǜt)ǜr)ǜt)ǜr)ǜt)ǜr)ǜt)ǜr)ǜt̔c3IL9f1St̔c3IL9f1St̔c3IL9f1St̔c3IL9f1St̔c3IL9f1St׿N?O}>aZ~Z-Q%xpF7_7UBRI"$EPA)bH!)bPA)bJ))bRI)RRHI"%ERI)^%)^%)^E)^E)JR(IQ$EQE)XbI%)XbQE)ؒbK-)ؔbSM)ZRhIђ%ES-)JYmhDE,f6KYmhDE,f6KYmhDE,f6KYmhDE,f6KYmhDE,f6KYmhDE,f6KYmhDE,f6KYmhDE,f6KYmhDE,f6KYmhDE,f6hs6hs6hs6is6hs6hs6hs6is6hs6hs6hs6is6hs6hs6hs6is6hs6hs6hs6is6&Ê.F,&n?{|jgE|jQҢEIE-Z(jŒKZ,iŢZ,jŖ[ZliŦZljҢEKM-Z4hiş'-x/8hgA#-+Zi"EPA-Z i1ŐCZ j1ŠZLi1ŔSZLj1ŤZHi"ERI-Z;s;s;7s;7s;s;s;7s;7s;s;s;7s;7s;s;s;7s;7s;s;s;7s;7ŝ-lqg;&w6ŝ-lqg;&w6ŝ-lqg;&w6ŝ-lqg;&w6ŝ-lqg;&w6ŝ-lqg;&w6ŝ-lqg;&w6ŝ-lqg;&w6ŝ-lqg;&w6ŝ-lqg;&wTn~}}|ן3َb-RH[x-X-ny-ZMgp:Ct34 Mgp:Ct34 Mgp:CΡΡΡΡΡ)=7?,ײ)=7yWEb.Xb.b.Z]hvrT].GuYq"E`.b.b.R]HvB9坓9S9坓9S9坓9S9坓9S9坓9靗C{HyО.ޙΔw&3)Lyg;ޙΔw&3)Lyg;ޙΔw&3)Lyg;ޙΔw&3)Lyg;ޙΔw&3靗wx/F75u^ ou"E.b.bT.]$xx(uQE.Xb.bV.]%qE;@uQΒwE,yg;YΒwE,yg;YΒwE,yg;YΒwE,yg;YΒwE0%E\%\E\%\E\%\E\%\E<+o^t羟W|VU~Q䳢MW|}l[5Jj(QTFQKj̓'5XTcQE5RǞ>? =ƦjlFK |FSM5jԸ+j|V8]qR,YpRC,YqTC,YqTC,]qR,YpRC,YqTC,YqTC,]qR,YpRC,YqTC,YqTC,]qR,YpRC,YqTC,YqTC,]qR,YpRC,YqTC,YqTC,]qR,YpRC,YqTC,YqTC,]qR,YpRC,YqTC,YqTC,]qR,YpRC,YqTC,YqTC,]qR,YpRC,YqTC,YqTC,]qP#Ģ! hE,d Y4Ģ! hE,d Y4Ģ! hE,d Y4Ģ! hE,d Y4Ģ! hE,d Y4Ģ! hE,d Y4Ģ! hE,d Y4Ģ! hE,d Y4Ģ! hE,d Y4Ģ! hE,d YtEXtEYtEYtEYtEXtEYtEYtEYtEXtEYtEYtEYtEXtEYtEYtEYtEXtEYtEYtEYtʝ:K"J+ƧʭoV+fߨ|Fg$GQE9r(QcI(YqcQE9XcQ-9tgQM96ؔcSM9Zr\ϊM9r4hђρ'9>'*x8^qcHϊ'9+r#(GPA9r ɡ|VcPA9cJ=(ǤrL1)Ǥ)9xϊI9r$HʑCT:IT:IT:IT:IST:IT:IT:IT:IST:IT:IT:IT:IST:IT:IT:IT:IST:IT:IT:IT:I)*MRiJT$&4I)*MRiJT$&4I)*MRiJT$&4I)*MRiJT$&4I)*MRiJT$&4I)*MRiJT$&4I)*MRiJT$&4I)*MRiJT$&4I)*MRiJT$&4I)*MRiJT$&4I79>6^1}Vv#{:lxϊ!9r#(GPCr 1(Ǡr 1(ǠSrL1)ǤrL1)Ǥ)9r$Hʑ#)GR////%9r(Q(GQKr,ʱ(Ǣr,ʱ(Ǣ[rlʱ)Ǧrlʱ)Ǧ-9r4hє)GS%*-RiJTZ"H%*-RiJTZ"H%*-RiJTZ"H%*-RiJTZ"H%*-RiJTZ"H%*-RiJTZ"H%*-RiJTZ"H%*-RiJTZ"H%*-RiJTZ"H%*-RiJTZ"HKTHTHTHTHKTHTHTHTHKTHTHTHTHKTHTHTHTHKTHTHTHTH1Eۛ߭ӊoW߿iyX1?Ua+-W,vU>W{OϻBwQ+߽=q,p;~Zxq<';==qLx\>܍w]?ܽGGn|6~zzq<;==qx\>ݍ/w]?ݽgznI|V~|q<7;==qx\>ލ@w]?޽n|vx\?]?8ߏ |i+^q+YqKq7"womp<=qVn#8q3<8y@wqǝ`ל<7v$dM184qUh=8ybwq]˝`8LM7S+^q<qx8ga<ϔ~i<>+YqԴ6SfjLMi35mԴ6SfjLMi35mԴ6SfjLMi35mԴ6SfjLMi35mԴ6SfjLMi35mԴ6SfjLMi35mԴ6SfjLMi35mԴ6SfjLMi35mԴ6SfjLMi35mԴ6SfjLMi35mԴ6SfjLMi35mԴ6SfjLMi35mԴ6SfjLMi35mԴ6SfjLMi35mԴ6SfjLMi35mԴ6SfjLMi35mԴ6SfjLMi35mԴ6SfjLMi+5]??w||W|w[^~{{=||W|(Ywi/㻂ogES#xnݿk*z7wmp>=qIEo#8IEv{k*q>=qMEv{k,z7qEƢ8%O,|\cNqEqk,|\sѻk.zN5}q>.|Lrѧ㚋>vzk.x|\sѧݞGr>{k0x|\Hѧ>vzk0x|\ѧݞ㚌NjqMF㚌>8dv>^$O=5}8d&O=5|\ѻ8hDQDO=5}8hFO=5fw|\{㒍|'}q>cf85}y>|l5{o7>8pv>6?nq G;=5}q>nqMG9tm5}q>.|4?nqMG;=5}q>n?ϊ||V48^qϊ|W#~448ga>8`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0? 4`~Oi0? 4ga>>+^q||VT8ga>+N1~>>+i>+NYqϊ|Yq槃`~:槃`~:槃`~:槃`~:槃`~:槃`~:槃`~:槃`~:槃`~:槃`~:槃`~:槃`~:槃`~:槃`~:槃`~:槃`~:cܯ*-ӊ{\%׼RGb},b}lf>}4h1{ũS>}c>c>&#Gd>觓~:駓~:駓~:駓~:駓~:駓~:駓~:駓~:駓~:駓~Ӥ&4I?MiO~Ӥ&4I?MiO~Ӥ&4I?MiO~Ӥ&4I?MiO~Ӥ&4I?MiO~O+ ?^T^=X'qS%GPA=zcPA=cPA=cRI=&cRI=&#GRI=z$HE=^E=^E=^E=^ԣGQE=z(QcQE=XcQE=XcSM=6cSM=6ԣGSM=z4hңȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"tOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOt]No:N:cߕJOU=;=z(QԣGQE=XcQE=XcQE=6cSM=6cSM=z4hԣGS-=x8gA#=>+zgYA=z#GPA=cPA=cPI=&cRI=&cRI=z$H#GR&n&n&n&n&n&n&n&n&n&n&n&n&n&n&n&n&n&n&n&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&wzOƾՃ|Z?V9A>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>m}1`} 1d}L#Gd/b/b>}(b},f}lGVA? iO~Ӡ4A? iO~Ӡ4A? iO~Ӡ4A? iO~Ӡ4A? iO~Ӡ4觃~:觃~:觃~:觃~:觃~:觃~:觃~:觃~:觃~:觃~:觃~:觃~:觃~:觃~:觃~:觃~:觃~:觃~:觃~:觃~:觓~:駓~:駓~:駓~:駓~:駓~:駓~:駓~:駓~:駓~:駓~:駓~:駓~:駓~:駓~:駓~:駓~:駓~:駓~:駓~:I?MiO~Ӥ&4I?MiO~Ӥ&4I?MiO~Ӥ&4I?MiO~Ӥ&4I?MiO~Ӥ&4ϊw}1>>}:#G`>c>&c>}$H>^>^Gb>Xc>6c>}4hE?-iO~ZӢE?-iO~ZӢE?-iO~ZӢE?-iO~ZӢE?-iO~ZӢtOtOtOtOtOtOtOtOtOtOt]>?+n{(Qb:؇kYqCCVS>+N}|~Y#G`>N>+}y'{O|VNN|VNn馟n馟n馟n馟n馟n馟n馟n馟n馟niO~Ӧ6M?miO~Ӧ6M?miO~Ӧ6M?miO~Ӧ6M?miO~Ӧ6M?mi_t{淋߿q{ϊ}s= +({ VA=z#Ǡzϊz O+NzL1?81Ǥ:GR:GR:Njz8/+Nz(QԣGQE=z,걨8걨Ǣ:Ǧz|ϊzl+Nz4h?+z4h+z\MzGO|/RiOjՃ| ^\4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧ_1ȧ|:ȧ_?W91ȧ|z=%V *G=ȧ|:ȧ|:ȧ|:ȧ|:ȧ|:ȧ|:ȧ|:ȧ|:ȧ|:ȧ|:ȧ|:ȧ|:ȧ|:y{ɂ +JU:t~aE=z(QԣGQE='=XC矾WcS]qcSM=t{YM=twIM=t{Q#=>+zYqcHϊGzYq#GPA=zcPA=t>wIA=g=&CWcR^q#GR]q#GR^qփ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧ>߿z݊==&1y=x/ޣx=x{lޣy=sZ89-iqNsZ89-iqNsZtqNtqNtqNtqNtqNzѬEΧ*M(Qb},f}lGf>Z}\O:ÊS>}1`} 1d}L#GdM?M?M?M?M?M?M?M?M?M?ttGO'V6M?miO~Ӧ6M?miO~Ӧ6M?miO~Ӧ6M?miO~Ӧ6 ?t*9]]`>}c>c>&H#Gxxb>}Xc>c>6hGw}z"sӠ4A? iO~Ӡ4A? iO~Ӡ4A? iO~Ӡ4A? iO~Ӡ4_1_p?8A?A?A?A?A?A?A?A??s/qzq^ӋӋuzq^ܧ(YFq)*Q8GTV8QqjOLWxm]k}v}vqAj%1 E-ŶJNBGcs&jRvl6[:tuաCW]:tttttttttttttttttttttoگ]/Ǜv|8?8r|_͸'%%%%%%%%%'0?]8r|_͸şཏx3ގ8c v)Zإka®] >^|7Z/׿;r0=a~g?10ggO0|kazw|{o!Rϐ@2$P( z2$P( z2_( zJ=C2$P2$P1 0/ Y؁n:^Pge!!!CCCԣGWQQQ]=D=D=Dt"Eԋ^DzՋQ/^z"EKW/^Dzjߛe%K////?GH#H2"`?2"`?2"`?az:G d%gYr6$c} KO?q~#&o"&o"&o"&o"&o"&o"&o"&o"&o"&/K_"ȿD%/K_"ȿD%/K_"ȿD%/K_"ȿD%/K_"ȿD%{_ |>?~ +WЯ_A~[oA;~E~ ?? ?O'~>߆6 mo߆kῆkῆkῆkῆk῾oϞ~>O|?~_o|>࿀ /࿀ /࿀ /࿀ /࿀ o߀7 oIϭ}\|a^ N_N7N}?qzOrNsv}~;=q?}y?}~zOO8uuY7uuuY7uuuY7uuuY7uuuY7uyϺg]"Y_?~ϺD%.YKd]"uyϺD%.YKd]"uyϺD%.YKd]"uyϺD%.YKd]"uyϺD%sϺ=>ȺsϺ=>ȺsϺ=>ȺsϺ=>ȺsϺ=>ȺsϺ=>ȺsϺ=>ȺsϺ=>ȺsϺ=>ȺsϺ=>ȺYW+d]!uuϺBYW+d]!uuϺBYW+d]!uuϺBYW+d]!uuϺBYW+d]!uuϺBnݳnݳn!nݳnݳn!nݳnݳn!nݳnݳn!nݳnݳn!n襧ӏ_m}0?tݏ/_8pp oq|ߏo8~_8>p|q?~'8~8>q|{mFm޾FmF{mFm޾FmF{mFm^Szk^Szk^Szk^Szk^Szk^Szk^Szk^Szk^Szk^Sz{?։? ݯMR|=￰go_Ͽ?p]_\\\O\O\O\O]ޯ?qO\ןp\p]ݯp/\ _/\/\/\/]_o\o\o\߸7qo\/ _P̧/ _BS9/ _/ _ŝ/ _/ _ŝ/ _/ _ŝ/ _/ _; ߟ~~ ߟ'~~ ߸ ; ߟO~B|3g=矇/ϱ}0?Ϙ_ϟcN_ $&xB~PgT<]A/p72 8e;?A/pcsq2ޣ<9`=W79o'\]Ѓ7t<|C]҃>' o8^9 {?Ҟ.eۼ>KR>A?t}7/p܇sOh8ฏ}F턛|ʃw9<|CSW]W8;/ǝύy~}Neqvqw@p@p@p@!gmɃ8ڔo8ږo8ژoyr6e턫p0:|}7}7}7W=9`GGv6b8Y ك> FeeFelpuQpu':Np':Np':Np:Np;Np':Np':Np':Np|& NtǛŞD'8 Nt3 9D'8 NuST'8D'8 NtD'8 NtD'8 NtT'8 Nu NtD'8 NtD'8 NtD'8 NuST'N0 &:D'`LtN0 &:D'S`Lu>#p@p@p@!r< Q=hП.y^y^yx^zގy(h.,y(_y(_yW7QQ%6

n/}qϽ (P @HP`@R`H &P`B &R`J  $H(P @J@@@H ((PP@IXP`AXR`I 6P`C 6R`K  4h(P@C0& 0a CLb0& 0a CLb0& 0a CLb0& 0a CLb0& 0a CLb0& 0a CLb0& 0a CLb0& 0a CLb0& 0a CLb0& 0a CLb&`&`&`!&b&`&`&`!&b&`&`&`!&b&`&`&`!&b&`&`&`!&bq0߃ǟl>\|o2ڃǟL>(p/=(PP@A () ,(K ,) l([ l)P@C  h(0 ̯+0 ̯ /)P @@ )0 (0C )0 L(0S L)P @B  H)&` &` &`)&b &` &` &`)&b  7}~QL8?mM0N0N0N1N0N0N0N1&0 &L0a Lbo~PLx`7 &L0a L`0 &L0a L`0 &L0a L`0 &L0a L`0 &L0a L`|` o_&g-)&L0a L`0ń &L0a L`0ń^3?z?pO?q'O8?qpp~ /p oq7o8+_! WȿB+_! WȿB+_! WȿB+_! WȿB+_! WȿB-B-B-B-B-B-B-B-B-B-B-B-B-B-B-B-B-B-B-B-BmFmFmFmFmFmFmFmFmFmFmFmFmFmFmFmFmFmFmFmF5k_#ȿF5k_#ȿF5k_#ȿF5k_#ȿF5k_#ȿGPyp4@`B 00CL 01S$H  5|0|4@aJ, 0Kl 1[4h 1@ IHP0$ %a IHP0$ %a IHP0$ %a IHP0$ %a IHP0$ %@$@%@$@%@$@%@$@%@$@%%~k^矟x~y8!ov9$(HP AA% J,H  ,H$KlH!lH%[4$hHА!AC- ̯._$.\$^p A@ $I`@ $`@! $`B &$`B) $ !AB $HIt8At8At8ESt8Et8At8At8ESt8Et8At8At8ESt8Et8At8At8ESt8Et8At8At8ESt8E :Lat0E :Lat0E :Lat0E :Lat0E :Lat0E :Lat0E :Lat0E :Lat0E :Lat0E :Lat0E߰E?=?\g=~"_ߚ ycvh̯Gݹ>.:b"~˯GUo lpA/_mp B68툛 #n68l0`.Aw/lp܅q2m̓ lpqq#zǝ҃ 鸓z|]xiq'ǝWrO68TzoGlp qq`?k:&d<ߙ%w/lp܍q2 Χ=|G77įGlp1?;|;ϗ{7w/lpܱqKduyvG)zGk`?k:Z7{GG+Gk2Gd}{qQqќ<`G e fe e jK68#n68ʡ#n68ڣO_.=x[K<ڧo68کo68ګ68'Op|툛 >t4l2/e e e c,|;f$|=bBXh -bE,"ZBXjK-bE,"Z|O6 ` 6 ` 6 d B6 d "ZBXh -bE,xWE,"ZRXh -bE,"ZBXhK-bE,"ZRXh -bE,"ZBXhK-bE,"ZRXh -bE,"ZBXhK-bE,"ZRXh -bE,"ZBXhK-bE,"ZRx<h -bE,"Zo_m"ZRXjK-bE,"ZBXh -bE,"ZRXjK-bE,"ZBXh -bE,"ZRXjK-B". -B". -B".K-R".K-X'lAm6 ` B6 d B6 d -B". -B"oGxjK-R".K-B". -B". -B".K-R".K-B". -B". -B".K-R".K-:Z߯h d<_N%-GK\@|_>|IgKvULr>8j|pԄ2ϚyeΚ>8j'/ ~Κ툛Κ툛 >8z|p|p/|p/p>`gOvgOvGQ E჌ij(|惣(|想(| (|;想(|;惣)|AGS /l h _l _.ꃣ)|/l ߎl ߎ`U>_}~ `U*|Q>ׂYq>·#n> > > 䃐B> 䃐B>8 ( dY>QY\GY!e7e7m&|p2Nl h _l _.ꃣ-|ζ툛ζ툛 u჌ u7u7u\}pԅO>H ߎ ߎ}F'n}F'n[}V'n[}V'n}F'n}F'n[}V'n[}V'n}F'n}F'n[}V'n[}V'n}F'n}F'n[}V'n[}V'n}F'n}F'n[}V'n[}V'n>'6F}bOl>'V[}bOl^~A|A|A!|A!|>'6F}bOl>'V[}bOl>'6F}bOl>'V[}bOl>'6F}bOl>'V[}bOl>'6F}bOl>'V[}bOl>'6F}bOl>'V[}bOl>'6F}bOl>'V[}bOl>'6F}bOl>'V[}bOl>'6F}bOl>'V[}bOl}?3>B͓o ~f> 0Ah L04LL05 &HMLMP0Ai ,L4lL5 &hL@&21L db(C@&21L db(C@&21L db(C@&21L db(C@&21L db(C88C88C88C88C88C8o;_/; -}[7=AA J4(iP`A 4X`I% 4X`C 64`K- 4ҠAC Z4hi`~5_w ]u`~A 4_ A@ B4i`@ 4`H! 4`B &4`J) 4 AB R4Hi88S8ʼnS8ʼn88S8ʼnS8ʼn88S8ʼnS8ʼn88S8ʼnS8ʼn88S8ʼnS8ʼn NLpb'81ʼn NLpb'81ʼn NLpb'81ʼn NLpb'81ʼn NLpb'81ʼn NLpb'81ʼn NLpb'81ʼn NLpb'81ʼn NLpb'81ʼn NLpb'81ʼns98kW7j9FK74h A@! B4`@ 4`H! 4`B &4`J) 4Hh AB) R4@4@4H4H4(hPРAA% J4X`A 4X`I% 4`C 64`K- 4hhРAC- Z44(pb X'8ĉ%N,pb X'8ĉ%N,pbٿ}~@XĿ^"8N,pbKX'8N,pbKX'8N,pbKX'8N,pbKX'8N,pbKX'8N,pbKX'8N,pbKX'.p'.p'.q'.q'o{}x%NM .8|U ĉKkB_\4'.p'.p'.q'.q'.p'.p'.q'.q7,~?|?`ȇ J,l[46hlC|A` m0 Rp7 'n9qÉ[Nl8Ć[Nl8Ć[Nl8Ć[Nl8Ć[Nl8ĆN\_:?z _>߿^Ds}&L 4 M04LM05Ab R|0|4G&(LP4 ,M4lM5Ac 21L eb P&21L eb P&21L eb P&21L eb P&21L eb P&d@&eP&d@&eP&d@&eP&d@&eP&d@&eP&ב_>i_;o {ħ &(MP`a &X`c &ؚ1Ac {e_O ~-M 0Ah L04LL05 &HMLĩLĉLĩLĉLĩLĉLĩLĉLĩLD&&21LLdb"SD&&21LLdb"SD&&21LLdb"SD&&21LLdb"SD&&21LLdb"SϟƳ?w<#?}Ks'&L 4 M04LM05Ab R|0|4G&(LP4 ,M4lM5Ac 2L,eb! XR&2L,eb! XR&2L,eb! XR&2L,eb! XR&2L,eb! XR&.dB&.eR&.dB&.eR&.dB&.eR&.dB&.eR&.dB&.eR&?3__ Ͽ} }/m/}oG|^z 4(iPҠAI 4X`A% 4X`I 64`C- 4`K 44hiҠACu`5_w ~} /hA@ 4i  h0C i0Lh0SLi0AB 4Hi 8q78q8q8q78q78q8q8q78q78q8q8q78q78q8q8q78q78q8q8q'68ʼn-Nlqb'68ʼn-Nlqb'68ʼn-Nlqb'68ʼn-Nlqb'68ʼn-Nlqb'68ʼn-Nlqb'68ʼn-Nlqb'68ʼn-Nlqb'68ʼn-Nlqb'68ʼn-Nlqbh؛F{5/upr@τh%4h A@! B4`@ 4`H! 4`B &4`J) 4Hh AB) R4@4@4H4H4(hPРAA% J4X`A 4X`I% 4`C 64`K- 4hhРAC- Z44pb'81ĉ!N pb'81ĉ!N pb'81ĉ!N pb'81ĉ!N pb'81ĉ!N pb'81ĉ!N pb'81ĉ!N pb'81ĉ!N pb'81ĉ!N pb'81ĉ!NNN!N!NNN!N!NNN!N!NNN!N!NNN!N!NG{6(mlmؠo0A` m0 RSNp'8 'N9q‰SNL81ĄSNL81ĄSNL81ĄSNL81ĄSNL81ĄSN<h~sOly_߾&M`` &`b & 1Ab > > &(MP`a &X`c &ؚ1Ac XR&2xd- .  XR&2L,eb! XR&2L,eb! XR&2L,eb! XR&2L,eB&.dR&.eȖ [\&@&.dR&.eB&.dR&.eB&.dR&.eȕ 'ϧ{_S=P0Ai ,L4lL5 &hLpkA鈟/I"D!$BHDaH!DaH &DaJ)DaJ "DH!%BJD@DHDHDH "D(P$BIDXaI%DXaI 6DaK-DaK "Dh%BC1@%b,cKX"1@%b,cKX"1@%b,cKX"1@%b,cKX"1@%b,cKX"1@%b,cKX"1@%b,cKX"1@%b,cKX"1@%b,cKX"1@%b,cKX"b\ b\"%b\"%b\"b\ b\"%b\"%b\"b\ b\"%b\"%b\"b\ b\"%b\"%b\"b\ b\"%b\"%b\"u>*iDE>o'~?8] "D(P$BIDXaI%DXaI 6DaK-DaK "Dh%BCuaE_w~=" "/kM"D!$BHDaH!DaH &DaJ)DaJ "DH!%BJ1n1n1n1n1n1n1n1n1n1n1n1n1n1n1n1n1n1n1n16A blc["16A blc["16A blc["16A blc["16A blc["16A blc["16A blc["16A blc["16A blc["16A blc["1ye~Oς:}˂#/#XB?t~ﷀίߧgRގ[lG[,Pޮncyv/a^OZhjOZ(sdytG!vggvgv%wkӣ5qS\qW\qT\O8{;J'A|5wkM!wkeەܭqq8g)Wk)Wkߓ5GyގjI?_xGyvgvgv%wk-5M?~igzG~64ԆPjCmh 64؆`lCmh F!kFAkFAkFAk 64Ԇ|;n 6|ܭ64؆|?j 64ԆPjCCmh 64؆`lCmh 64ԆPjCCmh 64؆`lCmh 64ԆPjCCmh 64؆`lCmh 64ԆPjCCmh 64؆`lCmh 64ԆPjCCmh 64؆`lCmh 64ԆPjCCmh 64؆`lCmh 64ԆPjCCmh 64؆`lCmh 6t jCС6t lC6t lC6t lC6| 5BY#d55Z#h5Z#h5ZCmP:Ԇ ߎ[m`z&J`:؆/?j mP:ԆCmP:؆m`:؆m`:؆mP:ԆCmP:؆m`:؆m`:؆m8'keV|?G<]_e=y,;_O|,;.%|;yβkY<v>y䍣|䍿Η38S8ηK{h;QvrvrQw>ycG$7;_θ{;_Oz;.|Ƣ7κ7κ7[8'AWrgzgv)wo}76q\q\qOhy(<my医77R8 Go4q\qܼ1-yc烠\txq<Snޘgv)Wọ|˷67xrF!oFAoFAoFAoy>ycG$7<_θ{<_Oz<.|Ơ777S8J'AWrgzgv)wo7&q\q\qOHyh=My医77R8ZGo$q\q\^tEz^tE'{^tE'{^tE'{ѩ^tEz^tE'{^tE'{^tE'{ѩ^tEz^tE'{^tE'{^tE'{ѩ^tEz^tE'{^tE'{^tE'{ѩ^tEz^tE'{^tE'{^tE'{T/EShM^4ً&{d/EhM^4ً&{ y#䍐7Bz#荠7z#荠7z#荠7P/EShM^4ً&{d/EhM^4ً&{T/EShM^4ً&{d/EhM^4ً&{T/EShM^4ً&{d/EhM^4ً&{T/EShM^4ً&{d/EhM^4ً&{T/EShM^4ً&{d/EhM^4ً&{T/EShM^4ً&{d/EhM^4ً&{T/EShM^4ً&{d/EhM^4ً&{T/EShM^4ً&{d/EhM^4ً&{ϟq`lS|]GV1ccp1ǘcr1&H#9Frpp1cXcq1cs16h9FkRS-h1E)ZLRS-h1E)ZLRS-h1E)ZLRS-h1E)ZLRS-h1E)ZLѥ]L]Lѥ]L]Lѥ]L]Lѥ]L]Lѥ]L]Lu]I\q ryz-W{8ŝw\qܓrqdE{5O.y=j=λk㸿zǢ=;S8O㸋{/O_y$.ާ=_OW|=jnZ87q;H_Og}?jo=}q}ˉ.3~=j=λk~/C=j=η=cͳxtok~ؿސz^O|1>|kw=irGA{GA{GA{GA{=cgO$=&=ή=6Z8G{ l^OOhŞq]wfO/8سY{=j{{=j{=֟{=j|?j%|w>O_#>IzbϦ=.=ζZ8G{o=N=ԚNdk:ٚNdk:ٚNdk:ٚNdk:՚Ndk:ٚNdk:ٚNdk:ٚNdkzTlM'[Ӿr[|\t5=_~lM'[өt5lM'[t5lM'[t5lM'[t5lM'[өt5lM'[t5lM'[t5lM'[t5lM'[TklMi5M4ٚ&[dklMi5M4ٚ&[O#h=#h=#h=#h=Ԛ&[dklMi5M4ٚ&[dklMi5M4՚&[dklMi5M4ٚ&[dklMi5M4՚&[dklMi5M4ٚ&[dklMi5M4՚&[dklMi5M4ٚ&[dklMi5M4՚&[dklMi5M4ٚ&[dklMi5M4՚&[dklMi5M4ٚ&[dklMi5M4՚&[dklMi5M4ٚ&[dklMi5M4՚&[dklMi5M4ٚ&[dklMi5Ms^{胦V)W};e|s)sײxϷ?79KS:e|#菠?#菠?#菠?#菠?8k' E4_)W)W\qԢYrYrً>cg/?ENE_OE_ꏣ}Ǥ?^?^픻?bI蓦IUrYrY^G1菤?b?b픻?flF45o\q6\q6rь>C)W)w?8'M};ꏳ}=ꏳ}?jE)W)w?qvO.n픫?n?nZ8G,F_OFN,G鏳}to\q\qrQ>cg9zg9vg;䏦?vIӦ?jGNlG_OlG_ꏣ}Gg;zg;v؟bZOi?-؟bZOi?-GAGAGAGA؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-؟bZOi?-b؟.b؟.b؟.b؟.+菠?#?⏠?#菠?#菠?`؟.b؟.b؟.b؟.b؟.b؟.b؟.b؟.b؟.b؟.b؟.b؟.:>VXKtJq9s,α8slα9s4hќ5Ks/ͱ8Gp9s 18sL19s$HΑ#9t3O7t3O7t3O7t3O7t3O7t3O7t3O7t3O7t3O7t3Oyf6󴙧 iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA>A>A>A>A>A>A>A>A>A>A>A>A>A>A>A>A>A>A>A>A>'}>qM՞w8IoϷ='=z(QԣGQE=XcQE=XcQE=6cSM=6cSM=z4hԣGS-=_c~I%=_c~IE=z#GPA=cPA=cPA=&cRI=&cRI=z$H#GRI=ȧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO| .7=ȧI>o+zO|$&4ɧI>MiO|$&4ɧI>Mi#++WLHpEqEM5-jZԴiQӢEM.j颦.j"a?(Qcq=6ܣGk=~#{L1GrO7}Mntӧ>O>mӦO>mӦO>mӦO>mӦO>mӖOտa}={ 1{$HQܣ{lGsA}iЧA}iЧA}iЧA}iЧA}iЧ>O}:AtЧ>8^+>F>(Qcq=6ܣGk=~#{L1GrO'}:INtҧ>O>M4ӤO>M4ӤO>M4ӤO>M4ӤO>M4ӤO?Or_ۊߧ>)g #8Gp9cp9&瘜cr9s$pp(Q8Gq9Xcq96؜cs9s(i1OyZb󴘧<-i1OyZb󴘧<-i1OyZb󴘧<-i1OyZb󴘧<-i1OyZb󴘧<]<]<]<]<]<]<]<]<]<]<]GZ>km=rV|8Gq9s,α8slα9s4hќ5+.s/6Gp9s 18sL19s$HΑ#9t3O7t3O7t3O7t3O7t3O7t3O7t3O7t3O7t3O7t3Oyf6󴙧(Qcq=6ܣGkw_#Gp=cr=INtҧ>O'}:I&}iҧI&}iҧI&}iҧI&}iҧI&}iҧI~#Gp=cr=>={Xcq=6hڣӢO>-ӢO>-ӢO>-ӢO>-ӢO>-tѧ>]O}E.tѧ>=*!|w(+ҐY8Gq9Xcq96؜cs9s4hњ|V\#8Gp9cp9&瘜cr9s$`nfnfnfnfnfnfnfnfnfni3OyfOxyf6󴙧 9~>q9sXcq9؜cs96hќ9Gk969s18s 19sLΑ#9Gr<<<<<<<<<{uۊϷ^q8s,α8V|sm[~њO,>{mb [~<0Ϸ^qy'`o:O,>{u)Y|S>|9<-i1Oy'`o:O,>{u)Y|y'`o:O,>{u)Y|S>|9_?=gd>u{Ϥo /O'|xS~~^: QE=z(QԣǢz,걨Ǣz,걨Ǧzl걩Ǧzl걩GSM=z4hԣWzOzr}tIYO~M%=W#GPA=zcPA=cPA=cRI=&cRI=&H#GRI=z$ n&n&n&n&n&n&n&n׵zO7|M>M>M>M>M>M>M>M>M>M>miO|&6ɧM>=QiOgt?NJ>miO|z&6KSzO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|z>QiOg?NJ>miO|&6ɧM>miO|&6ɧM>miO[|NW?s;}gNx-YSߦ|8%GPA=zcPA=cPA=cRI=&cRI=&#GRI=z$HC=>C=>C=>C=>ԣGQE=z(QcQE=XcQE=XcSM=6cSM=6ԣGSM=z4h#ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| tOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtOtO^^Z|{,F~F~~#{+{+{Ч>{xW\O'}~AN^q݃>M4ӤO=ӤO=ӤO=ӤO='z]_|[翦O#8s 18sL19Gr9s|8LJs|8LJs(Q8s,α8slα9Gs9Zs󴘧<-9瓎.+ns0OyZb󴘧<-i1OyZb󴘧<-i1OyZb󴘧<-i1OyZb󴘧<-b.b.9瓎.+ns0Ot1Ot1Ot1Ot1Ot1O|Jǿ#?reOtJq9s,α8slα9s4hќ598rYq#8Gp9cp9&瘜cr9s$HΑyyyyyyyyyy%q9l;W|l}q9s 18sL19s$HΑ#9LJs|8LJs|8Gq9s,α8slα9s4hќ5G0Oy`yy`4< i0Oy`4< i0Oy`4< i0Oy`4< i0Oy```yy:y:y:y:y:y:y:y:y:y:y:y:y:y:y:y:y:y:y:y:y:y:y:y:y:y:y:y:y:y:y:y:y:y:y:y:y:yd&4c>{‡g)_N #GPA=zcPA=cPA=CO^qCO/O1ǤI=W=>I=z|⪇_rC=>ԣ⪇_rգGQE=XcQE=XcQM=vW=v>zlCow^qCow/AOԣGO7=iO|Z o/cOA> ׵zO|ʷ\ 4ȧ| 4ȧA> )>4ȧA> iO|ʷ~A> iO| +zO| +G=ȧA> \ 4ȧ| 4ȧA> )>4ȧA> iOo^qӃoA>A>)zOoI\ G=ȧ|ʷăSzOtOW=ȧ|:ȧ|:ȧ|ʷ~A>A>A>'}>qiOzϕ|S8)N)QԣGQE=zXcQE=XcQE=cSM=6cSM=6hԣGSM=z_c~I%=_{E%=[q#GPA=zcPA=cPA=cRI=&cRI=&#GRI=z$Hԃ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧ|:ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧ_0_iEp{ 1={|LJ{({lܣGѧE}ZiѧE}ZiѧE}ZiѧE}ZiѧE}ZO}E.tѧ>]O}z>]7ˊ>RCoIG9Xcq96Л6|emzfO:q>i ']V#8Gp9cp9>ttYq#9\瓎.+ns0O&u}i0Oy`4< i0Oy`4< i0Oy`4< i0Oy`4<<<=qӯ+s0Ot0Ot0Ot0Ot0Ot0O%O0nۇa>>ۇ}W]5HqU)2U W*U\WOWUqj\WUqj\WUy?Uyj^WUyj^ʫVy*Z=ZUjWU^7~]ӧqt\?Oi]?]OӾ}ZWU]VuժZU2QjC1 DȲ%7֒&M w5 qxp<<~ qxx8q<8<† ,l† ,l† &.LX0aa„ &.LX0aa„ &.LX%v}:~^x~=?]Kua߿r=aaaaa/_ >OƧoooo ~6c?_/f|7Qz:uOD=2lc? ! \*<93Z_߸߸߸_|/߸7.q}^ / /@x‹;ŝNx ^ g|w‹;/@x ^ / /@x‹;ŝNx ^ ^ / /@x‹;ŝNx ^ ^ / /@x߻'^ /w‹;/@x ^ƝƝƝooo o o oooI狿޸  ,'q'  www   '=\;۟@??;v' W_p_____߸߸߸W߸7q}u__W?Wϯ:~_}ܯ>p\}Wqqyy_}ޯ>qO\}W;;MMM;;MMM;;MMM;;MMM;;MMMz K^`z K^`z K^`z K^`z K^`z K^`z K^`z K^`z K^`z K^`}x{͒p.p_/_u|_:~:~߸|߸_>7.q _/_Н__xu wvq|_/w:~\\\\_>˟ˇurˇurO\>O\6o6o6o6oߩo6o6o6o6o6o6o6oߩo6o6o6o6o6o6o6נ5A} kP_N} kP_נ5נ5A} kP_N} kP_נ5נ5A} kP_N} kP_נ5נ5A} kP_N} kP_נ5נ5A} kP_N} kP_נWxn8n㿯w\?p?p?p?p?p?q?q?q?qO\ן'?q\p\p/\ _p ׿p ׿p ׿p ׿p׿q׿q׿q׿qo\߸7/ _/ _w>W \/|~_/ _/ _/ _/ _/ _/ _77777777w>u7S7w>x7ǃ777777|t;x|9?·_P@a 6 ,l`i6@c 460( w]6@` 60 l`h6@b 6I81 '&$pbNM‰I81 '&$pbNM‰I81 '&$LL$LL$LL$LL$LL$LL$LL$LL$LL$LL$LL$LL$LL$LL$LL$LL$LL$LL$LL$LL$`~0 ?M&I$`~0 ?M&I$`~0 ?M&I$`~0 ?M&I$`~0 ?M&I$,L$,L$,L$,L$,L$,L$,L$,L$,L$,L$,L$,L$,L$,L$,L$,L$,L$,L$,L$,L$\ pa.M…I0 &$\ pa.M…I0 &$\ pa.MuI͗/o~i&/x@a 6P6 ll`c@c 46o3~7G~e 6@h60 Ll`j $6@jpcnMI1 7&$ܘpcnMI1 7&$ܘpcnM$lL$lM$lL$lM$lL$lM$lL$lM$lL$lM$lL$lM$lL$lM$lL$lM$lL$lM$lL$lL?_z<Ω~_zk,0 $H @ PH` H`(&H`"&H`* $H$H @"T>H>H>H>J ($PH@!RXH`!XH`)6H`#6H`+ 4h$H@#VL`0& 1a L`0& 1a L`0& 1a L`0& 1a L`0& 1a L`0& 1a L`0& 1a L`0& 1a L`0& 1a L`0& 1a p p p p p p p p p p p p p p p p p p p p /E+'vߗ ~~ >;?_8c ~ z>ϛ^gy|`.8"vR^ۇ~;~)/V__KppS 7^\Jp<Ϸ^ǝËp}qvRJpܹีy*y_p)qsP7Oo/%8n^7_o/%8n^~k l{_p)qP??"o/%8/^c$!o/%8O_~k ܧyz;%8HP^yB/_y|ߐq vu~9~+Ğc<$K KP??"exx>|XJpXGc^Ã/`%(@ J0P `%(P J0T pE%(ގ_Jpaz;~)^~z9~-!J0UÆ/e%CO/ގ_Jp趇Cȇ{;~)^~{9~-Jp|L5>K ` '10pN c8a '12SpN)c8a '10pN c8a '12SpN)c8a '10pN c8a '12SpN)cx<0p|x` '1<o%12=J c8e 10pN c8a '10pN)c8e a&a&a&a&a&aaaa&a&a&a&a&aaa `%(@ J0P `C%*P J0TÄ1LÄ1LÄ1LÄ1LÄ1LÔ1LÔ1LÔ1LÄ1LÄ1LÄ1LÄ1LÄ1LÔ1LÔ1LÔ1LÄ1LÄ1LÄ1LÄ1LÄ1LÔ1LÔ1LÔ1LÄ1LÄ1LÄ1LÄ1LÄ1LÔ1LÔ1LÔ1LÄ1LÄ1LÄ1LÄ1LÄ1LÔ1LÔ1LÔ1q2ܿc .58jo,}ԠP:< :~AxZuxRR sPw_jPü< :~B s58K T|gK58C 6jpإeبaގ_jpث^\jpld n58 C >~A{xuVF 58K T|g,b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b"@ j0P `5@ j0T `C5,b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b",b"X8`,Eq"X!8d,ECq"X8`,Eq"X!8d,ECq" `5@ j0P `C5P j8`,Eq"X8d,ECq"Y8`,Eq"X8d,ECq"YqX‡Oe>-5%|x?|X·?x NK=7e~[=O=82uOzph‡u>5KM2Єo/=85=85ۂ[Mԃ/ _\zpx‡Ou>=KO2Oo/=8==8=ۂ[Oԃ/ _\zp‡l//=8D˰уC/o n=8DSzp}OSr҃> B>LKNSkNSփ>||=*|? xЅo/=8u=8uۂ[]ԃ<̧.|]p|O>q'N 8|OS>q'N)8'|O>q'N 8|OS>q'N)8'|O>q'N 8|OS>q'N)8'|O>q'N 8|OS>q'N)8'|O>q'N 8|OS>q'N)8>1>1>1>1S>1S>1S>1S>1>1>1>1>1S>1S>1S>1S>1s=@z0Ѓ `C=Pz0ԃ >1>1>1>1S>1S>1S>1S>1>1>1>1>1S>1S>1S>1S>1>1>1>1>1S>1S>1S>1S>1>1>1>1>1S>1S>1S>1S>1>1>1>1>1S>1S>1S>1S>1>1>1>1>1S>1S>1S>1S>1>1>1>1>1S>1S>1S>1S>1?0~N0pL`N >:A,`':AXjb&Xjb&Xjb&Xjb&Xjb&.4q M\jBĥ&.4q M\jBĥ&.4q M\jFĭ&n4qMjFĭ&n4qMjFĭ&6jb&6jb&6jb&6jb&6jb&~~!ۮOxox:A `':A|pNP8A 'X: N8A&hb&hb&hb&hb&hbMj@8ġ&4qMj_?yg?/W-G~CavPvl`c[;Acv`~w0vAh ``C;&v0$vAj`&Nĩ85'fLS3qb&Nĩ85'fLS3qb&Nĩ85311S315311S315311S315311S315311S315311S315311S315311S315311S315311S3157x> ;|;s|W0 ~sE|a+2d A(P 2` 2`( &2`" 2`* $2Hd A*T > > > > 2(dPȠA)R 2X`! 2X`) 62`# 2`+ 42hdȠA+V X'8ĉ%N,qb X'8ĉ%N,qb8>eN,pbP>e N,qbh>eN,pbπ>e N,qb X'8ĉ%N,qb X'8ĉ%N,qb X'8ĉ%N,qb X'8ĉ%N,qb X'8ĉ%N,qb X'8ĉ%N,qb8q8q8q8q8q8q8q8qdNLpbχ>e NLqb'&81ʼn)NLqb'&81ʼn)NLqb'&81ʼn)NLqb'&81ʼn)NLqb'&81ʼn)NLqb'>dNLp_B ĉ)N7?dNLpb'81ʼnӇs|kvu>z!/sbd+2d A(P 2` 2`( &2`" 2`* $2Hd A*T > > > > 2(dPȠA)R 2X`! 2X`) 62`# 2`+ 42hdȠA+V X'8ĉ%N,qb X'8ĉ%N,qbϧ?dN,pbG?e N,qbϧ?dN,pbG?e N,qb X'8ĉ%N,qb X'8ĉ%N,qb X'8ĉ%N,qb X'8ĉ%N,qb X'8ĉ%N,qb X'8ĉ%N,qb8q8q8q8q8q8q8q8qϧ?dN\N<=8q8|CN\O8q8q8q8q8q{oI9_so ~R|&޽J;Xvl`k[;h젱;w_lׂ; v0 `b;;H 07fLܚ3qc&nĭ17fLܚ3qc&nĭ17fLܚؘؘؘؘؘؘؘؘؘؘؘؚؚؚؚؚؚؚؚؚ>|/>3{mm n;_o;L^p}&:~f30vpvඃLug`&~/>3{e3q`&ġ80fL3q`&ġ80fL3q`&ġ߃<hvk&>O;(젰J;Xvl`k[;h젱;Ewׂ; v0 `b;;H 0'fL3qb&Nĩ81'fL3qb&Nĩ81'fL;pѽG;pѽGο~v0;pѽG;pѽG|G>#O'~?|G>#O'~?|G>#XXXXXXXXXXXXXXXXXXXX0fL\ 3qa&.ĥ0fL\ 3qa&.ĥ0fL\X׊S}}?0x{x|\q"S ~~E<_W*JW;S ~?iz*Ÿ)B E󟾧"P"*T֗+TR_VRJEizi E@zhKE8 EX*Rz[T?A 6Q?A ŧ6U4_Z"l׫a[Ew}QF"u"jU_ZVZE8)^VVE8jP[1:)_e}(-LJ~7]/E뻲/Wp+¯"|/x/u׫{{\S|g)@EQ"/Wp-B"wدWq+B"yT" aE(@0T" aCE*PKy*D&0Q?]S&0Q"2 E*Tz"La*"qEHOeT??Q"N EH!UC^ŭ"a7Y0fq,n-eY2[fq,n a7Y0fq,n-eY2[fq,n a7Y0fq,n-eY2[fq,n5OEY0fxS`7Y;/Wp-Y<z",n a7Y0fq,n-eY2[fq,nņYlņYlņYlņYlŖYlŖYlŖYlŖYlņYlņYlņYlņYlŖYlŖYlŖYlŖYleOE(@0P" aCE*P0T" a0 0 0 0-2-2-2-2-0 0 0 0-2-2-2-2-0 0 0 0-2-2-2-2-0 0 0 0-2-2-2-2-0 0 0 0-2-2-2-2-x<0 0ǃd0-דj_ZŖY<z",b,6b,6b,6b,b,b,b,b,6:?E>s} /?E>}F}K5B-ݥB^E*~o ~M8CM8[uЄ@u_.ڄۂKuz&m Mh@0Є& 5a CMjP0Ԅ& 5a <|hDyrքC>4a <|_p/pm_m <|[Nyք>4!ф5ᰇMH4ᰇ .M-4ᰇWqkiܚpÇ&|ЄC5ЇM >|_pԇ/pm_m >|[N}ք>4Є5M(4 .M-4Wqkܚpć&,4/oM8Cp Or &%\p׫5o nM8 C6pė& M8 KA|k2o .M8 Uܚpķ& & B|hB B|_pT/pm_ m B|[N҄c 8ƀc 8ƀc 8Ɛc 9Ɛc 9Ɛc 9Ɛc 9Ɛc 9ƀc 8ƀc 8ƀc 8Ɛc 9Ɛc 9Ɛc 9Ɛc 9Ɛc 9խ Mh@0Є& 5a CMjP0Ԅ& 5111C1C1C1C1C1111C1C1C1C1C1111C1C1C1C1C1111C1C1C1C1C1111C1C1C1C1C1111C1C1C1C1C1111C1C1C1C1C1cpq18!8crCq19!8cpq18!8crCq19!8+ҷ& 4a G9& 4a CMjP0Ԅ& 5a CMcpq188crCq19!8cpq188crCq19!8kq_buy[vPAi ;Xvl`k4vAc뾃uvA`v0 `h;vAbv81fL3qj&Nĉ81fL3qj&Nĉ81fLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLO~omx9w >X۽?ߛ/U\M-m^\ſ79U *|$K*\õ *pz*ŸT*KRS0T*r * Ua K^ŭ CUŸThߪ0Q?q .!NU$ΗkVa SU8*nUTy>T*$p< .!p5\B UܪB <wVp< KU{k>GU8n^VQ'z>T *O|>-b 5\PB UܪPB 3=wV*|>.RN+r *,Ua x[T?S6Q*nU*lUC/pVp׫Ua [U8P|`*4p< K*UhUUC^ŭ *4PXX%X%X%X%X%X%XXX%X%X%X%X%X%XU@0P* Ua CUP0T* Ua XX%X%X%X%X%X%XXX%X%X%X%X%X%XXX%X%X%X%X%X%XXX%X%X%X%X%X%XXX%X%X%X%X%X%XXX%X%X%X%X%X%XXX%X%X%X%X%X%۸`lm\ q6.%۸dlm\Kq6.%۸`lm\ q6.%۸dlm\Kq6.%۸0P*ߩ0T* Ua CUP0T* Uq6.۸`lm\Kq6.%۸dlm\ q6.۸`lm\Kq6.%۸dlm\밉U8aߎ~!6 ǃ>B:lNr<*R-ݦ,]U~_\CЅQ1:%S'>txSHN|]p©_.څtۂKz.:u O|χvp<)'.u/q_>m O|[N҅C(>ta P|;~I]!_ܺp ŗv/҅C(^ŭ P|]pap]#?iJ{Tva|iJu T/qK)-x>U\O҅)>txCLS|;~It]8_ܺp:ŗv/҅)^ŭ S|]p@0Ѕ. ua C]P0ԅ. ua C]a0х*xZŇ.Luᰊ n]8E\U|[pa_օ*.tЊ]8ӡߎ_Rth.Z"]K+-tЊWq©_\7w[q;ny-w[q;ny 7w[q;ny-w[q;ny 7w[q;ny-w[q;ny 7w[q;ny-w[q;ny 7w[q;ny-w[q;nydžwlxdžwlxǖwlyǖwlyǖwlyǖwlyǖwlyǖwlydžwlxdžwlxǖwlyǖwlyǖwlyǖwlyǖwlyǖwly@0Ѕ. ua C]P0ԅ. ua C]wlxdžwlxǖwlyǖwlyǖwlyǖwlyǖwlyǖwlydžwlxdžwlxǖwlyǖwlyǖwlyǖwlyǖwlyǖwlydžwlxdžwlxǖwlyǖwlyǖwlyǖwlyǖwlyǖwlydžwlxdžwlxǖwlyǖwlyǖwlyǖwlyǖwlyǖwlydžwlxdžwlxǖwlyǖwlyǖwlyǖwlyǖwlyǖwlydžwlxdžwlxǖwlyǖwlyǖwlyǖwlyǖwlyǖwlydžwlxdžwlxǖwlyǖwlyǖwlyǖwlyǖwlyǖwlx+?!GXSz-Bh [0-Lmaj -Bj l-|PBi --,mai [Bk -480tqh:Mǡ80tqh:Mǡ80tqh:Mǡ80tqh:Mǡ80tqh:Mǡ81tqj:NMǩ81tqj:NMǩ81tqj:NMǩ81tqj:NMǩ81tqj:NMǩ阘阚阘阚阘阚阘阚阘阚阘阚阘阚阘阚阘阚阘阚ߟz^GG[(lJ[X-lmak [[hl[(Lt,Mt,Lt,Mt,Lt,Mt,Lt,Mt,Lt,Mt,Lt,Mt,Lt,Mt,Lt,Mt,Lt,Mt,Lt,Mt\Kqi:.MDž4t\Kqi:.MDž4t\Kqi:.MuY|>cvxW,?۱3< ?ks-(PHB)R J)RXHa!RXJa)RHa#RJa+RhHB+V Z)4R_=~-B )|/H!B(P B)R0@ C) 0P C) 0D S)L0T S)LH!B*T R)RHv`-vb-vb-vb v`-vb-vb-vb v`-vb-vb-vb v`-vb-vb-vb v`-vb-vb-vb;6رŎ-vlc[b;6رŎ-vlc[b;6رŎ-vlc[b;6رŎ-vlc[b;6رŎ-vlc[b;6رŎ-vlc[b;6رŎ-vlc[b;6رŎ-vlc[b;6رŎ-vlc[b;6رŎ-vlc[`: ~.{.h,w,??oP}}_+~|߯>u?_/y->?}|Xq0S97x^qӋr+n8urw+n8nq)+8n51TfmӋ2X}ŭ]>8oWq;=ck9;rLG{[p/yL{_q+y3k9r,qZU^mӋr|(1}ŭ=>8oWqi?K܌_*1˧[p/y|+n8>8[9X㣩/(W\qhr}z^Ӆ<(l#?u[9Nk9NVF}ŵz*V9-^Ӝ=(8[9Nk9NEV=c{_q-q|?lۂ{9N_xt+n8>8[9X+/?W2!C2AC4AC4AC4AC4AC4AC4AC2!C2AC4AC4AC4AC4AC4AC4ACz>/C*`91Xr c,`91Xr C4dHC4hHǥ>(4AC4SYq- iА}, iА iȐ iȐ iА iА iА iА iА iА iȐ iȐ iА iА iА iА iА iА iȐ iȐ iА iА iА iА iА iА iȐ iȐ iА iА iА iА iА iА iȐ iȐ iА iА iА iА iА iА iȐ iȐ iА iА iА iА iА iА !2CtАAC:hH !4tАAC:hH !2CtАAC:hH !4tАAC:hH 731TrOK91Xr c,`91Xr CtȐACzɔtА/ZACzrАAC:dH !4tАAC:hH !4tАAC:T\k}]`8ӫkOO}?`uRQV*v}ŭ}ǵ}]qma@Qli@Wq(Чv,/֎S>*8[;Nk;NڎC>c}_qk@ڱՎ[;Nlt+n8>8k;؎v}ŭ}jGIvUi㔠+n8%>8%k; ؎f;N ҎyXЇvZpi˂cU^q|}ť󴠯cuŭO^qi<-[; ԎP;Ҡ+n85ӫlǩAWqj}\qjvv}ŭCj`;1؎v cl`;1؎v c}jT;+n8Eӫ2َS+8Dc;&qv&veB_WqЧW%َӄ44+8Lc;8M[;J\+ttҕNIW:J']+ttҕNIW:J\+ttҕNIW:J']+ttҕNIW:J\+ttҕNIW:J']+ttҕNIW:J\+ttҕNIW:J']+ttҕNIW:J\+ttҕNIW:J']+ttҕNIWr)WtIWtIWtIWtIWtIWtIWtIWr)WtIWtIWtIWtIWtIWtIWtIWCj`;1؎v cl`;1؎v cr)WtIWtIWtIWtIWtIWtIWtIWr)WtIWtIWtIWtIWtIWtIWtIWr)WtIWtIWtIWtIWtIWtIWtIWr)WtIWtIWtIWtIWtIWtIWtIWr)WtIWtIWtIWtIWtIWtIWtIWr)WtIWtIWtIWtIWtIWtIWtIWr)WtIWtIWtIWtIWtIWtIWtIW9<_^_?~V?ߢY dXs|UyXSh #G0`8qc08c08㘊c28&㘌c28&Hő#G2d8q$(000(QG1b8qXc18Xc18؊c386،c386hьG3f8q(QiJTZ"HE*-QiJTZ"HE*-QiJTZ"HE*-QiJTZ"HE*-QiJTZ"HE*-QiJTZ"HE*-QiJTZ"HE*-QiJTZ"HE*-QiJTZ"HE*-QiJTZ"HE*]E*]E*]E*]E*]E*]E*]E*]E*]E*]E*]E*]E*]E*]E*]E*]E*]E*]E*]E*]E*]>)Yur::}_W˻}s\'?;~zWrN`ˊ:(:9}ŭ'?,:^W\q-Z~}ŭc=auܓ\Vqܵ<ՃvZ}[=;vZk=λ}\q_{?{ˊ[=zl{_qy'lW|]qy7k=zwجqzYqqWT~i+n8^~iί+8_qyV:/+.]C=6OR}eˡt +nاmxǭ+.؇xC4.+n8S=}zzeCV^W\qڗ}\qzv>eŭC`=1Xz c`=1Xz c{d=NoVӬ=,8k=N;k=NV=c㰄ODWqƧ_ݧ|]qi+_q3Wqz pzȚnZMkiM75ݴtӚnZMkiM75ݴt˚nZMkiM75ݴtӚnZMkiM75ݴt˚nZMkiM75ݴtӚnZMkiM75ݴt˚nZMkiM75ݴtӚnZMkiM75ݴt˚nZMkiM75ݴtӚnZMkiM75ݴִeMִiMִiMִiMִiMִiMִiMִiMִeMִiMִiMִiMִiMִiMִiMִiMִ1Xz c`=1Xz c`=dMִiMִiMִiMִiMִiMִiMִiMִeMִiMִiMִiMִiMִiMִiMִiMִeMִiMִiMִiMִiMִiMִiMִiMִeMִiMִiMִiMִiMִiMִiMִiMִeMִiMִiMִiMִiMִiMִiMִiMִeMִiMִiMִiMִiMִiMִiMִiMִeMִiMִiMִiMִiMִiMִiMִiM[4N)o?~V~?ϊ֊ݱ'S^_[}]W~_[wZyɊ?++ϫ؏ӊ>㯿4eEV\qZѧK#OV}ŭ}ǵ}_qaEqWo+`?1؏~ c`?1؏~ c8S?&}[qE^~^}ŭ}ǵ}_qE1ُӋO<ѷ~bu9S}_q)F_q)FWq~o?ۊ{?N3ԏë}[qiF^/<~~fu~f}ŭ}G^ӌTOo<ѷ~ju9S}_qǩF_qǩFWq~s?ۊ{?N7ԏë}[qF^<~~nu~n}ŭ}WG^Ӎ㔣O_rmŵ}z]6q~ru~r}ŭ}f?N9ޏӎ>㯿&1}$Gr}|>>Gq}Q>}lcsGs}4Gpipipipipipipipipipipipipipipipipipipip<tpy:8O<tpy:8O<tpZm'DͿ+~}ooZ~;=h[y(Q̣G1b<Xc1<Xc1<6c3<6c3MiO|$&4ɧI>MiO|$_̃|$̃|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$ỹ|$ỹ|$&4ɧI>MiO|$~N|{sz~-?Wp>W~#G0`-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"."."."."."."."."."."."."."."."."."."."."i}cy_{ZV<}OkQGq},cqX>6}4Gs}/{eK⺏>#} cp>&1>H#y9O7<ݜtsny9O7<ݜtsny9O7is6is6is6is6is6is6is6is6is6is6is6is6is6is6is6is6is6is6is6isi|WxkY~U\}]ϊ;ϟ?rT iO| 4ȧA> iO|ӿ4ȧA>=4ȧA>멳OyO|ɵyO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO|A>A>A>A>A>A>A>A>ӿtO|cA>ӿtO|cA>A>A>ڿkA>ӿH=}s7D<<]Io+w~K1byO'tO'tO'tO'tO'tO|$&4ɧI>MiO|$&4ɧI>MiOz"S$&|"c$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&'?A>MiO'?A>MiO|$&4ɧI>MiO= |~_3<|"x91xsL#y9><LJ(xs,chubO=-bO=-bO=-bO=-bO=-Ş.t=]bO{Ş.t=]bO{Ş.t=fO7{͞nt=fO7{͞nt=fO7{fO=mfO=mfO=mfO=mfO=m~ _W9c<9Hs|x9X<96ϱy9Z4`O= 4`O= 4`O= 4`O= 4`O=`O{:t=`O^qwnssssL9ħ+~C|z9ɞNt=dO'{:ɞ&{iɞ&{iɞ&{iɞ&{iɞ&{iɞG=?}o-?^}ݷY޿c-iO|Z"ȧE>-iO|ZAyO|ZSHyO|ZNyO|ZUyO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|ZsyO|ZӔyO|Z"ȧE>-iO|ZE>]E>]E>]E>]E>]E>]E>]E>]syOtOO?A>]E>=?tO$cE>]E>]E>]E>]E>]uS`?++~~S}>k~VV*Q̣G1bmiO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ŧ_gxZ~Zeo(!^qͣG1k<汘b"<CDfyW\̣{5fMiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧI>MiO|$&4ɧ=!y܇;͟iOy|>\iק-iO|Z"ȧE>-iO|Z"ȧ=)iO|z>1iO|^ ȧ^ ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ|ȧ=)".<ȧ|ȧ=)".<ȧ|ȧ|ȧ|ȧ|ȧ|ȧ[__/+>ӊ9X<96ϱy9Z_:ǯs<91ys$ϑ<{͞nt=fO7{fO=mfO=mfO=mfO=mfO=mROW\ϡ~C=^q=zz{9s+POW\ϡ~#`O= 4`O= 4`O= 4`O= 4`O= t=`O{:t=3^WsQ<9ϱys4:9~#x91xsL#y9ɞNt=dO'{:ɞ&{iɞ&{iɞ&{iɞ&{iɞ&{iɞ~c~[/a-Gp} cp>&1}$Gr}|>>Gq}Q>}lcsGs}4GqiqiqiqwyZyZyZyZyZyZyZyZyZyZyZyZyZyZyZy8O<]tq.yz]}p.y8O<]tq.yz~f3$u܇Oxs!3$u~23$?+޿>gHc=BcM>M>M>M>M>M>miO|&6ɧM>miO|&6ɧM>=?ɧ_}̃|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6c&!1iO|&6ɧM>miO|uyxϊ֊#?jY}OOy#G0` iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO| 4ȧA> iO|                     i}K^Woy}QGqX>}lcs}4GkK_>~#>cp>&1}L#>HtrNy:9O'A #'G0<c0<c0yL1g2<<>̣(Q̃~yX̃~Xc1+Yc1<6c3-iO|Z"ȧE>-iO|Zӿȧ_q̃|Z">A>-W ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>-iO|Z"ȧE>]E>]E>]E>]E>]E>]E>]E>]E>OyO+yOtOx?A>]?A>]E>]E>]E>]E>]E>]ӿH=}s7D<<]Io+=)byO7tO7tO7tO7tO7tO|&6ɧM>miO|&6ɧM>miOz"S&6|"c&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6ɧM>miO|&6'?A>miO'?A>miO|&6ɧM>miO'+&W$W|bq֊`L3 f4i0`L3t0L3t0L3t2L'3t2L'3t2L&3Mf4i2dL&3L+&W$W|bq֊bL3-fZ̴i1bL3]t1L3]_lO+(c<9hO89c<9H=fO7{͞nt=i͞6{i͞6{i͞6{i͞6{i͞6{i=Y~~Kp}>1}LcrGr}$LJp}QGq},cqX>6}4Gs}ipipipipiX_y-yyyyyyyyyyyyyytpy:8O<y^x-tpy:8O<Ǵ|i?V?>(},cq>6>h}/c~i#>>1}LcrH#>s cHJ>OB>csi=O;Gp>&;=}$;ϝGrtsny9O7<ݜtsny9O7<ݜtsn~x^o?>#} cp>&1>H#>>LJ(>X>}lcsh>Z< < < <=?< < < < < < < < < < < < < < < y:8O<tpS<tpy:8O<2ON篇Pwvpvnk5טS\kRq*YkVާkVոf5~gy>Guuu}}پl~v~~?ןώώg^kWګyռj^{5^kګ*kګ*kګ*kګ*kګ*k>^}\{sګϵWk>^}\{sګϵWk>^}\{kګkګk2ÛM8t{`oήtlΠj`Ia?"8juï|zt=_/ϗK|y<_z?^z?_z?_z?^zKk^).߰a}i{=_ڞ/mϗK|xt<_:/ϗK|G5g5g5g5G5g5g5g5G5g5g5g5G5g5g5g5G5g5g5g5ۏjl?~VfYg5ۏjl?~VfYg5ۏjl?~VfYg5ۏjl?~VfYg5ۏjl?~VfYg5Cή<ۭ._7w| O|\~\/_p\/p7\~/?p\~?_~7\~?_ޞU@ T@Y T@ TϞU@ T@Y T@ TϞU@ T@Y T@ TϞU@ T@Y T@ TϞU@ T@Y T@ TϟUATAYTATϟUATAYTATϟUATAYTATϟUATAYTATϟUATAYTAT/U/@T/@YT/@T/U/@T/@>a˃^ų^^<^^ų^^<^^ų^^<^^%^%^>^%^%^%ާutyPKP|VKPgKPKP|VKPgKPKP|VKPgKPKP)kvke};|~ _7|_A_A_A_A_A_A_A_A_A_A5_C5_C5_C5_C5_C5_C5_C5_C5_C5_C @ @ @ @ @ @ @ @ @ @m !6߆oCm !6߆oCm !s~=ǟ_s~=ǟ_s~=ǟ_s~=ǟ_s~=ǟ_ğAğAğAğAğAğAğAğAğAğAğC9ğC9ğC9ğC9ğC9=_^f=vW| ߯ǜo0{(X(X(X(ZhXhXhXhZXXXZ +a6ذV` lXl+pef 7]#pk+yX<     8 8 8 8@ @ @ @ @ $@ $@ $@ $0a0a0a1a0a0a0a1a0a0a0a1a0a0a0a1a01v!0a0a1a&0a&0a&0a&1a&0a&0a&0a&1a&0a&0a&0a&1a&0=x!0a&0a&1a&0x!0a&0a&1a&0a&0a&0a&1a&0a&0a&0a&1a&0a&0a&0a&1a&0a&0a&0a&1a&0O{!0a&0a&1a.`L 0&\p.`L 0&\p.`L 0&\p.`L 0&\p.`L 0&\p.`L 0&\p.`L 0&\p.`L 0&\p.`L 0&\p.`L 0&\p0a0a0a1a0a0a0a1a0a0a0a1a0a0a0a1a0a0a0a1a0a0a0a1a0a0a0a1a0a0a0a1a0a0a0a1a0a0a0a1a60a60a60a61a60a60a60a61a60a60a60a61a60a60a60a61a60a60a60a61a60a60a60a61a60a60a60a61a60a60a60a61a60a60a60a61a60i L LĄML8L8L8L8ĄCL8L8L8L8ĄCL8L8L8L8ĄCL8p001ҝfL8L8CL8ĄL8L8L8CL8ĄL8L8L8CL8ĄL8L8L8CL8ĄL8L8L8CL8ĄLxkx!001n` L 70&pn` L 70&pn` L 70&pn`[[ 70&pn` L 70&pn` L 70&pn` L 70&pn` L 70&pn` L 70&pn`[ 70&pƭj3j=z| 緫O^X{ %0X%0X%0Z%0Z%pX%pX%pZ%pZ%X%X%Z%Z%HX%HX%HZ%HZK` ,%X`,Z%(X%(X%(Z%(Z%hX%hX%hZ%hZ%X%X%Z%Z Ka 6,%ذ`lX:4C:4C:4C#:4C:4C:4C:4C#:4C:4C:4C:4C#:4[cССѡޚßЀ ЀЈЀ Ѐ ЀЈЀ Ѐ ЀЈЀ Ѐ ЀЈЀ Ѐ ЀЈЀ Ѐ ЀЈЁЁЁЉЁЁЁЉЁЁЁЉЁo5NS:tC:tC':tC:u9MЁЉЉЁЁЉЉЁЁЉЉЁЁЉЉЁЁЉЉMLKtxob"ƟЉMLz 000000000000LKtxod"Ɵ0LKt@N&bi D@t@t@AtDAt@t@t@AtDAt@t@t@AtDAt@t@t@AtDAtxogrX{;1@AtxogK@ t@ t@ItDIt@ t@ t@ItDIt@ t@ t@ItDItxoirX{K1@ItxoixX:L:L$:L$:L:L:L$:L$:L:L:L$:L$:L:L:L$:L$:L:L:L$:L$:769,άZ$:76%X@ p.t":\@ p.t":\@ p.t":779,όZEtxonxXtxn"Ɵp޻p.t":\D p.t":\D p.t":\D p.t":\D'%:8OKt-Nz 谀 谀 谈谈 谀 谀 谈谈 谀 谀 谈谈mNKtxos"Ɵ谈mNKtX@>'bi D@tX@tX@EtXDEtX@tX@tX@EtXDEtX@tX@tX@EtXDEtX@tX@tX@EtXDEtxovrX{1@EtxovK@ t@ t@MtDMt@ t@ t@MtDMt@ t@ t@MtDMtxoxrX{1@MtxoxxX:w<OKtD'%a?B7Eu 3(A f04͠i3 fafif0 z\0h30 f08i3A f0$ i8C88C88C88C88CA7h&Mܤ4q&nMA7h&Mܤ4q&nMA7h&Mܤ4q&nMA7h&Mܤ4q&nMA7h&Mܤ4q&n ׳&y&׳&y&׳&y&zbiy/G{&y&׳&y&׳&y&׳&y&׳&y&׳&y&EhhFhhFhhFx(Ɵf@x/xh&i&h&i&h&i&h&i&h&i&h&i&:h&:i&:h&:i&:h&:i&k&Kf蠉N褉蠉N褉蠉N褉蠉N褉蠉N褉蠉N褉AAA>bi;&hb&ib&hb&ib&hb&ib&hb&ib&hb&ib&hb&ib&&hb&&ib&&hb&&ib&&hb&&i⽎ii I I I I I In?֊[ϸv f`48aN3pA f4$ aI3H,,A fP44̠aM3h f04llhb&ib&hb&ib&hb&ib&h7 &sxhb&ib&hb&ib&hb&ib&hb&ib&hb&ib&hb&ib&6hb&6ib&6hb&6ib&6hb&6ib&6h: &ishb&6ib&6hb&6ib&6hb&6ib&6hb&6ib&6hb&6ib&6hb&6ib&h&i&h&i&h&i&h&i&h&i&h&i&h&i&h&i&h&i&h&i&n I7iMܠ4q&n I7iMܠ4q&n I7iMܠ4q&n I7iMܠ4q&n I7iMܠ4q&Y뀧ix\G<.3nx^Owrt;q9urxx(#񌟯}DAx\g }#& (wr< }4Q@G<.@#ÈJ ԐJ ԐJ ԐJ ԈJ ԐJ ԐJ ԐJ ԈJ ԐJ ԐJ ԐJ HF6Gq9Jޅሧ"R>q9J4J4J4J4J4J4J4J4J4J4J4J4J4J4J4JްH=G *M{#&TH? *MD*MD*MD*M$*MD*MD*MD*M$*MD*MD*MD*M$*MD*MD*MD*M{+r ޛ=4QD*7G<-ǺCg^#ͣNW1< a8y8qG<8y$#qX8X8(G< Q8y4Σq<1884B=-B=-B=-B=-B=-B=-B=-B=-B=-B=-B=-B=-B=-B=-B=-B=-B=-B=-B=-B=-F=mF=mF=mF=mF=mF=mF=mF=mF=mF=mF=mF=mF=mF=mF=mF=mF=mF=mF=mF=mA=A=A=A=A=A=ӯjyޫz:z:z:z:z:z:z:z:z:z:z:z:tnӍzQO7F=ݨtnӍzUR8{B _G /p?}88򟾎xO G<8y$#qX8x*_G<΃~5΃#A~~A~ ?_qizrC=GPOQn(7S}_G<]zrC=GPOQn(7S})> zrC=GzrG=uSG=uSG=uSG=uSG=uSG=uSG=uSG=uSG=uSG=u@= @= @= @= @= @= ӯUzzzzzzzzzzzzzzzzzz_OWA=wZ;4QO4QO4QO4QO4QO4QO4QO4QO4QO4QO4QO4QO)z|b(_?)zEsp{yΣphG<8y cp88MyE{< a8yqp<8y#qHGjs#p<={ 9ϑxz?qf0N} )8Q3>j6)qfc>ρq1N}lS|5G8Q1N}Ծ(NEq/}Qt_8(NEq/}Qt_8(NEq/}aƩaƩaƩaƩaƩaƩaƩaƩaƩaƩa:Ʃc:Ʃc:Ʃc:Ʃc:Ʃc:)>j;)>j;)>j;)>j;)>j)>j)>j)>j)>j)>j)>j)>j)>j)>j)>j')>j')>j')>j')>j')>j')>j')>j')>j')>j')>ju:#H; h s 9휄vB;ΉhLs*9휌vF; i猴sJ9'휔vJ;ys^9/~K?祋PlbG[9/~K?祟ys^9/~K?祟ys^9/~K?祟?Үs9/~K?e2y缌s^9/㜗q8e2y y?Z2>s^9/㜗q8e2y缌s^9/㜗q8e2y缌s^9/㜗q8e2y8˼lv>ms~>sܟyc;}l<;ws}>w'9?sˏKy<}wys^9/}>eys^9/}>eys^y~e>}/[7kg^߬}>ey~ry9缜s^9/眗s9/疗s9?9?s^9/眗s˹?[^~st]su>g^V|>ˏ3yysx}}}}}}}}}}}}}}}}}}}}}/yr}/yr}/yr}/yr O0W(_91}}ܴ뜜>=9=}{s?Ͽv_&>=0\ip %0\mp %0\qp %<9i}7K.a?DތA9mnޠMM?c7翸d7+f+f+f+f,f7,fW,fw,fg6;Slva3 Qfg6;Ӱ#F#N#V#^#f#n#v#~# !7D8?8?8?8?6a<2<2a=2=o7b C!o7b>+YXE<^!onHfI~>)8L2aM7p1I?9KɄMɄOɄQɄSɄUɄWR)o7bMiɄkɄmɄoɄqɄsɄuɄwɄyɄ{Ʉ}Ʉn?:7yďd%w302p22203p33304p444yg^_ǟgg['϶Ώm=07p777q}Aor<o>|y/܄n^ ~?K%o-%D["K0?Y-d%W8LXD["K0BpBBB0CpCCCYbm[-0FpFFF0GpGGG0HpHHHYm-ExoG,e-e.e/e0e1e2e3e4e5e6e7e#wD;#?x, T&T&,T&g|U>{sV߼UǛ88Waebe[<x-nw[f+n+v+~+++++bbbbbbbb++++++++++++_ׯy|_G~]\\\\\\\\\\\:_뜿~ׯgϟ:?مʅʅʅ|7yϯ?rQoO??8z=_ş\TrQE'+!W\rQE(u/9?WʅS)oW\\\"ʅG#wD;"GUߟ?>rsG[U\-nw[____En[En[En[________cW_}UWq?u߸sUUUU\߸q:u|7oW?ʯO#z\߸q:UW!_n7>??׿ Q*DaaaBԿ Q*DBt ./Doy Q**O?? 8/**DBt >/D>7bBԿ Q*D3B O/************DBԿ Q*DB c/***T= Ὴo7b~??:G!W!W!W!W!_UWCs~ϢUW!_q~q~q~q~UW!_!_|!Z)7E"SoM9_|!A_}!ZUW!_a_}!ZK?/Ϣ_.~!KKKK7K{***~>?8yo_}~.o[!W!WQQb-K쿢_!7uc^iq**>>?~0DB 0DmC ῊobMCt 0D_BԿ Q*DCt *0D>+W{F?BBBBBԿ Q*Db+: h%#_Q***D!_UW! ,`ނ!_ŽBw`UU>! 4`^!W!W!W!W!W!W!W!W!_UW!<`ރ!W!W!W!W)W)W)W)W)W)W)W)W)_UW)?`)W)W)W)W)W)W)W)W)W)W)W)WySL0o^Gyu~Q U U U UW)_UW׵E׿\*ERԿJ;?JJJ;?JQ*ERԿJ0ESLk"M䯉5&WL0ESL0ESRRRRRRRRԿJQ*ERL0ESRRRRRRRRRRR~3?9ESL0*************E3ϯ2"CoWRRR2ϯ2ϯ2ϯ2ϯ2ϯRL0**E2ϯ2RԿJQ*(****ESL0o{?gQ*ELϢ`W)_?`)?)o7+?`)W)W)W)W)W)W)W)Wy_?s_}>UW)_`)?KKKK7yS̛"o:4K:?u~KUW)_?%D)_UWY"Ko-UW)_`)?7{}y%Q U U)?`)W)W)W)W"[omUW)_`)?-E+_UW)?`)W)W)W)Wy_yϹ~]Wǟ?`)?`)____En[䯨UW)_?`)____-Zj պ]יuuy]g~^?D%WK_-Zպϯu~~u_-p:?Zϯu~~Du|u~~u_j_k"M?L䯉%WD_k"M䯉5&DK\5&D_k"M?D%_-pK\_-Zj_"]䯋u.EK\_-Zj %WKyyD%_-QjK\_-ZjW>W9?Z7W=?D%W+DW~>_8?Zq~~jWKԿZ_-pKD%_-QjwWi}KԿZD%.p?Ǜ-****QDJԿ<~>YQD߲JԿ*QDK,D[voy-Ὺ_?XUU`%?X` U U U U U U U UW%_UU%?X` U U U U U U U U U U U UW%_UU%?X` U U U U U U U U U U U UC!U7%_____UUW%_U~!9?W%_UUU U UUW%_UU%?X`Wu_}*ϯJJ*ϯJ,DK,DKJJJJJJJJԿ*QDJ,DKJJJJJJJJJJJj ~^%Y,DKJJJJJJJJJJJjwww濪/oWJJ7?W_gQD*u~TUWUGUKs ~.Ϣ`%?X%D["ED%_U`%?X` U U U U U U U U[-?X`%____7>??׏*>??XU7U-[Wu_O?7Ju_}ħ__7{_}_<yD;">?}>/9sJԿ*QF?G?JԿ*QDj"E"-w"_DK,D"-w"-wJԿ*QDK,DE}_}W}_}~~xs_}?u~s_}?u~ܢ`_뜿-u9[Z:o_g~9:o_Ku}3*>1jsE>??-_բU|vm;m߶o|vm;?آ`-?آ`-u.E_"]䯨բUW-_?آ`-____u.E"]?آU_+_Wu.E"C?!WZ:D_j+_u?w?!7D+_u~ϢUgjCU}=~!9?Wj{o|>ߛG}_}EZԿjE[lSoM)7E"SoM)WlE[ZZZ࢛_WW7U~}~Їs??\?E?/jWK?>y_~;HԿjQE[lE>{7Nj-?x____________#wDG<y+W-W-W-W="G#wD+_բUW="GUW-_7uo>?|_W ~ނ-YlE[lE[ZZZZZZZZԿjQEZlE[ZZZFFFFFFFF:\뜿swn߹~|~;9:\QjϟGԿk"M䯉5&D_k"M䯉555&D_k"oǟοϿߟ3>'oy#Ws#_5#?8w|;~??8#____________G+__>?wn+ϟ'ϟ'ϟ'ϟGFFF&+?8!o7bFFFԿῚ?_5ՈW#_5)7EW"SoM5)7E Ո#W#W#?8#________5ՈW#_?8#____________O|sYϳϟGFFFFFFFFFFFf]"%w ~^ϳϟg ~>+?8W?g^?{EFԿQjJ<)JԿQjDo%K-q[__M_pDGpDGQjDFԿpDGῚ+?8-ʟǟՌ;"G#?x<____͈W3ՈW#_x~5ՈWՈW3ՈGՈW3шW#_x~5w??}?>|_}濺~>gQjDقEFԿpDGpjjjjjjjjw-EGpjjjj -W[MwW[Կڢվ:-W[_:3?8o>gu~-_:3?oQjW[Կڢ}&E-_mQjѶn;?ڢEmwyv-_\3?o;>h -np[ܢ-W[_m"]䯋E-_mp[ܢ-W[_mj v]._QjW[Կڢϟ?oj վ>{_}~?Cs8q~wCE-_mQjC!j v~;?W[ԿڢvM)7E"SoM)7E[ܢ?E-np -W[vM)7EW[Կڢ?E-np -W[_mj/KD.KDW}\_m%y ~^%y ~^E?/Ϣ^[_u~%y ~^>}j]w%K]w*>=ٿo<ݢ?E-np[_m[om-E"E-np[_mj -WbmE-_mQjW[ܢ?j -WwWߟ\oǟ#W{?E'o>GW^m{QՄ=p *n?gS{@|xX8\l-q..DQ^=z'nC=EJ-ʌ~{7E*Ϸ|<*υ5p\4}|f\}3\t~| J~3]^ǵR. p5 ܟ kpٟu.:Au.pì+?)?)?)?)?)?)?)?)?]"ynsDh8^CW333333333333凳KpnCp]b?K]")?)?)?)?p5n~ۀxg{kx L<3Q5pD3LW3Q5pxf&Ùpf9xg{nf n7nkn{p Do?Mt| MLLLLLLLs8s\<3L4|q{p ΔΔΔΔΔΔΔ\ n7n\?{\=pv(_kn7333凳0 qwπ(_ؽ>@4|FsS,{5 Py<~.Aqn>ڟs/;pw,7qug@WPy<{5ksEo.zV37w_~N=pjpp&WP`8^Cgggg|h8g@ݟ+?)??|ÿC^~SQGݟƛ߿h|<*Ϸ|<*Ϸsф= qw<8sыπs33凳|<*Ϸ|<*Ϸsј=pw<9 o~88ĕpo:ù>fhwѮ=pxxxxxxxxx{k~8Dw~;pp~p~p~pù>pp.yNypù>pn*M幩<7>pù碹{఺b?wπ~&s7sq{0+^E?b?w5pϕΕΕΕ~p;/W\ՇsUU}8?Y nwπx>pù!{@|x ݕΕΕΕΕΕΕΕΕΕΕΕo~ts-BC>+?+?+?+?pù>s15pPyù>p*Cy<>pù碁{wV{ 7?}>TܞSqh&8^Cd\4}EO?ەΕΕΕΕΕΕU}8W\ՇsUE⽚+?+?+?+?+?+?+?+?+?+?+?/KRyTìs}G j?W\\\ՇsQG?W~8W\ՇsUU}8PA =%f37?\7?΄+?S\~.:Pùùùùùùùù>pùh8=ssss U.T}PBՇ /5TPRCK 凋Kq<.%PPBBBBBՇ U.T}PW_TBՇ U.T}0...L< U.T}PBՇ /5TPRCK U.LܟPy(?\(?\?/5TPRCK /5TPRCK U.T}PBՇ /5TPRCK Wy*]幫*G<|T+?\(?\QG=o}Qy>*G<GQÅŨ\Շ U.~g7Wo~ۀU}PBՇ U...T}~~po{p?8^CCK /5TPRCK /5TPRc<*Ϸ|<*Ϸ\Շ U.T}PBK /5TPRCBBB; \#o~Owx7?ϩqxxxxxޞ%%%%%%\^"yTp߸ow?åwT~T~4iy{p7k% nOܞ&=Mp{?Oi\p\Ty*Sy\på_j~ꗚ7?JKM/5~{~WKKKKKKKKKKKK˥|<_*ϗ%s\RRRꗚ_jp<popå>\x%ޫejYZpå>\pYKqR^Kq{)n/_j~ꗚ_j~ꗚ>\på_j~ꗚ>\~Vyååååååååååå<|Tp9y>\*?\*?\*?\*?\pꗚ>\GQ|~>j?p+nW~ׇP|~>j?>S\p!W8镪[ݟ+?\*?\nu>\~ꗚ_j~ppppppppV[ݟouꗚ_j~ppppK-[n)?R~p懻J?_xn~~n~!pK-[n)?R~pK-[7?9!KpKRᖪT}e*M幩<7TsSypTs[_R~pKK]_RRꗺTԥpK-[n)?R~-UnpKՇ[_RRꗺTԥpK-[n)?R~pK-[7?T߾~߁ÿCܟgp?T}pK-[n)?R~pK-[ܺ{>ܺku!-[R<[_RRꗺTԥ./u~KK]n)?R~pK-[>RᖪT}./u~KK]n)?R~pK-[n)?R~RKݟ/u/K*\Շ[>*TRy^Kq{)n/R^U}íRܮ.UnpKK]_RRꗺTԥpK-[n)?R~yV_RRꗺTԥpK-[n)?R~gt.UnpKՇ[>jpkߥV-[n~懳ꗺn~ϛћgt_{np=p+[>ܺ~qz7|Q>RᖪT}p^{WT}-Unpk{Q|{5UnpKՇ[>ܺK߿s\Շ[7?oí6][qwjn~KK]_RRꗺn)?R~pk<*Ϸ\Շ[>RᖪTԥ./u~K-[WWWWW_jp?=TRJՇ+UT}ny]b?s@ܟÕÕÕZ7?}rTԺ>n~w׺{׺nW0p𷗪W>\pw FKJJՇ+^&ޟeKՇ+UT}RTsSyn*M幩<7TsSyn*URRKK-/TRRKK-/\幫8=n~ۀW>\pURK=o/uÕW>\pZ_j~U~Upw?9ZWW_j~Z_j)?\)?\)?\)?\p~}7?m@ݟpÕW_j~ZWWWWWWWWWWWW>\pÕW_j~ZWWWWWWWWWWWWQ|~~7W+++++UT}RJՇQ>Gq(nWJՇ+UT}^m{QFWSJՇ+UT}RRKK-/T*Ϸ|<*Ϸ|\põڪ_j~õõõõõõõõõõõõת>\põڪ_j~õõõõõõõõõõõR_j~zj{^Z+?\+?\+?\+?\põת>\s/U.>\põץ\ZTpõת>\~ڪ_jRy^*Ky\põת_j~׭[ݟ?ouڪ_j~pppppppppppp=9ڪ_jz7j?|~pppp=*G<\Km/G*U}VzTQy>*Gڪ_j~~N{>\p~õת_j~ڪ_j+?\+?\+?\+?\+?\+?\+?\+?\onp[=9ڪ_j~õõõÍÍÍÍWkknUnT}QFK/uTQRGFFF\b?Ks|n~8\Civ s7k%|.sjsjs sN%}Lppjpp:_~ÍÍÍÍܨ~:_(?(?(?(?(?(?(?(?ܸ]sW7>ܨpÍ:_~ÍÍÍyy~P~ݮ=v/uT}Q~Q~Q&PU}QFՇUnT UQFFFՇ8X懻 \ՇUnT}QRGK/uTQFFFՇwwuo~o_~:_~:7777ܨp:_~ppppppppsj?nPRRR:_~ÍÍÍRܾ/KqRܮ:Kq:KqRܮfϗx6KqRܾ/7?awV7?\o~5:ϕnnJݟz~]8;RKݟ?WRGK/uT)TRy^*KyGq(nWFՇUnT}Q~QRGKUnT}QFՇQ磞z>\ՇUnT}QFK/uTQR/wp pR~S\mNK/uTQRGK/unnnnzsmNՇUnT}QFK/uTQRGF?z8ĵz8K\tA0/aֱ,gEVLp%<\ʇKp).åԗRS_jp%<\p%<\p%<\/5vܞẰϻS>\p%<\ʇKp).p~K@>\ʇKp){ZWk^-å|R_jKM}/5õpnoܞZ8pno¹=ԗRS_jKM}/5yᒇK.yᒇK.å|R_jKM}/5yᒇK.yᒇK.yᒇK[>osԗRK.yᒇK.yᒇK.yR>\KM})y 7?O.yᒇkG|G\p/5|F|G|GvyG|G|՗RS_jKmkη|kη|kᒇkk՗R>\KM}/5ᒇK.yᒇK.y6õpm|K}/5ᒇK.yᒇK.yᒇK.yR>\ʇK}/5ᒇK.yᒇK.yᒇK.y^>^}pGs.<\på|R>\Gs~4Gs~4ʇK.y<\Gs~4p).å|RS_jKM}}~Ϗ<\/zr&K}%RS_jKM}/5yᒇK.yᒇK.å|R_jKM}/5yᒇK.yᒇK.yᒇK.å|R_jKM}/5yᒇK.yᒇK.yᒇKG>s5|8K\,qĵtQn@ E%Y15AlWaɨ.͇EᲔ/|)͇EᲔsEpYʹEp|h_j/5ڗKW?+z~.s8KFR}Ѿh_j/5ڗEpQ?\EpQ?\͇EpѾh_j/5ڗEpQ?\ok^>k4x}`1 }`1 C{{|7>>o0>oW?|?|7jy|7jyC }`*弔RK9/弔RK9/^`rp/0PK9/弔Rα/^1y)祜r^y)c R 5sK}R_`̕s5|Wk0Ԙ5j 5p sCy{R 5p {?ܿo?\$7"WSLd'9HN:8ࠃ:8ःN:8ःN:8ःG;I$I HnE.:ࢃ.:ࢃ.:ঃn:fnffnffσ`t<5qF\#׈k5uF]QxY3_̗=eYOYYϚYYOYYϛYYOYY[hmڢEk-Z[hmڢEk-Z[hmڢEk-25t؁!-:[tl٢Eg-:[tl٢Eg-:[tl٢Eg/_4h~E/_4h~E/_4h~E/_4h~E/_4h~E/_4h~2=.j{\1qQcƸEMq26k26k}QWrLsN `!_Uqg-뛵j탿a߰o}7>v_m\m\m\m\m4oyhF6E7f̢Yt3nf,E7f̢Yt3nf,E7f̢Yt3nf,Eh-^؋{b/ZEh-^؋{b/ZEh-^؋{b/ZEhƢwˣ7(c/؋>c/؋>c/؋>c/؋>c/؋>c/Ec}̢Y1>f,Ec}̢Y1>f,Ec}̢Y1>f,E臽^t؋{a/:E^t؋{a/:E^t؋{a/:E0000000000000000000000000^t؋{a/:E^t؋{a/:E^t؋{a/:E͇h>lFa5|Xv4֣͇i>lHaE;|XÖ4֤'͇Ei>lJaU|Xö4֥/͇w3A/ }g.~g;gw&{Pw&{Xw&{`w&{hw&{pw&{xw&{w&{a|;#FL0~g1;/ ߙQ;0~gL@^i3 Cw&{a%w&GY3;bVߙa^X~gߙ셕w&{a^X~gߙw{GCOfN?a;?4HTQ*R)锊JEZ"R^HT%~w]w%~w]w%~w]w%~w]w%~w]w%~w]wOdY@"d;Y@$O d[Y@& d{Y@(O dY@* dY@,O d .%w]»Kxw .%w]»Kxw .%w]»Kxw n[n[n[n[n[n[n?WgWf-'oYddeV2l˖l˖d/%{)K^JRd/LA6SdKTA6U͏dk\A6WddA6Y͏dlA6[dtA6]͏d|A*RxiT^E:"W֫HU*R|iT_E"WHU*RiT`E:"%XH V+RiŠTaE"eX6HV+RiĊTbE:"XVH-V+RiƊTcE"XvH=V+R~2<˓<˓ed/#{^F2ex/RLi&TE"dvH=Y,RPi(TE:"%eHMY,RTi*TE"eeH]Y,RX'w}»Ox >'w}»Ox >'w}»Ox >'w}»Ox >'w}»Ox >'w}»Ox >'w,Rri9ԜEz"EgHY,Rvi;ԝE"gƳHY,Rzi=ԞEz"gHY,#~w;wG#~w;wG#~w;wG#~w}Fgya}Fgya}Fgya}Fgya}Fgya}Fgya}#~w;wG#~w;wG#~w;wG~YddeV2;22k= "{%^"{%^"{e^e^eկ~ӯ_oY?/_Ͽ9jD^madp-0.4/problems/PaxHeaders.5405/Access.pgmx0000644000000000000000000000007412717644140015704 xustar0030 atime=1463765180.073720381 30 ctime=1463765201.025553043 madp-0.4/problems/Access.pgmx0000775000372100037210000140120512717644140016541 0ustar00fransfrans00000000000000 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.9 0.05 0.05 0.0 0.0 0.95 0.05 0.0 0.0 0.0 0.95 0.0 0.05 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.5 0.5 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.5 0.5 0.0 0.0 0.0 0.05 0.05 0.9 0.0 0.0 0.05 0.0 0.95 0.0 0.0 0.0 0.05 0.95 0.0 0.0 0.0 0.0 1.0 0.0 0.5 0.025 0.025 0.45 0.0 0.5 0.025 0.0 0.475 0.0 0.5 0.0 0.025 0.475 0.0 0.5 0.0 0.0 0.5 0.0 0.0 0.05 0.05 0.0 0.9 0.0 0.05 0.0 0.0 0.95 0.0 0.0 0.05 0.0 0.95 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 1.0 0.0 0.5 0.025 0.025 0.0 0.45 0.5 0.025 0.0 0.0 0.475 0.5 0.0 0.025 0.0 0.475 0.5 0.0 0.0 0.0 0.5 0.0 0.05 0.05 0.45 0.45 0.0 0.05 0.0 0.475 0.475 0.0 0.0 0.05 0.475 0.475 0.0 0.0 0.0 0.5 0.5 0.5 0.025 0.025 0.225 0.225 0.5 0.025 0.0 0.2375 0.2375 0.5 0.0 0.025 0.2375 0.2375 0.5 0.0 0.0 0.25 0.25 1.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 1.0 0.0 0.0 1.0 1.0 0.0 0.0 1.0 0.0 1.0 1.0 0.0 0.0 0.0 0.5 0.5 1.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 0.0 0.0 0.5 0.5 1.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 0.0 1.0 0.0 1.0 1.0 0.0 1.0 0.0 0.0 1.0 0.0 1.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.6 0.2 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.2 0.6 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.08 0.0 0.0 0.0 0.0 0.0 0.84 0.08 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.08 0.0 0.0 0.0 0.0 0.0 0.08 0.84 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.08 0.0 0.0 0.0 0.84 0.08 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.08 0.0 0.0 0.0 0.08 0.84 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.0 0.0 0.6 0.2 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.0 0.0 0.2 0.6 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.08 0.0 0.0 0.0 0.0 0.0 0.84 0.08 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.08 0.0 0.0 0.0 0.0 0.0 0.08 0.84 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.6 0.2 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.2 0.6 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.0 0.0 0.6 0.2 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.0 0.0 0.2 0.6 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.6 0.2 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.2 0.6 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.0 0.0 0.6 0.2 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.0 0.0 0.2 0.6 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.08 0.0 0.0 0.0 0.84 0.08 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.08 0.0 0.0 0.0 0.08 0.84 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.0 0.0 0.6 0.2 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.0 0.0 0.2 0.6 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.6 0.2 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.2 0.6 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.08 0.0 0.0 0.0 0.0 0.0 0.84 0.08 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.08 0.0 0.0 0.0 0.0 0.0 0.08 0.84 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.0 0.0 0.6 0.2 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.0 0.0 0.2 0.6 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.08 0.0 0.0 0.0 0.0 0.0 0.84 0.08 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.08 0.0 0.0 0.0 0.0 0.0 0.08 0.84 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.0 0.0 0.6 0.2 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.0 0.0 0.2 0.6 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.0 0.0 0.6 0.2 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.0 0.0 0.2 0.6 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.0 0.0 0.6 0.2 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.0 0.0 0.2 0.6 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.08 0.0 0.0 0.0 0.0 0.0 0.84 0.08 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.08 0.0 0.0 0.0 0.0 0.0 0.08 0.84 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.0 0.0 0.6 0.2 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.0 0.0 0.2 0.6 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.08 0.0 0.0 0.0 0.0 0.0 0.84 0.08 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.08 0.0 0.0 0.0 0.0 0.0 0.08 0.84 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.0 0.0 0.6 0.2 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.0 0.0 0.2 0.6 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.0 0.0 0.6 0.2 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.0 0.0 0.2 0.6 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.0 0.0 0.6 0.2 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.0 0.0 0.2 0.6 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.6 0.2 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.2 0.6 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.08 0.0 0.0 0.0 0.84 0.08 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.08 0.0 0.0 0.0 0.08 0.84 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.6 0.2 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.2 0.6 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.6 0.2 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.2 0.6 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.08 0.0 0.0 0.0 0.84 0.08 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.08 0.0 0.0 0.0 0.08 0.84 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.6 0.2 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.2 0.6 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.6 0.2 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.2 0.6 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.08 0.0 0.0 0.0 0.84 0.08 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.08 0.0 0.0 0.0 0.08 0.84 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.6 0.2 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.2 0.6 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.6 0.2 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.2 0.6 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.08 0.0 0.0 0.0 0.84 0.08 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.08 0.0 0.0 0.0 0.08 0.84 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.6 0.2 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.2 0.0 0.0 0.0 0.2 0.6 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.11111 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 -1.0 0.0 0.0 -1.0 -1.0 10.0 -1.0 -10.0 -1.0 -1.0 -1.0 -10.0 -1.0 10.0 -1.0 -1.0 -1.0 -1.0 10.0 -1.0 -10.0 -1.0 -1.0 -1.0 -10.0 -1.0 10.0 madp-0.4/problems/PaxHeaders.5405/recycling.dpomdp0000644000000000000000000000007412717644140016772 xustar0030 atime=1463765180.081720318 30 ctime=1463765201.025553043 madp-0.4/problems/recycling.dpomdp0000664000372100037210000000770712717644140017634 0ustar00fransfrans00000000000000# recycling.dpomdp # Chris Amato's recycling robot problem, UAI 2007. # Extracted from # http://rbr.cs.umass.edu/~camato/decpomdp/down/ProblemData3Probs.java agents: 2 discount: 0.9 values: reward states: 4 start: 1.0 0.0 0.0 0.0 actions: searchbig searchlittle waitandrecharge searchbig searchlittle waitandrecharge observations: 2 2 T: 0 0 : 0 : 0 : 1.0 T: 0 1 : 0 : 0 : 0.7 T: 0 1 : 0 : 1 : 0.3 T: 0 2 : 0 : 0 : 0.5 T: 0 2 : 0 : 1 : 0.5 T: 1 0 : 0 : 0 : 0.7 T: 1 0 : 0 : 2 : 0.3 T: 1 1 : 0 : 0 : 0.49 T: 1 1 : 0 : 1 : 0.21 T: 1 1 : 0 : 2 : 0.21 T: 1 1 : 0 : 3 : 0.09 T: 1 2 : 0 : 0 : 0.35 T: 1 2 : 0 : 1 : 0.35 T: 1 2 : 0 : 2 : 0.15 T: 1 2 : 0 : 3 : 0.15 T: 2 0 : 0 : 0 : 0.5 T: 2 0 : 0 : 2 : 0.5 T: 2 1 : 0 : 0 : 0.35 T: 2 1 : 0 : 1 : 0.15 T: 2 1 : 0 : 2 : 0.35 T: 2 1 : 0 : 3 : 0.15 T: 2 2 : 0 : 0 : 0.25 T: 2 2 : 0 : 1 : 0.25 T: 2 2 : 0 : 2 : 0.25 T: 2 2 : 0 : 3 : 0.25 T: 0 0 : 1 : 0 : 1.0 T: 0 1 : 1 : 0 : 0.2 T: 0 1 : 1 : 1 : 0.8 T: 0 2 : 1 : 0 : 0.3 T: 0 2 : 1 : 1 : 0.7 T: 1 0 : 1 : 0 : 0.7 T: 1 0 : 1 : 2 : 0.3 T: 1 1 : 1 : 0 : 0.14 T: 1 1 : 1 : 1 : 0.56 T: 1 1 : 1 : 2 : 0.06 T: 1 1 : 1 : 3 : 0.24 T: 1 2 : 1 : 0 : 0.21 T: 1 2 : 1 : 1 : 0.49 T: 1 2 : 1 : 2 : 0.09 T: 1 2 : 1 : 3 : 0.21 T: 2 0 : 1 : 0 : 0.5 T: 2 0 : 1 : 2 : 0.5 T: 2 1 : 1 : 0 : 0.1 T: 2 1 : 1 : 1 : 0.4 T: 2 1 : 1 : 2 : 0.1 T: 2 1 : 1 : 3 : 0.4 T: 2 2 : 1 : 0 : 0.15 T: 2 2 : 1 : 1 : 0.35 T: 2 2 : 1 : 2 : 0.15 T: 2 2 : 1 : 3 : 0.35 T: 0 0 : 2 : 0 : 1.0 T: 0 1 : 2 : 0 : 0.7 T: 0 1 : 2 : 1 : 0.3 T: 0 2 : 2 : 0 : 0.5 T: 0 2 : 2 : 1 : 0.5 T: 1 0 : 2 : 0 : 0.2 T: 1 0 : 2 : 2 : 0.8 T: 1 1 : 2 : 0 : 0.14 T: 1 1 : 2 : 1 : 0.06 T: 1 1 : 2 : 2 : 0.56 T: 1 1 : 2 : 3 : 0.24 T: 1 2 : 2 : 0 : 0.1 T: 1 2 : 2 : 1 : 0.1 T: 1 2 : 2 : 2 : 0.4 T: 1 2 : 2 : 3 : 0.4 T: 2 0 : 2 : 0 : 0.3 T: 2 0 : 2 : 2 : 0.7 T: 2 1 : 2 : 0 : 0.21 T: 2 1 : 2 : 1 : 0.09 T: 2 1 : 2 : 2 : 0.49 T: 2 1 : 2 : 3 : 0.21 T: 2 2 : 2 : 0 : 0.15 T: 2 2 : 2 : 1 : 0.15 T: 2 2 : 2 : 2 : 0.35 T: 2 2 : 2 : 3 : 0.35 T: 0 0 : 3 : 0 : 1.0 T: 0 1 : 3 : 0 : 0.2 T: 0 1 : 3 : 1 : 0.8 T: 0 2 : 3 : 0 : 0.3 T: 0 2 : 3 : 1 : 0.7 T: 1 0 : 3 : 0 : 0.2 T: 1 0 : 3 : 2 : 0.8 T: 1 1 : 3 : 0 : 0.04 T: 1 1 : 3 : 1 : 0.16 T: 1 1 : 3 : 2 : 0.16 T: 1 1 : 3 : 3 : 0.64 T: 1 2 : 3 : 0 : 0.06 T: 1 2 : 3 : 1 : 0.14 T: 1 2 : 3 : 2 : 0.24 T: 1 2 : 3 : 3 : 0.56 T: 2 0 : 3 : 0 : 0.3 T: 2 0 : 3 : 2 : 0.7 T: 2 1 : 3 : 0 : 0.06 T: 2 1 : 3 : 1 : 0.24 T: 2 1 : 3 : 2 : 0.14 T: 2 1 : 3 : 3 : 0.56 T: 2 2 : 3 : 0 : 0.09 T: 2 2 : 3 : 1 : 0.21 T: 2 2 : 3 : 2 : 0.21 T: 2 2 : 3 : 3 : 0.49 O: 0 0 : 0 : 0 0 : 1.0 O: 0 1 : 0 : 0 0 : 1.0 O: 0 2 : 0 : 0 0 : 1.0 O: 1 0 : 0 : 0 0 : 1.0 O: 1 1 : 0 : 0 0 : 1.0 O: 1 2 : 0 : 0 0 : 1.0 O: 2 0 : 0 : 0 0 : 1.0 O: 2 1 : 0 : 0 0 : 1.0 O: 2 2 : 0 : 0 0 : 1.0 O: 0 0 : 1 : 0 1 : 1.0 O: 0 1 : 1 : 0 1 : 1.0 O: 0 2 : 1 : 0 1 : 1.0 O: 1 0 : 1 : 0 1 : 1.0 O: 1 1 : 1 : 0 1 : 1.0 O: 1 2 : 1 : 0 1 : 1.0 O: 2 0 : 1 : 0 1 : 1.0 O: 2 1 : 1 : 0 1 : 1.0 O: 2 2 : 1 : 0 1 : 1.0 O: 0 0 : 2 : 1 0 : 1.0 O: 0 1 : 2 : 1 0 : 1.0 O: 0 2 : 2 : 1 0 : 1.0 O: 1 0 : 2 : 1 0 : 1.0 O: 1 1 : 2 : 1 0 : 1.0 O: 1 2 : 2 : 1 0 : 1.0 O: 2 0 : 2 : 1 0 : 1.0 O: 2 1 : 2 : 1 0 : 1.0 O: 2 2 : 2 : 1 0 : 1.0 O: 0 0 : 3 : 1 1 : 1.0 O: 0 1 : 3 : 1 1 : 1.0 O: 0 2 : 3 : 1 1 : 1.0 O: 1 0 : 3 : 1 1 : 1.0 O: 1 1 : 3 : 1 1 : 1.0 O: 1 2 : 3 : 1 1 : 1.0 O: 2 0 : 3 : 1 1 : 1.0 O: 2 1 : 3 : 1 1 : 1.0 O: 2 2 : 3 : 1 1 : 1.0 R: 0 1 : 0 : * : * : 2.0 R: 1 0 : 0 : * : * : 2.0 R: 1 1 : 0 : * : * : 4.0 R: 1 2 : 0 : * : * : 2.0 R: 2 1 : 0 : * : * : 2.0 R: 2 2 : 0 : * : * : 5.0 R: 0 1 : 1 : * : * : -0.4 R: 0 2 : 1 : * : * : -3.0 R: 1 0 : 1 : * : * : 2.0 R: 1 1 : 1 : * : * : 1.2 R: 1 2 : 1 : * : * : -1.6 R: 2 1 : 1 : * : * : -0.4 R: 2 2 : 1 : * : * : 0.5 R: 0 1 : 2 : * : * : 2.0 R: 1 0 : 2 : * : * : -0.4 R: 1 1 : 2 : * : * : 1.2 R: 1 2 : 2 : * : * : -0.4 R: 2 0 : 2 : * : * : -3.0 R: 2 1 : 2 : * : * : -1.6 R: 2 2 : 2 : * : * : 0.5 R: 0 1 : 3 : * : * : -0.4 R: 0 2 : 3 : * : * : -3.0 R: 1 0 : 3 : * : * : -0.4 R: 1 1 : 3 : * : * : -1.44 R: 1 2 : 3 : * : * : -3.88 R: 2 0 : 3 : * : * : -3.0 R: 2 1 : 3 : * : * : -3.88 R: 2 2 : 3 : * : * : -3.55 madp-0.4/problems/PaxHeaders.5405/FFG343.pgmx0000644000000000000000000000007412717644140015337 xustar0030 atime=1463765180.073720381 30 ctime=1463765201.025553043 madp-0.4/problems/FFG343.pgmx0000775000372100037210000030115712717644140016200 0ustar00fransfrans00000000000000 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 0.01 1.0 0.0 0.0 0.6 0.4 0.0 0.0 0.6 0.4 1.0 0.0 0.0 0.0 1.0 0.0 0.2 0.8 0.0 1.0 0.0 0.0 0.0 0.2 0.8 0.0 0.6 0.4 0.0 0.0 1.0 1.0 0.0 0.0 0.6 0.4 0.0 0.0 0.6 0.4 1.0 0.0 0.0 0.6 0.4 0.0 0.0 0.6 0.4 1.0 0.0 0.0 0.0 1.0 0.0 0.2 0.8 0.0 0.0 0.2 0.8 0.0 0.0 1.0 0.2 0.8 0.0 0.0 0.2 0.8 0.0 0.0 1.0 1.0 0.0 0.0 0.0 0.6 0.4 0.0 0.0 1.0 1.0 0.0 0.0 1.0 0.0 0.0 0.6 0.4 0.0 0.0 0.6 0.4 1.0 0.0 0.0 0.6 0.4 0.0 0.0 0.6 0.4 1.0 0.0 0.0 0.0 1.0 0.0 1.0 0.0 0.0 0.6 0.4 0.0 0.0 0.6 0.4 1.0 0.0 0.0 0.0 1.0 0.0 0.2 0.8 0.0 1.0 0.0 0.0 0.0 0.2 0.8 0.0 0.6 0.4 0.0 0.0 1.0 1.0 0.0 0.0 0.6 0.4 0.0 0.0 0.6 0.4 1.0 0.0 0.0 0.6 0.4 0.0 0.0 0.6 0.4 1.0 0.0 0.0 0.0 1.0 0.0 0.2 0.8 0.0 0.0 0.2 0.8 0.0 0.0 1.0 0.2 0.8 0.0 0.0 0.2 0.8 0.0 0.0 1.0 1.0 0.0 0.0 0.0 0.6 0.4 0.0 0.0 1.0 1.0 0.0 0.0 1.0 0.0 0.0 0.6 0.4 0.0 0.0 0.6 0.4 1.0 0.0 0.0 0.6 0.4 0.0 0.0 0.6 0.4 1.0 0.0 0.0 0.0 1.0 0.0 0.2 0.8 0.5 0.5 0.8 0.2 0.2 0.8 0.5 0.5 0.8 0.2 0.2 0.8 0.5 0.5 0.8 0.2 0.2 0.8 0.5 0.5 0.8 0.2 0.2 0.8 0.5 0.5 0.8 0.2 0.2 0.8 0.5 0.5 0.8 0.2 0.0 -1.0 -2.0 0.0 -1.0 -2.0 0.0 -1.0 -2.0 0.0 -1.0 -2.0 madp-0.4/PaxHeaders.5405/INSTALL0000644000000000000000000000013012717644307013012 xustar0030 mtime=1463765191.909625852 30 atime=1463765191.905625885 28 ctime=1463765200.9935533 madp-0.4/INSTALL0000644000372100037210000003661012717644307013654 0ustar00fransfrans00000000000000Installation Instructions ************************* Copyright (C) 1994-1996, 1999-2002, 2004-2013 Free Software Foundation, Inc. Copying and distribution of this file, with or without modification, are permitted in any medium without royalty provided the copyright notice and this notice are preserved. This file is offered as-is, without warranty of any kind. Basic Installation ================== Briefly, the shell command `./configure && make && make install' should configure, build, and install this package. The following more-detailed instructions are generic; see the `README' file for instructions specific to this package. Some packages provide this `INSTALL' file but do not implement all of the features documented below. The lack of an optional feature in a given package is not necessarily a bug. More recommendations for GNU packages can be found in *note Makefile Conventions: (standards)Makefile Conventions. The `configure' shell script attempts to guess correct values for various system-dependent variables used during compilation. It uses those values to create a `Makefile' in each directory of the package. It may also create one or more `.h' files containing system-dependent definitions. Finally, it creates a shell script `config.status' that you can run in the future to recreate the current configuration, and a file `config.log' containing compiler output (useful mainly for debugging `configure'). It can also use an optional file (typically called `config.cache' and enabled with `--cache-file=config.cache' or simply `-C') that saves the results of its tests to speed up reconfiguring. Caching is disabled by default to prevent problems with accidental use of stale cache files. If you need to do unusual things to compile the package, please try to figure out how `configure' could check whether to do them, and mail diffs or instructions to the address given in the `README' so they can be considered for the next release. If you are using the cache, and at some point `config.cache' contains results you don't want to keep, you may remove or edit it. The file `configure.ac' (or `configure.in') is used to create `configure' by a program called `autoconf'. You need `configure.ac' if you want to change it or regenerate `configure' using a newer version of `autoconf'. The simplest way to compile this package is: 1. `cd' to the directory containing the package's source code and type `./configure' to configure the package for your system. Running `configure' might take a while. While running, it prints some messages telling which features it is checking for. 2. Type `make' to compile the package. 3. Optionally, type `make check' to run any self-tests that come with the package, generally using the just-built uninstalled binaries. 4. Type `make install' to install the programs and any data files and documentation. When installing into a prefix owned by root, it is recommended that the package be configured and built as a regular user, and only the `make install' phase executed with root privileges. 5. Optionally, type `make installcheck' to repeat any self-tests, but this time using the binaries in their final installed location. This target does not install anything. Running this target as a regular user, particularly if the prior `make install' required root privileges, verifies that the installation completed correctly. 6. You can remove the program binaries and object files from the source code directory by typing `make clean'. To also remove the files that `configure' created (so you can compile the package for a different kind of computer), type `make distclean'. There is also a `make maintainer-clean' target, but that is intended mainly for the package's developers. If you use it, you may have to get all sorts of other programs in order to regenerate files that came with the distribution. 7. Often, you can also type `make uninstall' to remove the installed files again. In practice, not all packages have tested that uninstallation works correctly, even though it is required by the GNU Coding Standards. 8. Some packages, particularly those that use Automake, provide `make distcheck', which can by used by developers to test that all other targets like `make install' and `make uninstall' work correctly. This target is generally not run by end users. Compilers and Options ===================== Some systems require unusual options for compilation or linking that the `configure' script does not know about. Run `./configure --help' for details on some of the pertinent environment variables. You can give `configure' initial values for configuration parameters by setting variables in the command line or in the environment. Here is an example: ./configure CC=c99 CFLAGS=-g LIBS=-lposix *Note Defining Variables::, for more details. Compiling For Multiple Architectures ==================================== You can compile the package for more than one kind of computer at the same time, by placing the object files for each architecture in their own directory. To do this, you can use GNU `make'. `cd' to the directory where you want the object files and executables to go and run the `configure' script. `configure' automatically checks for the source code in the directory that `configure' is in and in `..'. This is known as a "VPATH" build. With a non-GNU `make', it is safer to compile the package for one architecture at a time in the source code directory. After you have installed the package for one architecture, use `make distclean' before reconfiguring for another architecture. On MacOS X 10.5 and later systems, you can create libraries and executables that work on multiple system types--known as "fat" or "universal" binaries--by specifying multiple `-arch' options to the compiler but only a single `-arch' option to the preprocessor. Like this: ./configure CC="gcc -arch i386 -arch x86_64 -arch ppc -arch ppc64" \ CXX="g++ -arch i386 -arch x86_64 -arch ppc -arch ppc64" \ CPP="gcc -E" CXXCPP="g++ -E" This is not guaranteed to produce working output in all cases, you may have to build one architecture at a time and combine the results using the `lipo' tool if you have problems. Installation Names ================== By default, `make install' installs the package's commands under `/usr/local/bin', include files under `/usr/local/include', etc. You can specify an installation prefix other than `/usr/local' by giving `configure' the option `--prefix=PREFIX', where PREFIX must be an absolute file name. You can specify separate installation prefixes for architecture-specific files and architecture-independent files. If you pass the option `--exec-prefix=PREFIX' to `configure', the package uses PREFIX as the prefix for installing programs and libraries. Documentation and other data files still use the regular prefix. In addition, if you use an unusual directory layout you can give options like `--bindir=DIR' to specify different values for particular kinds of files. Run `configure --help' for a list of the directories you can set and what kinds of files go in them. In general, the default for these options is expressed in terms of `${prefix}', so that specifying just `--prefix' will affect all of the other directory specifications that were not explicitly provided. The most portable way to affect installation locations is to pass the correct locations to `configure'; however, many packages provide one or both of the following shortcuts of passing variable assignments to the `make install' command line to change installation locations without having to reconfigure or recompile. The first method involves providing an override variable for each affected directory. For example, `make install prefix=/alternate/directory' will choose an alternate location for all directory configuration variables that were expressed in terms of `${prefix}'. Any directories that were specified during `configure', but not in terms of `${prefix}', must each be overridden at install time for the entire installation to be relocated. The approach of makefile variable overrides for each directory variable is required by the GNU Coding Standards, and ideally causes no recompilation. However, some platforms have known limitations with the semantics of shared libraries that end up requiring recompilation when using this method, particularly noticeable in packages that use GNU Libtool. The second method involves providing the `DESTDIR' variable. For example, `make install DESTDIR=/alternate/directory' will prepend `/alternate/directory' before all installation names. The approach of `DESTDIR' overrides is not required by the GNU Coding Standards, and does not work on platforms that have drive letters. On the other hand, it does better at avoiding recompilation issues, and works well even when some directory options were not specified in terms of `${prefix}' at `configure' time. Optional Features ================= If the package supports it, you can cause programs to be installed with an extra prefix or suffix on their names by giving `configure' the option `--program-prefix=PREFIX' or `--program-suffix=SUFFIX'. Some packages pay attention to `--enable-FEATURE' options to `configure', where FEATURE indicates an optional part of the package. They may also pay attention to `--with-PACKAGE' options, where PACKAGE is something like `gnu-as' or `x' (for the X Window System). The `README' should mention any `--enable-' and `--with-' options that the package recognizes. For packages that use the X Window System, `configure' can usually find the X include and library files automatically, but if it doesn't, you can use the `configure' options `--x-includes=DIR' and `--x-libraries=DIR' to specify their locations. Some packages offer the ability to configure how verbose the execution of `make' will be. For these packages, running `./configure --enable-silent-rules' sets the default to minimal output, which can be overridden with `make V=1'; while running `./configure --disable-silent-rules' sets the default to verbose, which can be overridden with `make V=0'. Particular systems ================== On HP-UX, the default C compiler is not ANSI C compatible. If GNU CC is not installed, it is recommended to use the following options in order to use an ANSI C compiler: ./configure CC="cc -Ae -D_XOPEN_SOURCE=500" and if that doesn't work, install pre-built binaries of GCC for HP-UX. HP-UX `make' updates targets which have the same time stamps as their prerequisites, which makes it generally unusable when shipped generated files such as `configure' are involved. Use GNU `make' instead. On OSF/1 a.k.a. Tru64, some versions of the default C compiler cannot parse its `' header file. The option `-nodtk' can be used as a workaround. If GNU CC is not installed, it is therefore recommended to try ./configure CC="cc" and if that doesn't work, try ./configure CC="cc -nodtk" On Solaris, don't put `/usr/ucb' early in your `PATH'. This directory contains several dysfunctional programs; working variants of these programs are available in `/usr/bin'. So, if you need `/usr/ucb' in your `PATH', put it _after_ `/usr/bin'. On Haiku, software installed for all users goes in `/boot/common', not `/usr/local'. It is recommended to use the following options: ./configure --prefix=/boot/common Specifying the System Type ========================== There may be some features `configure' cannot figure out automatically, but needs to determine by the type of machine the package will run on. Usually, assuming the package is built to be run on the _same_ architectures, `configure' can figure that out, but if it prints a message saying it cannot guess the machine type, give it the `--build=TYPE' option. TYPE can either be a short name for the system type, such as `sun4', or a canonical name which has the form: CPU-COMPANY-SYSTEM where SYSTEM can have one of these forms: OS KERNEL-OS See the file `config.sub' for the possible values of each field. If `config.sub' isn't included in this package, then this package doesn't need to know the machine type. If you are _building_ compiler tools for cross-compiling, you should use the option `--target=TYPE' to select the type of system they will produce code for. If you want to _use_ a cross compiler, that generates code for a platform different from the build platform, you should specify the "host" platform (i.e., that on which the generated programs will eventually be run) with `--host=TYPE'. Sharing Defaults ================ If you want to set default values for `configure' scripts to share, you can create a site shell script called `config.site' that gives default values for variables like `CC', `cache_file', and `prefix'. `configure' looks for `PREFIX/share/config.site' if it exists, then `PREFIX/etc/config.site' if it exists. Or, you can set the `CONFIG_SITE' environment variable to the location of the site script. A warning: not all `configure' scripts look for a site script. Defining Variables ================== Variables not defined in a site shell script can be set in the environment passed to `configure'. However, some packages may run configure again during the build, and the customized values of these variables may be lost. In order to avoid this problem, you should set them in the `configure' command line, using `VAR=value'. For example: ./configure CC=/usr/local2/bin/gcc causes the specified `gcc' to be used as the C compiler (unless it is overridden in the site shell script). Unfortunately, this technique does not work for `CONFIG_SHELL' due to an Autoconf limitation. Until the limitation is lifted, you can use this workaround: CONFIG_SHELL=/bin/bash ./configure CONFIG_SHELL=/bin/bash `configure' Invocation ====================== `configure' recognizes the following options to control how it operates. `--help' `-h' Print a summary of all of the options to `configure', and exit. `--help=short' `--help=recursive' Print a summary of the options unique to this package's `configure', and exit. The `short' variant lists options used only in the top level, while the `recursive' variant lists options also present in any nested packages. `--version' `-V' Print the version of Autoconf used to generate the `configure' script, and exit. `--cache-file=FILE' Enable the cache: use and save the results of the tests in FILE, traditionally `config.cache'. FILE defaults to `/dev/null' to disable caching. `--config-cache' `-C' Alias for `--cache-file=config.cache'. `--quiet' `--silent' `-q' Do not print messages saying which checks are being made. To suppress all normal output, redirect it to `/dev/null' (any error messages will still be shown). `--srcdir=DIR' Look for the package's source code in directory DIR. Usually `configure' can determine that directory automatically. `--prefix=DIR' Use DIR as the installation prefix. *note Installation Names:: for more details, including other options available for fine-tuning the installation locations. `--no-create' `-n' Run the configure checks, but stop before creating any output files. `configure' also accepts some other, not widely useful, options. Run `configure --help' for more details. madp-0.4/PaxHeaders.5405/config0000644000000000000000000000013212717644321013147 xustar0030 mtime=1463765201.229551415 30 atime=1463765202.453541638 30 ctime=1463765201.229551415 madp-0.4/config/0000775000372100037210000000000012717644321014060 5ustar00fransfrans00000000000000madp-0.4/config/PaxHeaders.5405/Make-rules0000644000000000000000000000007312717644140015157 xustar0029 atime=1463765193.37361416 30 ctime=1463765201.229551415 madp-0.4/config/Make-rules0000664000372100037210000000000012717644140015775 0ustar00fransfrans00000000000000madp-0.4/PaxHeaders.5405/NEWS0000644000000000000000000000007112717644140012457 xustar0029 atime=1463765180.05772051 28 ctime=1463765200.9935533 madp-0.4/NEWS0000664000372100037210000000031012717644140013303 0ustar00fransfrans00000000000000Release 0.4 on May 20, 2016. Release 0.3.1 on Feb. 22nd, 2015. Third public release 0.3 on May 1st, 2014. Second public release 0.2 on September 7, 2009. First public release 0.1 on January 21, 2008. madp-0.4/PaxHeaders.5405/Makefile.am0000644000000000000000000000007412717644140014017 xustar0030 atime=1463765191.905625885 30 ctime=1463765200.997553268 madp-0.4/Makefile.am0000664000372100037210000000126712717644140014654 0ustar00fransfrans00000000000000ACLOCAL_AMFLAGS = -I m4 SUBDIRS = src EXTRA_DIST = src/include/versions.h \ src/include/configuration.h \ src/parser/dpomdp.spirit \ src/parser/pomdp.spirit \ problems \ doc \ src/boost \ src/solvers/GMAA-IC \ src/solvers/GMAA-ICE #removes subversion dirs before packing dist-hook: rm -rf `find $(distdir) -name .svn` bak: bak-recursive bak-recursive: list='$(SUBDIRS)'; for subdir in $$list; do \ test "$$subdir" = . || (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) bak); \ done htmldoc: doxygen doc/doxygen.conf; package: rm -fr madp-0.3.1 cp madp-0.3.1.tar.gz madp_0.3.1.orig.tar.gz tar xf madp_0.3.1.orig.tar.gz cp -r debian madp-0.3.1/ cd madp-0.3.1 && debuild -us -uc madp-0.4/PaxHeaders.5405/m40000644000000000000000000000013212717644321012222 xustar0030 mtime=1463765201.005553204 30 atime=1463765202.453541638 30 ctime=1463765201.005553204 madp-0.4/m4/0000775000372100037210000000000012717644321013133 5ustar00fransfrans00000000000000madp-0.4/m4/PaxHeaders.5405/ltoptions.m40000644000000000000000000000013212717644303014574 xustar0030 mtime=1463765187.129664029 30 atime=1463765191.441629591 30 ctime=1463765201.005553204 madp-0.4/m4/ltoptions.m40000644000372100037210000003007312717644303015431 0ustar00fransfrans00000000000000# Helper functions for option handling. -*- Autoconf -*- # # Copyright (C) 2004, 2005, 2007, 2008, 2009 Free Software Foundation, # Inc. # Written by Gary V. Vaughan, 2004 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # serial 7 ltoptions.m4 # This is to help aclocal find these macros, as it can't see m4_define. AC_DEFUN([LTOPTIONS_VERSION], [m4_if([1])]) # _LT_MANGLE_OPTION(MACRO-NAME, OPTION-NAME) # ------------------------------------------ m4_define([_LT_MANGLE_OPTION], [[_LT_OPTION_]m4_bpatsubst($1__$2, [[^a-zA-Z0-9_]], [_])]) # _LT_SET_OPTION(MACRO-NAME, OPTION-NAME) # --------------------------------------- # Set option OPTION-NAME for macro MACRO-NAME, and if there is a # matching handler defined, dispatch to it. Other OPTION-NAMEs are # saved as a flag. m4_define([_LT_SET_OPTION], [m4_define(_LT_MANGLE_OPTION([$1], [$2]))dnl m4_ifdef(_LT_MANGLE_DEFUN([$1], [$2]), _LT_MANGLE_DEFUN([$1], [$2]), [m4_warning([Unknown $1 option `$2'])])[]dnl ]) # _LT_IF_OPTION(MACRO-NAME, OPTION-NAME, IF-SET, [IF-NOT-SET]) # ------------------------------------------------------------ # Execute IF-SET if OPTION is set, IF-NOT-SET otherwise. m4_define([_LT_IF_OPTION], [m4_ifdef(_LT_MANGLE_OPTION([$1], [$2]), [$3], [$4])]) # _LT_UNLESS_OPTIONS(MACRO-NAME, OPTION-LIST, IF-NOT-SET) # ------------------------------------------------------- # Execute IF-NOT-SET unless all options in OPTION-LIST for MACRO-NAME # are set. m4_define([_LT_UNLESS_OPTIONS], [m4_foreach([_LT_Option], m4_split(m4_normalize([$2])), [m4_ifdef(_LT_MANGLE_OPTION([$1], _LT_Option), [m4_define([$0_found])])])[]dnl m4_ifdef([$0_found], [m4_undefine([$0_found])], [$3 ])[]dnl ]) # _LT_SET_OPTIONS(MACRO-NAME, OPTION-LIST) # ---------------------------------------- # OPTION-LIST is a space-separated list of Libtool options associated # with MACRO-NAME. If any OPTION has a matching handler declared with # LT_OPTION_DEFINE, dispatch to that macro; otherwise complain about # the unknown option and exit. m4_defun([_LT_SET_OPTIONS], [# Set options m4_foreach([_LT_Option], m4_split(m4_normalize([$2])), [_LT_SET_OPTION([$1], _LT_Option)]) m4_if([$1],[LT_INIT],[ dnl dnl Simply set some default values (i.e off) if boolean options were not dnl specified: _LT_UNLESS_OPTIONS([LT_INIT], [dlopen], [enable_dlopen=no ]) _LT_UNLESS_OPTIONS([LT_INIT], [win32-dll], [enable_win32_dll=no ]) dnl dnl If no reference was made to various pairs of opposing options, then dnl we run the default mode handler for the pair. For example, if neither dnl `shared' nor `disable-shared' was passed, we enable building of shared dnl archives by default: _LT_UNLESS_OPTIONS([LT_INIT], [shared disable-shared], [_LT_ENABLE_SHARED]) _LT_UNLESS_OPTIONS([LT_INIT], [static disable-static], [_LT_ENABLE_STATIC]) _LT_UNLESS_OPTIONS([LT_INIT], [pic-only no-pic], [_LT_WITH_PIC]) _LT_UNLESS_OPTIONS([LT_INIT], [fast-install disable-fast-install], [_LT_ENABLE_FAST_INSTALL]) ]) ])# _LT_SET_OPTIONS ## --------------------------------- ## ## Macros to handle LT_INIT options. ## ## --------------------------------- ## # _LT_MANGLE_DEFUN(MACRO-NAME, OPTION-NAME) # ----------------------------------------- m4_define([_LT_MANGLE_DEFUN], [[_LT_OPTION_DEFUN_]m4_bpatsubst(m4_toupper([$1__$2]), [[^A-Z0-9_]], [_])]) # LT_OPTION_DEFINE(MACRO-NAME, OPTION-NAME, CODE) # ----------------------------------------------- m4_define([LT_OPTION_DEFINE], [m4_define(_LT_MANGLE_DEFUN([$1], [$2]), [$3])[]dnl ])# LT_OPTION_DEFINE # dlopen # ------ LT_OPTION_DEFINE([LT_INIT], [dlopen], [enable_dlopen=yes ]) AU_DEFUN([AC_LIBTOOL_DLOPEN], [_LT_SET_OPTION([LT_INIT], [dlopen]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the `dlopen' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_DLOPEN], []) # win32-dll # --------- # Declare package support for building win32 dll's. LT_OPTION_DEFINE([LT_INIT], [win32-dll], [enable_win32_dll=yes case $host in *-*-cygwin* | *-*-mingw* | *-*-pw32* | *-*-cegcc*) AC_CHECK_TOOL(AS, as, false) AC_CHECK_TOOL(DLLTOOL, dlltool, false) AC_CHECK_TOOL(OBJDUMP, objdump, false) ;; esac test -z "$AS" && AS=as _LT_DECL([], [AS], [1], [Assembler program])dnl test -z "$DLLTOOL" && DLLTOOL=dlltool _LT_DECL([], [DLLTOOL], [1], [DLL creation program])dnl test -z "$OBJDUMP" && OBJDUMP=objdump _LT_DECL([], [OBJDUMP], [1], [Object dumper program])dnl ])# win32-dll AU_DEFUN([AC_LIBTOOL_WIN32_DLL], [AC_REQUIRE([AC_CANONICAL_HOST])dnl _LT_SET_OPTION([LT_INIT], [win32-dll]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the `win32-dll' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_WIN32_DLL], []) # _LT_ENABLE_SHARED([DEFAULT]) # ---------------------------- # implement the --enable-shared flag, and supports the `shared' and # `disable-shared' LT_INIT options. # DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'. m4_define([_LT_ENABLE_SHARED], [m4_define([_LT_ENABLE_SHARED_DEFAULT], [m4_if($1, no, no, yes)])dnl AC_ARG_ENABLE([shared], [AS_HELP_STRING([--enable-shared@<:@=PKGS@:>@], [build shared libraries @<:@default=]_LT_ENABLE_SHARED_DEFAULT[@:>@])], [p=${PACKAGE-default} case $enableval in yes) enable_shared=yes ;; no) enable_shared=no ;; *) enable_shared=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_shared=yes fi done IFS="$lt_save_ifs" ;; esac], [enable_shared=]_LT_ENABLE_SHARED_DEFAULT) _LT_DECL([build_libtool_libs], [enable_shared], [0], [Whether or not to build shared libraries]) ])# _LT_ENABLE_SHARED LT_OPTION_DEFINE([LT_INIT], [shared], [_LT_ENABLE_SHARED([yes])]) LT_OPTION_DEFINE([LT_INIT], [disable-shared], [_LT_ENABLE_SHARED([no])]) # Old names: AC_DEFUN([AC_ENABLE_SHARED], [_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[shared]) ]) AC_DEFUN([AC_DISABLE_SHARED], [_LT_SET_OPTION([LT_INIT], [disable-shared]) ]) AU_DEFUN([AM_ENABLE_SHARED], [AC_ENABLE_SHARED($@)]) AU_DEFUN([AM_DISABLE_SHARED], [AC_DISABLE_SHARED($@)]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AM_ENABLE_SHARED], []) dnl AC_DEFUN([AM_DISABLE_SHARED], []) # _LT_ENABLE_STATIC([DEFAULT]) # ---------------------------- # implement the --enable-static flag, and support the `static' and # `disable-static' LT_INIT options. # DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'. m4_define([_LT_ENABLE_STATIC], [m4_define([_LT_ENABLE_STATIC_DEFAULT], [m4_if($1, no, no, yes)])dnl AC_ARG_ENABLE([static], [AS_HELP_STRING([--enable-static@<:@=PKGS@:>@], [build static libraries @<:@default=]_LT_ENABLE_STATIC_DEFAULT[@:>@])], [p=${PACKAGE-default} case $enableval in yes) enable_static=yes ;; no) enable_static=no ;; *) enable_static=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_static=yes fi done IFS="$lt_save_ifs" ;; esac], [enable_static=]_LT_ENABLE_STATIC_DEFAULT) _LT_DECL([build_old_libs], [enable_static], [0], [Whether or not to build static libraries]) ])# _LT_ENABLE_STATIC LT_OPTION_DEFINE([LT_INIT], [static], [_LT_ENABLE_STATIC([yes])]) LT_OPTION_DEFINE([LT_INIT], [disable-static], [_LT_ENABLE_STATIC([no])]) # Old names: AC_DEFUN([AC_ENABLE_STATIC], [_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[static]) ]) AC_DEFUN([AC_DISABLE_STATIC], [_LT_SET_OPTION([LT_INIT], [disable-static]) ]) AU_DEFUN([AM_ENABLE_STATIC], [AC_ENABLE_STATIC($@)]) AU_DEFUN([AM_DISABLE_STATIC], [AC_DISABLE_STATIC($@)]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AM_ENABLE_STATIC], []) dnl AC_DEFUN([AM_DISABLE_STATIC], []) # _LT_ENABLE_FAST_INSTALL([DEFAULT]) # ---------------------------------- # implement the --enable-fast-install flag, and support the `fast-install' # and `disable-fast-install' LT_INIT options. # DEFAULT is either `yes' or `no'. If omitted, it defaults to `yes'. m4_define([_LT_ENABLE_FAST_INSTALL], [m4_define([_LT_ENABLE_FAST_INSTALL_DEFAULT], [m4_if($1, no, no, yes)])dnl AC_ARG_ENABLE([fast-install], [AS_HELP_STRING([--enable-fast-install@<:@=PKGS@:>@], [optimize for fast installation @<:@default=]_LT_ENABLE_FAST_INSTALL_DEFAULT[@:>@])], [p=${PACKAGE-default} case $enableval in yes) enable_fast_install=yes ;; no) enable_fast_install=no ;; *) enable_fast_install=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_fast_install=yes fi done IFS="$lt_save_ifs" ;; esac], [enable_fast_install=]_LT_ENABLE_FAST_INSTALL_DEFAULT) _LT_DECL([fast_install], [enable_fast_install], [0], [Whether or not to optimize for fast installation])dnl ])# _LT_ENABLE_FAST_INSTALL LT_OPTION_DEFINE([LT_INIT], [fast-install], [_LT_ENABLE_FAST_INSTALL([yes])]) LT_OPTION_DEFINE([LT_INIT], [disable-fast-install], [_LT_ENABLE_FAST_INSTALL([no])]) # Old names: AU_DEFUN([AC_ENABLE_FAST_INSTALL], [_LT_SET_OPTION([LT_INIT], m4_if([$1], [no], [disable-])[fast-install]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the `fast-install' option into LT_INIT's first parameter.]) ]) AU_DEFUN([AC_DISABLE_FAST_INSTALL], [_LT_SET_OPTION([LT_INIT], [disable-fast-install]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the `disable-fast-install' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_ENABLE_FAST_INSTALL], []) dnl AC_DEFUN([AM_DISABLE_FAST_INSTALL], []) # _LT_WITH_PIC([MODE]) # -------------------- # implement the --with-pic flag, and support the `pic-only' and `no-pic' # LT_INIT options. # MODE is either `yes' or `no'. If omitted, it defaults to `both'. m4_define([_LT_WITH_PIC], [AC_ARG_WITH([pic], [AS_HELP_STRING([--with-pic@<:@=PKGS@:>@], [try to use only PIC/non-PIC objects @<:@default=use both@:>@])], [lt_p=${PACKAGE-default} case $withval in yes|no) pic_mode=$withval ;; *) pic_mode=default # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for lt_pkg in $withval; do IFS="$lt_save_ifs" if test "X$lt_pkg" = "X$lt_p"; then pic_mode=yes fi done IFS="$lt_save_ifs" ;; esac], [pic_mode=default]) test -z "$pic_mode" && pic_mode=m4_default([$1], [default]) _LT_DECL([], [pic_mode], [0], [What type of objects to build])dnl ])# _LT_WITH_PIC LT_OPTION_DEFINE([LT_INIT], [pic-only], [_LT_WITH_PIC([yes])]) LT_OPTION_DEFINE([LT_INIT], [no-pic], [_LT_WITH_PIC([no])]) # Old name: AU_DEFUN([AC_LIBTOOL_PICMODE], [_LT_SET_OPTION([LT_INIT], [pic-only]) AC_DIAGNOSE([obsolete], [$0: Remove this warning and the call to _LT_SET_OPTION when you put the `pic-only' option into LT_INIT's first parameter.]) ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_PICMODE], []) ## ----------------- ## ## LTDL_INIT Options ## ## ----------------- ## m4_define([_LTDL_MODE], []) LT_OPTION_DEFINE([LTDL_INIT], [nonrecursive], [m4_define([_LTDL_MODE], [nonrecursive])]) LT_OPTION_DEFINE([LTDL_INIT], [recursive], [m4_define([_LTDL_MODE], [recursive])]) LT_OPTION_DEFINE([LTDL_INIT], [subproject], [m4_define([_LTDL_MODE], [subproject])]) m4_define([_LTDL_TYPE], []) LT_OPTION_DEFINE([LTDL_INIT], [installable], [m4_define([_LTDL_TYPE], [installable])]) LT_OPTION_DEFINE([LTDL_INIT], [convenience], [m4_define([_LTDL_TYPE], [convenience])]) madp-0.4/m4/PaxHeaders.5405/ac_cplex.m40000644000000000000000000000007412717644140014323 xustar0030 atime=1463765191.437629622 30 ctime=1463765201.001553235 madp-0.4/m4/ac_cplex.m40000664000372100037210000001424712717644140015162 0ustar00fransfrans00000000000000dnl @synopsis AC_CPLEX([ACTION-IF-FOUND[, ACTION-IF-NOT-FOUND]]) dnl dnl This macro looks for a library that implements the CPLEX dnl optimization library (see http://www.ilog.com/products/cplex/). On dnl success, it sets the CPLEX_LIBS output variable to hold the requisite dnl library linkages. dnl dnl The user may use the following configuration options to setup dnl cplex: dnl --with-cplex-includes= dnl --with-cplex-libs= dnl --with-cplex-ldflags= dnl dnl ACTION-IF-FOUND is a list of shell commands to run if a CPLEX dnl library is found, and ACTION-IF-NOT-FOUND is a list of commands dnl to run it if it is not found. If ACTION-IF-FOUND is not specified, dnl the default action will define HAVE_CPLEX. dnl AC_DEFUN([AC_CPLEX], [ dnl default value: ac_cplex_ok=no dnl specify arguments: dnl --from lx_check_cplex.m4-- AC_ARG_WITH([cplex], dnl AS_HELP_STRING([--with-cplex@<:@=PREFIX@:>@], [search for CPLEX under PREFIX or under the default search paths if PREFIX is not given @<:@default@:>@]) AS_HELP_STRING([--without-cplex], [disable checking for CPLEX]), [], [with_cplex=yes]) dnl --NOT USED-- dnl AC_ARG_WITH([cplex-includedir], dnl AS_HELP_STRING([--with-cplex-includedir=DIR], [search for CPLEX headers in DIR]), dnl [], [with_cplex_includedir=no]) dnl dnl AC_ARG_WITH([cplex-libdir], dnl AS_HELP_STRING([--with-cplex-libdir=DIR], [search for CPLEX libraries in DIR]), dnl [], [with_cplex_libdir=no]) dnl --original arguments--- AC_ARG_WITH(cplex-includes, AS_HELP_STRING([--with-cplex-includes=], [include flags for CPLEX library headers. E.g., "-I$CPLEX_LOCATION/cplex/include/ -I$CPLEX_LOCATION/concert/include/" ]) ) AC_ARG_WITH(cplex-libs, AS_HELP_STRING([--with-cplex-libs=], [link with these CPLEX libraries, E.g., "-lilocplex -lconcert -lcplex" ]) ) AC_ARG_WITH(cplex-ldflags, AS_HELP_STRING([--with-cplex-ldflags=], [link with these CPLEX flags. E.g., "-L$CPLEX_LOCATION/cplex/lib/x86-64_sles10_4.1/static_pic -L$CPLEX_LOCATION/concert/lib/x86-64_sles10_4.1/static_pic" ])) if test x"$with_cplex" != x"no"; then AC_MSG_CHECKING([for CPLEX]) dnl --- Note, doing something like the following would be convenient (i.e., specifying one dir and then testing for /include, /lib dnl but since we need cplex and concert, it will become a bit messy... Therefore just let the user specify INCLUDES, LIBS, and LD_FLAGS dnl if test x"$with_cplex_includedir" != x"no"; then dnl CPLEX_CFLAGS="-I$with_cplex_includedir" dnl elif test x"$with_cplex" != x"yes"; then dnl CPLEX_CFLAGS="-I$with_cplex/include" dnl elif test x"$CPLEX_INCLUDEDIR" != x; then dnl CPLEX_CFLAGS="-I$CPLEX_INCLUDEDIR" dnl fi dnl if test x"$with_cplex_libdir" != x"no"; then dnl CPLEX_LDFLAGS="-L$with_cplex_libdir" dnl elif test x"$with_cplex" != x"yes"; then dnl CPLEX_LDFLAGS="-L$with_cplex/lib" dnl elif test x"$CPLEX_LIBDIR" != x; then dnl CPLEX_LDFLAGS="-L$CPLEX_LIBDIR" dnl fi dnl dnl CPLEX_LIBS="-lcplex -lm -lpthread" dnl FAO: we use "-lilocplex -lconcert -lcplex" dnl --end parse new arguments-- dnl --INCLUDES-- case $with_cplex_includes in yes | "") ;; no) ac_cplex_ok=disable ;; *) CPLEX_INCLUDES="$with_cplex_includes" ;; esac dnl --location of LIBS --- case $with_cplex_libs in yes | "") ;; no) ac_cplex_ok=disable ;; *) CPLEX_LIBS="$with_cplex_libs" ;; esac dnl --LD_FLAGS-- dnl NOTE: need to include -lm -lpthread too case $with_cplex_ldflags in yes | "") ;; no) ac_cplex_ok=disable ;; *) CPLEX_LDFLAGS="-lm -lpthread $with_cplex_ldflags" ;; esac dnl# First, check CPLEX_LIBS environment variable dnl if test "x$CPLEX_LIBS" = x; then :; else dnl save_LIBS="$LIBS"; LIBS="$CPLEX_LIBS $LIBS" dnl AC_MSG_CHECKING([for $cplex in $CPLEX_LIBS]) dnl AC_TRY_LINK_FUNC($cplex, [ac_cplex_ok=yes], [CPLEX_LIBS=""]) dnl AC_MSG_RESULT($ac_cplex_ok) dnl LIBS="$save_LIBS" dnl if test ac_cplex_ok = no; then dnl CPLEX_INCLUDES="" dnl CPLEX_LIBS="" dnl CPLEX_LDFLAGS="" dnl fi dnl fi dnl later? dnl AC_SUBST(CPLEX_INCLUDES) dnl AC_SUBST(CPLEX_LIBS) dnl AC_SUBST(CPLEX_LDFLAGS) #---compile test program--- lx_save_cxxflags="$CXXFLAGS" lx_save_ldflags="$LDFLAGS" lx_save_libs="$LIBS" dnl CXXFLAGS="$CPLEX_CFLAGS" CXXFLAGS="$CXXFLAGS $CPLEX_INCLUDES" LDFLAGS="$CPLEX_LDFLAGS" LIBS="$CPLEX_LIBS" cplex_test_prog=' //C version: extern "C" { #include } //C++ version #include #define IL_STD //<- tell CPLEX to use STL #include //<- fao: this is what we use ILOSTLBEGIN int main(int argc, char** argv) { //C version: CPXENVptr env = NULL; //C++ version //fao: some stuff we use in our code IloEnv env2; IloModel lpModel (env2); return 0; }' AC_LANG_PUSH(C++) AC_LINK_IFELSE([AC_LANG_SOURCE([$cplex_test_prog])], [cplex_found=yes], [cplex_found=no]) AC_LANG_POP(C++) CXXFLAGS="$lx_save_cxxflags" LDFLAGS="$lx_save_ldflags" LIBS="$lx_save_libs" #---end compile test program--- # Finally, execute ACTION-IF-FOUND/ACTION-IF-NOT-FOUND: if test x"$cplex_found" = x"yes"; then #cplex is found... AC_DEFINE(HAVE_CPLEX,1,[Define if you have CPLEX library.]) AC_MSG_RESULT([yes]) else #cplex is not found. AC_MSG_RESULT([no]) AC_MSG_NOTICE([WARNING: CPLEX not found, will not be able to use certain functionality!]) fi fi dnl END if test x"$with_cplex" != x"no"; then AC_SUBST(CPLEX_INCLUDES) AC_SUBST(CPLEX_LIBS) AC_SUBST(CPLEX_LDFLAGS) AM_CONDITIONAL([HAVE_CPLEX], [test x"$lx_cplex_found" = x"yes"]) ])dnl ACX_CPLEX madp-0.4/m4/PaxHeaders.5405/ltversion.m40000644000000000000000000000013112717644303014565 xustar0029 mtime=1463765187.20966339 30 atime=1463765191.441629591 30 ctime=1463765201.005553204 madp-0.4/m4/ltversion.m40000644000372100037210000000126212717644303015421 0ustar00fransfrans00000000000000# ltversion.m4 -- version numbers -*- Autoconf -*- # # Copyright (C) 2004 Free Software Foundation, Inc. # Written by Scott James Remnant, 2004 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # @configure_input@ # serial 3337 ltversion.m4 # This file is part of GNU Libtool m4_define([LT_PACKAGE_VERSION], [2.4.2]) m4_define([LT_PACKAGE_REVISION], [1.3337]) AC_DEFUN([LTVERSION_VERSION], [macro_version='2.4.2' macro_revision='1.3337' _LT_DECL(, macro_version, 0, [Which release of libtool.m4 was used?]) _LT_DECL(, macro_revision, 0) ]) madp-0.4/m4/PaxHeaders.5405/ltsugar.m40000644000000000000000000000013112717644303014221 xustar0029 mtime=1463765187.16966371 30 atime=1463765191.441629591 30 ctime=1463765201.005553204 madp-0.4/m4/ltsugar.m40000644000372100037210000001042412717644303015055 0ustar00fransfrans00000000000000# ltsugar.m4 -- libtool m4 base layer. -*-Autoconf-*- # # Copyright (C) 2004, 2005, 2007, 2008 Free Software Foundation, Inc. # Written by Gary V. Vaughan, 2004 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # serial 6 ltsugar.m4 # This is to help aclocal find these macros, as it can't see m4_define. AC_DEFUN([LTSUGAR_VERSION], [m4_if([0.1])]) # lt_join(SEP, ARG1, [ARG2...]) # ----------------------------- # Produce ARG1SEPARG2...SEPARGn, omitting [] arguments and their # associated separator. # Needed until we can rely on m4_join from Autoconf 2.62, since all earlier # versions in m4sugar had bugs. m4_define([lt_join], [m4_if([$#], [1], [], [$#], [2], [[$2]], [m4_if([$2], [], [], [[$2]_])$0([$1], m4_shift(m4_shift($@)))])]) m4_define([_lt_join], [m4_if([$#$2], [2], [], [m4_if([$2], [], [], [[$1$2]])$0([$1], m4_shift(m4_shift($@)))])]) # lt_car(LIST) # lt_cdr(LIST) # ------------ # Manipulate m4 lists. # These macros are necessary as long as will still need to support # Autoconf-2.59 which quotes differently. m4_define([lt_car], [[$1]]) m4_define([lt_cdr], [m4_if([$#], 0, [m4_fatal([$0: cannot be called without arguments])], [$#], 1, [], [m4_dquote(m4_shift($@))])]) m4_define([lt_unquote], $1) # lt_append(MACRO-NAME, STRING, [SEPARATOR]) # ------------------------------------------ # Redefine MACRO-NAME to hold its former content plus `SEPARATOR'`STRING'. # Note that neither SEPARATOR nor STRING are expanded; they are appended # to MACRO-NAME as is (leaving the expansion for when MACRO-NAME is invoked). # No SEPARATOR is output if MACRO-NAME was previously undefined (different # than defined and empty). # # This macro is needed until we can rely on Autoconf 2.62, since earlier # versions of m4sugar mistakenly expanded SEPARATOR but not STRING. m4_define([lt_append], [m4_define([$1], m4_ifdef([$1], [m4_defn([$1])[$3]])[$2])]) # lt_combine(SEP, PREFIX-LIST, INFIX, SUFFIX1, [SUFFIX2...]) # ---------------------------------------------------------- # Produce a SEP delimited list of all paired combinations of elements of # PREFIX-LIST with SUFFIX1 through SUFFIXn. Each element of the list # has the form PREFIXmINFIXSUFFIXn. # Needed until we can rely on m4_combine added in Autoconf 2.62. m4_define([lt_combine], [m4_if(m4_eval([$# > 3]), [1], [m4_pushdef([_Lt_sep], [m4_define([_Lt_sep], m4_defn([lt_car]))])]]dnl [[m4_foreach([_Lt_prefix], [$2], [m4_foreach([_Lt_suffix], ]m4_dquote(m4_dquote(m4_shift(m4_shift(m4_shift($@)))))[, [_Lt_sep([$1])[]m4_defn([_Lt_prefix])[$3]m4_defn([_Lt_suffix])])])])]) # lt_if_append_uniq(MACRO-NAME, VARNAME, [SEPARATOR], [UNIQ], [NOT-UNIQ]) # ----------------------------------------------------------------------- # Iff MACRO-NAME does not yet contain VARNAME, then append it (delimited # by SEPARATOR if supplied) and expand UNIQ, else NOT-UNIQ. m4_define([lt_if_append_uniq], [m4_ifdef([$1], [m4_if(m4_index([$3]m4_defn([$1])[$3], [$3$2$3]), [-1], [lt_append([$1], [$2], [$3])$4], [$5])], [lt_append([$1], [$2], [$3])$4])]) # lt_dict_add(DICT, KEY, VALUE) # ----------------------------- m4_define([lt_dict_add], [m4_define([$1($2)], [$3])]) # lt_dict_add_subkey(DICT, KEY, SUBKEY, VALUE) # -------------------------------------------- m4_define([lt_dict_add_subkey], [m4_define([$1($2:$3)], [$4])]) # lt_dict_fetch(DICT, KEY, [SUBKEY]) # ---------------------------------- m4_define([lt_dict_fetch], [m4_ifval([$3], m4_ifdef([$1($2:$3)], [m4_defn([$1($2:$3)])]), m4_ifdef([$1($2)], [m4_defn([$1($2)])]))]) # lt_if_dict_fetch(DICT, KEY, [SUBKEY], VALUE, IF-TRUE, [IF-FALSE]) # ----------------------------------------------------------------- m4_define([lt_if_dict_fetch], [m4_if(lt_dict_fetch([$1], [$2], [$3]), [$4], [$5], [$6])]) # lt_dict_filter(DICT, [SUBKEY], VALUE, [SEPARATOR], KEY, [...]) # -------------------------------------------------------------- m4_define([lt_dict_filter], [m4_if([$5], [], [], [lt_join(m4_quote(m4_default([$4], [[, ]])), lt_unquote(m4_split(m4_normalize(m4_foreach(_Lt_key, lt_car([m4_shiftn(4, $@)]), [lt_if_dict_fetch([$1], _Lt_key, [$2], [$3], [_Lt_key ])])))))])[]dnl ]) madp-0.4/m4/PaxHeaders.5405/libtool.m40000644000000000000000000000013212717644303014205 xustar0030 mtime=1463765187.093664317 30 atime=1463765191.441629591 30 ctime=1463765201.001553235 madp-0.4/m4/libtool.m40000644000372100037210000106011112717644303015037 0ustar00fransfrans00000000000000# libtool.m4 - Configure libtool for the host system. -*-Autoconf-*- # # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, # 2006, 2007, 2008, 2009, 2010, 2011 Free Software # Foundation, Inc. # Written by Gordon Matzigkeit, 1996 # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. m4_define([_LT_COPYING], [dnl # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, # 2006, 2007, 2008, 2009, 2010, 2011 Free Software # Foundation, Inc. # Written by Gordon Matzigkeit, 1996 # # This file is part of GNU Libtool. # # GNU Libtool 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 2 of # the License, or (at your option) any later version. # # As a special exception to the GNU General Public License, # if you distribute this file as part of a program or library that # is built using GNU Libtool, you may include this file under the # same distribution terms that you use for the rest of that program. # # GNU Libtool 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 GNU Libtool; see the file COPYING. If not, a copy # can be downloaded from http://www.gnu.org/licenses/gpl.html, or # obtained by writing to the Free Software Foundation, Inc., # 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. ]) # serial 57 LT_INIT # LT_PREREQ(VERSION) # ------------------ # Complain and exit if this libtool version is less that VERSION. m4_defun([LT_PREREQ], [m4_if(m4_version_compare(m4_defn([LT_PACKAGE_VERSION]), [$1]), -1, [m4_default([$3], [m4_fatal([Libtool version $1 or higher is required], 63)])], [$2])]) # _LT_CHECK_BUILDDIR # ------------------ # Complain if the absolute build directory name contains unusual characters m4_defun([_LT_CHECK_BUILDDIR], [case `pwd` in *\ * | *\ *) AC_MSG_WARN([Libtool does not cope well with whitespace in `pwd`]) ;; esac ]) # LT_INIT([OPTIONS]) # ------------------ AC_DEFUN([LT_INIT], [AC_PREREQ([2.58])dnl We use AC_INCLUDES_DEFAULT AC_REQUIRE([AC_CONFIG_AUX_DIR_DEFAULT])dnl AC_BEFORE([$0], [LT_LANG])dnl AC_BEFORE([$0], [LT_OUTPUT])dnl AC_BEFORE([$0], [LTDL_INIT])dnl m4_require([_LT_CHECK_BUILDDIR])dnl dnl Autoconf doesn't catch unexpanded LT_ macros by default: m4_pattern_forbid([^_?LT_[A-Z_]+$])dnl m4_pattern_allow([^(_LT_EOF|LT_DLGLOBAL|LT_DLLAZY_OR_NOW|LT_MULTI_MODULE)$])dnl dnl aclocal doesn't pull ltoptions.m4, ltsugar.m4, or ltversion.m4 dnl unless we require an AC_DEFUNed macro: AC_REQUIRE([LTOPTIONS_VERSION])dnl AC_REQUIRE([LTSUGAR_VERSION])dnl AC_REQUIRE([LTVERSION_VERSION])dnl AC_REQUIRE([LTOBSOLETE_VERSION])dnl m4_require([_LT_PROG_LTMAIN])dnl _LT_SHELL_INIT([SHELL=${CONFIG_SHELL-/bin/sh}]) dnl Parse OPTIONS _LT_SET_OPTIONS([$0], [$1]) # This can be used to rebuild libtool when needed LIBTOOL_DEPS="$ltmain" # Always use our own libtool. LIBTOOL='$(SHELL) $(top_builddir)/libtool' AC_SUBST(LIBTOOL)dnl _LT_SETUP # Only expand once: m4_define([LT_INIT]) ])# LT_INIT # Old names: AU_ALIAS([AC_PROG_LIBTOOL], [LT_INIT]) AU_ALIAS([AM_PROG_LIBTOOL], [LT_INIT]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_PROG_LIBTOOL], []) dnl AC_DEFUN([AM_PROG_LIBTOOL], []) # _LT_CC_BASENAME(CC) # ------------------- # Calculate cc_basename. Skip known compiler wrappers and cross-prefix. m4_defun([_LT_CC_BASENAME], [for cc_temp in $1""; do case $cc_temp in compile | *[[\\/]]compile | ccache | *[[\\/]]ccache ) ;; distcc | *[[\\/]]distcc | purify | *[[\\/]]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$ECHO "$cc_temp" | $SED "s%.*/%%; s%^$host_alias-%%"` ]) # _LT_FILEUTILS_DEFAULTS # ---------------------- # It is okay to use these file commands and assume they have been set # sensibly after `m4_require([_LT_FILEUTILS_DEFAULTS])'. m4_defun([_LT_FILEUTILS_DEFAULTS], [: ${CP="cp -f"} : ${MV="mv -f"} : ${RM="rm -f"} ])# _LT_FILEUTILS_DEFAULTS # _LT_SETUP # --------- m4_defun([_LT_SETUP], [AC_REQUIRE([AC_CANONICAL_HOST])dnl AC_REQUIRE([AC_CANONICAL_BUILD])dnl AC_REQUIRE([_LT_PREPARE_SED_QUOTE_VARS])dnl AC_REQUIRE([_LT_PROG_ECHO_BACKSLASH])dnl _LT_DECL([], [PATH_SEPARATOR], [1], [The PATH separator for the build system])dnl dnl _LT_DECL([], [host_alias], [0], [The host system])dnl _LT_DECL([], [host], [0])dnl _LT_DECL([], [host_os], [0])dnl dnl _LT_DECL([], [build_alias], [0], [The build system])dnl _LT_DECL([], [build], [0])dnl _LT_DECL([], [build_os], [0])dnl dnl AC_REQUIRE([AC_PROG_CC])dnl AC_REQUIRE([LT_PATH_LD])dnl AC_REQUIRE([LT_PATH_NM])dnl dnl AC_REQUIRE([AC_PROG_LN_S])dnl test -z "$LN_S" && LN_S="ln -s" _LT_DECL([], [LN_S], [1], [Whether we need soft or hard links])dnl dnl AC_REQUIRE([LT_CMD_MAX_LEN])dnl _LT_DECL([objext], [ac_objext], [0], [Object file suffix (normally "o")])dnl _LT_DECL([], [exeext], [0], [Executable file suffix (normally "")])dnl dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_CHECK_SHELL_FEATURES])dnl m4_require([_LT_PATH_CONVERSION_FUNCTIONS])dnl m4_require([_LT_CMD_RELOAD])dnl m4_require([_LT_CHECK_MAGIC_METHOD])dnl m4_require([_LT_CHECK_SHAREDLIB_FROM_LINKLIB])dnl m4_require([_LT_CMD_OLD_ARCHIVE])dnl m4_require([_LT_CMD_GLOBAL_SYMBOLS])dnl m4_require([_LT_WITH_SYSROOT])dnl _LT_CONFIG_LIBTOOL_INIT([ # See if we are running on zsh, and set the options which allow our # commands through without removal of \ escapes INIT. if test -n "\${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi ]) if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi _LT_CHECK_OBJDIR m4_require([_LT_TAG_COMPILER])dnl case $host_os in aix3*) # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test "X${COLLECT_NAMES+set}" != Xset; then COLLECT_NAMES= export COLLECT_NAMES fi ;; esac # Global variables: ofile=libtool can_build_shared=yes # All known linkers require a `.a' archive for static linking (except MSVC, # which needs '.lib'). libext=a with_gnu_ld="$lt_cv_prog_gnu_ld" old_CC="$CC" old_CFLAGS="$CFLAGS" # Set sane defaults for various variables test -z "$CC" && CC=cc test -z "$LTCC" && LTCC=$CC test -z "$LTCFLAGS" && LTCFLAGS=$CFLAGS test -z "$LD" && LD=ld test -z "$ac_objext" && ac_objext=o _LT_CC_BASENAME([$compiler]) # Only perform the check for file, if the check method requires it test -z "$MAGIC_CMD" && MAGIC_CMD=file case $deplibs_check_method in file_magic*) if test "$file_magic_cmd" = '$MAGIC_CMD'; then _LT_PATH_MAGIC fi ;; esac # Use C for the default configuration in the libtool script LT_SUPPORTED_TAG([CC]) _LT_LANG_C_CONFIG _LT_LANG_DEFAULT_CONFIG _LT_CONFIG_COMMANDS ])# _LT_SETUP # _LT_PREPARE_SED_QUOTE_VARS # -------------------------- # Define a few sed substitution that help us do robust quoting. m4_defun([_LT_PREPARE_SED_QUOTE_VARS], [# Backslashify metacharacters that are still active within # double-quoted strings. sed_quote_subst='s/\([["`$\\]]\)/\\\1/g' # Same as above, but do not quote variable references. double_quote_subst='s/\([["`\\]]\)/\\\1/g' # Sed substitution to delay expansion of an escaped shell variable in a # double_quote_subst'ed string. delay_variable_subst='s/\\\\\\\\\\\$/\\\\\\$/g' # Sed substitution to delay expansion of an escaped single quote. delay_single_quote_subst='s/'\''/'\'\\\\\\\'\''/g' # Sed substitution to avoid accidental globbing in evaled expressions no_glob_subst='s/\*/\\\*/g' ]) # _LT_PROG_LTMAIN # --------------- # Note that this code is called both from `configure', and `config.status' # now that we use AC_CONFIG_COMMANDS to generate libtool. Notably, # `config.status' has no value for ac_aux_dir unless we are using Automake, # so we pass a copy along to make sure it has a sensible value anyway. m4_defun([_LT_PROG_LTMAIN], [m4_ifdef([AC_REQUIRE_AUX_FILE], [AC_REQUIRE_AUX_FILE([ltmain.sh])])dnl _LT_CONFIG_LIBTOOL_INIT([ac_aux_dir='$ac_aux_dir']) ltmain="$ac_aux_dir/ltmain.sh" ])# _LT_PROG_LTMAIN ## ------------------------------------- ## ## Accumulate code for creating libtool. ## ## ------------------------------------- ## # So that we can recreate a full libtool script including additional # tags, we accumulate the chunks of code to send to AC_CONFIG_COMMANDS # in macros and then make a single call at the end using the `libtool' # label. # _LT_CONFIG_LIBTOOL_INIT([INIT-COMMANDS]) # ---------------------------------------- # Register INIT-COMMANDS to be passed to AC_CONFIG_COMMANDS later. m4_define([_LT_CONFIG_LIBTOOL_INIT], [m4_ifval([$1], [m4_append([_LT_OUTPUT_LIBTOOL_INIT], [$1 ])])]) # Initialize. m4_define([_LT_OUTPUT_LIBTOOL_INIT]) # _LT_CONFIG_LIBTOOL([COMMANDS]) # ------------------------------ # Register COMMANDS to be passed to AC_CONFIG_COMMANDS later. m4_define([_LT_CONFIG_LIBTOOL], [m4_ifval([$1], [m4_append([_LT_OUTPUT_LIBTOOL_COMMANDS], [$1 ])])]) # Initialize. m4_define([_LT_OUTPUT_LIBTOOL_COMMANDS]) # _LT_CONFIG_SAVE_COMMANDS([COMMANDS], [INIT_COMMANDS]) # ----------------------------------------------------- m4_defun([_LT_CONFIG_SAVE_COMMANDS], [_LT_CONFIG_LIBTOOL([$1]) _LT_CONFIG_LIBTOOL_INIT([$2]) ]) # _LT_FORMAT_COMMENT([COMMENT]) # ----------------------------- # Add leading comment marks to the start of each line, and a trailing # full-stop to the whole comment if one is not present already. m4_define([_LT_FORMAT_COMMENT], [m4_ifval([$1], [ m4_bpatsubst([m4_bpatsubst([$1], [^ *], [# ])], [['`$\]], [\\\&])]m4_bmatch([$1], [[!?.]$], [], [.]) )]) ## ------------------------ ## ## FIXME: Eliminate VARNAME ## ## ------------------------ ## # _LT_DECL([CONFIGNAME], VARNAME, VALUE, [DESCRIPTION], [IS-TAGGED?]) # ------------------------------------------------------------------- # CONFIGNAME is the name given to the value in the libtool script. # VARNAME is the (base) name used in the configure script. # VALUE may be 0, 1 or 2 for a computed quote escaped value based on # VARNAME. Any other value will be used directly. m4_define([_LT_DECL], [lt_if_append_uniq([lt_decl_varnames], [$2], [, ], [lt_dict_add_subkey([lt_decl_dict], [$2], [libtool_name], [m4_ifval([$1], [$1], [$2])]) lt_dict_add_subkey([lt_decl_dict], [$2], [value], [$3]) m4_ifval([$4], [lt_dict_add_subkey([lt_decl_dict], [$2], [description], [$4])]) lt_dict_add_subkey([lt_decl_dict], [$2], [tagged?], [m4_ifval([$5], [yes], [no])])]) ]) # _LT_TAGDECL([CONFIGNAME], VARNAME, VALUE, [DESCRIPTION]) # -------------------------------------------------------- m4_define([_LT_TAGDECL], [_LT_DECL([$1], [$2], [$3], [$4], [yes])]) # lt_decl_tag_varnames([SEPARATOR], [VARNAME1...]) # ------------------------------------------------ m4_define([lt_decl_tag_varnames], [_lt_decl_filter([tagged?], [yes], $@)]) # _lt_decl_filter(SUBKEY, VALUE, [SEPARATOR], [VARNAME1..]) # --------------------------------------------------------- m4_define([_lt_decl_filter], [m4_case([$#], [0], [m4_fatal([$0: too few arguments: $#])], [1], [m4_fatal([$0: too few arguments: $#: $1])], [2], [lt_dict_filter([lt_decl_dict], [$1], [$2], [], lt_decl_varnames)], [3], [lt_dict_filter([lt_decl_dict], [$1], [$2], [$3], lt_decl_varnames)], [lt_dict_filter([lt_decl_dict], $@)])[]dnl ]) # lt_decl_quote_varnames([SEPARATOR], [VARNAME1...]) # -------------------------------------------------- m4_define([lt_decl_quote_varnames], [_lt_decl_filter([value], [1], $@)]) # lt_decl_dquote_varnames([SEPARATOR], [VARNAME1...]) # --------------------------------------------------- m4_define([lt_decl_dquote_varnames], [_lt_decl_filter([value], [2], $@)]) # lt_decl_varnames_tagged([SEPARATOR], [VARNAME1...]) # --------------------------------------------------- m4_define([lt_decl_varnames_tagged], [m4_assert([$# <= 2])dnl _$0(m4_quote(m4_default([$1], [[, ]])), m4_ifval([$2], [[$2]], [m4_dquote(lt_decl_tag_varnames)]), m4_split(m4_normalize(m4_quote(_LT_TAGS)), [ ]))]) m4_define([_lt_decl_varnames_tagged], [m4_ifval([$3], [lt_combine([$1], [$2], [_], $3)])]) # lt_decl_all_varnames([SEPARATOR], [VARNAME1...]) # ------------------------------------------------ m4_define([lt_decl_all_varnames], [_$0(m4_quote(m4_default([$1], [[, ]])), m4_if([$2], [], m4_quote(lt_decl_varnames), m4_quote(m4_shift($@))))[]dnl ]) m4_define([_lt_decl_all_varnames], [lt_join($@, lt_decl_varnames_tagged([$1], lt_decl_tag_varnames([[, ]], m4_shift($@))))dnl ]) # _LT_CONFIG_STATUS_DECLARE([VARNAME]) # ------------------------------------ # Quote a variable value, and forward it to `config.status' so that its # declaration there will have the same value as in `configure'. VARNAME # must have a single quote delimited value for this to work. m4_define([_LT_CONFIG_STATUS_DECLARE], [$1='`$ECHO "$][$1" | $SED "$delay_single_quote_subst"`']) # _LT_CONFIG_STATUS_DECLARATIONS # ------------------------------ # We delimit libtool config variables with single quotes, so when # we write them to config.status, we have to be sure to quote all # embedded single quotes properly. In configure, this macro expands # each variable declared with _LT_DECL (and _LT_TAGDECL) into: # # ='`$ECHO "$" | $SED "$delay_single_quote_subst"`' m4_defun([_LT_CONFIG_STATUS_DECLARATIONS], [m4_foreach([_lt_var], m4_quote(lt_decl_all_varnames), [m4_n([_LT_CONFIG_STATUS_DECLARE(_lt_var)])])]) # _LT_LIBTOOL_TAGS # ---------------- # Output comment and list of tags supported by the script m4_defun([_LT_LIBTOOL_TAGS], [_LT_FORMAT_COMMENT([The names of the tagged configurations supported by this script])dnl available_tags="_LT_TAGS"dnl ]) # _LT_LIBTOOL_DECLARE(VARNAME, [TAG]) # ----------------------------------- # Extract the dictionary values for VARNAME (optionally with TAG) and # expand to a commented shell variable setting: # # # Some comment about what VAR is for. # visible_name=$lt_internal_name m4_define([_LT_LIBTOOL_DECLARE], [_LT_FORMAT_COMMENT(m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [description])))[]dnl m4_pushdef([_libtool_name], m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [libtool_name])))[]dnl m4_case(m4_quote(lt_dict_fetch([lt_decl_dict], [$1], [value])), [0], [_libtool_name=[$]$1], [1], [_libtool_name=$lt_[]$1], [2], [_libtool_name=$lt_[]$1], [_libtool_name=lt_dict_fetch([lt_decl_dict], [$1], [value])])[]dnl m4_ifval([$2], [_$2])[]m4_popdef([_libtool_name])[]dnl ]) # _LT_LIBTOOL_CONFIG_VARS # ----------------------- # Produce commented declarations of non-tagged libtool config variables # suitable for insertion in the LIBTOOL CONFIG section of the `libtool' # script. Tagged libtool config variables (even for the LIBTOOL CONFIG # section) are produced by _LT_LIBTOOL_TAG_VARS. m4_defun([_LT_LIBTOOL_CONFIG_VARS], [m4_foreach([_lt_var], m4_quote(_lt_decl_filter([tagged?], [no], [], lt_decl_varnames)), [m4_n([_LT_LIBTOOL_DECLARE(_lt_var)])])]) # _LT_LIBTOOL_TAG_VARS(TAG) # ------------------------- m4_define([_LT_LIBTOOL_TAG_VARS], [m4_foreach([_lt_var], m4_quote(lt_decl_tag_varnames), [m4_n([_LT_LIBTOOL_DECLARE(_lt_var, [$1])])])]) # _LT_TAGVAR(VARNAME, [TAGNAME]) # ------------------------------ m4_define([_LT_TAGVAR], [m4_ifval([$2], [$1_$2], [$1])]) # _LT_CONFIG_COMMANDS # ------------------- # Send accumulated output to $CONFIG_STATUS. Thanks to the lists of # variables for single and double quote escaping we saved from calls # to _LT_DECL, we can put quote escaped variables declarations # into `config.status', and then the shell code to quote escape them in # for loops in `config.status'. Finally, any additional code accumulated # from calls to _LT_CONFIG_LIBTOOL_INIT is expanded. m4_defun([_LT_CONFIG_COMMANDS], [AC_PROVIDE_IFELSE([LT_OUTPUT], dnl If the libtool generation code has been placed in $CONFIG_LT, dnl instead of duplicating it all over again into config.status, dnl then we will have config.status run $CONFIG_LT later, so it dnl needs to know what name is stored there: [AC_CONFIG_COMMANDS([libtool], [$SHELL $CONFIG_LT || AS_EXIT(1)], [CONFIG_LT='$CONFIG_LT'])], dnl If the libtool generation code is destined for config.status, dnl expand the accumulated commands and init code now: [AC_CONFIG_COMMANDS([libtool], [_LT_OUTPUT_LIBTOOL_COMMANDS], [_LT_OUTPUT_LIBTOOL_COMMANDS_INIT])]) ])#_LT_CONFIG_COMMANDS # Initialize. m4_define([_LT_OUTPUT_LIBTOOL_COMMANDS_INIT], [ # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH sed_quote_subst='$sed_quote_subst' double_quote_subst='$double_quote_subst' delay_variable_subst='$delay_variable_subst' _LT_CONFIG_STATUS_DECLARATIONS LTCC='$LTCC' LTCFLAGS='$LTCFLAGS' compiler='$compiler_DEFAULT' # A function that is used when there is no print builtin or printf. func_fallback_echo () { eval 'cat <<_LTECHO_EOF \$[]1 _LTECHO_EOF' } # Quote evaled strings. for var in lt_decl_all_varnames([[ \ ]], lt_decl_quote_varnames); do case \`eval \\\\\$ECHO \\\\""\\\\\$\$var"\\\\"\` in *[[\\\\\\\`\\"\\\$]]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"\\\$\$var\\" | \\\$SED \\"\\\$sed_quote_subst\\"\\\`\\\\\\"" ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done # Double-quote double-evaled strings. for var in lt_decl_all_varnames([[ \ ]], lt_decl_dquote_varnames); do case \`eval \\\\\$ECHO \\\\""\\\\\$\$var"\\\\"\` in *[[\\\\\\\`\\"\\\$]]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"\\\$\$var\\" | \\\$SED -e \\"\\\$double_quote_subst\\" -e \\"\\\$sed_quote_subst\\" -e \\"\\\$delay_variable_subst\\"\\\`\\\\\\"" ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done _LT_OUTPUT_LIBTOOL_INIT ]) # _LT_GENERATED_FILE_INIT(FILE, [COMMENT]) # ------------------------------------ # Generate a child script FILE with all initialization necessary to # reuse the environment learned by the parent script, and make the # file executable. If COMMENT is supplied, it is inserted after the # `#!' sequence but before initialization text begins. After this # macro, additional text can be appended to FILE to form the body of # the child script. The macro ends with non-zero status if the # file could not be fully written (such as if the disk is full). m4_ifdef([AS_INIT_GENERATED], [m4_defun([_LT_GENERATED_FILE_INIT],[AS_INIT_GENERATED($@)])], [m4_defun([_LT_GENERATED_FILE_INIT], [m4_require([AS_PREPARE])]dnl [m4_pushdef([AS_MESSAGE_LOG_FD])]dnl [lt_write_fail=0 cat >$1 <<_ASEOF || lt_write_fail=1 #! $SHELL # Generated by $as_me. $2 SHELL=\${CONFIG_SHELL-$SHELL} export SHELL _ASEOF cat >>$1 <<\_ASEOF || lt_write_fail=1 AS_SHELL_SANITIZE _AS_PREPARE exec AS_MESSAGE_FD>&1 _ASEOF test $lt_write_fail = 0 && chmod +x $1[]dnl m4_popdef([AS_MESSAGE_LOG_FD])])])# _LT_GENERATED_FILE_INIT # LT_OUTPUT # --------- # This macro allows early generation of the libtool script (before # AC_OUTPUT is called), incase it is used in configure for compilation # tests. AC_DEFUN([LT_OUTPUT], [: ${CONFIG_LT=./config.lt} AC_MSG_NOTICE([creating $CONFIG_LT]) _LT_GENERATED_FILE_INIT(["$CONFIG_LT"], [# Run this file to recreate a libtool stub with the current configuration.]) cat >>"$CONFIG_LT" <<\_LTEOF lt_cl_silent=false exec AS_MESSAGE_LOG_FD>>config.log { echo AS_BOX([Running $as_me.]) } >&AS_MESSAGE_LOG_FD lt_cl_help="\ \`$as_me' creates a local libtool stub from the current configuration, for use in further configure time tests before the real libtool is generated. Usage: $[0] [[OPTIONS]] -h, --help print this help, then exit -V, --version print version number, then exit -q, --quiet do not print progress messages -d, --debug don't remove temporary files Report bugs to ." lt_cl_version="\ m4_ifset([AC_PACKAGE_NAME], [AC_PACKAGE_NAME ])config.lt[]dnl m4_ifset([AC_PACKAGE_VERSION], [ AC_PACKAGE_VERSION]) configured by $[0], generated by m4_PACKAGE_STRING. Copyright (C) 2011 Free Software Foundation, Inc. This config.lt script is free software; the Free Software Foundation gives unlimited permision to copy, distribute and modify it." while test $[#] != 0 do case $[1] in --version | --v* | -V ) echo "$lt_cl_version"; exit 0 ;; --help | --h* | -h ) echo "$lt_cl_help"; exit 0 ;; --debug | --d* | -d ) debug=: ;; --quiet | --q* | --silent | --s* | -q ) lt_cl_silent=: ;; -*) AC_MSG_ERROR([unrecognized option: $[1] Try \`$[0] --help' for more information.]) ;; *) AC_MSG_ERROR([unrecognized argument: $[1] Try \`$[0] --help' for more information.]) ;; esac shift done if $lt_cl_silent; then exec AS_MESSAGE_FD>/dev/null fi _LTEOF cat >>"$CONFIG_LT" <<_LTEOF _LT_OUTPUT_LIBTOOL_COMMANDS_INIT _LTEOF cat >>"$CONFIG_LT" <<\_LTEOF AC_MSG_NOTICE([creating $ofile]) _LT_OUTPUT_LIBTOOL_COMMANDS AS_EXIT(0) _LTEOF chmod +x "$CONFIG_LT" # configure is writing to config.log, but config.lt does its own redirection, # appending to config.log, which fails on DOS, as config.log is still kept # open by configure. Here we exec the FD to /dev/null, effectively closing # config.log, so it can be properly (re)opened and appended to by config.lt. lt_cl_success=: test "$silent" = yes && lt_config_lt_args="$lt_config_lt_args --quiet" exec AS_MESSAGE_LOG_FD>/dev/null $SHELL "$CONFIG_LT" $lt_config_lt_args || lt_cl_success=false exec AS_MESSAGE_LOG_FD>>config.log $lt_cl_success || AS_EXIT(1) ])# LT_OUTPUT # _LT_CONFIG(TAG) # --------------- # If TAG is the built-in tag, create an initial libtool script with a # default configuration from the untagged config vars. Otherwise add code # to config.status for appending the configuration named by TAG from the # matching tagged config vars. m4_defun([_LT_CONFIG], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl _LT_CONFIG_SAVE_COMMANDS([ m4_define([_LT_TAG], m4_if([$1], [], [C], [$1]))dnl m4_if(_LT_TAG, [C], [ # See if we are running on zsh, and set the options which allow our # commands through without removal of \ escapes. if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi cfgfile="${ofile}T" trap "$RM \"$cfgfile\"; exit 1" 1 2 15 $RM "$cfgfile" cat <<_LT_EOF >> "$cfgfile" #! $SHELL # `$ECHO "$ofile" | sed 's%^.*/%%'` - Provide generalized library-building support services. # Generated automatically by $as_me ($PACKAGE$TIMESTAMP) $VERSION # Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`: # NOTE: Changes made to this file will be lost: look at ltmain.sh. # _LT_COPYING _LT_LIBTOOL_TAGS # ### BEGIN LIBTOOL CONFIG _LT_LIBTOOL_CONFIG_VARS _LT_LIBTOOL_TAG_VARS # ### END LIBTOOL CONFIG _LT_EOF case $host_os in aix3*) cat <<\_LT_EOF >> "$cfgfile" # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test "X${COLLECT_NAMES+set}" != Xset; then COLLECT_NAMES= export COLLECT_NAMES fi _LT_EOF ;; esac _LT_PROG_LTMAIN # We use sed instead of cat because bash on DJGPP gets confused if # if finds mixed CR/LF and LF-only lines. Since sed operates in # text mode, it properly converts lines to CR/LF. This bash problem # is reportedly fixed, but why not run on old versions too? sed '$q' "$ltmain" >> "$cfgfile" \ || (rm -f "$cfgfile"; exit 1) _LT_PROG_REPLACE_SHELLFNS mv -f "$cfgfile" "$ofile" || (rm -f "$ofile" && cp "$cfgfile" "$ofile" && rm -f "$cfgfile") chmod +x "$ofile" ], [cat <<_LT_EOF >> "$ofile" dnl Unfortunately we have to use $1 here, since _LT_TAG is not expanded dnl in a comment (ie after a #). # ### BEGIN LIBTOOL TAG CONFIG: $1 _LT_LIBTOOL_TAG_VARS(_LT_TAG) # ### END LIBTOOL TAG CONFIG: $1 _LT_EOF ])dnl /m4_if ], [m4_if([$1], [], [ PACKAGE='$PACKAGE' VERSION='$VERSION' TIMESTAMP='$TIMESTAMP' RM='$RM' ofile='$ofile'], []) ])dnl /_LT_CONFIG_SAVE_COMMANDS ])# _LT_CONFIG # LT_SUPPORTED_TAG(TAG) # --------------------- # Trace this macro to discover what tags are supported by the libtool # --tag option, using: # autoconf --trace 'LT_SUPPORTED_TAG:$1' AC_DEFUN([LT_SUPPORTED_TAG], []) # C support is built-in for now m4_define([_LT_LANG_C_enabled], []) m4_define([_LT_TAGS], []) # LT_LANG(LANG) # ------------- # Enable libtool support for the given language if not already enabled. AC_DEFUN([LT_LANG], [AC_BEFORE([$0], [LT_OUTPUT])dnl m4_case([$1], [C], [_LT_LANG(C)], [C++], [_LT_LANG(CXX)], [Go], [_LT_LANG(GO)], [Java], [_LT_LANG(GCJ)], [Fortran 77], [_LT_LANG(F77)], [Fortran], [_LT_LANG(FC)], [Windows Resource], [_LT_LANG(RC)], [m4_ifdef([_LT_LANG_]$1[_CONFIG], [_LT_LANG($1)], [m4_fatal([$0: unsupported language: "$1"])])])dnl ])# LT_LANG # _LT_LANG(LANGNAME) # ------------------ m4_defun([_LT_LANG], [m4_ifdef([_LT_LANG_]$1[_enabled], [], [LT_SUPPORTED_TAG([$1])dnl m4_append([_LT_TAGS], [$1 ])dnl m4_define([_LT_LANG_]$1[_enabled], [])dnl _LT_LANG_$1_CONFIG($1)])dnl ])# _LT_LANG m4_ifndef([AC_PROG_GO], [ ############################################################ # NOTE: This macro has been submitted for inclusion into # # GNU Autoconf as AC_PROG_GO. When it is available in # # a released version of Autoconf we should remove this # # macro and use it instead. # ############################################################ m4_defun([AC_PROG_GO], [AC_LANG_PUSH(Go)dnl AC_ARG_VAR([GOC], [Go compiler command])dnl AC_ARG_VAR([GOFLAGS], [Go compiler flags])dnl _AC_ARG_VAR_LDFLAGS()dnl AC_CHECK_TOOL(GOC, gccgo) if test -z "$GOC"; then if test -n "$ac_tool_prefix"; then AC_CHECK_PROG(GOC, [${ac_tool_prefix}gccgo], [${ac_tool_prefix}gccgo]) fi fi if test -z "$GOC"; then AC_CHECK_PROG(GOC, gccgo, gccgo, false) fi ])#m4_defun ])#m4_ifndef # _LT_LANG_DEFAULT_CONFIG # ----------------------- m4_defun([_LT_LANG_DEFAULT_CONFIG], [AC_PROVIDE_IFELSE([AC_PROG_CXX], [LT_LANG(CXX)], [m4_define([AC_PROG_CXX], defn([AC_PROG_CXX])[LT_LANG(CXX)])]) AC_PROVIDE_IFELSE([AC_PROG_F77], [LT_LANG(F77)], [m4_define([AC_PROG_F77], defn([AC_PROG_F77])[LT_LANG(F77)])]) AC_PROVIDE_IFELSE([AC_PROG_FC], [LT_LANG(FC)], [m4_define([AC_PROG_FC], defn([AC_PROG_FC])[LT_LANG(FC)])]) dnl The call to [A][M_PROG_GCJ] is quoted like that to stop aclocal dnl pulling things in needlessly. AC_PROVIDE_IFELSE([AC_PROG_GCJ], [LT_LANG(GCJ)], [AC_PROVIDE_IFELSE([A][M_PROG_GCJ], [LT_LANG(GCJ)], [AC_PROVIDE_IFELSE([LT_PROG_GCJ], [LT_LANG(GCJ)], [m4_ifdef([AC_PROG_GCJ], [m4_define([AC_PROG_GCJ], defn([AC_PROG_GCJ])[LT_LANG(GCJ)])]) m4_ifdef([A][M_PROG_GCJ], [m4_define([A][M_PROG_GCJ], defn([A][M_PROG_GCJ])[LT_LANG(GCJ)])]) m4_ifdef([LT_PROG_GCJ], [m4_define([LT_PROG_GCJ], defn([LT_PROG_GCJ])[LT_LANG(GCJ)])])])])]) AC_PROVIDE_IFELSE([AC_PROG_GO], [LT_LANG(GO)], [m4_define([AC_PROG_GO], defn([AC_PROG_GO])[LT_LANG(GO)])]) AC_PROVIDE_IFELSE([LT_PROG_RC], [LT_LANG(RC)], [m4_define([LT_PROG_RC], defn([LT_PROG_RC])[LT_LANG(RC)])]) ])# _LT_LANG_DEFAULT_CONFIG # Obsolete macros: AU_DEFUN([AC_LIBTOOL_CXX], [LT_LANG(C++)]) AU_DEFUN([AC_LIBTOOL_F77], [LT_LANG(Fortran 77)]) AU_DEFUN([AC_LIBTOOL_FC], [LT_LANG(Fortran)]) AU_DEFUN([AC_LIBTOOL_GCJ], [LT_LANG(Java)]) AU_DEFUN([AC_LIBTOOL_RC], [LT_LANG(Windows Resource)]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_CXX], []) dnl AC_DEFUN([AC_LIBTOOL_F77], []) dnl AC_DEFUN([AC_LIBTOOL_FC], []) dnl AC_DEFUN([AC_LIBTOOL_GCJ], []) dnl AC_DEFUN([AC_LIBTOOL_RC], []) # _LT_TAG_COMPILER # ---------------- m4_defun([_LT_TAG_COMPILER], [AC_REQUIRE([AC_PROG_CC])dnl _LT_DECL([LTCC], [CC], [1], [A C compiler])dnl _LT_DECL([LTCFLAGS], [CFLAGS], [1], [LTCC compiler flags])dnl _LT_TAGDECL([CC], [compiler], [1], [A language specific compiler])dnl _LT_TAGDECL([with_gcc], [GCC], [0], [Is the compiler the GNU compiler?])dnl # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC ])# _LT_TAG_COMPILER # _LT_COMPILER_BOILERPLATE # ------------------------ # Check for compiler boilerplate output or warnings with # the simple compiler test code. m4_defun([_LT_COMPILER_BOILERPLATE], [m4_require([_LT_DECL_SED])dnl ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" >conftest.$ac_ext eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_compiler_boilerplate=`cat conftest.err` $RM conftest* ])# _LT_COMPILER_BOILERPLATE # _LT_LINKER_BOILERPLATE # ---------------------- # Check for linker boilerplate output or warnings with # the simple link test code. m4_defun([_LT_LINKER_BOILERPLATE], [m4_require([_LT_DECL_SED])dnl ac_outfile=conftest.$ac_objext echo "$lt_simple_link_test_code" >conftest.$ac_ext eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_linker_boilerplate=`cat conftest.err` $RM -r conftest* ])# _LT_LINKER_BOILERPLATE # _LT_REQUIRED_DARWIN_CHECKS # ------------------------- m4_defun_once([_LT_REQUIRED_DARWIN_CHECKS],[ case $host_os in rhapsody* | darwin*) AC_CHECK_TOOL([DSYMUTIL], [dsymutil], [:]) AC_CHECK_TOOL([NMEDIT], [nmedit], [:]) AC_CHECK_TOOL([LIPO], [lipo], [:]) AC_CHECK_TOOL([OTOOL], [otool], [:]) AC_CHECK_TOOL([OTOOL64], [otool64], [:]) _LT_DECL([], [DSYMUTIL], [1], [Tool to manipulate archived DWARF debug symbol files on Mac OS X]) _LT_DECL([], [NMEDIT], [1], [Tool to change global to local symbols on Mac OS X]) _LT_DECL([], [LIPO], [1], [Tool to manipulate fat objects and archives on Mac OS X]) _LT_DECL([], [OTOOL], [1], [ldd/readelf like tool for Mach-O binaries on Mac OS X]) _LT_DECL([], [OTOOL64], [1], [ldd/readelf like tool for 64 bit Mach-O binaries on Mac OS X 10.4]) AC_CACHE_CHECK([for -single_module linker flag],[lt_cv_apple_cc_single_mod], [lt_cv_apple_cc_single_mod=no if test -z "${LT_MULTI_MODULE}"; then # By default we will add the -single_module flag. You can override # by either setting the environment variable LT_MULTI_MODULE # non-empty at configure time, or by adding -multi_module to the # link flags. rm -rf libconftest.dylib* echo "int foo(void){return 1;}" > conftest.c echo "$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c" >&AS_MESSAGE_LOG_FD $LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c 2>conftest.err _lt_result=$? # If there is a non-empty error log, and "single_module" # appears in it, assume the flag caused a linker warning if test -s conftest.err && $GREP single_module conftest.err; then cat conftest.err >&AS_MESSAGE_LOG_FD # Otherwise, if the output was created with a 0 exit code from # the compiler, it worked. elif test -f libconftest.dylib && test $_lt_result -eq 0; then lt_cv_apple_cc_single_mod=yes else cat conftest.err >&AS_MESSAGE_LOG_FD fi rm -rf libconftest.dylib* rm -f conftest.* fi]) AC_CACHE_CHECK([for -exported_symbols_list linker flag], [lt_cv_ld_exported_symbols_list], [lt_cv_ld_exported_symbols_list=no save_LDFLAGS=$LDFLAGS echo "_main" > conftest.sym LDFLAGS="$LDFLAGS -Wl,-exported_symbols_list,conftest.sym" AC_LINK_IFELSE([AC_LANG_PROGRAM([],[])], [lt_cv_ld_exported_symbols_list=yes], [lt_cv_ld_exported_symbols_list=no]) LDFLAGS="$save_LDFLAGS" ]) AC_CACHE_CHECK([for -force_load linker flag],[lt_cv_ld_force_load], [lt_cv_ld_force_load=no cat > conftest.c << _LT_EOF int forced_loaded() { return 2;} _LT_EOF echo "$LTCC $LTCFLAGS -c -o conftest.o conftest.c" >&AS_MESSAGE_LOG_FD $LTCC $LTCFLAGS -c -o conftest.o conftest.c 2>&AS_MESSAGE_LOG_FD echo "$AR cru libconftest.a conftest.o" >&AS_MESSAGE_LOG_FD $AR cru libconftest.a conftest.o 2>&AS_MESSAGE_LOG_FD echo "$RANLIB libconftest.a" >&AS_MESSAGE_LOG_FD $RANLIB libconftest.a 2>&AS_MESSAGE_LOG_FD cat > conftest.c << _LT_EOF int main() { return 0;} _LT_EOF echo "$LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a" >&AS_MESSAGE_LOG_FD $LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a 2>conftest.err _lt_result=$? if test -s conftest.err && $GREP force_load conftest.err; then cat conftest.err >&AS_MESSAGE_LOG_FD elif test -f conftest && test $_lt_result -eq 0 && $GREP forced_load conftest >/dev/null 2>&1 ; then lt_cv_ld_force_load=yes else cat conftest.err >&AS_MESSAGE_LOG_FD fi rm -f conftest.err libconftest.a conftest conftest.c rm -rf conftest.dSYM ]) case $host_os in rhapsody* | darwin1.[[012]]) _lt_dar_allow_undefined='${wl}-undefined ${wl}suppress' ;; darwin1.*) _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;; darwin*) # darwin 5.x on # if running on 10.5 or later, the deployment target defaults # to the OS version, if on x86, and 10.4, the deployment # target defaults to 10.4. Don't you love it? case ${MACOSX_DEPLOYMENT_TARGET-10.0},$host in 10.0,*86*-darwin8*|10.0,*-darwin[[91]]*) _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;; 10.[[012]]*) _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;; 10.*) _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;; esac ;; esac if test "$lt_cv_apple_cc_single_mod" = "yes"; then _lt_dar_single_mod='$single_module' fi if test "$lt_cv_ld_exported_symbols_list" = "yes"; then _lt_dar_export_syms=' ${wl}-exported_symbols_list,$output_objdir/${libname}-symbols.expsym' else _lt_dar_export_syms='~$NMEDIT -s $output_objdir/${libname}-symbols.expsym ${lib}' fi if test "$DSYMUTIL" != ":" && test "$lt_cv_ld_force_load" = "no"; then _lt_dsymutil='~$DSYMUTIL $lib || :' else _lt_dsymutil= fi ;; esac ]) # _LT_DARWIN_LINKER_FEATURES([TAG]) # --------------------------------- # Checks for linker and compiler features on darwin m4_defun([_LT_DARWIN_LINKER_FEATURES], [ m4_require([_LT_REQUIRED_DARWIN_CHECKS]) _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_automatic, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported if test "$lt_cv_ld_force_load" = "yes"; then _LT_TAGVAR(whole_archive_flag_spec, $1)='`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience ${wl}-force_load,$conv\"; done; func_echo_all \"$new_convenience\"`' m4_case([$1], [F77], [_LT_TAGVAR(compiler_needs_object, $1)=yes], [FC], [_LT_TAGVAR(compiler_needs_object, $1)=yes]) else _LT_TAGVAR(whole_archive_flag_spec, $1)='' fi _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(allow_undefined_flag, $1)="$_lt_dar_allow_undefined" case $cc_basename in ifort*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test "$_lt_dar_can_shared" = "yes"; then output_verbose_link_cmd=func_echo_all _LT_TAGVAR(archive_cmds, $1)="\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod${_lt_dsymutil}" _LT_TAGVAR(module_cmds, $1)="\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dsymutil}" _LT_TAGVAR(archive_expsym_cmds, $1)="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring ${_lt_dar_single_mod}${_lt_dar_export_syms}${_lt_dsymutil}" _LT_TAGVAR(module_expsym_cmds, $1)="sed -e 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dar_export_syms}${_lt_dsymutil}" m4_if([$1], [CXX], [ if test "$lt_cv_apple_cc_single_mod" != "yes"; then _LT_TAGVAR(archive_cmds, $1)="\$CC -r -keep_private_externs -nostdlib -o \${lib}-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \${lib}-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring${_lt_dsymutil}" _LT_TAGVAR(archive_expsym_cmds, $1)="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -r -keep_private_externs -nostdlib -o \${lib}-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \${lib}-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring${_lt_dar_export_syms}${_lt_dsymutil}" fi ],[]) else _LT_TAGVAR(ld_shlibs, $1)=no fi ]) # _LT_SYS_MODULE_PATH_AIX([TAGNAME]) # ---------------------------------- # Links a minimal program and checks the executable # for the system default hardcoded library path. In most cases, # this is /usr/lib:/lib, but when the MPI compilers are used # the location of the communication and MPI libs are included too. # If we don't find anything, use the default library path according # to the aix ld manual. # Store the results from the different compilers for each TAGNAME. # Allow to override them for all tags through lt_cv_aix_libpath. m4_defun([_LT_SYS_MODULE_PATH_AIX], [m4_require([_LT_DECL_SED])dnl if test "${lt_cv_aix_libpath+set}" = set; then aix_libpath=$lt_cv_aix_libpath else AC_CACHE_VAL([_LT_TAGVAR([lt_cv_aix_libpath_], [$1])], [AC_LINK_IFELSE([AC_LANG_PROGRAM],[ lt_aix_libpath_sed='[ /Import File Strings/,/^$/ { /^0/ { s/^0 *\([^ ]*\) *$/\1/ p } }]' _LT_TAGVAR([lt_cv_aix_libpath_], [$1])=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$_LT_TAGVAR([lt_cv_aix_libpath_], [$1])"; then _LT_TAGVAR([lt_cv_aix_libpath_], [$1])=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi],[]) if test -z "$_LT_TAGVAR([lt_cv_aix_libpath_], [$1])"; then _LT_TAGVAR([lt_cv_aix_libpath_], [$1])="/usr/lib:/lib" fi ]) aix_libpath=$_LT_TAGVAR([lt_cv_aix_libpath_], [$1]) fi ])# _LT_SYS_MODULE_PATH_AIX # _LT_SHELL_INIT(ARG) # ------------------- m4_define([_LT_SHELL_INIT], [m4_divert_text([M4SH-INIT], [$1 ])])# _LT_SHELL_INIT # _LT_PROG_ECHO_BACKSLASH # ----------------------- # Find how we can fake an echo command that does not interpret backslash. # In particular, with Autoconf 2.60 or later we add some code to the start # of the generated configure script which will find a shell with a builtin # printf (which we can use as an echo command). m4_defun([_LT_PROG_ECHO_BACKSLASH], [ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO$ECHO AC_MSG_CHECKING([how to print strings]) # Test print first, because it will be a builtin if present. if test "X`( print -r -- -n ) 2>/dev/null`" = X-n && \ test "X`print -r -- $ECHO 2>/dev/null`" = "X$ECHO"; then ECHO='print -r --' elif test "X`printf %s $ECHO 2>/dev/null`" = "X$ECHO"; then ECHO='printf %s\n' else # Use this function as a fallback that always works. func_fallback_echo () { eval 'cat <<_LTECHO_EOF $[]1 _LTECHO_EOF' } ECHO='func_fallback_echo' fi # func_echo_all arg... # Invoke $ECHO with all args, space-separated. func_echo_all () { $ECHO "$*" } case "$ECHO" in printf*) AC_MSG_RESULT([printf]) ;; print*) AC_MSG_RESULT([print -r]) ;; *) AC_MSG_RESULT([cat]) ;; esac m4_ifdef([_AS_DETECT_SUGGESTED], [_AS_DETECT_SUGGESTED([ test -n "${ZSH_VERSION+set}${BASH_VERSION+set}" || ( ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO$ECHO PATH=/empty FPATH=/empty; export PATH FPATH test "X`printf %s $ECHO`" = "X$ECHO" \ || test "X`print -r -- $ECHO`" = "X$ECHO" )])]) _LT_DECL([], [SHELL], [1], [Shell to use when invoking shell scripts]) _LT_DECL([], [ECHO], [1], [An echo program that protects backslashes]) ])# _LT_PROG_ECHO_BACKSLASH # _LT_WITH_SYSROOT # ---------------- AC_DEFUN([_LT_WITH_SYSROOT], [AC_MSG_CHECKING([for sysroot]) AC_ARG_WITH([sysroot], [ --with-sysroot[=DIR] Search for dependent libraries within DIR (or the compiler's sysroot if not specified).], [], [with_sysroot=no]) dnl lt_sysroot will always be passed unquoted. We quote it here dnl in case the user passed a directory name. lt_sysroot= case ${with_sysroot} in #( yes) if test "$GCC" = yes; then lt_sysroot=`$CC --print-sysroot 2>/dev/null` fi ;; #( /*) lt_sysroot=`echo "$with_sysroot" | sed -e "$sed_quote_subst"` ;; #( no|'') ;; #( *) AC_MSG_RESULT([${with_sysroot}]) AC_MSG_ERROR([The sysroot must be an absolute path.]) ;; esac AC_MSG_RESULT([${lt_sysroot:-no}]) _LT_DECL([], [lt_sysroot], [0], [The root where to search for ]dnl [dependent libraries, and in which our libraries should be installed.])]) # _LT_ENABLE_LOCK # --------------- m4_defun([_LT_ENABLE_LOCK], [AC_ARG_ENABLE([libtool-lock], [AS_HELP_STRING([--disable-libtool-lock], [avoid locking (might break parallel builds)])]) test "x$enable_libtool_lock" != xno && enable_libtool_lock=yes # Some flags need to be propagated to the compiler or linker for good # libtool support. case $host in ia64-*-hpux*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then case `/usr/bin/file conftest.$ac_objext` in *ELF-32*) HPUX_IA64_MODE="32" ;; *ELF-64*) HPUX_IA64_MODE="64" ;; esac fi rm -rf conftest* ;; *-*-irix6*) # Find out which ABI we are using. echo '[#]line '$LINENO' "configure"' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then if test "$lt_cv_prog_gnu_ld" = yes; then case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -melf32bsmip" ;; *N32*) LD="${LD-ld} -melf32bmipn32" ;; *64-bit*) LD="${LD-ld} -melf64bmip" ;; esac else case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -32" ;; *N32*) LD="${LD-ld} -n32" ;; *64-bit*) LD="${LD-ld} -64" ;; esac fi fi rm -rf conftest* ;; x86_64-*kfreebsd*-gnu|x86_64-*linux*|powerpc*-*linux*| \ s390*-*linux*|s390*-*tpf*|sparc*-*linux*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then case `/usr/bin/file conftest.o` in *32-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_i386_fbsd" ;; x86_64-*linux*) case `/usr/bin/file conftest.o` in *x86-64*) LD="${LD-ld} -m elf32_x86_64" ;; *) LD="${LD-ld} -m elf_i386" ;; esac ;; powerpc64le-*) LD="${LD-ld} -m elf32lppclinux" ;; powerpc64-*) LD="${LD-ld} -m elf32ppclinux" ;; s390x-*linux*) LD="${LD-ld} -m elf_s390" ;; sparc64-*linux*) LD="${LD-ld} -m elf32_sparc" ;; esac ;; *64-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_x86_64_fbsd" ;; x86_64-*linux*) LD="${LD-ld} -m elf_x86_64" ;; powerpcle-*) LD="${LD-ld} -m elf64lppc" ;; powerpc-*) LD="${LD-ld} -m elf64ppc" ;; s390*-*linux*|s390*-*tpf*) LD="${LD-ld} -m elf64_s390" ;; sparc*-*linux*) LD="${LD-ld} -m elf64_sparc" ;; esac ;; esac fi rm -rf conftest* ;; *-*-sco3.2v5*) # On SCO OpenServer 5, we need -belf to get full-featured binaries. SAVE_CFLAGS="$CFLAGS" CFLAGS="$CFLAGS -belf" AC_CACHE_CHECK([whether the C compiler needs -belf], lt_cv_cc_needs_belf, [AC_LANG_PUSH(C) AC_LINK_IFELSE([AC_LANG_PROGRAM([[]],[[]])],[lt_cv_cc_needs_belf=yes],[lt_cv_cc_needs_belf=no]) AC_LANG_POP]) if test x"$lt_cv_cc_needs_belf" != x"yes"; then # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf CFLAGS="$SAVE_CFLAGS" fi ;; *-*solaris*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if AC_TRY_EVAL(ac_compile); then case `/usr/bin/file conftest.o` in *64-bit*) case $lt_cv_prog_gnu_ld in yes*) case $host in i?86-*-solaris*) LD="${LD-ld} -m elf_x86_64" ;; sparc*-*-solaris*) LD="${LD-ld} -m elf64_sparc" ;; esac # GNU ld 2.21 introduced _sol2 emulations. Use them if available. if ${LD-ld} -V | grep _sol2 >/dev/null 2>&1; then LD="${LD-ld}_sol2" fi ;; *) if ${LD-ld} -64 -r -o conftest2.o conftest.o >/dev/null 2>&1; then LD="${LD-ld} -64" fi ;; esac ;; esac fi rm -rf conftest* ;; esac need_locks="$enable_libtool_lock" ])# _LT_ENABLE_LOCK # _LT_PROG_AR # ----------- m4_defun([_LT_PROG_AR], [AC_CHECK_TOOLS(AR, [ar], false) : ${AR=ar} : ${AR_FLAGS=cru} _LT_DECL([], [AR], [1], [The archiver]) _LT_DECL([], [AR_FLAGS], [1], [Flags to create an archive]) AC_CACHE_CHECK([for archiver @FILE support], [lt_cv_ar_at_file], [lt_cv_ar_at_file=no AC_COMPILE_IFELSE([AC_LANG_PROGRAM], [echo conftest.$ac_objext > conftest.lst lt_ar_try='$AR $AR_FLAGS libconftest.a @conftest.lst >&AS_MESSAGE_LOG_FD' AC_TRY_EVAL([lt_ar_try]) if test "$ac_status" -eq 0; then # Ensure the archiver fails upon bogus file names. rm -f conftest.$ac_objext libconftest.a AC_TRY_EVAL([lt_ar_try]) if test "$ac_status" -ne 0; then lt_cv_ar_at_file=@ fi fi rm -f conftest.* libconftest.a ]) ]) if test "x$lt_cv_ar_at_file" = xno; then archiver_list_spec= else archiver_list_spec=$lt_cv_ar_at_file fi _LT_DECL([], [archiver_list_spec], [1], [How to feed a file listing to the archiver]) ])# _LT_PROG_AR # _LT_CMD_OLD_ARCHIVE # ------------------- m4_defun([_LT_CMD_OLD_ARCHIVE], [_LT_PROG_AR AC_CHECK_TOOL(STRIP, strip, :) test -z "$STRIP" && STRIP=: _LT_DECL([], [STRIP], [1], [A symbol stripping program]) AC_CHECK_TOOL(RANLIB, ranlib, :) test -z "$RANLIB" && RANLIB=: _LT_DECL([], [RANLIB], [1], [Commands used to install an old-style archive]) # Determine commands to create old-style static archives. old_archive_cmds='$AR $AR_FLAGS $oldlib$oldobjs' old_postinstall_cmds='chmod 644 $oldlib' old_postuninstall_cmds= if test -n "$RANLIB"; then case $host_os in openbsd*) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB -t \$tool_oldlib" ;; *) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB \$tool_oldlib" ;; esac old_archive_cmds="$old_archive_cmds~\$RANLIB \$tool_oldlib" fi case $host_os in darwin*) lock_old_archive_extraction=yes ;; *) lock_old_archive_extraction=no ;; esac _LT_DECL([], [old_postinstall_cmds], [2]) _LT_DECL([], [old_postuninstall_cmds], [2]) _LT_TAGDECL([], [old_archive_cmds], [2], [Commands used to build an old-style archive]) _LT_DECL([], [lock_old_archive_extraction], [0], [Whether to use a lock for old archive extraction]) ])# _LT_CMD_OLD_ARCHIVE # _LT_COMPILER_OPTION(MESSAGE, VARIABLE-NAME, FLAGS, # [OUTPUT-FILE], [ACTION-SUCCESS], [ACTION-FAILURE]) # ---------------------------------------------------------------- # Check whether the given compiler option works AC_DEFUN([_LT_COMPILER_OPTION], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_SED])dnl AC_CACHE_CHECK([$1], [$2], [$2=no m4_if([$4], , [ac_outfile=conftest.$ac_objext], [ac_outfile=$4]) echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="$3" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [[^ ]]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&AS_MESSAGE_LOG_FD) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&AS_MESSAGE_LOG_FD echo "$as_me:$LINENO: \$? = $ac_status" >&AS_MESSAGE_LOG_FD if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then $2=yes fi fi $RM conftest* ]) if test x"[$]$2" = xyes; then m4_if([$5], , :, [$5]) else m4_if([$6], , :, [$6]) fi ])# _LT_COMPILER_OPTION # Old name: AU_ALIAS([AC_LIBTOOL_COMPILER_OPTION], [_LT_COMPILER_OPTION]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_COMPILER_OPTION], []) # _LT_LINKER_OPTION(MESSAGE, VARIABLE-NAME, FLAGS, # [ACTION-SUCCESS], [ACTION-FAILURE]) # ---------------------------------------------------- # Check whether the given linker option works AC_DEFUN([_LT_LINKER_OPTION], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_SED])dnl AC_CACHE_CHECK([$1], [$2], [$2=no save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS $3" echo "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&AS_MESSAGE_LOG_FD $ECHO "$_lt_linker_boilerplate" | $SED '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then $2=yes fi else $2=yes fi fi $RM -r conftest* LDFLAGS="$save_LDFLAGS" ]) if test x"[$]$2" = xyes; then m4_if([$4], , :, [$4]) else m4_if([$5], , :, [$5]) fi ])# _LT_LINKER_OPTION # Old name: AU_ALIAS([AC_LIBTOOL_LINKER_OPTION], [_LT_LINKER_OPTION]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_LINKER_OPTION], []) # LT_CMD_MAX_LEN #--------------- AC_DEFUN([LT_CMD_MAX_LEN], [AC_REQUIRE([AC_CANONICAL_HOST])dnl # find the maximum length of command line arguments AC_MSG_CHECKING([the maximum length of command line arguments]) AC_CACHE_VAL([lt_cv_sys_max_cmd_len], [dnl i=0 teststring="ABCD" case $build_os in msdosdjgpp*) # On DJGPP, this test can blow up pretty badly due to problems in libc # (any single argument exceeding 2000 bytes causes a buffer overrun # during glob expansion). Even if it were fixed, the result of this # check would be larger than it should be. lt_cv_sys_max_cmd_len=12288; # 12K is about right ;; gnu*) # Under GNU Hurd, this test is not required because there is # no limit to the length of command line arguments. # Libtool will interpret -1 as no limit whatsoever lt_cv_sys_max_cmd_len=-1; ;; cygwin* | mingw* | cegcc*) # On Win9x/ME, this test blows up -- it succeeds, but takes # about 5 minutes as the teststring grows exponentially. # Worse, since 9x/ME are not pre-emptively multitasking, # you end up with a "frozen" computer, even though with patience # the test eventually succeeds (with a max line length of 256k). # Instead, let's just punt: use the minimum linelength reported by # all of the supported platforms: 8192 (on NT/2K/XP). lt_cv_sys_max_cmd_len=8192; ;; mint*) # On MiNT this can take a long time and run out of memory. lt_cv_sys_max_cmd_len=8192; ;; amigaos*) # On AmigaOS with pdksh, this test takes hours, literally. # So we just punt and use a minimum line length of 8192. lt_cv_sys_max_cmd_len=8192; ;; netbsd* | freebsd* | openbsd* | darwin* | dragonfly*) # This has been around since 386BSD, at least. Likely further. if test -x /sbin/sysctl; then lt_cv_sys_max_cmd_len=`/sbin/sysctl -n kern.argmax` elif test -x /usr/sbin/sysctl; then lt_cv_sys_max_cmd_len=`/usr/sbin/sysctl -n kern.argmax` else lt_cv_sys_max_cmd_len=65536 # usable default for all BSDs fi # And add a safety zone lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` ;; interix*) # We know the value 262144 and hardcode it with a safety zone (like BSD) lt_cv_sys_max_cmd_len=196608 ;; os2*) # The test takes a long time on OS/2. lt_cv_sys_max_cmd_len=8192 ;; osf*) # Dr. Hans Ekkehard Plesser reports seeing a kernel panic running configure # due to this test when exec_disable_arg_limit is 1 on Tru64. It is not # nice to cause kernel panics so lets avoid the loop below. # First set a reasonable default. lt_cv_sys_max_cmd_len=16384 # if test -x /sbin/sysconfig; then case `/sbin/sysconfig -q proc exec_disable_arg_limit` in *1*) lt_cv_sys_max_cmd_len=-1 ;; esac fi ;; sco3.2v5*) lt_cv_sys_max_cmd_len=102400 ;; sysv5* | sco5v6* | sysv4.2uw2*) kargmax=`grep ARG_MAX /etc/conf/cf.d/stune 2>/dev/null` if test -n "$kargmax"; then lt_cv_sys_max_cmd_len=`echo $kargmax | sed 's/.*[[ ]]//'` else lt_cv_sys_max_cmd_len=32768 fi ;; *) lt_cv_sys_max_cmd_len=`(getconf ARG_MAX) 2> /dev/null` if test -n "$lt_cv_sys_max_cmd_len" && \ test undefined != "$lt_cv_sys_max_cmd_len"; then lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` else # Make teststring a little bigger before we do anything with it. # a 1K string should be a reasonable start. for i in 1 2 3 4 5 6 7 8 ; do teststring=$teststring$teststring done SHELL=${SHELL-${CONFIG_SHELL-/bin/sh}} # If test is not a shell built-in, we'll probably end up computing a # maximum length that is only half of the actual maximum length, but # we can't tell. while { test "X"`env echo "$teststring$teststring" 2>/dev/null` \ = "X$teststring$teststring"; } >/dev/null 2>&1 && test $i != 17 # 1/2 MB should be enough do i=`expr $i + 1` teststring=$teststring$teststring done # Only check the string length outside the loop. lt_cv_sys_max_cmd_len=`expr "X$teststring" : ".*" 2>&1` teststring= # Add a significant safety factor because C++ compilers can tack on # massive amounts of additional arguments before passing them to the # linker. It appears as though 1/2 is a usable value. lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 2` fi ;; esac ]) if test -n $lt_cv_sys_max_cmd_len ; then AC_MSG_RESULT($lt_cv_sys_max_cmd_len) else AC_MSG_RESULT(none) fi max_cmd_len=$lt_cv_sys_max_cmd_len _LT_DECL([], [max_cmd_len], [0], [What is the maximum length of a command?]) ])# LT_CMD_MAX_LEN # Old name: AU_ALIAS([AC_LIBTOOL_SYS_MAX_CMD_LEN], [LT_CMD_MAX_LEN]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_SYS_MAX_CMD_LEN], []) # _LT_HEADER_DLFCN # ---------------- m4_defun([_LT_HEADER_DLFCN], [AC_CHECK_HEADERS([dlfcn.h], [], [], [AC_INCLUDES_DEFAULT])dnl ])# _LT_HEADER_DLFCN # _LT_TRY_DLOPEN_SELF (ACTION-IF-TRUE, ACTION-IF-TRUE-W-USCORE, # ACTION-IF-FALSE, ACTION-IF-CROSS-COMPILING) # ---------------------------------------------------------------- m4_defun([_LT_TRY_DLOPEN_SELF], [m4_require([_LT_HEADER_DLFCN])dnl if test "$cross_compiling" = yes; then : [$4] else lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2 lt_status=$lt_dlunknown cat > conftest.$ac_ext <<_LT_EOF [#line $LINENO "configure" #include "confdefs.h" #if HAVE_DLFCN_H #include #endif #include #ifdef RTLD_GLOBAL # define LT_DLGLOBAL RTLD_GLOBAL #else # ifdef DL_GLOBAL # define LT_DLGLOBAL DL_GLOBAL # else # define LT_DLGLOBAL 0 # endif #endif /* We may have to define LT_DLLAZY_OR_NOW in the command line if we find out it does not work in some platform. */ #ifndef LT_DLLAZY_OR_NOW # ifdef RTLD_LAZY # define LT_DLLAZY_OR_NOW RTLD_LAZY # else # ifdef DL_LAZY # define LT_DLLAZY_OR_NOW DL_LAZY # else # ifdef RTLD_NOW # define LT_DLLAZY_OR_NOW RTLD_NOW # else # ifdef DL_NOW # define LT_DLLAZY_OR_NOW DL_NOW # else # define LT_DLLAZY_OR_NOW 0 # endif # endif # endif # endif #endif /* When -fvisbility=hidden is used, assume the code has been annotated correspondingly for the symbols needed. */ #if defined(__GNUC__) && (((__GNUC__ == 3) && (__GNUC_MINOR__ >= 3)) || (__GNUC__ > 3)) int fnord () __attribute__((visibility("default"))); #endif int fnord () { return 42; } int main () { void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW); int status = $lt_dlunknown; if (self) { if (dlsym (self,"fnord")) status = $lt_dlno_uscore; else { if (dlsym( self,"_fnord")) status = $lt_dlneed_uscore; else puts (dlerror ()); } /* dlclose (self); */ } else puts (dlerror ()); return status; }] _LT_EOF if AC_TRY_EVAL(ac_link) && test -s conftest${ac_exeext} 2>/dev/null; then (./conftest; exit; ) >&AS_MESSAGE_LOG_FD 2>/dev/null lt_status=$? case x$lt_status in x$lt_dlno_uscore) $1 ;; x$lt_dlneed_uscore) $2 ;; x$lt_dlunknown|x*) $3 ;; esac else : # compilation failed $3 fi fi rm -fr conftest* ])# _LT_TRY_DLOPEN_SELF # LT_SYS_DLOPEN_SELF # ------------------ AC_DEFUN([LT_SYS_DLOPEN_SELF], [m4_require([_LT_HEADER_DLFCN])dnl if test "x$enable_dlopen" != xyes; then enable_dlopen=unknown enable_dlopen_self=unknown enable_dlopen_self_static=unknown else lt_cv_dlopen=no lt_cv_dlopen_libs= case $host_os in beos*) lt_cv_dlopen="load_add_on" lt_cv_dlopen_libs= lt_cv_dlopen_self=yes ;; mingw* | pw32* | cegcc*) lt_cv_dlopen="LoadLibrary" lt_cv_dlopen_libs= ;; cygwin*) lt_cv_dlopen="dlopen" lt_cv_dlopen_libs= ;; darwin*) # if libdl is installed we need to link against it AC_CHECK_LIB([dl], [dlopen], [lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl"],[ lt_cv_dlopen="dyld" lt_cv_dlopen_libs= lt_cv_dlopen_self=yes ]) ;; *) AC_CHECK_FUNC([shl_load], [lt_cv_dlopen="shl_load"], [AC_CHECK_LIB([dld], [shl_load], [lt_cv_dlopen="shl_load" lt_cv_dlopen_libs="-ldld"], [AC_CHECK_FUNC([dlopen], [lt_cv_dlopen="dlopen"], [AC_CHECK_LIB([dl], [dlopen], [lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl"], [AC_CHECK_LIB([svld], [dlopen], [lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-lsvld"], [AC_CHECK_LIB([dld], [dld_link], [lt_cv_dlopen="dld_link" lt_cv_dlopen_libs="-ldld"]) ]) ]) ]) ]) ]) ;; esac if test "x$lt_cv_dlopen" != xno; then enable_dlopen=yes else enable_dlopen=no fi case $lt_cv_dlopen in dlopen) save_CPPFLAGS="$CPPFLAGS" test "x$ac_cv_header_dlfcn_h" = xyes && CPPFLAGS="$CPPFLAGS -DHAVE_DLFCN_H" save_LDFLAGS="$LDFLAGS" wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $export_dynamic_flag_spec\" save_LIBS="$LIBS" LIBS="$lt_cv_dlopen_libs $LIBS" AC_CACHE_CHECK([whether a program can dlopen itself], lt_cv_dlopen_self, [dnl _LT_TRY_DLOPEN_SELF( lt_cv_dlopen_self=yes, lt_cv_dlopen_self=yes, lt_cv_dlopen_self=no, lt_cv_dlopen_self=cross) ]) if test "x$lt_cv_dlopen_self" = xyes; then wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $lt_prog_compiler_static\" AC_CACHE_CHECK([whether a statically linked program can dlopen itself], lt_cv_dlopen_self_static, [dnl _LT_TRY_DLOPEN_SELF( lt_cv_dlopen_self_static=yes, lt_cv_dlopen_self_static=yes, lt_cv_dlopen_self_static=no, lt_cv_dlopen_self_static=cross) ]) fi CPPFLAGS="$save_CPPFLAGS" LDFLAGS="$save_LDFLAGS" LIBS="$save_LIBS" ;; esac case $lt_cv_dlopen_self in yes|no) enable_dlopen_self=$lt_cv_dlopen_self ;; *) enable_dlopen_self=unknown ;; esac case $lt_cv_dlopen_self_static in yes|no) enable_dlopen_self_static=$lt_cv_dlopen_self_static ;; *) enable_dlopen_self_static=unknown ;; esac fi _LT_DECL([dlopen_support], [enable_dlopen], [0], [Whether dlopen is supported]) _LT_DECL([dlopen_self], [enable_dlopen_self], [0], [Whether dlopen of programs is supported]) _LT_DECL([dlopen_self_static], [enable_dlopen_self_static], [0], [Whether dlopen of statically linked programs is supported]) ])# LT_SYS_DLOPEN_SELF # Old name: AU_ALIAS([AC_LIBTOOL_DLOPEN_SELF], [LT_SYS_DLOPEN_SELF]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_LIBTOOL_DLOPEN_SELF], []) # _LT_COMPILER_C_O([TAGNAME]) # --------------------------- # Check to see if options -c and -o are simultaneously supported by compiler. # This macro does not hard code the compiler like AC_PROG_CC_C_O. m4_defun([_LT_COMPILER_C_O], [m4_require([_LT_DECL_SED])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_TAG_COMPILER])dnl AC_CACHE_CHECK([if $compiler supports -c -o file.$ac_objext], [_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)], [_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [[^ ]]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&AS_MESSAGE_LOG_FD) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&AS_MESSAGE_LOG_FD echo "$as_me:$LINENO: \$? = $ac_status" >&AS_MESSAGE_LOG_FD if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then _LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=yes fi fi chmod u+w . 2>&AS_MESSAGE_LOG_FD $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* ]) _LT_TAGDECL([compiler_c_o], [lt_cv_prog_compiler_c_o], [1], [Does compiler simultaneously support -c and -o options?]) ])# _LT_COMPILER_C_O # _LT_COMPILER_FILE_LOCKS([TAGNAME]) # ---------------------------------- # Check to see if we can do hard links to lock some files if needed m4_defun([_LT_COMPILER_FILE_LOCKS], [m4_require([_LT_ENABLE_LOCK])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl _LT_COMPILER_C_O([$1]) hard_links="nottested" if test "$_LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)" = no && test "$need_locks" != no; then # do not overwrite the value of need_locks provided by the user AC_MSG_CHECKING([if we can lock with hard links]) hard_links=yes $RM conftest* ln conftest.a conftest.b 2>/dev/null && hard_links=no touch conftest.a ln conftest.a conftest.b 2>&5 || hard_links=no ln conftest.a conftest.b 2>/dev/null && hard_links=no AC_MSG_RESULT([$hard_links]) if test "$hard_links" = no; then AC_MSG_WARN([`$CC' does not support `-c -o', so `make -j' may be unsafe]) need_locks=warn fi else need_locks=no fi _LT_DECL([], [need_locks], [1], [Must we lock files when doing compilation?]) ])# _LT_COMPILER_FILE_LOCKS # _LT_CHECK_OBJDIR # ---------------- m4_defun([_LT_CHECK_OBJDIR], [AC_CACHE_CHECK([for objdir], [lt_cv_objdir], [rm -f .libs 2>/dev/null mkdir .libs 2>/dev/null if test -d .libs; then lt_cv_objdir=.libs else # MS-DOS does not allow filenames that begin with a dot. lt_cv_objdir=_libs fi rmdir .libs 2>/dev/null]) objdir=$lt_cv_objdir _LT_DECL([], [objdir], [0], [The name of the directory that contains temporary libtool files])dnl m4_pattern_allow([LT_OBJDIR])dnl AC_DEFINE_UNQUOTED(LT_OBJDIR, "$lt_cv_objdir/", [Define to the sub-directory in which libtool stores uninstalled libraries.]) ])# _LT_CHECK_OBJDIR # _LT_LINKER_HARDCODE_LIBPATH([TAGNAME]) # -------------------------------------- # Check hardcoding attributes. m4_defun([_LT_LINKER_HARDCODE_LIBPATH], [AC_MSG_CHECKING([how to hardcode library paths into programs]) _LT_TAGVAR(hardcode_action, $1)= if test -n "$_LT_TAGVAR(hardcode_libdir_flag_spec, $1)" || test -n "$_LT_TAGVAR(runpath_var, $1)" || test "X$_LT_TAGVAR(hardcode_automatic, $1)" = "Xyes" ; then # We can hardcode non-existent directories. if test "$_LT_TAGVAR(hardcode_direct, $1)" != no && # If the only mechanism to avoid hardcoding is shlibpath_var, we # have to relink, otherwise we might link with an installed library # when we should be linking with a yet-to-be-installed one ## test "$_LT_TAGVAR(hardcode_shlibpath_var, $1)" != no && test "$_LT_TAGVAR(hardcode_minus_L, $1)" != no; then # Linking always hardcodes the temporary library directory. _LT_TAGVAR(hardcode_action, $1)=relink else # We can link without hardcoding, and we can hardcode nonexisting dirs. _LT_TAGVAR(hardcode_action, $1)=immediate fi else # We cannot hardcode anything, or else we can only hardcode existing # directories. _LT_TAGVAR(hardcode_action, $1)=unsupported fi AC_MSG_RESULT([$_LT_TAGVAR(hardcode_action, $1)]) if test "$_LT_TAGVAR(hardcode_action, $1)" = relink || test "$_LT_TAGVAR(inherit_rpath, $1)" = yes; then # Fast installation is not supported enable_fast_install=no elif test "$shlibpath_overrides_runpath" = yes || test "$enable_shared" = no; then # Fast installation is not necessary enable_fast_install=needless fi _LT_TAGDECL([], [hardcode_action], [0], [How to hardcode a shared library path into an executable]) ])# _LT_LINKER_HARDCODE_LIBPATH # _LT_CMD_STRIPLIB # ---------------- m4_defun([_LT_CMD_STRIPLIB], [m4_require([_LT_DECL_EGREP]) striplib= old_striplib= AC_MSG_CHECKING([whether stripping libraries is possible]) if test -n "$STRIP" && $STRIP -V 2>&1 | $GREP "GNU strip" >/dev/null; then test -z "$old_striplib" && old_striplib="$STRIP --strip-debug" test -z "$striplib" && striplib="$STRIP --strip-unneeded" AC_MSG_RESULT([yes]) else # FIXME - insert some real tests, host_os isn't really good enough case $host_os in darwin*) if test -n "$STRIP" ; then striplib="$STRIP -x" old_striplib="$STRIP -S" AC_MSG_RESULT([yes]) else AC_MSG_RESULT([no]) fi ;; *) AC_MSG_RESULT([no]) ;; esac fi _LT_DECL([], [old_striplib], [1], [Commands to strip libraries]) _LT_DECL([], [striplib], [1]) ])# _LT_CMD_STRIPLIB # _LT_SYS_DYNAMIC_LINKER([TAG]) # ----------------------------- # PORTME Fill in your ld.so characteristics m4_defun([_LT_SYS_DYNAMIC_LINKER], [AC_REQUIRE([AC_CANONICAL_HOST])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_OBJDUMP])dnl m4_require([_LT_DECL_SED])dnl m4_require([_LT_CHECK_SHELL_FEATURES])dnl AC_MSG_CHECKING([dynamic linker characteristics]) m4_if([$1], [], [ if test "$GCC" = yes; then case $host_os in darwin*) lt_awk_arg="/^libraries:/,/LR/" ;; *) lt_awk_arg="/^libraries:/" ;; esac case $host_os in mingw* | cegcc*) lt_sed_strip_eq="s,=\([[A-Za-z]]:\),\1,g" ;; *) lt_sed_strip_eq="s,=/,/,g" ;; esac lt_search_path_spec=`$CC -print-search-dirs | awk $lt_awk_arg | $SED -e "s/^libraries://" -e $lt_sed_strip_eq` case $lt_search_path_spec in *\;*) # if the path contains ";" then we assume it to be the separator # otherwise default to the standard path separator (i.e. ":") - it is # assumed that no part of a normal pathname contains ";" but that should # okay in the real world where ";" in dirpaths is itself problematic. lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED 's/;/ /g'` ;; *) lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED "s/$PATH_SEPARATOR/ /g"` ;; esac # Ok, now we have the path, separated by spaces, we can step through it # and add multilib dir if necessary. lt_tmp_lt_search_path_spec= lt_multi_os_dir=`$CC $CPPFLAGS $CFLAGS $LDFLAGS -print-multi-os-directory 2>/dev/null` for lt_sys_path in $lt_search_path_spec; do if test -d "$lt_sys_path/$lt_multi_os_dir"; then lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path/$lt_multi_os_dir" else test -d "$lt_sys_path" && \ lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path" fi done lt_search_path_spec=`$ECHO "$lt_tmp_lt_search_path_spec" | awk ' BEGIN {RS=" "; FS="/|\n";} { lt_foo=""; lt_count=0; for (lt_i = NF; lt_i > 0; lt_i--) { if ($lt_i != "" && $lt_i != ".") { if ($lt_i == "..") { lt_count++; } else { if (lt_count == 0) { lt_foo="/" $lt_i lt_foo; } else { lt_count--; } } } } if (lt_foo != "") { lt_freq[[lt_foo]]++; } if (lt_freq[[lt_foo]] == 1) { print lt_foo; } }'` # AWK program above erroneously prepends '/' to C:/dos/paths # for these hosts. case $host_os in mingw* | cegcc*) lt_search_path_spec=`$ECHO "$lt_search_path_spec" |\ $SED 's,/\([[A-Za-z]]:\),\1,g'` ;; esac sys_lib_search_path_spec=`$ECHO "$lt_search_path_spec" | $lt_NL2SP` else sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib" fi]) library_names_spec= libname_spec='lib$name' soname_spec= shrext_cmds=".so" postinstall_cmds= postuninstall_cmds= finish_cmds= finish_eval= shlibpath_var= shlibpath_overrides_runpath=unknown version_type=none dynamic_linker="$host_os ld.so" sys_lib_dlsearch_path_spec="/lib /usr/lib" need_lib_prefix=unknown hardcode_into_libs=no # when you set need_version to no, make sure it does not cause -set_version # flags to be left without arguments need_version=unknown case $host_os in aix3*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a' shlibpath_var=LIBPATH # AIX 3 has no versioning support, so we append a major version to the name. soname_spec='${libname}${release}${shared_ext}$major' ;; aix[[4-9]]*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no hardcode_into_libs=yes if test "$host_cpu" = ia64; then # AIX 5 supports IA64 library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH else # With GCC up to 2.95.x, collect2 would create an import file # for dependence libraries. The import file would start with # the line `#! .'. This would cause the generated library to # depend on `.', always an invalid library. This was fixed in # development snapshots of GCC prior to 3.0. case $host_os in aix4 | aix4.[[01]] | aix4.[[01]].*) if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)' echo ' yes ' echo '#endif'; } | ${CC} -E - | $GREP yes > /dev/null; then : else can_build_shared=no fi ;; esac # AIX (on Power*) has no versioning support, so currently we can not hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test "$aix_use_runtimelinking" = yes; then # If using run time linking (on AIX 4.2 or later) use lib.so # instead of lib.a to let people know that these are not # typical AIX shared libraries. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' else # We preserve .a as extension for shared libraries through AIX4.2 # and later when we are not doing run time linking. library_names_spec='${libname}${release}.a $libname.a' soname_spec='${libname}${release}${shared_ext}$major' fi shlibpath_var=LIBPATH fi ;; amigaos*) case $host_cpu in powerpc) # Since July 2007 AmigaOS4 officially supports .so libraries. # When compiling the executable, add -use-dynld -Lsobjs: to the compileline. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' ;; m68k) library_names_spec='$libname.ixlibrary $libname.a' # Create ${libname}_ixlibrary.a entries in /sys/libs. finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`func_echo_all "$lib" | $SED '\''s%^.*/\([[^/]]*\)\.ixlibrary$%\1%'\''`; test $RM /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done' ;; esac ;; beos*) library_names_spec='${libname}${shared_ext}' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi[[45]]*) version_type=linux # correct to gnu/linux during the next big refactor need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib" sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib" # the default ld.so.conf also contains /usr/contrib/lib and # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow # libtool to hard-code these into programs ;; cygwin* | mingw* | pw32* | cegcc*) version_type=windows shrext_cmds=".dll" need_version=no need_lib_prefix=no case $GCC,$cc_basename in yes,*) # gcc library_names_spec='$libname.dll.a' # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \${file}`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname~ chmod a+x \$dldir/$dlname~ if test -n '\''$stripme'\'' && test -n '\''$striplib'\''; then eval '\''$striplib \$dldir/$dlname'\'' || exit \$?; fi' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes case $host_os in cygwin*) # Cygwin DLLs use 'cyg' prefix rather than 'lib' soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}' m4_if([$1], [],[ sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/lib/w32api"]) ;; mingw* | cegcc*) # MinGW DLLs use traditional 'lib' prefix soname_spec='${libname}`echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}' ;; pw32*) # pw32 DLLs use 'pw' prefix rather than 'lib' library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}' ;; esac dynamic_linker='Win32 ld.exe' ;; *,cl*) # Native MSVC libname_spec='$name' soname_spec='${libname}`echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext}' library_names_spec='${libname}.dll.lib' case $build_os in mingw*) sys_lib_search_path_spec= lt_save_ifs=$IFS IFS=';' for lt_path in $LIB do IFS=$lt_save_ifs # Let DOS variable expansion print the short 8.3 style file name. lt_path=`cd "$lt_path" 2>/dev/null && cmd //C "for %i in (".") do @echo %~si"` sys_lib_search_path_spec="$sys_lib_search_path_spec $lt_path" done IFS=$lt_save_ifs # Convert to MSYS style. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | sed -e 's|\\\\|/|g' -e 's| \\([[a-zA-Z]]\\):| /\\1|g' -e 's|^ ||'` ;; cygwin*) # Convert to unix form, then to dos form, then back to unix form # but this time dos style (no spaces!) so that the unix form looks # like /cygdrive/c/PROGRA~1:/cygdr... sys_lib_search_path_spec=`cygpath --path --unix "$LIB"` sys_lib_search_path_spec=`cygpath --path --dos "$sys_lib_search_path_spec" 2>/dev/null` sys_lib_search_path_spec=`cygpath --path --unix "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` ;; *) sys_lib_search_path_spec="$LIB" if $ECHO "$sys_lib_search_path_spec" | [$GREP ';[c-zC-Z]:/' >/dev/null]; then # It is most probably a Windows format PATH. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi # FIXME: find the short name or the path components, as spaces are # common. (e.g. "Program Files" -> "PROGRA~1") ;; esac # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \${file}`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes dynamic_linker='Win32 link.exe' ;; *) # Assume MSVC wrapper library_names_spec='${libname}`echo ${release} | $SED -e 's/[[.]]/-/g'`${versuffix}${shared_ext} $libname.lib' dynamic_linker='Win32 ld.exe' ;; esac # FIXME: first we should search . and the directory the executable is in shlibpath_var=PATH ;; darwin* | rhapsody*) dynamic_linker="$host_os dyld" version_type=darwin need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${major}$shared_ext ${libname}$shared_ext' soname_spec='${libname}${release}${major}$shared_ext' shlibpath_overrides_runpath=yes shlibpath_var=DYLD_LIBRARY_PATH shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`' m4_if([$1], [],[ sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/local/lib"]) sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; freebsd* | dragonfly*) # DragonFly does not have aout. When/if they implement a new # versioning mechanism, adjust this. if test -x /usr/bin/objformat; then objformat=`/usr/bin/objformat` else case $host_os in freebsd[[23]].*) objformat=aout ;; *) objformat=elf ;; esac fi version_type=freebsd-$objformat case $version_type in freebsd-elf*) library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' need_version=no need_lib_prefix=no ;; freebsd-*) library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix' need_version=yes ;; esac shlibpath_var=LD_LIBRARY_PATH case $host_os in freebsd2.*) shlibpath_overrides_runpath=yes ;; freebsd3.[[01]]* | freebsdelf3.[[01]]*) shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; freebsd3.[[2-9]]* | freebsdelf3.[[2-9]]* | \ freebsd4.[[0-5]] | freebsdelf4.[[0-5]] | freebsd4.1.1 | freebsdelf4.1.1) shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; *) # from 4.6 on, and DragonFly shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; esac ;; haiku*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no dynamic_linker="$host_os runtime_loader" library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LIBRARY_PATH shlibpath_overrides_runpath=yes sys_lib_dlsearch_path_spec='/boot/home/config/lib /boot/common/lib /boot/system/lib' hardcode_into_libs=yes ;; hpux9* | hpux10* | hpux11*) # Give a soname corresponding to the major version so that dld.sl refuses to # link against other versions. version_type=sunos need_lib_prefix=no need_version=no case $host_cpu in ia64*) shrext_cmds='.so' hardcode_into_libs=yes dynamic_linker="$host_os dld.so" shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' if test "X$HPUX_IA64_MODE" = X32; then sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib" else sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64" fi sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; hppa*64*) shrext_cmds='.sl' hardcode_into_libs=yes dynamic_linker="$host_os dld.sl" shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; *) shrext_cmds='.sl' dynamic_linker="$host_os dld.sl" shlibpath_var=SHLIB_PATH shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' ;; esac # HP-UX runs *really* slowly unless shared libraries are mode 555, ... postinstall_cmds='chmod 555 $lib' # or fails outright, so override atomically: install_override_mode=555 ;; interix[[3-9]]*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test "$lt_cv_prog_gnu_ld" = yes; then version_type=linux # correct to gnu/linux during the next big refactor else version_type=irix fi ;; esac need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}' case $host_os in irix5* | nonstopux*) libsuff= shlibsuff= ;; *) case $LD in # libtool.m4 will add one of these switches to LD *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ") libsuff= shlibsuff= libmagic=32-bit;; *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ") libsuff=32 shlibsuff=N32 libmagic=N32;; *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ") libsuff=64 shlibsuff=64 libmagic=64-bit;; *) libsuff= shlibsuff= libmagic=never-match;; esac ;; esac shlibpath_var=LD_LIBRARY${shlibsuff}_PATH shlibpath_overrides_runpath=no sys_lib_search_path_spec="/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}" sys_lib_dlsearch_path_spec="/usr/lib${libsuff} /lib${libsuff}" hardcode_into_libs=yes ;; # No shared lib support for Linux oldld, aout, or coff. linux*oldld* | linux*aout* | linux*coff*) dynamic_linker=no ;; # This must be glibc/ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # Some binutils ld are patched to set DT_RUNPATH AC_CACHE_VAL([lt_cv_shlibpath_overrides_runpath], [lt_cv_shlibpath_overrides_runpath=no save_LDFLAGS=$LDFLAGS save_libdir=$libdir eval "libdir=/foo; wl=\"$_LT_TAGVAR(lt_prog_compiler_wl, $1)\"; \ LDFLAGS=\"\$LDFLAGS $_LT_TAGVAR(hardcode_libdir_flag_spec, $1)\"" AC_LINK_IFELSE([AC_LANG_PROGRAM([],[])], [AS_IF([ ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep "RUNPATH.*$libdir" >/dev/null], [lt_cv_shlibpath_overrides_runpath=yes])]) LDFLAGS=$save_LDFLAGS libdir=$save_libdir ]) shlibpath_overrides_runpath=$lt_cv_shlibpath_overrides_runpath # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s 2>/dev/null", \[$]2)); skip = 1; } { if (!skip) print \[$]0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[ ]*hwcap[ ]/d;s/[:, ]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;s/"//g;/^$/d' | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra" fi # We used to test for /lib/ld.so.1 and disable shared libraries on # powerpc, because MkLinux only supported shared libraries with the # GNU dynamic linker. Since this was broken with cross compilers, # most powerpc-linux boxes support dynamic linking these days and # people can always --disable-shared, the test was removed, and we # assume the GNU/Linux dynamic linker is in use. dynamic_linker='GNU/Linux ld.so' ;; netbsdelf*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='NetBSD ld.elf_so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; *nto* | *qnx*) version_type=qnx need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='ldqnx.so' ;; openbsd*) version_type=sunos sys_lib_dlsearch_path_spec="/usr/lib" need_lib_prefix=no # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs. case $host_os in openbsd3.3 | openbsd3.3.*) need_version=yes ;; *) need_version=no ;; esac library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' shlibpath_var=LD_LIBRARY_PATH if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then case $host_os in openbsd2.[[89]] | openbsd2.[[89]].*) shlibpath_overrides_runpath=no ;; *) shlibpath_overrides_runpath=yes ;; esac else shlibpath_overrides_runpath=yes fi ;; os2*) libname_spec='$name' shrext_cmds=".dll" need_lib_prefix=no library_names_spec='$libname${shared_ext} $libname.a' dynamic_linker='OS/2 ld.exe' shlibpath_var=LIBPATH ;; osf3* | osf4* | osf5*) version_type=osf need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib" sys_lib_dlsearch_path_spec="$sys_lib_search_path_spec" ;; rdos*) dynamic_linker=no ;; solaris*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes # ldd complains unless libraries are executable postinstall_cmds='chmod +x $lib' ;; sunos4*) version_type=sunos library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes if test "$with_gnu_ld" = yes; then need_lib_prefix=no fi need_version=yes ;; sysv4 | sysv4.3*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH case $host_vendor in sni) shlibpath_overrides_runpath=no need_lib_prefix=no runpath_var=LD_RUN_PATH ;; siemens) need_lib_prefix=no ;; motorola) need_lib_prefix=no need_version=no shlibpath_overrides_runpath=no sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib' ;; esac ;; sysv4*MP*) if test -d /usr/nec ;then version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}' soname_spec='$libname${shared_ext}.$major' shlibpath_var=LD_LIBRARY_PATH fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) version_type=freebsd-elf need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes if test "$with_gnu_ld" = yes; then sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib' else sys_lib_search_path_spec='/usr/ccs/lib /usr/lib' case $host_os in sco3.2v5*) sys_lib_search_path_spec="$sys_lib_search_path_spec /lib" ;; esac fi sys_lib_dlsearch_path_spec='/usr/lib' ;; tpf*) # TPF is a cross-target only. Preferred cross-host = GNU/Linux. version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; uts4*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; *) dynamic_linker=no ;; esac AC_MSG_RESULT([$dynamic_linker]) test "$dynamic_linker" = no && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test "$GCC" = yes; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test "${lt_cv_sys_lib_search_path_spec+set}" = set; then sys_lib_search_path_spec="$lt_cv_sys_lib_search_path_spec" fi if test "${lt_cv_sys_lib_dlsearch_path_spec+set}" = set; then sys_lib_dlsearch_path_spec="$lt_cv_sys_lib_dlsearch_path_spec" fi _LT_DECL([], [variables_saved_for_relink], [1], [Variables whose values should be saved in libtool wrapper scripts and restored at link time]) _LT_DECL([], [need_lib_prefix], [0], [Do we need the "lib" prefix for modules?]) _LT_DECL([], [need_version], [0], [Do we need a version for libraries?]) _LT_DECL([], [version_type], [0], [Library versioning type]) _LT_DECL([], [runpath_var], [0], [Shared library runtime path variable]) _LT_DECL([], [shlibpath_var], [0],[Shared library path variable]) _LT_DECL([], [shlibpath_overrides_runpath], [0], [Is shlibpath searched before the hard-coded library search path?]) _LT_DECL([], [libname_spec], [1], [Format of library name prefix]) _LT_DECL([], [library_names_spec], [1], [[List of archive names. First name is the real one, the rest are links. The last name is the one that the linker finds with -lNAME]]) _LT_DECL([], [soname_spec], [1], [[The coded name of the library, if different from the real name]]) _LT_DECL([], [install_override_mode], [1], [Permission mode override for installation of shared libraries]) _LT_DECL([], [postinstall_cmds], [2], [Command to use after installation of a shared archive]) _LT_DECL([], [postuninstall_cmds], [2], [Command to use after uninstallation of a shared archive]) _LT_DECL([], [finish_cmds], [2], [Commands used to finish a libtool library installation in a directory]) _LT_DECL([], [finish_eval], [1], [[As "finish_cmds", except a single script fragment to be evaled but not shown]]) _LT_DECL([], [hardcode_into_libs], [0], [Whether we should hardcode library paths into libraries]) _LT_DECL([], [sys_lib_search_path_spec], [2], [Compile-time system search path for libraries]) _LT_DECL([], [sys_lib_dlsearch_path_spec], [2], [Run-time system search path for libraries]) ])# _LT_SYS_DYNAMIC_LINKER # _LT_PATH_TOOL_PREFIX(TOOL) # -------------------------- # find a file program which can recognize shared library AC_DEFUN([_LT_PATH_TOOL_PREFIX], [m4_require([_LT_DECL_EGREP])dnl AC_MSG_CHECKING([for $1]) AC_CACHE_VAL(lt_cv_path_MAGIC_CMD, [case $MAGIC_CMD in [[\\/*] | ?:[\\/]*]) lt_cv_path_MAGIC_CMD="$MAGIC_CMD" # Let the user override the test with a path. ;; *) lt_save_MAGIC_CMD="$MAGIC_CMD" lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR dnl $ac_dummy forces splitting on constant user-supplied paths. dnl POSIX.2 word splitting is done only on the output of word expansions, dnl not every word. This closes a longstanding sh security hole. ac_dummy="m4_if([$2], , $PATH, [$2])" for ac_dir in $ac_dummy; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$1; then lt_cv_path_MAGIC_CMD="$ac_dir/$1" if test -n "$file_magic_test_file"; then case $deplibs_check_method in "file_magic "*) file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"` MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null | $EGREP "$file_magic_regex" > /dev/null; then : else cat <<_LT_EOF 1>&2 *** Warning: the command libtool uses to detect shared libraries, *** $file_magic_cmd, produces output that libtool cannot recognize. *** The result is that libtool may fail to recognize shared libraries *** as such. This will affect the creation of libtool libraries that *** depend on shared libraries, but programs linked with such libtool *** libraries will work regardless of this problem. Nevertheless, you *** may want to report the problem to your system manager and/or to *** bug-libtool@gnu.org _LT_EOF fi ;; esac fi break fi done IFS="$lt_save_ifs" MAGIC_CMD="$lt_save_MAGIC_CMD" ;; esac]) MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if test -n "$MAGIC_CMD"; then AC_MSG_RESULT($MAGIC_CMD) else AC_MSG_RESULT(no) fi _LT_DECL([], [MAGIC_CMD], [0], [Used to examine libraries when file_magic_cmd begins with "file"])dnl ])# _LT_PATH_TOOL_PREFIX # Old name: AU_ALIAS([AC_PATH_TOOL_PREFIX], [_LT_PATH_TOOL_PREFIX]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_PATH_TOOL_PREFIX], []) # _LT_PATH_MAGIC # -------------- # find a file program which can recognize a shared library m4_defun([_LT_PATH_MAGIC], [_LT_PATH_TOOL_PREFIX(${ac_tool_prefix}file, /usr/bin$PATH_SEPARATOR$PATH) if test -z "$lt_cv_path_MAGIC_CMD"; then if test -n "$ac_tool_prefix"; then _LT_PATH_TOOL_PREFIX(file, /usr/bin$PATH_SEPARATOR$PATH) else MAGIC_CMD=: fi fi ])# _LT_PATH_MAGIC # LT_PATH_LD # ---------- # find the pathname to the GNU or non-GNU linker AC_DEFUN([LT_PATH_LD], [AC_REQUIRE([AC_PROG_CC])dnl AC_REQUIRE([AC_CANONICAL_HOST])dnl AC_REQUIRE([AC_CANONICAL_BUILD])dnl m4_require([_LT_DECL_SED])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_PROG_ECHO_BACKSLASH])dnl AC_ARG_WITH([gnu-ld], [AS_HELP_STRING([--with-gnu-ld], [assume the C compiler uses GNU ld @<:@default=no@:>@])], [test "$withval" = no || with_gnu_ld=yes], [with_gnu_ld=no])dnl ac_prog=ld if test "$GCC" = yes; then # Check if gcc -print-prog-name=ld gives a path. AC_MSG_CHECKING([for ld used by $CC]) case $host in *-*-mingw*) # gcc leaves a trailing carriage return which upsets mingw ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;; *) ac_prog=`($CC -print-prog-name=ld) 2>&5` ;; esac case $ac_prog in # Accept absolute paths. [[\\/]]* | ?:[[\\/]]*) re_direlt='/[[^/]][[^/]]*/\.\./' # Canonicalize the pathname of ld ac_prog=`$ECHO "$ac_prog"| $SED 's%\\\\%/%g'` while $ECHO "$ac_prog" | $GREP "$re_direlt" > /dev/null 2>&1; do ac_prog=`$ECHO $ac_prog| $SED "s%$re_direlt%/%"` done test -z "$LD" && LD="$ac_prog" ;; "") # If it fails, then pretend we aren't using GCC. ac_prog=ld ;; *) # If it is relative, then search for the first ld in PATH. with_gnu_ld=unknown ;; esac elif test "$with_gnu_ld" = yes; then AC_MSG_CHECKING([for GNU ld]) else AC_MSG_CHECKING([for non-GNU ld]) fi AC_CACHE_VAL(lt_cv_path_LD, [if test -z "$LD"; then lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then lt_cv_path_LD="$ac_dir/$ac_prog" # Check to see if the program is GNU ld. I'd rather use --version, # but apparently some variants of GNU ld only accept -v. # Break only if it was the GNU/non-GNU ld that we prefer. case `"$lt_cv_path_LD" -v 2>&1 &1 /dev/null 2>&1; then lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL' lt_cv_file_magic_cmd='func_win32_libid' else # Keep this pattern in sync with the one in func_win32_libid. lt_cv_deplibs_check_method='file_magic file format (pei*-i386(.*architecture: i386)?|pe-arm-wince|pe-x86-64)' lt_cv_file_magic_cmd='$OBJDUMP -f' fi ;; cegcc*) # use the weaker test based on 'objdump'. See mingw*. lt_cv_deplibs_check_method='file_magic file format pe-arm-.*little(.*architecture: arm)?' lt_cv_file_magic_cmd='$OBJDUMP -f' ;; darwin* | rhapsody*) lt_cv_deplibs_check_method=pass_all ;; freebsd* | dragonfly*) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then case $host_cpu in i*86 ) # Not sure whether the presence of OpenBSD here was a mistake. # Let's accept both of them until this is cleared up. lt_cv_deplibs_check_method='file_magic (FreeBSD|OpenBSD|DragonFly)/i[[3-9]]86 (compact )?demand paged shared library' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*` ;; esac else lt_cv_deplibs_check_method=pass_all fi ;; haiku*) lt_cv_deplibs_check_method=pass_all ;; hpux10.20* | hpux11*) lt_cv_file_magic_cmd=/usr/bin/file case $host_cpu in ia64*) lt_cv_deplibs_check_method='file_magic (s[[0-9]][[0-9]][[0-9]]|ELF-[[0-9]][[0-9]]) shared object file - IA64' lt_cv_file_magic_test_file=/usr/lib/hpux32/libc.so ;; hppa*64*) [lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF[ -][0-9][0-9])(-bit)?( [LM]SB)? shared object( file)?[, -]* PA-RISC [0-9]\.[0-9]'] lt_cv_file_magic_test_file=/usr/lib/pa20_64/libc.sl ;; *) lt_cv_deplibs_check_method='file_magic (s[[0-9]][[0-9]][[0-9]]|PA-RISC[[0-9]]\.[[0-9]]) shared library' lt_cv_file_magic_test_file=/usr/lib/libc.sl ;; esac ;; interix[[3-9]]*) # PIC code is broken on Interix 3.x, that's why |\.a not |_pic\.a here lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so|\.a)$' ;; irix5* | irix6* | nonstopux*) case $LD in *-32|*"-32 ") libmagic=32-bit;; *-n32|*"-n32 ") libmagic=N32;; *-64|*"-64 ") libmagic=64-bit;; *) libmagic=never-match;; esac lt_cv_deplibs_check_method=pass_all ;; # This must be glibc/ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) lt_cv_deplibs_check_method=pass_all ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so|_pic\.a)$' fi ;; newos6*) lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (executable|dynamic lib)' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=/usr/lib/libnls.so ;; *nto* | *qnx*) lt_cv_deplibs_check_method=pass_all ;; openbsd*) if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|\.so|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[[^/]]+(\.so\.[[0-9]]+\.[[0-9]]+|_pic\.a)$' fi ;; osf3* | osf4* | osf5*) lt_cv_deplibs_check_method=pass_all ;; rdos*) lt_cv_deplibs_check_method=pass_all ;; solaris*) lt_cv_deplibs_check_method=pass_all ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) lt_cv_deplibs_check_method=pass_all ;; sysv4 | sysv4.3*) case $host_vendor in motorola) lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[ML]]SB (shared object|dynamic lib) M[[0-9]][[0-9]]* Version [[0-9]]' lt_cv_file_magic_test_file=`echo /usr/lib/libc.so*` ;; ncr) lt_cv_deplibs_check_method=pass_all ;; sequent) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method='file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB (shared object|dynamic lib )' ;; sni) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method="file_magic ELF [[0-9]][[0-9]]*-bit [[LM]]SB dynamic lib" lt_cv_file_magic_test_file=/lib/libc.so ;; siemens) lt_cv_deplibs_check_method=pass_all ;; pc) lt_cv_deplibs_check_method=pass_all ;; esac ;; tpf*) lt_cv_deplibs_check_method=pass_all ;; esac ]) file_magic_glob= want_nocaseglob=no if test "$build" = "$host"; then case $host_os in mingw* | pw32*) if ( shopt | grep nocaseglob ) >/dev/null 2>&1; then want_nocaseglob=yes else file_magic_glob=`echo aAbBcCdDeEfFgGhHiIjJkKlLmMnNoOpPqQrRsStTuUvVwWxXyYzZ | $SED -e "s/\(..\)/s\/[[\1]]\/[[\1]]\/g;/g"` fi ;; esac fi file_magic_cmd=$lt_cv_file_magic_cmd deplibs_check_method=$lt_cv_deplibs_check_method test -z "$deplibs_check_method" && deplibs_check_method=unknown _LT_DECL([], [deplibs_check_method], [1], [Method to check whether dependent libraries are shared objects]) _LT_DECL([], [file_magic_cmd], [1], [Command to use when deplibs_check_method = "file_magic"]) _LT_DECL([], [file_magic_glob], [1], [How to find potential files when deplibs_check_method = "file_magic"]) _LT_DECL([], [want_nocaseglob], [1], [Find potential files using nocaseglob when deplibs_check_method = "file_magic"]) ])# _LT_CHECK_MAGIC_METHOD # LT_PATH_NM # ---------- # find the pathname to a BSD- or MS-compatible name lister AC_DEFUN([LT_PATH_NM], [AC_REQUIRE([AC_PROG_CC])dnl AC_CACHE_CHECK([for BSD- or MS-compatible name lister (nm)], lt_cv_path_NM, [if test -n "$NM"; then # Let the user override the test. lt_cv_path_NM="$NM" else lt_nm_to_check="${ac_tool_prefix}nm" if test -n "$ac_tool_prefix" && test "$build" = "$host"; then lt_nm_to_check="$lt_nm_to_check nm" fi for lt_tmp_nm in $lt_nm_to_check; do lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH /usr/ccs/bin/elf /usr/ccs/bin /usr/ucb /bin; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. tmp_nm="$ac_dir/$lt_tmp_nm" if test -f "$tmp_nm" || test -f "$tmp_nm$ac_exeext" ; then # Check to see if the nm accepts a BSD-compat flag. # Adding the `sed 1q' prevents false positives on HP-UX, which says: # nm: unknown option "B" ignored # Tru64's nm complains that /dev/null is an invalid object file case `"$tmp_nm" -B /dev/null 2>&1 | sed '1q'` in */dev/null* | *'Invalid file or object type'*) lt_cv_path_NM="$tmp_nm -B" break ;; *) case `"$tmp_nm" -p /dev/null 2>&1 | sed '1q'` in */dev/null*) lt_cv_path_NM="$tmp_nm -p" break ;; *) lt_cv_path_NM=${lt_cv_path_NM="$tmp_nm"} # keep the first match, but continue # so that we can try to find one that supports BSD flags ;; esac ;; esac fi done IFS="$lt_save_ifs" done : ${lt_cv_path_NM=no} fi]) if test "$lt_cv_path_NM" != "no"; then NM="$lt_cv_path_NM" else # Didn't find any BSD compatible name lister, look for dumpbin. if test -n "$DUMPBIN"; then : # Let the user override the test. else AC_CHECK_TOOLS(DUMPBIN, [dumpbin "link -dump"], :) case `$DUMPBIN -symbols /dev/null 2>&1 | sed '1q'` in *COFF*) DUMPBIN="$DUMPBIN -symbols" ;; *) DUMPBIN=: ;; esac fi AC_SUBST([DUMPBIN]) if test "$DUMPBIN" != ":"; then NM="$DUMPBIN" fi fi test -z "$NM" && NM=nm AC_SUBST([NM]) _LT_DECL([], [NM], [1], [A BSD- or MS-compatible name lister])dnl AC_CACHE_CHECK([the name lister ($NM) interface], [lt_cv_nm_interface], [lt_cv_nm_interface="BSD nm" echo "int some_variable = 0;" > conftest.$ac_ext (eval echo "\"\$as_me:$LINENO: $ac_compile\"" >&AS_MESSAGE_LOG_FD) (eval "$ac_compile" 2>conftest.err) cat conftest.err >&AS_MESSAGE_LOG_FD (eval echo "\"\$as_me:$LINENO: $NM \\\"conftest.$ac_objext\\\"\"" >&AS_MESSAGE_LOG_FD) (eval "$NM \"conftest.$ac_objext\"" 2>conftest.err > conftest.out) cat conftest.err >&AS_MESSAGE_LOG_FD (eval echo "\"\$as_me:$LINENO: output\"" >&AS_MESSAGE_LOG_FD) cat conftest.out >&AS_MESSAGE_LOG_FD if $GREP 'External.*some_variable' conftest.out > /dev/null; then lt_cv_nm_interface="MS dumpbin" fi rm -f conftest*]) ])# LT_PATH_NM # Old names: AU_ALIAS([AM_PROG_NM], [LT_PATH_NM]) AU_ALIAS([AC_PROG_NM], [LT_PATH_NM]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AM_PROG_NM], []) dnl AC_DEFUN([AC_PROG_NM], []) # _LT_CHECK_SHAREDLIB_FROM_LINKLIB # -------------------------------- # how to determine the name of the shared library # associated with a specific link library. # -- PORTME fill in with the dynamic library characteristics m4_defun([_LT_CHECK_SHAREDLIB_FROM_LINKLIB], [m4_require([_LT_DECL_EGREP]) m4_require([_LT_DECL_OBJDUMP]) m4_require([_LT_DECL_DLLTOOL]) AC_CACHE_CHECK([how to associate runtime and link libraries], lt_cv_sharedlib_from_linklib_cmd, [lt_cv_sharedlib_from_linklib_cmd='unknown' case $host_os in cygwin* | mingw* | pw32* | cegcc*) # two different shell functions defined in ltmain.sh # decide which to use based on capabilities of $DLLTOOL case `$DLLTOOL --help 2>&1` in *--identify-strict*) lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib ;; *) lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib_fallback ;; esac ;; *) # fallback: assume linklib IS sharedlib lt_cv_sharedlib_from_linklib_cmd="$ECHO" ;; esac ]) sharedlib_from_linklib_cmd=$lt_cv_sharedlib_from_linklib_cmd test -z "$sharedlib_from_linklib_cmd" && sharedlib_from_linklib_cmd=$ECHO _LT_DECL([], [sharedlib_from_linklib_cmd], [1], [Command to associate shared and link libraries]) ])# _LT_CHECK_SHAREDLIB_FROM_LINKLIB # _LT_PATH_MANIFEST_TOOL # ---------------------- # locate the manifest tool m4_defun([_LT_PATH_MANIFEST_TOOL], [AC_CHECK_TOOL(MANIFEST_TOOL, mt, :) test -z "$MANIFEST_TOOL" && MANIFEST_TOOL=mt AC_CACHE_CHECK([if $MANIFEST_TOOL is a manifest tool], [lt_cv_path_mainfest_tool], [lt_cv_path_mainfest_tool=no echo "$as_me:$LINENO: $MANIFEST_TOOL '-?'" >&AS_MESSAGE_LOG_FD $MANIFEST_TOOL '-?' 2>conftest.err > conftest.out cat conftest.err >&AS_MESSAGE_LOG_FD if $GREP 'Manifest Tool' conftest.out > /dev/null; then lt_cv_path_mainfest_tool=yes fi rm -f conftest*]) if test "x$lt_cv_path_mainfest_tool" != xyes; then MANIFEST_TOOL=: fi _LT_DECL([], [MANIFEST_TOOL], [1], [Manifest tool])dnl ])# _LT_PATH_MANIFEST_TOOL # LT_LIB_M # -------- # check for math library AC_DEFUN([LT_LIB_M], [AC_REQUIRE([AC_CANONICAL_HOST])dnl LIBM= case $host in *-*-beos* | *-*-cegcc* | *-*-cygwin* | *-*-haiku* | *-*-pw32* | *-*-darwin*) # These system don't have libm, or don't need it ;; *-ncr-sysv4.3*) AC_CHECK_LIB(mw, _mwvalidcheckl, LIBM="-lmw") AC_CHECK_LIB(m, cos, LIBM="$LIBM -lm") ;; *) AC_CHECK_LIB(m, cos, LIBM="-lm") ;; esac AC_SUBST([LIBM]) ])# LT_LIB_M # Old name: AU_ALIAS([AC_CHECK_LIBM], [LT_LIB_M]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([AC_CHECK_LIBM], []) # _LT_COMPILER_NO_RTTI([TAGNAME]) # ------------------------------- m4_defun([_LT_COMPILER_NO_RTTI], [m4_require([_LT_TAG_COMPILER])dnl _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)= if test "$GCC" = yes; then case $cc_basename in nvcc*) _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -Xcompiler -fno-builtin' ;; *) _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -fno-builtin' ;; esac _LT_COMPILER_OPTION([if $compiler supports -fno-rtti -fno-exceptions], lt_cv_prog_compiler_rtti_exceptions, [-fno-rtti -fno-exceptions], [], [_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)="$_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1) -fno-rtti -fno-exceptions"]) fi _LT_TAGDECL([no_builtin_flag], [lt_prog_compiler_no_builtin_flag], [1], [Compiler flag to turn off builtin functions]) ])# _LT_COMPILER_NO_RTTI # _LT_CMD_GLOBAL_SYMBOLS # ---------------------- m4_defun([_LT_CMD_GLOBAL_SYMBOLS], [AC_REQUIRE([AC_CANONICAL_HOST])dnl AC_REQUIRE([AC_PROG_CC])dnl AC_REQUIRE([AC_PROG_AWK])dnl AC_REQUIRE([LT_PATH_NM])dnl AC_REQUIRE([LT_PATH_LD])dnl m4_require([_LT_DECL_SED])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_TAG_COMPILER])dnl # Check for command to grab the raw symbol name followed by C symbol from nm. AC_MSG_CHECKING([command to parse $NM output from $compiler object]) AC_CACHE_VAL([lt_cv_sys_global_symbol_pipe], [ # These are sane defaults that work on at least a few old systems. # [They come from Ultrix. What could be older than Ultrix?!! ;)] # Character class describing NM global symbol codes. symcode='[[BCDEGRST]]' # Regexp to match symbols that can be accessed directly from C. sympat='\([[_A-Za-z]][[_A-Za-z0-9]]*\)' # Define system-specific variables. case $host_os in aix*) symcode='[[BCDT]]' ;; cygwin* | mingw* | pw32* | cegcc*) symcode='[[ABCDGISTW]]' ;; hpux*) if test "$host_cpu" = ia64; then symcode='[[ABCDEGRST]]' fi ;; irix* | nonstopux*) symcode='[[BCDEGRST]]' ;; osf*) symcode='[[BCDEGQRST]]' ;; solaris*) symcode='[[BDRT]]' ;; sco3.2v5*) symcode='[[DT]]' ;; sysv4.2uw2*) symcode='[[DT]]' ;; sysv5* | sco5v6* | unixware* | OpenUNIX*) symcode='[[ABDT]]' ;; sysv4) symcode='[[DFNSTU]]' ;; esac # If we're using GNU nm, then use its standard symbol codes. case `$NM -V 2>&1` in *GNU* | *'with BFD'*) symcode='[[ABCDGIRSTW]]' ;; esac # Transform an extracted symbol line into a proper C declaration. # Some systems (esp. on ia64) link data and code symbols differently, # so use this general approach. lt_cv_sys_global_symbol_to_cdecl="sed -n -e 's/^T .* \(.*\)$/extern int \1();/p' -e 's/^$symcode* .* \(.*\)$/extern char \1;/p'" # Transform an extracted symbol line into symbol name and symbol address lt_cv_sys_global_symbol_to_c_name_address="sed -n -e 's/^: \([[^ ]]*\)[[ ]]*$/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([[^ ]]*\) \([[^ ]]*\)$/ {\"\2\", (void *) \&\2},/p'" lt_cv_sys_global_symbol_to_c_name_address_lib_prefix="sed -n -e 's/^: \([[^ ]]*\)[[ ]]*$/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([[^ ]]*\) \(lib[[^ ]]*\)$/ {\"\2\", (void *) \&\2},/p' -e 's/^$symcode* \([[^ ]]*\) \([[^ ]]*\)$/ {\"lib\2\", (void *) \&\2},/p'" # Handle CRLF in mingw tool chain opt_cr= case $build_os in mingw*) opt_cr=`$ECHO 'x\{0,1\}' | tr x '\015'` # option cr in regexp ;; esac # Try without a prefix underscore, then with it. for ac_symprfx in "" "_"; do # Transform symcode, sympat, and symprfx into a raw symbol and a C symbol. symxfrm="\\1 $ac_symprfx\\2 \\2" # Write the raw and C identifiers. if test "$lt_cv_nm_interface" = "MS dumpbin"; then # Fake it for dumpbin and say T for any non-static function # and D for any global variable. # Also find C++ and __fastcall symbols from MSVC++, # which start with @ or ?. lt_cv_sys_global_symbol_pipe="$AWK ['"\ " {last_section=section; section=\$ 3};"\ " /^COFF SYMBOL TABLE/{for(i in hide) delete hide[i]};"\ " /Section length .*#relocs.*(pick any)/{hide[last_section]=1};"\ " \$ 0!~/External *\|/{next};"\ " / 0+ UNDEF /{next}; / UNDEF \([^|]\)*()/{next};"\ " {if(hide[section]) next};"\ " {f=0}; \$ 0~/\(\).*\|/{f=1}; {printf f ? \"T \" : \"D \"};"\ " {split(\$ 0, a, /\||\r/); split(a[2], s)};"\ " s[1]~/^[@?]/{print s[1], s[1]; next};"\ " s[1]~prfx {split(s[1],t,\"@\"); print t[1], substr(t[1],length(prfx))}"\ " ' prfx=^$ac_symprfx]" else lt_cv_sys_global_symbol_pipe="sed -n -e 's/^.*[[ ]]\($symcode$symcode*\)[[ ]][[ ]]*$ac_symprfx$sympat$opt_cr$/$symxfrm/p'" fi lt_cv_sys_global_symbol_pipe="$lt_cv_sys_global_symbol_pipe | sed '/ __gnu_lto/d'" # Check to see that the pipe works correctly. pipe_works=no rm -f conftest* cat > conftest.$ac_ext <<_LT_EOF #ifdef __cplusplus extern "C" { #endif char nm_test_var; void nm_test_func(void); void nm_test_func(void){} #ifdef __cplusplus } #endif int main(){nm_test_var='a';nm_test_func();return(0);} _LT_EOF if AC_TRY_EVAL(ac_compile); then # Now try to grab the symbols. nlist=conftest.nm if AC_TRY_EVAL(NM conftest.$ac_objext \| "$lt_cv_sys_global_symbol_pipe" \> $nlist) && test -s "$nlist"; then # Try sorting and uniquifying the output. if sort "$nlist" | uniq > "$nlist"T; then mv -f "$nlist"T "$nlist" else rm -f "$nlist"T fi # Make sure that we snagged all the symbols we need. if $GREP ' nm_test_var$' "$nlist" >/dev/null; then if $GREP ' nm_test_func$' "$nlist" >/dev/null; then cat <<_LT_EOF > conftest.$ac_ext /* Keep this code in sync between libtool.m4, ltmain, lt_system.h, and tests. */ #if defined(_WIN32) || defined(__CYGWIN__) || defined(_WIN32_WCE) /* DATA imports from DLLs on WIN32 con't be const, because runtime relocations are performed -- see ld's documentation on pseudo-relocs. */ # define LT@&t@_DLSYM_CONST #elif defined(__osf__) /* This system does not cope well with relocations in const data. */ # define LT@&t@_DLSYM_CONST #else # define LT@&t@_DLSYM_CONST const #endif #ifdef __cplusplus extern "C" { #endif _LT_EOF # Now generate the symbol file. eval "$lt_cv_sys_global_symbol_to_cdecl"' < "$nlist" | $GREP -v main >> conftest.$ac_ext' cat <<_LT_EOF >> conftest.$ac_ext /* The mapping between symbol names and symbols. */ LT@&t@_DLSYM_CONST struct { const char *name; void *address; } lt__PROGRAM__LTX_preloaded_symbols[[]] = { { "@PROGRAM@", (void *) 0 }, _LT_EOF $SED "s/^$symcode$symcode* \(.*\) \(.*\)$/ {\"\2\", (void *) \&\2},/" < "$nlist" | $GREP -v main >> conftest.$ac_ext cat <<\_LT_EOF >> conftest.$ac_ext {0, (void *) 0} }; /* This works around a problem in FreeBSD linker */ #ifdef FREEBSD_WORKAROUND static const void *lt_preloaded_setup() { return lt__PROGRAM__LTX_preloaded_symbols; } #endif #ifdef __cplusplus } #endif _LT_EOF # Now try linking the two files. mv conftest.$ac_objext conftstm.$ac_objext lt_globsym_save_LIBS=$LIBS lt_globsym_save_CFLAGS=$CFLAGS LIBS="conftstm.$ac_objext" CFLAGS="$CFLAGS$_LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)" if AC_TRY_EVAL(ac_link) && test -s conftest${ac_exeext}; then pipe_works=yes fi LIBS=$lt_globsym_save_LIBS CFLAGS=$lt_globsym_save_CFLAGS else echo "cannot find nm_test_func in $nlist" >&AS_MESSAGE_LOG_FD fi else echo "cannot find nm_test_var in $nlist" >&AS_MESSAGE_LOG_FD fi else echo "cannot run $lt_cv_sys_global_symbol_pipe" >&AS_MESSAGE_LOG_FD fi else echo "$progname: failed program was:" >&AS_MESSAGE_LOG_FD cat conftest.$ac_ext >&5 fi rm -rf conftest* conftst* # Do not use the global_symbol_pipe unless it works. if test "$pipe_works" = yes; then break else lt_cv_sys_global_symbol_pipe= fi done ]) if test -z "$lt_cv_sys_global_symbol_pipe"; then lt_cv_sys_global_symbol_to_cdecl= fi if test -z "$lt_cv_sys_global_symbol_pipe$lt_cv_sys_global_symbol_to_cdecl"; then AC_MSG_RESULT(failed) else AC_MSG_RESULT(ok) fi # Response file support. if test "$lt_cv_nm_interface" = "MS dumpbin"; then nm_file_list_spec='@' elif $NM --help 2>/dev/null | grep '[[@]]FILE' >/dev/null; then nm_file_list_spec='@' fi _LT_DECL([global_symbol_pipe], [lt_cv_sys_global_symbol_pipe], [1], [Take the output of nm and produce a listing of raw symbols and C names]) _LT_DECL([global_symbol_to_cdecl], [lt_cv_sys_global_symbol_to_cdecl], [1], [Transform the output of nm in a proper C declaration]) _LT_DECL([global_symbol_to_c_name_address], [lt_cv_sys_global_symbol_to_c_name_address], [1], [Transform the output of nm in a C name address pair]) _LT_DECL([global_symbol_to_c_name_address_lib_prefix], [lt_cv_sys_global_symbol_to_c_name_address_lib_prefix], [1], [Transform the output of nm in a C name address pair when lib prefix is needed]) _LT_DECL([], [nm_file_list_spec], [1], [Specify filename containing input files for $NM]) ]) # _LT_CMD_GLOBAL_SYMBOLS # _LT_COMPILER_PIC([TAGNAME]) # --------------------------- m4_defun([_LT_COMPILER_PIC], [m4_require([_LT_TAG_COMPILER])dnl _LT_TAGVAR(lt_prog_compiler_wl, $1)= _LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_static, $1)= m4_if([$1], [CXX], [ # C++ specific cases for pic, static, wl, etc. if test "$GXX" = yes; then _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the `-m68020' flag to GCC prevents building anything better, # like `-m68040'. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | os2* | pw32* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries m4_if([$1], [GCJ], [], [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT']) ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common' ;; *djgpp*) # DJGPP does not support shared libraries at all _LT_TAGVAR(lt_prog_compiler_pic, $1)= ;; haiku*) # PIC is the default for Haiku. # The "-static" flag exists, but is broken. _LT_TAGVAR(lt_prog_compiler_static, $1)= ;; interix[[3-9]]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; sysv4*MP*) if test -d /usr/nec; then _LT_TAGVAR(lt_prog_compiler_pic, $1)=-Kconform_pic fi ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac ;; *qnx* | *nto*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac else case $host_os in aix[[4-9]]*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' else _LT_TAGVAR(lt_prog_compiler_static, $1)='-bnso -bI:/lib/syscalls.exp' fi ;; chorus*) case $cc_basename in cxch68*) # Green Hills C++ Compiler # _LT_TAGVAR(lt_prog_compiler_static, $1)="--no_auto_instantiation -u __main -u __premain -u _abort -r $COOL_DIR/lib/libOrb.a $MVME_DIR/lib/CC/libC.a $MVME_DIR/lib/classix/libcx.s.a" ;; esac ;; mingw* | cygwin* | os2* | pw32* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). m4_if([$1], [GCJ], [], [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT']) ;; dgux*) case $cc_basename in ec++*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' ;; ghcx*) # Green Hills C++ Compiler _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' ;; *) ;; esac ;; freebsd* | dragonfly*) # FreeBSD uses GNU C++ ;; hpux9* | hpux10* | hpux11*) case $cc_basename in CC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='${wl}-a ${wl}archive' if test "$host_cpu" != ia64; then _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z' fi ;; aCC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='${wl}-a ${wl}archive' case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z' ;; esac ;; *) ;; esac ;; interix*) # This is c89, which is MS Visual C++ (no shared libs) # Anyone wants to do a port? ;; irix5* | irix6* | nonstopux*) case $cc_basename in CC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' # CC pic flag -KPIC is the default. ;; *) ;; esac ;; linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) case $cc_basename in KCC*) # KAI C++ Compiler _LT_TAGVAR(lt_prog_compiler_wl, $1)='--backend -Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; ecpc* ) # old Intel C++ for x86_64 which still supported -KPIC. _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; icpc* ) # Intel C++, used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; pgCC* | pgcpp*) # Portland Group C++ compiler _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; cxx*) # Compaq C++ # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. _LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; xlc* | xlC* | bgxl[[cC]]* | mpixl[[cC]]*) # IBM XL 8.0, 9.0 on PPC and BlueGene _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-qpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ' ;; esac ;; esac ;; lynxos*) ;; m88k*) ;; mvs*) case $cc_basename in cxx*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-W c,exportall' ;; *) ;; esac ;; netbsd* | netbsdelf*-gnu) ;; *qnx* | *nto*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; osf3* | osf4* | osf5*) case $cc_basename in KCC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='--backend -Wl,' ;; RCC*) # Rational C++ 2.4.1 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' ;; cxx*) # Digital/Compaq C++ _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. _LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; *) ;; esac ;; psos*) ;; solaris*) case $cc_basename in CC* | sunCC*) # Sun C++ 4.2, 5.x and Centerline C++ _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ' ;; gcx*) # Green Hills C++ Compiler _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC' ;; *) ;; esac ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; lcc*) # Lucid _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' ;; *) ;; esac ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) case $cc_basename in CC*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' ;; *) ;; esac ;; vxworks*) ;; *) _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no ;; esac fi ], [ if test "$GCC" = yes; then _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the `-m68020' flag to GCC prevents building anything better, # like `-m68040'. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries m4_if([$1], [GCJ], [], [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT']) ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fno-common' ;; haiku*) # PIC is the default for Haiku. # The "-static" flag exists, but is broken. _LT_TAGVAR(lt_prog_compiler_static, $1)= ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) # +Z the default ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac ;; interix[[3-9]]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; msdosdjgpp*) # Just because we use GCC doesn't mean we suddenly get shared libraries # on systems that don't support them. _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no enable_shared=no ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; sysv4*MP*) if test -d /usr/nec; then _LT_TAGVAR(lt_prog_compiler_pic, $1)=-Kconform_pic fi ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' ;; esac case $cc_basename in nvcc*) # Cuda Compiler Driver 2.2 _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Xlinker ' if test -n "$_LT_TAGVAR(lt_prog_compiler_pic, $1)"; then _LT_TAGVAR(lt_prog_compiler_pic, $1)="-Xcompiler $_LT_TAGVAR(lt_prog_compiler_pic, $1)" fi ;; esac else # PORTME Check for flag to pass linker flags through the system compiler. case $host_os in aix*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' else _LT_TAGVAR(lt_prog_compiler_static, $1)='-bnso -bI:/lib/syscalls.exp' fi ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). m4_if([$1], [GCJ], [], [_LT_TAGVAR(lt_prog_compiler_pic, $1)='-DDLL_EXPORT']) ;; hpux9* | hpux10* | hpux11*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but # not for PA HP-UX. case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)='+Z' ;; esac # Is there a better lt_prog_compiler_static that works with the bundled CC? _LT_TAGVAR(lt_prog_compiler_static, $1)='${wl}-a ${wl}archive' ;; irix5* | irix6* | nonstopux*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # PIC (with -KPIC) is the default. _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) case $cc_basename in # old Intel for x86_64 which still supported -KPIC. ecc*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; # icc used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. icc* | ifort*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; # Lahey Fortran 8.1. lf95*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='--shared' _LT_TAGVAR(lt_prog_compiler_static, $1)='--static' ;; nagfor*) # NAG Fortran compiler _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,-Wl,,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; pgcc* | pgf77* | pgf90* | pgf95* | pgfortran*) # Portland Group compilers (*not* the Pentium gcc compiler, # which looks to be a dead project) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; ccc*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # All Alpha code is PIC. _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; xl* | bgxl* | bgf* | mpixl*) # IBM XL C 8.0/Fortran 10.1, 11.1 on PPC and BlueGene _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-qpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ Ceres\ Fortran* | *Sun*Fortran*\ [[1-7]].* | *Sun*Fortran*\ 8.[[0-3]]*) # Sun Fortran 8.3 passes all unrecognized flags to the linker _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='' ;; *Sun\ F* | *Sun*Fortran*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ' ;; *Sun\ C*) # Sun C 5.9 _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' ;; *Intel*\ [[CF]]*Compiler*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-static' ;; *Portland\ Group*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fpic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; esac ;; esac ;; newsos6) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. _LT_TAGVAR(lt_prog_compiler_pic, $1)='-fPIC -shared' ;; osf3* | osf4* | osf5*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' # All OSF/1 code is PIC. _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; rdos*) _LT_TAGVAR(lt_prog_compiler_static, $1)='-non_shared' ;; solaris*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' case $cc_basename in f77* | f90* | f95* | sunf77* | sunf90* | sunf95*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ';; *) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,';; esac ;; sunos4*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Qoption ld ' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-PIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; sysv4 | sysv4.2uw2* | sysv4.3*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; sysv4*MP*) if test -d /usr/nec ;then _LT_TAGVAR(lt_prog_compiler_pic, $1)='-Kconform_pic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' fi ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_pic, $1)='-KPIC' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; unicos*) _LT_TAGVAR(lt_prog_compiler_wl, $1)='-Wl,' _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no ;; uts4*) _LT_TAGVAR(lt_prog_compiler_pic, $1)='-pic' _LT_TAGVAR(lt_prog_compiler_static, $1)='-Bstatic' ;; *) _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no ;; esac fi ]) case $host_os in # For platforms which do not support PIC, -DPIC is meaningless: *djgpp*) _LT_TAGVAR(lt_prog_compiler_pic, $1)= ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)="$_LT_TAGVAR(lt_prog_compiler_pic, $1)@&t@m4_if([$1],[],[ -DPIC],[m4_if([$1],[CXX],[ -DPIC],[])])" ;; esac AC_CACHE_CHECK([for $compiler option to produce PIC], [_LT_TAGVAR(lt_cv_prog_compiler_pic, $1)], [_LT_TAGVAR(lt_cv_prog_compiler_pic, $1)=$_LT_TAGVAR(lt_prog_compiler_pic, $1)]) _LT_TAGVAR(lt_prog_compiler_pic, $1)=$_LT_TAGVAR(lt_cv_prog_compiler_pic, $1) # # Check to make sure the PIC flag actually works. # if test -n "$_LT_TAGVAR(lt_prog_compiler_pic, $1)"; then _LT_COMPILER_OPTION([if $compiler PIC flag $_LT_TAGVAR(lt_prog_compiler_pic, $1) works], [_LT_TAGVAR(lt_cv_prog_compiler_pic_works, $1)], [$_LT_TAGVAR(lt_prog_compiler_pic, $1)@&t@m4_if([$1],[],[ -DPIC],[m4_if([$1],[CXX],[ -DPIC],[])])], [], [case $_LT_TAGVAR(lt_prog_compiler_pic, $1) in "" | " "*) ;; *) _LT_TAGVAR(lt_prog_compiler_pic, $1)=" $_LT_TAGVAR(lt_prog_compiler_pic, $1)" ;; esac], [_LT_TAGVAR(lt_prog_compiler_pic, $1)= _LT_TAGVAR(lt_prog_compiler_can_build_shared, $1)=no]) fi _LT_TAGDECL([pic_flag], [lt_prog_compiler_pic], [1], [Additional compiler flags for building library objects]) _LT_TAGDECL([wl], [lt_prog_compiler_wl], [1], [How to pass a linker flag through the compiler]) # # Check to make sure the static flag actually works. # wl=$_LT_TAGVAR(lt_prog_compiler_wl, $1) eval lt_tmp_static_flag=\"$_LT_TAGVAR(lt_prog_compiler_static, $1)\" _LT_LINKER_OPTION([if $compiler static flag $lt_tmp_static_flag works], _LT_TAGVAR(lt_cv_prog_compiler_static_works, $1), $lt_tmp_static_flag, [], [_LT_TAGVAR(lt_prog_compiler_static, $1)=]) _LT_TAGDECL([link_static_flag], [lt_prog_compiler_static], [1], [Compiler flag to prevent dynamic linking]) ])# _LT_COMPILER_PIC # _LT_LINKER_SHLIBS([TAGNAME]) # ---------------------------- # See if the linker supports building shared libraries. m4_defun([_LT_LINKER_SHLIBS], [AC_REQUIRE([LT_PATH_LD])dnl AC_REQUIRE([LT_PATH_NM])dnl m4_require([_LT_PATH_MANIFEST_TOOL])dnl m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_DECL_SED])dnl m4_require([_LT_CMD_GLOBAL_SYMBOLS])dnl m4_require([_LT_TAG_COMPILER])dnl AC_MSG_CHECKING([whether the $compiler linker ($LD) supports shared libraries]) m4_if([$1], [CXX], [ _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' _LT_TAGVAR(exclude_expsyms, $1)=['_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*'] case $host_os in aix[[4-9]]*) # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm # Also, AIX nm treats weak defined symbols like other global defined # symbols, whereas GNU nm marks them as "W". if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then _LT_TAGVAR(export_symbols_cmds, $1)='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B") || (\$ 2 == "W")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else _LT_TAGVAR(export_symbols_cmds, $1)='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi ;; pw32*) _LT_TAGVAR(export_symbols_cmds, $1)="$ltdll_cmds" ;; cygwin* | mingw* | cegcc*) case $cc_basename in cl*) _LT_TAGVAR(exclude_expsyms, $1)='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*' ;; *) _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\([[^ ]]*\)/\1 DATA/;s/^.*[[ ]]__nm__\([[^ ]]*\)[[ ]][[^ ]]*/\1 DATA/;/^I[[ ]]/d;/^[[AITW]][[ ]]/s/.* //'\'' | sort | uniq > $export_symbols' _LT_TAGVAR(exclude_expsyms, $1)=['[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname'] ;; esac ;; linux* | k*bsd*-gnu | gnu*) _LT_TAGVAR(link_all_deplibs, $1)=no ;; *) _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' ;; esac ], [ runpath_var= _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_cmds, $1)= _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(compiler_needs_object, $1)=no _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(old_archive_from_new_cmds, $1)= _LT_TAGVAR(old_archive_from_expsyms_cmds, $1)= _LT_TAGVAR(thread_safe_flag_spec, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= # include_expsyms should be a list of space-separated symbols to be *always* # included in the symbol list _LT_TAGVAR(include_expsyms, $1)= # exclude_expsyms can be an extended regexp of symbols to exclude # it will be wrapped by ` (' and `)$', so one must not match beginning or # end of line. Example: `a|bc|.*d.*' will exclude the symbols `a' and `bc', # as well as any symbol that contains `d'. _LT_TAGVAR(exclude_expsyms, $1)=['_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*'] # Although _GLOBAL_OFFSET_TABLE_ is a valid symbol C name, most a.out # platforms (ab)use it in PIC code, but their linkers get confused if # the symbol is explicitly referenced. Since portable code cannot # rely on this symbol name, it's probably fine to never include it in # preloaded symbol tables. # Exclude shared library initialization/finalization symbols. dnl Note also adjust exclude_expsyms for C++ above. extract_expsyms_cmds= case $host_os in cygwin* | mingw* | pw32* | cegcc*) # FIXME: the MSVC++ port hasn't been tested in a loooong time # When not using gcc, we currently assume that we are using # Microsoft Visual C++. if test "$GCC" != yes; then with_gnu_ld=no fi ;; interix*) # we just hope/assume this is gcc and not c89 (= MSVC++) with_gnu_ld=yes ;; openbsd*) with_gnu_ld=no ;; linux* | k*bsd*-gnu | gnu*) _LT_TAGVAR(link_all_deplibs, $1)=no ;; esac _LT_TAGVAR(ld_shlibs, $1)=yes # On some targets, GNU ld is compatible enough with the native linker # that we're better off using the native interface for both. lt_use_gnu_ld_interface=no if test "$with_gnu_ld" = yes; then case $host_os in aix*) # The AIX port of GNU ld has always aspired to compatibility # with the native linker. However, as the warning in the GNU ld # block says, versions before 2.19.5* couldn't really create working # shared libraries, regardless of the interface used. case `$LD -v 2>&1` in *\ \(GNU\ Binutils\)\ 2.19.5*) ;; *\ \(GNU\ Binutils\)\ 2.[[2-9]]*) ;; *\ \(GNU\ Binutils\)\ [[3-9]]*) ;; *) lt_use_gnu_ld_interface=yes ;; esac ;; *) lt_use_gnu_ld_interface=yes ;; esac fi if test "$lt_use_gnu_ld_interface" = yes; then # If archive_cmds runs LD, not CC, wlarc should be empty wlarc='${wl}' # Set some defaults for GNU ld with shared library support. These # are reset later if shared libraries are not supported. Putting them # here allows them to be overridden if necessary. runpath_var=LD_RUN_PATH _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' # ancient GNU ld didn't support --whole-archive et. al. if $LD --help 2>&1 | $GREP 'no-whole-archive' > /dev/null; then _LT_TAGVAR(whole_archive_flag_spec, $1)="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' else _LT_TAGVAR(whole_archive_flag_spec, $1)= fi supports_anon_versioning=no case `$LD -v 2>&1` in *GNU\ gold*) supports_anon_versioning=yes ;; *\ [[01]].* | *\ 2.[[0-9]].* | *\ 2.10.*) ;; # catch versions < 2.11 *\ 2.11.93.0.2\ *) supports_anon_versioning=yes ;; # RH7.3 ... *\ 2.11.92.0.12\ *) supports_anon_versioning=yes ;; # Mandrake 8.2 ... *\ 2.11.*) ;; # other 2.11 versions *) supports_anon_versioning=yes ;; esac # See if GNU ld supports shared libraries. case $host_os in aix[[3-9]]*) # On AIX/PPC, the GNU linker is very broken if test "$host_cpu" != ia64; then _LT_TAGVAR(ld_shlibs, $1)=no cat <<_LT_EOF 1>&2 *** Warning: the GNU linker, at least up to release 2.19, is reported *** to be unable to reliably create shared libraries on AIX. *** Therefore, libtool is disabling shared libraries support. If you *** really care for shared libraries, you may want to install binutils *** 2.20 or above, or modify your PATH so that a non-GNU linker is found. *** You will then need to restart the configuration process. _LT_EOF fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='' ;; m68k) _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_minus_L, $1)=yes ;; esac ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(allow_undefined_flag, $1)=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME _LT_TAGVAR(archive_cmds, $1)='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; cygwin* | mingw* | pw32* | cegcc*) # _LT_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless, # as there is no search path for DLLs. _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-all-symbols' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\([[^ ]]*\)/\1 DATA/;s/^.*[[ ]]__nm__\([[^ ]]*\)[[ ]][[^ ]]*/\1 DATA/;/^I[[ ]]/d;/^[[AITW]][[ ]]/s/.* //'\'' | sort | uniq > $export_symbols' _LT_TAGVAR(exclude_expsyms, $1)=['[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname'] if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file (1st line # is EXPORTS), use it as is; otherwise, prepend... _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared $output_objdir/$soname.def $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; haiku*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(link_all_deplibs, $1)=yes ;; interix[[3-9]]*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; gnu* | linux* | tpf* | k*bsd*-gnu | kopensolaris*-gnu) tmp_diet=no if test "$host_os" = linux-dietlibc; then case $cc_basename in diet\ *) tmp_diet=yes;; # linux-dietlibc with static linking (!diet-dyn) esac fi if $LD --help 2>&1 | $EGREP ': supported targets:.* elf' > /dev/null \ && test "$tmp_diet" = no then tmp_addflag=' $pic_flag' tmp_sharedflag='-shared' case $cc_basename,$host_cpu in pgcc*) # Portland Group C compiler _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag' ;; pgf77* | pgf90* | pgf95* | pgfortran*) # Portland Group f77 and f90 compilers _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag -Mnomain' ;; ecc*,ia64* | icc*,ia64*) # Intel C compiler on ia64 tmp_addflag=' -i_dynamic' ;; efc*,ia64* | ifort*,ia64*) # Intel Fortran compiler on ia64 tmp_addflag=' -i_dynamic -nofor_main' ;; ifc* | ifort*) # Intel Fortran compiler tmp_addflag=' -nofor_main' ;; lf95*) # Lahey Fortran 8.1 _LT_TAGVAR(whole_archive_flag_spec, $1)= tmp_sharedflag='--shared' ;; xl[[cC]]* | bgxl[[cC]]* | mpixl[[cC]]*) # IBM XL C 8.0 on PPC (deal with xlf below) tmp_sharedflag='-qmkshrobj' tmp_addflag= ;; nvcc*) # Cuda Compiler Driver 2.2 _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive' _LT_TAGVAR(compiler_needs_object, $1)=yes ;; esac case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C 5.9 _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive' _LT_TAGVAR(compiler_needs_object, $1)=yes tmp_sharedflag='-G' ;; *Sun\ F*) # Sun Fortran 8.3 tmp_sharedflag='-G' ;; esac _LT_TAGVAR(archive_cmds, $1)='$CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' if test "x$supports_anon_versioning" = xyes; then _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib' fi case $cc_basename in xlf* | bgf* | bgxlf* | mpixlf*) # IBM XL Fortran 10.1 on PPC cannot create shared libs itself _LT_TAGVAR(whole_archive_flag_spec, $1)='--whole-archive$convenience --no-whole-archive' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(archive_cmds, $1)='$LD -shared $libobjs $deplibs $linker_flags -soname $soname -o $lib' if test "x$supports_anon_versioning" = xyes; then _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $LD -shared $libobjs $deplibs $linker_flags -soname $soname -version-script $output_objdir/$libname.ver -o $lib' fi ;; esac else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib' wlarc= else _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' fi ;; solaris*) if $LD -v 2>&1 | $GREP 'BFD 2\.8' > /dev/null; then _LT_TAGVAR(ld_shlibs, $1)=no cat <<_LT_EOF 1>&2 *** Warning: The releases 2.8.* of the GNU linker cannot reliably *** create shared libraries on Solaris systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.9.1 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF elif $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX*) case `$LD -v 2>&1` in *\ [[01]].* | *\ 2.[[0-9]].* | *\ 2.1[[0-5]].*) _LT_TAGVAR(ld_shlibs, $1)=no cat <<_LT_EOF 1>&2 *** Warning: Releases of the GNU linker prior to 2.16.91.0.3 can not *** reliably create shared libraries on SCO systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.16.91.0.3 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF ;; *) # For security reasons, it is highly recommended that you always # use absolute paths for naming shared libraries, and exclude the # DT_RUNPATH tag from executables and libraries. But doing so # requires that you compile everything twice, which is a pain. if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; sunos4*) _LT_TAGVAR(archive_cmds, $1)='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags' wlarc= _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac if test "$_LT_TAGVAR(ld_shlibs, $1)" = no; then runpath_var= _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= fi else # PORTME fill in a description of your system's linker (not GNU ld) case $host_os in aix3*) _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=yes _LT_TAGVAR(archive_expsym_cmds, $1)='$LD -o $output_objdir/$soname $libobjs $deplibs $linker_flags -bE:$export_symbols -T512 -H512 -bM:SRE~$AR $AR_FLAGS $lib $output_objdir/$soname' # Note: this linker hardcodes the directories in LIBPATH if there # are no directories specified by -L. _LT_TAGVAR(hardcode_minus_L, $1)=yes if test "$GCC" = yes && test -z "$lt_prog_compiler_static"; then # Neither direct hardcoding nor static linking is supported with a # broken collect2. _LT_TAGVAR(hardcode_direct, $1)=unsupported fi ;; aix[[4-9]]*) if test "$host_cpu" = ia64; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag="" else # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm # Also, AIX nm treats weak defined symbols like other global # defined symbols, whereas GNU nm marks them as "W". if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then _LT_TAGVAR(export_symbols_cmds, $1)='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B") || (\$ 2 == "W")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else _LT_TAGVAR(export_symbols_cmds, $1)='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && ([substr](\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[[23]]|aix4.[[23]].*|aix[[5-9]]*) for ld_flag in $LDFLAGS; do if (test $ld_flag = "-brtl" || test $ld_flag = "-Wl,-brtl"); then aix_use_runtimelinking=yes break fi done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. _LT_TAGVAR(archive_cmds, $1)='' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(file_list_spec, $1)='${wl}-f,' if test "$GCC" = yes; then case $host_os in aix4.[[012]]|aix4.[[012]].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`${CC} -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 _LT_TAGVAR(hardcode_direct, $1)=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)= fi ;; esac shared_flag='-shared' if test "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi _LT_TAGVAR(link_all_deplibs, $1)=no else # not using gcc if test "$host_cpu" = ia64; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test "$aix_use_runtimelinking" = yes; then shared_flag='${wl}-G' else shared_flag='${wl}-bM:SRE' fi fi fi _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to export. _LT_TAGVAR(always_export_symbols, $1)=yes if test "$aix_use_runtimelinking" = yes; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. _LT_TAGVAR(allow_undefined_flag, $1)='-berok' # Determine the default libpath from the value encoded in an # empty executable. _LT_SYS_MODULE_PATH_AIX([$1]) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath" _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then func_echo_all "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $libdir:/usr/lib:/lib' _LT_TAGVAR(allow_undefined_flag, $1)="-z nodefs" _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. _LT_SYS_MODULE_PATH_AIX([$1]) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. _LT_TAGVAR(no_undefined_flag, $1)=' ${wl}-bernotok' _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-berok' if test "$with_gnu_ld" = yes; then # We only use this code for GNU lds that support --whole-archive. _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive$convenience ${wl}--no-whole-archive' else # Exported symbols can be pulled into shared objects from archives _LT_TAGVAR(whole_archive_flag_spec, $1)='$convenience' fi _LT_TAGVAR(archive_cmds_need_lc, $1)=yes # This is similar to how AIX traditionally builds its shared libraries. _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='' ;; m68k) _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_minus_L, $1)=yes ;; esac ;; bsdi[[45]]*) _LT_TAGVAR(export_dynamic_flag_spec, $1)=-rdynamic ;; cygwin* | mingw* | pw32* | cegcc*) # When not using gcc, we currently assume that we are using # Microsoft Visual C++. # hardcode_libdir_flag_spec is actually meaningless, as there is # no search path for DLLs. case $cc_basename in cl*) # Native MSVC _LT_TAGVAR(hardcode_libdir_flag_spec, $1)=' ' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=yes _LT_TAGVAR(file_list_spec, $1)='@' # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=".dll" # FIXME: Setting linknames here is a bad hack. _LT_TAGVAR(archive_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-dll~linknames=' _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then sed -n -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' -e '1\\\!p' < $export_symbols > $output_objdir/$soname.exp; else sed -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' < $export_symbols > $output_objdir/$soname.exp; fi~ $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs "@$tool_output_objdir$soname.exp" -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~ linknames=' # The linker will not automatically build a static lib if we build a DLL. # _LT_TAGVAR(old_archive_from_new_cmds, $1)='true' _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes _LT_TAGVAR(exclude_expsyms, $1)='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*' _LT_TAGVAR(export_symbols_cmds, $1)='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[[BCDGRS]][[ ]]/s/.*[[ ]]\([[^ ]]*\)/\1,DATA/'\'' | $SED -e '\''/^[[AITW]][[ ]]/s/.*[[ ]]//'\'' | sort | uniq > $export_symbols' # Don't use ranlib _LT_TAGVAR(old_postinstall_cmds, $1)='chmod 644 $oldlib' _LT_TAGVAR(postlink_cmds, $1)='lt_outputfile="@OUTPUT@"~ lt_tool_outputfile="@TOOL_OUTPUT@"~ case $lt_outputfile in *.exe|*.EXE) ;; *) lt_outputfile="$lt_outputfile.exe" lt_tool_outputfile="$lt_tool_outputfile.exe" ;; esac~ if test "$MANIFEST_TOOL" != ":" && test -f "$lt_outputfile.manifest"; then $MANIFEST_TOOL -manifest "$lt_tool_outputfile.manifest" -outputresource:"$lt_tool_outputfile" || exit 1; $RM "$lt_outputfile.manifest"; fi' ;; *) # Assume MSVC wrapper _LT_TAGVAR(hardcode_libdir_flag_spec, $1)=' ' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=".dll" # FIXME: Setting linknames here is a bad hack. _LT_TAGVAR(archive_cmds, $1)='$CC -o $lib $libobjs $compiler_flags `func_echo_all "$deplibs" | $SED '\''s/ -lc$//'\''` -link -dll~linknames=' # The linker will automatically build a .lib file if we build a DLL. _LT_TAGVAR(old_archive_from_new_cmds, $1)='true' # FIXME: Should let the user specify the lib program. _LT_TAGVAR(old_archive_cmds, $1)='lib -OUT:$oldlib$oldobjs$old_deplibs' _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes ;; esac ;; darwin* | rhapsody*) _LT_DARWIN_LINKER_FEATURES($1) ;; dgux*) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; # FreeBSD 2.2.[012] allows us to include c++rt0.o to get C++ constructor # support. Future versions do this automatically, but an explicit c++rt0.o # does not break anything, and helps significantly (at the cost of a little # extra space). freebsd2.2*) _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; # Unfortunately, older versions of FreeBSD 2 do not have this feature. freebsd2.*) _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; # FreeBSD 3 and greater uses gcc -shared to do shared libraries. freebsd* | dragonfly*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; hpux9*) if test "$GCC" = yes; then _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -shared $pic_flag ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $libobjs $deplibs $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' else _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$LD -b +b $install_libdir -o $output_objdir/$soname $libobjs $deplibs $linker_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(hardcode_direct, $1)=yes # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' ;; hpux10*) if test "$GCC" = yes && test "$with_gnu_ld" = no; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags' fi if test "$with_gnu_ld" = no; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. _LT_TAGVAR(hardcode_minus_L, $1)=yes fi ;; hpux11*) if test "$GCC" = yes && test "$with_gnu_ld" = no; then case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac else case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) m4_if($1, [], [ # Older versions of the 11.00 compiler do not understand -b yet # (HP92453-01 A.11.01.20 doesn't, HP92453-01 B.11.X.35175-35176.GP does) _LT_LINKER_OPTION([if $CC understands -b], _LT_TAGVAR(lt_cv_prog_compiler__b, $1), [-b], [_LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags'], [_LT_TAGVAR(archive_cmds, $1)='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags'])], [_LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags']) ;; esac fi if test "$with_gnu_ld" = no; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: case $host_cpu in hppa*64*|ia64*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. _LT_TAGVAR(hardcode_minus_L, $1)=yes ;; esac fi ;; irix5* | irix6* | nonstopux*) if test "$GCC" = yes; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' # Try to use the -exported_symbol ld option, if it does not # work, assume that -exports_file does not work either and # implicitly export all symbols. # This should be the same for all languages, so no per-tag cache variable. AC_CACHE_CHECK([whether the $host_os linker accepts -exported_symbol], [lt_cv_irix_exported_symbol], [save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS -shared ${wl}-exported_symbol ${wl}foo ${wl}-update_registry ${wl}/dev/null" AC_LINK_IFELSE( [AC_LANG_SOURCE( [AC_LANG_CASE([C], [[int foo (void) { return 0; }]], [C++], [[int foo (void) { return 0; }]], [Fortran 77], [[ subroutine foo end]], [Fortran], [[ subroutine foo end]])])], [lt_cv_irix_exported_symbol=yes], [lt_cv_irix_exported_symbol=no]) LDFLAGS="$save_LDFLAGS"]) if test "$lt_cv_irix_exported_symbol" = yes; then _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations ${wl}-exports_file ${wl}$export_symbols -o $lib' fi else _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -exports_file $export_symbols -o $lib' fi _LT_TAGVAR(archive_cmds_need_lc, $1)='no' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(inherit_rpath, $1)=yes _LT_TAGVAR(link_all_deplibs, $1)=yes ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' # a.out else _LT_TAGVAR(archive_cmds, $1)='$LD -shared -o $lib $libobjs $deplibs $linker_flags' # ELF fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; newsos6) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *nto* | *qnx*) ;; openbsd*) if test -f /usr/libexec/ld.so; then _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=yes if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags ${wl}-retain-symbols-file,$export_symbols' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' else case $host_os in openbsd[[01]].* | openbsd2.[[0-7]] | openbsd2.[[0-7]].*) _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' ;; esac fi else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; os2*) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(archive_cmds, $1)='$ECHO "LIBRARY $libname INITINSTANCE" > $output_objdir/$libname.def~$ECHO "DESCRIPTION \"$libname\"" >> $output_objdir/$libname.def~echo DATA >> $output_objdir/$libname.def~echo " SINGLE NONSHARED" >> $output_objdir/$libname.def~echo EXPORTS >> $output_objdir/$libname.def~emxexp $libobjs >> $output_objdir/$libname.def~$CC -Zdll -Zcrtdll -o $lib $libobjs $deplibs $compiler_flags $output_objdir/$libname.def' _LT_TAGVAR(old_archive_from_new_cmds, $1)='emximp -o $output_objdir/$libname.a $output_objdir/$libname.def' ;; osf3*) if test "$GCC" = yes; then _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else _LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib' fi _LT_TAGVAR(archive_cmds_need_lc, $1)='no' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: ;; osf4* | osf5*) # as osf3* with the addition of -msym flag if test "$GCC" = yes; then _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $pic_flag $libobjs $deplibs $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' else _LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -msym -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done; printf "%s\\n" "-hidden">> $lib.exp~ $CC -shared${allow_undefined_flag} ${wl}-input ${wl}$lib.exp $compiler_flags $libobjs $deplibs -soname $soname `test -n "$verstring" && $ECHO "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib~$RM $lib.exp' # Both c and cxx compiler support -rpath directly _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir' fi _LT_TAGVAR(archive_cmds_need_lc, $1)='no' _LT_TAGVAR(hardcode_libdir_separator, $1)=: ;; solaris*) _LT_TAGVAR(no_undefined_flag, $1)=' -z defs' if test "$GCC" = yes; then wlarc='${wl}' _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag ${wl}-z ${wl}text ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared $pic_flag ${wl}-z ${wl}text ${wl}-M ${wl}$lib.exp ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' else case `$CC -V 2>&1` in *"Compilers 5.0"*) wlarc='' _LT_TAGVAR(archive_cmds, $1)='$LD -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $LD -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$RM $lib.exp' ;; *) wlarc='${wl}' _LT_TAGVAR(archive_cmds, $1)='$CC -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' ;; esac fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no case $host_os in solaris2.[[0-5]] | solaris2.[[0-5]].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands `-z linker_flag'. GCC discards it without `$wl', # but is careful enough not to reorder. # Supported since Solaris 2.6 (maybe 2.5.1?) if test "$GCC" = yes; then _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract' else _LT_TAGVAR(whole_archive_flag_spec, $1)='-z allextract$convenience -z defaultextract' fi ;; esac _LT_TAGVAR(link_all_deplibs, $1)=yes ;; sunos4*) if test "x$host_vendor" = xsequent; then # Use $CC to link under sequent, because it throws in some extra .o # files that make .init and .fini sections work. _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h $soname -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags' fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; sysv4) case $host_vendor in sni) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=yes # is this really true??? ;; siemens) ## LD is ld it makes a PLAMLIB ## CC just makes a GrossModule. _LT_TAGVAR(archive_cmds, $1)='$LD -G -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(reload_cmds, $1)='$CC -r -o $output$reload_objs' _LT_TAGVAR(hardcode_direct, $1)=no ;; motorola) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_direct, $1)=no #Motorola manual says yes, but my tests say they lie ;; esac runpath_var='LD_RUN_PATH' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; sysv4.3*) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(export_dynamic_flag_spec, $1)='-Bexport' ;; sysv4*MP*) if test -d /usr/nec; then _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no runpath_var=LD_RUN_PATH hardcode_runpath_var=yes _LT_TAGVAR(ld_shlibs, $1)=yes fi ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[[01]].[[10]]* | unixware7* | sco3.2v5.0.[[024]]*) _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We can NOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text' _LT_TAGVAR(allow_undefined_flag, $1)='${wl}-z,nodefs' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R,$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-Bexport' runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; uts4*) _LT_TAGVAR(archive_cmds, $1)='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) _LT_TAGVAR(ld_shlibs, $1)=no ;; esac if test x$host_vendor = xsni; then case $host in sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*) _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-Blargedynsym' ;; esac fi fi ]) AC_MSG_RESULT([$_LT_TAGVAR(ld_shlibs, $1)]) test "$_LT_TAGVAR(ld_shlibs, $1)" = no && can_build_shared=no _LT_TAGVAR(with_gnu_ld, $1)=$with_gnu_ld _LT_DECL([], [libext], [0], [Old archive suffix (normally "a")])dnl _LT_DECL([], [shrext_cmds], [1], [Shared library suffix (normally ".so")])dnl _LT_DECL([], [extract_expsyms_cmds], [2], [The commands to extract the exported symbol list from a shared archive]) # # Do we need to explicitly link libc? # case "x$_LT_TAGVAR(archive_cmds_need_lc, $1)" in x|xyes) # Assume -lc should be added _LT_TAGVAR(archive_cmds_need_lc, $1)=yes if test "$enable_shared" = yes && test "$GCC" = yes; then case $_LT_TAGVAR(archive_cmds, $1) in *'~'*) # FIXME: we may have to deal with multi-command sequences. ;; '$CC '*) # Test whether the compiler implicitly links with -lc since on some # systems, -lgcc has to come before -lc. If gcc already passes -lc # to ld, don't add -lc before -lgcc. AC_CACHE_CHECK([whether -lc should be explicitly linked in], [lt_cv_]_LT_TAGVAR(archive_cmds_need_lc, $1), [$RM conftest* echo "$lt_simple_compile_test_code" > conftest.$ac_ext if AC_TRY_EVAL(ac_compile) 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$_LT_TAGVAR(lt_prog_compiler_wl, $1) pic_flag=$_LT_TAGVAR(lt_prog_compiler_pic, $1) compiler_flags=-v linker_flags=-v verstring= output_objdir=. libname=conftest lt_save_allow_undefined_flag=$_LT_TAGVAR(allow_undefined_flag, $1) _LT_TAGVAR(allow_undefined_flag, $1)= if AC_TRY_EVAL(_LT_TAGVAR(archive_cmds, $1) 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1) then lt_cv_[]_LT_TAGVAR(archive_cmds_need_lc, $1)=no else lt_cv_[]_LT_TAGVAR(archive_cmds_need_lc, $1)=yes fi _LT_TAGVAR(allow_undefined_flag, $1)=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $RM conftest* ]) _LT_TAGVAR(archive_cmds_need_lc, $1)=$lt_cv_[]_LT_TAGVAR(archive_cmds_need_lc, $1) ;; esac fi ;; esac _LT_TAGDECL([build_libtool_need_lc], [archive_cmds_need_lc], [0], [Whether or not to add -lc for building shared libraries]) _LT_TAGDECL([allow_libtool_libs_with_static_runtimes], [enable_shared_with_static_runtimes], [0], [Whether or not to disallow shared libs when runtime libs are static]) _LT_TAGDECL([], [export_dynamic_flag_spec], [1], [Compiler flag to allow reflexive dlopens]) _LT_TAGDECL([], [whole_archive_flag_spec], [1], [Compiler flag to generate shared objects directly from archives]) _LT_TAGDECL([], [compiler_needs_object], [1], [Whether the compiler copes with passing no objects directly]) _LT_TAGDECL([], [old_archive_from_new_cmds], [2], [Create an old-style archive from a shared archive]) _LT_TAGDECL([], [old_archive_from_expsyms_cmds], [2], [Create a temporary old-style archive to link instead of a shared archive]) _LT_TAGDECL([], [archive_cmds], [2], [Commands used to build a shared archive]) _LT_TAGDECL([], [archive_expsym_cmds], [2]) _LT_TAGDECL([], [module_cmds], [2], [Commands used to build a loadable module if different from building a shared archive.]) _LT_TAGDECL([], [module_expsym_cmds], [2]) _LT_TAGDECL([], [with_gnu_ld], [1], [Whether we are building with GNU ld or not]) _LT_TAGDECL([], [allow_undefined_flag], [1], [Flag that allows shared libraries with undefined symbols to be built]) _LT_TAGDECL([], [no_undefined_flag], [1], [Flag that enforces no undefined symbols]) _LT_TAGDECL([], [hardcode_libdir_flag_spec], [1], [Flag to hardcode $libdir into a binary during linking. This must work even if $libdir does not exist]) _LT_TAGDECL([], [hardcode_libdir_separator], [1], [Whether we need a single "-rpath" flag with a separated argument]) _LT_TAGDECL([], [hardcode_direct], [0], [Set to "yes" if using DIR/libNAME${shared_ext} during linking hardcodes DIR into the resulting binary]) _LT_TAGDECL([], [hardcode_direct_absolute], [0], [Set to "yes" if using DIR/libNAME${shared_ext} during linking hardcodes DIR into the resulting binary and the resulting library dependency is "absolute", i.e impossible to change by setting ${shlibpath_var} if the library is relocated]) _LT_TAGDECL([], [hardcode_minus_L], [0], [Set to "yes" if using the -LDIR flag during linking hardcodes DIR into the resulting binary]) _LT_TAGDECL([], [hardcode_shlibpath_var], [0], [Set to "yes" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR into the resulting binary]) _LT_TAGDECL([], [hardcode_automatic], [0], [Set to "yes" if building a shared library automatically hardcodes DIR into the library and all subsequent libraries and executables linked against it]) _LT_TAGDECL([], [inherit_rpath], [0], [Set to yes if linker adds runtime paths of dependent libraries to runtime path list]) _LT_TAGDECL([], [link_all_deplibs], [0], [Whether libtool must link a program against all its dependency libraries]) _LT_TAGDECL([], [always_export_symbols], [0], [Set to "yes" if exported symbols are required]) _LT_TAGDECL([], [export_symbols_cmds], [2], [The commands to list exported symbols]) _LT_TAGDECL([], [exclude_expsyms], [1], [Symbols that should not be listed in the preloaded symbols]) _LT_TAGDECL([], [include_expsyms], [1], [Symbols that must always be exported]) _LT_TAGDECL([], [prelink_cmds], [2], [Commands necessary for linking programs (against libraries) with templates]) _LT_TAGDECL([], [postlink_cmds], [2], [Commands necessary for finishing linking programs]) _LT_TAGDECL([], [file_list_spec], [1], [Specify filename containing input files]) dnl FIXME: Not yet implemented dnl _LT_TAGDECL([], [thread_safe_flag_spec], [1], dnl [Compiler flag to generate thread safe objects]) ])# _LT_LINKER_SHLIBS # _LT_LANG_C_CONFIG([TAG]) # ------------------------ # Ensure that the configuration variables for a C compiler are suitably # defined. These variables are subsequently used by _LT_CONFIG to write # the compiler configuration to `libtool'. m4_defun([_LT_LANG_C_CONFIG], [m4_require([_LT_DECL_EGREP])dnl lt_save_CC="$CC" AC_LANG_PUSH(C) # Source file extension for C test sources. ac_ext=c # Object file extension for compiled C test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(){return(0);}' _LT_TAG_COMPILER # Save the default compiler, since it gets overwritten when the other # tags are being tested, and _LT_TAGVAR(compiler, []) is a NOP. compiler_DEFAULT=$CC # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... if test -n "$compiler"; then _LT_COMPILER_NO_RTTI($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) LT_SYS_DLOPEN_SELF _LT_CMD_STRIPLIB # Report which library types will actually be built AC_MSG_CHECKING([if libtool supports shared libraries]) AC_MSG_RESULT([$can_build_shared]) AC_MSG_CHECKING([whether to build shared libraries]) test "$can_build_shared" = "no" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && enable_static=no fi ;; esac AC_MSG_RESULT([$enable_shared]) AC_MSG_CHECKING([whether to build static libraries]) # Make sure either enable_shared or enable_static is yes. test "$enable_shared" = yes || enable_static=yes AC_MSG_RESULT([$enable_static]) _LT_CONFIG($1) fi AC_LANG_POP CC="$lt_save_CC" ])# _LT_LANG_C_CONFIG # _LT_LANG_CXX_CONFIG([TAG]) # -------------------------- # Ensure that the configuration variables for a C++ compiler are suitably # defined. These variables are subsequently used by _LT_CONFIG to write # the compiler configuration to `libtool'. m4_defun([_LT_LANG_CXX_CONFIG], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl m4_require([_LT_DECL_EGREP])dnl m4_require([_LT_PATH_MANIFEST_TOOL])dnl if test -n "$CXX" && ( test "X$CXX" != "Xno" && ( (test "X$CXX" = "Xg++" && `g++ -v >/dev/null 2>&1` ) || (test "X$CXX" != "Xg++"))) ; then AC_PROG_CXXCPP else _lt_caught_CXX_error=yes fi AC_LANG_PUSH(C++) _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(compiler_needs_object, $1)=no _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=unsupported _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(reload_flag, $1)=$reload_flag _LT_TAGVAR(reload_cmds, $1)=$reload_cmds _LT_TAGVAR(no_undefined_flag, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no # Source file extension for C++ test sources. ac_ext=cpp # Object file extension for compiled C++ test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # No sense in running all these tests if we already determined that # the CXX compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test "$_lt_caught_CXX_error" != yes; then # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(int, char *[[]]) { return(0); }' # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_CFLAGS=$CFLAGS lt_save_LD=$LD lt_save_GCC=$GCC GCC=$GXX lt_save_with_gnu_ld=$with_gnu_ld lt_save_path_LD=$lt_cv_path_LD if test -n "${lt_cv_prog_gnu_ldcxx+set}"; then lt_cv_prog_gnu_ld=$lt_cv_prog_gnu_ldcxx else $as_unset lt_cv_prog_gnu_ld fi if test -n "${lt_cv_path_LDCXX+set}"; then lt_cv_path_LD=$lt_cv_path_LDCXX else $as_unset lt_cv_path_LD fi test -z "${LDCXX+set}" || LD=$LDCXX CC=${CXX-"c++"} CFLAGS=$CXXFLAGS compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) if test -n "$compiler"; then # We don't want -fno-exception when compiling C++ code, so set the # no_builtin_flag separately if test "$GXX" = yes; then _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)=' -fno-builtin' else _LT_TAGVAR(lt_prog_compiler_no_builtin_flag, $1)= fi if test "$GXX" = yes; then # Set up default GNU C++ configuration LT_PATH_LD # Check if GNU C++ uses GNU ld as the underlying linker, since the # archiving commands below assume that GNU ld is being used. if test "$with_gnu_ld" = yes; then _LT_TAGVAR(archive_cmds, $1)='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' # If archive_cmds runs LD, not CC, wlarc should be empty # XXX I think wlarc can be eliminated in ltcf-cxx, but I need to # investigate it a little bit more. (MM) wlarc='${wl}' # ancient GNU ld didn't support --whole-archive et. al. if eval "`$CC -print-prog-name=ld` --help 2>&1" | $GREP 'no-whole-archive' > /dev/null; then _LT_TAGVAR(whole_archive_flag_spec, $1)="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' else _LT_TAGVAR(whole_archive_flag_spec, $1)= fi else with_gnu_ld=no wlarc= # A generic and very simple default shared library creation # command for GNU C++ for the case where it uses the native # linker, instead of GNU ld. If possible, this setting should # overridden to take advantage of the native linker features on # the platform it is being used on. _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' fi # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' else GXX=no with_gnu_ld=no wlarc= fi # PORTME: fill in a description of your system's C++ link characteristics AC_MSG_CHECKING([whether the $compiler linker ($LD) supports shared libraries]) _LT_TAGVAR(ld_shlibs, $1)=yes case $host_os in aix3*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; aix[[4-9]]*) if test "$host_cpu" = ia64; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag="" else aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[[23]]|aix4.[[23]].*|aix[[5-9]]*) for ld_flag in $LDFLAGS; do case $ld_flag in *-brtl*) aix_use_runtimelinking=yes break ;; esac done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. _LT_TAGVAR(archive_cmds, $1)='' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(file_list_spec, $1)='${wl}-f,' if test "$GXX" = yes; then case $host_os in aix4.[[012]]|aix4.[[012]].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`${CC} -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 _LT_TAGVAR(hardcode_direct, $1)=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking _LT_TAGVAR(hardcode_minus_L, $1)=yes _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)= fi esac shared_flag='-shared' if test "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi else # not using gcc if test "$host_cpu" = ia64; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test "$aix_use_runtimelinking" = yes; then shared_flag='${wl}-G' else shared_flag='${wl}-bM:SRE' fi fi fi _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to # export. _LT_TAGVAR(always_export_symbols, $1)=yes if test "$aix_use_runtimelinking" = yes; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. _LT_TAGVAR(allow_undefined_flag, $1)='-berok' # Determine the default libpath from the value encoded in an empty # executable. _LT_SYS_MODULE_PATH_AIX([$1]) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath" _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then func_echo_all "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $libdir:/usr/lib:/lib' _LT_TAGVAR(allow_undefined_flag, $1)="-z nodefs" _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. _LT_SYS_MODULE_PATH_AIX([$1]) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. _LT_TAGVAR(no_undefined_flag, $1)=' ${wl}-bernotok' _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-berok' if test "$with_gnu_ld" = yes; then # We only use this code for GNU lds that support --whole-archive. _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive$convenience ${wl}--no-whole-archive' else # Exported symbols can be pulled into shared objects from archives _LT_TAGVAR(whole_archive_flag_spec, $1)='$convenience' fi _LT_TAGVAR(archive_cmds_need_lc, $1)=yes # This is similar to how AIX traditionally builds its shared # libraries. _LT_TAGVAR(archive_expsym_cmds, $1)="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then _LT_TAGVAR(allow_undefined_flag, $1)=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME _LT_TAGVAR(archive_cmds, $1)='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; chorus*) case $cc_basename in *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; cygwin* | mingw* | pw32* | cegcc*) case $GXX,$cc_basename in ,cl* | no,cl*) # Native MSVC # hardcode_libdir_flag_spec is actually meaningless, as there is # no search path for DLLs. _LT_TAGVAR(hardcode_libdir_flag_spec, $1)=' ' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=yes _LT_TAGVAR(file_list_spec, $1)='@' # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=".dll" # FIXME: Setting linknames here is a bad hack. _LT_TAGVAR(archive_cmds, $1)='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-dll~linknames=' _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then $SED -n -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' -e '1\\\!p' < $export_symbols > $output_objdir/$soname.exp; else $SED -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' < $export_symbols > $output_objdir/$soname.exp; fi~ $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs "@$tool_output_objdir$soname.exp" -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~ linknames=' # The linker will not automatically build a static lib if we build a DLL. # _LT_TAGVAR(old_archive_from_new_cmds, $1)='true' _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes # Don't use ranlib _LT_TAGVAR(old_postinstall_cmds, $1)='chmod 644 $oldlib' _LT_TAGVAR(postlink_cmds, $1)='lt_outputfile="@OUTPUT@"~ lt_tool_outputfile="@TOOL_OUTPUT@"~ case $lt_outputfile in *.exe|*.EXE) ;; *) lt_outputfile="$lt_outputfile.exe" lt_tool_outputfile="$lt_tool_outputfile.exe" ;; esac~ func_to_tool_file "$lt_outputfile"~ if test "$MANIFEST_TOOL" != ":" && test -f "$lt_outputfile.manifest"; then $MANIFEST_TOOL -manifest "$lt_tool_outputfile.manifest" -outputresource:"$lt_tool_outputfile" || exit 1; $RM "$lt_outputfile.manifest"; fi' ;; *) # g++ # _LT_TAGVAR(hardcode_libdir_flag_spec, $1) is actually meaningless, # as there is no search path for DLLs. _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-L$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-all-symbols' _LT_TAGVAR(allow_undefined_flag, $1)=unsupported _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=yes if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file (1st line # is EXPORTS), use it as is; otherwise, prepend... _LT_TAGVAR(archive_expsym_cmds, $1)='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared -nostdlib $output_objdir/$soname.def $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; darwin* | rhapsody*) _LT_DARWIN_LINKER_FEATURES($1) ;; dgux*) case $cc_basename in ec++*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; ghcx*) # Green Hills C++ Compiler # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; freebsd2.*) # C++ shared libraries reported to be fairly broken before # switch to ELF _LT_TAGVAR(ld_shlibs, $1)=no ;; freebsd-elf*) _LT_TAGVAR(archive_cmds_need_lc, $1)=no ;; freebsd* | dragonfly*) # FreeBSD 3 and later use GNU C++ and GNU ld with standard ELF # conventions _LT_TAGVAR(ld_shlibs, $1)=yes ;; haiku*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(link_all_deplibs, $1)=yes ;; hpux9*) _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH, # but as the default # location of the library. case $cc_basename in CC*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; aCC*) _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -b ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $EGREP "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' ;; *) if test "$GXX" = yes; then _LT_TAGVAR(archive_cmds, $1)='$RM $output_objdir/$soname~$CC -shared -nostdlib $pic_flag ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' else # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; hpux10*|hpux11*) if test $with_gnu_ld = no; then _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}+b ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: case $host_cpu in hppa*64*|ia64*) ;; *) _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' ;; esac fi case $host_cpu in hppa*64*|ia64*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no ;; *) _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(hardcode_minus_L, $1)=yes # Not in the search PATH, # but as the default # location of the library. ;; esac case $cc_basename in CC*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; aCC*) case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $GREP "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' ;; *) if test "$GXX" = yes; then if test $with_gnu_ld = no; then case $host_cpu in hppa*64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $pic_flag ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib $pic_flag ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac fi else # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; interix[[3-9]]*) _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; irix5* | irix6*) case $cc_basename in CC*) # SGI C++ _LT_TAGVAR(archive_cmds, $1)='$CC -shared -all -multigot $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib' # Archives containing C++ object files must be created using # "CC -ar", where "CC" is the IRIX C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC -ar -WR,-u -o $oldlib $oldobjs' ;; *) if test "$GXX" = yes; then if test "$with_gnu_ld" = no; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` -o $lib' fi fi _LT_TAGVAR(link_all_deplibs, $1)=yes ;; esac _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: _LT_TAGVAR(inherit_rpath, $1)=yes ;; linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. _LT_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib ${wl}-retain-symbols-file,$export_symbols; mv \$templib $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 | $GREP "ld"`; rm -f libconftest$shared_ext; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' # Archives containing C++ object files must be created using # "CC -Bstatic", where "CC" is the KAI C++ compiler. _LT_TAGVAR(old_archive_cmds, $1)='$CC -Bstatic -o $oldlib $oldobjs' ;; icpc* | ecpc* ) # Intel C++ with_gnu_ld=yes # version 8.0 and above of icpc choke on multiply defined symbols # if we add $predep_objects and $postdep_objects, however 7.1 and # earlier do not add the objects themselves. case `$CC -V 2>&1` in *"Version 7."*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' ;; *) # Version 8.0 or newer tmp_idyn= case $host_cpu in ia64*) tmp_idyn=' -i_dynamic';; esac _LT_TAGVAR(archive_cmds, $1)='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' ;; esac _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive$convenience ${wl}--no-whole-archive' ;; pgCC* | pgcpp*) # Portland Group C++ compiler case `$CC -V` in *pgCC\ [[1-5]].* | *pgcpp\ [[1-5]].*) _LT_TAGVAR(prelink_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $objs $libobjs $compile_deplibs~ compile_command="$compile_command `find $tpldir -name \*.o | sort | $NL2SP`"' _LT_TAGVAR(old_archive_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $oldobjs$old_deplibs~ $AR $AR_FLAGS $oldlib$oldobjs$old_deplibs `find $tpldir -name \*.o | sort | $NL2SP`~ $RANLIB $oldlib' _LT_TAGVAR(archive_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~ $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | sort | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~ $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | sort | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib' ;; *) # Version 6 and above use weak symbols _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib' ;; esac _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}--rpath ${wl}$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive' ;; cxx*) # Compaq C++ _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib ${wl}-retain-symbols-file $wl$export_symbols' runpath_var=LD_RUN_PATH _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld"`; templist=`func_echo_all "$templist" | $SED "s/\(^.*ld.*\)\( .*ld .*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "X$list" | $Xsed' ;; xl* | mpixl* | bgxl*) # IBM XL 8.0 on PPC, with GNU ld _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}--export-dynamic' _LT_TAGVAR(archive_cmds, $1)='$CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' if test "x$supports_anon_versioning" = xyes; then _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib' fi ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 _LT_TAGVAR(no_undefined_flag, $1)=' -zdefs' _LT_TAGVAR(archive_cmds, $1)='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file ${wl}$export_symbols' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive' _LT_TAGVAR(compiler_needs_object, $1)=yes # Not sure whether something based on # $CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 # would be better. output_verbose_link_cmd='func_echo_all' # Archives containing C++ object files must be created using # "CC -xar", where "CC" is the Sun C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC -xar -o $oldlib $oldobjs' ;; esac ;; esac ;; lynxos*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; m88k*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; mvs*) case $cc_basename in cxx*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; netbsd*) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then _LT_TAGVAR(archive_cmds, $1)='$LD -Bshareable -o $lib $predep_objects $libobjs $deplibs $postdep_objects $linker_flags' wlarc= _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no fi # Workaround some broken pre-1.5 toolchains output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP conftest.$objext | $SED -e "s:-lgcc -lc -lgcc::"' ;; *nto* | *qnx*) _LT_TAGVAR(ld_shlibs, $1)=yes ;; openbsd2*) # C++ shared libraries are fairly broken _LT_TAGVAR(ld_shlibs, $1)=no ;; openbsd*) if test -f /usr/libexec/ld.so; then _LT_TAGVAR(hardcode_direct, $1)=yes _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=yes _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file,$export_symbols -o $lib' _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-E' _LT_TAGVAR(whole_archive_flag_spec, $1)="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' fi output_verbose_link_cmd=func_echo_all else _LT_TAGVAR(ld_shlibs, $1)=no fi ;; osf3* | osf4* | osf5*) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. _LT_TAGVAR(archive_cmds, $1)='tempext=`echo $shared_ext | $SED -e '\''s/\([[^()0-9A-Za-z{}]]\)/\\\\\1/g'\''`; templib=`echo "$lib" | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath,$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Archives containing C++ object files must be created using # the KAI C++ compiler. case $host in osf3*) _LT_TAGVAR(old_archive_cmds, $1)='$CC -Bstatic -o $oldlib $oldobjs' ;; *) _LT_TAGVAR(old_archive_cmds, $1)='$CC -o $oldlib $oldobjs' ;; esac ;; RCC*) # Rational C++ 2.4.1 # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; cxx*) case $host in osf3*) _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $soname `test -n "$verstring" && func_echo_all "${wl}-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' ;; *) _LT_TAGVAR(allow_undefined_flag, $1)=' -expect_unresolved \*' _LT_TAGVAR(archive_cmds, $1)='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done~ echo "-hidden">> $lib.exp~ $CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname ${wl}-input ${wl}$lib.exp `test -n "$verstring" && $ECHO "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib~ $RM $lib.exp' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-rpath $libdir' ;; esac _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld" | $GREP -v "ld:"`; templist=`func_echo_all "$templist" | $SED "s/\(^.*ld.*\)\( .*ld.*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' ;; *) if test "$GXX" = yes && test "$with_gnu_ld" = no; then _LT_TAGVAR(allow_undefined_flag, $1)=' ${wl}-expect_unresolved ${wl}\*' case $host in osf3*) _LT_TAGVAR(archive_cmds, $1)='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' ;; esac _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-rpath ${wl}$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' else # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no fi ;; esac ;; psos*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; lcc*) # Lucid # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; solaris*) case $cc_basename in CC* | sunCC*) # Sun C++ 4.2, 5.x and Centerline C++ _LT_TAGVAR(archive_cmds_need_lc,$1)=yes _LT_TAGVAR(no_undefined_flag, $1)=' -zdefs' _LT_TAGVAR(archive_cmds, $1)='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G${allow_undefined_flag} ${wl}-M ${wl}$lib.exp -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='-R$libdir' _LT_TAGVAR(hardcode_shlibpath_var, $1)=no case $host_os in solaris2.[[0-5]] | solaris2.[[0-5]].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands `-z linker_flag'. # Supported since Solaris 2.6 (maybe 2.5.1?) _LT_TAGVAR(whole_archive_flag_spec, $1)='-z allextract$convenience -z defaultextract' ;; esac _LT_TAGVAR(link_all_deplibs, $1)=yes output_verbose_link_cmd='func_echo_all' # Archives containing C++ object files must be created using # "CC -xar", where "CC" is the Sun C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC -xar -o $oldlib $oldobjs' ;; gcx*) # Green Hills C++ Compiler _LT_TAGVAR(archive_cmds, $1)='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' # The C++ compiler must be used to create the archive. _LT_TAGVAR(old_archive_cmds, $1)='$CC $LDFLAGS -archive -o $oldlib $oldobjs' ;; *) # GNU C++ compiler with Solaris linker if test "$GXX" = yes && test "$with_gnu_ld" = no; then _LT_TAGVAR(no_undefined_flag, $1)=' ${wl}-z ${wl}defs' if $CC --version | $GREP -v '^2\.7' > /dev/null; then _LT_TAGVAR(archive_cmds, $1)='$CC -shared $pic_flag -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared $pic_flag -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' else # g++ 2.7 appears to require `-G' NOT `-shared' on this # platform. _LT_TAGVAR(archive_cmds, $1)='$CC -G -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' _LT_TAGVAR(archive_expsym_cmds, $1)='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -G $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' fi _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R $wl$libdir' case $host_os in solaris2.[[0-5]] | solaris2.[[0-5]].*) ;; *) _LT_TAGVAR(whole_archive_flag_spec, $1)='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract' ;; esac fi ;; esac ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[[01]].[[10]]* | unixware7* | sco3.2v5.0.[[024]]*) _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no runpath_var='LD_RUN_PATH' case $cc_basename in CC*) _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We can NOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. _LT_TAGVAR(no_undefined_flag, $1)='${wl}-z,text' _LT_TAGVAR(allow_undefined_flag, $1)='${wl}-z,nodefs' _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(hardcode_shlibpath_var, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)='${wl}-R,$libdir' _LT_TAGVAR(hardcode_libdir_separator, $1)=':' _LT_TAGVAR(link_all_deplibs, $1)=yes _LT_TAGVAR(export_dynamic_flag_spec, $1)='${wl}-Bexport' runpath_var='LD_RUN_PATH' case $cc_basename in CC*) _LT_TAGVAR(archive_cmds, $1)='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(old_archive_cmds, $1)='$CC -Tprelink_objects $oldobjs~ '"$_LT_TAGVAR(old_archive_cmds, $1)" _LT_TAGVAR(reload_cmds, $1)='$CC -Tprelink_objects $reload_objs~ '"$_LT_TAGVAR(reload_cmds, $1)" ;; *) _LT_TAGVAR(archive_cmds, $1)='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' _LT_TAGVAR(archive_expsym_cmds, $1)='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac ;; vxworks*) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; *) # FIXME: insert proper C++ library support _LT_TAGVAR(ld_shlibs, $1)=no ;; esac AC_MSG_RESULT([$_LT_TAGVAR(ld_shlibs, $1)]) test "$_LT_TAGVAR(ld_shlibs, $1)" = no && can_build_shared=no _LT_TAGVAR(GCC, $1)="$GXX" _LT_TAGVAR(LD, $1)="$LD" ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... _LT_SYS_HIDDEN_LIBDEPS($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi # test -n "$compiler" CC=$lt_save_CC CFLAGS=$lt_save_CFLAGS LDCXX=$LD LD=$lt_save_LD GCC=$lt_save_GCC with_gnu_ld=$lt_save_with_gnu_ld lt_cv_path_LDCXX=$lt_cv_path_LD lt_cv_path_LD=$lt_save_path_LD lt_cv_prog_gnu_ldcxx=$lt_cv_prog_gnu_ld lt_cv_prog_gnu_ld=$lt_save_with_gnu_ld fi # test "$_lt_caught_CXX_error" != yes AC_LANG_POP ])# _LT_LANG_CXX_CONFIG # _LT_FUNC_STRIPNAME_CNF # ---------------------- # func_stripname_cnf prefix suffix name # strip PREFIX and SUFFIX off of NAME. # PREFIX and SUFFIX must not contain globbing or regex special # characters, hashes, percent signs, but SUFFIX may contain a leading # dot (in which case that matches only a dot). # # This function is identical to the (non-XSI) version of func_stripname, # except this one can be used by m4 code that may be executed by configure, # rather than the libtool script. m4_defun([_LT_FUNC_STRIPNAME_CNF],[dnl AC_REQUIRE([_LT_DECL_SED]) AC_REQUIRE([_LT_PROG_ECHO_BACKSLASH]) func_stripname_cnf () { case ${2} in .*) func_stripname_result=`$ECHO "${3}" | $SED "s%^${1}%%; s%\\\\${2}\$%%"`;; *) func_stripname_result=`$ECHO "${3}" | $SED "s%^${1}%%; s%${2}\$%%"`;; esac } # func_stripname_cnf ])# _LT_FUNC_STRIPNAME_CNF # _LT_SYS_HIDDEN_LIBDEPS([TAGNAME]) # --------------------------------- # Figure out "hidden" library dependencies from verbose # compiler output when linking a shared library. # Parse the compiler output and extract the necessary # objects, libraries and library flags. m4_defun([_LT_SYS_HIDDEN_LIBDEPS], [m4_require([_LT_FILEUTILS_DEFAULTS])dnl AC_REQUIRE([_LT_FUNC_STRIPNAME_CNF])dnl # Dependencies to place before and after the object being linked: _LT_TAGVAR(predep_objects, $1)= _LT_TAGVAR(postdep_objects, $1)= _LT_TAGVAR(predeps, $1)= _LT_TAGVAR(postdeps, $1)= _LT_TAGVAR(compiler_lib_search_path, $1)= dnl we can't use the lt_simple_compile_test_code here, dnl because it contains code intended for an executable, dnl not a library. It's possible we should let each dnl tag define a new lt_????_link_test_code variable, dnl but it's only used here... m4_if([$1], [], [cat > conftest.$ac_ext <<_LT_EOF int a; void foo (void) { a = 0; } _LT_EOF ], [$1], [CXX], [cat > conftest.$ac_ext <<_LT_EOF class Foo { public: Foo (void) { a = 0; } private: int a; }; _LT_EOF ], [$1], [F77], [cat > conftest.$ac_ext <<_LT_EOF subroutine foo implicit none integer*4 a a=0 return end _LT_EOF ], [$1], [FC], [cat > conftest.$ac_ext <<_LT_EOF subroutine foo implicit none integer a a=0 return end _LT_EOF ], [$1], [GCJ], [cat > conftest.$ac_ext <<_LT_EOF public class foo { private int a; public void bar (void) { a = 0; } }; _LT_EOF ], [$1], [GO], [cat > conftest.$ac_ext <<_LT_EOF package foo func foo() { } _LT_EOF ]) _lt_libdeps_save_CFLAGS=$CFLAGS case "$CC $CFLAGS " in #( *\ -flto*\ *) CFLAGS="$CFLAGS -fno-lto" ;; *\ -fwhopr*\ *) CFLAGS="$CFLAGS -fno-whopr" ;; *\ -fuse-linker-plugin*\ *) CFLAGS="$CFLAGS -fno-use-linker-plugin" ;; esac dnl Parse the compiler output and extract the necessary dnl objects, libraries and library flags. if AC_TRY_EVAL(ac_compile); then # Parse the compiler output and extract the necessary # objects, libraries and library flags. # Sentinel used to keep track of whether or not we are before # the conftest object file. pre_test_object_deps_done=no for p in `eval "$output_verbose_link_cmd"`; do case ${prev}${p} in -L* | -R* | -l*) # Some compilers place space between "-{L,R}" and the path. # Remove the space. if test $p = "-L" || test $p = "-R"; then prev=$p continue fi # Expand the sysroot to ease extracting the directories later. if test -z "$prev"; then case $p in -L*) func_stripname_cnf '-L' '' "$p"; prev=-L; p=$func_stripname_result ;; -R*) func_stripname_cnf '-R' '' "$p"; prev=-R; p=$func_stripname_result ;; -l*) func_stripname_cnf '-l' '' "$p"; prev=-l; p=$func_stripname_result ;; esac fi case $p in =*) func_stripname_cnf '=' '' "$p"; p=$lt_sysroot$func_stripname_result ;; esac if test "$pre_test_object_deps_done" = no; then case ${prev} in -L | -R) # Internal compiler library paths should come after those # provided the user. The postdeps already come after the # user supplied libs so there is no need to process them. if test -z "$_LT_TAGVAR(compiler_lib_search_path, $1)"; then _LT_TAGVAR(compiler_lib_search_path, $1)="${prev}${p}" else _LT_TAGVAR(compiler_lib_search_path, $1)="${_LT_TAGVAR(compiler_lib_search_path, $1)} ${prev}${p}" fi ;; # The "-l" case would never come before the object being # linked, so don't bother handling this case. esac else if test -z "$_LT_TAGVAR(postdeps, $1)"; then _LT_TAGVAR(postdeps, $1)="${prev}${p}" else _LT_TAGVAR(postdeps, $1)="${_LT_TAGVAR(postdeps, $1)} ${prev}${p}" fi fi prev= ;; *.lto.$objext) ;; # Ignore GCC LTO objects *.$objext) # This assumes that the test object file only shows up # once in the compiler output. if test "$p" = "conftest.$objext"; then pre_test_object_deps_done=yes continue fi if test "$pre_test_object_deps_done" = no; then if test -z "$_LT_TAGVAR(predep_objects, $1)"; then _LT_TAGVAR(predep_objects, $1)="$p" else _LT_TAGVAR(predep_objects, $1)="$_LT_TAGVAR(predep_objects, $1) $p" fi else if test -z "$_LT_TAGVAR(postdep_objects, $1)"; then _LT_TAGVAR(postdep_objects, $1)="$p" else _LT_TAGVAR(postdep_objects, $1)="$_LT_TAGVAR(postdep_objects, $1) $p" fi fi ;; *) ;; # Ignore the rest. esac done # Clean up. rm -f a.out a.exe else echo "libtool.m4: error: problem compiling $1 test program" fi $RM -f confest.$objext CFLAGS=$_lt_libdeps_save_CFLAGS # PORTME: override above test on systems where it is broken m4_if([$1], [CXX], [case $host_os in interix[[3-9]]*) # Interix 3.5 installs completely hosed .la files for C++, so rather than # hack all around it, let's just trust "g++" to DTRT. _LT_TAGVAR(predep_objects,$1)= _LT_TAGVAR(postdep_objects,$1)= _LT_TAGVAR(postdeps,$1)= ;; linux*) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 # The more standards-conforming stlport4 library is # incompatible with the Cstd library. Avoid specifying # it if it's in CXXFLAGS. Ignore libCrun as # -library=stlport4 depends on it. case " $CXX $CXXFLAGS " in *" -library=stlport4 "*) solaris_use_stlport4=yes ;; esac if test "$solaris_use_stlport4" != yes; then _LT_TAGVAR(postdeps,$1)='-library=Cstd -library=Crun' fi ;; esac ;; solaris*) case $cc_basename in CC* | sunCC*) # The more standards-conforming stlport4 library is # incompatible with the Cstd library. Avoid specifying # it if it's in CXXFLAGS. Ignore libCrun as # -library=stlport4 depends on it. case " $CXX $CXXFLAGS " in *" -library=stlport4 "*) solaris_use_stlport4=yes ;; esac # Adding this requires a known-good setup of shared libraries for # Sun compiler versions before 5.6, else PIC objects from an old # archive will be linked into the output, leading to subtle bugs. if test "$solaris_use_stlport4" != yes; then _LT_TAGVAR(postdeps,$1)='-library=Cstd -library=Crun' fi ;; esac ;; esac ]) case " $_LT_TAGVAR(postdeps, $1) " in *" -lc "*) _LT_TAGVAR(archive_cmds_need_lc, $1)=no ;; esac _LT_TAGVAR(compiler_lib_search_dirs, $1)= if test -n "${_LT_TAGVAR(compiler_lib_search_path, $1)}"; then _LT_TAGVAR(compiler_lib_search_dirs, $1)=`echo " ${_LT_TAGVAR(compiler_lib_search_path, $1)}" | ${SED} -e 's! -L! !g' -e 's!^ !!'` fi _LT_TAGDECL([], [compiler_lib_search_dirs], [1], [The directories searched by this compiler when creating a shared library]) _LT_TAGDECL([], [predep_objects], [1], [Dependencies to place before and after the objects being linked to create a shared library]) _LT_TAGDECL([], [postdep_objects], [1]) _LT_TAGDECL([], [predeps], [1]) _LT_TAGDECL([], [postdeps], [1]) _LT_TAGDECL([], [compiler_lib_search_path], [1], [The library search path used internally by the compiler when linking a shared library]) ])# _LT_SYS_HIDDEN_LIBDEPS # _LT_LANG_F77_CONFIG([TAG]) # -------------------------- # Ensure that the configuration variables for a Fortran 77 compiler are # suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to `libtool'. m4_defun([_LT_LANG_F77_CONFIG], [AC_LANG_PUSH(Fortran 77) if test -z "$F77" || test "X$F77" = "Xno"; then _lt_disable_F77=yes fi _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(reload_flag, $1)=$reload_flag _LT_TAGVAR(reload_cmds, $1)=$reload_cmds _LT_TAGVAR(no_undefined_flag, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no # Source file extension for f77 test sources. ac_ext=f # Object file extension for compiled f77 test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # No sense in running all these tests if we already determined that # the F77 compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test "$_lt_disable_F77" != yes; then # Code to be used in simple compile tests lt_simple_compile_test_code="\ subroutine t return end " # Code to be used in simple link tests lt_simple_link_test_code="\ program t end " # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC="$CC" lt_save_GCC=$GCC lt_save_CFLAGS=$CFLAGS CC=${F77-"f77"} CFLAGS=$FFLAGS compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) GCC=$G77 if test -n "$compiler"; then AC_MSG_CHECKING([if libtool supports shared libraries]) AC_MSG_RESULT([$can_build_shared]) AC_MSG_CHECKING([whether to build shared libraries]) test "$can_build_shared" = "no" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && enable_static=no fi ;; esac AC_MSG_RESULT([$enable_shared]) AC_MSG_CHECKING([whether to build static libraries]) # Make sure either enable_shared or enable_static is yes. test "$enable_shared" = yes || enable_static=yes AC_MSG_RESULT([$enable_static]) _LT_TAGVAR(GCC, $1)="$G77" _LT_TAGVAR(LD, $1)="$LD" ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi # test -n "$compiler" GCC=$lt_save_GCC CC="$lt_save_CC" CFLAGS="$lt_save_CFLAGS" fi # test "$_lt_disable_F77" != yes AC_LANG_POP ])# _LT_LANG_F77_CONFIG # _LT_LANG_FC_CONFIG([TAG]) # ------------------------- # Ensure that the configuration variables for a Fortran compiler are # suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to `libtool'. m4_defun([_LT_LANG_FC_CONFIG], [AC_LANG_PUSH(Fortran) if test -z "$FC" || test "X$FC" = "Xno"; then _lt_disable_FC=yes fi _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(allow_undefined_flag, $1)= _LT_TAGVAR(always_export_symbols, $1)=no _LT_TAGVAR(archive_expsym_cmds, $1)= _LT_TAGVAR(export_dynamic_flag_spec, $1)= _LT_TAGVAR(hardcode_direct, $1)=no _LT_TAGVAR(hardcode_direct_absolute, $1)=no _LT_TAGVAR(hardcode_libdir_flag_spec, $1)= _LT_TAGVAR(hardcode_libdir_separator, $1)= _LT_TAGVAR(hardcode_minus_L, $1)=no _LT_TAGVAR(hardcode_automatic, $1)=no _LT_TAGVAR(inherit_rpath, $1)=no _LT_TAGVAR(module_cmds, $1)= _LT_TAGVAR(module_expsym_cmds, $1)= _LT_TAGVAR(link_all_deplibs, $1)=unknown _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(reload_flag, $1)=$reload_flag _LT_TAGVAR(reload_cmds, $1)=$reload_cmds _LT_TAGVAR(no_undefined_flag, $1)= _LT_TAGVAR(whole_archive_flag_spec, $1)= _LT_TAGVAR(enable_shared_with_static_runtimes, $1)=no # Source file extension for fc test sources. ac_ext=${ac_fc_srcext-f} # Object file extension for compiled fc test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # No sense in running all these tests if we already determined that # the FC compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test "$_lt_disable_FC" != yes; then # Code to be used in simple compile tests lt_simple_compile_test_code="\ subroutine t return end " # Code to be used in simple link tests lt_simple_link_test_code="\ program t end " # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC="$CC" lt_save_GCC=$GCC lt_save_CFLAGS=$CFLAGS CC=${FC-"f95"} CFLAGS=$FCFLAGS compiler=$CC GCC=$ac_cv_fc_compiler_gnu _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) if test -n "$compiler"; then AC_MSG_CHECKING([if libtool supports shared libraries]) AC_MSG_RESULT([$can_build_shared]) AC_MSG_CHECKING([whether to build shared libraries]) test "$can_build_shared" = "no" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[[4-9]]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && enable_static=no fi ;; esac AC_MSG_RESULT([$enable_shared]) AC_MSG_CHECKING([whether to build static libraries]) # Make sure either enable_shared or enable_static is yes. test "$enable_shared" = yes || enable_static=yes AC_MSG_RESULT([$enable_static]) _LT_TAGVAR(GCC, $1)="$ac_cv_fc_compiler_gnu" _LT_TAGVAR(LD, $1)="$LD" ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... _LT_SYS_HIDDEN_LIBDEPS($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_SYS_DYNAMIC_LINKER($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi # test -n "$compiler" GCC=$lt_save_GCC CC=$lt_save_CC CFLAGS=$lt_save_CFLAGS fi # test "$_lt_disable_FC" != yes AC_LANG_POP ])# _LT_LANG_FC_CONFIG # _LT_LANG_GCJ_CONFIG([TAG]) # -------------------------- # Ensure that the configuration variables for the GNU Java Compiler compiler # are suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to `libtool'. m4_defun([_LT_LANG_GCJ_CONFIG], [AC_REQUIRE([LT_PROG_GCJ])dnl AC_LANG_SAVE # Source file extension for Java test sources. ac_ext=java # Object file extension for compiled Java test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="class foo {}" # Code to be used in simple link tests lt_simple_link_test_code='public class conftest { public static void main(String[[]] argv) {}; }' # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_CFLAGS=$CFLAGS lt_save_GCC=$GCC GCC=yes CC=${GCJ-"gcj"} CFLAGS=$GCJFLAGS compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_TAGVAR(LD, $1)="$LD" _LT_CC_BASENAME([$compiler]) # GCJ did not exist at the time GCC didn't implicitly link libc in. _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(reload_flag, $1)=$reload_flag _LT_TAGVAR(reload_cmds, $1)=$reload_cmds ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... if test -n "$compiler"; then _LT_COMPILER_NO_RTTI($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi AC_LANG_RESTORE GCC=$lt_save_GCC CC=$lt_save_CC CFLAGS=$lt_save_CFLAGS ])# _LT_LANG_GCJ_CONFIG # _LT_LANG_GO_CONFIG([TAG]) # -------------------------- # Ensure that the configuration variables for the GNU Go compiler # are suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to `libtool'. m4_defun([_LT_LANG_GO_CONFIG], [AC_REQUIRE([LT_PROG_GO])dnl AC_LANG_SAVE # Source file extension for Go test sources. ac_ext=go # Object file extension for compiled Go test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="package main; func main() { }" # Code to be used in simple link tests lt_simple_link_test_code='package main; func main() { }' # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_CFLAGS=$CFLAGS lt_save_GCC=$GCC GCC=yes CC=${GOC-"gccgo"} CFLAGS=$GOFLAGS compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_TAGVAR(LD, $1)="$LD" _LT_CC_BASENAME([$compiler]) # Go did not exist at the time GCC didn't implicitly link libc in. _LT_TAGVAR(archive_cmds_need_lc, $1)=no _LT_TAGVAR(old_archive_cmds, $1)=$old_archive_cmds _LT_TAGVAR(reload_flag, $1)=$reload_flag _LT_TAGVAR(reload_cmds, $1)=$reload_cmds ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... if test -n "$compiler"; then _LT_COMPILER_NO_RTTI($1) _LT_COMPILER_PIC($1) _LT_COMPILER_C_O($1) _LT_COMPILER_FILE_LOCKS($1) _LT_LINKER_SHLIBS($1) _LT_LINKER_HARDCODE_LIBPATH($1) _LT_CONFIG($1) fi AC_LANG_RESTORE GCC=$lt_save_GCC CC=$lt_save_CC CFLAGS=$lt_save_CFLAGS ])# _LT_LANG_GO_CONFIG # _LT_LANG_RC_CONFIG([TAG]) # ------------------------- # Ensure that the configuration variables for the Windows resource compiler # are suitably defined. These variables are subsequently used by _LT_CONFIG # to write the compiler configuration to `libtool'. m4_defun([_LT_LANG_RC_CONFIG], [AC_REQUIRE([LT_PROG_RC])dnl AC_LANG_SAVE # Source file extension for RC test sources. ac_ext=rc # Object file extension for compiled RC test sources. objext=o _LT_TAGVAR(objext, $1)=$objext # Code to be used in simple compile tests lt_simple_compile_test_code='sample MENU { MENUITEM "&Soup", 100, CHECKED }' # Code to be used in simple link tests lt_simple_link_test_code="$lt_simple_compile_test_code" # ltmain only uses $CC for tagged configurations so make sure $CC is set. _LT_TAG_COMPILER # save warnings/boilerplate of simple test code _LT_COMPILER_BOILERPLATE _LT_LINKER_BOILERPLATE # Allow CC to be a program name with arguments. lt_save_CC="$CC" lt_save_CFLAGS=$CFLAGS lt_save_GCC=$GCC GCC= CC=${RC-"windres"} CFLAGS= compiler=$CC _LT_TAGVAR(compiler, $1)=$CC _LT_CC_BASENAME([$compiler]) _LT_TAGVAR(lt_cv_prog_compiler_c_o, $1)=yes if test -n "$compiler"; then : _LT_CONFIG($1) fi GCC=$lt_save_GCC AC_LANG_RESTORE CC=$lt_save_CC CFLAGS=$lt_save_CFLAGS ])# _LT_LANG_RC_CONFIG # LT_PROG_GCJ # ----------- AC_DEFUN([LT_PROG_GCJ], [m4_ifdef([AC_PROG_GCJ], [AC_PROG_GCJ], [m4_ifdef([A][M_PROG_GCJ], [A][M_PROG_GCJ], [AC_CHECK_TOOL(GCJ, gcj,) test "x${GCJFLAGS+set}" = xset || GCJFLAGS="-g -O2" AC_SUBST(GCJFLAGS)])])[]dnl ]) # Old name: AU_ALIAS([LT_AC_PROG_GCJ], [LT_PROG_GCJ]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([LT_AC_PROG_GCJ], []) # LT_PROG_GO # ---------- AC_DEFUN([LT_PROG_GO], [AC_CHECK_TOOL(GOC, gccgo,) ]) # LT_PROG_RC # ---------- AC_DEFUN([LT_PROG_RC], [AC_CHECK_TOOL(RC, windres,) ]) # Old name: AU_ALIAS([LT_AC_PROG_RC], [LT_PROG_RC]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([LT_AC_PROG_RC], []) # _LT_DECL_EGREP # -------------- # If we don't have a new enough Autoconf to choose the best grep # available, choose the one first in the user's PATH. m4_defun([_LT_DECL_EGREP], [AC_REQUIRE([AC_PROG_EGREP])dnl AC_REQUIRE([AC_PROG_FGREP])dnl test -z "$GREP" && GREP=grep _LT_DECL([], [GREP], [1], [A grep program that handles long lines]) _LT_DECL([], [EGREP], [1], [An ERE matcher]) _LT_DECL([], [FGREP], [1], [A literal string matcher]) dnl Non-bleeding-edge autoconf doesn't subst GREP, so do it here too AC_SUBST([GREP]) ]) # _LT_DECL_OBJDUMP # -------------- # If we don't have a new enough Autoconf to choose the best objdump # available, choose the one first in the user's PATH. m4_defun([_LT_DECL_OBJDUMP], [AC_CHECK_TOOL(OBJDUMP, objdump, false) test -z "$OBJDUMP" && OBJDUMP=objdump _LT_DECL([], [OBJDUMP], [1], [An object symbol dumper]) AC_SUBST([OBJDUMP]) ]) # _LT_DECL_DLLTOOL # ---------------- # Ensure DLLTOOL variable is set. m4_defun([_LT_DECL_DLLTOOL], [AC_CHECK_TOOL(DLLTOOL, dlltool, false) test -z "$DLLTOOL" && DLLTOOL=dlltool _LT_DECL([], [DLLTOOL], [1], [DLL creation program]) AC_SUBST([DLLTOOL]) ]) # _LT_DECL_SED # ------------ # Check for a fully-functional sed program, that truncates # as few characters as possible. Prefer GNU sed if found. m4_defun([_LT_DECL_SED], [AC_PROG_SED test -z "$SED" && SED=sed Xsed="$SED -e 1s/^X//" _LT_DECL([], [SED], [1], [A sed program that does not truncate output]) _LT_DECL([], [Xsed], ["\$SED -e 1s/^X//"], [Sed that helps us avoid accidentally triggering echo(1) options like -n]) ])# _LT_DECL_SED m4_ifndef([AC_PROG_SED], [ ############################################################ # NOTE: This macro has been submitted for inclusion into # # GNU Autoconf as AC_PROG_SED. When it is available in # # a released version of Autoconf we should remove this # # macro and use it instead. # ############################################################ m4_defun([AC_PROG_SED], [AC_MSG_CHECKING([for a sed that does not truncate output]) AC_CACHE_VAL(lt_cv_path_SED, [# Loop through the user's path and test for sed and gsed. # Then use that list of sed's as ones to test for truncation. as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for lt_ac_prog in sed gsed; do for ac_exec_ext in '' $ac_executable_extensions; do if $as_executable_p "$as_dir/$lt_ac_prog$ac_exec_ext"; then lt_ac_sed_list="$lt_ac_sed_list $as_dir/$lt_ac_prog$ac_exec_ext" fi done done done IFS=$as_save_IFS lt_ac_max=0 lt_ac_count=0 # Add /usr/xpg4/bin/sed as it is typically found on Solaris # along with /bin/sed that truncates output. for lt_ac_sed in $lt_ac_sed_list /usr/xpg4/bin/sed; do test ! -f $lt_ac_sed && continue cat /dev/null > conftest.in lt_ac_count=0 echo $ECHO_N "0123456789$ECHO_C" >conftest.in # Check for GNU sed and select it if it is found. if "$lt_ac_sed" --version 2>&1 < /dev/null | grep 'GNU' > /dev/null; then lt_cv_path_SED=$lt_ac_sed break fi while true; do cat conftest.in conftest.in >conftest.tmp mv conftest.tmp conftest.in cp conftest.in conftest.nl echo >>conftest.nl $lt_ac_sed -e 's/a$//' < conftest.nl >conftest.out || break cmp -s conftest.out conftest.nl || break # 10000 chars as input seems more than enough test $lt_ac_count -gt 10 && break lt_ac_count=`expr $lt_ac_count + 1` if test $lt_ac_count -gt $lt_ac_max; then lt_ac_max=$lt_ac_count lt_cv_path_SED=$lt_ac_sed fi done done ]) SED=$lt_cv_path_SED AC_SUBST([SED]) AC_MSG_RESULT([$SED]) ])#AC_PROG_SED ])#m4_ifndef # Old name: AU_ALIAS([LT_AC_PROG_SED], [AC_PROG_SED]) dnl aclocal-1.4 backwards compatibility: dnl AC_DEFUN([LT_AC_PROG_SED], []) # _LT_CHECK_SHELL_FEATURES # ------------------------ # Find out whether the shell is Bourne or XSI compatible, # or has some other useful features. m4_defun([_LT_CHECK_SHELL_FEATURES], [AC_MSG_CHECKING([whether the shell understands some XSI constructs]) # Try some XSI features xsi_shell=no ( _lt_dummy="a/b/c" test "${_lt_dummy##*/},${_lt_dummy%/*},${_lt_dummy#??}"${_lt_dummy%"$_lt_dummy"}, \ = c,a/b,b/c, \ && eval 'test $(( 1 + 1 )) -eq 2 \ && test "${#_lt_dummy}" -eq 5' ) >/dev/null 2>&1 \ && xsi_shell=yes AC_MSG_RESULT([$xsi_shell]) _LT_CONFIG_LIBTOOL_INIT([xsi_shell='$xsi_shell']) AC_MSG_CHECKING([whether the shell understands "+="]) lt_shell_append=no ( foo=bar; set foo baz; eval "$[1]+=\$[2]" && test "$foo" = barbaz ) \ >/dev/null 2>&1 \ && lt_shell_append=yes AC_MSG_RESULT([$lt_shell_append]) _LT_CONFIG_LIBTOOL_INIT([lt_shell_append='$lt_shell_append']) if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then lt_unset=unset else lt_unset=false fi _LT_DECL([], [lt_unset], [0], [whether the shell understands "unset"])dnl # test EBCDIC or ASCII case `echo X|tr X '\101'` in A) # ASCII based system # \n is not interpreted correctly by Solaris 8 /usr/ucb/tr lt_SP2NL='tr \040 \012' lt_NL2SP='tr \015\012 \040\040' ;; *) # EBCDIC based system lt_SP2NL='tr \100 \n' lt_NL2SP='tr \r\n \100\100' ;; esac _LT_DECL([SP2NL], [lt_SP2NL], [1], [turn spaces into newlines])dnl _LT_DECL([NL2SP], [lt_NL2SP], [1], [turn newlines into spaces])dnl ])# _LT_CHECK_SHELL_FEATURES # _LT_PROG_FUNCTION_REPLACE (FUNCNAME, REPLACEMENT-BODY) # ------------------------------------------------------ # In `$cfgfile', look for function FUNCNAME delimited by `^FUNCNAME ()$' and # '^} FUNCNAME ', and replace its body with REPLACEMENT-BODY. m4_defun([_LT_PROG_FUNCTION_REPLACE], [dnl { sed -e '/^$1 ()$/,/^} # $1 /c\ $1 ()\ {\ m4_bpatsubsts([$2], [$], [\\], [^\([ ]\)], [\\\1]) } # Extended-shell $1 implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: ]) # _LT_PROG_REPLACE_SHELLFNS # ------------------------- # Replace existing portable implementations of several shell functions with # equivalent extended shell implementations where those features are available.. m4_defun([_LT_PROG_REPLACE_SHELLFNS], [if test x"$xsi_shell" = xyes; then _LT_PROG_FUNCTION_REPLACE([func_dirname], [dnl case ${1} in */*) func_dirname_result="${1%/*}${2}" ;; * ) func_dirname_result="${3}" ;; esac]) _LT_PROG_FUNCTION_REPLACE([func_basename], [dnl func_basename_result="${1##*/}"]) _LT_PROG_FUNCTION_REPLACE([func_dirname_and_basename], [dnl case ${1} in */*) func_dirname_result="${1%/*}${2}" ;; * ) func_dirname_result="${3}" ;; esac func_basename_result="${1##*/}"]) _LT_PROG_FUNCTION_REPLACE([func_stripname], [dnl # pdksh 5.2.14 does not do ${X%$Y} correctly if both X and Y are # positional parameters, so assign one to ordinary parameter first. func_stripname_result=${3} func_stripname_result=${func_stripname_result#"${1}"} func_stripname_result=${func_stripname_result%"${2}"}]) _LT_PROG_FUNCTION_REPLACE([func_split_long_opt], [dnl func_split_long_opt_name=${1%%=*} func_split_long_opt_arg=${1#*=}]) _LT_PROG_FUNCTION_REPLACE([func_split_short_opt], [dnl func_split_short_opt_arg=${1#??} func_split_short_opt_name=${1%"$func_split_short_opt_arg"}]) _LT_PROG_FUNCTION_REPLACE([func_lo2o], [dnl case ${1} in *.lo) func_lo2o_result=${1%.lo}.${objext} ;; *) func_lo2o_result=${1} ;; esac]) _LT_PROG_FUNCTION_REPLACE([func_xform], [ func_xform_result=${1%.*}.lo]) _LT_PROG_FUNCTION_REPLACE([func_arith], [ func_arith_result=$(( $[*] ))]) _LT_PROG_FUNCTION_REPLACE([func_len], [ func_len_result=${#1}]) fi if test x"$lt_shell_append" = xyes; then _LT_PROG_FUNCTION_REPLACE([func_append], [ eval "${1}+=\\${2}"]) _LT_PROG_FUNCTION_REPLACE([func_append_quoted], [dnl func_quote_for_eval "${2}" dnl m4 expansion turns \\\\ into \\, and then the shell eval turns that into \ eval "${1}+=\\\\ \\$func_quote_for_eval_result"]) # Save a `func_append' function call where possible by direct use of '+=' sed -e 's%func_append \([[a-zA-Z_]]\{1,\}\) "%\1+="%g' $cfgfile > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: else # Save a `func_append' function call even when '+=' is not available sed -e 's%func_append \([[a-zA-Z_]]\{1,\}\) "%\1="$\1%g' $cfgfile > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: fi if test x"$_lt_function_replace_fail" = x":"; then AC_MSG_WARN([Unable to substitute extended shell functions in $ofile]) fi ]) # _LT_PATH_CONVERSION_FUNCTIONS # ----------------------------- # Determine which file name conversion functions should be used by # func_to_host_file (and, implicitly, by func_to_host_path). These are needed # for certain cross-compile configurations and native mingw. m4_defun([_LT_PATH_CONVERSION_FUNCTIONS], [AC_REQUIRE([AC_CANONICAL_HOST])dnl AC_REQUIRE([AC_CANONICAL_BUILD])dnl AC_MSG_CHECKING([how to convert $build file names to $host format]) AC_CACHE_VAL(lt_cv_to_host_file_cmd, [case $host in *-*-mingw* ) case $build in *-*-mingw* ) # actually msys lt_cv_to_host_file_cmd=func_convert_file_msys_to_w32 ;; *-*-cygwin* ) lt_cv_to_host_file_cmd=func_convert_file_cygwin_to_w32 ;; * ) # otherwise, assume *nix lt_cv_to_host_file_cmd=func_convert_file_nix_to_w32 ;; esac ;; *-*-cygwin* ) case $build in *-*-mingw* ) # actually msys lt_cv_to_host_file_cmd=func_convert_file_msys_to_cygwin ;; *-*-cygwin* ) lt_cv_to_host_file_cmd=func_convert_file_noop ;; * ) # otherwise, assume *nix lt_cv_to_host_file_cmd=func_convert_file_nix_to_cygwin ;; esac ;; * ) # unhandled hosts (and "normal" native builds) lt_cv_to_host_file_cmd=func_convert_file_noop ;; esac ]) to_host_file_cmd=$lt_cv_to_host_file_cmd AC_MSG_RESULT([$lt_cv_to_host_file_cmd]) _LT_DECL([to_host_file_cmd], [lt_cv_to_host_file_cmd], [0], [convert $build file names to $host format])dnl AC_MSG_CHECKING([how to convert $build file names to toolchain format]) AC_CACHE_VAL(lt_cv_to_tool_file_cmd, [#assume ordinary cross tools, or native build. lt_cv_to_tool_file_cmd=func_convert_file_noop case $host in *-*-mingw* ) case $build in *-*-mingw* ) # actually msys lt_cv_to_tool_file_cmd=func_convert_file_msys_to_w32 ;; esac ;; esac ]) to_tool_file_cmd=$lt_cv_to_tool_file_cmd AC_MSG_RESULT([$lt_cv_to_tool_file_cmd]) _LT_DECL([to_tool_file_cmd], [lt_cv_to_tool_file_cmd], [0], [convert $build files to toolchain format])dnl ])# _LT_PATH_CONVERSION_FUNCTIONS madp-0.4/m4/PaxHeaders.5405/lt~obsolete.m40000644000000000000000000000013212717644303015113 xustar0030 mtime=1463765187.245663102 30 atime=1463765191.441629591 30 ctime=1463765201.005553204 madp-0.4/m4/lt~obsolete.m40000644000372100037210000001375612717644303015761 0ustar00fransfrans00000000000000# lt~obsolete.m4 -- aclocal satisfying obsolete definitions. -*-Autoconf-*- # # Copyright (C) 2004, 2005, 2007, 2009 Free Software Foundation, Inc. # Written by Scott James Remnant, 2004. # # This file is free software; the Free Software Foundation gives # unlimited permission to copy and/or distribute it, with or without # modifications, as long as this notice is preserved. # serial 5 lt~obsolete.m4 # These exist entirely to fool aclocal when bootstrapping libtool. # # In the past libtool.m4 has provided macros via AC_DEFUN (or AU_DEFUN) # which have later been changed to m4_define as they aren't part of the # exported API, or moved to Autoconf or Automake where they belong. # # The trouble is, aclocal is a bit thick. It'll see the old AC_DEFUN # in /usr/share/aclocal/libtool.m4 and remember it, then when it sees us # using a macro with the same name in our local m4/libtool.m4 it'll # pull the old libtool.m4 in (it doesn't see our shiny new m4_define # and doesn't know about Autoconf macros at all.) # # So we provide this file, which has a silly filename so it's always # included after everything else. This provides aclocal with the # AC_DEFUNs it wants, but when m4 processes it, it doesn't do anything # because those macros already exist, or will be overwritten later. # We use AC_DEFUN over AU_DEFUN for compatibility with aclocal-1.6. # # Anytime we withdraw an AC_DEFUN or AU_DEFUN, remember to add it here. # Yes, that means every name once taken will need to remain here until # we give up compatibility with versions before 1.7, at which point # we need to keep only those names which we still refer to. # This is to help aclocal find these macros, as it can't see m4_define. AC_DEFUN([LTOBSOLETE_VERSION], [m4_if([1])]) m4_ifndef([AC_LIBTOOL_LINKER_OPTION], [AC_DEFUN([AC_LIBTOOL_LINKER_OPTION])]) m4_ifndef([AC_PROG_EGREP], [AC_DEFUN([AC_PROG_EGREP])]) m4_ifndef([_LT_AC_PROG_ECHO_BACKSLASH], [AC_DEFUN([_LT_AC_PROG_ECHO_BACKSLASH])]) m4_ifndef([_LT_AC_SHELL_INIT], [AC_DEFUN([_LT_AC_SHELL_INIT])]) m4_ifndef([_LT_AC_SYS_LIBPATH_AIX], [AC_DEFUN([_LT_AC_SYS_LIBPATH_AIX])]) m4_ifndef([_LT_PROG_LTMAIN], [AC_DEFUN([_LT_PROG_LTMAIN])]) m4_ifndef([_LT_AC_TAGVAR], [AC_DEFUN([_LT_AC_TAGVAR])]) m4_ifndef([AC_LTDL_ENABLE_INSTALL], [AC_DEFUN([AC_LTDL_ENABLE_INSTALL])]) m4_ifndef([AC_LTDL_PREOPEN], [AC_DEFUN([AC_LTDL_PREOPEN])]) m4_ifndef([_LT_AC_SYS_COMPILER], [AC_DEFUN([_LT_AC_SYS_COMPILER])]) m4_ifndef([_LT_AC_LOCK], [AC_DEFUN([_LT_AC_LOCK])]) m4_ifndef([AC_LIBTOOL_SYS_OLD_ARCHIVE], [AC_DEFUN([AC_LIBTOOL_SYS_OLD_ARCHIVE])]) m4_ifndef([_LT_AC_TRY_DLOPEN_SELF], [AC_DEFUN([_LT_AC_TRY_DLOPEN_SELF])]) m4_ifndef([AC_LIBTOOL_PROG_CC_C_O], [AC_DEFUN([AC_LIBTOOL_PROG_CC_C_O])]) m4_ifndef([AC_LIBTOOL_SYS_HARD_LINK_LOCKS], [AC_DEFUN([AC_LIBTOOL_SYS_HARD_LINK_LOCKS])]) m4_ifndef([AC_LIBTOOL_OBJDIR], [AC_DEFUN([AC_LIBTOOL_OBJDIR])]) m4_ifndef([AC_LTDL_OBJDIR], [AC_DEFUN([AC_LTDL_OBJDIR])]) m4_ifndef([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH], [AC_DEFUN([AC_LIBTOOL_PROG_LD_HARDCODE_LIBPATH])]) m4_ifndef([AC_LIBTOOL_SYS_LIB_STRIP], [AC_DEFUN([AC_LIBTOOL_SYS_LIB_STRIP])]) m4_ifndef([AC_PATH_MAGIC], [AC_DEFUN([AC_PATH_MAGIC])]) m4_ifndef([AC_PROG_LD_GNU], [AC_DEFUN([AC_PROG_LD_GNU])]) m4_ifndef([AC_PROG_LD_RELOAD_FLAG], [AC_DEFUN([AC_PROG_LD_RELOAD_FLAG])]) m4_ifndef([AC_DEPLIBS_CHECK_METHOD], [AC_DEFUN([AC_DEPLIBS_CHECK_METHOD])]) m4_ifndef([AC_LIBTOOL_PROG_COMPILER_NO_RTTI], [AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_NO_RTTI])]) m4_ifndef([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE], [AC_DEFUN([AC_LIBTOOL_SYS_GLOBAL_SYMBOL_PIPE])]) m4_ifndef([AC_LIBTOOL_PROG_COMPILER_PIC], [AC_DEFUN([AC_LIBTOOL_PROG_COMPILER_PIC])]) m4_ifndef([AC_LIBTOOL_PROG_LD_SHLIBS], [AC_DEFUN([AC_LIBTOOL_PROG_LD_SHLIBS])]) m4_ifndef([AC_LIBTOOL_POSTDEP_PREDEP], [AC_DEFUN([AC_LIBTOOL_POSTDEP_PREDEP])]) m4_ifndef([LT_AC_PROG_EGREP], [AC_DEFUN([LT_AC_PROG_EGREP])]) m4_ifndef([LT_AC_PROG_SED], [AC_DEFUN([LT_AC_PROG_SED])]) m4_ifndef([_LT_CC_BASENAME], [AC_DEFUN([_LT_CC_BASENAME])]) m4_ifndef([_LT_COMPILER_BOILERPLATE], [AC_DEFUN([_LT_COMPILER_BOILERPLATE])]) m4_ifndef([_LT_LINKER_BOILERPLATE], [AC_DEFUN([_LT_LINKER_BOILERPLATE])]) m4_ifndef([_AC_PROG_LIBTOOL], [AC_DEFUN([_AC_PROG_LIBTOOL])]) m4_ifndef([AC_LIBTOOL_SETUP], [AC_DEFUN([AC_LIBTOOL_SETUP])]) m4_ifndef([_LT_AC_CHECK_DLFCN], [AC_DEFUN([_LT_AC_CHECK_DLFCN])]) m4_ifndef([AC_LIBTOOL_SYS_DYNAMIC_LINKER], [AC_DEFUN([AC_LIBTOOL_SYS_DYNAMIC_LINKER])]) m4_ifndef([_LT_AC_TAGCONFIG], [AC_DEFUN([_LT_AC_TAGCONFIG])]) m4_ifndef([AC_DISABLE_FAST_INSTALL], [AC_DEFUN([AC_DISABLE_FAST_INSTALL])]) m4_ifndef([_LT_AC_LANG_CXX], [AC_DEFUN([_LT_AC_LANG_CXX])]) m4_ifndef([_LT_AC_LANG_F77], [AC_DEFUN([_LT_AC_LANG_F77])]) m4_ifndef([_LT_AC_LANG_GCJ], [AC_DEFUN([_LT_AC_LANG_GCJ])]) m4_ifndef([AC_LIBTOOL_LANG_C_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_C_CONFIG])]) m4_ifndef([_LT_AC_LANG_C_CONFIG], [AC_DEFUN([_LT_AC_LANG_C_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_CXX_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_CXX_CONFIG])]) m4_ifndef([_LT_AC_LANG_CXX_CONFIG], [AC_DEFUN([_LT_AC_LANG_CXX_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_F77_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_F77_CONFIG])]) m4_ifndef([_LT_AC_LANG_F77_CONFIG], [AC_DEFUN([_LT_AC_LANG_F77_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_GCJ_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_GCJ_CONFIG])]) m4_ifndef([_LT_AC_LANG_GCJ_CONFIG], [AC_DEFUN([_LT_AC_LANG_GCJ_CONFIG])]) m4_ifndef([AC_LIBTOOL_LANG_RC_CONFIG], [AC_DEFUN([AC_LIBTOOL_LANG_RC_CONFIG])]) m4_ifndef([_LT_AC_LANG_RC_CONFIG], [AC_DEFUN([_LT_AC_LANG_RC_CONFIG])]) m4_ifndef([AC_LIBTOOL_CONFIG], [AC_DEFUN([AC_LIBTOOL_CONFIG])]) m4_ifndef([_LT_AC_FILE_LTDLL_C], [AC_DEFUN([_LT_AC_FILE_LTDLL_C])]) m4_ifndef([_LT_REQUIRED_DARWIN_CHECKS], [AC_DEFUN([_LT_REQUIRED_DARWIN_CHECKS])]) m4_ifndef([_LT_AC_PROG_CXXCPP], [AC_DEFUN([_LT_AC_PROG_CXXCPP])]) m4_ifndef([_LT_PREPARE_SED_QUOTE_VARS], [AC_DEFUN([_LT_PREPARE_SED_QUOTE_VARS])]) m4_ifndef([_LT_PROG_ECHO_BACKSLASH], [AC_DEFUN([_LT_PROG_ECHO_BACKSLASH])]) m4_ifndef([_LT_PROG_F77], [AC_DEFUN([_LT_PROG_F77])]) m4_ifndef([_LT_PROG_FC], [AC_DEFUN([_LT_PROG_FC])]) m4_ifndef([_LT_PROG_CXX], [AC_DEFUN([_LT_PROG_CXX])]) madp-0.4/PaxHeaders.5405/install-sh0000644000000000000000000000013212717644307013764 xustar0030 mtime=1463765191.889626013 30 atime=1463765191.889626013 30 ctime=1463765201.013553139 madp-0.4/install-sh0000755000372100037210000003325512717644307014631 0ustar00fransfrans00000000000000#!/bin/sh # install - install a program, script, or datafile scriptversion=2011-11-20.07; # UTC # This originates from X11R5 (mit/util/scripts/install.sh), which was # later released in X11R6 (xc/config/util/install.sh) with the # following copyright and license. # # Copyright (C) 1994 X Consortium # # Permission is hereby granted, free of charge, to any person obtaining a copy # of this software and associated documentation files (the "Software"), to # deal in the Software without restriction, including without limitation the # rights to use, copy, modify, merge, publish, distribute, sublicense, and/or # sell copies of the Software, and to permit persons to whom the Software is # furnished to do so, subject to the following conditions: # # The above copyright notice and this permission notice shall be included in # all copies or substantial portions of the Software. # # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR # IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, # FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE # X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN # AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNEC- # TION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. # # Except as contained in this notice, the name of the X Consortium shall not # be used in advertising or otherwise to promote the sale, use or other deal- # ings in this Software without prior written authorization from the X Consor- # tium. # # # FSF changes to this file are in the public domain. # # Calling this script install-sh is preferred over install.sh, to prevent # 'make' implicit rules from creating a file called install from it # when there is no Makefile. # # This script is compatible with the BSD install script, but was written # from scratch. nl=' ' IFS=" "" $nl" # set DOITPROG to echo to test this script # Don't use :- since 4.3BSD and earlier shells don't like it. doit=${DOITPROG-} if test -z "$doit"; then doit_exec=exec else doit_exec=$doit fi # Put in absolute file names if you don't have them in your path; # or use environment vars. chgrpprog=${CHGRPPROG-chgrp} chmodprog=${CHMODPROG-chmod} chownprog=${CHOWNPROG-chown} cmpprog=${CMPPROG-cmp} cpprog=${CPPROG-cp} mkdirprog=${MKDIRPROG-mkdir} mvprog=${MVPROG-mv} rmprog=${RMPROG-rm} stripprog=${STRIPPROG-strip} posix_glob='?' initialize_posix_glob=' test "$posix_glob" != "?" || { if (set -f) 2>/dev/null; then posix_glob= else posix_glob=: fi } ' posix_mkdir= # Desired mode of installed file. mode=0755 chgrpcmd= chmodcmd=$chmodprog chowncmd= mvcmd=$mvprog rmcmd="$rmprog -f" stripcmd= src= dst= dir_arg= dst_arg= copy_on_change=false no_target_directory= usage="\ Usage: $0 [OPTION]... [-T] SRCFILE DSTFILE or: $0 [OPTION]... SRCFILES... DIRECTORY or: $0 [OPTION]... -t DIRECTORY SRCFILES... or: $0 [OPTION]... -d DIRECTORIES... In the 1st form, copy SRCFILE to DSTFILE. In the 2nd and 3rd, copy all SRCFILES to DIRECTORY. In the 4th, create DIRECTORIES. Options: --help display this help and exit. --version display version info and exit. -c (ignored) -C install only if different (preserve the last data modification time) -d create directories instead of installing files. -g GROUP $chgrpprog installed files to GROUP. -m MODE $chmodprog installed files to MODE. -o USER $chownprog installed files to USER. -s $stripprog installed files. -t DIRECTORY install into DIRECTORY. -T report an error if DSTFILE is a directory. Environment variables override the default commands: CHGRPPROG CHMODPROG CHOWNPROG CMPPROG CPPROG MKDIRPROG MVPROG RMPROG STRIPPROG " while test $# -ne 0; do case $1 in -c) ;; -C) copy_on_change=true;; -d) dir_arg=true;; -g) chgrpcmd="$chgrpprog $2" shift;; --help) echo "$usage"; exit $?;; -m) mode=$2 case $mode in *' '* | *' '* | *' '* | *'*'* | *'?'* | *'['*) echo "$0: invalid mode: $mode" >&2 exit 1;; esac shift;; -o) chowncmd="$chownprog $2" shift;; -s) stripcmd=$stripprog;; -t) dst_arg=$2 # Protect names problematic for 'test' and other utilities. case $dst_arg in -* | [=\(\)!]) dst_arg=./$dst_arg;; esac shift;; -T) no_target_directory=true;; --version) echo "$0 $scriptversion"; exit $?;; --) shift break;; -*) echo "$0: invalid option: $1" >&2 exit 1;; *) break;; esac shift done if test $# -ne 0 && test -z "$dir_arg$dst_arg"; then # When -d is used, all remaining arguments are directories to create. # When -t is used, the destination is already specified. # Otherwise, the last argument is the destination. Remove it from $@. for arg do if test -n "$dst_arg"; then # $@ is not empty: it contains at least $arg. set fnord "$@" "$dst_arg" shift # fnord fi shift # arg dst_arg=$arg # Protect names problematic for 'test' and other utilities. case $dst_arg in -* | [=\(\)!]) dst_arg=./$dst_arg;; esac done fi if test $# -eq 0; then if test -z "$dir_arg"; then echo "$0: no input file specified." >&2 exit 1 fi # It's OK to call 'install-sh -d' without argument. # This can happen when creating conditional directories. exit 0 fi if test -z "$dir_arg"; then do_exit='(exit $ret); exit $ret' trap "ret=129; $do_exit" 1 trap "ret=130; $do_exit" 2 trap "ret=141; $do_exit" 13 trap "ret=143; $do_exit" 15 # Set umask so as not to create temps with too-generous modes. # However, 'strip' requires both read and write access to temps. case $mode in # Optimize common cases. *644) cp_umask=133;; *755) cp_umask=22;; *[0-7]) if test -z "$stripcmd"; then u_plus_rw= else u_plus_rw='% 200' fi cp_umask=`expr '(' 777 - $mode % 1000 ')' $u_plus_rw`;; *) if test -z "$stripcmd"; then u_plus_rw= else u_plus_rw=,u+rw fi cp_umask=$mode$u_plus_rw;; esac fi for src do # Protect names problematic for 'test' and other utilities. case $src in -* | [=\(\)!]) src=./$src;; esac if test -n "$dir_arg"; then dst=$src dstdir=$dst test -d "$dstdir" dstdir_status=$? else # Waiting for this to be detected by the "$cpprog $src $dsttmp" command # might cause directories to be created, which would be especially bad # if $src (and thus $dsttmp) contains '*'. if test ! -f "$src" && test ! -d "$src"; then echo "$0: $src does not exist." >&2 exit 1 fi if test -z "$dst_arg"; then echo "$0: no destination specified." >&2 exit 1 fi dst=$dst_arg # If destination is a directory, append the input filename; won't work # if double slashes aren't ignored. if test -d "$dst"; then if test -n "$no_target_directory"; then echo "$0: $dst_arg: Is a directory" >&2 exit 1 fi dstdir=$dst dst=$dstdir/`basename "$src"` dstdir_status=0 else # Prefer dirname, but fall back on a substitute if dirname fails. dstdir=` (dirname "$dst") 2>/dev/null || expr X"$dst" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$dst" : 'X\(//\)[^/]' \| \ X"$dst" : 'X\(//\)$' \| \ X"$dst" : 'X\(/\)' \| . 2>/dev/null || echo X"$dst" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q' ` test -d "$dstdir" dstdir_status=$? fi fi obsolete_mkdir_used=false if test $dstdir_status != 0; then case $posix_mkdir in '') # Create intermediate dirs using mode 755 as modified by the umask. # This is like FreeBSD 'install' as of 1997-10-28. umask=`umask` case $stripcmd.$umask in # Optimize common cases. *[2367][2367]) mkdir_umask=$umask;; .*0[02][02] | .[02][02] | .[02]) mkdir_umask=22;; *[0-7]) mkdir_umask=`expr $umask + 22 \ - $umask % 100 % 40 + $umask % 20 \ - $umask % 10 % 4 + $umask % 2 `;; *) mkdir_umask=$umask,go-w;; esac # With -d, create the new directory with the user-specified mode. # Otherwise, rely on $mkdir_umask. if test -n "$dir_arg"; then mkdir_mode=-m$mode else mkdir_mode= fi posix_mkdir=false case $umask in *[123567][0-7][0-7]) # POSIX mkdir -p sets u+wx bits regardless of umask, which # is incompatible with FreeBSD 'install' when (umask & 300) != 0. ;; *) tmpdir=${TMPDIR-/tmp}/ins$RANDOM-$$ trap 'ret=$?; rmdir "$tmpdir/d" "$tmpdir" 2>/dev/null; exit $ret' 0 if (umask $mkdir_umask && exec $mkdirprog $mkdir_mode -p -- "$tmpdir/d") >/dev/null 2>&1 then if test -z "$dir_arg" || { # Check for POSIX incompatibilities with -m. # HP-UX 11.23 and IRIX 6.5 mkdir -m -p sets group- or # other-writable bit of parent directory when it shouldn't. # FreeBSD 6.1 mkdir -m -p sets mode of existing directory. ls_ld_tmpdir=`ls -ld "$tmpdir"` case $ls_ld_tmpdir in d????-?r-*) different_mode=700;; d????-?--*) different_mode=755;; *) false;; esac && $mkdirprog -m$different_mode -p -- "$tmpdir" && { ls_ld_tmpdir_1=`ls -ld "$tmpdir"` test "$ls_ld_tmpdir" = "$ls_ld_tmpdir_1" } } then posix_mkdir=: fi rmdir "$tmpdir/d" "$tmpdir" else # Remove any dirs left behind by ancient mkdir implementations. rmdir ./$mkdir_mode ./-p ./-- 2>/dev/null fi trap '' 0;; esac;; esac if $posix_mkdir && ( umask $mkdir_umask && $doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir" ) then : else # The umask is ridiculous, or mkdir does not conform to POSIX, # or it failed possibly due to a race condition. Create the # directory the slow way, step by step, checking for races as we go. case $dstdir in /*) prefix='/';; [-=\(\)!]*) prefix='./';; *) prefix='';; esac eval "$initialize_posix_glob" oIFS=$IFS IFS=/ $posix_glob set -f set fnord $dstdir shift $posix_glob set +f IFS=$oIFS prefixes= for d do test X"$d" = X && continue prefix=$prefix$d if test -d "$prefix"; then prefixes= else if $posix_mkdir; then (umask=$mkdir_umask && $doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir") && break # Don't fail if two instances are running concurrently. test -d "$prefix" || exit 1 else case $prefix in *\'*) qprefix=`echo "$prefix" | sed "s/'/'\\\\\\\\''/g"`;; *) qprefix=$prefix;; esac prefixes="$prefixes '$qprefix'" fi fi prefix=$prefix/ done if test -n "$prefixes"; then # Don't fail if two instances are running concurrently. (umask $mkdir_umask && eval "\$doit_exec \$mkdirprog $prefixes") || test -d "$dstdir" || exit 1 obsolete_mkdir_used=true fi fi fi if test -n "$dir_arg"; then { test -z "$chowncmd" || $doit $chowncmd "$dst"; } && { test -z "$chgrpcmd" || $doit $chgrpcmd "$dst"; } && { test "$obsolete_mkdir_used$chowncmd$chgrpcmd" = false || test -z "$chmodcmd" || $doit $chmodcmd $mode "$dst"; } || exit 1 else # Make a couple of temp file names in the proper directory. dsttmp=$dstdir/_inst.$$_ rmtmp=$dstdir/_rm.$$_ # Trap to clean up those temp files at exit. trap 'ret=$?; rm -f "$dsttmp" "$rmtmp" && exit $ret' 0 # Copy the file name to the temp name. (umask $cp_umask && $doit_exec $cpprog "$src" "$dsttmp") && # and set any options; do chmod last to preserve setuid bits. # # If any of these fail, we abort the whole thing. If we want to # ignore errors from any of these, just make sure not to ignore # errors from the above "$doit $cpprog $src $dsttmp" command. # { test -z "$chowncmd" || $doit $chowncmd "$dsttmp"; } && { test -z "$chgrpcmd" || $doit $chgrpcmd "$dsttmp"; } && { test -z "$stripcmd" || $doit $stripcmd "$dsttmp"; } && { test -z "$chmodcmd" || $doit $chmodcmd $mode "$dsttmp"; } && # If -C, don't bother to copy if it wouldn't change the file. if $copy_on_change && old=`LC_ALL=C ls -dlL "$dst" 2>/dev/null` && new=`LC_ALL=C ls -dlL "$dsttmp" 2>/dev/null` && eval "$initialize_posix_glob" && $posix_glob set -f && set X $old && old=:$2:$4:$5:$6 && set X $new && new=:$2:$4:$5:$6 && $posix_glob set +f && test "$old" = "$new" && $cmpprog "$dst" "$dsttmp" >/dev/null 2>&1 then rm -f "$dsttmp" else # Rename the file to the real destination. $doit $mvcmd -f "$dsttmp" "$dst" 2>/dev/null || # The rename failed, perhaps because mv can't rename something else # to itself, or perhaps because mv is so ancient that it does not # support -f. { # Now remove or move aside any old file at destination location. # We try this two ways since rm can't unlink itself on some # systems and the destination file might be busy for other # reasons. In this case, the final cleanup might fail but the new # file should still install successfully. { test ! -f "$dst" || $doit $rmcmd -f "$dst" 2>/dev/null || { $doit $mvcmd -f "$dst" "$rmtmp" 2>/dev/null && { $doit $rmcmd -f "$rmtmp" 2>/dev/null; :; } } || { echo "$0: cannot unlink or rename $dst" >&2 (exit 1); exit 1 } } && # Now rename the file to the real destination. $doit $mvcmd "$dsttmp" "$dst" } fi || exit 1 trap '' 0 fi done # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "scriptversion=" # time-stamp-format: "%:y-%02m-%02d.%02H" # time-stamp-time-zone: "UTC" # time-stamp-end: "; # UTC" # End: madp-0.4/PaxHeaders.5405/aclocal.m40000644000000000000000000000013212717644305013621 xustar0030 mtime=1463765189.505645053 30 atime=1463765193.381614097 30 ctime=1463765201.009553172 madp-0.4/aclocal.m40000664000372100037210000012217112717644305014461 0ustar00fransfrans00000000000000# generated automatically by aclocal 1.14.1 -*- Autoconf -*- # Copyright (C) 1996-2013 Free Software Foundation, Inc. # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. m4_ifndef([AC_CONFIG_MACRO_DIRS], [m4_defun([_AM_CONFIG_MACRO_DIRS], [])m4_defun([AC_CONFIG_MACRO_DIRS], [_AM_CONFIG_MACRO_DIRS($@)])]) m4_ifndef([AC_AUTOCONF_VERSION], [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl m4_if(m4_defn([AC_AUTOCONF_VERSION]), [2.69],, [m4_warning([this file was generated for autoconf 2.69. You have another version of autoconf. It may work, but is not guaranteed to. If you have problems, you may need to regenerate the build system entirely. To do so, use the procedure documented by the package, typically 'autoreconf'.])]) # Copyright (C) 2002-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_AUTOMAKE_VERSION(VERSION) # ---------------------------- # Automake X.Y traces this macro to ensure aclocal.m4 has been # generated from the m4 files accompanying Automake X.Y. # (This private macro should not be called outside this file.) AC_DEFUN([AM_AUTOMAKE_VERSION], [am__api_version='1.14' dnl Some users find AM_AUTOMAKE_VERSION and mistake it for a way to dnl require some minimum version. Point them to the right macro. m4_if([$1], [1.14.1], [], [AC_FATAL([Do not call $0, use AM_INIT_AUTOMAKE([$1]).])])dnl ]) # _AM_AUTOCONF_VERSION(VERSION) # ----------------------------- # aclocal traces this macro to find the Autoconf version. # This is a private macro too. Using m4_define simplifies # the logic in aclocal, which can simply ignore this definition. m4_define([_AM_AUTOCONF_VERSION], []) # AM_SET_CURRENT_AUTOMAKE_VERSION # ------------------------------- # Call AM_AUTOMAKE_VERSION and AM_AUTOMAKE_VERSION so they can be traced. # This function is AC_REQUIREd by AM_INIT_AUTOMAKE. AC_DEFUN([AM_SET_CURRENT_AUTOMAKE_VERSION], [AM_AUTOMAKE_VERSION([1.14.1])dnl m4_ifndef([AC_AUTOCONF_VERSION], [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl _AM_AUTOCONF_VERSION(m4_defn([AC_AUTOCONF_VERSION]))]) # AM_AUX_DIR_EXPAND -*- Autoconf -*- # Copyright (C) 2001-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # For projects using AC_CONFIG_AUX_DIR([foo]), Autoconf sets # $ac_aux_dir to '$srcdir/foo'. In other projects, it is set to # '$srcdir', '$srcdir/..', or '$srcdir/../..'. # # Of course, Automake must honor this variable whenever it calls a # tool from the auxiliary directory. The problem is that $srcdir (and # therefore $ac_aux_dir as well) can be either absolute or relative, # depending on how configure is run. This is pretty annoying, since # it makes $ac_aux_dir quite unusable in subdirectories: in the top # source directory, any form will work fine, but in subdirectories a # relative path needs to be adjusted first. # # $ac_aux_dir/missing # fails when called from a subdirectory if $ac_aux_dir is relative # $top_srcdir/$ac_aux_dir/missing # fails if $ac_aux_dir is absolute, # fails when called from a subdirectory in a VPATH build with # a relative $ac_aux_dir # # The reason of the latter failure is that $top_srcdir and $ac_aux_dir # are both prefixed by $srcdir. In an in-source build this is usually # harmless because $srcdir is '.', but things will broke when you # start a VPATH build or use an absolute $srcdir. # # So we could use something similar to $top_srcdir/$ac_aux_dir/missing, # iff we strip the leading $srcdir from $ac_aux_dir. That would be: # am_aux_dir='\$(top_srcdir)/'`expr "$ac_aux_dir" : "$srcdir//*\(.*\)"` # and then we would define $MISSING as # MISSING="\${SHELL} $am_aux_dir/missing" # This will work as long as MISSING is not called from configure, because # unfortunately $(top_srcdir) has no meaning in configure. # However there are other variables, like CC, which are often used in # configure, and could therefore not use this "fixed" $ac_aux_dir. # # Another solution, used here, is to always expand $ac_aux_dir to an # absolute PATH. The drawback is that using absolute paths prevent a # configured tree to be moved without reconfiguration. AC_DEFUN([AM_AUX_DIR_EXPAND], [dnl Rely on autoconf to set up CDPATH properly. AC_PREREQ([2.50])dnl # expand $ac_aux_dir to an absolute path am_aux_dir=`cd $ac_aux_dir && pwd` ]) # AM_CONDITIONAL -*- Autoconf -*- # Copyright (C) 1997-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_CONDITIONAL(NAME, SHELL-CONDITION) # ------------------------------------- # Define a conditional. AC_DEFUN([AM_CONDITIONAL], [AC_PREREQ([2.52])dnl m4_if([$1], [TRUE], [AC_FATAL([$0: invalid condition: $1])], [$1], [FALSE], [AC_FATAL([$0: invalid condition: $1])])dnl AC_SUBST([$1_TRUE])dnl AC_SUBST([$1_FALSE])dnl _AM_SUBST_NOTMAKE([$1_TRUE])dnl _AM_SUBST_NOTMAKE([$1_FALSE])dnl m4_define([_AM_COND_VALUE_$1], [$2])dnl if $2; then $1_TRUE= $1_FALSE='#' else $1_TRUE='#' $1_FALSE= fi AC_CONFIG_COMMANDS_PRE( [if test -z "${$1_TRUE}" && test -z "${$1_FALSE}"; then AC_MSG_ERROR([[conditional "$1" was never defined. Usually this means the macro was only invoked conditionally.]]) fi])]) # Copyright (C) 1999-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # There are a few dirty hacks below to avoid letting 'AC_PROG_CC' be # written in clear, in which case automake, when reading aclocal.m4, # will think it sees a *use*, and therefore will trigger all it's # C support machinery. Also note that it means that autoscan, seeing # CC etc. in the Makefile, will ask for an AC_PROG_CC use... # _AM_DEPENDENCIES(NAME) # ---------------------- # See how the compiler implements dependency checking. # NAME is "CC", "CXX", "OBJC", "OBJCXX", "UPC", or "GJC". # We try a few techniques and use that to set a single cache variable. # # We don't AC_REQUIRE the corresponding AC_PROG_CC since the latter was # modified to invoke _AM_DEPENDENCIES(CC); we would have a circular # dependency, and given that the user is not expected to run this macro, # just rely on AC_PROG_CC. AC_DEFUN([_AM_DEPENDENCIES], [AC_REQUIRE([AM_SET_DEPDIR])dnl AC_REQUIRE([AM_OUTPUT_DEPENDENCY_COMMANDS])dnl AC_REQUIRE([AM_MAKE_INCLUDE])dnl AC_REQUIRE([AM_DEP_TRACK])dnl m4_if([$1], [CC], [depcc="$CC" am_compiler_list=], [$1], [CXX], [depcc="$CXX" am_compiler_list=], [$1], [OBJC], [depcc="$OBJC" am_compiler_list='gcc3 gcc'], [$1], [OBJCXX], [depcc="$OBJCXX" am_compiler_list='gcc3 gcc'], [$1], [UPC], [depcc="$UPC" am_compiler_list=], [$1], [GCJ], [depcc="$GCJ" am_compiler_list='gcc3 gcc'], [depcc="$$1" am_compiler_list=]) AC_CACHE_CHECK([dependency style of $depcc], [am_cv_$1_dependencies_compiler_type], [if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named 'D' -- because '-MD' means "put the output # in D". rm -rf conftest.dir mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_$1_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n ['s/^#*\([a-zA-Z0-9]*\))$/\1/p'] < ./depcomp` fi am__universal=false m4_case([$1], [CC], [case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac], [CXX], [case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac]) for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using ": > sub/conftst$i.h" creates only sub/conftst1.h with # Solaris 10 /bin/sh. echo '/* dummy */' > sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf # We check with '-c' and '-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle '-M -o', and we need to detect this. Also, some Intel # versions had trouble with output in subdirs. am__obj=sub/conftest.${OBJEXT-o} am__minus_obj="-o $am__obj" case $depmode in gcc) # This depmode causes a compiler race in universal mode. test "$am__universal" = false || continue ;; nosideeffect) # After this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested. if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; msvc7 | msvc7msys | msvisualcpp | msvcmsys) # This compiler won't grok '-c -o', but also, the minuso test has # not run yet. These depmodes are late enough in the game, and # so weak that their functioning should not be impacted. am__obj=conftest.${OBJEXT-o} am__minus_obj= ;; none) break ;; esac if depmode=$depmode \ source=sub/conftest.c object=$am__obj \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep $am__obj sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_$1_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_$1_dependencies_compiler_type=none fi ]) AC_SUBST([$1DEPMODE], [depmode=$am_cv_$1_dependencies_compiler_type]) AM_CONDITIONAL([am__fastdep$1], [ test "x$enable_dependency_tracking" != xno \ && test "$am_cv_$1_dependencies_compiler_type" = gcc3]) ]) # AM_SET_DEPDIR # ------------- # Choose a directory name for dependency files. # This macro is AC_REQUIREd in _AM_DEPENDENCIES. AC_DEFUN([AM_SET_DEPDIR], [AC_REQUIRE([AM_SET_LEADING_DOT])dnl AC_SUBST([DEPDIR], ["${am__leading_dot}deps"])dnl ]) # AM_DEP_TRACK # ------------ AC_DEFUN([AM_DEP_TRACK], [AC_ARG_ENABLE([dependency-tracking], [dnl AS_HELP_STRING( [--enable-dependency-tracking], [do not reject slow dependency extractors]) AS_HELP_STRING( [--disable-dependency-tracking], [speeds up one-time build])]) if test "x$enable_dependency_tracking" != xno; then am_depcomp="$ac_aux_dir/depcomp" AMDEPBACKSLASH='\' am__nodep='_no' fi AM_CONDITIONAL([AMDEP], [test "x$enable_dependency_tracking" != xno]) AC_SUBST([AMDEPBACKSLASH])dnl _AM_SUBST_NOTMAKE([AMDEPBACKSLASH])dnl AC_SUBST([am__nodep])dnl _AM_SUBST_NOTMAKE([am__nodep])dnl ]) # Generate code to set up dependency tracking. -*- Autoconf -*- # Copyright (C) 1999-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # _AM_OUTPUT_DEPENDENCY_COMMANDS # ------------------------------ AC_DEFUN([_AM_OUTPUT_DEPENDENCY_COMMANDS], [{ # Older Autoconf quotes --file arguments for eval, but not when files # are listed without --file. Let's play safe and only enable the eval # if we detect the quoting. case $CONFIG_FILES in *\'*) eval set x "$CONFIG_FILES" ;; *) set x $CONFIG_FILES ;; esac shift for mf do # Strip MF so we end up with the name of the file. mf=`echo "$mf" | sed -e 's/:.*$//'` # Check whether this is an Automake generated Makefile or not. # We used to match only the files named 'Makefile.in', but # some people rename them; so instead we look at the file content. # Grep'ing the first line is not enough: some people post-process # each Makefile.in and add a new line on top of each file to say so. # Grep'ing the whole file is not good either: AIX grep has a line # limit of 2048, but all sed's we know have understand at least 4000. if sed -n 's,^#.*generated by automake.*,X,p' "$mf" | grep X >/dev/null 2>&1; then dirpart=`AS_DIRNAME("$mf")` else continue fi # Extract the definition of DEPDIR, am__include, and am__quote # from the Makefile without running 'make'. DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"` test -z "$DEPDIR" && continue am__include=`sed -n 's/^am__include = //p' < "$mf"` test -z "$am__include" && continue am__quote=`sed -n 's/^am__quote = //p' < "$mf"` # Find all dependency output files, they are included files with # $(DEPDIR) in their names. We invoke sed twice because it is the # simplest approach to changing $(DEPDIR) to its actual value in the # expansion. for file in `sed -n " s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \ sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g'`; do # Make sure the directory exists. test -f "$dirpart/$file" && continue fdir=`AS_DIRNAME(["$file"])` AS_MKDIR_P([$dirpart/$fdir]) # echo "creating $dirpart/$file" echo '# dummy' > "$dirpart/$file" done done } ])# _AM_OUTPUT_DEPENDENCY_COMMANDS # AM_OUTPUT_DEPENDENCY_COMMANDS # ----------------------------- # This macro should only be invoked once -- use via AC_REQUIRE. # # This code is only required when automatic dependency tracking # is enabled. FIXME. This creates each '.P' file that we will # need in order to bootstrap the dependency handling code. AC_DEFUN([AM_OUTPUT_DEPENDENCY_COMMANDS], [AC_CONFIG_COMMANDS([depfiles], [test x"$AMDEP_TRUE" != x"" || _AM_OUTPUT_DEPENDENCY_COMMANDS], [AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir"]) ]) # Do all the work for Automake. -*- Autoconf -*- # Copyright (C) 1996-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This macro actually does too much. Some checks are only needed if # your package does certain things. But this isn't really a big deal. dnl Redefine AC_PROG_CC to automatically invoke _AM_PROG_CC_C_O. m4_define([AC_PROG_CC], m4_defn([AC_PROG_CC]) [_AM_PROG_CC_C_O ]) # AM_INIT_AUTOMAKE(PACKAGE, VERSION, [NO-DEFINE]) # AM_INIT_AUTOMAKE([OPTIONS]) # ----------------------------------------------- # The call with PACKAGE and VERSION arguments is the old style # call (pre autoconf-2.50), which is being phased out. PACKAGE # and VERSION should now be passed to AC_INIT and removed from # the call to AM_INIT_AUTOMAKE. # We support both call styles for the transition. After # the next Automake release, Autoconf can make the AC_INIT # arguments mandatory, and then we can depend on a new Autoconf # release and drop the old call support. AC_DEFUN([AM_INIT_AUTOMAKE], [AC_PREREQ([2.65])dnl dnl Autoconf wants to disallow AM_ names. We explicitly allow dnl the ones we care about. m4_pattern_allow([^AM_[A-Z]+FLAGS$])dnl AC_REQUIRE([AM_SET_CURRENT_AUTOMAKE_VERSION])dnl AC_REQUIRE([AC_PROG_INSTALL])dnl if test "`cd $srcdir && pwd`" != "`pwd`"; then # Use -I$(srcdir) only when $(srcdir) != ., so that make's output # is not polluted with repeated "-I." AC_SUBST([am__isrc], [' -I$(srcdir)'])_AM_SUBST_NOTMAKE([am__isrc])dnl # test to see if srcdir already configured if test -f $srcdir/config.status; then AC_MSG_ERROR([source directory already configured; run "make distclean" there first]) fi fi # test whether we have cygpath if test -z "$CYGPATH_W"; then if (cygpath --version) >/dev/null 2>/dev/null; then CYGPATH_W='cygpath -w' else CYGPATH_W=echo fi fi AC_SUBST([CYGPATH_W]) # Define the identity of the package. dnl Distinguish between old-style and new-style calls. m4_ifval([$2], [AC_DIAGNOSE([obsolete], [$0: two- and three-arguments forms are deprecated.]) m4_ifval([$3], [_AM_SET_OPTION([no-define])])dnl AC_SUBST([PACKAGE], [$1])dnl AC_SUBST([VERSION], [$2])], [_AM_SET_OPTIONS([$1])dnl dnl Diagnose old-style AC_INIT with new-style AM_AUTOMAKE_INIT. m4_if( m4_ifdef([AC_PACKAGE_NAME], [ok]):m4_ifdef([AC_PACKAGE_VERSION], [ok]), [ok:ok],, [m4_fatal([AC_INIT should be called with package and version arguments])])dnl AC_SUBST([PACKAGE], ['AC_PACKAGE_TARNAME'])dnl AC_SUBST([VERSION], ['AC_PACKAGE_VERSION'])])dnl _AM_IF_OPTION([no-define],, [AC_DEFINE_UNQUOTED([PACKAGE], ["$PACKAGE"], [Name of package]) AC_DEFINE_UNQUOTED([VERSION], ["$VERSION"], [Version number of package])])dnl # Some tools Automake needs. AC_REQUIRE([AM_SANITY_CHECK])dnl AC_REQUIRE([AC_ARG_PROGRAM])dnl AM_MISSING_PROG([ACLOCAL], [aclocal-${am__api_version}]) AM_MISSING_PROG([AUTOCONF], [autoconf]) AM_MISSING_PROG([AUTOMAKE], [automake-${am__api_version}]) AM_MISSING_PROG([AUTOHEADER], [autoheader]) AM_MISSING_PROG([MAKEINFO], [makeinfo]) AC_REQUIRE([AM_PROG_INSTALL_SH])dnl AC_REQUIRE([AM_PROG_INSTALL_STRIP])dnl AC_REQUIRE([AC_PROG_MKDIR_P])dnl # For better backward compatibility. To be removed once Automake 1.9.x # dies out for good. For more background, see: # # AC_SUBST([mkdir_p], ['$(MKDIR_P)']) # We need awk for the "check" target. The system "awk" is bad on # some platforms. AC_REQUIRE([AC_PROG_AWK])dnl AC_REQUIRE([AC_PROG_MAKE_SET])dnl AC_REQUIRE([AM_SET_LEADING_DOT])dnl _AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])], [_AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])], [_AM_PROG_TAR([v7])])]) _AM_IF_OPTION([no-dependencies],, [AC_PROVIDE_IFELSE([AC_PROG_CC], [_AM_DEPENDENCIES([CC])], [m4_define([AC_PROG_CC], m4_defn([AC_PROG_CC])[_AM_DEPENDENCIES([CC])])])dnl AC_PROVIDE_IFELSE([AC_PROG_CXX], [_AM_DEPENDENCIES([CXX])], [m4_define([AC_PROG_CXX], m4_defn([AC_PROG_CXX])[_AM_DEPENDENCIES([CXX])])])dnl AC_PROVIDE_IFELSE([AC_PROG_OBJC], [_AM_DEPENDENCIES([OBJC])], [m4_define([AC_PROG_OBJC], m4_defn([AC_PROG_OBJC])[_AM_DEPENDENCIES([OBJC])])])dnl AC_PROVIDE_IFELSE([AC_PROG_OBJCXX], [_AM_DEPENDENCIES([OBJCXX])], [m4_define([AC_PROG_OBJCXX], m4_defn([AC_PROG_OBJCXX])[_AM_DEPENDENCIES([OBJCXX])])])dnl ]) AC_REQUIRE([AM_SILENT_RULES])dnl dnl The testsuite driver may need to know about EXEEXT, so add the dnl 'am__EXEEXT' conditional if _AM_COMPILER_EXEEXT was seen. This dnl macro is hooked onto _AC_COMPILER_EXEEXT early, see below. AC_CONFIG_COMMANDS_PRE(dnl [m4_provide_if([_AM_COMPILER_EXEEXT], [AM_CONDITIONAL([am__EXEEXT], [test -n "$EXEEXT"])])])dnl # POSIX will say in a future version that running "rm -f" with no argument # is OK; and we want to be able to make that assumption in our Makefile # recipes. So use an aggressive probe to check that the usage we want is # actually supported "in the wild" to an acceptable degree. # See automake bug#10828. # To make any issue more visible, cause the running configure to be aborted # by default if the 'rm' program in use doesn't match our expectations; the # user can still override this though. if rm -f && rm -fr && rm -rf; then : OK; else cat >&2 <<'END' Oops! Your 'rm' program seems unable to run without file operands specified on the command line, even when the '-f' option is present. This is contrary to the behaviour of most rm programs out there, and not conforming with the upcoming POSIX standard: Please tell bug-automake@gnu.org about your system, including the value of your $PATH and any error possibly output before this message. This can help us improve future automake versions. END if test x"$ACCEPT_INFERIOR_RM_PROGRAM" = x"yes"; then echo 'Configuration will proceed anyway, since you have set the' >&2 echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to "yes"' >&2 echo >&2 else cat >&2 <<'END' Aborting the configuration process, to ensure you take notice of the issue. You can download and install GNU coreutils to get an 'rm' implementation that behaves properly: . If you want to complete the configuration process using your problematic 'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM to "yes", and re-run configure. END AC_MSG_ERROR([Your 'rm' program is bad, sorry.]) fi fi ]) dnl Hook into '_AC_COMPILER_EXEEXT' early to learn its expansion. Do not dnl add the conditional right here, as _AC_COMPILER_EXEEXT may be further dnl mangled by Autoconf and run in a shell conditional statement. m4_define([_AC_COMPILER_EXEEXT], m4_defn([_AC_COMPILER_EXEEXT])[m4_provide([_AM_COMPILER_EXEEXT])]) # When config.status generates a header, we must update the stamp-h file. # This file resides in the same directory as the config header # that is generated. The stamp files are numbered to have different names. # Autoconf calls _AC_AM_CONFIG_HEADER_HOOK (when defined) in the # loop where config.status creates the headers, so we can generate # our stamp files there. AC_DEFUN([_AC_AM_CONFIG_HEADER_HOOK], [# Compute $1's index in $config_headers. _am_arg=$1 _am_stamp_count=1 for _am_header in $config_headers :; do case $_am_header in $_am_arg | $_am_arg:* ) break ;; * ) _am_stamp_count=`expr $_am_stamp_count + 1` ;; esac done echo "timestamp for $_am_arg" >`AS_DIRNAME(["$_am_arg"])`/stamp-h[]$_am_stamp_count]) # Copyright (C) 2001-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_PROG_INSTALL_SH # ------------------ # Define $install_sh. AC_DEFUN([AM_PROG_INSTALL_SH], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl if test x"${install_sh}" != xset; then case $am_aux_dir in *\ * | *\ *) install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;; *) install_sh="\${SHELL} $am_aux_dir/install-sh" esac fi AC_SUBST([install_sh])]) # Copyright (C) 2003-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # Check whether the underlying file-system supports filenames # with a leading dot. For instance MS-DOS doesn't. AC_DEFUN([AM_SET_LEADING_DOT], [rm -rf .tst 2>/dev/null mkdir .tst 2>/dev/null if test -d .tst; then am__leading_dot=. else am__leading_dot=_ fi rmdir .tst 2>/dev/null AC_SUBST([am__leading_dot])]) # Check to see how 'make' treats includes. -*- Autoconf -*- # Copyright (C) 2001-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_MAKE_INCLUDE() # ----------------- # Check to see how make treats includes. AC_DEFUN([AM_MAKE_INCLUDE], [am_make=${MAKE-make} cat > confinc << 'END' am__doit: @echo this is the am__doit target .PHONY: am__doit END # If we don't find an include directive, just comment out the code. AC_MSG_CHECKING([for style of include used by $am_make]) am__include="#" am__quote= _am_result=none # First try GNU make style include. echo "include confinc" > confmf # Ignore all kinds of additional output from 'make'. case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=include am__quote= _am_result=GNU ;; esac # Now try BSD make style include. if test "$am__include" = "#"; then echo '.include "confinc"' > confmf case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=.include am__quote="\"" _am_result=BSD ;; esac fi AC_SUBST([am__include]) AC_SUBST([am__quote]) AC_MSG_RESULT([$_am_result]) rm -f confinc confmf ]) # Fake the existence of programs that GNU maintainers use. -*- Autoconf -*- # Copyright (C) 1997-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_MISSING_PROG(NAME, PROGRAM) # ------------------------------ AC_DEFUN([AM_MISSING_PROG], [AC_REQUIRE([AM_MISSING_HAS_RUN]) $1=${$1-"${am_missing_run}$2"} AC_SUBST($1)]) # AM_MISSING_HAS_RUN # ------------------ # Define MISSING if not defined so far and test if it is modern enough. # If it is, set am_missing_run to use it, otherwise, to nothing. AC_DEFUN([AM_MISSING_HAS_RUN], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl AC_REQUIRE_AUX_FILE([missing])dnl if test x"${MISSING+set}" != xset; then case $am_aux_dir in *\ * | *\ *) MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;; *) MISSING="\${SHELL} $am_aux_dir/missing" ;; esac fi # Use eval to expand $SHELL if eval "$MISSING --is-lightweight"; then am_missing_run="$MISSING " else am_missing_run= AC_MSG_WARN(['missing' script is too old or missing]) fi ]) # Helper functions for option handling. -*- Autoconf -*- # Copyright (C) 2001-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # _AM_MANGLE_OPTION(NAME) # ----------------------- AC_DEFUN([_AM_MANGLE_OPTION], [[_AM_OPTION_]m4_bpatsubst($1, [[^a-zA-Z0-9_]], [_])]) # _AM_SET_OPTION(NAME) # -------------------- # Set option NAME. Presently that only means defining a flag for this option. AC_DEFUN([_AM_SET_OPTION], [m4_define(_AM_MANGLE_OPTION([$1]), [1])]) # _AM_SET_OPTIONS(OPTIONS) # ------------------------ # OPTIONS is a space-separated list of Automake options. AC_DEFUN([_AM_SET_OPTIONS], [m4_foreach_w([_AM_Option], [$1], [_AM_SET_OPTION(_AM_Option)])]) # _AM_IF_OPTION(OPTION, IF-SET, [IF-NOT-SET]) # ------------------------------------------- # Execute IF-SET if OPTION is set, IF-NOT-SET otherwise. AC_DEFUN([_AM_IF_OPTION], [m4_ifset(_AM_MANGLE_OPTION([$1]), [$2], [$3])]) # Copyright (C) 1999-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # _AM_PROG_CC_C_O # --------------- # Like AC_PROG_CC_C_O, but changed for automake. We rewrite AC_PROG_CC # to automatically call this. AC_DEFUN([_AM_PROG_CC_C_O], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl AC_REQUIRE_AUX_FILE([compile])dnl AC_LANG_PUSH([C])dnl AC_CACHE_CHECK( [whether $CC understands -c and -o together], [am_cv_prog_cc_c_o], [AC_LANG_CONFTEST([AC_LANG_PROGRAM([])]) # Make sure it works both with $CC and with simple cc. # Following AC_PROG_CC_C_O, we do the test twice because some # compilers refuse to overwrite an existing .o file with -o, # though they will create one. am_cv_prog_cc_c_o=yes for am_i in 1 2; do if AM_RUN_LOG([$CC -c conftest.$ac_ext -o conftest2.$ac_objext]) \ && test -f conftest2.$ac_objext; then : OK else am_cv_prog_cc_c_o=no break fi done rm -f core conftest* unset am_i]) if test "$am_cv_prog_cc_c_o" != yes; then # Losing compiler, so override with the script. # FIXME: It is wrong to rewrite CC. # But if we don't then we get into trouble of one sort or another. # A longer-term fix would be to have automake use am__CC in this case, # and then we could set am__CC="\$(top_srcdir)/compile \$(CC)" CC="$am_aux_dir/compile $CC" fi AC_LANG_POP([C])]) # For backward compatibility. AC_DEFUN_ONCE([AM_PROG_CC_C_O], [AC_REQUIRE([AC_PROG_CC])]) # Copyright (C) 2001-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_RUN_LOG(COMMAND) # ------------------- # Run COMMAND, save the exit status in ac_status, and log it. # (This has been adapted from Autoconf's _AC_RUN_LOG macro.) AC_DEFUN([AM_RUN_LOG], [{ echo "$as_me:$LINENO: $1" >&AS_MESSAGE_LOG_FD ($1) >&AS_MESSAGE_LOG_FD 2>&AS_MESSAGE_LOG_FD ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&AS_MESSAGE_LOG_FD (exit $ac_status); }]) # Check to make sure that the build environment is sane. -*- Autoconf -*- # Copyright (C) 1996-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_SANITY_CHECK # --------------- AC_DEFUN([AM_SANITY_CHECK], [AC_MSG_CHECKING([whether build environment is sane]) # Reject unsafe characters in $srcdir or the absolute working directory # name. Accept space and tab only in the latter. am_lf=' ' case `pwd` in *[[\\\"\#\$\&\'\`$am_lf]]*) AC_MSG_ERROR([unsafe absolute working directory name]);; esac case $srcdir in *[[\\\"\#\$\&\'\`$am_lf\ \ ]]*) AC_MSG_ERROR([unsafe srcdir value: '$srcdir']);; esac # Do 'set' in a subshell so we don't clobber the current shell's # arguments. Must try -L first in case configure is actually a # symlink; some systems play weird games with the mod time of symlinks # (eg FreeBSD returns the mod time of the symlink's containing # directory). if ( am_has_slept=no for am_try in 1 2; do echo "timestamp, slept: $am_has_slept" > conftest.file set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null` if test "$[*]" = "X"; then # -L didn't work. set X `ls -t "$srcdir/configure" conftest.file` fi if test "$[*]" != "X $srcdir/configure conftest.file" \ && test "$[*]" != "X conftest.file $srcdir/configure"; then # If neither matched, then we have a broken ls. This can happen # if, for instance, CONFIG_SHELL is bash and it inherits a # broken ls alias from the environment. This has actually # happened. Such a system could not be considered "sane". AC_MSG_ERROR([ls -t appears to fail. Make sure there is not a broken alias in your environment]) fi if test "$[2]" = conftest.file || test $am_try -eq 2; then break fi # Just in case. sleep 1 am_has_slept=yes done test "$[2]" = conftest.file ) then # Ok. : else AC_MSG_ERROR([newly created file is older than distributed files! Check your system clock]) fi AC_MSG_RESULT([yes]) # If we didn't sleep, we still need to ensure time stamps of config.status and # generated files are strictly newer. am_sleep_pid= if grep 'slept: no' conftest.file >/dev/null 2>&1; then ( sleep 1 ) & am_sleep_pid=$! fi AC_CONFIG_COMMANDS_PRE( [AC_MSG_CHECKING([that generated files are newer than configure]) if test -n "$am_sleep_pid"; then # Hide warnings about reused PIDs. wait $am_sleep_pid 2>/dev/null fi AC_MSG_RESULT([done])]) rm -f conftest.file ]) # Copyright (C) 2009-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_SILENT_RULES([DEFAULT]) # -------------------------- # Enable less verbose build rules; with the default set to DEFAULT # ("yes" being less verbose, "no" or empty being verbose). AC_DEFUN([AM_SILENT_RULES], [AC_ARG_ENABLE([silent-rules], [dnl AS_HELP_STRING( [--enable-silent-rules], [less verbose build output (undo: "make V=1")]) AS_HELP_STRING( [--disable-silent-rules], [verbose build output (undo: "make V=0")])dnl ]) case $enable_silent_rules in @%:@ ((( yes) AM_DEFAULT_VERBOSITY=0;; no) AM_DEFAULT_VERBOSITY=1;; *) AM_DEFAULT_VERBOSITY=m4_if([$1], [yes], [0], [1]);; esac dnl dnl A few 'make' implementations (e.g., NonStop OS and NextStep) dnl do not support nested variable expansions. dnl See automake bug#9928 and bug#10237. am_make=${MAKE-make} AC_CACHE_CHECK([whether $am_make supports nested variables], [am_cv_make_support_nested_variables], [if AS_ECHO([['TRUE=$(BAR$(V)) BAR0=false BAR1=true V=1 am__doit: @$(TRUE) .PHONY: am__doit']]) | $am_make -f - >/dev/null 2>&1; then am_cv_make_support_nested_variables=yes else am_cv_make_support_nested_variables=no fi]) if test $am_cv_make_support_nested_variables = yes; then dnl Using '$V' instead of '$(V)' breaks IRIX make. AM_V='$(V)' AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)' else AM_V=$AM_DEFAULT_VERBOSITY AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY fi AC_SUBST([AM_V])dnl AM_SUBST_NOTMAKE([AM_V])dnl AC_SUBST([AM_DEFAULT_V])dnl AM_SUBST_NOTMAKE([AM_DEFAULT_V])dnl AC_SUBST([AM_DEFAULT_VERBOSITY])dnl AM_BACKSLASH='\' AC_SUBST([AM_BACKSLASH])dnl _AM_SUBST_NOTMAKE([AM_BACKSLASH])dnl ]) # Copyright (C) 2001-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # AM_PROG_INSTALL_STRIP # --------------------- # One issue with vendor 'install' (even GNU) is that you can't # specify the program used to strip binaries. This is especially # annoying in cross-compiling environments, where the build's strip # is unlikely to handle the host's binaries. # Fortunately install-sh will honor a STRIPPROG variable, so we # always use install-sh in "make install-strip", and initialize # STRIPPROG with the value of the STRIP variable (set by the user). AC_DEFUN([AM_PROG_INSTALL_STRIP], [AC_REQUIRE([AM_PROG_INSTALL_SH])dnl # Installed binaries are usually stripped using 'strip' when the user # run "make install-strip". However 'strip' might not be the right # tool to use in cross-compilation environments, therefore Automake # will honor the 'STRIP' environment variable to overrule this program. dnl Don't test for $cross_compiling = yes, because it might be 'maybe'. if test "$cross_compiling" != no; then AC_CHECK_TOOL([STRIP], [strip], :) fi INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s" AC_SUBST([INSTALL_STRIP_PROGRAM])]) # Copyright (C) 2006-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # _AM_SUBST_NOTMAKE(VARIABLE) # --------------------------- # Prevent Automake from outputting VARIABLE = @VARIABLE@ in Makefile.in. # This macro is traced by Automake. AC_DEFUN([_AM_SUBST_NOTMAKE]) # AM_SUBST_NOTMAKE(VARIABLE) # -------------------------- # Public sister of _AM_SUBST_NOTMAKE. AC_DEFUN([AM_SUBST_NOTMAKE], [_AM_SUBST_NOTMAKE($@)]) # Check how to create a tarball. -*- Autoconf -*- # Copyright (C) 2004-2013 Free Software Foundation, Inc. # # This file is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # _AM_PROG_TAR(FORMAT) # -------------------- # Check how to create a tarball in format FORMAT. # FORMAT should be one of 'v7', 'ustar', or 'pax'. # # Substitute a variable $(am__tar) that is a command # writing to stdout a FORMAT-tarball containing the directory # $tardir. # tardir=directory && $(am__tar) > result.tar # # Substitute a variable $(am__untar) that extract such # a tarball read from stdin. # $(am__untar) < result.tar # AC_DEFUN([_AM_PROG_TAR], [# Always define AMTAR for backward compatibility. Yes, it's still used # in the wild :-( We should find a proper way to deprecate it ... AC_SUBST([AMTAR], ['$${TAR-tar}']) # We'll loop over all known methods to create a tar archive until one works. _am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none' m4_if([$1], [v7], [am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'], [m4_case([$1], [ustar], [# The POSIX 1988 'ustar' format is defined with fixed-size fields. # There is notably a 21 bits limit for the UID and the GID. In fact, # the 'pax' utility can hang on bigger UID/GID (see automake bug#8343 # and bug#13588). am_max_uid=2097151 # 2^21 - 1 am_max_gid=$am_max_uid # The $UID and $GID variables are not portable, so we need to resort # to the POSIX-mandated id(1) utility. Errors in the 'id' calls # below are definitely unexpected, so allow the users to see them # (that is, avoid stderr redirection). am_uid=`id -u || echo unknown` am_gid=`id -g || echo unknown` AC_MSG_CHECKING([whether UID '$am_uid' is supported by ustar format]) if test $am_uid -le $am_max_uid; then AC_MSG_RESULT([yes]) else AC_MSG_RESULT([no]) _am_tools=none fi AC_MSG_CHECKING([whether GID '$am_gid' is supported by ustar format]) if test $am_gid -le $am_max_gid; then AC_MSG_RESULT([yes]) else AC_MSG_RESULT([no]) _am_tools=none fi], [pax], [], [m4_fatal([Unknown tar format])]) AC_MSG_CHECKING([how to create a $1 tar archive]) # Go ahead even if we have the value already cached. We do so because we # need to set the values for the 'am__tar' and 'am__untar' variables. _am_tools=${am_cv_prog_tar_$1-$_am_tools} for _am_tool in $_am_tools; do case $_am_tool in gnutar) for _am_tar in tar gnutar gtar; do AM_RUN_LOG([$_am_tar --version]) && break done am__tar="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$$tardir"' am__tar_="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$tardir"' am__untar="$_am_tar -xf -" ;; plaintar) # Must skip GNU tar: if it does not support --format= it doesn't create # ustar tarball either. (tar --version) >/dev/null 2>&1 && continue am__tar='tar chf - "$$tardir"' am__tar_='tar chf - "$tardir"' am__untar='tar xf -' ;; pax) am__tar='pax -L -x $1 -w "$$tardir"' am__tar_='pax -L -x $1 -w "$tardir"' am__untar='pax -r' ;; cpio) am__tar='find "$$tardir" -print | cpio -o -H $1 -L' am__tar_='find "$tardir" -print | cpio -o -H $1 -L' am__untar='cpio -i -H $1 -d' ;; none) am__tar=false am__tar_=false am__untar=false ;; esac # If the value was cached, stop now. We just wanted to have am__tar # and am__untar set. test -n "${am_cv_prog_tar_$1}" && break # tar/untar a dummy directory, and stop if the command works. rm -rf conftest.dir mkdir conftest.dir echo GrepMe > conftest.dir/file AM_RUN_LOG([tardir=conftest.dir && eval $am__tar_ >conftest.tar]) rm -rf conftest.dir if test -s conftest.tar; then AM_RUN_LOG([$am__untar /dev/null 2>&1 && break fi done rm -rf conftest.dir AC_CACHE_VAL([am_cv_prog_tar_$1], [am_cv_prog_tar_$1=$_am_tool]) AC_MSG_RESULT([$am_cv_prog_tar_$1])]) AC_SUBST([am__tar]) AC_SUBST([am__untar]) ]) # _AM_PROG_TAR m4_include([m4/ac_cplex.m4]) m4_include([m4/libtool.m4]) m4_include([m4/ltoptions.m4]) m4_include([m4/ltsugar.m4]) m4_include([m4/ltversion.m4]) m4_include([m4/lt~obsolete.m4]) madp-0.4/PaxHeaders.5405/configure0000644000000000000000000000013212717644306013666 xustar0030 mtime=1463765190.425637705 30 atime=1463765200.929553811 30 ctime=1463765201.001553235 madp-0.4/configure0000775000372100037210000230103212717644306014526 0ustar00fransfrans00000000000000#! /bin/sh # Guess values for system-dependent variables and create Makefiles. # Generated by GNU Autoconf 2.69 for MADP 0.4. # # Report bugs to . # # # Copyright (C) 1992-1996, 1998-2012 Free Software Foundation, Inc. # # # This configure script is free software; the Free Software Foundation # gives unlimited permission to copy, distribute and modify it. ## -------------------- ## ## M4sh Initialization. ## ## -------------------- ## # Be more Bourne compatible DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi as_nl=' ' export as_nl # Printing a long string crashes Solaris 7 /usr/bin/printf. as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo # Prefer a ksh shell builtin over an external printf program on Solaris, # but without wasting forks for bash or zsh. if test -z "$BASH_VERSION$ZSH_VERSION" \ && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='print -r --' as_echo_n='print -rn --' elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='printf %s\n' as_echo_n='printf %s' else if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"' as_echo_n='/usr/ucb/echo -n' else as_echo_body='eval expr "X$1" : "X\\(.*\\)"' as_echo_n_body='eval arg=$1; case $arg in #( *"$as_nl"*) expr "X$arg" : "X\\(.*\\)$as_nl"; arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;; esac; expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl" ' export as_echo_n_body as_echo_n='sh -c $as_echo_n_body as_echo' fi export as_echo_body as_echo='sh -c $as_echo_body as_echo' fi # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then PATH_SEPARATOR=: (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && { (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 || PATH_SEPARATOR=';' } fi # IFS # We need space, tab and new line, in precisely that order. Quoting is # there to prevent editors from complaining about space-tab. # (If _AS_PATH_WALK were called with IFS unset, it would disable word # splitting by setting IFS to empty value.) IFS=" "" $as_nl" # Find who we are. Look in the path if we contain no directory separator. as_myself= case $0 in #(( *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done IFS=$as_save_IFS ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 exit 1 fi # Unset variables that we do not need and which cause bugs (e.g. in # pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1" # suppresses any "Segmentation fault" message there. '((' could # trigger a bug in pdksh 5.2.14. for as_var in BASH_ENV ENV MAIL MAILPATH do eval test x\${$as_var+set} = xset \ && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || : done PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. LC_ALL=C export LC_ALL LANGUAGE=C export LANGUAGE # CDPATH. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH # Use a proper internal environment variable to ensure we don't fall # into an infinite loop, continuously re-executing ourselves. if test x"${_as_can_reexec}" != xno && test "x$CONFIG_SHELL" != x; then _as_can_reexec=no; export _as_can_reexec; # We cannot yet assume a decent shell, so we have to provide a # neutralization value for shells without unset; and this also # works around shells that cannot unset nonexistent variables. # Preserve -v and -x to the replacement shell. BASH_ENV=/dev/null ENV=/dev/null (unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV case $- in # (((( *v*x* | *x*v* ) as_opts=-vx ;; *v* ) as_opts=-v ;; *x* ) as_opts=-x ;; * ) as_opts= ;; esac exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"} # Admittedly, this is quite paranoid, since all the known shells bail # out after a failed `exec'. $as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2 as_fn_exit 255 fi # We don't want this to propagate to other subprocesses. { _as_can_reexec=; unset _as_can_reexec;} if test "x$CONFIG_SHELL" = x; then as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which # is contrary to our usage. Disable this feature. alias -g '\${1+\"\$@\"}'='\"\$@\"' setopt NO_GLOB_SUBST else case \`(set -o) 2>/dev/null\` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi " as_required="as_fn_return () { (exit \$1); } as_fn_success () { as_fn_return 0; } as_fn_failure () { as_fn_return 1; } as_fn_ret_success () { return 0; } as_fn_ret_failure () { return 1; } exitcode=0 as_fn_success || { exitcode=1; echo as_fn_success failed.; } as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; } as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; } as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; } if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then : else exitcode=1; echo positional parameters were not saved. fi test x\$exitcode = x0 || exit 1 test -x / || exit 1" as_suggested=" as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" && test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1 test -n \"\${ZSH_VERSION+set}\${BASH_VERSION+set}\" || ( ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' ECHO=\$ECHO\$ECHO\$ECHO\$ECHO\$ECHO ECHO=\$ECHO\$ECHO\$ECHO\$ECHO\$ECHO\$ECHO PATH=/empty FPATH=/empty; export PATH FPATH test \"X\`printf %s \$ECHO\`\" = \"X\$ECHO\" \\ || test \"X\`print -r -- \$ECHO\`\" = \"X\$ECHO\" ) || exit 1 test \$(( 1 + 1 )) = 2 || exit 1" if (eval "$as_required") 2>/dev/null; then : as_have_required=yes else as_have_required=no fi if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then : else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR as_found=false for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. as_found=: case $as_dir in #( /*) for as_base in sh bash ksh sh5; do # Try only shells that exist, to save several forks. as_shell=$as_dir/$as_base if { test -f "$as_shell" || test -f "$as_shell.exe"; } && { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then : CONFIG_SHELL=$as_shell as_have_required=yes if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then : break 2 fi fi done;; esac as_found=false done $as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } && { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then : CONFIG_SHELL=$SHELL as_have_required=yes fi; } IFS=$as_save_IFS if test "x$CONFIG_SHELL" != x; then : export CONFIG_SHELL # We cannot yet assume a decent shell, so we have to provide a # neutralization value for shells without unset; and this also # works around shells that cannot unset nonexistent variables. # Preserve -v and -x to the replacement shell. BASH_ENV=/dev/null ENV=/dev/null (unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV case $- in # (((( *v*x* | *x*v* ) as_opts=-vx ;; *v* ) as_opts=-v ;; *x* ) as_opts=-x ;; * ) as_opts= ;; esac exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"} # Admittedly, this is quite paranoid, since all the known shells bail # out after a failed `exec'. $as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2 exit 255 fi if test x$as_have_required = xno; then : $as_echo "$0: This script requires a shell more modern than all" $as_echo "$0: the shells that I found on your system." if test x${ZSH_VERSION+set} = xset ; then $as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should" $as_echo "$0: be upgraded to zsh 4.3.4 or later." else $as_echo "$0: Please tell bug-autoconf@gnu.org and $0: madp-users@omni.isr.ist.utl.pt about your system, $0: including any error possibly output before this $0: message. Then install a modern shell, or manually run $0: the script under such a shell if you do have one." fi exit 1 fi fi fi SHELL=${CONFIG_SHELL-/bin/sh} export SHELL # Unset more variables known to interfere with behavior of common tools. CLICOLOR_FORCE= GREP_OPTIONS= unset CLICOLOR_FORCE GREP_OPTIONS ## --------------------- ## ## M4sh Shell Functions. ## ## --------------------- ## # as_fn_unset VAR # --------------- # Portably unset VAR. as_fn_unset () { { eval $1=; unset $1;} } as_unset=as_fn_unset # as_fn_set_status STATUS # ----------------------- # Set $? to STATUS, without forking. as_fn_set_status () { return $1 } # as_fn_set_status # as_fn_exit STATUS # ----------------- # Exit the shell with STATUS, even in a "trap 0" or "set -e" context. as_fn_exit () { set +e as_fn_set_status $1 exit $1 } # as_fn_exit # as_fn_mkdir_p # ------------- # Create "$as_dir" as a directory, including parents if necessary. as_fn_mkdir_p () { case $as_dir in #( -*) as_dir=./$as_dir;; esac test -d "$as_dir" || eval $as_mkdir_p || { as_dirs= while :; do case $as_dir in #( *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'( *) as_qdir=$as_dir;; esac as_dirs="'$as_qdir' $as_dirs" as_dir=`$as_dirname -- "$as_dir" || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test -d "$as_dir" && break done test -z "$as_dirs" || eval "mkdir $as_dirs" } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir" } # as_fn_mkdir_p # as_fn_executable_p FILE # ----------------------- # Test if FILE is an executable regular file. as_fn_executable_p () { test -f "$1" && test -x "$1" } # as_fn_executable_p # as_fn_append VAR VALUE # ---------------------- # Append the text in VALUE to the end of the definition contained in VAR. Take # advantage of any shell optimizations that allow amortized linear growth over # repeated appends, instead of the typical quadratic growth present in naive # implementations. if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then : eval 'as_fn_append () { eval $1+=\$2 }' else as_fn_append () { eval $1=\$$1\$2 } fi # as_fn_append # as_fn_arith ARG... # ------------------ # Perform arithmetic evaluation on the ARGs, and store the result in the # global $as_val. Take advantage of shells that can avoid forks. The arguments # must be portable across $(()) and expr. if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then : eval 'as_fn_arith () { as_val=$(( $* )) }' else as_fn_arith () { as_val=`expr "$@" || test $? -eq 1` } fi # as_fn_arith # as_fn_error STATUS ERROR [LINENO LOG_FD] # ---------------------------------------- # Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are # provided, also output the error to LOG_FD, referencing LINENO. Then exit the # script with STATUS, using 1 if that was 0. as_fn_error () { as_status=$1; test $as_status -eq 0 && as_status=1 if test "$4"; then as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4 fi $as_echo "$as_me: error: $2" >&2 as_fn_exit $as_status } # as_fn_error if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then as_dirname=dirname else as_dirname=false fi as_me=`$as_basename -- "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| . 2>/dev/null || $as_echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/ q } /^X\/\(\/\/\)$/{ s//\1/ q } /^X\/\(\/\).*/{ s//\1/ q } s/.*/./; q'` # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits as_lineno_1=$LINENO as_lineno_1a=$LINENO as_lineno_2=$LINENO as_lineno_2a=$LINENO eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" && test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || { # Blame Lee E. McMahon (1931-1989) for sed's syntax. :-) sed -n ' p /[$]LINENO/= ' <$as_myself | sed ' s/[$]LINENO.*/&-/ t lineno b :lineno N :loop s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/ t loop s/-\n.*// ' >$as_me.lineno && chmod +x "$as_me.lineno" || { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; } # If we had to re-execute with $CONFIG_SHELL, we're ensured to have # already done that, so ensure we don't try to do so again and fall # in an infinite loop. This has already happened in practice. _as_can_reexec=no; export _as_can_reexec # Don't try to exec as it changes $[0], causing all sort of problems # (the dirname of $[0] is not the place where we might find the # original and so on. Autoconf is especially sensitive to this). . "./$as_me.lineno" # Exit status is that of the last command. exit } ECHO_C= ECHO_N= ECHO_T= case `echo -n x` in #((((( -n*) case `echo 'xy\c'` in *c*) ECHO_T=' ';; # ECHO_T is single tab character. xy) ECHO_C='\c';; *) echo `echo ksh88 bug on AIX 6.1` > /dev/null ECHO_T=' ';; esac;; *) ECHO_N='-n';; esac rm -f conf$$ conf$$.exe conf$$.file if test -d conf$$.dir; then rm -f conf$$.dir/conf$$.file else rm -f conf$$.dir mkdir conf$$.dir 2>/dev/null fi if (echo >conf$$.file) 2>/dev/null; then if ln -s conf$$.file conf$$ 2>/dev/null; then as_ln_s='ln -s' # ... but there are two gotchas: # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. # In both cases, we have to default to `cp -pR'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -pR' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -pR' fi else as_ln_s='cp -pR' fi rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file rmdir conf$$.dir 2>/dev/null if mkdir -p . 2>/dev/null; then as_mkdir_p='mkdir -p "$as_dir"' else test -d ./-p && rmdir ./-p as_mkdir_p=false fi as_test_x='test -x' as_executable_p=as_fn_executable_p # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" SHELL=${CONFIG_SHELL-/bin/sh} test -n "$DJDIR" || exec 7<&0 &1 # Name of the host. # hostname on some systems (SVR3.2, old GNU/Linux) returns a bogus exit status, # so uname gets run too. ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q` # # Initializations. # ac_default_prefix=/usr/local ac_clean_files= ac_config_libobj_dir=. LIBOBJS= cross_compiling=no subdirs= MFLAGS= MAKEFLAGS= # Identity of this package. PACKAGE_NAME='MADP' PACKAGE_TARNAME='madp' PACKAGE_VERSION='0.4' PACKAGE_STRING='MADP 0.4' PACKAGE_BUGREPORT='madp-users@omni.isr.ist.utl.pt' PACKAGE_URL='' ac_unique_file="config.h.in" # Factoring default headers for most tests. ac_includes_default="\ #include #ifdef HAVE_SYS_TYPES_H # include #endif #ifdef HAVE_SYS_STAT_H # include #endif #ifdef STDC_HEADERS # include # include #else # ifdef HAVE_STDLIB_H # include # endif #endif #ifdef HAVE_STRING_H # if !defined STDC_HEADERS && defined HAVE_MEMORY_H # include # endif # include #endif #ifdef HAVE_STRINGS_H # include #endif #ifdef HAVE_INTTYPES_H # include #endif #ifdef HAVE_STDINT_H # include #endif #ifdef HAVE_UNISTD_H # include #endif" ac_subst_vars='am__EXEEXT_FALSE am__EXEEXT_TRUE LTLIBOBJS FOUND_LIBXML2_FALSE FOUND_LIBXML2_TRUE DARWIN_FALSE DARWIN_TRUE POW_LIB DMALLOC_FALSE DMALLOC_TRUE PROFILE_FALSE PROFILE_TRUE DEBUG_FALSE DEBUG_TRUE LIBOBJS HAVE_CPLEX_FALSE HAVE_CPLEX_TRUE CPLEX_LDFLAGS CPLEX_LIBS CPLEX_INCLUDES CXXCPP OTOOL64 OTOOL LIPO NMEDIT DSYMUTIL MANIFEST_TOOL RANLIB ac_ct_AR AR DLLTOOL OBJDUMP NM ac_ct_DUMPBIN DUMPBIN LD FGREP EGREP GREP SED host_os host_vendor host_cpu host build_os build_vendor build_cpu build LIBTOOL CSTANDARD CSTD CSTDGNU CSTDGNU11 CSTD11 LN_S CPP am__fastdepCC_FALSE am__fastdepCC_TRUE CCDEPMODE ac_ct_CC CFLAGS CC am__fastdepCXX_FALSE am__fastdepCXX_TRUE CXXDEPMODE am__nodep AMDEPBACKSLASH AMDEP_FALSE AMDEP_TRUE am__quote am__include DEPDIR OBJEXT EXEEXT ac_ct_CXX CPPFLAGS LDFLAGS CXXFLAGS CXX AM_BACKSLASH AM_DEFAULT_VERBOSITY AM_DEFAULT_V AM_V am__untar am__tar AMTAR am__leading_dot SET_MAKE AWK mkdir_p MKDIR_P INSTALL_STRIP_PROGRAM STRIP install_sh MAKEINFO AUTOHEADER AUTOMAKE AUTOCONF ACLOCAL VERSION PACKAGE CYGPATH_W am__isrc INSTALL_DATA INSTALL_SCRIPT INSTALL_PROGRAM target_alias host_alias build_alias LIBS ECHO_T ECHO_N ECHO_C DEFS mandir localedir libdir psdir pdfdir dvidir htmldir infodir docdir oldincludedir includedir localstatedir sharedstatedir sysconfdir datadir datarootdir libexecdir sbindir bindir program_transform_name prefix exec_prefix PACKAGE_URL PACKAGE_BUGREPORT PACKAGE_STRING PACKAGE_VERSION PACKAGE_TARNAME PACKAGE_NAME PATH_SEPARATOR SHELL' ac_subst_files='' ac_user_opts=' enable_option_checking enable_silent_rules enable_dependency_tracking enable_shared enable_static with_pic enable_fast_install with_gnu_ld with_sysroot enable_libtool_lock with_cplex with_cplex_includes with_cplex_libs with_cplex_ldflags enable_debug enable_profile enable_dmalloc ' ac_precious_vars='build_alias host_alias target_alias CXX CXXFLAGS LDFLAGS LIBS CPPFLAGS CCC CC CFLAGS CPP CXXCPP' # Initialize some variables set by options. ac_init_help= ac_init_version=false ac_unrecognized_opts= ac_unrecognized_sep= # The variables have the same names as the options, with # dashes changed to underlines. cache_file=/dev/null exec_prefix=NONE no_create= no_recursion= prefix=NONE program_prefix=NONE program_suffix=NONE program_transform_name=s,x,x, silent= site= srcdir= verbose= x_includes=NONE x_libraries=NONE # Installation directory options. # These are left unexpanded so users can "make install exec_prefix=/foo" # and all the variables that are supposed to be based on exec_prefix # by default will actually change. # Use braces instead of parens because sh, perl, etc. also accept them. # (The list follows the same order as the GNU Coding Standards.) bindir='${exec_prefix}/bin' sbindir='${exec_prefix}/sbin' libexecdir='${exec_prefix}/libexec' datarootdir='${prefix}/share' datadir='${datarootdir}' sysconfdir='${prefix}/etc' sharedstatedir='${prefix}/com' localstatedir='${prefix}/var' includedir='${prefix}/include' oldincludedir='/usr/include' docdir='${datarootdir}/doc/${PACKAGE_TARNAME}' infodir='${datarootdir}/info' htmldir='${docdir}' dvidir='${docdir}' pdfdir='${docdir}' psdir='${docdir}' libdir='${exec_prefix}/lib' localedir='${datarootdir}/locale' mandir='${datarootdir}/man' ac_prev= ac_dashdash= for ac_option do # If the previous option needs an argument, assign it. if test -n "$ac_prev"; then eval $ac_prev=\$ac_option ac_prev= continue fi case $ac_option in *=?*) ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;; *=) ac_optarg= ;; *) ac_optarg=yes ;; esac # Accept the important Cygnus configure options, so we can diagnose typos. case $ac_dashdash$ac_option in --) ac_dashdash=yes ;; -bindir | --bindir | --bindi | --bind | --bin | --bi) ac_prev=bindir ;; -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*) bindir=$ac_optarg ;; -build | --build | --buil | --bui | --bu) ac_prev=build_alias ;; -build=* | --build=* | --buil=* | --bui=* | --bu=*) build_alias=$ac_optarg ;; -cache-file | --cache-file | --cache-fil | --cache-fi \ | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c) ac_prev=cache_file ;; -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \ | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*) cache_file=$ac_optarg ;; --config-cache | -C) cache_file=config.cache ;; -datadir | --datadir | --datadi | --datad) ac_prev=datadir ;; -datadir=* | --datadir=* | --datadi=* | --datad=*) datadir=$ac_optarg ;; -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \ | --dataroo | --dataro | --datar) ac_prev=datarootdir ;; -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \ | --dataroot=* | --dataroo=* | --dataro=* | --datar=*) datarootdir=$ac_optarg ;; -disable-* | --disable-*) ac_useropt=`expr "x$ac_option" : 'x-*disable-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid feature name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "enable_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval enable_$ac_useropt=no ;; -docdir | --docdir | --docdi | --doc | --do) ac_prev=docdir ;; -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*) docdir=$ac_optarg ;; -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv) ac_prev=dvidir ;; -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*) dvidir=$ac_optarg ;; -enable-* | --enable-*) ac_useropt=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid feature name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "enable_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval enable_$ac_useropt=\$ac_optarg ;; -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \ | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \ | --exec | --exe | --ex) ac_prev=exec_prefix ;; -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \ | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \ | --exec=* | --exe=* | --ex=*) exec_prefix=$ac_optarg ;; -gas | --gas | --ga | --g) # Obsolete; use --with-gas. with_gas=yes ;; -help | --help | --hel | --he | -h) ac_init_help=long ;; -help=r* | --help=r* | --hel=r* | --he=r* | -hr*) ac_init_help=recursive ;; -help=s* | --help=s* | --hel=s* | --he=s* | -hs*) ac_init_help=short ;; -host | --host | --hos | --ho) ac_prev=host_alias ;; -host=* | --host=* | --hos=* | --ho=*) host_alias=$ac_optarg ;; -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht) ac_prev=htmldir ;; -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \ | --ht=*) htmldir=$ac_optarg ;; -includedir | --includedir | --includedi | --included | --include \ | --includ | --inclu | --incl | --inc) ac_prev=includedir ;; -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \ | --includ=* | --inclu=* | --incl=* | --inc=*) includedir=$ac_optarg ;; -infodir | --infodir | --infodi | --infod | --info | --inf) ac_prev=infodir ;; -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*) infodir=$ac_optarg ;; -libdir | --libdir | --libdi | --libd) ac_prev=libdir ;; -libdir=* | --libdir=* | --libdi=* | --libd=*) libdir=$ac_optarg ;; -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \ | --libexe | --libex | --libe) ac_prev=libexecdir ;; -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \ | --libexe=* | --libex=* | --libe=*) libexecdir=$ac_optarg ;; -localedir | --localedir | --localedi | --localed | --locale) ac_prev=localedir ;; -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*) localedir=$ac_optarg ;; -localstatedir | --localstatedir | --localstatedi | --localstated \ | --localstate | --localstat | --localsta | --localst | --locals) ac_prev=localstatedir ;; -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \ | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*) localstatedir=$ac_optarg ;; -mandir | --mandir | --mandi | --mand | --man | --ma | --m) ac_prev=mandir ;; -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*) mandir=$ac_optarg ;; -nfp | --nfp | --nf) # Obsolete; use --without-fp. with_fp=no ;; -no-create | --no-create | --no-creat | --no-crea | --no-cre \ | --no-cr | --no-c | -n) no_create=yes ;; -no-recursion | --no-recursion | --no-recursio | --no-recursi \ | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r) no_recursion=yes ;; -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \ | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \ | --oldin | --oldi | --old | --ol | --o) ac_prev=oldincludedir ;; -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \ | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \ | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*) oldincludedir=$ac_optarg ;; -prefix | --prefix | --prefi | --pref | --pre | --pr | --p) ac_prev=prefix ;; -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*) prefix=$ac_optarg ;; -program-prefix | --program-prefix | --program-prefi | --program-pref \ | --program-pre | --program-pr | --program-p) ac_prev=program_prefix ;; -program-prefix=* | --program-prefix=* | --program-prefi=* \ | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*) program_prefix=$ac_optarg ;; -program-suffix | --program-suffix | --program-suffi | --program-suff \ | --program-suf | --program-su | --program-s) ac_prev=program_suffix ;; -program-suffix=* | --program-suffix=* | --program-suffi=* \ | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*) program_suffix=$ac_optarg ;; -program-transform-name | --program-transform-name \ | --program-transform-nam | --program-transform-na \ | --program-transform-n | --program-transform- \ | --program-transform | --program-transfor \ | --program-transfo | --program-transf \ | --program-trans | --program-tran \ | --progr-tra | --program-tr | --program-t) ac_prev=program_transform_name ;; -program-transform-name=* | --program-transform-name=* \ | --program-transform-nam=* | --program-transform-na=* \ | --program-transform-n=* | --program-transform-=* \ | --program-transform=* | --program-transfor=* \ | --program-transfo=* | --program-transf=* \ | --program-trans=* | --program-tran=* \ | --progr-tra=* | --program-tr=* | --program-t=*) program_transform_name=$ac_optarg ;; -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd) ac_prev=pdfdir ;; -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*) pdfdir=$ac_optarg ;; -psdir | --psdir | --psdi | --psd | --ps) ac_prev=psdir ;; -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*) psdir=$ac_optarg ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) silent=yes ;; -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb) ac_prev=sbindir ;; -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \ | --sbi=* | --sb=*) sbindir=$ac_optarg ;; -sharedstatedir | --sharedstatedir | --sharedstatedi \ | --sharedstated | --sharedstate | --sharedstat | --sharedsta \ | --sharedst | --shareds | --shared | --share | --shar \ | --sha | --sh) ac_prev=sharedstatedir ;; -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \ | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \ | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \ | --sha=* | --sh=*) sharedstatedir=$ac_optarg ;; -site | --site | --sit) ac_prev=site ;; -site=* | --site=* | --sit=*) site=$ac_optarg ;; -srcdir | --srcdir | --srcdi | --srcd | --src | --sr) ac_prev=srcdir ;; -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*) srcdir=$ac_optarg ;; -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \ | --syscon | --sysco | --sysc | --sys | --sy) ac_prev=sysconfdir ;; -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \ | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*) sysconfdir=$ac_optarg ;; -target | --target | --targe | --targ | --tar | --ta | --t) ac_prev=target_alias ;; -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*) target_alias=$ac_optarg ;; -v | -verbose | --verbose | --verbos | --verbo | --verb) verbose=yes ;; -version | --version | --versio | --versi | --vers | -V) ac_init_version=: ;; -with-* | --with-*) ac_useropt=`expr "x$ac_option" : 'x-*with-\([^=]*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid package name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "with_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval with_$ac_useropt=\$ac_optarg ;; -without-* | --without-*) ac_useropt=`expr "x$ac_option" : 'x-*without-\(.*\)'` # Reject names that are not valid shell variable names. expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null && as_fn_error $? "invalid package name: $ac_useropt" ac_useropt_orig=$ac_useropt ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'` case $ac_user_opts in *" "with_$ac_useropt" "*) ;; *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig" ac_unrecognized_sep=', ';; esac eval with_$ac_useropt=no ;; --x) # Obsolete; use --with-x. with_x=yes ;; -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \ | --x-incl | --x-inc | --x-in | --x-i) ac_prev=x_includes ;; -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \ | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*) x_includes=$ac_optarg ;; -x-libraries | --x-libraries | --x-librarie | --x-librari \ | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l) ac_prev=x_libraries ;; -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \ | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*) x_libraries=$ac_optarg ;; -*) as_fn_error $? "unrecognized option: \`$ac_option' Try \`$0 --help' for more information" ;; *=*) ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='` # Reject names that are not valid shell variable names. case $ac_envvar in #( '' | [0-9]* | *[!_$as_cr_alnum]* ) as_fn_error $? "invalid variable name: \`$ac_envvar'" ;; esac eval $ac_envvar=\$ac_optarg export $ac_envvar ;; *) # FIXME: should be removed in autoconf 3.0. $as_echo "$as_me: WARNING: you should use --build, --host, --target" >&2 expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null && $as_echo "$as_me: WARNING: invalid host type: $ac_option" >&2 : "${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option}" ;; esac done if test -n "$ac_prev"; then ac_option=--`echo $ac_prev | sed 's/_/-/g'` as_fn_error $? "missing argument to $ac_option" fi if test -n "$ac_unrecognized_opts"; then case $enable_option_checking in no) ;; fatal) as_fn_error $? "unrecognized options: $ac_unrecognized_opts" ;; *) $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2 ;; esac fi # Check all directory arguments for consistency. for ac_var in exec_prefix prefix bindir sbindir libexecdir datarootdir \ datadir sysconfdir sharedstatedir localstatedir includedir \ oldincludedir docdir infodir htmldir dvidir pdfdir psdir \ libdir localedir mandir do eval ac_val=\$$ac_var # Remove trailing slashes. case $ac_val in */ ) ac_val=`expr "X$ac_val" : 'X\(.*[^/]\)' \| "X$ac_val" : 'X\(.*\)'` eval $ac_var=\$ac_val;; esac # Be sure to have absolute directory names. case $ac_val in [\\/$]* | ?:[\\/]* ) continue;; NONE | '' ) case $ac_var in *prefix ) continue;; esac;; esac as_fn_error $? "expected an absolute directory name for --$ac_var: $ac_val" done # There might be people who depend on the old broken behavior: `$host' # used to hold the argument of --host etc. # FIXME: To remove some day. build=$build_alias host=$host_alias target=$target_alias # FIXME: To remove some day. if test "x$host_alias" != x; then if test "x$build_alias" = x; then cross_compiling=maybe elif test "x$build_alias" != "x$host_alias"; then cross_compiling=yes fi fi ac_tool_prefix= test -n "$host_alias" && ac_tool_prefix=$host_alias- test "$silent" = yes && exec 6>/dev/null ac_pwd=`pwd` && test -n "$ac_pwd" && ac_ls_di=`ls -di .` && ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` || as_fn_error $? "working directory cannot be determined" test "X$ac_ls_di" = "X$ac_pwd_ls_di" || as_fn_error $? "pwd does not report name of working directory" # Find the source files, if location was not specified. if test -z "$srcdir"; then ac_srcdir_defaulted=yes # Try the directory containing this script, then the parent directory. ac_confdir=`$as_dirname -- "$as_myself" || $as_expr X"$as_myself" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_myself" : 'X\(//\)[^/]' \| \ X"$as_myself" : 'X\(//\)$' \| \ X"$as_myself" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_myself" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` srcdir=$ac_confdir if test ! -r "$srcdir/$ac_unique_file"; then srcdir=.. fi else ac_srcdir_defaulted=no fi if test ! -r "$srcdir/$ac_unique_file"; then test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .." as_fn_error $? "cannot find sources ($ac_unique_file) in $srcdir" fi ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work" ac_abs_confdir=`( cd "$srcdir" && test -r "./$ac_unique_file" || as_fn_error $? "$ac_msg" pwd)` # When building in place, set srcdir=. if test "$ac_abs_confdir" = "$ac_pwd"; then srcdir=. fi # Remove unnecessary trailing slashes from srcdir. # Double slashes in file names in object file debugging info # mess up M-x gdb in Emacs. case $srcdir in */) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;; esac for ac_var in $ac_precious_vars; do eval ac_env_${ac_var}_set=\${${ac_var}+set} eval ac_env_${ac_var}_value=\$${ac_var} eval ac_cv_env_${ac_var}_set=\${${ac_var}+set} eval ac_cv_env_${ac_var}_value=\$${ac_var} done # # Report the --help message. # if test "$ac_init_help" = "long"; then # Omit some internal or obsolete options to make the list less imposing. # This message is too long to be a string in the A/UX 3.1 sh. cat <<_ACEOF \`configure' configures MADP 0.4 to adapt to many kinds of systems. Usage: $0 [OPTION]... [VAR=VALUE]... To assign environment variables (e.g., CC, CFLAGS...), specify them as VAR=VALUE. See below for descriptions of some of the useful variables. Defaults for the options are specified in brackets. Configuration: -h, --help display this help and exit --help=short display options specific to this package --help=recursive display the short help of all the included packages -V, --version display version information and exit -q, --quiet, --silent do not print \`checking ...' messages --cache-file=FILE cache test results in FILE [disabled] -C, --config-cache alias for \`--cache-file=config.cache' -n, --no-create do not create output files --srcdir=DIR find the sources in DIR [configure dir or \`..'] Installation directories: --prefix=PREFIX install architecture-independent files in PREFIX [$ac_default_prefix] --exec-prefix=EPREFIX install architecture-dependent files in EPREFIX [PREFIX] By default, \`make install' will install all the files in \`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc. You can specify an installation prefix other than \`$ac_default_prefix' using \`--prefix', for instance \`--prefix=\$HOME'. For better control, use the options below. Fine tuning of the installation directories: --bindir=DIR user executables [EPREFIX/bin] --sbindir=DIR system admin executables [EPREFIX/sbin] --libexecdir=DIR program executables [EPREFIX/libexec] --sysconfdir=DIR read-only single-machine data [PREFIX/etc] --sharedstatedir=DIR modifiable architecture-independent data [PREFIX/com] --localstatedir=DIR modifiable single-machine data [PREFIX/var] --libdir=DIR object code libraries [EPREFIX/lib] --includedir=DIR C header files [PREFIX/include] --oldincludedir=DIR C header files for non-gcc [/usr/include] --datarootdir=DIR read-only arch.-independent data root [PREFIX/share] --datadir=DIR read-only architecture-independent data [DATAROOTDIR] --infodir=DIR info documentation [DATAROOTDIR/info] --localedir=DIR locale-dependent data [DATAROOTDIR/locale] --mandir=DIR man documentation [DATAROOTDIR/man] --docdir=DIR documentation root [DATAROOTDIR/doc/madp] --htmldir=DIR html documentation [DOCDIR] --dvidir=DIR dvi documentation [DOCDIR] --pdfdir=DIR pdf documentation [DOCDIR] --psdir=DIR ps documentation [DOCDIR] _ACEOF cat <<\_ACEOF Program names: --program-prefix=PREFIX prepend PREFIX to installed program names --program-suffix=SUFFIX append SUFFIX to installed program names --program-transform-name=PROGRAM run sed PROGRAM on installed program names System types: --build=BUILD configure for building on BUILD [guessed] --host=HOST cross-compile to build programs to run on HOST [BUILD] _ACEOF fi if test -n "$ac_init_help"; then case $ac_init_help in short | recursive ) echo "Configuration of MADP 0.4:";; esac cat <<\_ACEOF Optional Features: --disable-option-checking ignore unrecognized --enable/--with options --disable-FEATURE do not include FEATURE (same as --enable-FEATURE=no) --enable-FEATURE[=ARG] include FEATURE [ARG=yes] --enable-silent-rules less verbose build output (undo: "make V=1") --disable-silent-rules verbose build output (undo: "make V=0") --enable-dependency-tracking do not reject slow dependency extractors --disable-dependency-tracking speeds up one-time build --enable-shared[=PKGS] build shared libraries [default=yes] --enable-static[=PKGS] build static libraries [default=yes] --enable-fast-install[=PKGS] optimize for fast installation [default=yes] --disable-libtool-lock avoid locking (might break parallel builds) --enable-debug enable debugging symbols --enable-profile enable debugging symbols and profiling --enable-dmalloc enable using dmalloc memory checker Optional Packages: --with-PACKAGE[=ARG] use PACKAGE [ARG=yes] --without-PACKAGE do not use PACKAGE (same as --with-PACKAGE=no) --with-pic[=PKGS] try to use only PIC/non-PIC objects [default=use both] --with-gnu-ld assume the C compiler uses GNU ld [default=no] --with-sysroot=DIR Search for dependent libraries within DIR (or the compiler's sysroot if not specified). --without-cplex disable checking for CPLEX --with-cplex-includes= include flags for CPLEX library headers. E.g., "-I$CPLEX_LOCATION/cplex/include/ -I$CPLEX_LOCATION/concert/include/" --with-cplex-libs= link with these CPLEX libraries, E.g., "-lilocplex -lconcert -lcplex" --with-cplex-ldflags= link with these CPLEX flags. E.g., "-L$CPLEX_LOCATION/cplex/lib/x86-64_sles10_4.1/static_pic -L$CPLEX_LOCATION/concert/lib/x86-64_sles10_4.1/static_pic" Some influential environment variables: CXX C++ compiler command CXXFLAGS C++ compiler flags LDFLAGS linker flags, e.g. -L if you have libraries in a nonstandard directory LIBS libraries to pass to the linker, e.g. -l CPPFLAGS (Objective) C/C++ preprocessor flags, e.g. -I if you have headers in a nonstandard directory CC C compiler command CFLAGS C compiler flags CPP C preprocessor CXXCPP C++ preprocessor Use these variables to override the choices made by `configure' or to help it to find libraries and programs with nonstandard names/locations. Report bugs to . _ACEOF ac_status=$? fi if test "$ac_init_help" = "recursive"; then # If there are subdirs, report their specific --help. for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue test -d "$ac_dir" || { cd "$srcdir" && ac_pwd=`pwd` && srcdir=. && test -d "$ac_dir"; } || continue ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix cd "$ac_dir" || { ac_status=$?; continue; } # Check for guested configure. if test -f "$ac_srcdir/configure.gnu"; then echo && $SHELL "$ac_srcdir/configure.gnu" --help=recursive elif test -f "$ac_srcdir/configure"; then echo && $SHELL "$ac_srcdir/configure" --help=recursive else $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2 fi || ac_status=$? cd "$ac_pwd" || { ac_status=$?; break; } done fi test -n "$ac_init_help" && exit $ac_status if $ac_init_version; then cat <<\_ACEOF MADP configure 0.4 generated by GNU Autoconf 2.69 Copyright (C) 2012 Free Software Foundation, Inc. This configure script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it. _ACEOF exit fi ## ------------------------ ## ## Autoconf initialization. ## ## ------------------------ ## # ac_fn_cxx_try_compile LINENO # ---------------------------- # Try to compile conftest.$ac_ext, and return whether this succeeded. ac_fn_cxx_try_compile () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext if { { ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compile") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_cxx_werror_flag" || test ! -s conftest.err } && test -s conftest.$ac_objext; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_cxx_try_compile # ac_fn_c_try_compile LINENO # -------------------------- # Try to compile conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_compile () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext if { { ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compile") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest.$ac_objext; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_compile # ac_fn_c_try_cpp LINENO # ---------------------- # Try to preprocess conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_cpp () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if { { ac_try="$ac_cpp conftest.$ac_ext" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_cpp conftest.$ac_ext") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } > conftest.i && { test -z "$ac_c_preproc_warn_flag$ac_c_werror_flag" || test ! -s conftest.err }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_cpp # ac_fn_c_try_link LINENO # ----------------------- # Try to link conftest.$ac_ext, and return whether this succeeded. ac_fn_c_try_link () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext conftest$ac_exeext if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_c_werror_flag" || test ! -s conftest.err } && test -s conftest$ac_exeext && { test "$cross_compiling" = yes || test -x conftest$ac_exeext }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi # Delete the IPA/IPO (Inter Procedural Analysis/Optimization) information # created by the PGI compiler (conftest_ipa8_conftest.oo), as it would # interfere with the next link command; also delete a directory that is # left behind by Apple's compiler. We do this before executing the actions. rm -rf conftest.dSYM conftest_ipa8_conftest.oo eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_link # ac_fn_c_check_header_compile LINENO HEADER VAR INCLUDES # ------------------------------------------------------- # Tests whether HEADER exists and can be compiled using the include files in # INCLUDES, setting the cache variable VAR accordingly. ac_fn_c_check_header_compile () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 #include <$2> _ACEOF if ac_fn_c_try_compile "$LINENO"; then : eval "$3=yes" else eval "$3=no" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_c_check_header_compile # ac_fn_c_try_run LINENO # ---------------------- # Try to link conftest.$ac_ext, and return whether this succeeded. Assumes # that executables *can* be run. ac_fn_c_try_run () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { ac_try='./conftest$ac_exeext' { { case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_try") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; }; then : ac_retval=0 else $as_echo "$as_me: program exited with status $ac_status" >&5 $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=$ac_status fi rm -rf conftest.dSYM conftest_ipa8_conftest.oo eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_c_try_run # ac_fn_c_check_func LINENO FUNC VAR # ---------------------------------- # Tests whether FUNC exists, setting the cache variable VAR accordingly ac_fn_c_check_func () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Define $2 to an innocuous variant, in case declares $2. For example, HP-UX 11i declares gettimeofday. */ #define $2 innocuous_$2 /* System header to define __stub macros and hopefully few prototypes, which can conflict with char $2 (); below. Prefer to if __STDC__ is defined, since exists even on freestanding compilers. */ #ifdef __STDC__ # include #else # include #endif #undef $2 /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char $2 (); /* The GNU C library defines this for functions which it implements to always fail with ENOSYS. Some functions are actually named something starting with __ and the normal name is an alias. */ #if defined __stub_$2 || defined __stub___$2 choke me #endif int main () { return $2 (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : eval "$3=yes" else eval "$3=no" fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_c_check_func # ac_fn_cxx_try_cpp LINENO # ------------------------ # Try to preprocess conftest.$ac_ext, and return whether this succeeded. ac_fn_cxx_try_cpp () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if { { ac_try="$ac_cpp conftest.$ac_ext" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_cpp conftest.$ac_ext") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } > conftest.i && { test -z "$ac_cxx_preproc_warn_flag$ac_cxx_werror_flag" || test ! -s conftest.err }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_cxx_try_cpp # ac_fn_cxx_try_link LINENO # ------------------------- # Try to link conftest.$ac_ext, and return whether this succeeded. ac_fn_cxx_try_link () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack rm -f conftest.$ac_objext conftest$ac_exeext if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>conftest.err ac_status=$? if test -s conftest.err; then grep -v '^ *+' conftest.err >conftest.er1 cat conftest.er1 >&5 mv -f conftest.er1 conftest.err fi $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && { test -z "$ac_cxx_werror_flag" || test ! -s conftest.err } && test -s conftest$ac_exeext && { test "$cross_compiling" = yes || test -x conftest$ac_exeext }; then : ac_retval=0 else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 ac_retval=1 fi # Delete the IPA/IPO (Inter Procedural Analysis/Optimization) information # created by the PGI compiler (conftest_ipa8_conftest.oo), as it would # interfere with the next link command; also delete a directory that is # left behind by Apple's compiler. We do this before executing the actions. rm -rf conftest.dSYM conftest_ipa8_conftest.oo eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno as_fn_set_status $ac_retval } # ac_fn_cxx_try_link # ac_fn_c_check_header_mongrel LINENO HEADER VAR INCLUDES # ------------------------------------------------------- # Tests whether HEADER exists, giving a warning if it cannot be compiled using # the include files in INCLUDES and setting the cache variable VAR # accordingly. ac_fn_c_check_header_mongrel () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack if eval \${$3+:} false; then : { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } else # Is the header compilable? { $as_echo "$as_me:${as_lineno-$LINENO}: checking $2 usability" >&5 $as_echo_n "checking $2 usability... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 #include <$2> _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_header_compiler=yes else ac_header_compiler=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_header_compiler" >&5 $as_echo "$ac_header_compiler" >&6; } # Is the header present? { $as_echo "$as_me:${as_lineno-$LINENO}: checking $2 presence" >&5 $as_echo_n "checking $2 presence... " >&6; } cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include <$2> _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : ac_header_preproc=yes else ac_header_preproc=no fi rm -f conftest.err conftest.i conftest.$ac_ext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_header_preproc" >&5 $as_echo "$ac_header_preproc" >&6; } # So? What about this header? case $ac_header_compiler:$ac_header_preproc:$ac_c_preproc_warn_flag in #(( yes:no: ) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: accepted by the compiler, rejected by the preprocessor!" >&5 $as_echo "$as_me: WARNING: $2: accepted by the compiler, rejected by the preprocessor!" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: proceeding with the compiler's result" >&5 $as_echo "$as_me: WARNING: $2: proceeding with the compiler's result" >&2;} ;; no:yes:* ) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: present but cannot be compiled" >&5 $as_echo "$as_me: WARNING: $2: present but cannot be compiled" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: check for missing prerequisite headers?" >&5 $as_echo "$as_me: WARNING: $2: check for missing prerequisite headers?" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: see the Autoconf documentation" >&5 $as_echo "$as_me: WARNING: $2: see the Autoconf documentation" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: section \"Present But Cannot Be Compiled\"" >&5 $as_echo "$as_me: WARNING: $2: section \"Present But Cannot Be Compiled\"" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $2: proceeding with the compiler's result" >&5 $as_echo "$as_me: WARNING: $2: proceeding with the compiler's result" >&2;} ( $as_echo "## --------------------------------------------- ## ## Report this to madp-users@omni.isr.ist.utl.pt ## ## --------------------------------------------- ##" ) | sed "s/^/$as_me: WARNING: /" >&2 ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 else eval "$3=\$ac_header_compiler" fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } fi eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_c_check_header_mongrel # ac_fn_c_check_type LINENO TYPE VAR INCLUDES # ------------------------------------------- # Tests whether TYPE exists after having included INCLUDES, setting cache # variable VAR accordingly. ac_fn_c_check_type () { as_lineno=${as_lineno-"$1"} as_lineno_stack=as_lineno_stack=$as_lineno_stack { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $2" >&5 $as_echo_n "checking for $2... " >&6; } if eval \${$3+:} false; then : $as_echo_n "(cached) " >&6 else eval "$3=no" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { if (sizeof ($2)) return 0; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $4 int main () { if (sizeof (($2))) return 0; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : else eval "$3=yes" fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi eval ac_res=\$$3 { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_res" >&5 $as_echo "$ac_res" >&6; } eval $as_lineno_stack; ${as_lineno_stack:+:} unset as_lineno } # ac_fn_c_check_type cat >config.log <<_ACEOF This file contains any messages produced by compilers while running configure, to aid debugging if configure makes a mistake. It was created by MADP $as_me 0.4, which was generated by GNU Autoconf 2.69. Invocation command line was $ $0 $@ _ACEOF exec 5>>config.log { cat <<_ASUNAME ## --------- ## ## Platform. ## ## --------- ## hostname = `(hostname || uname -n) 2>/dev/null | sed 1q` uname -m = `(uname -m) 2>/dev/null || echo unknown` uname -r = `(uname -r) 2>/dev/null || echo unknown` uname -s = `(uname -s) 2>/dev/null || echo unknown` uname -v = `(uname -v) 2>/dev/null || echo unknown` /usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown` /bin/uname -X = `(/bin/uname -X) 2>/dev/null || echo unknown` /bin/arch = `(/bin/arch) 2>/dev/null || echo unknown` /usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null || echo unknown` /usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown` /usr/bin/hostinfo = `(/usr/bin/hostinfo) 2>/dev/null || echo unknown` /bin/machine = `(/bin/machine) 2>/dev/null || echo unknown` /usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null || echo unknown` /bin/universe = `(/bin/universe) 2>/dev/null || echo unknown` _ASUNAME as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. $as_echo "PATH: $as_dir" done IFS=$as_save_IFS } >&5 cat >&5 <<_ACEOF ## ----------- ## ## Core tests. ## ## ----------- ## _ACEOF # Keep a trace of the command line. # Strip out --no-create and --no-recursion so they do not pile up. # Strip out --silent because we don't want to record it for future runs. # Also quote any args containing shell meta-characters. # Make two passes to allow for proper duplicate-argument suppression. ac_configure_args= ac_configure_args0= ac_configure_args1= ac_must_keep_next=false for ac_pass in 1 2 do for ac_arg do case $ac_arg in -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) continue ;; *\'*) ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;; esac case $ac_pass in 1) as_fn_append ac_configure_args0 " '$ac_arg'" ;; 2) as_fn_append ac_configure_args1 " '$ac_arg'" if test $ac_must_keep_next = true; then ac_must_keep_next=false # Got value, back to normal. else case $ac_arg in *=* | --config-cache | -C | -disable-* | --disable-* \ | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \ | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \ | -with-* | --with-* | -without-* | --without-* | --x) case "$ac_configure_args0 " in "$ac_configure_args1"*" '$ac_arg' "* ) continue ;; esac ;; -* ) ac_must_keep_next=true ;; esac fi as_fn_append ac_configure_args " '$ac_arg'" ;; esac done done { ac_configure_args0=; unset ac_configure_args0;} { ac_configure_args1=; unset ac_configure_args1;} # When interrupted or exit'd, cleanup temporary files, and complete # config.log. We remove comments because anyway the quotes in there # would cause problems or look ugly. # WARNING: Use '\'' to represent an apostrophe within the trap. # WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug. trap 'exit_status=$? # Save into config.log some information that might help in debugging. { echo $as_echo "## ---------------- ## ## Cache variables. ## ## ---------------- ##" echo # The following way of writing the cache mishandles newlines in values, ( for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 $as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( *) { eval $ac_var=; unset $ac_var;} ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #( *${as_nl}ac_space=\ *) sed -n \ "s/'\''/'\''\\\\'\'''\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p" ;; #( *) sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) echo $as_echo "## ----------------- ## ## Output variables. ## ## ----------------- ##" echo for ac_var in $ac_subst_vars do eval ac_val=\$$ac_var case $ac_val in *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; esac $as_echo "$ac_var='\''$ac_val'\''" done | sort echo if test -n "$ac_subst_files"; then $as_echo "## ------------------- ## ## File substitutions. ## ## ------------------- ##" echo for ac_var in $ac_subst_files do eval ac_val=\$$ac_var case $ac_val in *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;; esac $as_echo "$ac_var='\''$ac_val'\''" done | sort echo fi if test -s confdefs.h; then $as_echo "## ----------- ## ## confdefs.h. ## ## ----------- ##" echo cat confdefs.h echo fi test "$ac_signal" != 0 && $as_echo "$as_me: caught signal $ac_signal" $as_echo "$as_me: exit $exit_status" } >&5 rm -f core *.core core.conftest.* && rm -f -r conftest* confdefs* conf$$* $ac_clean_files && exit $exit_status ' 0 for ac_signal in 1 2 13 15; do trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal done ac_signal=0 # confdefs.h avoids OS command line length limits that DEFS can exceed. rm -f -r conftest* confdefs.h $as_echo "/* confdefs.h */" > confdefs.h # Predefined preprocessor variables. cat >>confdefs.h <<_ACEOF #define PACKAGE_NAME "$PACKAGE_NAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_TARNAME "$PACKAGE_TARNAME" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_VERSION "$PACKAGE_VERSION" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_STRING "$PACKAGE_STRING" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT" _ACEOF cat >>confdefs.h <<_ACEOF #define PACKAGE_URL "$PACKAGE_URL" _ACEOF # Let the site file select an alternate cache file if it wants to. # Prefer an explicitly selected file to automatically selected ones. ac_site_file1=NONE ac_site_file2=NONE if test -n "$CONFIG_SITE"; then # We do not want a PATH search for config.site. case $CONFIG_SITE in #(( -*) ac_site_file1=./$CONFIG_SITE;; */*) ac_site_file1=$CONFIG_SITE;; *) ac_site_file1=./$CONFIG_SITE;; esac elif test "x$prefix" != xNONE; then ac_site_file1=$prefix/share/config.site ac_site_file2=$prefix/etc/config.site else ac_site_file1=$ac_default_prefix/share/config.site ac_site_file2=$ac_default_prefix/etc/config.site fi for ac_site_file in "$ac_site_file1" "$ac_site_file2" do test "x$ac_site_file" = xNONE && continue if test /dev/null != "$ac_site_file" && test -r "$ac_site_file"; then { $as_echo "$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file" >&5 $as_echo "$as_me: loading site script $ac_site_file" >&6;} sed 's/^/| /' "$ac_site_file" >&5 . "$ac_site_file" \ || { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "failed to load site script $ac_site_file See \`config.log' for more details" "$LINENO" 5; } fi done if test -r "$cache_file"; then # Some versions of bash will fail to source /dev/null (special files # actually), so we avoid doing that. DJGPP emulates it as a regular file. if test /dev/null != "$cache_file" && test -f "$cache_file"; then { $as_echo "$as_me:${as_lineno-$LINENO}: loading cache $cache_file" >&5 $as_echo "$as_me: loading cache $cache_file" >&6;} case $cache_file in [\\/]* | ?:[\\/]* ) . "$cache_file";; *) . "./$cache_file";; esac fi else { $as_echo "$as_me:${as_lineno-$LINENO}: creating cache $cache_file" >&5 $as_echo "$as_me: creating cache $cache_file" >&6;} >$cache_file fi # Check that the precious variables saved in the cache have kept the same # value. ac_cache_corrupted=false for ac_var in $ac_precious_vars; do eval ac_old_set=\$ac_cv_env_${ac_var}_set eval ac_new_set=\$ac_env_${ac_var}_set eval ac_old_val=\$ac_cv_env_${ac_var}_value eval ac_new_val=\$ac_env_${ac_var}_value case $ac_old_set,$ac_new_set in set,) { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5 $as_echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;} ac_cache_corrupted=: ;; ,set) { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was not set in the previous run" >&5 $as_echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;} ac_cache_corrupted=: ;; ,);; *) if test "x$ac_old_val" != "x$ac_new_val"; then # differences in whitespace do not lead to failure. ac_old_val_w=`echo x $ac_old_val` ac_new_val_w=`echo x $ac_new_val` if test "$ac_old_val_w" != "$ac_new_val_w"; then { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' has changed since the previous run:" >&5 $as_echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;} ac_cache_corrupted=: else { $as_echo "$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&5 $as_echo "$as_me: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&2;} eval $ac_var=\$ac_old_val fi { $as_echo "$as_me:${as_lineno-$LINENO}: former value: \`$ac_old_val'" >&5 $as_echo "$as_me: former value: \`$ac_old_val'" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: current value: \`$ac_new_val'" >&5 $as_echo "$as_me: current value: \`$ac_new_val'" >&2;} fi;; esac # Pass precious variables to config.status. if test "$ac_new_set" = set; then case $ac_new_val in *\'*) ac_arg=$ac_var=`$as_echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;; *) ac_arg=$ac_var=$ac_new_val ;; esac case " $ac_configure_args " in *" '$ac_arg' "*) ;; # Avoid dups. Use of quotes ensures accuracy. *) as_fn_append ac_configure_args " '$ac_arg'" ;; esac fi done if $ac_cache_corrupted; then { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} { $as_echo "$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build" >&5 $as_echo "$as_me: error: changes in the environment can compromise the build" >&2;} as_fn_error $? "run \`make distclean' and/or \`rm $cache_file' and start over" "$LINENO" 5 fi ## -------------------- ## ## Main body of script. ## ## -------------------- ## ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu # subdir-objects is used in src/libpomdp-solve am__api_version='1.14' ac_aux_dir= for ac_dir in "$srcdir" "$srcdir/.." "$srcdir/../.."; do if test -f "$ac_dir/install-sh"; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/install-sh -c" break elif test -f "$ac_dir/install.sh"; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/install.sh -c" break elif test -f "$ac_dir/shtool"; then ac_aux_dir=$ac_dir ac_install_sh="$ac_aux_dir/shtool install -c" break fi done if test -z "$ac_aux_dir"; then as_fn_error $? "cannot find install-sh, install.sh, or shtool in \"$srcdir\" \"$srcdir/..\" \"$srcdir/../..\"" "$LINENO" 5 fi # These three variables are undocumented and unsupported, # and are intended to be withdrawn in a future Autoconf release. # They can cause serious problems if a builder's source tree is in a directory # whose full name contains unusual characters. ac_config_guess="$SHELL $ac_aux_dir/config.guess" # Please don't use this var. ac_config_sub="$SHELL $ac_aux_dir/config.sub" # Please don't use this var. ac_configure="$SHELL $ac_aux_dir/configure" # Please don't use this var. # Find a good install program. We prefer a C program (faster), # so one script is as good as another. But avoid the broken or # incompatible versions: # SysV /etc/install, /usr/sbin/install # SunOS /usr/etc/install # IRIX /sbin/install # AIX /bin/install # AmigaOS /C/install, which installs bootblocks on floppy discs # AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag # AFS /usr/afsws/bin/install, which mishandles nonexistent args # SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff" # OS/2's system install, which has a completely different semantic # ./install, which can be erroneously created by make from ./install.sh. # Reject install programs that cannot install multiple files. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a BSD-compatible install" >&5 $as_echo_n "checking for a BSD-compatible install... " >&6; } if test -z "$INSTALL"; then if ${ac_cv_path_install+:} false; then : $as_echo_n "(cached) " >&6 else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. # Account for people who put trailing slashes in PATH elements. case $as_dir/ in #(( ./ | .// | /[cC]/* | \ /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \ ?:[\\/]os2[\\/]install[\\/]* | ?:[\\/]OS2[\\/]INSTALL[\\/]* | \ /usr/ucb/* ) ;; *) # OSF1 and SCO ODT 3.0 have their own names for install. # Don't use installbsd from OSF since it installs stuff as root # by default. for ac_prog in ginstall scoinst install; do for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext"; then if test $ac_prog = install && grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # AIX install. It has an incompatible calling convention. : elif test $ac_prog = install && grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then # program-specific install script used by HP pwplus--don't use. : else rm -rf conftest.one conftest.two conftest.dir echo one > conftest.one echo two > conftest.two mkdir conftest.dir if "$as_dir/$ac_prog$ac_exec_ext" -c conftest.one conftest.two "`pwd`/conftest.dir" && test -s conftest.one && test -s conftest.two && test -s conftest.dir/conftest.one && test -s conftest.dir/conftest.two then ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c" break 3 fi fi fi done done ;; esac done IFS=$as_save_IFS rm -rf conftest.one conftest.two conftest.dir fi if test "${ac_cv_path_install+set}" = set; then INSTALL=$ac_cv_path_install else # As a last resort, use the slow shell script. Don't cache a # value for INSTALL within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the value is a relative name. INSTALL=$ac_install_sh fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $INSTALL" >&5 $as_echo "$INSTALL" >&6; } # Use test -z because SunOS4 sh mishandles braces in ${var-val}. # It thinks the first close brace ends the variable substitution. test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}' test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}' test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644' { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether build environment is sane" >&5 $as_echo_n "checking whether build environment is sane... " >&6; } # Reject unsafe characters in $srcdir or the absolute working directory # name. Accept space and tab only in the latter. am_lf=' ' case `pwd` in *[\\\"\#\$\&\'\`$am_lf]*) as_fn_error $? "unsafe absolute working directory name" "$LINENO" 5;; esac case $srcdir in *[\\\"\#\$\&\'\`$am_lf\ \ ]*) as_fn_error $? "unsafe srcdir value: '$srcdir'" "$LINENO" 5;; esac # Do 'set' in a subshell so we don't clobber the current shell's # arguments. Must try -L first in case configure is actually a # symlink; some systems play weird games with the mod time of symlinks # (eg FreeBSD returns the mod time of the symlink's containing # directory). if ( am_has_slept=no for am_try in 1 2; do echo "timestamp, slept: $am_has_slept" > conftest.file set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null` if test "$*" = "X"; then # -L didn't work. set X `ls -t "$srcdir/configure" conftest.file` fi if test "$*" != "X $srcdir/configure conftest.file" \ && test "$*" != "X conftest.file $srcdir/configure"; then # If neither matched, then we have a broken ls. This can happen # if, for instance, CONFIG_SHELL is bash and it inherits a # broken ls alias from the environment. This has actually # happened. Such a system could not be considered "sane". as_fn_error $? "ls -t appears to fail. Make sure there is not a broken alias in your environment" "$LINENO" 5 fi if test "$2" = conftest.file || test $am_try -eq 2; then break fi # Just in case. sleep 1 am_has_slept=yes done test "$2" = conftest.file ) then # Ok. : else as_fn_error $? "newly created file is older than distributed files! Check your system clock" "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } # If we didn't sleep, we still need to ensure time stamps of config.status and # generated files are strictly newer. am_sleep_pid= if grep 'slept: no' conftest.file >/dev/null 2>&1; then ( sleep 1 ) & am_sleep_pid=$! fi rm -f conftest.file test "$program_prefix" != NONE && program_transform_name="s&^&$program_prefix&;$program_transform_name" # Use a double $ so make ignores it. test "$program_suffix" != NONE && program_transform_name="s&\$&$program_suffix&;$program_transform_name" # Double any \ or $. # By default was `s,x,x', remove it if useless. ac_script='s/[\\$]/&&/g;s/;s,x,x,$//' program_transform_name=`$as_echo "$program_transform_name" | sed "$ac_script"` # expand $ac_aux_dir to an absolute path am_aux_dir=`cd $ac_aux_dir && pwd` if test x"${MISSING+set}" != xset; then case $am_aux_dir in *\ * | *\ *) MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;; *) MISSING="\${SHELL} $am_aux_dir/missing" ;; esac fi # Use eval to expand $SHELL if eval "$MISSING --is-lightweight"; then am_missing_run="$MISSING " else am_missing_run= { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: 'missing' script is too old or missing" >&5 $as_echo "$as_me: WARNING: 'missing' script is too old or missing" >&2;} fi if test x"${install_sh}" != xset; then case $am_aux_dir in *\ * | *\ *) install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;; *) install_sh="\${SHELL} $am_aux_dir/install-sh" esac fi # Installed binaries are usually stripped using 'strip' when the user # run "make install-strip". However 'strip' might not be the right # tool to use in cross-compilation environments, therefore Automake # will honor the 'STRIP' environment variable to overrule this program. if test "$cross_compiling" != no; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args. set dummy ${ac_tool_prefix}strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_STRIP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$STRIP"; then ac_cv_prog_STRIP="$STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_STRIP="${ac_tool_prefix}strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi STRIP=$ac_cv_prog_STRIP if test -n "$STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5 $as_echo "$STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_STRIP"; then ac_ct_STRIP=$STRIP # Extract the first word of "strip", so it can be a program name with args. set dummy strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_STRIP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_STRIP"; then ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_STRIP="strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP if test -n "$ac_ct_STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5 $as_echo "$ac_ct_STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_STRIP" = x; then STRIP=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac STRIP=$ac_ct_STRIP fi else STRIP="$ac_cv_prog_STRIP" fi fi INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a thread-safe mkdir -p" >&5 $as_echo_n "checking for a thread-safe mkdir -p... " >&6; } if test -z "$MKDIR_P"; then if ${ac_cv_path_mkdir+:} false; then : $as_echo_n "(cached) " >&6 else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/opt/sfw/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in mkdir gmkdir; do for ac_exec_ext in '' $ac_executable_extensions; do as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext" || continue case `"$as_dir/$ac_prog$ac_exec_ext" --version 2>&1` in #( 'mkdir (GNU coreutils) '* | \ 'mkdir (coreutils) '* | \ 'mkdir (fileutils) '4.1*) ac_cv_path_mkdir=$as_dir/$ac_prog$ac_exec_ext break 3;; esac done done done IFS=$as_save_IFS fi test -d ./--version && rmdir ./--version if test "${ac_cv_path_mkdir+set}" = set; then MKDIR_P="$ac_cv_path_mkdir -p" else # As a last resort, use the slow shell script. Don't cache a # value for MKDIR_P within a source directory, because that will # break other packages using the cache if that directory is # removed, or if the value is a relative name. MKDIR_P="$ac_install_sh -d" fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MKDIR_P" >&5 $as_echo "$MKDIR_P" >&6; } for ac_prog in gawk mawk nawk awk do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_AWK+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$AWK"; then ac_cv_prog_AWK="$AWK" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_AWK="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi AWK=$ac_cv_prog_AWK if test -n "$AWK"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5 $as_echo "$AWK" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$AWK" && break done { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ${MAKE-make} sets \$(MAKE)" >&5 $as_echo_n "checking whether ${MAKE-make} sets \$(MAKE)... " >&6; } set x ${MAKE-make} ac_make=`$as_echo "$2" | sed 's/+/p/g; s/[^a-zA-Z0-9_]/_/g'` if eval \${ac_cv_prog_make_${ac_make}_set+:} false; then : $as_echo_n "(cached) " >&6 else cat >conftest.make <<\_ACEOF SHELL = /bin/sh all: @echo '@@@%%%=$(MAKE)=@@@%%%' _ACEOF # GNU make sometimes prints "make[1]: Entering ...", which would confuse us. case `${MAKE-make} -f conftest.make 2>/dev/null` in *@@@%%%=?*=@@@%%%*) eval ac_cv_prog_make_${ac_make}_set=yes;; *) eval ac_cv_prog_make_${ac_make}_set=no;; esac rm -f conftest.make fi if eval test \$ac_cv_prog_make_${ac_make}_set = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } SET_MAKE= else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } SET_MAKE="MAKE=${MAKE-make}" fi rm -rf .tst 2>/dev/null mkdir .tst 2>/dev/null if test -d .tst; then am__leading_dot=. else am__leading_dot=_ fi rmdir .tst 2>/dev/null # Check whether --enable-silent-rules was given. if test "${enable_silent_rules+set}" = set; then : enableval=$enable_silent_rules; fi case $enable_silent_rules in # ((( yes) AM_DEFAULT_VERBOSITY=0;; no) AM_DEFAULT_VERBOSITY=1;; *) AM_DEFAULT_VERBOSITY=1;; esac am_make=${MAKE-make} { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $am_make supports nested variables" >&5 $as_echo_n "checking whether $am_make supports nested variables... " >&6; } if ${am_cv_make_support_nested_variables+:} false; then : $as_echo_n "(cached) " >&6 else if $as_echo 'TRUE=$(BAR$(V)) BAR0=false BAR1=true V=1 am__doit: @$(TRUE) .PHONY: am__doit' | $am_make -f - >/dev/null 2>&1; then am_cv_make_support_nested_variables=yes else am_cv_make_support_nested_variables=no fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_make_support_nested_variables" >&5 $as_echo "$am_cv_make_support_nested_variables" >&6; } if test $am_cv_make_support_nested_variables = yes; then AM_V='$(V)' AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)' else AM_V=$AM_DEFAULT_VERBOSITY AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY fi AM_BACKSLASH='\' if test "`cd $srcdir && pwd`" != "`pwd`"; then # Use -I$(srcdir) only when $(srcdir) != ., so that make's output # is not polluted with repeated "-I." am__isrc=' -I$(srcdir)' # test to see if srcdir already configured if test -f $srcdir/config.status; then as_fn_error $? "source directory already configured; run \"make distclean\" there first" "$LINENO" 5 fi fi # test whether we have cygpath if test -z "$CYGPATH_W"; then if (cygpath --version) >/dev/null 2>/dev/null; then CYGPATH_W='cygpath -w' else CYGPATH_W=echo fi fi # Define the identity of the package. PACKAGE='madp' VERSION='0.4' cat >>confdefs.h <<_ACEOF #define PACKAGE "$PACKAGE" _ACEOF cat >>confdefs.h <<_ACEOF #define VERSION "$VERSION" _ACEOF # Some tools Automake needs. ACLOCAL=${ACLOCAL-"${am_missing_run}aclocal-${am__api_version}"} AUTOCONF=${AUTOCONF-"${am_missing_run}autoconf"} AUTOMAKE=${AUTOMAKE-"${am_missing_run}automake-${am__api_version}"} AUTOHEADER=${AUTOHEADER-"${am_missing_run}autoheader"} MAKEINFO=${MAKEINFO-"${am_missing_run}makeinfo"} # For better backward compatibility. To be removed once Automake 1.9.x # dies out for good. For more background, see: # # mkdir_p='$(MKDIR_P)' # We need awk for the "check" target. The system "awk" is bad on # some platforms. # Always define AMTAR for backward compatibility. Yes, it's still used # in the wild :-( We should find a proper way to deprecate it ... AMTAR='$${TAR-tar}' # We'll loop over all known methods to create a tar archive until one works. _am_tools='gnutar pax cpio none' { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to create a pax tar archive" >&5 $as_echo_n "checking how to create a pax tar archive... " >&6; } # Go ahead even if we have the value already cached. We do so because we # need to set the values for the 'am__tar' and 'am__untar' variables. _am_tools=${am_cv_prog_tar_pax-$_am_tools} for _am_tool in $_am_tools; do case $_am_tool in gnutar) for _am_tar in tar gnutar gtar; do { echo "$as_me:$LINENO: $_am_tar --version" >&5 ($_am_tar --version) >&5 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } && break done am__tar="$_am_tar --format=posix -chf - "'"$$tardir"' am__tar_="$_am_tar --format=posix -chf - "'"$tardir"' am__untar="$_am_tar -xf -" ;; plaintar) # Must skip GNU tar: if it does not support --format= it doesn't create # ustar tarball either. (tar --version) >/dev/null 2>&1 && continue am__tar='tar chf - "$$tardir"' am__tar_='tar chf - "$tardir"' am__untar='tar xf -' ;; pax) am__tar='pax -L -x pax -w "$$tardir"' am__tar_='pax -L -x pax -w "$tardir"' am__untar='pax -r' ;; cpio) am__tar='find "$$tardir" -print | cpio -o -H pax -L' am__tar_='find "$tardir" -print | cpio -o -H pax -L' am__untar='cpio -i -H pax -d' ;; none) am__tar=false am__tar_=false am__untar=false ;; esac # If the value was cached, stop now. We just wanted to have am__tar # and am__untar set. test -n "${am_cv_prog_tar_pax}" && break # tar/untar a dummy directory, and stop if the command works. rm -rf conftest.dir mkdir conftest.dir echo GrepMe > conftest.dir/file { echo "$as_me:$LINENO: tardir=conftest.dir && eval $am__tar_ >conftest.tar" >&5 (tardir=conftest.dir && eval $am__tar_ >conftest.tar) >&5 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } rm -rf conftest.dir if test -s conftest.tar; then { echo "$as_me:$LINENO: $am__untar &5 ($am__untar &5 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } { echo "$as_me:$LINENO: cat conftest.dir/file" >&5 (cat conftest.dir/file) >&5 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } grep GrepMe conftest.dir/file >/dev/null 2>&1 && break fi done rm -rf conftest.dir if ${am_cv_prog_tar_pax+:} false; then : $as_echo_n "(cached) " >&6 else am_cv_prog_tar_pax=$_am_tool fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_prog_tar_pax" >&5 $as_echo "$am_cv_prog_tar_pax" >&6; } # POSIX will say in a future version that running "rm -f" with no argument # is OK; and we want to be able to make that assumption in our Makefile # recipes. So use an aggressive probe to check that the usage we want is # actually supported "in the wild" to an acceptable degree. # See automake bug#10828. # To make any issue more visible, cause the running configure to be aborted # by default if the 'rm' program in use doesn't match our expectations; the # user can still override this though. if rm -f && rm -fr && rm -rf; then : OK; else cat >&2 <<'END' Oops! Your 'rm' program seems unable to run without file operands specified on the command line, even when the '-f' option is present. This is contrary to the behaviour of most rm programs out there, and not conforming with the upcoming POSIX standard: Please tell bug-automake@gnu.org about your system, including the value of your $PATH and any error possibly output before this message. This can help us improve future automake versions. END if test x"$ACCEPT_INFERIOR_RM_PROGRAM" = x"yes"; then echo 'Configuration will proceed anyway, since you have set the' >&2 echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to "yes"' >&2 echo >&2 else cat >&2 <<'END' Aborting the configuration process, to ensure you take notice of the issue. You can download and install GNU coreutils to get an 'rm' implementation that behaves properly: . If you want to complete the configuration process using your problematic 'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM to "yes", and re-run configure. END as_fn_error $? "Your 'rm' program is bad, sorry." "$LINENO" 5 fi fi ac_config_headers="$ac_config_headers config.h" # Checks for programs. ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu if test -z "$CXX"; then if test -n "$CCC"; then CXX=$CCC else if test -n "$ac_tool_prefix"; then for ac_prog in g++ c++ gpp aCC CC cxx cc++ cl.exe FCC KCC RCC xlC_r xlC do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CXX+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CXX"; then ac_cv_prog_CXX="$CXX" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CXX="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CXX=$ac_cv_prog_CXX if test -n "$CXX"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CXX" >&5 $as_echo "$CXX" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$CXX" && break done fi if test -z "$CXX"; then ac_ct_CXX=$CXX for ac_prog in g++ c++ gpp aCC CC cxx cc++ cl.exe FCC KCC RCC xlC_r xlC do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_CXX+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CXX"; then ac_cv_prog_ac_ct_CXX="$ac_ct_CXX" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_CXX="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CXX=$ac_cv_prog_ac_ct_CXX if test -n "$ac_ct_CXX"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CXX" >&5 $as_echo "$ac_ct_CXX" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_CXX" && break done if test "x$ac_ct_CXX" = x; then CXX="g++" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CXX=$ac_ct_CXX fi fi fi fi # Provide some information about the compiler. $as_echo "$as_me:${as_lineno-$LINENO}: checking for C++ compiler version" >&5 set X $ac_compile ac_compiler=$2 for ac_option in --version -v -V -qversion; do { { ac_try="$ac_compiler $ac_option >&5" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compiler $ac_option >&5") 2>conftest.err ac_status=$? if test -s conftest.err; then sed '10a\ ... rest of stderr output deleted ... 10q' conftest.err >conftest.er1 cat conftest.er1 >&5 fi rm -f conftest.er1 conftest.err $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } done cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files a.out a.out.dSYM a.exe b.out" # Try to create an executable without -o first, disregard a.out. # It will help us diagnose broken compilers, and finding out an intuition # of exeext. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the C++ compiler works" >&5 $as_echo_n "checking whether the C++ compiler works... " >&6; } ac_link_default=`$as_echo "$ac_link" | sed 's/ -o *conftest[^ ]*//'` # The possible output files: ac_files="a.out conftest.exe conftest a.exe a_out.exe b.out conftest.*" ac_rmfiles= for ac_file in $ac_files do case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; * ) ac_rmfiles="$ac_rmfiles $ac_file";; esac done rm -f $ac_rmfiles if { { ac_try="$ac_link_default" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link_default") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : # Autoconf-2.13 could set the ac_cv_exeext variable to `no'. # So ignore a value of `no', otherwise this would lead to `EXEEXT = no' # in a Makefile. We should not override ac_cv_exeext if it was cached, # so that the user can short-circuit this test for compilers unknown to # Autoconf. for ac_file in $ac_files '' do test -f "$ac_file" || continue case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; [ab].out ) # We found the default executable, but exeext='' is most # certainly right. break;; *.* ) if test "${ac_cv_exeext+set}" = set && test "$ac_cv_exeext" != no; then :; else ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` fi # We set ac_cv_exeext here because the later test for it is not # safe: cross compilers may not add the suffix if given an `-o' # argument, so we may need to know it at that point already. # Even if this section looks crufty: it has the advantage of # actually working. break;; * ) break;; esac done test "$ac_cv_exeext" = no && ac_cv_exeext= else ac_file='' fi if test -z "$ac_file"; then : { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error 77 "C++ compiler cannot create executables See \`config.log' for more details" "$LINENO" 5; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for C++ compiler default output file name" >&5 $as_echo_n "checking for C++ compiler default output file name... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_file" >&5 $as_echo "$ac_file" >&6; } ac_exeext=$ac_cv_exeext rm -f -r a.out a.out.dSYM a.exe conftest$ac_cv_exeext b.out ac_clean_files=$ac_clean_files_save { $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of executables" >&5 $as_echo_n "checking for suffix of executables... " >&6; } if { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : # If both `conftest.exe' and `conftest' are `present' (well, observable) # catch `conftest.exe'. For instance with Cygwin, `ls conftest' will # work properly (i.e., refer to `conftest.exe'), while it won't with # `rm'. for ac_file in conftest.exe conftest conftest.*; do test -f "$ac_file" || continue case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM | *.o | *.obj ) ;; *.* ) ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` break;; * ) break;; esac done else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "cannot compute suffix of executables: cannot compile and link See \`config.log' for more details" "$LINENO" 5; } fi rm -f conftest conftest$ac_cv_exeext { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_exeext" >&5 $as_echo "$ac_cv_exeext" >&6; } rm -f conftest.$ac_ext EXEEXT=$ac_cv_exeext ac_exeext=$EXEEXT cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { FILE *f = fopen ("conftest.out", "w"); return ferror (f) || fclose (f) != 0; ; return 0; } _ACEOF ac_clean_files="$ac_clean_files conftest.out" # Check that the compiler produces executables we can run. If not, either # the compiler is broken, or we cross compile. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are cross compiling" >&5 $as_echo_n "checking whether we are cross compiling... " >&6; } if test "$cross_compiling" != yes; then { { ac_try="$ac_link" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_link") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } if { ac_try='./conftest$ac_cv_exeext' { { case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_try") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; }; then cross_compiling=no else if test "$cross_compiling" = maybe; then cross_compiling=yes else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "cannot run C++ compiled programs. If you meant to cross compile, use \`--host'. See \`config.log' for more details" "$LINENO" 5; } fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $cross_compiling" >&5 $as_echo "$cross_compiling" >&6; } rm -f conftest.$ac_ext conftest$ac_cv_exeext conftest.out ac_clean_files=$ac_clean_files_save { $as_echo "$as_me:${as_lineno-$LINENO}: checking for suffix of object files" >&5 $as_echo_n "checking for suffix of object files... " >&6; } if ${ac_cv_objext+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF rm -f conftest.o conftest.obj if { { ac_try="$ac_compile" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compile") 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then : for ac_file in conftest.o conftest.obj conftest.*; do test -f "$ac_file" || continue; case $ac_file in *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.dSYM ) ;; *) ac_cv_objext=`expr "$ac_file" : '.*\.\(.*\)'` break;; esac done else $as_echo "$as_me: failed program was:" >&5 sed 's/^/| /' conftest.$ac_ext >&5 { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "cannot compute suffix of object files: cannot compile See \`config.log' for more details" "$LINENO" 5; } fi rm -f conftest.$ac_cv_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_objext" >&5 $as_echo "$ac_cv_objext" >&6; } OBJEXT=$ac_cv_objext ac_objext=$OBJEXT { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C++ compiler" >&5 $as_echo_n "checking whether we are using the GNU C++ compiler... " >&6; } if ${ac_cv_cxx_compiler_gnu+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #ifndef __GNUC__ choke me #endif ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ac_compiler_gnu=yes else ac_compiler_gnu=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_cxx_compiler_gnu=$ac_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_cxx_compiler_gnu" >&5 $as_echo "$ac_cv_cxx_compiler_gnu" >&6; } if test $ac_compiler_gnu = yes; then GXX=yes else GXX= fi ac_test_CXXFLAGS=${CXXFLAGS+set} ac_save_CXXFLAGS=$CXXFLAGS { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CXX accepts -g" >&5 $as_echo_n "checking whether $CXX accepts -g... " >&6; } if ${ac_cv_prog_cxx_g+:} false; then : $as_echo_n "(cached) " >&6 else ac_save_cxx_werror_flag=$ac_cxx_werror_flag ac_cxx_werror_flag=yes ac_cv_prog_cxx_g=no CXXFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ac_cv_prog_cxx_g=yes else CXXFLAGS="" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : else ac_cxx_werror_flag=$ac_save_cxx_werror_flag CXXFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_compile "$LINENO"; then : ac_cv_prog_cxx_g=yes fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cxx_werror_flag=$ac_save_cxx_werror_flag fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cxx_g" >&5 $as_echo "$ac_cv_prog_cxx_g" >&6; } if test "$ac_test_CXXFLAGS" = set; then CXXFLAGS=$ac_save_CXXFLAGS elif test $ac_cv_prog_cxx_g = yes; then if test "$GXX" = yes; then CXXFLAGS="-g -O2" else CXXFLAGS="-g" fi else if test "$GXX" = yes; then CXXFLAGS="-O2" else CXXFLAGS= fi fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu DEPDIR="${am__leading_dot}deps" ac_config_commands="$ac_config_commands depfiles" am_make=${MAKE-make} cat > confinc << 'END' am__doit: @echo this is the am__doit target .PHONY: am__doit END # If we don't find an include directive, just comment out the code. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for style of include used by $am_make" >&5 $as_echo_n "checking for style of include used by $am_make... " >&6; } am__include="#" am__quote= _am_result=none # First try GNU make style include. echo "include confinc" > confmf # Ignore all kinds of additional output from 'make'. case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=include am__quote= _am_result=GNU ;; esac # Now try BSD make style include. if test "$am__include" = "#"; then echo '.include "confinc"' > confmf case `$am_make -s -f confmf 2> /dev/null` in #( *the\ am__doit\ target*) am__include=.include am__quote="\"" _am_result=BSD ;; esac fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $_am_result" >&5 $as_echo "$_am_result" >&6; } rm -f confinc confmf # Check whether --enable-dependency-tracking was given. if test "${enable_dependency_tracking+set}" = set; then : enableval=$enable_dependency_tracking; fi if test "x$enable_dependency_tracking" != xno; then am_depcomp="$ac_aux_dir/depcomp" AMDEPBACKSLASH='\' am__nodep='_no' fi if test "x$enable_dependency_tracking" != xno; then AMDEP_TRUE= AMDEP_FALSE='#' else AMDEP_TRUE='#' AMDEP_FALSE= fi depcc="$CXX" am_compiler_list= { $as_echo "$as_me:${as_lineno-$LINENO}: checking dependency style of $depcc" >&5 $as_echo_n "checking dependency style of $depcc... " >&6; } if ${am_cv_CXX_dependencies_compiler_type+:} false; then : $as_echo_n "(cached) " >&6 else if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named 'D' -- because '-MD' means "put the output # in D". rm -rf conftest.dir mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_CXX_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n 's/^#*\([a-zA-Z0-9]*\))$/\1/p' < ./depcomp` fi am__universal=false case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using ": > sub/conftst$i.h" creates only sub/conftst1.h with # Solaris 10 /bin/sh. echo '/* dummy */' > sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf # We check with '-c' and '-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle '-M -o', and we need to detect this. Also, some Intel # versions had trouble with output in subdirs. am__obj=sub/conftest.${OBJEXT-o} am__minus_obj="-o $am__obj" case $depmode in gcc) # This depmode causes a compiler race in universal mode. test "$am__universal" = false || continue ;; nosideeffect) # After this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested. if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; msvc7 | msvc7msys | msvisualcpp | msvcmsys) # This compiler won't grok '-c -o', but also, the minuso test has # not run yet. These depmodes are late enough in the game, and # so weak that their functioning should not be impacted. am__obj=conftest.${OBJEXT-o} am__minus_obj= ;; none) break ;; esac if depmode=$depmode \ source=sub/conftest.c object=$am__obj \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep $am__obj sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_CXX_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_CXX_dependencies_compiler_type=none fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_CXX_dependencies_compiler_type" >&5 $as_echo "$am_cv_CXX_dependencies_compiler_type" >&6; } CXXDEPMODE=depmode=$am_cv_CXX_dependencies_compiler_type if test "x$enable_dependency_tracking" != xno \ && test "$am_cv_CXX_dependencies_compiler_type" = gcc3; then am__fastdepCXX_TRUE= am__fastdepCXX_FALSE='#' else am__fastdepCXX_TRUE='#' am__fastdepCXX_FALSE= fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}gcc", so it can be a program name with args. set dummy ${ac_tool_prefix}gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="${ac_tool_prefix}gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_CC"; then ac_ct_CC=$CC # Extract the first word of "gcc", so it can be a program name with args. set dummy gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_CC="gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi else CC="$ac_cv_prog_CC" fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}cc", so it can be a program name with args. set dummy ${ac_tool_prefix}cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="${ac_tool_prefix}cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi fi if test -z "$CC"; then # Extract the first word of "cc", so it can be a program name with args. set dummy cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else ac_prog_rejected=no as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then if test "$as_dir/$ac_word$ac_exec_ext" = "/usr/ucb/cc"; then ac_prog_rejected=yes continue fi ac_cv_prog_CC="cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS if test $ac_prog_rejected = yes; then # We found a bogon in the path, so make sure we never use it. set dummy $ac_cv_prog_CC shift if test $# != 0; then # We chose a different compiler from the bogus one. # However, it has the same basename, so the bogon will be chosen # first if we set CC to just the basename; use the full file name. shift ac_cv_prog_CC="$as_dir/$ac_word${1+' '}$@" fi fi fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then for ac_prog in cl.exe do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$CC" && break done fi if test -z "$CC"; then ac_ct_CC=$CC for ac_prog in cl.exe do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_CC="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_CC" && break done if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi fi fi test -z "$CC" && { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "no acceptable C compiler found in \$PATH See \`config.log' for more details" "$LINENO" 5; } # Provide some information about the compiler. $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler version" >&5 set X $ac_compile ac_compiler=$2 for ac_option in --version -v -V -qversion; do { { ac_try="$ac_compiler $ac_option >&5" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compiler $ac_option >&5") 2>conftest.err ac_status=$? if test -s conftest.err; then sed '10a\ ... rest of stderr output deleted ... 10q' conftest.err >conftest.er1 cat conftest.er1 >&5 fi rm -f conftest.er1 conftest.err $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } done { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C compiler" >&5 $as_echo_n "checking whether we are using the GNU C compiler... " >&6; } if ${ac_cv_c_compiler_gnu+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #ifndef __GNUC__ choke me #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_compiler_gnu=yes else ac_compiler_gnu=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_c_compiler_gnu=$ac_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_compiler_gnu" >&5 $as_echo "$ac_cv_c_compiler_gnu" >&6; } if test $ac_compiler_gnu = yes; then GCC=yes else GCC= fi ac_test_CFLAGS=${CFLAGS+set} ac_save_CFLAGS=$CFLAGS { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CC accepts -g" >&5 $as_echo_n "checking whether $CC accepts -g... " >&6; } if ${ac_cv_prog_cc_g+:} false; then : $as_echo_n "(cached) " >&6 else ac_save_c_werror_flag=$ac_c_werror_flag ac_c_werror_flag=yes ac_cv_prog_cc_g=no CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes else CFLAGS="" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : else ac_c_werror_flag=$ac_save_c_werror_flag CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_c_werror_flag=$ac_save_c_werror_flag fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_g" >&5 $as_echo "$ac_cv_prog_cc_g" >&6; } if test "$ac_test_CFLAGS" = set; then CFLAGS=$ac_save_CFLAGS elif test $ac_cv_prog_cc_g = yes; then if test "$GCC" = yes; then CFLAGS="-g -O2" else CFLAGS="-g" fi else if test "$GCC" = yes; then CFLAGS="-O2" else CFLAGS= fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $CC option to accept ISO C89" >&5 $as_echo_n "checking for $CC option to accept ISO C89... " >&6; } if ${ac_cv_prog_cc_c89+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_prog_cc_c89=no ac_save_CC=$CC cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include struct stat; /* Most of the following tests are stolen from RCS 5.7's src/conf.sh. */ struct buf { int x; }; FILE * (*rcsopen) (struct buf *, struct stat *, int); static char *e (p, i) char **p; int i; { return p[i]; } static char *f (char * (*g) (char **, int), char **p, ...) { char *s; va_list v; va_start (v,p); s = g (p, va_arg (v,int)); va_end (v); return s; } /* OSF 4.0 Compaq cc is some sort of almost-ANSI by default. It has function prototypes and stuff, but not '\xHH' hex character constants. These don't provoke an error unfortunately, instead are silently treated as 'x'. The following induces an error, until -std is added to get proper ANSI mode. Curiously '\x00'!='x' always comes out true, for an array size at least. It's necessary to write '\x00'==0 to get something that's true only with -std. */ int osf4_cc_array ['\x00' == 0 ? 1 : -1]; /* IBM C 6 for AIX is almost-ANSI by default, but it replaces macro parameters inside strings and character constants. */ #define FOO(x) 'x' int xlc6_cc_array[FOO(a) == 'x' ? 1 : -1]; int test (int i, double x); struct s1 {int (*f) (int a);}; struct s2 {int (*f) (double a);}; int pairnames (int, char **, FILE *(*)(struct buf *, struct stat *, int), int, int); int argc; char **argv; int main () { return f (e, argv, 0) != argv[0] || f (e, argv, 1) != argv[1]; ; return 0; } _ACEOF for ac_arg in '' -qlanglvl=extc89 -qlanglvl=ansi -std \ -Ae "-Aa -D_HPUX_SOURCE" "-Xc -D__EXTENSIONS__" do CC="$ac_save_CC $ac_arg" if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_c89=$ac_arg fi rm -f core conftest.err conftest.$ac_objext test "x$ac_cv_prog_cc_c89" != "xno" && break done rm -f conftest.$ac_ext CC=$ac_save_CC fi # AC_CACHE_VAL case "x$ac_cv_prog_cc_c89" in x) { $as_echo "$as_me:${as_lineno-$LINENO}: result: none needed" >&5 $as_echo "none needed" >&6; } ;; xno) { $as_echo "$as_me:${as_lineno-$LINENO}: result: unsupported" >&5 $as_echo "unsupported" >&6; } ;; *) CC="$CC $ac_cv_prog_cc_c89" { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_c89" >&5 $as_echo "$ac_cv_prog_cc_c89" >&6; } ;; esac if test "x$ac_cv_prog_cc_c89" != xno; then : fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CC understands -c and -o together" >&5 $as_echo_n "checking whether $CC understands -c and -o together... " >&6; } if ${am_cv_prog_cc_c_o+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF # Make sure it works both with $CC and with simple cc. # Following AC_PROG_CC_C_O, we do the test twice because some # compilers refuse to overwrite an existing .o file with -o, # though they will create one. am_cv_prog_cc_c_o=yes for am_i in 1 2; do if { echo "$as_me:$LINENO: $CC -c conftest.$ac_ext -o conftest2.$ac_objext" >&5 ($CC -c conftest.$ac_ext -o conftest2.$ac_objext) >&5 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } \ && test -f conftest2.$ac_objext; then : OK else am_cv_prog_cc_c_o=no break fi done rm -f core conftest* unset am_i fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_prog_cc_c_o" >&5 $as_echo "$am_cv_prog_cc_c_o" >&6; } if test "$am_cv_prog_cc_c_o" != yes; then # Losing compiler, so override with the script. # FIXME: It is wrong to rewrite CC. # But if we don't then we get into trouble of one sort or another. # A longer-term fix would be to have automake use am__CC in this case, # and then we could set am__CC="\$(top_srcdir)/compile \$(CC)" CC="$am_aux_dir/compile $CC" fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu depcc="$CC" am_compiler_list= { $as_echo "$as_me:${as_lineno-$LINENO}: checking dependency style of $depcc" >&5 $as_echo_n "checking dependency style of $depcc... " >&6; } if ${am_cv_CC_dependencies_compiler_type+:} false; then : $as_echo_n "(cached) " >&6 else if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named 'D' -- because '-MD' means "put the output # in D". rm -rf conftest.dir mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_CC_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n 's/^#*\([a-zA-Z0-9]*\))$/\1/p' < ./depcomp` fi am__universal=false case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using ": > sub/conftst$i.h" creates only sub/conftst1.h with # Solaris 10 /bin/sh. echo '/* dummy */' > sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf # We check with '-c' and '-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle '-M -o', and we need to detect this. Also, some Intel # versions had trouble with output in subdirs. am__obj=sub/conftest.${OBJEXT-o} am__minus_obj="-o $am__obj" case $depmode in gcc) # This depmode causes a compiler race in universal mode. test "$am__universal" = false || continue ;; nosideeffect) # After this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested. if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; msvc7 | msvc7msys | msvisualcpp | msvcmsys) # This compiler won't grok '-c -o', but also, the minuso test has # not run yet. These depmodes are late enough in the game, and # so weak that their functioning should not be impacted. am__obj=conftest.${OBJEXT-o} am__minus_obj= ;; none) break ;; esac if depmode=$depmode \ source=sub/conftest.c object=$am__obj \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep $am__obj sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_CC_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_CC_dependencies_compiler_type=none fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_CC_dependencies_compiler_type" >&5 $as_echo "$am_cv_CC_dependencies_compiler_type" >&6; } CCDEPMODE=depmode=$am_cv_CC_dependencies_compiler_type if test "x$enable_dependency_tracking" != xno \ && test "$am_cv_CC_dependencies_compiler_type" = gcc3; then am__fastdepCC_TRUE= am__fastdepCC_FALSE='#' else am__fastdepCC_TRUE='#' am__fastdepCC_FALSE= fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to run the C preprocessor" >&5 $as_echo_n "checking how to run the C preprocessor... " >&6; } # On Suns, sometimes $CPP names a directory. if test -n "$CPP" && test -d "$CPP"; then CPP= fi if test -z "$CPP"; then if ${ac_cv_prog_CPP+:} false; then : $as_echo_n "(cached) " >&6 else # Double quotes because CPP needs to be expanded for CPP in "$CC -E" "$CC -E -traditional-cpp" "/lib/cpp" do ac_preproc_ok=false for ac_c_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.i conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.i conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.i conftest.err conftest.$ac_ext if $ac_preproc_ok; then : break fi done ac_cv_prog_CPP=$CPP fi CPP=$ac_cv_prog_CPP else ac_cv_prog_CPP=$CPP fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CPP" >&5 $as_echo "$CPP" >&6; } ac_preproc_ok=false for ac_c_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.i conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_c_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.i conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.i conftest.err conftest.$ac_ext if $ac_preproc_ok; then : else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "C preprocessor \"$CPP\" fails sanity check See \`config.log' for more details" "$LINENO" 5; } fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ln -s works" >&5 $as_echo_n "checking whether ln -s works... " >&6; } LN_S=$as_ln_s if test "$LN_S" = "ln -s"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no, using $LN_S" >&5 $as_echo "no, using $LN_S" >&6; } fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ${MAKE-make} sets \$(MAKE)" >&5 $as_echo_n "checking whether ${MAKE-make} sets \$(MAKE)... " >&6; } set x ${MAKE-make} ac_make=`$as_echo "$2" | sed 's/+/p/g; s/[^a-zA-Z0-9_]/_/g'` if eval \${ac_cv_prog_make_${ac_make}_set+:} false; then : $as_echo_n "(cached) " >&6 else cat >conftest.make <<\_ACEOF SHELL = /bin/sh all: @echo '@@@%%%=$(MAKE)=@@@%%%' _ACEOF # GNU make sometimes prints "make[1]: Entering ...", which would confuse us. case `${MAKE-make} -f conftest.make 2>/dev/null` in *@@@%%%=?*=@@@%%%*) eval ac_cv_prog_make_${ac_make}_set=yes;; *) eval ac_cv_prog_make_${ac_make}_set=no;; esac rm -f conftest.make fi if eval test \$ac_cv_prog_make_${ac_make}_set = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } SET_MAKE= else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } SET_MAKE="MAKE=${MAKE-make}" fi #CSTANDARD: #See https://gcc.gnu.org/onlinedocs/gcc/C-Dialect-Options.html#C-Dialect-Options # #'c++11' #The 2011 ISO C++ standard plus amendments. The name ‘c++0x’ is deprecated. #Important: GCC's support for C++11 is still experimental. Some features were implemented based on early proposals, and no attempt will be made to maintain backward compatibility when they are updated to match the final C++11 standard. CSTD11="-std=c++11" #--leads to problems compiling boost 1.49 # (problems occur when including the file needed for the ERF function...) # #'gnu++11' #GNU dialect of -std=c++11. The name ‘gnu++0x’ is deprecated. CSTDGNU11="-std=gnu++11" # #‘gnu++98’, ‘gnu++03’ #GNU dialect of -std=c++98. This is the default for C++ code. #(i.e. default, if no C++ language dialect options are given, is -std=gnu++98.) CSTDGNU="-std=gnu++03" # #‘c++98’, ‘c++03’ #The 1998 ISO C++ standard plus the 2003 technical corrigendum and some additional defect reports. Same as -ansi for C++ code. #CSTANDARD="-std=c++03" CSTD="-std=c++98" # #overall standard we want to use: CSTANDARD="-std=c++98" #specified the flags in src/Makefile.am # You can turn off shared libraries during beta-testing, since they # make the build process take too long. # AC_DISABLE_SHARED # AC_DISABLE_STATIC case `pwd` in *\ * | *\ *) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Libtool does not cope well with whitespace in \`pwd\`" >&5 $as_echo "$as_me: WARNING: Libtool does not cope well with whitespace in \`pwd\`" >&2;} ;; esac macro_version='2.4.2' macro_revision='1.3337' ltmain="$ac_aux_dir/ltmain.sh" # Make sure we can run config.sub. $SHELL "$ac_aux_dir/config.sub" sun4 >/dev/null 2>&1 || as_fn_error $? "cannot run $SHELL $ac_aux_dir/config.sub" "$LINENO" 5 { $as_echo "$as_me:${as_lineno-$LINENO}: checking build system type" >&5 $as_echo_n "checking build system type... " >&6; } if ${ac_cv_build+:} false; then : $as_echo_n "(cached) " >&6 else ac_build_alias=$build_alias test "x$ac_build_alias" = x && ac_build_alias=`$SHELL "$ac_aux_dir/config.guess"` test "x$ac_build_alias" = x && as_fn_error $? "cannot guess build type; you must specify one" "$LINENO" 5 ac_cv_build=`$SHELL "$ac_aux_dir/config.sub" $ac_build_alias` || as_fn_error $? "$SHELL $ac_aux_dir/config.sub $ac_build_alias failed" "$LINENO" 5 fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_build" >&5 $as_echo "$ac_cv_build" >&6; } case $ac_cv_build in *-*-*) ;; *) as_fn_error $? "invalid value of canonical build" "$LINENO" 5;; esac build=$ac_cv_build ac_save_IFS=$IFS; IFS='-' set x $ac_cv_build shift build_cpu=$1 build_vendor=$2 shift; shift # Remember, the first character of IFS is used to create $*, # except with old shells: build_os=$* IFS=$ac_save_IFS case $build_os in *\ *) build_os=`echo "$build_os" | sed 's/ /-/g'`;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking host system type" >&5 $as_echo_n "checking host system type... " >&6; } if ${ac_cv_host+:} false; then : $as_echo_n "(cached) " >&6 else if test "x$host_alias" = x; then ac_cv_host=$ac_cv_build else ac_cv_host=`$SHELL "$ac_aux_dir/config.sub" $host_alias` || as_fn_error $? "$SHELL $ac_aux_dir/config.sub $host_alias failed" "$LINENO" 5 fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_host" >&5 $as_echo "$ac_cv_host" >&6; } case $ac_cv_host in *-*-*) ;; *) as_fn_error $? "invalid value of canonical host" "$LINENO" 5;; esac host=$ac_cv_host ac_save_IFS=$IFS; IFS='-' set x $ac_cv_host shift host_cpu=$1 host_vendor=$2 shift; shift # Remember, the first character of IFS is used to create $*, # except with old shells: host_os=$* IFS=$ac_save_IFS case $host_os in *\ *) host_os=`echo "$host_os" | sed 's/ /-/g'`;; esac # Backslashify metacharacters that are still active within # double-quoted strings. sed_quote_subst='s/\(["`$\\]\)/\\\1/g' # Same as above, but do not quote variable references. double_quote_subst='s/\(["`\\]\)/\\\1/g' # Sed substitution to delay expansion of an escaped shell variable in a # double_quote_subst'ed string. delay_variable_subst='s/\\\\\\\\\\\$/\\\\\\$/g' # Sed substitution to delay expansion of an escaped single quote. delay_single_quote_subst='s/'\''/'\'\\\\\\\'\''/g' # Sed substitution to avoid accidental globbing in evaled expressions no_glob_subst='s/\*/\\\*/g' ECHO='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO ECHO=$ECHO$ECHO$ECHO$ECHO$ECHO$ECHO { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to print strings" >&5 $as_echo_n "checking how to print strings... " >&6; } # Test print first, because it will be a builtin if present. if test "X`( print -r -- -n ) 2>/dev/null`" = X-n && \ test "X`print -r -- $ECHO 2>/dev/null`" = "X$ECHO"; then ECHO='print -r --' elif test "X`printf %s $ECHO 2>/dev/null`" = "X$ECHO"; then ECHO='printf %s\n' else # Use this function as a fallback that always works. func_fallback_echo () { eval 'cat <<_LTECHO_EOF $1 _LTECHO_EOF' } ECHO='func_fallback_echo' fi # func_echo_all arg... # Invoke $ECHO with all args, space-separated. func_echo_all () { $ECHO "" } case "$ECHO" in printf*) { $as_echo "$as_me:${as_lineno-$LINENO}: result: printf" >&5 $as_echo "printf" >&6; } ;; print*) { $as_echo "$as_me:${as_lineno-$LINENO}: result: print -r" >&5 $as_echo "print -r" >&6; } ;; *) { $as_echo "$as_me:${as_lineno-$LINENO}: result: cat" >&5 $as_echo "cat" >&6; } ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for a sed that does not truncate output" >&5 $as_echo_n "checking for a sed that does not truncate output... " >&6; } if ${ac_cv_path_SED+:} false; then : $as_echo_n "(cached) " >&6 else ac_script=s/aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa/bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb/ for ac_i in 1 2 3 4 5 6 7; do ac_script="$ac_script$as_nl$ac_script" done echo "$ac_script" 2>/dev/null | sed 99q >conftest.sed { ac_script=; unset ac_script;} if test -z "$SED"; then ac_path_SED_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in sed gsed; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_SED="$as_dir/$ac_prog$ac_exec_ext" as_fn_executable_p "$ac_path_SED" || continue # Check for GNU ac_path_SED and select it if it is found. # Check for GNU $ac_path_SED case `"$ac_path_SED" --version 2>&1` in *GNU*) ac_cv_path_SED="$ac_path_SED" ac_path_SED_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo '' >> "conftest.nl" "$ac_path_SED" -f conftest.sed < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_SED_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_SED="$ac_path_SED" ac_path_SED_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_SED_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_SED"; then as_fn_error $? "no acceptable sed could be found in \$PATH" "$LINENO" 5 fi else ac_cv_path_SED=$SED fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_SED" >&5 $as_echo "$ac_cv_path_SED" >&6; } SED="$ac_cv_path_SED" rm -f conftest.sed test -z "$SED" && SED=sed Xsed="$SED -e 1s/^X//" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for grep that handles long lines and -e" >&5 $as_echo_n "checking for grep that handles long lines and -e... " >&6; } if ${ac_cv_path_GREP+:} false; then : $as_echo_n "(cached) " >&6 else if test -z "$GREP"; then ac_path_GREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in grep ggrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_GREP="$as_dir/$ac_prog$ac_exec_ext" as_fn_executable_p "$ac_path_GREP" || continue # Check for GNU ac_path_GREP and select it if it is found. # Check for GNU $ac_path_GREP case `"$ac_path_GREP" --version 2>&1` in *GNU*) ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'GREP' >> "conftest.nl" "$ac_path_GREP" -e 'GREP$' -e '-(cannot match)-' < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_GREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_GREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_GREP"; then as_fn_error $? "no acceptable grep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_GREP=$GREP fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_GREP" >&5 $as_echo "$ac_cv_path_GREP" >&6; } GREP="$ac_cv_path_GREP" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for egrep" >&5 $as_echo_n "checking for egrep... " >&6; } if ${ac_cv_path_EGREP+:} false; then : $as_echo_n "(cached) " >&6 else if echo a | $GREP -E '(a|b)' >/dev/null 2>&1 then ac_cv_path_EGREP="$GREP -E" else if test -z "$EGREP"; then ac_path_EGREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in egrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_EGREP="$as_dir/$ac_prog$ac_exec_ext" as_fn_executable_p "$ac_path_EGREP" || continue # Check for GNU ac_path_EGREP and select it if it is found. # Check for GNU $ac_path_EGREP case `"$ac_path_EGREP" --version 2>&1` in *GNU*) ac_cv_path_EGREP="$ac_path_EGREP" ac_path_EGREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'EGREP' >> "conftest.nl" "$ac_path_EGREP" 'EGREP$' < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_EGREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_EGREP="$ac_path_EGREP" ac_path_EGREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_EGREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_EGREP"; then as_fn_error $? "no acceptable egrep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_EGREP=$EGREP fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_EGREP" >&5 $as_echo "$ac_cv_path_EGREP" >&6; } EGREP="$ac_cv_path_EGREP" { $as_echo "$as_me:${as_lineno-$LINENO}: checking for fgrep" >&5 $as_echo_n "checking for fgrep... " >&6; } if ${ac_cv_path_FGREP+:} false; then : $as_echo_n "(cached) " >&6 else if echo 'ab*c' | $GREP -F 'ab*c' >/dev/null 2>&1 then ac_cv_path_FGREP="$GREP -F" else if test -z "$FGREP"; then ac_path_FGREP_found=false # Loop through the user's path and test for each of PROGNAME-LIST as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_prog in fgrep; do for ac_exec_ext in '' $ac_executable_extensions; do ac_path_FGREP="$as_dir/$ac_prog$ac_exec_ext" as_fn_executable_p "$ac_path_FGREP" || continue # Check for GNU ac_path_FGREP and select it if it is found. # Check for GNU $ac_path_FGREP case `"$ac_path_FGREP" --version 2>&1` in *GNU*) ac_cv_path_FGREP="$ac_path_FGREP" ac_path_FGREP_found=:;; *) ac_count=0 $as_echo_n 0123456789 >"conftest.in" while : do cat "conftest.in" "conftest.in" >"conftest.tmp" mv "conftest.tmp" "conftest.in" cp "conftest.in" "conftest.nl" $as_echo 'FGREP' >> "conftest.nl" "$ac_path_FGREP" FGREP < "conftest.nl" >"conftest.out" 2>/dev/null || break diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break as_fn_arith $ac_count + 1 && ac_count=$as_val if test $ac_count -gt ${ac_path_FGREP_max-0}; then # Best one so far, save it but keep looking for a better one ac_cv_path_FGREP="$ac_path_FGREP" ac_path_FGREP_max=$ac_count fi # 10*(2^10) chars as input seems more than enough test $ac_count -gt 10 && break done rm -f conftest.in conftest.tmp conftest.nl conftest.out;; esac $ac_path_FGREP_found && break 3 done done done IFS=$as_save_IFS if test -z "$ac_cv_path_FGREP"; then as_fn_error $? "no acceptable fgrep could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" "$LINENO" 5 fi else ac_cv_path_FGREP=$FGREP fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_path_FGREP" >&5 $as_echo "$ac_cv_path_FGREP" >&6; } FGREP="$ac_cv_path_FGREP" test -z "$GREP" && GREP=grep # Check whether --with-gnu-ld was given. if test "${with_gnu_ld+set}" = set; then : withval=$with_gnu_ld; test "$withval" = no || with_gnu_ld=yes else with_gnu_ld=no fi ac_prog=ld if test "$GCC" = yes; then # Check if gcc -print-prog-name=ld gives a path. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ld used by $CC" >&5 $as_echo_n "checking for ld used by $CC... " >&6; } case $host in *-*-mingw*) # gcc leaves a trailing carriage return which upsets mingw ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;; *) ac_prog=`($CC -print-prog-name=ld) 2>&5` ;; esac case $ac_prog in # Accept absolute paths. [\\/]* | ?:[\\/]*) re_direlt='/[^/][^/]*/\.\./' # Canonicalize the pathname of ld ac_prog=`$ECHO "$ac_prog"| $SED 's%\\\\%/%g'` while $ECHO "$ac_prog" | $GREP "$re_direlt" > /dev/null 2>&1; do ac_prog=`$ECHO $ac_prog| $SED "s%$re_direlt%/%"` done test -z "$LD" && LD="$ac_prog" ;; "") # If it fails, then pretend we aren't using GCC. ac_prog=ld ;; *) # If it is relative, then search for the first ld in PATH. with_gnu_ld=unknown ;; esac elif test "$with_gnu_ld" = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for GNU ld" >&5 $as_echo_n "checking for GNU ld... " >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for non-GNU ld" >&5 $as_echo_n "checking for non-GNU ld... " >&6; } fi if ${lt_cv_path_LD+:} false; then : $as_echo_n "(cached) " >&6 else if test -z "$LD"; then lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then lt_cv_path_LD="$ac_dir/$ac_prog" # Check to see if the program is GNU ld. I'd rather use --version, # but apparently some variants of GNU ld only accept -v. # Break only if it was the GNU/non-GNU ld that we prefer. case `"$lt_cv_path_LD" -v 2>&1 &5 $as_echo "$LD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -z "$LD" && as_fn_error $? "no acceptable ld found in \$PATH" "$LINENO" 5 { $as_echo "$as_me:${as_lineno-$LINENO}: checking if the linker ($LD) is GNU ld" >&5 $as_echo_n "checking if the linker ($LD) is GNU ld... " >&6; } if ${lt_cv_prog_gnu_ld+:} false; then : $as_echo_n "(cached) " >&6 else # I'd rather use --version here, but apparently some GNU lds only accept -v. case `$LD -v 2>&1 &5 $as_echo "$lt_cv_prog_gnu_ld" >&6; } with_gnu_ld=$lt_cv_prog_gnu_ld { $as_echo "$as_me:${as_lineno-$LINENO}: checking for BSD- or MS-compatible name lister (nm)" >&5 $as_echo_n "checking for BSD- or MS-compatible name lister (nm)... " >&6; } if ${lt_cv_path_NM+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$NM"; then # Let the user override the test. lt_cv_path_NM="$NM" else lt_nm_to_check="${ac_tool_prefix}nm" if test -n "$ac_tool_prefix" && test "$build" = "$host"; then lt_nm_to_check="$lt_nm_to_check nm" fi for lt_tmp_nm in $lt_nm_to_check; do lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH /usr/ccs/bin/elf /usr/ccs/bin /usr/ucb /bin; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. tmp_nm="$ac_dir/$lt_tmp_nm" if test -f "$tmp_nm" || test -f "$tmp_nm$ac_exeext" ; then # Check to see if the nm accepts a BSD-compat flag. # Adding the `sed 1q' prevents false positives on HP-UX, which says: # nm: unknown option "B" ignored # Tru64's nm complains that /dev/null is an invalid object file case `"$tmp_nm" -B /dev/null 2>&1 | sed '1q'` in */dev/null* | *'Invalid file or object type'*) lt_cv_path_NM="$tmp_nm -B" break ;; *) case `"$tmp_nm" -p /dev/null 2>&1 | sed '1q'` in */dev/null*) lt_cv_path_NM="$tmp_nm -p" break ;; *) lt_cv_path_NM=${lt_cv_path_NM="$tmp_nm"} # keep the first match, but continue # so that we can try to find one that supports BSD flags ;; esac ;; esac fi done IFS="$lt_save_ifs" done : ${lt_cv_path_NM=no} fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_path_NM" >&5 $as_echo "$lt_cv_path_NM" >&6; } if test "$lt_cv_path_NM" != "no"; then NM="$lt_cv_path_NM" else # Didn't find any BSD compatible name lister, look for dumpbin. if test -n "$DUMPBIN"; then : # Let the user override the test. else if test -n "$ac_tool_prefix"; then for ac_prog in dumpbin "link -dump" do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_DUMPBIN+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$DUMPBIN"; then ac_cv_prog_DUMPBIN="$DUMPBIN" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_DUMPBIN="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi DUMPBIN=$ac_cv_prog_DUMPBIN if test -n "$DUMPBIN"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $DUMPBIN" >&5 $as_echo "$DUMPBIN" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$DUMPBIN" && break done fi if test -z "$DUMPBIN"; then ac_ct_DUMPBIN=$DUMPBIN for ac_prog in dumpbin "link -dump" do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_DUMPBIN+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_DUMPBIN"; then ac_cv_prog_ac_ct_DUMPBIN="$ac_ct_DUMPBIN" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_DUMPBIN="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_DUMPBIN=$ac_cv_prog_ac_ct_DUMPBIN if test -n "$ac_ct_DUMPBIN"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_DUMPBIN" >&5 $as_echo "$ac_ct_DUMPBIN" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_DUMPBIN" && break done if test "x$ac_ct_DUMPBIN" = x; then DUMPBIN=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac DUMPBIN=$ac_ct_DUMPBIN fi fi case `$DUMPBIN -symbols /dev/null 2>&1 | sed '1q'` in *COFF*) DUMPBIN="$DUMPBIN -symbols" ;; *) DUMPBIN=: ;; esac fi if test "$DUMPBIN" != ":"; then NM="$DUMPBIN" fi fi test -z "$NM" && NM=nm { $as_echo "$as_me:${as_lineno-$LINENO}: checking the name lister ($NM) interface" >&5 $as_echo_n "checking the name lister ($NM) interface... " >&6; } if ${lt_cv_nm_interface+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_nm_interface="BSD nm" echo "int some_variable = 0;" > conftest.$ac_ext (eval echo "\"\$as_me:$LINENO: $ac_compile\"" >&5) (eval "$ac_compile" 2>conftest.err) cat conftest.err >&5 (eval echo "\"\$as_me:$LINENO: $NM \\\"conftest.$ac_objext\\\"\"" >&5) (eval "$NM \"conftest.$ac_objext\"" 2>conftest.err > conftest.out) cat conftest.err >&5 (eval echo "\"\$as_me:$LINENO: output\"" >&5) cat conftest.out >&5 if $GREP 'External.*some_variable' conftest.out > /dev/null; then lt_cv_nm_interface="MS dumpbin" fi rm -f conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_nm_interface" >&5 $as_echo "$lt_cv_nm_interface" >&6; } # find the maximum length of command line arguments { $as_echo "$as_me:${as_lineno-$LINENO}: checking the maximum length of command line arguments" >&5 $as_echo_n "checking the maximum length of command line arguments... " >&6; } if ${lt_cv_sys_max_cmd_len+:} false; then : $as_echo_n "(cached) " >&6 else i=0 teststring="ABCD" case $build_os in msdosdjgpp*) # On DJGPP, this test can blow up pretty badly due to problems in libc # (any single argument exceeding 2000 bytes causes a buffer overrun # during glob expansion). Even if it were fixed, the result of this # check would be larger than it should be. lt_cv_sys_max_cmd_len=12288; # 12K is about right ;; gnu*) # Under GNU Hurd, this test is not required because there is # no limit to the length of command line arguments. # Libtool will interpret -1 as no limit whatsoever lt_cv_sys_max_cmd_len=-1; ;; cygwin* | mingw* | cegcc*) # On Win9x/ME, this test blows up -- it succeeds, but takes # about 5 minutes as the teststring grows exponentially. # Worse, since 9x/ME are not pre-emptively multitasking, # you end up with a "frozen" computer, even though with patience # the test eventually succeeds (with a max line length of 256k). # Instead, let's just punt: use the minimum linelength reported by # all of the supported platforms: 8192 (on NT/2K/XP). lt_cv_sys_max_cmd_len=8192; ;; mint*) # On MiNT this can take a long time and run out of memory. lt_cv_sys_max_cmd_len=8192; ;; amigaos*) # On AmigaOS with pdksh, this test takes hours, literally. # So we just punt and use a minimum line length of 8192. lt_cv_sys_max_cmd_len=8192; ;; netbsd* | freebsd* | openbsd* | darwin* | dragonfly*) # This has been around since 386BSD, at least. Likely further. if test -x /sbin/sysctl; then lt_cv_sys_max_cmd_len=`/sbin/sysctl -n kern.argmax` elif test -x /usr/sbin/sysctl; then lt_cv_sys_max_cmd_len=`/usr/sbin/sysctl -n kern.argmax` else lt_cv_sys_max_cmd_len=65536 # usable default for all BSDs fi # And add a safety zone lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` ;; interix*) # We know the value 262144 and hardcode it with a safety zone (like BSD) lt_cv_sys_max_cmd_len=196608 ;; os2*) # The test takes a long time on OS/2. lt_cv_sys_max_cmd_len=8192 ;; osf*) # Dr. Hans Ekkehard Plesser reports seeing a kernel panic running configure # due to this test when exec_disable_arg_limit is 1 on Tru64. It is not # nice to cause kernel panics so lets avoid the loop below. # First set a reasonable default. lt_cv_sys_max_cmd_len=16384 # if test -x /sbin/sysconfig; then case `/sbin/sysconfig -q proc exec_disable_arg_limit` in *1*) lt_cv_sys_max_cmd_len=-1 ;; esac fi ;; sco3.2v5*) lt_cv_sys_max_cmd_len=102400 ;; sysv5* | sco5v6* | sysv4.2uw2*) kargmax=`grep ARG_MAX /etc/conf/cf.d/stune 2>/dev/null` if test -n "$kargmax"; then lt_cv_sys_max_cmd_len=`echo $kargmax | sed 's/.*[ ]//'` else lt_cv_sys_max_cmd_len=32768 fi ;; *) lt_cv_sys_max_cmd_len=`(getconf ARG_MAX) 2> /dev/null` if test -n "$lt_cv_sys_max_cmd_len" && \ test undefined != "$lt_cv_sys_max_cmd_len"; then lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 4` lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \* 3` else # Make teststring a little bigger before we do anything with it. # a 1K string should be a reasonable start. for i in 1 2 3 4 5 6 7 8 ; do teststring=$teststring$teststring done SHELL=${SHELL-${CONFIG_SHELL-/bin/sh}} # If test is not a shell built-in, we'll probably end up computing a # maximum length that is only half of the actual maximum length, but # we can't tell. while { test "X"`env echo "$teststring$teststring" 2>/dev/null` \ = "X$teststring$teststring"; } >/dev/null 2>&1 && test $i != 17 # 1/2 MB should be enough do i=`expr $i + 1` teststring=$teststring$teststring done # Only check the string length outside the loop. lt_cv_sys_max_cmd_len=`expr "X$teststring" : ".*" 2>&1` teststring= # Add a significant safety factor because C++ compilers can tack on # massive amounts of additional arguments before passing them to the # linker. It appears as though 1/2 is a usable value. lt_cv_sys_max_cmd_len=`expr $lt_cv_sys_max_cmd_len \/ 2` fi ;; esac fi if test -n $lt_cv_sys_max_cmd_len ; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_sys_max_cmd_len" >&5 $as_echo "$lt_cv_sys_max_cmd_len" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: none" >&5 $as_echo "none" >&6; } fi max_cmd_len=$lt_cv_sys_max_cmd_len : ${CP="cp -f"} : ${MV="mv -f"} : ${RM="rm -f"} { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the shell understands some XSI constructs" >&5 $as_echo_n "checking whether the shell understands some XSI constructs... " >&6; } # Try some XSI features xsi_shell=no ( _lt_dummy="a/b/c" test "${_lt_dummy##*/},${_lt_dummy%/*},${_lt_dummy#??}"${_lt_dummy%"$_lt_dummy"}, \ = c,a/b,b/c, \ && eval 'test $(( 1 + 1 )) -eq 2 \ && test "${#_lt_dummy}" -eq 5' ) >/dev/null 2>&1 \ && xsi_shell=yes { $as_echo "$as_me:${as_lineno-$LINENO}: result: $xsi_shell" >&5 $as_echo "$xsi_shell" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the shell understands \"+=\"" >&5 $as_echo_n "checking whether the shell understands \"+=\"... " >&6; } lt_shell_append=no ( foo=bar; set foo baz; eval "$1+=\$2" && test "$foo" = barbaz ) \ >/dev/null 2>&1 \ && lt_shell_append=yes { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_shell_append" >&5 $as_echo "$lt_shell_append" >&6; } if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then lt_unset=unset else lt_unset=false fi # test EBCDIC or ASCII case `echo X|tr X '\101'` in A) # ASCII based system # \n is not interpreted correctly by Solaris 8 /usr/ucb/tr lt_SP2NL='tr \040 \012' lt_NL2SP='tr \015\012 \040\040' ;; *) # EBCDIC based system lt_SP2NL='tr \100 \n' lt_NL2SP='tr \r\n \100\100' ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to convert $build file names to $host format" >&5 $as_echo_n "checking how to convert $build file names to $host format... " >&6; } if ${lt_cv_to_host_file_cmd+:} false; then : $as_echo_n "(cached) " >&6 else case $host in *-*-mingw* ) case $build in *-*-mingw* ) # actually msys lt_cv_to_host_file_cmd=func_convert_file_msys_to_w32 ;; *-*-cygwin* ) lt_cv_to_host_file_cmd=func_convert_file_cygwin_to_w32 ;; * ) # otherwise, assume *nix lt_cv_to_host_file_cmd=func_convert_file_nix_to_w32 ;; esac ;; *-*-cygwin* ) case $build in *-*-mingw* ) # actually msys lt_cv_to_host_file_cmd=func_convert_file_msys_to_cygwin ;; *-*-cygwin* ) lt_cv_to_host_file_cmd=func_convert_file_noop ;; * ) # otherwise, assume *nix lt_cv_to_host_file_cmd=func_convert_file_nix_to_cygwin ;; esac ;; * ) # unhandled hosts (and "normal" native builds) lt_cv_to_host_file_cmd=func_convert_file_noop ;; esac fi to_host_file_cmd=$lt_cv_to_host_file_cmd { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_to_host_file_cmd" >&5 $as_echo "$lt_cv_to_host_file_cmd" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to convert $build file names to toolchain format" >&5 $as_echo_n "checking how to convert $build file names to toolchain format... " >&6; } if ${lt_cv_to_tool_file_cmd+:} false; then : $as_echo_n "(cached) " >&6 else #assume ordinary cross tools, or native build. lt_cv_to_tool_file_cmd=func_convert_file_noop case $host in *-*-mingw* ) case $build in *-*-mingw* ) # actually msys lt_cv_to_tool_file_cmd=func_convert_file_msys_to_w32 ;; esac ;; esac fi to_tool_file_cmd=$lt_cv_to_tool_file_cmd { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_to_tool_file_cmd" >&5 $as_echo "$lt_cv_to_tool_file_cmd" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $LD option to reload object files" >&5 $as_echo_n "checking for $LD option to reload object files... " >&6; } if ${lt_cv_ld_reload_flag+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_ld_reload_flag='-r' fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_reload_flag" >&5 $as_echo "$lt_cv_ld_reload_flag" >&6; } reload_flag=$lt_cv_ld_reload_flag case $reload_flag in "" | " "*) ;; *) reload_flag=" $reload_flag" ;; esac reload_cmds='$LD$reload_flag -o $output$reload_objs' case $host_os in cygwin* | mingw* | pw32* | cegcc*) if test "$GCC" != yes; then reload_cmds=false fi ;; darwin*) if test "$GCC" = yes; then reload_cmds='$LTCC $LTCFLAGS -nostdlib ${wl}-r -o $output$reload_objs' else reload_cmds='$LD$reload_flag -o $output$reload_objs' fi ;; esac if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}objdump", so it can be a program name with args. set dummy ${ac_tool_prefix}objdump; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_OBJDUMP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$OBJDUMP"; then ac_cv_prog_OBJDUMP="$OBJDUMP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_OBJDUMP="${ac_tool_prefix}objdump" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi OBJDUMP=$ac_cv_prog_OBJDUMP if test -n "$OBJDUMP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OBJDUMP" >&5 $as_echo "$OBJDUMP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_OBJDUMP"; then ac_ct_OBJDUMP=$OBJDUMP # Extract the first word of "objdump", so it can be a program name with args. set dummy objdump; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_OBJDUMP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_OBJDUMP"; then ac_cv_prog_ac_ct_OBJDUMP="$ac_ct_OBJDUMP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_OBJDUMP="objdump" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_OBJDUMP=$ac_cv_prog_ac_ct_OBJDUMP if test -n "$ac_ct_OBJDUMP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_OBJDUMP" >&5 $as_echo "$ac_ct_OBJDUMP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_OBJDUMP" = x; then OBJDUMP="false" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac OBJDUMP=$ac_ct_OBJDUMP fi else OBJDUMP="$ac_cv_prog_OBJDUMP" fi test -z "$OBJDUMP" && OBJDUMP=objdump { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to recognize dependent libraries" >&5 $as_echo_n "checking how to recognize dependent libraries... " >&6; } if ${lt_cv_deplibs_check_method+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_file_magic_cmd='$MAGIC_CMD' lt_cv_file_magic_test_file= lt_cv_deplibs_check_method='unknown' # Need to set the preceding variable on all platforms that support # interlibrary dependencies. # 'none' -- dependencies not supported. # `unknown' -- same as none, but documents that we really don't know. # 'pass_all' -- all dependencies passed with no checks. # 'test_compile' -- check by making test program. # 'file_magic [[regex]]' -- check by looking for files in library path # which responds to the $file_magic_cmd with a given extended regex. # If you have `file' or equivalent on your system and you're not sure # whether `pass_all' will *always* work, you probably want this one. case $host_os in aix[4-9]*) lt_cv_deplibs_check_method=pass_all ;; beos*) lt_cv_deplibs_check_method=pass_all ;; bsdi[45]*) lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (shared object|dynamic lib)' lt_cv_file_magic_cmd='/usr/bin/file -L' lt_cv_file_magic_test_file=/shlib/libc.so ;; cygwin*) # func_win32_libid is a shell function defined in ltmain.sh lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL' lt_cv_file_magic_cmd='func_win32_libid' ;; mingw* | pw32*) # Base MSYS/MinGW do not provide the 'file' command needed by # func_win32_libid shell function, so use a weaker test based on 'objdump', # unless we find 'file', for example because we are cross-compiling. # func_win32_libid assumes BSD nm, so disallow it if using MS dumpbin. if ( test "$lt_cv_nm_interface" = "BSD nm" && file / ) >/dev/null 2>&1; then lt_cv_deplibs_check_method='file_magic ^x86 archive import|^x86 DLL' lt_cv_file_magic_cmd='func_win32_libid' else # Keep this pattern in sync with the one in func_win32_libid. lt_cv_deplibs_check_method='file_magic file format (pei*-i386(.*architecture: i386)?|pe-arm-wince|pe-x86-64)' lt_cv_file_magic_cmd='$OBJDUMP -f' fi ;; cegcc*) # use the weaker test based on 'objdump'. See mingw*. lt_cv_deplibs_check_method='file_magic file format pe-arm-.*little(.*architecture: arm)?' lt_cv_file_magic_cmd='$OBJDUMP -f' ;; darwin* | rhapsody*) lt_cv_deplibs_check_method=pass_all ;; freebsd* | dragonfly*) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then case $host_cpu in i*86 ) # Not sure whether the presence of OpenBSD here was a mistake. # Let's accept both of them until this is cleared up. lt_cv_deplibs_check_method='file_magic (FreeBSD|OpenBSD|DragonFly)/i[3-9]86 (compact )?demand paged shared library' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=`echo /usr/lib/libc.so.*` ;; esac else lt_cv_deplibs_check_method=pass_all fi ;; haiku*) lt_cv_deplibs_check_method=pass_all ;; hpux10.20* | hpux11*) lt_cv_file_magic_cmd=/usr/bin/file case $host_cpu in ia64*) lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF-[0-9][0-9]) shared object file - IA64' lt_cv_file_magic_test_file=/usr/lib/hpux32/libc.so ;; hppa*64*) lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|ELF[ -][0-9][0-9])(-bit)?( [LM]SB)? shared object( file)?[, -]* PA-RISC [0-9]\.[0-9]' lt_cv_file_magic_test_file=/usr/lib/pa20_64/libc.sl ;; *) lt_cv_deplibs_check_method='file_magic (s[0-9][0-9][0-9]|PA-RISC[0-9]\.[0-9]) shared library' lt_cv_file_magic_test_file=/usr/lib/libc.sl ;; esac ;; interix[3-9]*) # PIC code is broken on Interix 3.x, that's why |\.a not |_pic\.a here lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so|\.a)$' ;; irix5* | irix6* | nonstopux*) case $LD in *-32|*"-32 ") libmagic=32-bit;; *-n32|*"-n32 ") libmagic=N32;; *-64|*"-64 ") libmagic=64-bit;; *) libmagic=never-match;; esac lt_cv_deplibs_check_method=pass_all ;; # This must be glibc/ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) lt_cv_deplibs_check_method=pass_all ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ > /dev/null; then lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so|_pic\.a)$' fi ;; newos6*) lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (executable|dynamic lib)' lt_cv_file_magic_cmd=/usr/bin/file lt_cv_file_magic_test_file=/usr/lib/libnls.so ;; *nto* | *qnx*) lt_cv_deplibs_check_method=pass_all ;; openbsd*) if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|\.so|_pic\.a)$' else lt_cv_deplibs_check_method='match_pattern /lib[^/]+(\.so\.[0-9]+\.[0-9]+|_pic\.a)$' fi ;; osf3* | osf4* | osf5*) lt_cv_deplibs_check_method=pass_all ;; rdos*) lt_cv_deplibs_check_method=pass_all ;; solaris*) lt_cv_deplibs_check_method=pass_all ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) lt_cv_deplibs_check_method=pass_all ;; sysv4 | sysv4.3*) case $host_vendor in motorola) lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [ML]SB (shared object|dynamic lib) M[0-9][0-9]* Version [0-9]' lt_cv_file_magic_test_file=`echo /usr/lib/libc.so*` ;; ncr) lt_cv_deplibs_check_method=pass_all ;; sequent) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method='file_magic ELF [0-9][0-9]*-bit [LM]SB (shared object|dynamic lib )' ;; sni) lt_cv_file_magic_cmd='/bin/file' lt_cv_deplibs_check_method="file_magic ELF [0-9][0-9]*-bit [LM]SB dynamic lib" lt_cv_file_magic_test_file=/lib/libc.so ;; siemens) lt_cv_deplibs_check_method=pass_all ;; pc) lt_cv_deplibs_check_method=pass_all ;; esac ;; tpf*) lt_cv_deplibs_check_method=pass_all ;; esac fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_deplibs_check_method" >&5 $as_echo "$lt_cv_deplibs_check_method" >&6; } file_magic_glob= want_nocaseglob=no if test "$build" = "$host"; then case $host_os in mingw* | pw32*) if ( shopt | grep nocaseglob ) >/dev/null 2>&1; then want_nocaseglob=yes else file_magic_glob=`echo aAbBcCdDeEfFgGhHiIjJkKlLmMnNoOpPqQrRsStTuUvVwWxXyYzZ | $SED -e "s/\(..\)/s\/[\1]\/[\1]\/g;/g"` fi ;; esac fi file_magic_cmd=$lt_cv_file_magic_cmd deplibs_check_method=$lt_cv_deplibs_check_method test -z "$deplibs_check_method" && deplibs_check_method=unknown if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}dlltool", so it can be a program name with args. set dummy ${ac_tool_prefix}dlltool; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_DLLTOOL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$DLLTOOL"; then ac_cv_prog_DLLTOOL="$DLLTOOL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_DLLTOOL="${ac_tool_prefix}dlltool" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi DLLTOOL=$ac_cv_prog_DLLTOOL if test -n "$DLLTOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $DLLTOOL" >&5 $as_echo "$DLLTOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_DLLTOOL"; then ac_ct_DLLTOOL=$DLLTOOL # Extract the first word of "dlltool", so it can be a program name with args. set dummy dlltool; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_DLLTOOL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_DLLTOOL"; then ac_cv_prog_ac_ct_DLLTOOL="$ac_ct_DLLTOOL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_DLLTOOL="dlltool" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_DLLTOOL=$ac_cv_prog_ac_ct_DLLTOOL if test -n "$ac_ct_DLLTOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_DLLTOOL" >&5 $as_echo "$ac_ct_DLLTOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_DLLTOOL" = x; then DLLTOOL="false" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac DLLTOOL=$ac_ct_DLLTOOL fi else DLLTOOL="$ac_cv_prog_DLLTOOL" fi test -z "$DLLTOOL" && DLLTOOL=dlltool { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to associate runtime and link libraries" >&5 $as_echo_n "checking how to associate runtime and link libraries... " >&6; } if ${lt_cv_sharedlib_from_linklib_cmd+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_sharedlib_from_linklib_cmd='unknown' case $host_os in cygwin* | mingw* | pw32* | cegcc*) # two different shell functions defined in ltmain.sh # decide which to use based on capabilities of $DLLTOOL case `$DLLTOOL --help 2>&1` in *--identify-strict*) lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib ;; *) lt_cv_sharedlib_from_linklib_cmd=func_cygming_dll_for_implib_fallback ;; esac ;; *) # fallback: assume linklib IS sharedlib lt_cv_sharedlib_from_linklib_cmd="$ECHO" ;; esac fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_sharedlib_from_linklib_cmd" >&5 $as_echo "$lt_cv_sharedlib_from_linklib_cmd" >&6; } sharedlib_from_linklib_cmd=$lt_cv_sharedlib_from_linklib_cmd test -z "$sharedlib_from_linklib_cmd" && sharedlib_from_linklib_cmd=$ECHO if test -n "$ac_tool_prefix"; then for ac_prog in ar do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_AR+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$AR"; then ac_cv_prog_AR="$AR" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_AR="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi AR=$ac_cv_prog_AR if test -n "$AR"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AR" >&5 $as_echo "$AR" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$AR" && break done fi if test -z "$AR"; then ac_ct_AR=$AR for ac_prog in ar do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_AR+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_AR"; then ac_cv_prog_ac_ct_AR="$ac_ct_AR" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_AR="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_AR=$ac_cv_prog_ac_ct_AR if test -n "$ac_ct_AR"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_AR" >&5 $as_echo "$ac_ct_AR" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_AR" && break done if test "x$ac_ct_AR" = x; then AR="false" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac AR=$ac_ct_AR fi fi : ${AR=ar} : ${AR_FLAGS=cru} { $as_echo "$as_me:${as_lineno-$LINENO}: checking for archiver @FILE support" >&5 $as_echo_n "checking for archiver @FILE support... " >&6; } if ${lt_cv_ar_at_file+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_ar_at_file=no cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : echo conftest.$ac_objext > conftest.lst lt_ar_try='$AR $AR_FLAGS libconftest.a @conftest.lst >&5' { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$lt_ar_try\""; } >&5 (eval $lt_ar_try) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } if test "$ac_status" -eq 0; then # Ensure the archiver fails upon bogus file names. rm -f conftest.$ac_objext libconftest.a { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$lt_ar_try\""; } >&5 (eval $lt_ar_try) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } if test "$ac_status" -ne 0; then lt_cv_ar_at_file=@ fi fi rm -f conftest.* libconftest.a fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ar_at_file" >&5 $as_echo "$lt_cv_ar_at_file" >&6; } if test "x$lt_cv_ar_at_file" = xno; then archiver_list_spec= else archiver_list_spec=$lt_cv_ar_at_file fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args. set dummy ${ac_tool_prefix}strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_STRIP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$STRIP"; then ac_cv_prog_STRIP="$STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_STRIP="${ac_tool_prefix}strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi STRIP=$ac_cv_prog_STRIP if test -n "$STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5 $as_echo "$STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_STRIP"; then ac_ct_STRIP=$STRIP # Extract the first word of "strip", so it can be a program name with args. set dummy strip; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_STRIP+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_STRIP"; then ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_STRIP="strip" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP if test -n "$ac_ct_STRIP"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5 $as_echo "$ac_ct_STRIP" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_STRIP" = x; then STRIP=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac STRIP=$ac_ct_STRIP fi else STRIP="$ac_cv_prog_STRIP" fi test -z "$STRIP" && STRIP=: if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}ranlib", so it can be a program name with args. set dummy ${ac_tool_prefix}ranlib; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_RANLIB+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$RANLIB"; then ac_cv_prog_RANLIB="$RANLIB" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_RANLIB="${ac_tool_prefix}ranlib" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi RANLIB=$ac_cv_prog_RANLIB if test -n "$RANLIB"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $RANLIB" >&5 $as_echo "$RANLIB" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_RANLIB"; then ac_ct_RANLIB=$RANLIB # Extract the first word of "ranlib", so it can be a program name with args. set dummy ranlib; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_RANLIB+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_RANLIB"; then ac_cv_prog_ac_ct_RANLIB="$ac_ct_RANLIB" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_RANLIB="ranlib" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_RANLIB=$ac_cv_prog_ac_ct_RANLIB if test -n "$ac_ct_RANLIB"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_RANLIB" >&5 $as_echo "$ac_ct_RANLIB" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_RANLIB" = x; then RANLIB=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac RANLIB=$ac_ct_RANLIB fi else RANLIB="$ac_cv_prog_RANLIB" fi test -z "$RANLIB" && RANLIB=: # Determine commands to create old-style static archives. old_archive_cmds='$AR $AR_FLAGS $oldlib$oldobjs' old_postinstall_cmds='chmod 644 $oldlib' old_postuninstall_cmds= if test -n "$RANLIB"; then case $host_os in openbsd*) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB -t \$tool_oldlib" ;; *) old_postinstall_cmds="$old_postinstall_cmds~\$RANLIB \$tool_oldlib" ;; esac old_archive_cmds="$old_archive_cmds~\$RANLIB \$tool_oldlib" fi case $host_os in darwin*) lock_old_archive_extraction=yes ;; *) lock_old_archive_extraction=no ;; esac # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC # Check for command to grab the raw symbol name followed by C symbol from nm. { $as_echo "$as_me:${as_lineno-$LINENO}: checking command to parse $NM output from $compiler object" >&5 $as_echo_n "checking command to parse $NM output from $compiler object... " >&6; } if ${lt_cv_sys_global_symbol_pipe+:} false; then : $as_echo_n "(cached) " >&6 else # These are sane defaults that work on at least a few old systems. # [They come from Ultrix. What could be older than Ultrix?!! ;)] # Character class describing NM global symbol codes. symcode='[BCDEGRST]' # Regexp to match symbols that can be accessed directly from C. sympat='\([_A-Za-z][_A-Za-z0-9]*\)' # Define system-specific variables. case $host_os in aix*) symcode='[BCDT]' ;; cygwin* | mingw* | pw32* | cegcc*) symcode='[ABCDGISTW]' ;; hpux*) if test "$host_cpu" = ia64; then symcode='[ABCDEGRST]' fi ;; irix* | nonstopux*) symcode='[BCDEGRST]' ;; osf*) symcode='[BCDEGQRST]' ;; solaris*) symcode='[BDRT]' ;; sco3.2v5*) symcode='[DT]' ;; sysv4.2uw2*) symcode='[DT]' ;; sysv5* | sco5v6* | unixware* | OpenUNIX*) symcode='[ABDT]' ;; sysv4) symcode='[DFNSTU]' ;; esac # If we're using GNU nm, then use its standard symbol codes. case `$NM -V 2>&1` in *GNU* | *'with BFD'*) symcode='[ABCDGIRSTW]' ;; esac # Transform an extracted symbol line into a proper C declaration. # Some systems (esp. on ia64) link data and code symbols differently, # so use this general approach. lt_cv_sys_global_symbol_to_cdecl="sed -n -e 's/^T .* \(.*\)$/extern int \1();/p' -e 's/^$symcode* .* \(.*\)$/extern char \1;/p'" # Transform an extracted symbol line into symbol name and symbol address lt_cv_sys_global_symbol_to_c_name_address="sed -n -e 's/^: \([^ ]*\)[ ]*$/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([^ ]*\) \([^ ]*\)$/ {\"\2\", (void *) \&\2},/p'" lt_cv_sys_global_symbol_to_c_name_address_lib_prefix="sed -n -e 's/^: \([^ ]*\)[ ]*$/ {\\\"\1\\\", (void *) 0},/p' -e 's/^$symcode* \([^ ]*\) \(lib[^ ]*\)$/ {\"\2\", (void *) \&\2},/p' -e 's/^$symcode* \([^ ]*\) \([^ ]*\)$/ {\"lib\2\", (void *) \&\2},/p'" # Handle CRLF in mingw tool chain opt_cr= case $build_os in mingw*) opt_cr=`$ECHO 'x\{0,1\}' | tr x '\015'` # option cr in regexp ;; esac # Try without a prefix underscore, then with it. for ac_symprfx in "" "_"; do # Transform symcode, sympat, and symprfx into a raw symbol and a C symbol. symxfrm="\\1 $ac_symprfx\\2 \\2" # Write the raw and C identifiers. if test "$lt_cv_nm_interface" = "MS dumpbin"; then # Fake it for dumpbin and say T for any non-static function # and D for any global variable. # Also find C++ and __fastcall symbols from MSVC++, # which start with @ or ?. lt_cv_sys_global_symbol_pipe="$AWK '"\ " {last_section=section; section=\$ 3};"\ " /^COFF SYMBOL TABLE/{for(i in hide) delete hide[i]};"\ " /Section length .*#relocs.*(pick any)/{hide[last_section]=1};"\ " \$ 0!~/External *\|/{next};"\ " / 0+ UNDEF /{next}; / UNDEF \([^|]\)*()/{next};"\ " {if(hide[section]) next};"\ " {f=0}; \$ 0~/\(\).*\|/{f=1}; {printf f ? \"T \" : \"D \"};"\ " {split(\$ 0, a, /\||\r/); split(a[2], s)};"\ " s[1]~/^[@?]/{print s[1], s[1]; next};"\ " s[1]~prfx {split(s[1],t,\"@\"); print t[1], substr(t[1],length(prfx))}"\ " ' prfx=^$ac_symprfx" else lt_cv_sys_global_symbol_pipe="sed -n -e 's/^.*[ ]\($symcode$symcode*\)[ ][ ]*$ac_symprfx$sympat$opt_cr$/$symxfrm/p'" fi lt_cv_sys_global_symbol_pipe="$lt_cv_sys_global_symbol_pipe | sed '/ __gnu_lto/d'" # Check to see that the pipe works correctly. pipe_works=no rm -f conftest* cat > conftest.$ac_ext <<_LT_EOF #ifdef __cplusplus extern "C" { #endif char nm_test_var; void nm_test_func(void); void nm_test_func(void){} #ifdef __cplusplus } #endif int main(){nm_test_var='a';nm_test_func();return(0);} _LT_EOF if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then # Now try to grab the symbols. nlist=conftest.nm if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$NM conftest.$ac_objext \| "$lt_cv_sys_global_symbol_pipe" \> $nlist\""; } >&5 (eval $NM conftest.$ac_objext \| "$lt_cv_sys_global_symbol_pipe" \> $nlist) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s "$nlist"; then # Try sorting and uniquifying the output. if sort "$nlist" | uniq > "$nlist"T; then mv -f "$nlist"T "$nlist" else rm -f "$nlist"T fi # Make sure that we snagged all the symbols we need. if $GREP ' nm_test_var$' "$nlist" >/dev/null; then if $GREP ' nm_test_func$' "$nlist" >/dev/null; then cat <<_LT_EOF > conftest.$ac_ext /* Keep this code in sync between libtool.m4, ltmain, lt_system.h, and tests. */ #if defined(_WIN32) || defined(__CYGWIN__) || defined(_WIN32_WCE) /* DATA imports from DLLs on WIN32 con't be const, because runtime relocations are performed -- see ld's documentation on pseudo-relocs. */ # define LT_DLSYM_CONST #elif defined(__osf__) /* This system does not cope well with relocations in const data. */ # define LT_DLSYM_CONST #else # define LT_DLSYM_CONST const #endif #ifdef __cplusplus extern "C" { #endif _LT_EOF # Now generate the symbol file. eval "$lt_cv_sys_global_symbol_to_cdecl"' < "$nlist" | $GREP -v main >> conftest.$ac_ext' cat <<_LT_EOF >> conftest.$ac_ext /* The mapping between symbol names and symbols. */ LT_DLSYM_CONST struct { const char *name; void *address; } lt__PROGRAM__LTX_preloaded_symbols[] = { { "@PROGRAM@", (void *) 0 }, _LT_EOF $SED "s/^$symcode$symcode* \(.*\) \(.*\)$/ {\"\2\", (void *) \&\2},/" < "$nlist" | $GREP -v main >> conftest.$ac_ext cat <<\_LT_EOF >> conftest.$ac_ext {0, (void *) 0} }; /* This works around a problem in FreeBSD linker */ #ifdef FREEBSD_WORKAROUND static const void *lt_preloaded_setup() { return lt__PROGRAM__LTX_preloaded_symbols; } #endif #ifdef __cplusplus } #endif _LT_EOF # Now try linking the two files. mv conftest.$ac_objext conftstm.$ac_objext lt_globsym_save_LIBS=$LIBS lt_globsym_save_CFLAGS=$CFLAGS LIBS="conftstm.$ac_objext" CFLAGS="$CFLAGS$lt_prog_compiler_no_builtin_flag" if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_link\""; } >&5 (eval $ac_link) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s conftest${ac_exeext}; then pipe_works=yes fi LIBS=$lt_globsym_save_LIBS CFLAGS=$lt_globsym_save_CFLAGS else echo "cannot find nm_test_func in $nlist" >&5 fi else echo "cannot find nm_test_var in $nlist" >&5 fi else echo "cannot run $lt_cv_sys_global_symbol_pipe" >&5 fi else echo "$progname: failed program was:" >&5 cat conftest.$ac_ext >&5 fi rm -rf conftest* conftst* # Do not use the global_symbol_pipe unless it works. if test "$pipe_works" = yes; then break else lt_cv_sys_global_symbol_pipe= fi done fi if test -z "$lt_cv_sys_global_symbol_pipe"; then lt_cv_sys_global_symbol_to_cdecl= fi if test -z "$lt_cv_sys_global_symbol_pipe$lt_cv_sys_global_symbol_to_cdecl"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: failed" >&5 $as_echo "failed" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: ok" >&5 $as_echo "ok" >&6; } fi # Response file support. if test "$lt_cv_nm_interface" = "MS dumpbin"; then nm_file_list_spec='@' elif $NM --help 2>/dev/null | grep '[@]FILE' >/dev/null; then nm_file_list_spec='@' fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for sysroot" >&5 $as_echo_n "checking for sysroot... " >&6; } # Check whether --with-sysroot was given. if test "${with_sysroot+set}" = set; then : withval=$with_sysroot; else with_sysroot=no fi lt_sysroot= case ${with_sysroot} in #( yes) if test "$GCC" = yes; then lt_sysroot=`$CC --print-sysroot 2>/dev/null` fi ;; #( /*) lt_sysroot=`echo "$with_sysroot" | sed -e "$sed_quote_subst"` ;; #( no|'') ;; #( *) { $as_echo "$as_me:${as_lineno-$LINENO}: result: ${with_sysroot}" >&5 $as_echo "${with_sysroot}" >&6; } as_fn_error $? "The sysroot must be an absolute path." "$LINENO" 5 ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: ${lt_sysroot:-no}" >&5 $as_echo "${lt_sysroot:-no}" >&6; } # Check whether --enable-libtool-lock was given. if test "${enable_libtool_lock+set}" = set; then : enableval=$enable_libtool_lock; fi test "x$enable_libtool_lock" != xno && enable_libtool_lock=yes # Some flags need to be propagated to the compiler or linker for good # libtool support. case $host in ia64-*-hpux*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then case `/usr/bin/file conftest.$ac_objext` in *ELF-32*) HPUX_IA64_MODE="32" ;; *ELF-64*) HPUX_IA64_MODE="64" ;; esac fi rm -rf conftest* ;; *-*-irix6*) # Find out which ABI we are using. echo '#line '$LINENO' "configure"' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then if test "$lt_cv_prog_gnu_ld" = yes; then case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -melf32bsmip" ;; *N32*) LD="${LD-ld} -melf32bmipn32" ;; *64-bit*) LD="${LD-ld} -melf64bmip" ;; esac else case `/usr/bin/file conftest.$ac_objext` in *32-bit*) LD="${LD-ld} -32" ;; *N32*) LD="${LD-ld} -n32" ;; *64-bit*) LD="${LD-ld} -64" ;; esac fi fi rm -rf conftest* ;; x86_64-*kfreebsd*-gnu|x86_64-*linux*|powerpc*-*linux*| \ s390*-*linux*|s390*-*tpf*|sparc*-*linux*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then case `/usr/bin/file conftest.o` in *32-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_i386_fbsd" ;; x86_64-*linux*) case `/usr/bin/file conftest.o` in *x86-64*) LD="${LD-ld} -m elf32_x86_64" ;; *) LD="${LD-ld} -m elf_i386" ;; esac ;; powerpc64le-*) LD="${LD-ld} -m elf32lppclinux" ;; powerpc64-*) LD="${LD-ld} -m elf32ppclinux" ;; s390x-*linux*) LD="${LD-ld} -m elf_s390" ;; sparc64-*linux*) LD="${LD-ld} -m elf32_sparc" ;; esac ;; *64-bit*) case $host in x86_64-*kfreebsd*-gnu) LD="${LD-ld} -m elf_x86_64_fbsd" ;; x86_64-*linux*) LD="${LD-ld} -m elf_x86_64" ;; powerpcle-*) LD="${LD-ld} -m elf64lppc" ;; powerpc-*) LD="${LD-ld} -m elf64ppc" ;; s390*-*linux*|s390*-*tpf*) LD="${LD-ld} -m elf64_s390" ;; sparc*-*linux*) LD="${LD-ld} -m elf64_sparc" ;; esac ;; esac fi rm -rf conftest* ;; *-*-sco3.2v5*) # On SCO OpenServer 5, we need -belf to get full-featured binaries. SAVE_CFLAGS="$CFLAGS" CFLAGS="$CFLAGS -belf" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the C compiler needs -belf" >&5 $as_echo_n "checking whether the C compiler needs -belf... " >&6; } if ${lt_cv_cc_needs_belf+:} false; then : $as_echo_n "(cached) " >&6 else ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_cv_cc_needs_belf=yes else lt_cv_cc_needs_belf=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_cc_needs_belf" >&5 $as_echo "$lt_cv_cc_needs_belf" >&6; } if test x"$lt_cv_cc_needs_belf" != x"yes"; then # this is probably gcc 2.8.0, egcs 1.0 or newer; no need for -belf CFLAGS="$SAVE_CFLAGS" fi ;; *-*solaris*) # Find out which ABI we are using. echo 'int i;' > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then case `/usr/bin/file conftest.o` in *64-bit*) case $lt_cv_prog_gnu_ld in yes*) case $host in i?86-*-solaris*) LD="${LD-ld} -m elf_x86_64" ;; sparc*-*-solaris*) LD="${LD-ld} -m elf64_sparc" ;; esac # GNU ld 2.21 introduced _sol2 emulations. Use them if available. if ${LD-ld} -V | grep _sol2 >/dev/null 2>&1; then LD="${LD-ld}_sol2" fi ;; *) if ${LD-ld} -64 -r -o conftest2.o conftest.o >/dev/null 2>&1; then LD="${LD-ld} -64" fi ;; esac ;; esac fi rm -rf conftest* ;; esac need_locks="$enable_libtool_lock" if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}mt", so it can be a program name with args. set dummy ${ac_tool_prefix}mt; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_MANIFEST_TOOL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$MANIFEST_TOOL"; then ac_cv_prog_MANIFEST_TOOL="$MANIFEST_TOOL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_MANIFEST_TOOL="${ac_tool_prefix}mt" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi MANIFEST_TOOL=$ac_cv_prog_MANIFEST_TOOL if test -n "$MANIFEST_TOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MANIFEST_TOOL" >&5 $as_echo "$MANIFEST_TOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_MANIFEST_TOOL"; then ac_ct_MANIFEST_TOOL=$MANIFEST_TOOL # Extract the first word of "mt", so it can be a program name with args. set dummy mt; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_MANIFEST_TOOL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_MANIFEST_TOOL"; then ac_cv_prog_ac_ct_MANIFEST_TOOL="$ac_ct_MANIFEST_TOOL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_MANIFEST_TOOL="mt" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_MANIFEST_TOOL=$ac_cv_prog_ac_ct_MANIFEST_TOOL if test -n "$ac_ct_MANIFEST_TOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_MANIFEST_TOOL" >&5 $as_echo "$ac_ct_MANIFEST_TOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_MANIFEST_TOOL" = x; then MANIFEST_TOOL=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac MANIFEST_TOOL=$ac_ct_MANIFEST_TOOL fi else MANIFEST_TOOL="$ac_cv_prog_MANIFEST_TOOL" fi test -z "$MANIFEST_TOOL" && MANIFEST_TOOL=mt { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $MANIFEST_TOOL is a manifest tool" >&5 $as_echo_n "checking if $MANIFEST_TOOL is a manifest tool... " >&6; } if ${lt_cv_path_mainfest_tool+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_path_mainfest_tool=no echo "$as_me:$LINENO: $MANIFEST_TOOL '-?'" >&5 $MANIFEST_TOOL '-?' 2>conftest.err > conftest.out cat conftest.err >&5 if $GREP 'Manifest Tool' conftest.out > /dev/null; then lt_cv_path_mainfest_tool=yes fi rm -f conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_path_mainfest_tool" >&5 $as_echo "$lt_cv_path_mainfest_tool" >&6; } if test "x$lt_cv_path_mainfest_tool" != xyes; then MANIFEST_TOOL=: fi case $host_os in rhapsody* | darwin*) if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}dsymutil", so it can be a program name with args. set dummy ${ac_tool_prefix}dsymutil; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_DSYMUTIL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$DSYMUTIL"; then ac_cv_prog_DSYMUTIL="$DSYMUTIL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_DSYMUTIL="${ac_tool_prefix}dsymutil" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi DSYMUTIL=$ac_cv_prog_DSYMUTIL if test -n "$DSYMUTIL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $DSYMUTIL" >&5 $as_echo "$DSYMUTIL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_DSYMUTIL"; then ac_ct_DSYMUTIL=$DSYMUTIL # Extract the first word of "dsymutil", so it can be a program name with args. set dummy dsymutil; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_DSYMUTIL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_DSYMUTIL"; then ac_cv_prog_ac_ct_DSYMUTIL="$ac_ct_DSYMUTIL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_DSYMUTIL="dsymutil" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_DSYMUTIL=$ac_cv_prog_ac_ct_DSYMUTIL if test -n "$ac_ct_DSYMUTIL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_DSYMUTIL" >&5 $as_echo "$ac_ct_DSYMUTIL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_DSYMUTIL" = x; then DSYMUTIL=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac DSYMUTIL=$ac_ct_DSYMUTIL fi else DSYMUTIL="$ac_cv_prog_DSYMUTIL" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}nmedit", so it can be a program name with args. set dummy ${ac_tool_prefix}nmedit; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_NMEDIT+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$NMEDIT"; then ac_cv_prog_NMEDIT="$NMEDIT" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_NMEDIT="${ac_tool_prefix}nmedit" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi NMEDIT=$ac_cv_prog_NMEDIT if test -n "$NMEDIT"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $NMEDIT" >&5 $as_echo "$NMEDIT" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_NMEDIT"; then ac_ct_NMEDIT=$NMEDIT # Extract the first word of "nmedit", so it can be a program name with args. set dummy nmedit; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_NMEDIT+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_NMEDIT"; then ac_cv_prog_ac_ct_NMEDIT="$ac_ct_NMEDIT" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_NMEDIT="nmedit" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_NMEDIT=$ac_cv_prog_ac_ct_NMEDIT if test -n "$ac_ct_NMEDIT"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_NMEDIT" >&5 $as_echo "$ac_ct_NMEDIT" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_NMEDIT" = x; then NMEDIT=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac NMEDIT=$ac_ct_NMEDIT fi else NMEDIT="$ac_cv_prog_NMEDIT" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}lipo", so it can be a program name with args. set dummy ${ac_tool_prefix}lipo; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_LIPO+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$LIPO"; then ac_cv_prog_LIPO="$LIPO" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_LIPO="${ac_tool_prefix}lipo" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi LIPO=$ac_cv_prog_LIPO if test -n "$LIPO"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $LIPO" >&5 $as_echo "$LIPO" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_LIPO"; then ac_ct_LIPO=$LIPO # Extract the first word of "lipo", so it can be a program name with args. set dummy lipo; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_LIPO+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_LIPO"; then ac_cv_prog_ac_ct_LIPO="$ac_ct_LIPO" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_LIPO="lipo" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_LIPO=$ac_cv_prog_ac_ct_LIPO if test -n "$ac_ct_LIPO"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_LIPO" >&5 $as_echo "$ac_ct_LIPO" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_LIPO" = x; then LIPO=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac LIPO=$ac_ct_LIPO fi else LIPO="$ac_cv_prog_LIPO" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}otool", so it can be a program name with args. set dummy ${ac_tool_prefix}otool; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_OTOOL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$OTOOL"; then ac_cv_prog_OTOOL="$OTOOL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_OTOOL="${ac_tool_prefix}otool" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi OTOOL=$ac_cv_prog_OTOOL if test -n "$OTOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OTOOL" >&5 $as_echo "$OTOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_OTOOL"; then ac_ct_OTOOL=$OTOOL # Extract the first word of "otool", so it can be a program name with args. set dummy otool; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_OTOOL+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_OTOOL"; then ac_cv_prog_ac_ct_OTOOL="$ac_ct_OTOOL" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_OTOOL="otool" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_OTOOL=$ac_cv_prog_ac_ct_OTOOL if test -n "$ac_ct_OTOOL"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_OTOOL" >&5 $as_echo "$ac_ct_OTOOL" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_OTOOL" = x; then OTOOL=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac OTOOL=$ac_ct_OTOOL fi else OTOOL="$ac_cv_prog_OTOOL" fi if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}otool64", so it can be a program name with args. set dummy ${ac_tool_prefix}otool64; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_OTOOL64+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$OTOOL64"; then ac_cv_prog_OTOOL64="$OTOOL64" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_OTOOL64="${ac_tool_prefix}otool64" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi OTOOL64=$ac_cv_prog_OTOOL64 if test -n "$OTOOL64"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $OTOOL64" >&5 $as_echo "$OTOOL64" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_OTOOL64"; then ac_ct_OTOOL64=$OTOOL64 # Extract the first word of "otool64", so it can be a program name with args. set dummy otool64; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_OTOOL64+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_OTOOL64"; then ac_cv_prog_ac_ct_OTOOL64="$ac_ct_OTOOL64" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_OTOOL64="otool64" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_OTOOL64=$ac_cv_prog_ac_ct_OTOOL64 if test -n "$ac_ct_OTOOL64"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_OTOOL64" >&5 $as_echo "$ac_ct_OTOOL64" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_OTOOL64" = x; then OTOOL64=":" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac OTOOL64=$ac_ct_OTOOL64 fi else OTOOL64="$ac_cv_prog_OTOOL64" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for -single_module linker flag" >&5 $as_echo_n "checking for -single_module linker flag... " >&6; } if ${lt_cv_apple_cc_single_mod+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_apple_cc_single_mod=no if test -z "${LT_MULTI_MODULE}"; then # By default we will add the -single_module flag. You can override # by either setting the environment variable LT_MULTI_MODULE # non-empty at configure time, or by adding -multi_module to the # link flags. rm -rf libconftest.dylib* echo "int foo(void){return 1;}" > conftest.c echo "$LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c" >&5 $LTCC $LTCFLAGS $LDFLAGS -o libconftest.dylib \ -dynamiclib -Wl,-single_module conftest.c 2>conftest.err _lt_result=$? # If there is a non-empty error log, and "single_module" # appears in it, assume the flag caused a linker warning if test -s conftest.err && $GREP single_module conftest.err; then cat conftest.err >&5 # Otherwise, if the output was created with a 0 exit code from # the compiler, it worked. elif test -f libconftest.dylib && test $_lt_result -eq 0; then lt_cv_apple_cc_single_mod=yes else cat conftest.err >&5 fi rm -rf libconftest.dylib* rm -f conftest.* fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_apple_cc_single_mod" >&5 $as_echo "$lt_cv_apple_cc_single_mod" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking for -exported_symbols_list linker flag" >&5 $as_echo_n "checking for -exported_symbols_list linker flag... " >&6; } if ${lt_cv_ld_exported_symbols_list+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_ld_exported_symbols_list=no save_LDFLAGS=$LDFLAGS echo "_main" > conftest.sym LDFLAGS="$LDFLAGS -Wl,-exported_symbols_list,conftest.sym" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_cv_ld_exported_symbols_list=yes else lt_cv_ld_exported_symbols_list=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS="$save_LDFLAGS" fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_exported_symbols_list" >&5 $as_echo "$lt_cv_ld_exported_symbols_list" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking for -force_load linker flag" >&5 $as_echo_n "checking for -force_load linker flag... " >&6; } if ${lt_cv_ld_force_load+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_ld_force_load=no cat > conftest.c << _LT_EOF int forced_loaded() { return 2;} _LT_EOF echo "$LTCC $LTCFLAGS -c -o conftest.o conftest.c" >&5 $LTCC $LTCFLAGS -c -o conftest.o conftest.c 2>&5 echo "$AR cru libconftest.a conftest.o" >&5 $AR cru libconftest.a conftest.o 2>&5 echo "$RANLIB libconftest.a" >&5 $RANLIB libconftest.a 2>&5 cat > conftest.c << _LT_EOF int main() { return 0;} _LT_EOF echo "$LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a" >&5 $LTCC $LTCFLAGS $LDFLAGS -o conftest conftest.c -Wl,-force_load,./libconftest.a 2>conftest.err _lt_result=$? if test -s conftest.err && $GREP force_load conftest.err; then cat conftest.err >&5 elif test -f conftest && test $_lt_result -eq 0 && $GREP forced_load conftest >/dev/null 2>&1 ; then lt_cv_ld_force_load=yes else cat conftest.err >&5 fi rm -f conftest.err libconftest.a conftest conftest.c rm -rf conftest.dSYM fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_ld_force_load" >&5 $as_echo "$lt_cv_ld_force_load" >&6; } case $host_os in rhapsody* | darwin1.[012]) _lt_dar_allow_undefined='${wl}-undefined ${wl}suppress' ;; darwin1.*) _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;; darwin*) # darwin 5.x on # if running on 10.5 or later, the deployment target defaults # to the OS version, if on x86, and 10.4, the deployment # target defaults to 10.4. Don't you love it? case ${MACOSX_DEPLOYMENT_TARGET-10.0},$host in 10.0,*86*-darwin8*|10.0,*-darwin[91]*) _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;; 10.[012]*) _lt_dar_allow_undefined='${wl}-flat_namespace ${wl}-undefined ${wl}suppress' ;; 10.*) _lt_dar_allow_undefined='${wl}-undefined ${wl}dynamic_lookup' ;; esac ;; esac if test "$lt_cv_apple_cc_single_mod" = "yes"; then _lt_dar_single_mod='$single_module' fi if test "$lt_cv_ld_exported_symbols_list" = "yes"; then _lt_dar_export_syms=' ${wl}-exported_symbols_list,$output_objdir/${libname}-symbols.expsym' else _lt_dar_export_syms='~$NMEDIT -s $output_objdir/${libname}-symbols.expsym ${lib}' fi if test "$DSYMUTIL" != ":" && test "$lt_cv_ld_force_load" = "no"; then _lt_dsymutil='~$DSYMUTIL $lib || :' else _lt_dsymutil= fi ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ANSI C header files" >&5 $as_echo_n "checking for ANSI C header files... " >&6; } if ${ac_cv_header_stdc+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include #include int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_header_stdc=yes else ac_cv_header_stdc=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext if test $ac_cv_header_stdc = yes; then # SunOS 4.x string.h does not declare mem*, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "memchr" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "free" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi. if test "$cross_compiling" = yes; then : : else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #if ((' ' & 0x0FF) == 0x020) # define ISLOWER(c) ('a' <= (c) && (c) <= 'z') # define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c)) #else # define ISLOWER(c) \ (('a' <= (c) && (c) <= 'i') \ || ('j' <= (c) && (c) <= 'r') \ || ('s' <= (c) && (c) <= 'z')) # define TOUPPER(c) (ISLOWER(c) ? ((c) | 0x40) : (c)) #endif #define XOR(e, f) (((e) && !(f)) || (!(e) && (f))) int main () { int i; for (i = 0; i < 256; i++) if (XOR (islower (i), ISLOWER (i)) || toupper (i) != TOUPPER (i)) return 2; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : else ac_cv_header_stdc=no fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdc" >&5 $as_echo "$ac_cv_header_stdc" >&6; } if test $ac_cv_header_stdc = yes; then $as_echo "#define STDC_HEADERS 1" >>confdefs.h fi # On IRIX 5.3, sys/types and inttypes.h are conflicting. for ac_header in sys/types.h sys/stat.h stdlib.h string.h memory.h strings.h \ inttypes.h stdint.h unistd.h do : as_ac_Header=`$as_echo "ac_cv_header_$ac_header" | $as_tr_sh` ac_fn_c_check_header_compile "$LINENO" "$ac_header" "$as_ac_Header" "$ac_includes_default " if eval test \"x\$"$as_ac_Header"\" = x"yes"; then : cat >>confdefs.h <<_ACEOF #define `$as_echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF fi done for ac_header in dlfcn.h do : ac_fn_c_check_header_compile "$LINENO" "dlfcn.h" "ac_cv_header_dlfcn_h" "$ac_includes_default " if test "x$ac_cv_header_dlfcn_h" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_DLFCN_H 1 _ACEOF fi done func_stripname_cnf () { case ${2} in .*) func_stripname_result=`$ECHO "${3}" | $SED "s%^${1}%%; s%\\\\${2}\$%%"`;; *) func_stripname_result=`$ECHO "${3}" | $SED "s%^${1}%%; s%${2}\$%%"`;; esac } # func_stripname_cnf # Set options enable_dlopen=no enable_win32_dll=no # Check whether --enable-shared was given. if test "${enable_shared+set}" = set; then : enableval=$enable_shared; p=${PACKAGE-default} case $enableval in yes) enable_shared=yes ;; no) enable_shared=no ;; *) enable_shared=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_shared=yes fi done IFS="$lt_save_ifs" ;; esac else enable_shared=yes fi # Check whether --enable-static was given. if test "${enable_static+set}" = set; then : enableval=$enable_static; p=${PACKAGE-default} case $enableval in yes) enable_static=yes ;; no) enable_static=no ;; *) enable_static=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_static=yes fi done IFS="$lt_save_ifs" ;; esac else enable_static=yes fi # Check whether --with-pic was given. if test "${with_pic+set}" = set; then : withval=$with_pic; lt_p=${PACKAGE-default} case $withval in yes|no) pic_mode=$withval ;; *) pic_mode=default # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for lt_pkg in $withval; do IFS="$lt_save_ifs" if test "X$lt_pkg" = "X$lt_p"; then pic_mode=yes fi done IFS="$lt_save_ifs" ;; esac else pic_mode=default fi test -z "$pic_mode" && pic_mode=default # Check whether --enable-fast-install was given. if test "${enable_fast_install+set}" = set; then : enableval=$enable_fast_install; p=${PACKAGE-default} case $enableval in yes) enable_fast_install=yes ;; no) enable_fast_install=no ;; *) enable_fast_install=no # Look at the argument we got. We use all the common list separators. lt_save_ifs="$IFS"; IFS="${IFS}$PATH_SEPARATOR," for pkg in $enableval; do IFS="$lt_save_ifs" if test "X$pkg" = "X$p"; then enable_fast_install=yes fi done IFS="$lt_save_ifs" ;; esac else enable_fast_install=yes fi # This can be used to rebuild libtool when needed LIBTOOL_DEPS="$ltmain" # Always use our own libtool. LIBTOOL='$(SHELL) $(top_builddir)/libtool' test -z "$LN_S" && LN_S="ln -s" if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for objdir" >&5 $as_echo_n "checking for objdir... " >&6; } if ${lt_cv_objdir+:} false; then : $as_echo_n "(cached) " >&6 else rm -f .libs 2>/dev/null mkdir .libs 2>/dev/null if test -d .libs; then lt_cv_objdir=.libs else # MS-DOS does not allow filenames that begin with a dot. lt_cv_objdir=_libs fi rmdir .libs 2>/dev/null fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_objdir" >&5 $as_echo "$lt_cv_objdir" >&6; } objdir=$lt_cv_objdir cat >>confdefs.h <<_ACEOF #define LT_OBJDIR "$lt_cv_objdir/" _ACEOF case $host_os in aix3*) # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test "X${COLLECT_NAMES+set}" != Xset; then COLLECT_NAMES= export COLLECT_NAMES fi ;; esac # Global variables: ofile=libtool can_build_shared=yes # All known linkers require a `.a' archive for static linking (except MSVC, # which needs '.lib'). libext=a with_gnu_ld="$lt_cv_prog_gnu_ld" old_CC="$CC" old_CFLAGS="$CFLAGS" # Set sane defaults for various variables test -z "$CC" && CC=cc test -z "$LTCC" && LTCC=$CC test -z "$LTCFLAGS" && LTCFLAGS=$CFLAGS test -z "$LD" && LD=ld test -z "$ac_objext" && ac_objext=o for cc_temp in $compiler""; do case $cc_temp in compile | *[\\/]compile | ccache | *[\\/]ccache ) ;; distcc | *[\\/]distcc | purify | *[\\/]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$ECHO "$cc_temp" | $SED "s%.*/%%; s%^$host_alias-%%"` # Only perform the check for file, if the check method requires it test -z "$MAGIC_CMD" && MAGIC_CMD=file case $deplibs_check_method in file_magic*) if test "$file_magic_cmd" = '$MAGIC_CMD'; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ${ac_tool_prefix}file" >&5 $as_echo_n "checking for ${ac_tool_prefix}file... " >&6; } if ${lt_cv_path_MAGIC_CMD+:} false; then : $as_echo_n "(cached) " >&6 else case $MAGIC_CMD in [\\/*] | ?:[\\/]*) lt_cv_path_MAGIC_CMD="$MAGIC_CMD" # Let the user override the test with a path. ;; *) lt_save_MAGIC_CMD="$MAGIC_CMD" lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR ac_dummy="/usr/bin$PATH_SEPARATOR$PATH" for ac_dir in $ac_dummy; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/${ac_tool_prefix}file; then lt_cv_path_MAGIC_CMD="$ac_dir/${ac_tool_prefix}file" if test -n "$file_magic_test_file"; then case $deplibs_check_method in "file_magic "*) file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"` MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null | $EGREP "$file_magic_regex" > /dev/null; then : else cat <<_LT_EOF 1>&2 *** Warning: the command libtool uses to detect shared libraries, *** $file_magic_cmd, produces output that libtool cannot recognize. *** The result is that libtool may fail to recognize shared libraries *** as such. This will affect the creation of libtool libraries that *** depend on shared libraries, but programs linked with such libtool *** libraries will work regardless of this problem. Nevertheless, you *** may want to report the problem to your system manager and/or to *** bug-libtool@gnu.org _LT_EOF fi ;; esac fi break fi done IFS="$lt_save_ifs" MAGIC_CMD="$lt_save_MAGIC_CMD" ;; esac fi MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if test -n "$MAGIC_CMD"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MAGIC_CMD" >&5 $as_echo "$MAGIC_CMD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test -z "$lt_cv_path_MAGIC_CMD"; then if test -n "$ac_tool_prefix"; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for file" >&5 $as_echo_n "checking for file... " >&6; } if ${lt_cv_path_MAGIC_CMD+:} false; then : $as_echo_n "(cached) " >&6 else case $MAGIC_CMD in [\\/*] | ?:[\\/]*) lt_cv_path_MAGIC_CMD="$MAGIC_CMD" # Let the user override the test with a path. ;; *) lt_save_MAGIC_CMD="$MAGIC_CMD" lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR ac_dummy="/usr/bin$PATH_SEPARATOR$PATH" for ac_dir in $ac_dummy; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/file; then lt_cv_path_MAGIC_CMD="$ac_dir/file" if test -n "$file_magic_test_file"; then case $deplibs_check_method in "file_magic "*) file_magic_regex=`expr "$deplibs_check_method" : "file_magic \(.*\)"` MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if eval $file_magic_cmd \$file_magic_test_file 2> /dev/null | $EGREP "$file_magic_regex" > /dev/null; then : else cat <<_LT_EOF 1>&2 *** Warning: the command libtool uses to detect shared libraries, *** $file_magic_cmd, produces output that libtool cannot recognize. *** The result is that libtool may fail to recognize shared libraries *** as such. This will affect the creation of libtool libraries that *** depend on shared libraries, but programs linked with such libtool *** libraries will work regardless of this problem. Nevertheless, you *** may want to report the problem to your system manager and/or to *** bug-libtool@gnu.org _LT_EOF fi ;; esac fi break fi done IFS="$lt_save_ifs" MAGIC_CMD="$lt_save_MAGIC_CMD" ;; esac fi MAGIC_CMD="$lt_cv_path_MAGIC_CMD" if test -n "$MAGIC_CMD"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $MAGIC_CMD" >&5 $as_echo "$MAGIC_CMD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi else MAGIC_CMD=: fi fi fi ;; esac # Use C for the default configuration in the libtool script lt_save_CC="$CC" ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu # Source file extension for C test sources. ac_ext=c # Object file extension for compiled C test sources. objext=o objext=$objext # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(){return(0);}' # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC # Save the default compiler, since it gets overwritten when the other # tags are being tested, and _LT_TAGVAR(compiler, []) is a NOP. compiler_DEFAULT=$CC # save warnings/boilerplate of simple test code ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" >conftest.$ac_ext eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_compiler_boilerplate=`cat conftest.err` $RM conftest* ac_outfile=conftest.$ac_objext echo "$lt_simple_link_test_code" >conftest.$ac_ext eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_linker_boilerplate=`cat conftest.err` $RM -r conftest* ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... if test -n "$compiler"; then lt_prog_compiler_no_builtin_flag= if test "$GCC" = yes; then case $cc_basename in nvcc*) lt_prog_compiler_no_builtin_flag=' -Xcompiler -fno-builtin' ;; *) lt_prog_compiler_no_builtin_flag=' -fno-builtin' ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -fno-rtti -fno-exceptions" >&5 $as_echo_n "checking if $compiler supports -fno-rtti -fno-exceptions... " >&6; } if ${lt_cv_prog_compiler_rtti_exceptions+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_rtti_exceptions=no ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-fno-rtti -fno-exceptions" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_rtti_exceptions=yes fi fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_rtti_exceptions" >&5 $as_echo "$lt_cv_prog_compiler_rtti_exceptions" >&6; } if test x"$lt_cv_prog_compiler_rtti_exceptions" = xyes; then lt_prog_compiler_no_builtin_flag="$lt_prog_compiler_no_builtin_flag -fno-rtti -fno-exceptions" else : fi fi lt_prog_compiler_wl= lt_prog_compiler_pic= lt_prog_compiler_static= if test "$GCC" = yes; then lt_prog_compiler_wl='-Wl,' lt_prog_compiler_static='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static='-Bstatic' fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support lt_prog_compiler_pic='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the `-m68020' flag to GCC prevents building anything better, # like `-m68040'. lt_prog_compiler_pic='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries lt_prog_compiler_pic='-DDLL_EXPORT' ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files lt_prog_compiler_pic='-fno-common' ;; haiku*) # PIC is the default for Haiku. # The "-static" flag exists, but is broken. lt_prog_compiler_static= ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) # +Z the default ;; *) lt_prog_compiler_pic='-fPIC' ;; esac ;; interix[3-9]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; msdosdjgpp*) # Just because we use GCC doesn't mean we suddenly get shared libraries # on systems that don't support them. lt_prog_compiler_can_build_shared=no enable_shared=no ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. lt_prog_compiler_pic='-fPIC -shared' ;; sysv4*MP*) if test -d /usr/nec; then lt_prog_compiler_pic=-Kconform_pic fi ;; *) lt_prog_compiler_pic='-fPIC' ;; esac case $cc_basename in nvcc*) # Cuda Compiler Driver 2.2 lt_prog_compiler_wl='-Xlinker ' if test -n "$lt_prog_compiler_pic"; then lt_prog_compiler_pic="-Xcompiler $lt_prog_compiler_pic" fi ;; esac else # PORTME Check for flag to pass linker flags through the system compiler. case $host_os in aix*) lt_prog_compiler_wl='-Wl,' if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static='-Bstatic' else lt_prog_compiler_static='-bnso -bI:/lib/syscalls.exp' fi ;; mingw* | cygwin* | pw32* | os2* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). lt_prog_compiler_pic='-DDLL_EXPORT' ;; hpux9* | hpux10* | hpux11*) lt_prog_compiler_wl='-Wl,' # PIC is the default for IA64 HP-UX and 64-bit HP-UX, but # not for PA HP-UX. case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) lt_prog_compiler_pic='+Z' ;; esac # Is there a better lt_prog_compiler_static that works with the bundled CC? lt_prog_compiler_static='${wl}-a ${wl}archive' ;; irix5* | irix6* | nonstopux*) lt_prog_compiler_wl='-Wl,' # PIC (with -KPIC) is the default. lt_prog_compiler_static='-non_shared' ;; linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) case $cc_basename in # old Intel for x86_64 which still supported -KPIC. ecc*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-static' ;; # icc used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. icc* | ifort*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-fPIC' lt_prog_compiler_static='-static' ;; # Lahey Fortran 8.1. lf95*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='--shared' lt_prog_compiler_static='--static' ;; nagfor*) # NAG Fortran compiler lt_prog_compiler_wl='-Wl,-Wl,,' lt_prog_compiler_pic='-PIC' lt_prog_compiler_static='-Bstatic' ;; pgcc* | pgf77* | pgf90* | pgf95* | pgfortran*) # Portland Group compilers (*not* the Pentium gcc compiler, # which looks to be a dead project) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-fpic' lt_prog_compiler_static='-Bstatic' ;; ccc*) lt_prog_compiler_wl='-Wl,' # All Alpha code is PIC. lt_prog_compiler_static='-non_shared' ;; xl* | bgxl* | bgf* | mpixl*) # IBM XL C 8.0/Fortran 10.1, 11.1 on PPC and BlueGene lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-qpic' lt_prog_compiler_static='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ Ceres\ Fortran* | *Sun*Fortran*\ [1-7].* | *Sun*Fortran*\ 8.[0-3]*) # Sun Fortran 8.3 passes all unrecognized flags to the linker lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' lt_prog_compiler_wl='' ;; *Sun\ F* | *Sun*Fortran*) lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' lt_prog_compiler_wl='-Qoption ld ' ;; *Sun\ C*) # Sun C 5.9 lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' lt_prog_compiler_wl='-Wl,' ;; *Intel*\ [CF]*Compiler*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-fPIC' lt_prog_compiler_static='-static' ;; *Portland\ Group*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-fpic' lt_prog_compiler_static='-Bstatic' ;; esac ;; esac ;; newsos6) lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; *nto* | *qnx*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. lt_prog_compiler_pic='-fPIC -shared' ;; osf3* | osf4* | osf5*) lt_prog_compiler_wl='-Wl,' # All OSF/1 code is PIC. lt_prog_compiler_static='-non_shared' ;; rdos*) lt_prog_compiler_static='-non_shared' ;; solaris*) lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' case $cc_basename in f77* | f90* | f95* | sunf77* | sunf90* | sunf95*) lt_prog_compiler_wl='-Qoption ld ';; *) lt_prog_compiler_wl='-Wl,';; esac ;; sunos4*) lt_prog_compiler_wl='-Qoption ld ' lt_prog_compiler_pic='-PIC' lt_prog_compiler_static='-Bstatic' ;; sysv4 | sysv4.2uw2* | sysv4.3*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; sysv4*MP*) if test -d /usr/nec ;then lt_prog_compiler_pic='-Kconform_pic' lt_prog_compiler_static='-Bstatic' fi ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_pic='-KPIC' lt_prog_compiler_static='-Bstatic' ;; unicos*) lt_prog_compiler_wl='-Wl,' lt_prog_compiler_can_build_shared=no ;; uts4*) lt_prog_compiler_pic='-pic' lt_prog_compiler_static='-Bstatic' ;; *) lt_prog_compiler_can_build_shared=no ;; esac fi case $host_os in # For platforms which do not support PIC, -DPIC is meaningless: *djgpp*) lt_prog_compiler_pic= ;; *) lt_prog_compiler_pic="$lt_prog_compiler_pic -DPIC" ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $compiler option to produce PIC" >&5 $as_echo_n "checking for $compiler option to produce PIC... " >&6; } if ${lt_cv_prog_compiler_pic+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_pic=$lt_prog_compiler_pic fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic" >&5 $as_echo "$lt_cv_prog_compiler_pic" >&6; } lt_prog_compiler_pic=$lt_cv_prog_compiler_pic # # Check to make sure the PIC flag actually works. # if test -n "$lt_prog_compiler_pic"; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler PIC flag $lt_prog_compiler_pic works" >&5 $as_echo_n "checking if $compiler PIC flag $lt_prog_compiler_pic works... " >&6; } if ${lt_cv_prog_compiler_pic_works+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_pic_works=no ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="$lt_prog_compiler_pic -DPIC" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_pic_works=yes fi fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic_works" >&5 $as_echo "$lt_cv_prog_compiler_pic_works" >&6; } if test x"$lt_cv_prog_compiler_pic_works" = xyes; then case $lt_prog_compiler_pic in "" | " "*) ;; *) lt_prog_compiler_pic=" $lt_prog_compiler_pic" ;; esac else lt_prog_compiler_pic= lt_prog_compiler_can_build_shared=no fi fi # # Check to make sure the static flag actually works. # wl=$lt_prog_compiler_wl eval lt_tmp_static_flag=\"$lt_prog_compiler_static\" { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler static flag $lt_tmp_static_flag works" >&5 $as_echo_n "checking if $compiler static flag $lt_tmp_static_flag works... " >&6; } if ${lt_cv_prog_compiler_static_works+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_static_works=no save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS $lt_tmp_static_flag" echo "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&5 $ECHO "$_lt_linker_boilerplate" | $SED '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_static_works=yes fi else lt_cv_prog_compiler_static_works=yes fi fi $RM -r conftest* LDFLAGS="$save_LDFLAGS" fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_static_works" >&5 $as_echo "$lt_cv_prog_compiler_static_works" >&6; } if test x"$lt_cv_prog_compiler_static_works" = xyes; then : else lt_prog_compiler_static= fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5 $as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; } if ${lt_cv_prog_compiler_c_o+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_c_o=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o=yes fi fi chmod u+w . 2>&5 $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o" >&5 $as_echo "$lt_cv_prog_compiler_c_o" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5 $as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; } if ${lt_cv_prog_compiler_c_o+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_c_o=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o=yes fi fi chmod u+w . 2>&5 $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o" >&5 $as_echo "$lt_cv_prog_compiler_c_o" >&6; } hard_links="nottested" if test "$lt_cv_prog_compiler_c_o" = no && test "$need_locks" != no; then # do not overwrite the value of need_locks provided by the user { $as_echo "$as_me:${as_lineno-$LINENO}: checking if we can lock with hard links" >&5 $as_echo_n "checking if we can lock with hard links... " >&6; } hard_links=yes $RM conftest* ln conftest.a conftest.b 2>/dev/null && hard_links=no touch conftest.a ln conftest.a conftest.b 2>&5 || hard_links=no ln conftest.a conftest.b 2>/dev/null && hard_links=no { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hard_links" >&5 $as_echo "$hard_links" >&6; } if test "$hard_links" = no; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&5 $as_echo "$as_me: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&2;} need_locks=warn fi else need_locks=no fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries" >&5 $as_echo_n "checking whether the $compiler linker ($LD) supports shared libraries... " >&6; } runpath_var= allow_undefined_flag= always_export_symbols=no archive_cmds= archive_expsym_cmds= compiler_needs_object=no enable_shared_with_static_runtimes=no export_dynamic_flag_spec= export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' hardcode_automatic=no hardcode_direct=no hardcode_direct_absolute=no hardcode_libdir_flag_spec= hardcode_libdir_separator= hardcode_minus_L=no hardcode_shlibpath_var=unsupported inherit_rpath=no link_all_deplibs=unknown module_cmds= module_expsym_cmds= old_archive_from_new_cmds= old_archive_from_expsyms_cmds= thread_safe_flag_spec= whole_archive_flag_spec= # include_expsyms should be a list of space-separated symbols to be *always* # included in the symbol list include_expsyms= # exclude_expsyms can be an extended regexp of symbols to exclude # it will be wrapped by ` (' and `)$', so one must not match beginning or # end of line. Example: `a|bc|.*d.*' will exclude the symbols `a' and `bc', # as well as any symbol that contains `d'. exclude_expsyms='_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*' # Although _GLOBAL_OFFSET_TABLE_ is a valid symbol C name, most a.out # platforms (ab)use it in PIC code, but their linkers get confused if # the symbol is explicitly referenced. Since portable code cannot # rely on this symbol name, it's probably fine to never include it in # preloaded symbol tables. # Exclude shared library initialization/finalization symbols. extract_expsyms_cmds= case $host_os in cygwin* | mingw* | pw32* | cegcc*) # FIXME: the MSVC++ port hasn't been tested in a loooong time # When not using gcc, we currently assume that we are using # Microsoft Visual C++. if test "$GCC" != yes; then with_gnu_ld=no fi ;; interix*) # we just hope/assume this is gcc and not c89 (= MSVC++) with_gnu_ld=yes ;; openbsd*) with_gnu_ld=no ;; linux* | k*bsd*-gnu | gnu*) link_all_deplibs=no ;; esac ld_shlibs=yes # On some targets, GNU ld is compatible enough with the native linker # that we're better off using the native interface for both. lt_use_gnu_ld_interface=no if test "$with_gnu_ld" = yes; then case $host_os in aix*) # The AIX port of GNU ld has always aspired to compatibility # with the native linker. However, as the warning in the GNU ld # block says, versions before 2.19.5* couldn't really create working # shared libraries, regardless of the interface used. case `$LD -v 2>&1` in *\ \(GNU\ Binutils\)\ 2.19.5*) ;; *\ \(GNU\ Binutils\)\ 2.[2-9]*) ;; *\ \(GNU\ Binutils\)\ [3-9]*) ;; *) lt_use_gnu_ld_interface=yes ;; esac ;; *) lt_use_gnu_ld_interface=yes ;; esac fi if test "$lt_use_gnu_ld_interface" = yes; then # If archive_cmds runs LD, not CC, wlarc should be empty wlarc='${wl}' # Set some defaults for GNU ld with shared library support. These # are reset later if shared libraries are not supported. Putting them # here allows them to be overridden if necessary. runpath_var=LD_RUN_PATH hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' export_dynamic_flag_spec='${wl}--export-dynamic' # ancient GNU ld didn't support --whole-archive et. al. if $LD --help 2>&1 | $GREP 'no-whole-archive' > /dev/null; then whole_archive_flag_spec="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' else whole_archive_flag_spec= fi supports_anon_versioning=no case `$LD -v 2>&1` in *GNU\ gold*) supports_anon_versioning=yes ;; *\ [01].* | *\ 2.[0-9].* | *\ 2.10.*) ;; # catch versions < 2.11 *\ 2.11.93.0.2\ *) supports_anon_versioning=yes ;; # RH7.3 ... *\ 2.11.92.0.12\ *) supports_anon_versioning=yes ;; # Mandrake 8.2 ... *\ 2.11.*) ;; # other 2.11 versions *) supports_anon_versioning=yes ;; esac # See if GNU ld supports shared libraries. case $host_os in aix[3-9]*) # On AIX/PPC, the GNU linker is very broken if test "$host_cpu" != ia64; then ld_shlibs=no cat <<_LT_EOF 1>&2 *** Warning: the GNU linker, at least up to release 2.19, is reported *** to be unable to reliably create shared libraries on AIX. *** Therefore, libtool is disabling shared libraries support. If you *** really care for shared libraries, you may want to install binutils *** 2.20 or above, or modify your PATH so that a non-GNU linker is found. *** You will then need to restart the configuration process. _LT_EOF fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='' ;; m68k) archive_cmds='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes ;; esac ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then allow_undefined_flag=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME archive_cmds='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' else ld_shlibs=no fi ;; cygwin* | mingw* | pw32* | cegcc*) # _LT_TAGVAR(hardcode_libdir_flag_spec, ) is actually meaningless, # as there is no search path for DLLs. hardcode_libdir_flag_spec='-L$libdir' export_dynamic_flag_spec='${wl}--export-all-symbols' allow_undefined_flag=unsupported always_export_symbols=no enable_shared_with_static_runtimes=yes export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGRS][ ]/s/.*[ ]\([^ ]*\)/\1 DATA/;s/^.*[ ]__nm__\([^ ]*\)[ ][^ ]*/\1 DATA/;/^I[ ]/d;/^[AITW][ ]/s/.* //'\'' | sort | uniq > $export_symbols' exclude_expsyms='[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname' if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file (1st line # is EXPORTS), use it as is; otherwise, prepend... archive_expsym_cmds='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared $output_objdir/$soname.def $libobjs $deplibs $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else ld_shlibs=no fi ;; haiku*) archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' link_all_deplibs=yes ;; interix[3-9]*) hardcode_direct=no hardcode_shlibpath_var=no hardcode_libdir_flag_spec='${wl}-rpath,$libdir' export_dynamic_flag_spec='${wl}-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' archive_expsym_cmds='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; gnu* | linux* | tpf* | k*bsd*-gnu | kopensolaris*-gnu) tmp_diet=no if test "$host_os" = linux-dietlibc; then case $cc_basename in diet\ *) tmp_diet=yes;; # linux-dietlibc with static linking (!diet-dyn) esac fi if $LD --help 2>&1 | $EGREP ': supported targets:.* elf' > /dev/null \ && test "$tmp_diet" = no then tmp_addflag=' $pic_flag' tmp_sharedflag='-shared' case $cc_basename,$host_cpu in pgcc*) # Portland Group C compiler whole_archive_flag_spec='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag' ;; pgf77* | pgf90* | pgf95* | pgfortran*) # Portland Group f77 and f90 compilers whole_archive_flag_spec='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive' tmp_addflag=' $pic_flag -Mnomain' ;; ecc*,ia64* | icc*,ia64*) # Intel C compiler on ia64 tmp_addflag=' -i_dynamic' ;; efc*,ia64* | ifort*,ia64*) # Intel Fortran compiler on ia64 tmp_addflag=' -i_dynamic -nofor_main' ;; ifc* | ifort*) # Intel Fortran compiler tmp_addflag=' -nofor_main' ;; lf95*) # Lahey Fortran 8.1 whole_archive_flag_spec= tmp_sharedflag='--shared' ;; xl[cC]* | bgxl[cC]* | mpixl[cC]*) # IBM XL C 8.0 on PPC (deal with xlf below) tmp_sharedflag='-qmkshrobj' tmp_addflag= ;; nvcc*) # Cuda Compiler Driver 2.2 whole_archive_flag_spec='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive' compiler_needs_object=yes ;; esac case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C 5.9 whole_archive_flag_spec='${wl}--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive' compiler_needs_object=yes tmp_sharedflag='-G' ;; *Sun\ F*) # Sun Fortran 8.3 tmp_sharedflag='-G' ;; esac archive_cmds='$CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' if test "x$supports_anon_versioning" = xyes; then archive_expsym_cmds='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC '"$tmp_sharedflag""$tmp_addflag"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib' fi case $cc_basename in xlf* | bgf* | bgxlf* | mpixlf*) # IBM XL Fortran 10.1 on PPC cannot create shared libs itself whole_archive_flag_spec='--whole-archive$convenience --no-whole-archive' hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' archive_cmds='$LD -shared $libobjs $deplibs $linker_flags -soname $soname -o $lib' if test "x$supports_anon_versioning" = xyes; then archive_expsym_cmds='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $LD -shared $libobjs $deplibs $linker_flags -soname $soname -version-script $output_objdir/$libname.ver -o $lib' fi ;; esac else ld_shlibs=no fi ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then archive_cmds='$LD -Bshareable $libobjs $deplibs $linker_flags -o $lib' wlarc= else archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' fi ;; solaris*) if $LD -v 2>&1 | $GREP 'BFD 2\.8' > /dev/null; then ld_shlibs=no cat <<_LT_EOF 1>&2 *** Warning: The releases 2.8.* of the GNU linker cannot reliably *** create shared libraries on Solaris systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.9.1 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF elif $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs=no fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX*) case `$LD -v 2>&1` in *\ [01].* | *\ 2.[0-9].* | *\ 2.1[0-5].*) ld_shlibs=no cat <<_LT_EOF 1>&2 *** Warning: Releases of the GNU linker prior to 2.16.91.0.3 can not *** reliably create shared libraries on SCO systems. Therefore, libtool *** is disabling shared libraries support. We urge you to upgrade GNU *** binutils to release 2.16.91.0.3 or newer. Another option is to modify *** your PATH or compiler configuration so that the native linker is *** used, and then restart. _LT_EOF ;; *) # For security reasons, it is highly recommended that you always # use absolute paths for naming shared libraries, and exclude the # DT_RUNPATH tag from executables and libraries. But doing so # requires that you compile everything twice, which is a pain. if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs=no fi ;; esac ;; sunos4*) archive_cmds='$LD -assert pure-text -Bshareable -o $lib $libobjs $deplibs $linker_flags' wlarc= hardcode_direct=yes hardcode_shlibpath_var=no ;; *) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' else ld_shlibs=no fi ;; esac if test "$ld_shlibs" = no; then runpath_var= hardcode_libdir_flag_spec= export_dynamic_flag_spec= whole_archive_flag_spec= fi else # PORTME fill in a description of your system's linker (not GNU ld) case $host_os in aix3*) allow_undefined_flag=unsupported always_export_symbols=yes archive_expsym_cmds='$LD -o $output_objdir/$soname $libobjs $deplibs $linker_flags -bE:$export_symbols -T512 -H512 -bM:SRE~$AR $AR_FLAGS $lib $output_objdir/$soname' # Note: this linker hardcodes the directories in LIBPATH if there # are no directories specified by -L. hardcode_minus_L=yes if test "$GCC" = yes && test -z "$lt_prog_compiler_static"; then # Neither direct hardcoding nor static linking is supported with a # broken collect2. hardcode_direct=unsupported fi ;; aix[4-9]*) if test "$host_cpu" = ia64; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag="" else # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm # Also, AIX nm treats weak defined symbols like other global # defined symbols, whereas GNU nm marks them as "W". if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then export_symbols_cmds='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B") || (\$ 2 == "W")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else export_symbols_cmds='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[23]|aix4.[23].*|aix[5-9]*) for ld_flag in $LDFLAGS; do if (test $ld_flag = "-brtl" || test $ld_flag = "-Wl,-brtl"); then aix_use_runtimelinking=yes break fi done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. archive_cmds='' hardcode_direct=yes hardcode_direct_absolute=yes hardcode_libdir_separator=':' link_all_deplibs=yes file_list_spec='${wl}-f,' if test "$GCC" = yes; then case $host_os in aix4.[012]|aix4.[012].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`${CC} -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 hardcode_direct=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking hardcode_minus_L=yes hardcode_libdir_flag_spec='-L$libdir' hardcode_libdir_separator= fi ;; esac shared_flag='-shared' if test "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi link_all_deplibs=no else # not using gcc if test "$host_cpu" = ia64; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test "$aix_use_runtimelinking" = yes; then shared_flag='${wl}-G' else shared_flag='${wl}-bM:SRE' fi fi fi export_dynamic_flag_spec='${wl}-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to export. always_export_symbols=yes if test "$aix_use_runtimelinking" = yes; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. allow_undefined_flag='-berok' # Determine the default libpath from the value encoded in an # empty executable. if test "${lt_cv_aix_libpath+set}" = set; then aix_libpath=$lt_cv_aix_libpath else if ${lt_cv_aix_libpath_+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\([^ ]*\) *$/\1/ p } }' lt_cv_aix_libpath_=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$lt_cv_aix_libpath_"; then lt_cv_aix_libpath_=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$lt_cv_aix_libpath_"; then lt_cv_aix_libpath_="/usr/lib:/lib" fi fi aix_libpath=$lt_cv_aix_libpath_ fi hardcode_libdir_flag_spec='${wl}-blibpath:$libdir:'"$aix_libpath" archive_expsym_cmds='$CC -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then func_echo_all "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; then hardcode_libdir_flag_spec='${wl}-R $libdir:/usr/lib:/lib' allow_undefined_flag="-z nodefs" archive_expsym_cmds="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. if test "${lt_cv_aix_libpath+set}" = set; then aix_libpath=$lt_cv_aix_libpath else if ${lt_cv_aix_libpath_+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\([^ ]*\) *$/\1/ p } }' lt_cv_aix_libpath_=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$lt_cv_aix_libpath_"; then lt_cv_aix_libpath_=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$lt_cv_aix_libpath_"; then lt_cv_aix_libpath_="/usr/lib:/lib" fi fi aix_libpath=$lt_cv_aix_libpath_ fi hardcode_libdir_flag_spec='${wl}-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. no_undefined_flag=' ${wl}-bernotok' allow_undefined_flag=' ${wl}-berok' if test "$with_gnu_ld" = yes; then # We only use this code for GNU lds that support --whole-archive. whole_archive_flag_spec='${wl}--whole-archive$convenience ${wl}--no-whole-archive' else # Exported symbols can be pulled into shared objects from archives whole_archive_flag_spec='$convenience' fi archive_cmds_need_lc=yes # This is similar to how AIX traditionally builds its shared libraries. archive_expsym_cmds="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds='' ;; m68k) archive_cmds='$RM $output_objdir/a2ixlibrary.data~$ECHO "#define NAME $libname" > $output_objdir/a2ixlibrary.data~$ECHO "#define LIBRARY_ID 1" >> $output_objdir/a2ixlibrary.data~$ECHO "#define VERSION $major" >> $output_objdir/a2ixlibrary.data~$ECHO "#define REVISION $revision" >> $output_objdir/a2ixlibrary.data~$AR $AR_FLAGS $lib $libobjs~$RANLIB $lib~(cd $output_objdir && a2ixlibrary -32)' hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes ;; esac ;; bsdi[45]*) export_dynamic_flag_spec=-rdynamic ;; cygwin* | mingw* | pw32* | cegcc*) # When not using gcc, we currently assume that we are using # Microsoft Visual C++. # hardcode_libdir_flag_spec is actually meaningless, as there is # no search path for DLLs. case $cc_basename in cl*) # Native MSVC hardcode_libdir_flag_spec=' ' allow_undefined_flag=unsupported always_export_symbols=yes file_list_spec='@' # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=".dll" # FIXME: Setting linknames here is a bad hack. archive_cmds='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-dll~linknames=' archive_expsym_cmds='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then sed -n -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' -e '1\\\!p' < $export_symbols > $output_objdir/$soname.exp; else sed -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' < $export_symbols > $output_objdir/$soname.exp; fi~ $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs "@$tool_output_objdir$soname.exp" -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~ linknames=' # The linker will not automatically build a static lib if we build a DLL. # _LT_TAGVAR(old_archive_from_new_cmds, )='true' enable_shared_with_static_runtimes=yes exclude_expsyms='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*' export_symbols_cmds='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGRS][ ]/s/.*[ ]\([^ ]*\)/\1,DATA/'\'' | $SED -e '\''/^[AITW][ ]/s/.*[ ]//'\'' | sort | uniq > $export_symbols' # Don't use ranlib old_postinstall_cmds='chmod 644 $oldlib' postlink_cmds='lt_outputfile="@OUTPUT@"~ lt_tool_outputfile="@TOOL_OUTPUT@"~ case $lt_outputfile in *.exe|*.EXE) ;; *) lt_outputfile="$lt_outputfile.exe" lt_tool_outputfile="$lt_tool_outputfile.exe" ;; esac~ if test "$MANIFEST_TOOL" != ":" && test -f "$lt_outputfile.manifest"; then $MANIFEST_TOOL -manifest "$lt_tool_outputfile.manifest" -outputresource:"$lt_tool_outputfile" || exit 1; $RM "$lt_outputfile.manifest"; fi' ;; *) # Assume MSVC wrapper hardcode_libdir_flag_spec=' ' allow_undefined_flag=unsupported # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=".dll" # FIXME: Setting linknames here is a bad hack. archive_cmds='$CC -o $lib $libobjs $compiler_flags `func_echo_all "$deplibs" | $SED '\''s/ -lc$//'\''` -link -dll~linknames=' # The linker will automatically build a .lib file if we build a DLL. old_archive_from_new_cmds='true' # FIXME: Should let the user specify the lib program. old_archive_cmds='lib -OUT:$oldlib$oldobjs$old_deplibs' enable_shared_with_static_runtimes=yes ;; esac ;; darwin* | rhapsody*) archive_cmds_need_lc=no hardcode_direct=no hardcode_automatic=yes hardcode_shlibpath_var=unsupported if test "$lt_cv_ld_force_load" = "yes"; then whole_archive_flag_spec='`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience ${wl}-force_load,$conv\"; done; func_echo_all \"$new_convenience\"`' else whole_archive_flag_spec='' fi link_all_deplibs=yes allow_undefined_flag="$_lt_dar_allow_undefined" case $cc_basename in ifort*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test "$_lt_dar_can_shared" = "yes"; then output_verbose_link_cmd=func_echo_all archive_cmds="\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod${_lt_dsymutil}" module_cmds="\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dsymutil}" archive_expsym_cmds="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring ${_lt_dar_single_mod}${_lt_dar_export_syms}${_lt_dsymutil}" module_expsym_cmds="sed -e 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dar_export_syms}${_lt_dsymutil}" else ld_shlibs=no fi ;; dgux*) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec='-L$libdir' hardcode_shlibpath_var=no ;; # FreeBSD 2.2.[012] allows us to include c++rt0.o to get C++ constructor # support. Future versions do this automatically, but an explicit c++rt0.o # does not break anything, and helps significantly (at the cost of a little # extra space). freebsd2.2*) archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags /usr/lib/c++rt0.o' hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes hardcode_shlibpath_var=no ;; # Unfortunately, older versions of FreeBSD 2 do not have this feature. freebsd2.*) archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes hardcode_minus_L=yes hardcode_shlibpath_var=no ;; # FreeBSD 3 and greater uses gcc -shared to do shared libraries. freebsd* | dragonfly*) archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes hardcode_shlibpath_var=no ;; hpux9*) if test "$GCC" = yes; then archive_cmds='$RM $output_objdir/$soname~$CC -shared $pic_flag ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $libobjs $deplibs $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' else archive_cmds='$RM $output_objdir/$soname~$LD -b +b $install_libdir -o $output_objdir/$soname $libobjs $deplibs $linker_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' fi hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir' hardcode_libdir_separator=: hardcode_direct=yes # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L=yes export_dynamic_flag_spec='${wl}-E' ;; hpux10*) if test "$GCC" = yes && test "$with_gnu_ld" = no; then archive_cmds='$CC -shared $pic_flag ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags' fi if test "$with_gnu_ld" = no; then hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir' hardcode_libdir_separator=: hardcode_direct=yes hardcode_direct_absolute=yes export_dynamic_flag_spec='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L=yes fi ;; hpux11*) if test "$GCC" = yes && test "$with_gnu_ld" = no; then case $host_cpu in hppa*64*) archive_cmds='$CC -shared ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) archive_cmds='$CC -shared $pic_flag ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds='$CC -shared $pic_flag ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' ;; esac else case $host_cpu in hppa*64*) archive_cmds='$CC -b ${wl}+h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' ;; ia64*) archive_cmds='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $libobjs $deplibs $compiler_flags' ;; *) # Older versions of the 11.00 compiler do not understand -b yet # (HP92453-01 A.11.01.20 doesn't, HP92453-01 B.11.X.35175-35176.GP does) { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $CC understands -b" >&5 $as_echo_n "checking if $CC understands -b... " >&6; } if ${lt_cv_prog_compiler__b+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler__b=no save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS -b" echo "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&5 $ECHO "$_lt_linker_boilerplate" | $SED '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler__b=yes fi else lt_cv_prog_compiler__b=yes fi fi $RM -r conftest* LDFLAGS="$save_LDFLAGS" fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler__b" >&5 $as_echo "$lt_cv_prog_compiler__b" >&6; } if test x"$lt_cv_prog_compiler__b" = xyes; then archive_cmds='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$LD -b +h $soname +b $install_libdir -o $lib $libobjs $deplibs $linker_flags' fi ;; esac fi if test "$with_gnu_ld" = no; then hardcode_libdir_flag_spec='${wl}+b ${wl}$libdir' hardcode_libdir_separator=: case $host_cpu in hppa*64*|ia64*) hardcode_direct=no hardcode_shlibpath_var=no ;; *) hardcode_direct=yes hardcode_direct_absolute=yes export_dynamic_flag_spec='${wl}-E' # hardcode_minus_L: Not really in the search PATH, # but as the default location of the library. hardcode_minus_L=yes ;; esac fi ;; irix5* | irix6* | nonstopux*) if test "$GCC" = yes; then archive_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' # Try to use the -exported_symbol ld option, if it does not # work, assume that -exports_file does not work either and # implicitly export all symbols. # This should be the same for all languages, so no per-tag cache variable. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the $host_os linker accepts -exported_symbol" >&5 $as_echo_n "checking whether the $host_os linker accepts -exported_symbol... " >&6; } if ${lt_cv_irix_exported_symbol+:} false; then : $as_echo_n "(cached) " >&6 else save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS -shared ${wl}-exported_symbol ${wl}foo ${wl}-update_registry ${wl}/dev/null" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int foo (void) { return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : lt_cv_irix_exported_symbol=yes else lt_cv_irix_exported_symbol=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS="$save_LDFLAGS" fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_irix_exported_symbol" >&5 $as_echo "$lt_cv_irix_exported_symbol" >&6; } if test "$lt_cv_irix_exported_symbol" = yes; then archive_expsym_cmds='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations ${wl}-exports_file ${wl}$export_symbols -o $lib' fi else archive_cmds='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib' archive_expsym_cmds='$CC -shared $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -exports_file $export_symbols -o $lib' fi archive_cmds_need_lc='no' hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator=: inherit_rpath=yes link_all_deplibs=yes ;; netbsd* | netbsdelf*-gnu) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' # a.out else archive_cmds='$LD -shared -o $lib $libobjs $deplibs $linker_flags' # ELF fi hardcode_libdir_flag_spec='-R$libdir' hardcode_direct=yes hardcode_shlibpath_var=no ;; newsos6) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator=: hardcode_shlibpath_var=no ;; *nto* | *qnx*) ;; openbsd*) if test -f /usr/libexec/ld.so; then hardcode_direct=yes hardcode_shlibpath_var=no hardcode_direct_absolute=yes if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags ${wl}-retain-symbols-file,$export_symbols' hardcode_libdir_flag_spec='${wl}-rpath,$libdir' export_dynamic_flag_spec='${wl}-E' else case $host_os in openbsd[01].* | openbsd2.[0-7] | openbsd2.[0-7].*) archive_cmds='$LD -Bshareable -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec='-R$libdir' ;; *) archive_cmds='$CC -shared $pic_flag -o $lib $libobjs $deplibs $compiler_flags' hardcode_libdir_flag_spec='${wl}-rpath,$libdir' ;; esac fi else ld_shlibs=no fi ;; os2*) hardcode_libdir_flag_spec='-L$libdir' hardcode_minus_L=yes allow_undefined_flag=unsupported archive_cmds='$ECHO "LIBRARY $libname INITINSTANCE" > $output_objdir/$libname.def~$ECHO "DESCRIPTION \"$libname\"" >> $output_objdir/$libname.def~echo DATA >> $output_objdir/$libname.def~echo " SINGLE NONSHARED" >> $output_objdir/$libname.def~echo EXPORTS >> $output_objdir/$libname.def~emxexp $libobjs >> $output_objdir/$libname.def~$CC -Zdll -Zcrtdll -o $lib $libobjs $deplibs $compiler_flags $output_objdir/$libname.def' old_archive_from_new_cmds='emximp -o $output_objdir/$libname.a $output_objdir/$libname.def' ;; osf3*) if test "$GCC" = yes; then allow_undefined_flag=' ${wl}-expect_unresolved ${wl}\*' archive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else allow_undefined_flag=' -expect_unresolved \*' archive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib' fi archive_cmds_need_lc='no' hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator=: ;; osf4* | osf5*) # as osf3* with the addition of -msym flag if test "$GCC" = yes; then allow_undefined_flag=' ${wl}-expect_unresolved ${wl}\*' archive_cmds='$CC -shared${allow_undefined_flag} $pic_flag $libobjs $deplibs $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' hardcode_libdir_flag_spec='${wl}-rpath ${wl}$libdir' else allow_undefined_flag=' -expect_unresolved \*' archive_cmds='$CC -shared${allow_undefined_flag} $libobjs $deplibs $compiler_flags -msym -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib' archive_expsym_cmds='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done; printf "%s\\n" "-hidden">> $lib.exp~ $CC -shared${allow_undefined_flag} ${wl}-input ${wl}$lib.exp $compiler_flags $libobjs $deplibs -soname $soname `test -n "$verstring" && $ECHO "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib~$RM $lib.exp' # Both c and cxx compiler support -rpath directly hardcode_libdir_flag_spec='-rpath $libdir' fi archive_cmds_need_lc='no' hardcode_libdir_separator=: ;; solaris*) no_undefined_flag=' -z defs' if test "$GCC" = yes; then wlarc='${wl}' archive_cmds='$CC -shared $pic_flag ${wl}-z ${wl}text ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared $pic_flag ${wl}-z ${wl}text ${wl}-M ${wl}$lib.exp ${wl}-h ${wl}$soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' else case `$CC -V 2>&1` in *"Compilers 5.0"*) wlarc='' archive_cmds='$LD -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $linker_flags' archive_expsym_cmds='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $LD -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $linker_flags~$RM $lib.exp' ;; *) wlarc='${wl}' archive_cmds='$CC -G${allow_undefined_flag} -h $soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G${allow_undefined_flag} -M $lib.exp -h $soname -o $lib $libobjs $deplibs $compiler_flags~$RM $lib.exp' ;; esac fi hardcode_libdir_flag_spec='-R$libdir' hardcode_shlibpath_var=no case $host_os in solaris2.[0-5] | solaris2.[0-5].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands `-z linker_flag'. GCC discards it without `$wl', # but is careful enough not to reorder. # Supported since Solaris 2.6 (maybe 2.5.1?) if test "$GCC" = yes; then whole_archive_flag_spec='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract' else whole_archive_flag_spec='-z allextract$convenience -z defaultextract' fi ;; esac link_all_deplibs=yes ;; sunos4*) if test "x$host_vendor" = xsequent; then # Use $CC to link under sequent, because it throws in some extra .o # files that make .init and .fini sections work. archive_cmds='$CC -G ${wl}-h $soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$LD -assert pure-text -Bstatic -o $lib $libobjs $deplibs $linker_flags' fi hardcode_libdir_flag_spec='-L$libdir' hardcode_direct=yes hardcode_minus_L=yes hardcode_shlibpath_var=no ;; sysv4) case $host_vendor in sni) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=yes # is this really true??? ;; siemens) ## LD is ld it makes a PLAMLIB ## CC just makes a GrossModule. archive_cmds='$LD -G -o $lib $libobjs $deplibs $linker_flags' reload_cmds='$CC -r -o $output$reload_objs' hardcode_direct=no ;; motorola) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_direct=no #Motorola manual says yes, but my tests say they lie ;; esac runpath_var='LD_RUN_PATH' hardcode_shlibpath_var=no ;; sysv4.3*) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var=no export_dynamic_flag_spec='-Bexport' ;; sysv4*MP*) if test -d /usr/nec; then archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_shlibpath_var=no runpath_var=LD_RUN_PATH hardcode_runpath_var=yes ld_shlibs=yes fi ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[01].[10]* | unixware7* | sco3.2v5.0.[024]*) no_undefined_flag='${wl}-z,text' archive_cmds_need_lc=no hardcode_shlibpath_var=no runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then archive_cmds='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We can NOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. no_undefined_flag='${wl}-z,text' allow_undefined_flag='${wl}-z,nodefs' archive_cmds_need_lc=no hardcode_shlibpath_var=no hardcode_libdir_flag_spec='${wl}-R,$libdir' hardcode_libdir_separator=':' link_all_deplibs=yes export_dynamic_flag_spec='${wl}-Bexport' runpath_var='LD_RUN_PATH' if test "$GCC" = yes; then archive_cmds='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' else archive_cmds='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' fi ;; uts4*) archive_cmds='$LD -G -h $soname -o $lib $libobjs $deplibs $linker_flags' hardcode_libdir_flag_spec='-L$libdir' hardcode_shlibpath_var=no ;; *) ld_shlibs=no ;; esac if test x$host_vendor = xsni; then case $host in sysv4 | sysv4.2uw2* | sysv4.3* | sysv5*) export_dynamic_flag_spec='${wl}-Blargedynsym' ;; esac fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ld_shlibs" >&5 $as_echo "$ld_shlibs" >&6; } test "$ld_shlibs" = no && can_build_shared=no with_gnu_ld=$with_gnu_ld # # Do we need to explicitly link libc? # case "x$archive_cmds_need_lc" in x|xyes) # Assume -lc should be added archive_cmds_need_lc=yes if test "$enable_shared" = yes && test "$GCC" = yes; then case $archive_cmds in *'~'*) # FIXME: we may have to deal with multi-command sequences. ;; '$CC '*) # Test whether the compiler implicitly links with -lc since on some # systems, -lgcc has to come before -lc. If gcc already passes -lc # to ld, don't add -lc before -lgcc. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether -lc should be explicitly linked in" >&5 $as_echo_n "checking whether -lc should be explicitly linked in... " >&6; } if ${lt_cv_archive_cmds_need_lc+:} false; then : $as_echo_n "(cached) " >&6 else $RM conftest* echo "$lt_simple_compile_test_code" > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$lt_prog_compiler_wl pic_flag=$lt_prog_compiler_pic compiler_flags=-v linker_flags=-v verstring= output_objdir=. libname=conftest lt_save_allow_undefined_flag=$allow_undefined_flag allow_undefined_flag= if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$archive_cmds 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1\""; } >&5 (eval $archive_cmds 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } then lt_cv_archive_cmds_need_lc=no else lt_cv_archive_cmds_need_lc=yes fi allow_undefined_flag=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_archive_cmds_need_lc" >&5 $as_echo "$lt_cv_archive_cmds_need_lc" >&6; } archive_cmds_need_lc=$lt_cv_archive_cmds_need_lc ;; esac fi ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking dynamic linker characteristics" >&5 $as_echo_n "checking dynamic linker characteristics... " >&6; } if test "$GCC" = yes; then case $host_os in darwin*) lt_awk_arg="/^libraries:/,/LR/" ;; *) lt_awk_arg="/^libraries:/" ;; esac case $host_os in mingw* | cegcc*) lt_sed_strip_eq="s,=\([A-Za-z]:\),\1,g" ;; *) lt_sed_strip_eq="s,=/,/,g" ;; esac lt_search_path_spec=`$CC -print-search-dirs | awk $lt_awk_arg | $SED -e "s/^libraries://" -e $lt_sed_strip_eq` case $lt_search_path_spec in *\;*) # if the path contains ";" then we assume it to be the separator # otherwise default to the standard path separator (i.e. ":") - it is # assumed that no part of a normal pathname contains ";" but that should # okay in the real world where ";" in dirpaths is itself problematic. lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED 's/;/ /g'` ;; *) lt_search_path_spec=`$ECHO "$lt_search_path_spec" | $SED "s/$PATH_SEPARATOR/ /g"` ;; esac # Ok, now we have the path, separated by spaces, we can step through it # and add multilib dir if necessary. lt_tmp_lt_search_path_spec= lt_multi_os_dir=`$CC $CPPFLAGS $CFLAGS $LDFLAGS -print-multi-os-directory 2>/dev/null` for lt_sys_path in $lt_search_path_spec; do if test -d "$lt_sys_path/$lt_multi_os_dir"; then lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path/$lt_multi_os_dir" else test -d "$lt_sys_path" && \ lt_tmp_lt_search_path_spec="$lt_tmp_lt_search_path_spec $lt_sys_path" fi done lt_search_path_spec=`$ECHO "$lt_tmp_lt_search_path_spec" | awk ' BEGIN {RS=" "; FS="/|\n";} { lt_foo=""; lt_count=0; for (lt_i = NF; lt_i > 0; lt_i--) { if ($lt_i != "" && $lt_i != ".") { if ($lt_i == "..") { lt_count++; } else { if (lt_count == 0) { lt_foo="/" $lt_i lt_foo; } else { lt_count--; } } } } if (lt_foo != "") { lt_freq[lt_foo]++; } if (lt_freq[lt_foo] == 1) { print lt_foo; } }'` # AWK program above erroneously prepends '/' to C:/dos/paths # for these hosts. case $host_os in mingw* | cegcc*) lt_search_path_spec=`$ECHO "$lt_search_path_spec" |\ $SED 's,/\([A-Za-z]:\),\1,g'` ;; esac sys_lib_search_path_spec=`$ECHO "$lt_search_path_spec" | $lt_NL2SP` else sys_lib_search_path_spec="/lib /usr/lib /usr/local/lib" fi library_names_spec= libname_spec='lib$name' soname_spec= shrext_cmds=".so" postinstall_cmds= postuninstall_cmds= finish_cmds= finish_eval= shlibpath_var= shlibpath_overrides_runpath=unknown version_type=none dynamic_linker="$host_os ld.so" sys_lib_dlsearch_path_spec="/lib /usr/lib" need_lib_prefix=unknown hardcode_into_libs=no # when you set need_version to no, make sure it does not cause -set_version # flags to be left without arguments need_version=unknown case $host_os in aix3*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a' shlibpath_var=LIBPATH # AIX 3 has no versioning support, so we append a major version to the name. soname_spec='${libname}${release}${shared_ext}$major' ;; aix[4-9]*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no hardcode_into_libs=yes if test "$host_cpu" = ia64; then # AIX 5 supports IA64 library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH else # With GCC up to 2.95.x, collect2 would create an import file # for dependence libraries. The import file would start with # the line `#! .'. This would cause the generated library to # depend on `.', always an invalid library. This was fixed in # development snapshots of GCC prior to 3.0. case $host_os in aix4 | aix4.[01] | aix4.[01].*) if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)' echo ' yes ' echo '#endif'; } | ${CC} -E - | $GREP yes > /dev/null; then : else can_build_shared=no fi ;; esac # AIX (on Power*) has no versioning support, so currently we can not hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test "$aix_use_runtimelinking" = yes; then # If using run time linking (on AIX 4.2 or later) use lib.so # instead of lib.a to let people know that these are not # typical AIX shared libraries. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' else # We preserve .a as extension for shared libraries through AIX4.2 # and later when we are not doing run time linking. library_names_spec='${libname}${release}.a $libname.a' soname_spec='${libname}${release}${shared_ext}$major' fi shlibpath_var=LIBPATH fi ;; amigaos*) case $host_cpu in powerpc) # Since July 2007 AmigaOS4 officially supports .so libraries. # When compiling the executable, add -use-dynld -Lsobjs: to the compileline. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' ;; m68k) library_names_spec='$libname.ixlibrary $libname.a' # Create ${libname}_ixlibrary.a entries in /sys/libs. finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`func_echo_all "$lib" | $SED '\''s%^.*/\([^/]*\)\.ixlibrary$%\1%'\''`; test $RM /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done' ;; esac ;; beos*) library_names_spec='${libname}${shared_ext}' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi[45]*) version_type=linux # correct to gnu/linux during the next big refactor need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib" sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib" # the default ld.so.conf also contains /usr/contrib/lib and # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow # libtool to hard-code these into programs ;; cygwin* | mingw* | pw32* | cegcc*) version_type=windows shrext_cmds=".dll" need_version=no need_lib_prefix=no case $GCC,$cc_basename in yes,*) # gcc library_names_spec='$libname.dll.a' # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \${file}`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname~ chmod a+x \$dldir/$dlname~ if test -n '\''$stripme'\'' && test -n '\''$striplib'\''; then eval '\''$striplib \$dldir/$dlname'\'' || exit \$?; fi' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes case $host_os in cygwin*) # Cygwin DLLs use 'cyg' prefix rather than 'lib' soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/lib/w32api" ;; mingw* | cegcc*) # MinGW DLLs use traditional 'lib' prefix soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' ;; pw32*) # pw32 DLLs use 'pw' prefix rather than 'lib' library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' ;; esac dynamic_linker='Win32 ld.exe' ;; *,cl*) # Native MSVC libname_spec='$name' soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' library_names_spec='${libname}.dll.lib' case $build_os in mingw*) sys_lib_search_path_spec= lt_save_ifs=$IFS IFS=';' for lt_path in $LIB do IFS=$lt_save_ifs # Let DOS variable expansion print the short 8.3 style file name. lt_path=`cd "$lt_path" 2>/dev/null && cmd //C "for %i in (".") do @echo %~si"` sys_lib_search_path_spec="$sys_lib_search_path_spec $lt_path" done IFS=$lt_save_ifs # Convert to MSYS style. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | sed -e 's|\\\\|/|g' -e 's| \\([a-zA-Z]\\):| /\\1|g' -e 's|^ ||'` ;; cygwin*) # Convert to unix form, then to dos form, then back to unix form # but this time dos style (no spaces!) so that the unix form looks # like /cygdrive/c/PROGRA~1:/cygdr... sys_lib_search_path_spec=`cygpath --path --unix "$LIB"` sys_lib_search_path_spec=`cygpath --path --dos "$sys_lib_search_path_spec" 2>/dev/null` sys_lib_search_path_spec=`cygpath --path --unix "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` ;; *) sys_lib_search_path_spec="$LIB" if $ECHO "$sys_lib_search_path_spec" | $GREP ';[c-zC-Z]:/' >/dev/null; then # It is most probably a Windows format PATH. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi # FIXME: find the short name or the path components, as spaces are # common. (e.g. "Program Files" -> "PROGRA~1") ;; esac # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \${file}`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes dynamic_linker='Win32 link.exe' ;; *) # Assume MSVC wrapper library_names_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext} $libname.lib' dynamic_linker='Win32 ld.exe' ;; esac # FIXME: first we should search . and the directory the executable is in shlibpath_var=PATH ;; darwin* | rhapsody*) dynamic_linker="$host_os dyld" version_type=darwin need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${major}$shared_ext ${libname}$shared_ext' soname_spec='${libname}${release}${major}$shared_ext' shlibpath_overrides_runpath=yes shlibpath_var=DYLD_LIBRARY_PATH shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`' sys_lib_search_path_spec="$sys_lib_search_path_spec /usr/local/lib" sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; freebsd* | dragonfly*) # DragonFly does not have aout. When/if they implement a new # versioning mechanism, adjust this. if test -x /usr/bin/objformat; then objformat=`/usr/bin/objformat` else case $host_os in freebsd[23].*) objformat=aout ;; *) objformat=elf ;; esac fi version_type=freebsd-$objformat case $version_type in freebsd-elf*) library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' need_version=no need_lib_prefix=no ;; freebsd-*) library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix' need_version=yes ;; esac shlibpath_var=LD_LIBRARY_PATH case $host_os in freebsd2.*) shlibpath_overrides_runpath=yes ;; freebsd3.[01]* | freebsdelf3.[01]*) shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; freebsd3.[2-9]* | freebsdelf3.[2-9]* | \ freebsd4.[0-5] | freebsdelf4.[0-5] | freebsd4.1.1 | freebsdelf4.1.1) shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; *) # from 4.6 on, and DragonFly shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; esac ;; haiku*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no dynamic_linker="$host_os runtime_loader" library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LIBRARY_PATH shlibpath_overrides_runpath=yes sys_lib_dlsearch_path_spec='/boot/home/config/lib /boot/common/lib /boot/system/lib' hardcode_into_libs=yes ;; hpux9* | hpux10* | hpux11*) # Give a soname corresponding to the major version so that dld.sl refuses to # link against other versions. version_type=sunos need_lib_prefix=no need_version=no case $host_cpu in ia64*) shrext_cmds='.so' hardcode_into_libs=yes dynamic_linker="$host_os dld.so" shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' if test "X$HPUX_IA64_MODE" = X32; then sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib" else sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64" fi sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; hppa*64*) shrext_cmds='.sl' hardcode_into_libs=yes dynamic_linker="$host_os dld.sl" shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; *) shrext_cmds='.sl' dynamic_linker="$host_os dld.sl" shlibpath_var=SHLIB_PATH shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' ;; esac # HP-UX runs *really* slowly unless shared libraries are mode 555, ... postinstall_cmds='chmod 555 $lib' # or fails outright, so override atomically: install_override_mode=555 ;; interix[3-9]*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test "$lt_cv_prog_gnu_ld" = yes; then version_type=linux # correct to gnu/linux during the next big refactor else version_type=irix fi ;; esac need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}' case $host_os in irix5* | nonstopux*) libsuff= shlibsuff= ;; *) case $LD in # libtool.m4 will add one of these switches to LD *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ") libsuff= shlibsuff= libmagic=32-bit;; *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ") libsuff=32 shlibsuff=N32 libmagic=N32;; *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ") libsuff=64 shlibsuff=64 libmagic=64-bit;; *) libsuff= shlibsuff= libmagic=never-match;; esac ;; esac shlibpath_var=LD_LIBRARY${shlibsuff}_PATH shlibpath_overrides_runpath=no sys_lib_search_path_spec="/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}" sys_lib_dlsearch_path_spec="/usr/lib${libsuff} /lib${libsuff}" hardcode_into_libs=yes ;; # No shared lib support for Linux oldld, aout, or coff. linux*oldld* | linux*aout* | linux*coff*) dynamic_linker=no ;; # This must be glibc/ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # Some binutils ld are patched to set DT_RUNPATH if ${lt_cv_shlibpath_overrides_runpath+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_shlibpath_overrides_runpath=no save_LDFLAGS=$LDFLAGS save_libdir=$libdir eval "libdir=/foo; wl=\"$lt_prog_compiler_wl\"; \ LDFLAGS=\"\$LDFLAGS $hardcode_libdir_flag_spec\"" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : if ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep "RUNPATH.*$libdir" >/dev/null; then : lt_cv_shlibpath_overrides_runpath=yes fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS=$save_LDFLAGS libdir=$save_libdir fi shlibpath_overrides_runpath=$lt_cv_shlibpath_overrides_runpath # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s 2>/dev/null", \$2)); skip = 1; } { if (!skip) print \$0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[ ]*hwcap[ ]/d;s/[:, ]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;s/"//g;/^$/d' | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra" fi # We used to test for /lib/ld.so.1 and disable shared libraries on # powerpc, because MkLinux only supported shared libraries with the # GNU dynamic linker. Since this was broken with cross compilers, # most powerpc-linux boxes support dynamic linking these days and # people can always --disable-shared, the test was removed, and we # assume the GNU/Linux dynamic linker is in use. dynamic_linker='GNU/Linux ld.so' ;; netbsdelf*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='NetBSD ld.elf_so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; *nto* | *qnx*) version_type=qnx need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='ldqnx.so' ;; openbsd*) version_type=sunos sys_lib_dlsearch_path_spec="/usr/lib" need_lib_prefix=no # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs. case $host_os in openbsd3.3 | openbsd3.3.*) need_version=yes ;; *) need_version=no ;; esac library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' shlibpath_var=LD_LIBRARY_PATH if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then case $host_os in openbsd2.[89] | openbsd2.[89].*) shlibpath_overrides_runpath=no ;; *) shlibpath_overrides_runpath=yes ;; esac else shlibpath_overrides_runpath=yes fi ;; os2*) libname_spec='$name' shrext_cmds=".dll" need_lib_prefix=no library_names_spec='$libname${shared_ext} $libname.a' dynamic_linker='OS/2 ld.exe' shlibpath_var=LIBPATH ;; osf3* | osf4* | osf5*) version_type=osf need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib" sys_lib_dlsearch_path_spec="$sys_lib_search_path_spec" ;; rdos*) dynamic_linker=no ;; solaris*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes # ldd complains unless libraries are executable postinstall_cmds='chmod +x $lib' ;; sunos4*) version_type=sunos library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes if test "$with_gnu_ld" = yes; then need_lib_prefix=no fi need_version=yes ;; sysv4 | sysv4.3*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH case $host_vendor in sni) shlibpath_overrides_runpath=no need_lib_prefix=no runpath_var=LD_RUN_PATH ;; siemens) need_lib_prefix=no ;; motorola) need_lib_prefix=no need_version=no shlibpath_overrides_runpath=no sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib' ;; esac ;; sysv4*MP*) if test -d /usr/nec ;then version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}' soname_spec='$libname${shared_ext}.$major' shlibpath_var=LD_LIBRARY_PATH fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) version_type=freebsd-elf need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes if test "$with_gnu_ld" = yes; then sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib' else sys_lib_search_path_spec='/usr/ccs/lib /usr/lib' case $host_os in sco3.2v5*) sys_lib_search_path_spec="$sys_lib_search_path_spec /lib" ;; esac fi sys_lib_dlsearch_path_spec='/usr/lib' ;; tpf*) # TPF is a cross-target only. Preferred cross-host = GNU/Linux. version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; uts4*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; *) dynamic_linker=no ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $dynamic_linker" >&5 $as_echo "$dynamic_linker" >&6; } test "$dynamic_linker" = no && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test "$GCC" = yes; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test "${lt_cv_sys_lib_search_path_spec+set}" = set; then sys_lib_search_path_spec="$lt_cv_sys_lib_search_path_spec" fi if test "${lt_cv_sys_lib_dlsearch_path_spec+set}" = set; then sys_lib_dlsearch_path_spec="$lt_cv_sys_lib_dlsearch_path_spec" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to hardcode library paths into programs" >&5 $as_echo_n "checking how to hardcode library paths into programs... " >&6; } hardcode_action= if test -n "$hardcode_libdir_flag_spec" || test -n "$runpath_var" || test "X$hardcode_automatic" = "Xyes" ; then # We can hardcode non-existent directories. if test "$hardcode_direct" != no && # If the only mechanism to avoid hardcoding is shlibpath_var, we # have to relink, otherwise we might link with an installed library # when we should be linking with a yet-to-be-installed one ## test "$_LT_TAGVAR(hardcode_shlibpath_var, )" != no && test "$hardcode_minus_L" != no; then # Linking always hardcodes the temporary library directory. hardcode_action=relink else # We can link without hardcoding, and we can hardcode nonexisting dirs. hardcode_action=immediate fi else # We cannot hardcode anything, or else we can only hardcode existing # directories. hardcode_action=unsupported fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hardcode_action" >&5 $as_echo "$hardcode_action" >&6; } if test "$hardcode_action" = relink || test "$inherit_rpath" = yes; then # Fast installation is not supported enable_fast_install=no elif test "$shlibpath_overrides_runpath" = yes || test "$enable_shared" = no; then # Fast installation is not necessary enable_fast_install=needless fi if test "x$enable_dlopen" != xyes; then enable_dlopen=unknown enable_dlopen_self=unknown enable_dlopen_self_static=unknown else lt_cv_dlopen=no lt_cv_dlopen_libs= case $host_os in beos*) lt_cv_dlopen="load_add_on" lt_cv_dlopen_libs= lt_cv_dlopen_self=yes ;; mingw* | pw32* | cegcc*) lt_cv_dlopen="LoadLibrary" lt_cv_dlopen_libs= ;; cygwin*) lt_cv_dlopen="dlopen" lt_cv_dlopen_libs= ;; darwin*) # if libdl is installed we need to link against it { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -ldl" >&5 $as_echo_n "checking for dlopen in -ldl... " >&6; } if ${ac_cv_lib_dl_dlopen+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldl $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dlopen (); int main () { return dlopen (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dl_dlopen=yes else ac_cv_lib_dl_dlopen=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dl_dlopen" >&5 $as_echo "$ac_cv_lib_dl_dlopen" >&6; } if test "x$ac_cv_lib_dl_dlopen" = xyes; then : lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl" else lt_cv_dlopen="dyld" lt_cv_dlopen_libs= lt_cv_dlopen_self=yes fi ;; *) ac_fn_c_check_func "$LINENO" "shl_load" "ac_cv_func_shl_load" if test "x$ac_cv_func_shl_load" = xyes; then : lt_cv_dlopen="shl_load" else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for shl_load in -ldld" >&5 $as_echo_n "checking for shl_load in -ldld... " >&6; } if ${ac_cv_lib_dld_shl_load+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldld $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char shl_load (); int main () { return shl_load (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dld_shl_load=yes else ac_cv_lib_dld_shl_load=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dld_shl_load" >&5 $as_echo "$ac_cv_lib_dld_shl_load" >&6; } if test "x$ac_cv_lib_dld_shl_load" = xyes; then : lt_cv_dlopen="shl_load" lt_cv_dlopen_libs="-ldld" else ac_fn_c_check_func "$LINENO" "dlopen" "ac_cv_func_dlopen" if test "x$ac_cv_func_dlopen" = xyes; then : lt_cv_dlopen="dlopen" else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -ldl" >&5 $as_echo_n "checking for dlopen in -ldl... " >&6; } if ${ac_cv_lib_dl_dlopen+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldl $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dlopen (); int main () { return dlopen (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dl_dlopen=yes else ac_cv_lib_dl_dlopen=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dl_dlopen" >&5 $as_echo "$ac_cv_lib_dl_dlopen" >&6; } if test "x$ac_cv_lib_dl_dlopen" = xyes; then : lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-ldl" else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -lsvld" >&5 $as_echo_n "checking for dlopen in -lsvld... " >&6; } if ${ac_cv_lib_svld_dlopen+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lsvld $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dlopen (); int main () { return dlopen (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_svld_dlopen=yes else ac_cv_lib_svld_dlopen=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_svld_dlopen" >&5 $as_echo "$ac_cv_lib_svld_dlopen" >&6; } if test "x$ac_cv_lib_svld_dlopen" = xyes; then : lt_cv_dlopen="dlopen" lt_cv_dlopen_libs="-lsvld" else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dld_link in -ldld" >&5 $as_echo_n "checking for dld_link in -ldld... " >&6; } if ${ac_cv_lib_dld_dld_link+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldld $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dld_link (); int main () { return dld_link (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dld_dld_link=yes else ac_cv_lib_dld_dld_link=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dld_dld_link" >&5 $as_echo "$ac_cv_lib_dld_dld_link" >&6; } if test "x$ac_cv_lib_dld_dld_link" = xyes; then : lt_cv_dlopen="dld_link" lt_cv_dlopen_libs="-ldld" fi fi fi fi fi fi ;; esac if test "x$lt_cv_dlopen" != xno; then enable_dlopen=yes else enable_dlopen=no fi case $lt_cv_dlopen in dlopen) save_CPPFLAGS="$CPPFLAGS" test "x$ac_cv_header_dlfcn_h" = xyes && CPPFLAGS="$CPPFLAGS -DHAVE_DLFCN_H" save_LDFLAGS="$LDFLAGS" wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $export_dynamic_flag_spec\" save_LIBS="$LIBS" LIBS="$lt_cv_dlopen_libs $LIBS" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether a program can dlopen itself" >&5 $as_echo_n "checking whether a program can dlopen itself... " >&6; } if ${lt_cv_dlopen_self+:} false; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : lt_cv_dlopen_self=cross else lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2 lt_status=$lt_dlunknown cat > conftest.$ac_ext <<_LT_EOF #line $LINENO "configure" #include "confdefs.h" #if HAVE_DLFCN_H #include #endif #include #ifdef RTLD_GLOBAL # define LT_DLGLOBAL RTLD_GLOBAL #else # ifdef DL_GLOBAL # define LT_DLGLOBAL DL_GLOBAL # else # define LT_DLGLOBAL 0 # endif #endif /* We may have to define LT_DLLAZY_OR_NOW in the command line if we find out it does not work in some platform. */ #ifndef LT_DLLAZY_OR_NOW # ifdef RTLD_LAZY # define LT_DLLAZY_OR_NOW RTLD_LAZY # else # ifdef DL_LAZY # define LT_DLLAZY_OR_NOW DL_LAZY # else # ifdef RTLD_NOW # define LT_DLLAZY_OR_NOW RTLD_NOW # else # ifdef DL_NOW # define LT_DLLAZY_OR_NOW DL_NOW # else # define LT_DLLAZY_OR_NOW 0 # endif # endif # endif # endif #endif /* When -fvisbility=hidden is used, assume the code has been annotated correspondingly for the symbols needed. */ #if defined(__GNUC__) && (((__GNUC__ == 3) && (__GNUC_MINOR__ >= 3)) || (__GNUC__ > 3)) int fnord () __attribute__((visibility("default"))); #endif int fnord () { return 42; } int main () { void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW); int status = $lt_dlunknown; if (self) { if (dlsym (self,"fnord")) status = $lt_dlno_uscore; else { if (dlsym( self,"_fnord")) status = $lt_dlneed_uscore; else puts (dlerror ()); } /* dlclose (self); */ } else puts (dlerror ()); return status; } _LT_EOF if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_link\""; } >&5 (eval $ac_link) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s conftest${ac_exeext} 2>/dev/null; then (./conftest; exit; ) >&5 2>/dev/null lt_status=$? case x$lt_status in x$lt_dlno_uscore) lt_cv_dlopen_self=yes ;; x$lt_dlneed_uscore) lt_cv_dlopen_self=yes ;; x$lt_dlunknown|x*) lt_cv_dlopen_self=no ;; esac else : # compilation failed lt_cv_dlopen_self=no fi fi rm -fr conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_dlopen_self" >&5 $as_echo "$lt_cv_dlopen_self" >&6; } if test "x$lt_cv_dlopen_self" = xyes; then wl=$lt_prog_compiler_wl eval LDFLAGS=\"\$LDFLAGS $lt_prog_compiler_static\" { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether a statically linked program can dlopen itself" >&5 $as_echo_n "checking whether a statically linked program can dlopen itself... " >&6; } if ${lt_cv_dlopen_self_static+:} false; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : lt_cv_dlopen_self_static=cross else lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2 lt_status=$lt_dlunknown cat > conftest.$ac_ext <<_LT_EOF #line $LINENO "configure" #include "confdefs.h" #if HAVE_DLFCN_H #include #endif #include #ifdef RTLD_GLOBAL # define LT_DLGLOBAL RTLD_GLOBAL #else # ifdef DL_GLOBAL # define LT_DLGLOBAL DL_GLOBAL # else # define LT_DLGLOBAL 0 # endif #endif /* We may have to define LT_DLLAZY_OR_NOW in the command line if we find out it does not work in some platform. */ #ifndef LT_DLLAZY_OR_NOW # ifdef RTLD_LAZY # define LT_DLLAZY_OR_NOW RTLD_LAZY # else # ifdef DL_LAZY # define LT_DLLAZY_OR_NOW DL_LAZY # else # ifdef RTLD_NOW # define LT_DLLAZY_OR_NOW RTLD_NOW # else # ifdef DL_NOW # define LT_DLLAZY_OR_NOW DL_NOW # else # define LT_DLLAZY_OR_NOW 0 # endif # endif # endif # endif #endif /* When -fvisbility=hidden is used, assume the code has been annotated correspondingly for the symbols needed. */ #if defined(__GNUC__) && (((__GNUC__ == 3) && (__GNUC_MINOR__ >= 3)) || (__GNUC__ > 3)) int fnord () __attribute__((visibility("default"))); #endif int fnord () { return 42; } int main () { void *self = dlopen (0, LT_DLGLOBAL|LT_DLLAZY_OR_NOW); int status = $lt_dlunknown; if (self) { if (dlsym (self,"fnord")) status = $lt_dlno_uscore; else { if (dlsym( self,"_fnord")) status = $lt_dlneed_uscore; else puts (dlerror ()); } /* dlclose (self); */ } else puts (dlerror ()); return status; } _LT_EOF if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_link\""; } >&5 (eval $ac_link) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } && test -s conftest${ac_exeext} 2>/dev/null; then (./conftest; exit; ) >&5 2>/dev/null lt_status=$? case x$lt_status in x$lt_dlno_uscore) lt_cv_dlopen_self_static=yes ;; x$lt_dlneed_uscore) lt_cv_dlopen_self_static=yes ;; x$lt_dlunknown|x*) lt_cv_dlopen_self_static=no ;; esac else : # compilation failed lt_cv_dlopen_self_static=no fi fi rm -fr conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_dlopen_self_static" >&5 $as_echo "$lt_cv_dlopen_self_static" >&6; } fi CPPFLAGS="$save_CPPFLAGS" LDFLAGS="$save_LDFLAGS" LIBS="$save_LIBS" ;; esac case $lt_cv_dlopen_self in yes|no) enable_dlopen_self=$lt_cv_dlopen_self ;; *) enable_dlopen_self=unknown ;; esac case $lt_cv_dlopen_self_static in yes|no) enable_dlopen_self_static=$lt_cv_dlopen_self_static ;; *) enable_dlopen_self_static=unknown ;; esac fi striplib= old_striplib= { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether stripping libraries is possible" >&5 $as_echo_n "checking whether stripping libraries is possible... " >&6; } if test -n "$STRIP" && $STRIP -V 2>&1 | $GREP "GNU strip" >/dev/null; then test -z "$old_striplib" && old_striplib="$STRIP --strip-debug" test -z "$striplib" && striplib="$STRIP --strip-unneeded" { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else # FIXME - insert some real tests, host_os isn't really good enough case $host_os in darwin*) if test -n "$STRIP" ; then striplib="$STRIP -x" old_striplib="$STRIP -S" { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi ;; *) { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } ;; esac fi # Report which library types will actually be built { $as_echo "$as_me:${as_lineno-$LINENO}: checking if libtool supports shared libraries" >&5 $as_echo_n "checking if libtool supports shared libraries... " >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: result: $can_build_shared" >&5 $as_echo "$can_build_shared" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether to build shared libraries" >&5 $as_echo_n "checking whether to build shared libraries... " >&6; } test "$can_build_shared" = "no" && enable_shared=no # On AIX, shared libraries and static libraries use the same namespace, and # are all built from PIC. case $host_os in aix3*) test "$enable_shared" = yes && enable_static=no if test -n "$RANLIB"; then archive_cmds="$archive_cmds~\$RANLIB \$lib" postinstall_cmds='$RANLIB $lib' fi ;; aix[4-9]*) if test "$host_cpu" != ia64 && test "$aix_use_runtimelinking" = no ; then test "$enable_shared" = yes && enable_static=no fi ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $enable_shared" >&5 $as_echo "$enable_shared" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether to build static libraries" >&5 $as_echo_n "checking whether to build static libraries... " >&6; } # Make sure either enable_shared or enable_static is yes. test "$enable_shared" = yes || enable_static=yes { $as_echo "$as_me:${as_lineno-$LINENO}: result: $enable_static" >&5 $as_echo "$enable_static" >&6; } fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu CC="$lt_save_CC" if test -n "$CXX" && ( test "X$CXX" != "Xno" && ( (test "X$CXX" = "Xg++" && `g++ -v >/dev/null 2>&1` ) || (test "X$CXX" != "Xg++"))) ; then ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to run the C++ preprocessor" >&5 $as_echo_n "checking how to run the C++ preprocessor... " >&6; } if test -z "$CXXCPP"; then if ${ac_cv_prog_CXXCPP+:} false; then : $as_echo_n "(cached) " >&6 else # Double quotes because CXXCPP needs to be expanded for CXXCPP in "$CXX -E" "/lib/cpp" do ac_preproc_ok=false for ac_cxx_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_cxx_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.i conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_cxx_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.i conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.i conftest.err conftest.$ac_ext if $ac_preproc_ok; then : break fi done ac_cv_prog_CXXCPP=$CXXCPP fi CXXCPP=$ac_cv_prog_CXXCPP else ac_cv_prog_CXXCPP=$CXXCPP fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CXXCPP" >&5 $as_echo "$CXXCPP" >&6; } ac_preproc_ok=false for ac_cxx_preproc_warn_flag in '' yes do # Use a header file that comes with gcc, so configuring glibc # with a fresh cross-compiler works. # Prefer to if __STDC__ is defined, since # exists even on freestanding compilers. # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. "Syntax error" is here to catch this case. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifdef __STDC__ # include #else # include #endif Syntax error _ACEOF if ac_fn_cxx_try_cpp "$LINENO"; then : else # Broken: fails on valid input. continue fi rm -f conftest.err conftest.i conftest.$ac_ext # OK, works on sane cases. Now check whether nonexistent headers # can be detected and how. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if ac_fn_cxx_try_cpp "$LINENO"; then : # Broken: success on invalid input. continue else # Passes both tests. ac_preproc_ok=: break fi rm -f conftest.err conftest.i conftest.$ac_ext done # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. rm -f conftest.i conftest.err conftest.$ac_ext if $ac_preproc_ok; then : else { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "C++ preprocessor \"$CXXCPP\" fails sanity check See \`config.log' for more details" "$LINENO" 5; } fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu else _lt_caught_CXX_error=yes fi ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu archive_cmds_need_lc_CXX=no allow_undefined_flag_CXX= always_export_symbols_CXX=no archive_expsym_cmds_CXX= compiler_needs_object_CXX=no export_dynamic_flag_spec_CXX= hardcode_direct_CXX=no hardcode_direct_absolute_CXX=no hardcode_libdir_flag_spec_CXX= hardcode_libdir_separator_CXX= hardcode_minus_L_CXX=no hardcode_shlibpath_var_CXX=unsupported hardcode_automatic_CXX=no inherit_rpath_CXX=no module_cmds_CXX= module_expsym_cmds_CXX= link_all_deplibs_CXX=unknown old_archive_cmds_CXX=$old_archive_cmds reload_flag_CXX=$reload_flag reload_cmds_CXX=$reload_cmds no_undefined_flag_CXX= whole_archive_flag_spec_CXX= enable_shared_with_static_runtimes_CXX=no # Source file extension for C++ test sources. ac_ext=cpp # Object file extension for compiled C++ test sources. objext=o objext_CXX=$objext # No sense in running all these tests if we already determined that # the CXX compiler isn't working. Some variables (like enable_shared) # are currently assumed to apply to all compilers on this platform, # and will be corrupted by setting them based on a non-working compiler. if test "$_lt_caught_CXX_error" != yes; then # Code to be used in simple compile tests lt_simple_compile_test_code="int some_variable = 0;" # Code to be used in simple link tests lt_simple_link_test_code='int main(int, char *[]) { return(0); }' # ltmain only uses $CC for tagged configurations so make sure $CC is set. # If no C compiler was specified, use CC. LTCC=${LTCC-"$CC"} # If no C compiler flags were specified, use CFLAGS. LTCFLAGS=${LTCFLAGS-"$CFLAGS"} # Allow CC to be a program name with arguments. compiler=$CC # save warnings/boilerplate of simple test code ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" >conftest.$ac_ext eval "$ac_compile" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_compiler_boilerplate=`cat conftest.err` $RM conftest* ac_outfile=conftest.$ac_objext echo "$lt_simple_link_test_code" >conftest.$ac_ext eval "$ac_link" 2>&1 >/dev/null | $SED '/^$/d; /^ *+/d' >conftest.err _lt_linker_boilerplate=`cat conftest.err` $RM -r conftest* # Allow CC to be a program name with arguments. lt_save_CC=$CC lt_save_CFLAGS=$CFLAGS lt_save_LD=$LD lt_save_GCC=$GCC GCC=$GXX lt_save_with_gnu_ld=$with_gnu_ld lt_save_path_LD=$lt_cv_path_LD if test -n "${lt_cv_prog_gnu_ldcxx+set}"; then lt_cv_prog_gnu_ld=$lt_cv_prog_gnu_ldcxx else $as_unset lt_cv_prog_gnu_ld fi if test -n "${lt_cv_path_LDCXX+set}"; then lt_cv_path_LD=$lt_cv_path_LDCXX else $as_unset lt_cv_path_LD fi test -z "${LDCXX+set}" || LD=$LDCXX CC=${CXX-"c++"} CFLAGS=$CXXFLAGS compiler=$CC compiler_CXX=$CC for cc_temp in $compiler""; do case $cc_temp in compile | *[\\/]compile | ccache | *[\\/]ccache ) ;; distcc | *[\\/]distcc | purify | *[\\/]purify ) ;; \-*) ;; *) break;; esac done cc_basename=`$ECHO "$cc_temp" | $SED "s%.*/%%; s%^$host_alias-%%"` if test -n "$compiler"; then # We don't want -fno-exception when compiling C++ code, so set the # no_builtin_flag separately if test "$GXX" = yes; then lt_prog_compiler_no_builtin_flag_CXX=' -fno-builtin' else lt_prog_compiler_no_builtin_flag_CXX= fi if test "$GXX" = yes; then # Set up default GNU C++ configuration # Check whether --with-gnu-ld was given. if test "${with_gnu_ld+set}" = set; then : withval=$with_gnu_ld; test "$withval" = no || with_gnu_ld=yes else with_gnu_ld=no fi ac_prog=ld if test "$GCC" = yes; then # Check if gcc -print-prog-name=ld gives a path. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ld used by $CC" >&5 $as_echo_n "checking for ld used by $CC... " >&6; } case $host in *-*-mingw*) # gcc leaves a trailing carriage return which upsets mingw ac_prog=`($CC -print-prog-name=ld) 2>&5 | tr -d '\015'` ;; *) ac_prog=`($CC -print-prog-name=ld) 2>&5` ;; esac case $ac_prog in # Accept absolute paths. [\\/]* | ?:[\\/]*) re_direlt='/[^/][^/]*/\.\./' # Canonicalize the pathname of ld ac_prog=`$ECHO "$ac_prog"| $SED 's%\\\\%/%g'` while $ECHO "$ac_prog" | $GREP "$re_direlt" > /dev/null 2>&1; do ac_prog=`$ECHO $ac_prog| $SED "s%$re_direlt%/%"` done test -z "$LD" && LD="$ac_prog" ;; "") # If it fails, then pretend we aren't using GCC. ac_prog=ld ;; *) # If it is relative, then search for the first ld in PATH. with_gnu_ld=unknown ;; esac elif test "$with_gnu_ld" = yes; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for GNU ld" >&5 $as_echo_n "checking for GNU ld... " >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: checking for non-GNU ld" >&5 $as_echo_n "checking for non-GNU ld... " >&6; } fi if ${lt_cv_path_LD+:} false; then : $as_echo_n "(cached) " >&6 else if test -z "$LD"; then lt_save_ifs="$IFS"; IFS=$PATH_SEPARATOR for ac_dir in $PATH; do IFS="$lt_save_ifs" test -z "$ac_dir" && ac_dir=. if test -f "$ac_dir/$ac_prog" || test -f "$ac_dir/$ac_prog$ac_exeext"; then lt_cv_path_LD="$ac_dir/$ac_prog" # Check to see if the program is GNU ld. I'd rather use --version, # but apparently some variants of GNU ld only accept -v. # Break only if it was the GNU/non-GNU ld that we prefer. case `"$lt_cv_path_LD" -v 2>&1 &5 $as_echo "$LD" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -z "$LD" && as_fn_error $? "no acceptable ld found in \$PATH" "$LINENO" 5 { $as_echo "$as_me:${as_lineno-$LINENO}: checking if the linker ($LD) is GNU ld" >&5 $as_echo_n "checking if the linker ($LD) is GNU ld... " >&6; } if ${lt_cv_prog_gnu_ld+:} false; then : $as_echo_n "(cached) " >&6 else # I'd rather use --version here, but apparently some GNU lds only accept -v. case `$LD -v 2>&1 &5 $as_echo "$lt_cv_prog_gnu_ld" >&6; } with_gnu_ld=$lt_cv_prog_gnu_ld # Check if GNU C++ uses GNU ld as the underlying linker, since the # archiving commands below assume that GNU ld is being used. if test "$with_gnu_ld" = yes; then archive_cmds_CXX='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC $pic_flag -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir' export_dynamic_flag_spec_CXX='${wl}--export-dynamic' # If archive_cmds runs LD, not CC, wlarc should be empty # XXX I think wlarc can be eliminated in ltcf-cxx, but I need to # investigate it a little bit more. (MM) wlarc='${wl}' # ancient GNU ld didn't support --whole-archive et. al. if eval "`$CC -print-prog-name=ld` --help 2>&1" | $GREP 'no-whole-archive' > /dev/null; then whole_archive_flag_spec_CXX="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' else whole_archive_flag_spec_CXX= fi else with_gnu_ld=no wlarc= # A generic and very simple default shared library creation # command for GNU C++ for the case where it uses the native # linker, instead of GNU ld. If possible, this setting should # overridden to take advantage of the native linker features on # the platform it is being used on. archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' fi # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' else GXX=no with_gnu_ld=no wlarc= fi # PORTME: fill in a description of your system's C++ link characteristics { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries" >&5 $as_echo_n "checking whether the $compiler linker ($LD) supports shared libraries... " >&6; } ld_shlibs_CXX=yes case $host_os in aix3*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; aix[4-9]*) if test "$host_cpu" = ia64; then # On IA64, the linker does run time linking by default, so we don't # have to do anything special. aix_use_runtimelinking=no exp_sym_flag='-Bexport' no_entry_flag="" else aix_use_runtimelinking=no # Test if we are trying to use run time linking or normal # AIX style linking. If -brtl is somewhere in LDFLAGS, we # need to do runtime linking. case $host_os in aix4.[23]|aix4.[23].*|aix[5-9]*) for ld_flag in $LDFLAGS; do case $ld_flag in *-brtl*) aix_use_runtimelinking=yes break ;; esac done ;; esac exp_sym_flag='-bexport' no_entry_flag='-bnoentry' fi # When large executables or shared objects are built, AIX ld can # have problems creating the table of contents. If linking a library # or program results in "error TOC overflow" add -mminimal-toc to # CXXFLAGS/CFLAGS for g++/gcc. In the cases where that is not # enough to fix the problem, add -Wl,-bbigtoc to LDFLAGS. archive_cmds_CXX='' hardcode_direct_CXX=yes hardcode_direct_absolute_CXX=yes hardcode_libdir_separator_CXX=':' link_all_deplibs_CXX=yes file_list_spec_CXX='${wl}-f,' if test "$GXX" = yes; then case $host_os in aix4.[012]|aix4.[012].*) # We only want to do this on AIX 4.2 and lower, the check # below for broken collect2 doesn't work under 4.3+ collect2name=`${CC} -print-prog-name=collect2` if test -f "$collect2name" && strings "$collect2name" | $GREP resolve_lib_name >/dev/null then # We have reworked collect2 : else # We have old collect2 hardcode_direct_CXX=unsupported # It fails to find uninstalled libraries when the uninstalled # path is not listed in the libpath. Setting hardcode_minus_L # to unsupported forces relinking hardcode_minus_L_CXX=yes hardcode_libdir_flag_spec_CXX='-L$libdir' hardcode_libdir_separator_CXX= fi esac shared_flag='-shared' if test "$aix_use_runtimelinking" = yes; then shared_flag="$shared_flag "'${wl}-G' fi else # not using gcc if test "$host_cpu" = ia64; then # VisualAge C++, Version 5.5 for AIX 5L for IA-64, Beta 3 Release # chokes on -Wl,-G. The following line is correct: shared_flag='-G' else if test "$aix_use_runtimelinking" = yes; then shared_flag='${wl}-G' else shared_flag='${wl}-bM:SRE' fi fi fi export_dynamic_flag_spec_CXX='${wl}-bexpall' # It seems that -bexpall does not export symbols beginning with # underscore (_), so it is better to generate a list of symbols to # export. always_export_symbols_CXX=yes if test "$aix_use_runtimelinking" = yes; then # Warning - without using the other runtime loading flags (-brtl), # -berok will link without error, but may produce a broken library. allow_undefined_flag_CXX='-berok' # Determine the default libpath from the value encoded in an empty # executable. if test "${lt_cv_aix_libpath+set}" = set; then aix_libpath=$lt_cv_aix_libpath else if ${lt_cv_aix_libpath__CXX+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_link "$LINENO"; then : lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\([^ ]*\) *$/\1/ p } }' lt_cv_aix_libpath__CXX=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$lt_cv_aix_libpath__CXX"; then lt_cv_aix_libpath__CXX=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$lt_cv_aix_libpath__CXX"; then lt_cv_aix_libpath__CXX="/usr/lib:/lib" fi fi aix_libpath=$lt_cv_aix_libpath__CXX fi hardcode_libdir_flag_spec_CXX='${wl}-blibpath:$libdir:'"$aix_libpath" archive_expsym_cmds_CXX='$CC -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags `if test "x${allow_undefined_flag}" != "x"; then func_echo_all "${wl}${allow_undefined_flag}"; else :; fi` '"\${wl}$exp_sym_flag:\$export_symbols $shared_flag" else if test "$host_cpu" = ia64; then hardcode_libdir_flag_spec_CXX='${wl}-R $libdir:/usr/lib:/lib' allow_undefined_flag_CXX="-z nodefs" archive_expsym_cmds_CXX="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs '"\${wl}$no_entry_flag"' $compiler_flags ${wl}${allow_undefined_flag} '"\${wl}$exp_sym_flag:\$export_symbols" else # Determine the default libpath from the value encoded in an # empty executable. if test "${lt_cv_aix_libpath+set}" = set; then aix_libpath=$lt_cv_aix_libpath else if ${lt_cv_aix_libpath__CXX+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_link "$LINENO"; then : lt_aix_libpath_sed=' /Import File Strings/,/^$/ { /^0/ { s/^0 *\([^ ]*\) *$/\1/ p } }' lt_cv_aix_libpath__CXX=`dump -H conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` # Check for a 64-bit object if we didn't find anything. if test -z "$lt_cv_aix_libpath__CXX"; then lt_cv_aix_libpath__CXX=`dump -HX64 conftest$ac_exeext 2>/dev/null | $SED -n -e "$lt_aix_libpath_sed"` fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext if test -z "$lt_cv_aix_libpath__CXX"; then lt_cv_aix_libpath__CXX="/usr/lib:/lib" fi fi aix_libpath=$lt_cv_aix_libpath__CXX fi hardcode_libdir_flag_spec_CXX='${wl}-blibpath:$libdir:'"$aix_libpath" # Warning - without using the other run time loading flags, # -berok will link without error, but may produce a broken library. no_undefined_flag_CXX=' ${wl}-bernotok' allow_undefined_flag_CXX=' ${wl}-berok' if test "$with_gnu_ld" = yes; then # We only use this code for GNU lds that support --whole-archive. whole_archive_flag_spec_CXX='${wl}--whole-archive$convenience ${wl}--no-whole-archive' else # Exported symbols can be pulled into shared objects from archives whole_archive_flag_spec_CXX='$convenience' fi archive_cmds_need_lc_CXX=yes # This is similar to how AIX traditionally builds its shared # libraries. archive_expsym_cmds_CXX="\$CC $shared_flag"' -o $output_objdir/$soname $libobjs $deplibs ${wl}-bnoentry $compiler_flags ${wl}-bE:$export_symbols${allow_undefined_flag}~$AR $AR_FLAGS $output_objdir/$libname$release.a $output_objdir/$soname' fi fi ;; beos*) if $LD --help 2>&1 | $GREP ': supported targets:.* elf' > /dev/null; then allow_undefined_flag_CXX=unsupported # Joseph Beckenbach says some releases of gcc # support --undefined. This deserves some investigation. FIXME archive_cmds_CXX='$CC -nostart $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' else ld_shlibs_CXX=no fi ;; chorus*) case $cc_basename in *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; cygwin* | mingw* | pw32* | cegcc*) case $GXX,$cc_basename in ,cl* | no,cl*) # Native MSVC # hardcode_libdir_flag_spec is actually meaningless, as there is # no search path for DLLs. hardcode_libdir_flag_spec_CXX=' ' allow_undefined_flag_CXX=unsupported always_export_symbols_CXX=yes file_list_spec_CXX='@' # Tell ltmain to make .lib files, not .a files. libext=lib # Tell ltmain to make .dll files, not .so files. shrext_cmds=".dll" # FIXME: Setting linknames here is a bad hack. archive_cmds_CXX='$CC -o $output_objdir/$soname $libobjs $compiler_flags $deplibs -Wl,-dll~linknames=' archive_expsym_cmds_CXX='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then $SED -n -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' -e '1\\\!p' < $export_symbols > $output_objdir/$soname.exp; else $SED -e 's/\\\\\\\(.*\\\\\\\)/-link\\\ -EXPORT:\\\\\\\1/' < $export_symbols > $output_objdir/$soname.exp; fi~ $CC -o $tool_output_objdir$soname $libobjs $compiler_flags $deplibs "@$tool_output_objdir$soname.exp" -Wl,-DLL,-IMPLIB:"$tool_output_objdir$libname.dll.lib"~ linknames=' # The linker will not automatically build a static lib if we build a DLL. # _LT_TAGVAR(old_archive_from_new_cmds, CXX)='true' enable_shared_with_static_runtimes_CXX=yes # Don't use ranlib old_postinstall_cmds_CXX='chmod 644 $oldlib' postlink_cmds_CXX='lt_outputfile="@OUTPUT@"~ lt_tool_outputfile="@TOOL_OUTPUT@"~ case $lt_outputfile in *.exe|*.EXE) ;; *) lt_outputfile="$lt_outputfile.exe" lt_tool_outputfile="$lt_tool_outputfile.exe" ;; esac~ func_to_tool_file "$lt_outputfile"~ if test "$MANIFEST_TOOL" != ":" && test -f "$lt_outputfile.manifest"; then $MANIFEST_TOOL -manifest "$lt_tool_outputfile.manifest" -outputresource:"$lt_tool_outputfile" || exit 1; $RM "$lt_outputfile.manifest"; fi' ;; *) # g++ # _LT_TAGVAR(hardcode_libdir_flag_spec, CXX) is actually meaningless, # as there is no search path for DLLs. hardcode_libdir_flag_spec_CXX='-L$libdir' export_dynamic_flag_spec_CXX='${wl}--export-all-symbols' allow_undefined_flag_CXX=unsupported always_export_symbols_CXX=no enable_shared_with_static_runtimes_CXX=yes if $LD --help 2>&1 | $GREP 'auto-import' > /dev/null; then archive_cmds_CXX='$CC -shared -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' # If the export-symbols file already is a .def file (1st line # is EXPORTS), use it as is; otherwise, prepend... archive_expsym_cmds_CXX='if test "x`$SED 1q $export_symbols`" = xEXPORTS; then cp $export_symbols $output_objdir/$soname.def; else echo EXPORTS > $output_objdir/$soname.def; cat $export_symbols >> $output_objdir/$soname.def; fi~ $CC -shared -nostdlib $output_objdir/$soname.def $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $output_objdir/$soname ${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker $lib' else ld_shlibs_CXX=no fi ;; esac ;; darwin* | rhapsody*) archive_cmds_need_lc_CXX=no hardcode_direct_CXX=no hardcode_automatic_CXX=yes hardcode_shlibpath_var_CXX=unsupported if test "$lt_cv_ld_force_load" = "yes"; then whole_archive_flag_spec_CXX='`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience ${wl}-force_load,$conv\"; done; func_echo_all \"$new_convenience\"`' else whole_archive_flag_spec_CXX='' fi link_all_deplibs_CXX=yes allow_undefined_flag_CXX="$_lt_dar_allow_undefined" case $cc_basename in ifort*) _lt_dar_can_shared=yes ;; *) _lt_dar_can_shared=$GCC ;; esac if test "$_lt_dar_can_shared" = "yes"; then output_verbose_link_cmd=func_echo_all archive_cmds_CXX="\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring $_lt_dar_single_mod${_lt_dsymutil}" module_cmds_CXX="\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dsymutil}" archive_expsym_cmds_CXX="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \$libobjs \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring ${_lt_dar_single_mod}${_lt_dar_export_syms}${_lt_dsymutil}" module_expsym_cmds_CXX="sed -e 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC \$allow_undefined_flag -o \$lib -bundle \$libobjs \$deplibs \$compiler_flags${_lt_dar_export_syms}${_lt_dsymutil}" if test "$lt_cv_apple_cc_single_mod" != "yes"; then archive_cmds_CXX="\$CC -r -keep_private_externs -nostdlib -o \${lib}-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \${lib}-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring${_lt_dsymutil}" archive_expsym_cmds_CXX="sed 's,^,_,' < \$export_symbols > \$output_objdir/\${libname}-symbols.expsym~\$CC -r -keep_private_externs -nostdlib -o \${lib}-master.o \$libobjs~\$CC -dynamiclib \$allow_undefined_flag -o \$lib \${lib}-master.o \$deplibs \$compiler_flags -install_name \$rpath/\$soname \$verstring${_lt_dar_export_syms}${_lt_dsymutil}" fi else ld_shlibs_CXX=no fi ;; dgux*) case $cc_basename in ec++*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; ghcx*) # Green Hills C++ Compiler # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; freebsd2.*) # C++ shared libraries reported to be fairly broken before # switch to ELF ld_shlibs_CXX=no ;; freebsd-elf*) archive_cmds_need_lc_CXX=no ;; freebsd* | dragonfly*) # FreeBSD 3 and later use GNU C++ and GNU ld with standard ELF # conventions ld_shlibs_CXX=yes ;; haiku*) archive_cmds_CXX='$CC -shared $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' link_all_deplibs_CXX=yes ;; hpux9*) hardcode_libdir_flag_spec_CXX='${wl}+b ${wl}$libdir' hardcode_libdir_separator_CXX=: export_dynamic_flag_spec_CXX='${wl}-E' hardcode_direct_CXX=yes hardcode_minus_L_CXX=yes # Not in the search PATH, # but as the default # location of the library. case $cc_basename in CC*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; aCC*) archive_cmds_CXX='$RM $output_objdir/$soname~$CC -b ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $EGREP "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' ;; *) if test "$GXX" = yes; then archive_cmds_CXX='$RM $output_objdir/$soname~$CC -shared -nostdlib $pic_flag ${wl}+b ${wl}$install_libdir -o $output_objdir/$soname $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~test $output_objdir/$soname = $lib || mv $output_objdir/$soname $lib' else # FIXME: insert proper C++ library support ld_shlibs_CXX=no fi ;; esac ;; hpux10*|hpux11*) if test $with_gnu_ld = no; then hardcode_libdir_flag_spec_CXX='${wl}+b ${wl}$libdir' hardcode_libdir_separator_CXX=: case $host_cpu in hppa*64*|ia64*) ;; *) export_dynamic_flag_spec_CXX='${wl}-E' ;; esac fi case $host_cpu in hppa*64*|ia64*) hardcode_direct_CXX=no hardcode_shlibpath_var_CXX=no ;; *) hardcode_direct_CXX=yes hardcode_direct_absolute_CXX=yes hardcode_minus_L_CXX=yes # Not in the search PATH, # but as the default # location of the library. ;; esac case $cc_basename in CC*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; aCC*) case $host_cpu in hppa*64*) archive_cmds_CXX='$CC -b ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) archive_cmds_CXX='$CC -b ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) archive_cmds_CXX='$CC -b ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`($CC -b $CFLAGS -v conftest.$objext 2>&1) | $GREP "\-L"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' ;; *) if test "$GXX" = yes; then if test $with_gnu_ld = no; then case $host_cpu in hppa*64*) archive_cmds_CXX='$CC -shared -nostdlib -fPIC ${wl}+h ${wl}$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; ia64*) archive_cmds_CXX='$CC -shared -nostdlib $pic_flag ${wl}+h ${wl}$soname ${wl}+nodefaultrpath -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; *) archive_cmds_CXX='$CC -shared -nostdlib $pic_flag ${wl}+h ${wl}$soname ${wl}+b ${wl}$install_libdir -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' ;; esac fi else # FIXME: insert proper C++ library support ld_shlibs_CXX=no fi ;; esac ;; interix[3-9]*) hardcode_direct_CXX=no hardcode_shlibpath_var_CXX=no hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir' export_dynamic_flag_spec_CXX='${wl}-E' # Hack: On Interix 3.x, we cannot compile PIC because of a broken gcc. # Instead, shared libraries are loaded at an image base (0x10000000 by # default) and relocated if they conflict, which is a slow very memory # consuming and fragmenting process. To avoid this, we pick a random, # 256 KiB-aligned image base between 0x50000000 and 0x6FFC0000 at link # time. Moving up from 0x10000000 also allows more sbrk(2) space. archive_cmds_CXX='$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' archive_expsym_cmds_CXX='sed "s,^,_," $export_symbols >$output_objdir/$soname.expsym~$CC -shared $pic_flag $libobjs $deplibs $compiler_flags ${wl}-h,$soname ${wl}--retain-symbols-file,$output_objdir/$soname.expsym ${wl}--image-base,`expr ${RANDOM-$$} % 4096 / 2 \* 262144 + 1342177280` -o $lib' ;; irix5* | irix6*) case $cc_basename in CC*) # SGI C++ archive_cmds_CXX='$CC -shared -all -multigot $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib' # Archives containing C++ object files must be created using # "CC -ar", where "CC" is the IRIX C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. old_archive_cmds_CXX='$CC -ar -WR,-u -o $oldlib $oldobjs' ;; *) if test "$GXX" = yes; then if test "$with_gnu_ld" = no; then archive_cmds_CXX='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' else archive_cmds_CXX='$CC -shared $pic_flag -nostdlib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` -o $lib' fi fi link_all_deplibs_CXX=yes ;; esac hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator_CXX=: inherit_rpath_CXX=yes ;; linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. archive_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\''s/\([^()0-9A-Za-z{}]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' archive_expsym_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\''s/\([^()0-9A-Za-z{}]\)/\\\\\1/g'\''`; templib=`echo $lib | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib ${wl}-retain-symbols-file,$export_symbols; mv \$templib $lib' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 | $GREP "ld"`; rm -f libconftest$shared_ext; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir' export_dynamic_flag_spec_CXX='${wl}--export-dynamic' # Archives containing C++ object files must be created using # "CC -Bstatic", where "CC" is the KAI C++ compiler. old_archive_cmds_CXX='$CC -Bstatic -o $oldlib $oldobjs' ;; icpc* | ecpc* ) # Intel C++ with_gnu_ld=yes # version 8.0 and above of icpc choke on multiply defined symbols # if we add $predep_objects and $postdep_objects, however 7.1 and # earlier do not add the objects themselves. case `$CC -V 2>&1` in *"Version 7."*) archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' ;; *) # Version 8.0 or newer tmp_idyn= case $host_cpu in ia64*) tmp_idyn=' -i_dynamic';; esac archive_cmds_CXX='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared'"$tmp_idyn"' $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-retain-symbols-file $wl$export_symbols -o $lib' ;; esac archive_cmds_need_lc_CXX=no hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir' export_dynamic_flag_spec_CXX='${wl}--export-dynamic' whole_archive_flag_spec_CXX='${wl}--whole-archive$convenience ${wl}--no-whole-archive' ;; pgCC* | pgcpp*) # Portland Group C++ compiler case `$CC -V` in *pgCC\ [1-5].* | *pgcpp\ [1-5].*) prelink_cmds_CXX='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $objs $libobjs $compile_deplibs~ compile_command="$compile_command `find $tpldir -name \*.o | sort | $NL2SP`"' old_archive_cmds_CXX='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $oldobjs$old_deplibs~ $AR $AR_FLAGS $oldlib$oldobjs$old_deplibs `find $tpldir -name \*.o | sort | $NL2SP`~ $RANLIB $oldlib' archive_cmds_CXX='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~ $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | sort | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib' archive_expsym_cmds_CXX='tpldir=Template.dir~ rm -rf $tpldir~ $CC --prelink_objects --instantiation_dir $tpldir $predep_objects $libobjs $deplibs $convenience $postdep_objects~ $CC -shared $pic_flag $predep_objects $libobjs $deplibs `find $tpldir -name \*.o | sort | $NL2SP` $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib' ;; *) # Version 6 and above use weak symbols archive_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname ${wl}-retain-symbols-file ${wl}$export_symbols -o $lib' ;; esac hardcode_libdir_flag_spec_CXX='${wl}--rpath ${wl}$libdir' export_dynamic_flag_spec_CXX='${wl}--export-dynamic' whole_archive_flag_spec_CXX='${wl}--whole-archive`for conv in $convenience\"\"; do test -n \"$conv\" && new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive' ;; cxx*) # Compaq C++ archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib' archive_expsym_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $wl$soname -o $lib ${wl}-retain-symbols-file $wl$export_symbols' runpath_var=LD_RUN_PATH hardcode_libdir_flag_spec_CXX='-rpath $libdir' hardcode_libdir_separator_CXX=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld"`; templist=`func_echo_all "$templist" | $SED "s/\(^.*ld.*\)\( .*ld .*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "X$list" | $Xsed' ;; xl* | mpixl* | bgxl*) # IBM XL 8.0 on PPC, with GNU ld hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir' export_dynamic_flag_spec_CXX='${wl}--export-dynamic' archive_cmds_CXX='$CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname -o $lib' if test "x$supports_anon_versioning" = xyes; then archive_expsym_cmds_CXX='echo "{ global:" > $output_objdir/$libname.ver~ cat $export_symbols | sed -e "s/\(.*\)/\1;/" >> $output_objdir/$libname.ver~ echo "local: *; };" >> $output_objdir/$libname.ver~ $CC -qmkshrobj $libobjs $deplibs $compiler_flags ${wl}-soname $wl$soname ${wl}-version-script ${wl}$output_objdir/$libname.ver -o $lib' fi ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 no_undefined_flag_CXX=' -zdefs' archive_cmds_CXX='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' archive_expsym_cmds_CXX='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file ${wl}$export_symbols' hardcode_libdir_flag_spec_CXX='-R$libdir' whole_archive_flag_spec_CXX='${wl}--whole-archive`new_convenience=; for conv in $convenience\"\"; do test -z \"$conv\" || new_convenience=\"$new_convenience,$conv\"; done; func_echo_all \"$new_convenience\"` ${wl}--no-whole-archive' compiler_needs_object_CXX=yes # Not sure whether something based on # $CC $CFLAGS -v conftest.$objext -o libconftest$shared_ext 2>&1 # would be better. output_verbose_link_cmd='func_echo_all' # Archives containing C++ object files must be created using # "CC -xar", where "CC" is the Sun C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. old_archive_cmds_CXX='$CC -xar -o $oldlib $oldobjs' ;; esac ;; esac ;; lynxos*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; m88k*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; mvs*) case $cc_basename in cxx*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; netbsd*) if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then archive_cmds_CXX='$LD -Bshareable -o $lib $predep_objects $libobjs $deplibs $postdep_objects $linker_flags' wlarc= hardcode_libdir_flag_spec_CXX='-R$libdir' hardcode_direct_CXX=yes hardcode_shlibpath_var_CXX=no fi # Workaround some broken pre-1.5 toolchains output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP conftest.$objext | $SED -e "s:-lgcc -lc -lgcc::"' ;; *nto* | *qnx*) ld_shlibs_CXX=yes ;; openbsd2*) # C++ shared libraries are fairly broken ld_shlibs_CXX=no ;; openbsd*) if test -f /usr/libexec/ld.so; then hardcode_direct_CXX=yes hardcode_shlibpath_var_CXX=no hardcode_direct_absolute_CXX=yes archive_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -o $lib' hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir' if test -z "`echo __ELF__ | $CC -E - | grep __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then archive_expsym_cmds_CXX='$CC -shared $pic_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-retain-symbols-file,$export_symbols -o $lib' export_dynamic_flag_spec_CXX='${wl}-E' whole_archive_flag_spec_CXX="$wlarc"'--whole-archive$convenience '"$wlarc"'--no-whole-archive' fi output_verbose_link_cmd=func_echo_all else ld_shlibs_CXX=no fi ;; osf3* | osf4* | osf5*) case $cc_basename in KCC*) # Kuck and Associates, Inc. (KAI) C++ Compiler # KCC will only create a shared library if the output file # ends with ".so" (or ".sl" for HP-UX), so rename the library # to its proper name (with version) after linking. archive_cmds_CXX='tempext=`echo $shared_ext | $SED -e '\''s/\([^()0-9A-Za-z{}]\)/\\\\\1/g'\''`; templib=`echo "$lib" | $SED -e "s/\${tempext}\..*/.so/"`; $CC $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags --soname $soname -o \$templib; mv \$templib $lib' hardcode_libdir_flag_spec_CXX='${wl}-rpath,$libdir' hardcode_libdir_separator_CXX=: # Archives containing C++ object files must be created using # the KAI C++ compiler. case $host in osf3*) old_archive_cmds_CXX='$CC -Bstatic -o $oldlib $oldobjs' ;; *) old_archive_cmds_CXX='$CC -o $oldlib $oldobjs' ;; esac ;; RCC*) # Rational C++ 2.4.1 # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; cxx*) case $host in osf3*) allow_undefined_flag_CXX=' ${wl}-expect_unresolved ${wl}\*' archive_cmds_CXX='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname $soname `test -n "$verstring" && func_echo_all "${wl}-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib' hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir' ;; *) allow_undefined_flag_CXX=' -expect_unresolved \*' archive_cmds_CXX='$CC -shared${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname `test -n "$verstring" && func_echo_all "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib' archive_expsym_cmds_CXX='for i in `cat $export_symbols`; do printf "%s %s\\n" -exported_symbol "\$i" >> $lib.exp; done~ echo "-hidden">> $lib.exp~ $CC -shared$allow_undefined_flag $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags -msym -soname $soname ${wl}-input ${wl}$lib.exp `test -n "$verstring" && $ECHO "-set_version $verstring"` -update_registry ${output_objdir}/so_locations -o $lib~ $RM $lib.exp' hardcode_libdir_flag_spec_CXX='-rpath $libdir' ;; esac hardcode_libdir_separator_CXX=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. # # There doesn't appear to be a way to prevent this compiler from # explicitly linking system object files so we need to strip them # from the output so that they don't get included in the library # dependencies. output_verbose_link_cmd='templist=`$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP "ld" | $GREP -v "ld:"`; templist=`func_echo_all "$templist" | $SED "s/\(^.*ld.*\)\( .*ld.*$\)/\1/"`; list=""; for z in $templist; do case $z in conftest.$objext) list="$list $z";; *.$objext);; *) list="$list $z";;esac; done; func_echo_all "$list"' ;; *) if test "$GXX" = yes && test "$with_gnu_ld" = no; then allow_undefined_flag_CXX=' ${wl}-expect_unresolved ${wl}\*' case $host in osf3*) archive_cmds_CXX='$CC -shared -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' ;; *) archive_cmds_CXX='$CC -shared $pic_flag -nostdlib ${allow_undefined_flag} $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-msym ${wl}-soname ${wl}$soname `test -n "$verstring" && func_echo_all "${wl}-set_version ${wl}$verstring"` ${wl}-update_registry ${wl}${output_objdir}/so_locations -o $lib' ;; esac hardcode_libdir_flag_spec_CXX='${wl}-rpath ${wl}$libdir' hardcode_libdir_separator_CXX=: # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' else # FIXME: insert proper C++ library support ld_shlibs_CXX=no fi ;; esac ;; psos*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; lcc*) # Lucid # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; solaris*) case $cc_basename in CC* | sunCC*) # Sun C++ 4.2, 5.x and Centerline C++ archive_cmds_need_lc_CXX=yes no_undefined_flag_CXX=' -zdefs' archive_cmds_CXX='$CC -G${allow_undefined_flag} -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags' archive_expsym_cmds_CXX='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G${allow_undefined_flag} ${wl}-M ${wl}$lib.exp -h$soname -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' hardcode_libdir_flag_spec_CXX='-R$libdir' hardcode_shlibpath_var_CXX=no case $host_os in solaris2.[0-5] | solaris2.[0-5].*) ;; *) # The compiler driver will combine and reorder linker options, # but understands `-z linker_flag'. # Supported since Solaris 2.6 (maybe 2.5.1?) whole_archive_flag_spec_CXX='-z allextract$convenience -z defaultextract' ;; esac link_all_deplibs_CXX=yes output_verbose_link_cmd='func_echo_all' # Archives containing C++ object files must be created using # "CC -xar", where "CC" is the Sun C++ compiler. This is # necessary to make sure instantiated templates are included # in the archive. old_archive_cmds_CXX='$CC -xar -o $oldlib $oldobjs' ;; gcx*) # Green Hills C++ Compiler archive_cmds_CXX='$CC -shared $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' # The C++ compiler must be used to create the archive. old_archive_cmds_CXX='$CC $LDFLAGS -archive -o $oldlib $oldobjs' ;; *) # GNU C++ compiler with Solaris linker if test "$GXX" = yes && test "$with_gnu_ld" = no; then no_undefined_flag_CXX=' ${wl}-z ${wl}defs' if $CC --version | $GREP -v '^2\.7' > /dev/null; then archive_cmds_CXX='$CC -shared $pic_flag -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' archive_expsym_cmds_CXX='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -shared $pic_flag -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -shared $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' else # g++ 2.7 appears to require `-G' NOT `-shared' on this # platform. archive_cmds_CXX='$CC -G -nostdlib $LDFLAGS $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags ${wl}-h $wl$soname -o $lib' archive_expsym_cmds_CXX='echo "{ global:" > $lib.exp~cat $export_symbols | $SED -e "s/\(.*\)/\1;/" >> $lib.exp~echo "local: *; };" >> $lib.exp~ $CC -G -nostdlib ${wl}-M $wl$lib.exp -o $lib $predep_objects $libobjs $deplibs $postdep_objects $compiler_flags~$RM $lib.exp' # Commands to make compiler produce verbose output that lists # what "hidden" libraries, object files and flags are used when # linking a shared library. output_verbose_link_cmd='$CC -G $CFLAGS -v conftest.$objext 2>&1 | $GREP -v "^Configured with:" | $GREP "\-L"' fi hardcode_libdir_flag_spec_CXX='${wl}-R $wl$libdir' case $host_os in solaris2.[0-5] | solaris2.[0-5].*) ;; *) whole_archive_flag_spec_CXX='${wl}-z ${wl}allextract$convenience ${wl}-z ${wl}defaultextract' ;; esac fi ;; esac ;; sysv4*uw2* | sysv5OpenUNIX* | sysv5UnixWare7.[01].[10]* | unixware7* | sco3.2v5.0.[024]*) no_undefined_flag_CXX='${wl}-z,text' archive_cmds_need_lc_CXX=no hardcode_shlibpath_var_CXX=no runpath_var='LD_RUN_PATH' case $cc_basename in CC*) archive_cmds_CXX='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_CXX='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; *) archive_cmds_CXX='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_CXX='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; sysv5* | sco3.2v5* | sco5v6*) # Note: We can NOT use -z defs as we might desire, because we do not # link with -lc, and that would cause any symbols used from libc to # always be unresolved, which means just about no library would # ever link correctly. If we're not using GNU ld we use -z text # though, which does catch some bad symbols but isn't as heavy-handed # as -z defs. no_undefined_flag_CXX='${wl}-z,text' allow_undefined_flag_CXX='${wl}-z,nodefs' archive_cmds_need_lc_CXX=no hardcode_shlibpath_var_CXX=no hardcode_libdir_flag_spec_CXX='${wl}-R,$libdir' hardcode_libdir_separator_CXX=':' link_all_deplibs_CXX=yes export_dynamic_flag_spec_CXX='${wl}-Bexport' runpath_var='LD_RUN_PATH' case $cc_basename in CC*) archive_cmds_CXX='$CC -G ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_CXX='$CC -G ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' old_archive_cmds_CXX='$CC -Tprelink_objects $oldobjs~ '"$old_archive_cmds_CXX" reload_cmds_CXX='$CC -Tprelink_objects $reload_objs~ '"$reload_cmds_CXX" ;; *) archive_cmds_CXX='$CC -shared ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' archive_expsym_cmds_CXX='$CC -shared ${wl}-Bexport:$export_symbols ${wl}-h,$soname -o $lib $libobjs $deplibs $compiler_flags' ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac ;; vxworks*) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; *) # FIXME: insert proper C++ library support ld_shlibs_CXX=no ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ld_shlibs_CXX" >&5 $as_echo "$ld_shlibs_CXX" >&6; } test "$ld_shlibs_CXX" = no && can_build_shared=no GCC_CXX="$GXX" LD_CXX="$LD" ## CAVEAT EMPTOR: ## There is no encapsulation within the following macros, do not change ## the running order or otherwise move them around unless you know exactly ## what you are doing... # Dependencies to place before and after the object being linked: predep_objects_CXX= postdep_objects_CXX= predeps_CXX= postdeps_CXX= compiler_lib_search_path_CXX= cat > conftest.$ac_ext <<_LT_EOF class Foo { public: Foo (void) { a = 0; } private: int a; }; _LT_EOF _lt_libdeps_save_CFLAGS=$CFLAGS case "$CC $CFLAGS " in #( *\ -flto*\ *) CFLAGS="$CFLAGS -fno-lto" ;; *\ -fwhopr*\ *) CFLAGS="$CFLAGS -fno-whopr" ;; *\ -fuse-linker-plugin*\ *) CFLAGS="$CFLAGS -fno-use-linker-plugin" ;; esac if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; }; then # Parse the compiler output and extract the necessary # objects, libraries and library flags. # Sentinel used to keep track of whether or not we are before # the conftest object file. pre_test_object_deps_done=no for p in `eval "$output_verbose_link_cmd"`; do case ${prev}${p} in -L* | -R* | -l*) # Some compilers place space between "-{L,R}" and the path. # Remove the space. if test $p = "-L" || test $p = "-R"; then prev=$p continue fi # Expand the sysroot to ease extracting the directories later. if test -z "$prev"; then case $p in -L*) func_stripname_cnf '-L' '' "$p"; prev=-L; p=$func_stripname_result ;; -R*) func_stripname_cnf '-R' '' "$p"; prev=-R; p=$func_stripname_result ;; -l*) func_stripname_cnf '-l' '' "$p"; prev=-l; p=$func_stripname_result ;; esac fi case $p in =*) func_stripname_cnf '=' '' "$p"; p=$lt_sysroot$func_stripname_result ;; esac if test "$pre_test_object_deps_done" = no; then case ${prev} in -L | -R) # Internal compiler library paths should come after those # provided the user. The postdeps already come after the # user supplied libs so there is no need to process them. if test -z "$compiler_lib_search_path_CXX"; then compiler_lib_search_path_CXX="${prev}${p}" else compiler_lib_search_path_CXX="${compiler_lib_search_path_CXX} ${prev}${p}" fi ;; # The "-l" case would never come before the object being # linked, so don't bother handling this case. esac else if test -z "$postdeps_CXX"; then postdeps_CXX="${prev}${p}" else postdeps_CXX="${postdeps_CXX} ${prev}${p}" fi fi prev= ;; *.lto.$objext) ;; # Ignore GCC LTO objects *.$objext) # This assumes that the test object file only shows up # once in the compiler output. if test "$p" = "conftest.$objext"; then pre_test_object_deps_done=yes continue fi if test "$pre_test_object_deps_done" = no; then if test -z "$predep_objects_CXX"; then predep_objects_CXX="$p" else predep_objects_CXX="$predep_objects_CXX $p" fi else if test -z "$postdep_objects_CXX"; then postdep_objects_CXX="$p" else postdep_objects_CXX="$postdep_objects_CXX $p" fi fi ;; *) ;; # Ignore the rest. esac done # Clean up. rm -f a.out a.exe else echo "libtool.m4: error: problem compiling CXX test program" fi $RM -f confest.$objext CFLAGS=$_lt_libdeps_save_CFLAGS # PORTME: override above test on systems where it is broken case $host_os in interix[3-9]*) # Interix 3.5 installs completely hosed .la files for C++, so rather than # hack all around it, let's just trust "g++" to DTRT. predep_objects_CXX= postdep_objects_CXX= postdeps_CXX= ;; linux*) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 # The more standards-conforming stlport4 library is # incompatible with the Cstd library. Avoid specifying # it if it's in CXXFLAGS. Ignore libCrun as # -library=stlport4 depends on it. case " $CXX $CXXFLAGS " in *" -library=stlport4 "*) solaris_use_stlport4=yes ;; esac if test "$solaris_use_stlport4" != yes; then postdeps_CXX='-library=Cstd -library=Crun' fi ;; esac ;; solaris*) case $cc_basename in CC* | sunCC*) # The more standards-conforming stlport4 library is # incompatible with the Cstd library. Avoid specifying # it if it's in CXXFLAGS. Ignore libCrun as # -library=stlport4 depends on it. case " $CXX $CXXFLAGS " in *" -library=stlport4 "*) solaris_use_stlport4=yes ;; esac # Adding this requires a known-good setup of shared libraries for # Sun compiler versions before 5.6, else PIC objects from an old # archive will be linked into the output, leading to subtle bugs. if test "$solaris_use_stlport4" != yes; then postdeps_CXX='-library=Cstd -library=Crun' fi ;; esac ;; esac case " $postdeps_CXX " in *" -lc "*) archive_cmds_need_lc_CXX=no ;; esac compiler_lib_search_dirs_CXX= if test -n "${compiler_lib_search_path_CXX}"; then compiler_lib_search_dirs_CXX=`echo " ${compiler_lib_search_path_CXX}" | ${SED} -e 's! -L! !g' -e 's!^ !!'` fi lt_prog_compiler_wl_CXX= lt_prog_compiler_pic_CXX= lt_prog_compiler_static_CXX= # C++ specific cases for pic, static, wl, etc. if test "$GXX" = yes; then lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_static_CXX='-static' case $host_os in aix*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static_CXX='-Bstatic' fi ;; amigaos*) case $host_cpu in powerpc) # see comment about AmigaOS4 .so support lt_prog_compiler_pic_CXX='-fPIC' ;; m68k) # FIXME: we need at least 68020 code to build shared libraries, but # adding the `-m68020' flag to GCC prevents building anything better, # like `-m68040'. lt_prog_compiler_pic_CXX='-m68020 -resident32 -malways-restore-a4' ;; esac ;; beos* | irix5* | irix6* | nonstopux* | osf3* | osf4* | osf5*) # PIC is the default for these OSes. ;; mingw* | cygwin* | os2* | pw32* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). # Although the cygwin gcc ignores -fPIC, still need this for old-style # (--disable-auto-import) libraries lt_prog_compiler_pic_CXX='-DDLL_EXPORT' ;; darwin* | rhapsody*) # PIC is the default on this platform # Common symbols not allowed in MH_DYLIB files lt_prog_compiler_pic_CXX='-fno-common' ;; *djgpp*) # DJGPP does not support shared libraries at all lt_prog_compiler_pic_CXX= ;; haiku*) # PIC is the default for Haiku. # The "-static" flag exists, but is broken. lt_prog_compiler_static_CXX= ;; interix[3-9]*) # Interix 3.x gcc -fpic/-fPIC options generate broken code. # Instead, we relocate shared libraries at runtime. ;; sysv4*MP*) if test -d /usr/nec; then lt_prog_compiler_pic_CXX=-Kconform_pic fi ;; hpux*) # PIC is the default for 64-bit PA HP-UX, but not for 32-bit # PA HP-UX. On IA64 HP-UX, PIC is the default but the pic flag # sets the default TLS model and affects inlining. case $host_cpu in hppa*64*) ;; *) lt_prog_compiler_pic_CXX='-fPIC' ;; esac ;; *qnx* | *nto*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. lt_prog_compiler_pic_CXX='-fPIC -shared' ;; *) lt_prog_compiler_pic_CXX='-fPIC' ;; esac else case $host_os in aix[4-9]*) # All AIX code is PIC. if test "$host_cpu" = ia64; then # AIX 5 now supports IA64 processor lt_prog_compiler_static_CXX='-Bstatic' else lt_prog_compiler_static_CXX='-bnso -bI:/lib/syscalls.exp' fi ;; chorus*) case $cc_basename in cxch68*) # Green Hills C++ Compiler # _LT_TAGVAR(lt_prog_compiler_static, CXX)="--no_auto_instantiation -u __main -u __premain -u _abort -r $COOL_DIR/lib/libOrb.a $MVME_DIR/lib/CC/libC.a $MVME_DIR/lib/classix/libcx.s.a" ;; esac ;; mingw* | cygwin* | os2* | pw32* | cegcc*) # This hack is so that the source file can tell whether it is being # built for inclusion in a dll (and should export symbols for example). lt_prog_compiler_pic_CXX='-DDLL_EXPORT' ;; dgux*) case $cc_basename in ec++*) lt_prog_compiler_pic_CXX='-KPIC' ;; ghcx*) # Green Hills C++ Compiler lt_prog_compiler_pic_CXX='-pic' ;; *) ;; esac ;; freebsd* | dragonfly*) # FreeBSD uses GNU C++ ;; hpux9* | hpux10* | hpux11*) case $cc_basename in CC*) lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_static_CXX='${wl}-a ${wl}archive' if test "$host_cpu" != ia64; then lt_prog_compiler_pic_CXX='+Z' fi ;; aCC*) lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_static_CXX='${wl}-a ${wl}archive' case $host_cpu in hppa*64*|ia64*) # +Z the default ;; *) lt_prog_compiler_pic_CXX='+Z' ;; esac ;; *) ;; esac ;; interix*) # This is c89, which is MS Visual C++ (no shared libs) # Anyone wants to do a port? ;; irix5* | irix6* | nonstopux*) case $cc_basename in CC*) lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_static_CXX='-non_shared' # CC pic flag -KPIC is the default. ;; *) ;; esac ;; linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) case $cc_basename in KCC*) # KAI C++ Compiler lt_prog_compiler_wl_CXX='--backend -Wl,' lt_prog_compiler_pic_CXX='-fPIC' ;; ecpc* ) # old Intel C++ for x86_64 which still supported -KPIC. lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-KPIC' lt_prog_compiler_static_CXX='-static' ;; icpc* ) # Intel C++, used to be incompatible with GCC. # ICC 10 doesn't accept -KPIC any more. lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-fPIC' lt_prog_compiler_static_CXX='-static' ;; pgCC* | pgcpp*) # Portland Group C++ compiler lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-fpic' lt_prog_compiler_static_CXX='-Bstatic' ;; cxx*) # Compaq C++ # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. lt_prog_compiler_pic_CXX= lt_prog_compiler_static_CXX='-non_shared' ;; xlc* | xlC* | bgxl[cC]* | mpixl[cC]*) # IBM XL 8.0, 9.0 on PPC and BlueGene lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-qpic' lt_prog_compiler_static_CXX='-qstaticlink' ;; *) case `$CC -V 2>&1 | sed 5q` in *Sun\ C*) # Sun C++ 5.9 lt_prog_compiler_pic_CXX='-KPIC' lt_prog_compiler_static_CXX='-Bstatic' lt_prog_compiler_wl_CXX='-Qoption ld ' ;; esac ;; esac ;; lynxos*) ;; m88k*) ;; mvs*) case $cc_basename in cxx*) lt_prog_compiler_pic_CXX='-W c,exportall' ;; *) ;; esac ;; netbsd* | netbsdelf*-gnu) ;; *qnx* | *nto*) # QNX uses GNU C++, but need to define -shared option too, otherwise # it will coredump. lt_prog_compiler_pic_CXX='-fPIC -shared' ;; osf3* | osf4* | osf5*) case $cc_basename in KCC*) lt_prog_compiler_wl_CXX='--backend -Wl,' ;; RCC*) # Rational C++ 2.4.1 lt_prog_compiler_pic_CXX='-pic' ;; cxx*) # Digital/Compaq C++ lt_prog_compiler_wl_CXX='-Wl,' # Make sure the PIC flag is empty. It appears that all Alpha # Linux and Compaq Tru64 Unix objects are PIC. lt_prog_compiler_pic_CXX= lt_prog_compiler_static_CXX='-non_shared' ;; *) ;; esac ;; psos*) ;; solaris*) case $cc_basename in CC* | sunCC*) # Sun C++ 4.2, 5.x and Centerline C++ lt_prog_compiler_pic_CXX='-KPIC' lt_prog_compiler_static_CXX='-Bstatic' lt_prog_compiler_wl_CXX='-Qoption ld ' ;; gcx*) # Green Hills C++ Compiler lt_prog_compiler_pic_CXX='-PIC' ;; *) ;; esac ;; sunos4*) case $cc_basename in CC*) # Sun C++ 4.x lt_prog_compiler_pic_CXX='-pic' lt_prog_compiler_static_CXX='-Bstatic' ;; lcc*) # Lucid lt_prog_compiler_pic_CXX='-pic' ;; *) ;; esac ;; sysv5* | unixware* | sco3.2v5* | sco5v6* | OpenUNIX*) case $cc_basename in CC*) lt_prog_compiler_wl_CXX='-Wl,' lt_prog_compiler_pic_CXX='-KPIC' lt_prog_compiler_static_CXX='-Bstatic' ;; esac ;; tandem*) case $cc_basename in NCC*) # NonStop-UX NCC 3.20 lt_prog_compiler_pic_CXX='-KPIC' ;; *) ;; esac ;; vxworks*) ;; *) lt_prog_compiler_can_build_shared_CXX=no ;; esac fi case $host_os in # For platforms which do not support PIC, -DPIC is meaningless: *djgpp*) lt_prog_compiler_pic_CXX= ;; *) lt_prog_compiler_pic_CXX="$lt_prog_compiler_pic_CXX -DPIC" ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $compiler option to produce PIC" >&5 $as_echo_n "checking for $compiler option to produce PIC... " >&6; } if ${lt_cv_prog_compiler_pic_CXX+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_pic_CXX=$lt_prog_compiler_pic_CXX fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic_CXX" >&5 $as_echo "$lt_cv_prog_compiler_pic_CXX" >&6; } lt_prog_compiler_pic_CXX=$lt_cv_prog_compiler_pic_CXX # # Check to make sure the PIC flag actually works. # if test -n "$lt_prog_compiler_pic_CXX"; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler PIC flag $lt_prog_compiler_pic_CXX works" >&5 $as_echo_n "checking if $compiler PIC flag $lt_prog_compiler_pic_CXX works... " >&6; } if ${lt_cv_prog_compiler_pic_works_CXX+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_pic_works_CXX=no ac_outfile=conftest.$ac_objext echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="$lt_prog_compiler_pic_CXX -DPIC" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. # The option is referenced via a variable to avoid confusing sed. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5) (eval "$lt_compile" 2>conftest.err) ac_status=$? cat conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 if (exit $ac_status) && test -s "$ac_outfile"; then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings other than the usual output. $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' >conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if test ! -s conftest.er2 || diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_pic_works_CXX=yes fi fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_pic_works_CXX" >&5 $as_echo "$lt_cv_prog_compiler_pic_works_CXX" >&6; } if test x"$lt_cv_prog_compiler_pic_works_CXX" = xyes; then case $lt_prog_compiler_pic_CXX in "" | " "*) ;; *) lt_prog_compiler_pic_CXX=" $lt_prog_compiler_pic_CXX" ;; esac else lt_prog_compiler_pic_CXX= lt_prog_compiler_can_build_shared_CXX=no fi fi # # Check to make sure the static flag actually works. # wl=$lt_prog_compiler_wl_CXX eval lt_tmp_static_flag=\"$lt_prog_compiler_static_CXX\" { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler static flag $lt_tmp_static_flag works" >&5 $as_echo_n "checking if $compiler static flag $lt_tmp_static_flag works... " >&6; } if ${lt_cv_prog_compiler_static_works_CXX+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_static_works_CXX=no save_LDFLAGS="$LDFLAGS" LDFLAGS="$LDFLAGS $lt_tmp_static_flag" echo "$lt_simple_link_test_code" > conftest.$ac_ext if (eval $ac_link 2>conftest.err) && test -s conftest$ac_exeext; then # The linker can only warn and ignore the option if not recognized # So say no if there are warnings if test -s conftest.err; then # Append any errors to the config.log. cat conftest.err 1>&5 $ECHO "$_lt_linker_boilerplate" | $SED '/^$/d' > conftest.exp $SED '/^$/d; /^ *+/d' conftest.err >conftest.er2 if diff conftest.exp conftest.er2 >/dev/null; then lt_cv_prog_compiler_static_works_CXX=yes fi else lt_cv_prog_compiler_static_works_CXX=yes fi fi $RM -r conftest* LDFLAGS="$save_LDFLAGS" fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_static_works_CXX" >&5 $as_echo "$lt_cv_prog_compiler_static_works_CXX" >&6; } if test x"$lt_cv_prog_compiler_static_works_CXX" = xyes; then : else lt_prog_compiler_static_CXX= fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5 $as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; } if ${lt_cv_prog_compiler_c_o_CXX+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_c_o_CXX=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o_CXX=yes fi fi chmod u+w . 2>&5 $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o_CXX" >&5 $as_echo "$lt_cv_prog_compiler_c_o_CXX" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: checking if $compiler supports -c -o file.$ac_objext" >&5 $as_echo_n "checking if $compiler supports -c -o file.$ac_objext... " >&6; } if ${lt_cv_prog_compiler_c_o_CXX+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_prog_compiler_c_o_CXX=no $RM -r conftest 2>/dev/null mkdir conftest cd conftest mkdir out echo "$lt_simple_compile_test_code" > conftest.$ac_ext lt_compiler_flag="-o out/conftest2.$ac_objext" # Insert the option either (1) after the last *FLAGS variable, or # (2) before a word containing "conftest.", or (3) at the end. # Note that $ac_compile itself does not contain backslashes and begins # with a dollar sign (not a hyphen), so the echo should work correctly. lt_compile=`echo "$ac_compile" | $SED \ -e 's:.*FLAGS}\{0,1\} :&$lt_compiler_flag :; t' \ -e 's: [^ ]*conftest\.: $lt_compiler_flag&:; t' \ -e 's:$: $lt_compiler_flag:'` (eval echo "\"\$as_me:$LINENO: $lt_compile\"" >&5) (eval "$lt_compile" 2>out/conftest.err) ac_status=$? cat out/conftest.err >&5 echo "$as_me:$LINENO: \$? = $ac_status" >&5 if (exit $ac_status) && test -s out/conftest2.$ac_objext then # The compiler can only warn and ignore the option if not recognized # So say no if there are warnings $ECHO "$_lt_compiler_boilerplate" | $SED '/^$/d' > out/conftest.exp $SED '/^$/d; /^ *+/d' out/conftest.err >out/conftest.er2 if test ! -s out/conftest.er2 || diff out/conftest.exp out/conftest.er2 >/dev/null; then lt_cv_prog_compiler_c_o_CXX=yes fi fi chmod u+w . 2>&5 $RM conftest* # SGI C++ compiler will create directory out/ii_files/ for # template instantiation test -d out/ii_files && $RM out/ii_files/* && rmdir out/ii_files $RM out/* && rmdir out cd .. $RM -r conftest $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_prog_compiler_c_o_CXX" >&5 $as_echo "$lt_cv_prog_compiler_c_o_CXX" >&6; } hard_links="nottested" if test "$lt_cv_prog_compiler_c_o_CXX" = no && test "$need_locks" != no; then # do not overwrite the value of need_locks provided by the user { $as_echo "$as_me:${as_lineno-$LINENO}: checking if we can lock with hard links" >&5 $as_echo_n "checking if we can lock with hard links... " >&6; } hard_links=yes $RM conftest* ln conftest.a conftest.b 2>/dev/null && hard_links=no touch conftest.a ln conftest.a conftest.b 2>&5 || hard_links=no ln conftest.a conftest.b 2>/dev/null && hard_links=no { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hard_links" >&5 $as_echo "$hard_links" >&6; } if test "$hard_links" = no; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&5 $as_echo "$as_me: WARNING: \`$CC' does not support \`-c -o', so \`make -j' may be unsafe" >&2;} need_locks=warn fi else need_locks=no fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether the $compiler linker ($LD) supports shared libraries" >&5 $as_echo_n "checking whether the $compiler linker ($LD) supports shared libraries... " >&6; } export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' exclude_expsyms_CXX='_GLOBAL_OFFSET_TABLE_|_GLOBAL__F[ID]_.*' case $host_os in aix[4-9]*) # If we're using GNU nm, then we don't want the "-C" option. # -C means demangle to AIX nm, but means don't demangle with GNU nm # Also, AIX nm treats weak defined symbols like other global defined # symbols, whereas GNU nm marks them as "W". if $NM -V 2>&1 | $GREP 'GNU' > /dev/null; then export_symbols_cmds_CXX='$NM -Bpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B") || (\$ 2 == "W")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' else export_symbols_cmds_CXX='$NM -BCpg $libobjs $convenience | awk '\''{ if (((\$ 2 == "T") || (\$ 2 == "D") || (\$ 2 == "B")) && (substr(\$ 3,1,1) != ".")) { print \$ 3 } }'\'' | sort -u > $export_symbols' fi ;; pw32*) export_symbols_cmds_CXX="$ltdll_cmds" ;; cygwin* | mingw* | cegcc*) case $cc_basename in cl*) exclude_expsyms_CXX='_NULL_IMPORT_DESCRIPTOR|_IMPORT_DESCRIPTOR_.*' ;; *) export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED -e '\''/^[BCDGRS][ ]/s/.*[ ]\([^ ]*\)/\1 DATA/;s/^.*[ ]__nm__\([^ ]*\)[ ][^ ]*/\1 DATA/;/^I[ ]/d;/^[AITW][ ]/s/.* //'\'' | sort | uniq > $export_symbols' exclude_expsyms_CXX='[_]+GLOBAL_OFFSET_TABLE_|[_]+GLOBAL__[FID]_.*|[_]+head_[A-Za-z0-9_]+_dll|[A-Za-z0-9_]+_dll_iname' ;; esac ;; linux* | k*bsd*-gnu | gnu*) link_all_deplibs_CXX=no ;; *) export_symbols_cmds_CXX='$NM $libobjs $convenience | $global_symbol_pipe | $SED '\''s/.* //'\'' | sort | uniq > $export_symbols' ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ld_shlibs_CXX" >&5 $as_echo "$ld_shlibs_CXX" >&6; } test "$ld_shlibs_CXX" = no && can_build_shared=no with_gnu_ld_CXX=$with_gnu_ld # # Do we need to explicitly link libc? # case "x$archive_cmds_need_lc_CXX" in x|xyes) # Assume -lc should be added archive_cmds_need_lc_CXX=yes if test "$enable_shared" = yes && test "$GCC" = yes; then case $archive_cmds_CXX in *'~'*) # FIXME: we may have to deal with multi-command sequences. ;; '$CC '*) # Test whether the compiler implicitly links with -lc since on some # systems, -lgcc has to come before -lc. If gcc already passes -lc # to ld, don't add -lc before -lgcc. { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether -lc should be explicitly linked in" >&5 $as_echo_n "checking whether -lc should be explicitly linked in... " >&6; } if ${lt_cv_archive_cmds_need_lc_CXX+:} false; then : $as_echo_n "(cached) " >&6 else $RM conftest* echo "$lt_simple_compile_test_code" > conftest.$ac_ext if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_compile\""; } >&5 (eval $ac_compile) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } 2>conftest.err; then soname=conftest lib=conftest libobjs=conftest.$ac_objext deplibs= wl=$lt_prog_compiler_wl_CXX pic_flag=$lt_prog_compiler_pic_CXX compiler_flags=-v linker_flags=-v verstring= output_objdir=. libname=conftest lt_save_allow_undefined_flag=$allow_undefined_flag_CXX allow_undefined_flag_CXX= if { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$archive_cmds_CXX 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1\""; } >&5 (eval $archive_cmds_CXX 2\>\&1 \| $GREP \" -lc \" \>/dev/null 2\>\&1) 2>&5 ac_status=$? $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } then lt_cv_archive_cmds_need_lc_CXX=no else lt_cv_archive_cmds_need_lc_CXX=yes fi allow_undefined_flag_CXX=$lt_save_allow_undefined_flag else cat conftest.err 1>&5 fi $RM conftest* fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $lt_cv_archive_cmds_need_lc_CXX" >&5 $as_echo "$lt_cv_archive_cmds_need_lc_CXX" >&6; } archive_cmds_need_lc_CXX=$lt_cv_archive_cmds_need_lc_CXX ;; esac fi ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: checking dynamic linker characteristics" >&5 $as_echo_n "checking dynamic linker characteristics... " >&6; } library_names_spec= libname_spec='lib$name' soname_spec= shrext_cmds=".so" postinstall_cmds= postuninstall_cmds= finish_cmds= finish_eval= shlibpath_var= shlibpath_overrides_runpath=unknown version_type=none dynamic_linker="$host_os ld.so" sys_lib_dlsearch_path_spec="/lib /usr/lib" need_lib_prefix=unknown hardcode_into_libs=no # when you set need_version to no, make sure it does not cause -set_version # flags to be left without arguments need_version=unknown case $host_os in aix3*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='${libname}${release}${shared_ext}$versuffix $libname.a' shlibpath_var=LIBPATH # AIX 3 has no versioning support, so we append a major version to the name. soname_spec='${libname}${release}${shared_ext}$major' ;; aix[4-9]*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no hardcode_into_libs=yes if test "$host_cpu" = ia64; then # AIX 5 supports IA64 library_names_spec='${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext}$versuffix $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH else # With GCC up to 2.95.x, collect2 would create an import file # for dependence libraries. The import file would start with # the line `#! .'. This would cause the generated library to # depend on `.', always an invalid library. This was fixed in # development snapshots of GCC prior to 3.0. case $host_os in aix4 | aix4.[01] | aix4.[01].*) if { echo '#if __GNUC__ > 2 || (__GNUC__ == 2 && __GNUC_MINOR__ >= 97)' echo ' yes ' echo '#endif'; } | ${CC} -E - | $GREP yes > /dev/null; then : else can_build_shared=no fi ;; esac # AIX (on Power*) has no versioning support, so currently we can not hardcode correct # soname into executable. Probably we can add versioning support to # collect2, so additional links can be useful in future. if test "$aix_use_runtimelinking" = yes; then # If using run time linking (on AIX 4.2 or later) use lib.so # instead of lib.a to let people know that these are not # typical AIX shared libraries. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' else # We preserve .a as extension for shared libraries through AIX4.2 # and later when we are not doing run time linking. library_names_spec='${libname}${release}.a $libname.a' soname_spec='${libname}${release}${shared_ext}$major' fi shlibpath_var=LIBPATH fi ;; amigaos*) case $host_cpu in powerpc) # Since July 2007 AmigaOS4 officially supports .so libraries. # When compiling the executable, add -use-dynld -Lsobjs: to the compileline. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' ;; m68k) library_names_spec='$libname.ixlibrary $libname.a' # Create ${libname}_ixlibrary.a entries in /sys/libs. finish_eval='for lib in `ls $libdir/*.ixlibrary 2>/dev/null`; do libname=`func_echo_all "$lib" | $SED '\''s%^.*/\([^/]*\)\.ixlibrary$%\1%'\''`; test $RM /sys/libs/${libname}_ixlibrary.a; $show "cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a"; cd /sys/libs && $LN_S $lib ${libname}_ixlibrary.a || exit 1; done' ;; esac ;; beos*) library_names_spec='${libname}${shared_ext}' dynamic_linker="$host_os ld.so" shlibpath_var=LIBRARY_PATH ;; bsdi[45]*) version_type=linux # correct to gnu/linux during the next big refactor need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/shlib /usr/lib /usr/X11/lib /usr/contrib/lib /lib /usr/local/lib" sys_lib_dlsearch_path_spec="/shlib /usr/lib /usr/local/lib" # the default ld.so.conf also contains /usr/contrib/lib and # /usr/X11R6/lib (/usr/X11 is a link to /usr/X11R6), but let us allow # libtool to hard-code these into programs ;; cygwin* | mingw* | pw32* | cegcc*) version_type=windows shrext_cmds=".dll" need_version=no need_lib_prefix=no case $GCC,$cc_basename in yes,*) # gcc library_names_spec='$libname.dll.a' # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \${file}`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname~ chmod a+x \$dldir/$dlname~ if test -n '\''$stripme'\'' && test -n '\''$striplib'\''; then eval '\''$striplib \$dldir/$dlname'\'' || exit \$?; fi' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes case $host_os in cygwin*) # Cygwin DLLs use 'cyg' prefix rather than 'lib' soname_spec='`echo ${libname} | sed -e 's/^lib/cyg/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' ;; mingw* | cegcc*) # MinGW DLLs use traditional 'lib' prefix soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' ;; pw32*) # pw32 DLLs use 'pw' prefix rather than 'lib' library_names_spec='`echo ${libname} | sed -e 's/^lib/pw/'``echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' ;; esac dynamic_linker='Win32 ld.exe' ;; *,cl*) # Native MSVC libname_spec='$name' soname_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext}' library_names_spec='${libname}.dll.lib' case $build_os in mingw*) sys_lib_search_path_spec= lt_save_ifs=$IFS IFS=';' for lt_path in $LIB do IFS=$lt_save_ifs # Let DOS variable expansion print the short 8.3 style file name. lt_path=`cd "$lt_path" 2>/dev/null && cmd //C "for %i in (".") do @echo %~si"` sys_lib_search_path_spec="$sys_lib_search_path_spec $lt_path" done IFS=$lt_save_ifs # Convert to MSYS style. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | sed -e 's|\\\\|/|g' -e 's| \\([a-zA-Z]\\):| /\\1|g' -e 's|^ ||'` ;; cygwin*) # Convert to unix form, then to dos form, then back to unix form # but this time dos style (no spaces!) so that the unix form looks # like /cygdrive/c/PROGRA~1:/cygdr... sys_lib_search_path_spec=`cygpath --path --unix "$LIB"` sys_lib_search_path_spec=`cygpath --path --dos "$sys_lib_search_path_spec" 2>/dev/null` sys_lib_search_path_spec=`cygpath --path --unix "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` ;; *) sys_lib_search_path_spec="$LIB" if $ECHO "$sys_lib_search_path_spec" | $GREP ';[c-zC-Z]:/' >/dev/null; then # It is most probably a Windows format PATH. sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e 's/;/ /g'` else sys_lib_search_path_spec=`$ECHO "$sys_lib_search_path_spec" | $SED -e "s/$PATH_SEPARATOR/ /g"` fi # FIXME: find the short name or the path components, as spaces are # common. (e.g. "Program Files" -> "PROGRA~1") ;; esac # DLL is installed to $(libdir)/../bin by postinstall_cmds postinstall_cmds='base_file=`basename \${file}`~ dlpath=`$SHELL 2>&1 -c '\''. $dir/'\''\${base_file}'\''i; echo \$dlname'\''`~ dldir=$destdir/`dirname \$dlpath`~ test -d \$dldir || mkdir -p \$dldir~ $install_prog $dir/$dlname \$dldir/$dlname' postuninstall_cmds='dldll=`$SHELL 2>&1 -c '\''. $file; echo \$dlname'\''`~ dlpath=$dir/\$dldll~ $RM \$dlpath' shlibpath_overrides_runpath=yes dynamic_linker='Win32 link.exe' ;; *) # Assume MSVC wrapper library_names_spec='${libname}`echo ${release} | $SED -e 's/[.]/-/g'`${versuffix}${shared_ext} $libname.lib' dynamic_linker='Win32 ld.exe' ;; esac # FIXME: first we should search . and the directory the executable is in shlibpath_var=PATH ;; darwin* | rhapsody*) dynamic_linker="$host_os dyld" version_type=darwin need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${major}$shared_ext ${libname}$shared_ext' soname_spec='${libname}${release}${major}$shared_ext' shlibpath_overrides_runpath=yes shlibpath_var=DYLD_LIBRARY_PATH shrext_cmds='`test .$module = .yes && echo .so || echo .dylib`' sys_lib_dlsearch_path_spec='/usr/local/lib /lib /usr/lib' ;; dgux*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname$shared_ext' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; freebsd* | dragonfly*) # DragonFly does not have aout. When/if they implement a new # versioning mechanism, adjust this. if test -x /usr/bin/objformat; then objformat=`/usr/bin/objformat` else case $host_os in freebsd[23].*) objformat=aout ;; *) objformat=elf ;; esac fi version_type=freebsd-$objformat case $version_type in freebsd-elf*) library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' need_version=no need_lib_prefix=no ;; freebsd-*) library_names_spec='${libname}${release}${shared_ext}$versuffix $libname${shared_ext}$versuffix' need_version=yes ;; esac shlibpath_var=LD_LIBRARY_PATH case $host_os in freebsd2.*) shlibpath_overrides_runpath=yes ;; freebsd3.[01]* | freebsdelf3.[01]*) shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; freebsd3.[2-9]* | freebsdelf3.[2-9]* | \ freebsd4.[0-5] | freebsdelf4.[0-5] | freebsd4.1.1 | freebsdelf4.1.1) shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; *) # from 4.6 on, and DragonFly shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; esac ;; haiku*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no dynamic_linker="$host_os runtime_loader" library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}${major} ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LIBRARY_PATH shlibpath_overrides_runpath=yes sys_lib_dlsearch_path_spec='/boot/home/config/lib /boot/common/lib /boot/system/lib' hardcode_into_libs=yes ;; hpux9* | hpux10* | hpux11*) # Give a soname corresponding to the major version so that dld.sl refuses to # link against other versions. version_type=sunos need_lib_prefix=no need_version=no case $host_cpu in ia64*) shrext_cmds='.so' hardcode_into_libs=yes dynamic_linker="$host_os dld.so" shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' if test "X$HPUX_IA64_MODE" = X32; then sys_lib_search_path_spec="/usr/lib/hpux32 /usr/local/lib/hpux32 /usr/local/lib" else sys_lib_search_path_spec="/usr/lib/hpux64 /usr/local/lib/hpux64" fi sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; hppa*64*) shrext_cmds='.sl' hardcode_into_libs=yes dynamic_linker="$host_os dld.sl" shlibpath_var=LD_LIBRARY_PATH # How should we handle SHLIB_PATH shlibpath_overrides_runpath=yes # Unless +noenvvar is specified. library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' sys_lib_search_path_spec="/usr/lib/pa20_64 /usr/ccs/lib/pa20_64" sys_lib_dlsearch_path_spec=$sys_lib_search_path_spec ;; *) shrext_cmds='.sl' dynamic_linker="$host_os dld.sl" shlibpath_var=SHLIB_PATH shlibpath_overrides_runpath=no # +s is required to enable SHLIB_PATH library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' ;; esac # HP-UX runs *really* slowly unless shared libraries are mode 555, ... postinstall_cmds='chmod 555 $lib' # or fails outright, so override atomically: install_override_mode=555 ;; interix[3-9]*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='Interix 3.x ld.so.1 (PE, like ELF)' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; irix5* | irix6* | nonstopux*) case $host_os in nonstopux*) version_type=nonstopux ;; *) if test "$lt_cv_prog_gnu_ld" = yes; then version_type=linux # correct to gnu/linux during the next big refactor else version_type=irix fi ;; esac need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${release}${shared_ext} $libname${shared_ext}' case $host_os in irix5* | nonstopux*) libsuff= shlibsuff= ;; *) case $LD in # libtool.m4 will add one of these switches to LD *-32|*"-32 "|*-melf32bsmip|*"-melf32bsmip ") libsuff= shlibsuff= libmagic=32-bit;; *-n32|*"-n32 "|*-melf32bmipn32|*"-melf32bmipn32 ") libsuff=32 shlibsuff=N32 libmagic=N32;; *-64|*"-64 "|*-melf64bmip|*"-melf64bmip ") libsuff=64 shlibsuff=64 libmagic=64-bit;; *) libsuff= shlibsuff= libmagic=never-match;; esac ;; esac shlibpath_var=LD_LIBRARY${shlibsuff}_PATH shlibpath_overrides_runpath=no sys_lib_search_path_spec="/usr/lib${libsuff} /lib${libsuff} /usr/local/lib${libsuff}" sys_lib_dlsearch_path_spec="/usr/lib${libsuff} /lib${libsuff}" hardcode_into_libs=yes ;; # No shared lib support for Linux oldld, aout, or coff. linux*oldld* | linux*aout* | linux*coff*) dynamic_linker=no ;; # This must be glibc/ELF. linux* | k*bsd*-gnu | kopensolaris*-gnu | gnu*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' finish_cmds='PATH="\$PATH:/sbin" ldconfig -n $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no # Some binutils ld are patched to set DT_RUNPATH if ${lt_cv_shlibpath_overrides_runpath+:} false; then : $as_echo_n "(cached) " >&6 else lt_cv_shlibpath_overrides_runpath=no save_LDFLAGS=$LDFLAGS save_libdir=$libdir eval "libdir=/foo; wl=\"$lt_prog_compiler_wl_CXX\"; \ LDFLAGS=\"\$LDFLAGS $hardcode_libdir_flag_spec_CXX\"" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_cxx_try_link "$LINENO"; then : if ($OBJDUMP -p conftest$ac_exeext) 2>/dev/null | grep "RUNPATH.*$libdir" >/dev/null; then : lt_cv_shlibpath_overrides_runpath=yes fi fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LDFLAGS=$save_LDFLAGS libdir=$save_libdir fi shlibpath_overrides_runpath=$lt_cv_shlibpath_overrides_runpath # This implies no fast_install, which is unacceptable. # Some rework will be needed to allow for fast_install # before this can be enabled. hardcode_into_libs=yes # Append ld.so.conf contents to the search path if test -f /etc/ld.so.conf; then lt_ld_extra=`awk '/^include / { system(sprintf("cd /etc; cat %s 2>/dev/null", \$2)); skip = 1; } { if (!skip) print \$0; skip = 0; }' < /etc/ld.so.conf | $SED -e 's/#.*//;/^[ ]*hwcap[ ]/d;s/[:, ]/ /g;s/=[^=]*$//;s/=[^= ]* / /g;s/"//g;/^$/d' | tr '\n' ' '` sys_lib_dlsearch_path_spec="/lib /usr/lib $lt_ld_extra" fi # We used to test for /lib/ld.so.1 and disable shared libraries on # powerpc, because MkLinux only supported shared libraries with the # GNU dynamic linker. Since this was broken with cross compilers, # most powerpc-linux boxes support dynamic linking these days and # people can always --disable-shared, the test was removed, and we # assume the GNU/Linux dynamic linker is in use. dynamic_linker='GNU/Linux ld.so' ;; netbsdelf*-gnu) version_type=linux need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='NetBSD ld.elf_so' ;; netbsd*) version_type=sunos need_lib_prefix=no need_version=no if echo __ELF__ | $CC -E - | $GREP __ELF__ >/dev/null; then library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' dynamic_linker='NetBSD (a.out) ld.so' else library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major ${libname}${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' dynamic_linker='NetBSD ld.elf_so' fi shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes ;; newsos6) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes ;; *nto* | *qnx*) version_type=qnx need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes dynamic_linker='ldqnx.so' ;; openbsd*) version_type=sunos sys_lib_dlsearch_path_spec="/usr/lib" need_lib_prefix=no # Some older versions of OpenBSD (3.3 at least) *do* need versioned libs. case $host_os in openbsd3.3 | openbsd3.3.*) need_version=yes ;; *) need_version=no ;; esac library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/sbin" ldconfig -m $libdir' shlibpath_var=LD_LIBRARY_PATH if test -z "`echo __ELF__ | $CC -E - | $GREP __ELF__`" || test "$host_os-$host_cpu" = "openbsd2.8-powerpc"; then case $host_os in openbsd2.[89] | openbsd2.[89].*) shlibpath_overrides_runpath=no ;; *) shlibpath_overrides_runpath=yes ;; esac else shlibpath_overrides_runpath=yes fi ;; os2*) libname_spec='$name' shrext_cmds=".dll" need_lib_prefix=no library_names_spec='$libname${shared_ext} $libname.a' dynamic_linker='OS/2 ld.exe' shlibpath_var=LIBPATH ;; osf3* | osf4* | osf5*) version_type=osf need_lib_prefix=no need_version=no soname_spec='${libname}${release}${shared_ext}$major' library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH sys_lib_search_path_spec="/usr/shlib /usr/ccs/lib /usr/lib/cmplrs/cc /usr/lib /usr/local/lib /var/shlib" sys_lib_dlsearch_path_spec="$sys_lib_search_path_spec" ;; rdos*) dynamic_linker=no ;; solaris*) version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes # ldd complains unless libraries are executable postinstall_cmds='chmod +x $lib' ;; sunos4*) version_type=sunos library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${shared_ext}$versuffix' finish_cmds='PATH="\$PATH:/usr/etc" ldconfig $libdir' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes if test "$with_gnu_ld" = yes; then need_lib_prefix=no fi need_version=yes ;; sysv4 | sysv4.3*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH case $host_vendor in sni) shlibpath_overrides_runpath=no need_lib_prefix=no runpath_var=LD_RUN_PATH ;; siemens) need_lib_prefix=no ;; motorola) need_lib_prefix=no need_version=no shlibpath_overrides_runpath=no sys_lib_search_path_spec='/lib /usr/lib /usr/ccs/lib' ;; esac ;; sysv4*MP*) if test -d /usr/nec ;then version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='$libname${shared_ext}.$versuffix $libname${shared_ext}.$major $libname${shared_ext}' soname_spec='$libname${shared_ext}.$major' shlibpath_var=LD_LIBRARY_PATH fi ;; sysv5* | sco3.2v5* | sco5v6* | unixware* | OpenUNIX* | sysv4*uw2*) version_type=freebsd-elf need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext} $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=yes hardcode_into_libs=yes if test "$with_gnu_ld" = yes; then sys_lib_search_path_spec='/usr/local/lib /usr/gnu/lib /usr/ccs/lib /usr/lib /lib' else sys_lib_search_path_spec='/usr/ccs/lib /usr/lib' case $host_os in sco3.2v5*) sys_lib_search_path_spec="$sys_lib_search_path_spec /lib" ;; esac fi sys_lib_dlsearch_path_spec='/usr/lib' ;; tpf*) # TPF is a cross-target only. Preferred cross-host = GNU/Linux. version_type=linux # correct to gnu/linux during the next big refactor need_lib_prefix=no need_version=no library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' shlibpath_var=LD_LIBRARY_PATH shlibpath_overrides_runpath=no hardcode_into_libs=yes ;; uts4*) version_type=linux # correct to gnu/linux during the next big refactor library_names_spec='${libname}${release}${shared_ext}$versuffix ${libname}${release}${shared_ext}$major $libname${shared_ext}' soname_spec='${libname}${release}${shared_ext}$major' shlibpath_var=LD_LIBRARY_PATH ;; *) dynamic_linker=no ;; esac { $as_echo "$as_me:${as_lineno-$LINENO}: result: $dynamic_linker" >&5 $as_echo "$dynamic_linker" >&6; } test "$dynamic_linker" = no && can_build_shared=no variables_saved_for_relink="PATH $shlibpath_var $runpath_var" if test "$GCC" = yes; then variables_saved_for_relink="$variables_saved_for_relink GCC_EXEC_PREFIX COMPILER_PATH LIBRARY_PATH" fi if test "${lt_cv_sys_lib_search_path_spec+set}" = set; then sys_lib_search_path_spec="$lt_cv_sys_lib_search_path_spec" fi if test "${lt_cv_sys_lib_dlsearch_path_spec+set}" = set; then sys_lib_dlsearch_path_spec="$lt_cv_sys_lib_dlsearch_path_spec" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking how to hardcode library paths into programs" >&5 $as_echo_n "checking how to hardcode library paths into programs... " >&6; } hardcode_action_CXX= if test -n "$hardcode_libdir_flag_spec_CXX" || test -n "$runpath_var_CXX" || test "X$hardcode_automatic_CXX" = "Xyes" ; then # We can hardcode non-existent directories. if test "$hardcode_direct_CXX" != no && # If the only mechanism to avoid hardcoding is shlibpath_var, we # have to relink, otherwise we might link with an installed library # when we should be linking with a yet-to-be-installed one ## test "$_LT_TAGVAR(hardcode_shlibpath_var, CXX)" != no && test "$hardcode_minus_L_CXX" != no; then # Linking always hardcodes the temporary library directory. hardcode_action_CXX=relink else # We can link without hardcoding, and we can hardcode nonexisting dirs. hardcode_action_CXX=immediate fi else # We cannot hardcode anything, or else we can only hardcode existing # directories. hardcode_action_CXX=unsupported fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $hardcode_action_CXX" >&5 $as_echo "$hardcode_action_CXX" >&6; } if test "$hardcode_action_CXX" = relink || test "$inherit_rpath_CXX" = yes; then # Fast installation is not supported enable_fast_install=no elif test "$shlibpath_overrides_runpath" = yes || test "$enable_shared" = no; then # Fast installation is not necessary enable_fast_install=needless fi fi # test -n "$compiler" CC=$lt_save_CC CFLAGS=$lt_save_CFLAGS LDCXX=$LD LD=$lt_save_LD GCC=$lt_save_GCC with_gnu_ld=$lt_save_with_gnu_ld lt_cv_path_LDCXX=$lt_cv_path_LD lt_cv_path_LD=$lt_save_path_LD lt_cv_prog_gnu_ldcxx=$lt_cv_prog_gnu_ld lt_cv_prog_gnu_ld=$lt_save_with_gnu_ld fi # test "$_lt_caught_CXX_error" != yes ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu ac_config_commands="$ac_config_commands libtool" # Only expand once: #CHECK for standard c++ libs (and include the linkind directives...) { $as_echo "$as_me:${as_lineno-$LINENO}: checking for __cxa_free_exception in -lstdc++" >&5 $as_echo_n "checking for __cxa_free_exception in -lstdc++... " >&6; } if ${ac_cv_lib_stdcpp___cxa_free_exception+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lstdc++ $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char __cxa_free_exception (); int main () { return __cxa_free_exception (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_stdcpp___cxa_free_exception=yes else ac_cv_lib_stdcpp___cxa_free_exception=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_stdcpp___cxa_free_exception" >&5 $as_echo "$ac_cv_lib_stdcpp___cxa_free_exception" >&6; } if test "x$ac_cv_lib_stdcpp___cxa_free_exception" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_LIBSTDC__ 1 _ACEOF LIBS="-lstdc++ $LIBS" fi # defining the libs doesn't work... # Don't check nor include lp-solve anymore until Tony Cassandra's code # has been updated for using the system-wide lp-solve #AC_CHECK_HEADER( # [lpsolve/lp_types.h], # [AC_DEFINE([HAVE_LPSOLVE], [],[lpsolve available])]) # [AC_DEFINE([HAVE_LPSOLVE], [],[lpsolve available]) LPSOLVE_LIB="/usr/lib/liblpsolve55_pic.a" LPSOLVE_LD="-lcolamd -ldl"]) # IMPORTANT; check for math lib before lpsolve, otherwise lpsolve will fail (it needs '-lm') { $as_echo "$as_me:${as_lineno-$LINENO}: checking for main in -lm" >&5 $as_echo_n "checking for main in -lm... " >&6; } if ${ac_cv_lib_m_main+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lm $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { return main (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_m_main=yes else ac_cv_lib_m_main=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_m_main" >&5 $as_echo "$ac_cv_lib_m_main" >&6; } if test "x$ac_cv_lib_m_main" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_LIBM 1 _ACEOF LIBS="-lm $LIBS" fi # check for lpsolve ac_fn_c_check_header_mongrel "$LINENO" "lpsolve/lp_lib.h" "ac_cv_header_lpsolve_lp_lib_h" "$ac_includes_default" if test "x$ac_cv_header_lpsolve_lp_lib_h" = xyes; then : else { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: lpsolve not installed, required for pruning POMDP value functions" >&5 $as_echo "$as_me: WARNING: lpsolve not installed, required for pruning POMDP value functions" >&2;} fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for dlopen in -ldl" >&5 $as_echo_n "checking for dlopen in -ldl... " >&6; } if ${ac_cv_lib_dl_dlopen+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-ldl $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char dlopen (); int main () { return dlopen (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_dl_dlopen=yes else ac_cv_lib_dl_dlopen=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_dl_dlopen" >&5 $as_echo "$ac_cv_lib_dl_dlopen" >&6; } if test "x$ac_cv_lib_dl_dlopen" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_LIBDL 1 _ACEOF LIBS="-ldl $LIBS" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for colamd in -lcolamd" >&5 $as_echo_n "checking for colamd in -lcolamd... " >&6; } if ${ac_cv_lib_colamd_colamd+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lcolamd $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char colamd (); int main () { return colamd (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_colamd_colamd=yes else ac_cv_lib_colamd_colamd=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_colamd_colamd" >&5 $as_echo "$ac_cv_lib_colamd_colamd" >&6; } if test "x$ac_cv_lib_colamd_colamd" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_LIBCOLAMD 1 _ACEOF LIBS="-lcolamd $LIBS" fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for make_lp in -llpsolve55_pic" >&5 $as_echo_n "checking for make_lp in -llpsolve55_pic... " >&6; } if ${ac_cv_lib_lpsolve55_pic_make_lp+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-llpsolve55_pic $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char make_lp (); int main () { return make_lp (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_lpsolve55_pic_make_lp=yes else ac_cv_lib_lpsolve55_pic_make_lp=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_lpsolve55_pic_make_lp" >&5 $as_echo "$ac_cv_lib_lpsolve55_pic_make_lp" >&6; } if test "x$ac_cv_lib_lpsolve55_pic_make_lp" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_LIBLPSOLVE55_PIC 1 _ACEOF LIBS="-llpsolve55_pic $LIBS" else { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: lpsolve not installed, required for pruning POMDP value functions" >&5 $as_echo "$as_me: WARNING: lpsolve not installed, required for pruning POMDP value functions" >&2;} fi # Checks for header files. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ANSI C header files" >&5 $as_echo_n "checking for ANSI C header files... " >&6; } if ${ac_cv_header_stdc+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include #include int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_header_stdc=yes else ac_cv_header_stdc=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext if test $ac_cv_header_stdc = yes; then # SunOS 4.x string.h does not declare mem*, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "memchr" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "free" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi. if test "$cross_compiling" = yes; then : : else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #if ((' ' & 0x0FF) == 0x020) # define ISLOWER(c) ('a' <= (c) && (c) <= 'z') # define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c)) #else # define ISLOWER(c) \ (('a' <= (c) && (c) <= 'i') \ || ('j' <= (c) && (c) <= 'r') \ || ('s' <= (c) && (c) <= 'z')) # define TOUPPER(c) (ISLOWER(c) ? ((c) | 0x40) : (c)) #endif #define XOR(e, f) (((e) && !(f)) || (!(e) && (f))) int main () { int i; for (i = 0; i < 256; i++) if (XOR (islower (i), ISLOWER (i)) || toupper (i) != TOUPPER (i)) return 2; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : else ac_cv_header_stdc=no fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdc" >&5 $as_echo "$ac_cv_header_stdc" >&6; } if test $ac_cv_header_stdc = yes; then $as_echo "#define STDC_HEADERS 1" >>confdefs.h fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for stdbool.h that conforms to C99" >&5 $as_echo_n "checking for stdbool.h that conforms to C99... " >&6; } if ${ac_cv_header_stdbool_h+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #ifndef bool "error: bool is not defined" #endif #ifndef false "error: false is not defined" #endif #if false "error: false is not 0" #endif #ifndef true "error: true is not defined" #endif #if true != 1 "error: true is not 1" #endif #ifndef __bool_true_false_are_defined "error: __bool_true_false_are_defined is not defined" #endif struct s { _Bool s: 1; _Bool t; } s; char a[true == 1 ? 1 : -1]; char b[false == 0 ? 1 : -1]; char c[__bool_true_false_are_defined == 1 ? 1 : -1]; char d[(bool) 0.5 == true ? 1 : -1]; /* See body of main program for 'e'. */ char f[(_Bool) 0.0 == false ? 1 : -1]; char g[true]; char h[sizeof (_Bool)]; char i[sizeof s.t]; enum { j = false, k = true, l = false * true, m = true * 256 }; /* The following fails for HP aC++/ANSI C B3910B A.05.55 [Dec 04 2003]. */ _Bool n[m]; char o[sizeof n == m * sizeof n[0] ? 1 : -1]; char p[-1 - (_Bool) 0 < 0 && -1 - (bool) 0 < 0 ? 1 : -1]; /* Catch a bug in an HP-UX C compiler. See http://gcc.gnu.org/ml/gcc-patches/2003-12/msg02303.html http://lists.gnu.org/archive/html/bug-coreutils/2005-11/msg00161.html */ _Bool q = true; _Bool *pq = &q; int main () { bool e = &s; *pq |= q; *pq |= ! q; /* Refer to every declared value, to avoid compiler optimizations. */ return (!a + !b + !c + !d + !e + !f + !g + !h + !i + !!j + !k + !!l + !m + !n + !o + !p + !q + !pq); ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_header_stdbool_h=yes else ac_cv_header_stdbool_h=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdbool_h" >&5 $as_echo "$ac_cv_header_stdbool_h" >&6; } ac_fn_c_check_type "$LINENO" "_Bool" "ac_cv_type__Bool" "$ac_includes_default" if test "x$ac_cv_type__Bool" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE__BOOL 1 _ACEOF fi if test $ac_cv_header_stdbool_h = yes; then $as_echo "#define HAVE_STDBOOL_H 1" >>confdefs.h fi for ac_header in float.h limits.h stdlib.h do : as_ac_Header=`$as_echo "ac_cv_header_$ac_header" | $as_tr_sh` ac_fn_c_check_header_mongrel "$LINENO" "$ac_header" "$as_ac_Header" "$ac_includes_default" if eval test \"x\$"$as_ac_Header"\" = x"yes"; then : cat >>confdefs.h <<_ACEOF #define `$as_echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF fi done # Checks for typedefs, structures, and compiler characteristics. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for an ANSI C-conforming const" >&5 $as_echo_n "checking for an ANSI C-conforming const... " >&6; } if ${ac_cv_c_const+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #ifndef __cplusplus /* Ultrix mips cc rejects this sort of thing. */ typedef int charset[2]; const charset cs = { 0, 0 }; /* SunOS 4.1.1 cc rejects this. */ char const *const *pcpcc; char **ppc; /* NEC SVR4.0.2 mips cc rejects this. */ struct point {int x, y;}; static struct point const zero = {0,0}; /* AIX XL C 1.02.0.0 rejects this. It does not let you subtract one const X* pointer from another in an arm of an if-expression whose if-part is not a constant expression */ const char *g = "string"; pcpcc = &g + (g ? g-g : 0); /* HPUX 7.0 cc rejects these. */ ++pcpcc; ppc = (char**) pcpcc; pcpcc = (char const *const *) ppc; { /* SCO 3.2v4 cc rejects this sort of thing. */ char tx; char *t = &tx; char const *s = 0 ? (char *) 0 : (char const *) 0; *t++ = 0; if (s) return 0; } { /* Someone thinks the Sun supposedly-ANSI compiler will reject this. */ int x[] = {25, 17}; const int *foo = &x[0]; ++foo; } { /* Sun SC1.0 ANSI compiler rejects this -- but not the above. */ typedef const int *iptr; iptr p = 0; ++p; } { /* AIX XL C 1.02.0.0 rejects this sort of thing, saying "k.c", line 2.27: 1506-025 (S) Operand must be a modifiable lvalue. */ struct s { int j; const int *ap[3]; } bx; struct s *b = &bx; b->j = 5; } { /* ULTRIX-32 V3.1 (Rev 9) vcc rejects this */ const int foo = 10; if (!foo) return 0; } return !cs[0] && !zero.x; #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_c_const=yes else ac_cv_c_const=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_const" >&5 $as_echo "$ac_cv_c_const" >&6; } if test $ac_cv_c_const = no; then $as_echo "#define const /**/" >>confdefs.h fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for inline" >&5 $as_echo_n "checking for inline... " >&6; } if ${ac_cv_c_inline+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_c_inline=no for ac_kw in inline __inline__ __inline; do cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #ifndef __cplusplus typedef int foo_t; static $ac_kw foo_t static_foo () {return 0; } $ac_kw foo_t foo () {return 0; } #endif _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_c_inline=$ac_kw fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext test "$ac_cv_c_inline" != no && break done fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_inline" >&5 $as_echo "$ac_cv_c_inline" >&6; } case $ac_cv_c_inline in inline | yes) ;; *) case $ac_cv_c_inline in no) ac_val=;; *) ac_val=$ac_cv_c_inline;; esac cat >>confdefs.h <<_ACEOF #ifndef __cplusplus #define inline $ac_val #endif _ACEOF ;; esac ac_fn_c_check_type "$LINENO" "size_t" "ac_cv_type_size_t" "$ac_includes_default" if test "x$ac_cv_type_size_t" = xyes; then : else cat >>confdefs.h <<_ACEOF #define size_t unsigned int _ACEOF fi #check for cplex: ac_cplex_ok=no # Check whether --with-cplex was given. if test "${with_cplex+set}" = set; then : withval=$with_cplex; else with_cplex=yes fi # Check whether --with-cplex-includes was given. if test "${with_cplex_includes+set}" = set; then : withval=$with_cplex_includes; fi # Check whether --with-cplex-libs was given. if test "${with_cplex_libs+set}" = set; then : withval=$with_cplex_libs; fi # Check whether --with-cplex-ldflags was given. if test "${with_cplex_ldflags+set}" = set; then : withval=$with_cplex_ldflags; fi if test x"$with_cplex" != x"no"; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for CPLEX" >&5 $as_echo_n "checking for CPLEX... " >&6; } case $with_cplex_includes in yes | "") ;; no) ac_cplex_ok=disable ;; *) CPLEX_INCLUDES="$with_cplex_includes" ;; esac case $with_cplex_libs in yes | "") ;; no) ac_cplex_ok=disable ;; *) CPLEX_LIBS="$with_cplex_libs" ;; esac case $with_cplex_ldflags in yes | "") ;; no) ac_cplex_ok=disable ;; *) CPLEX_LDFLAGS="-lm -lpthread $with_cplex_ldflags" ;; esac #---compile test program--- lx_save_cxxflags="$CXXFLAGS" lx_save_ldflags="$LDFLAGS" lx_save_libs="$LIBS" CXXFLAGS="$CXXFLAGS $CPLEX_INCLUDES" LDFLAGS="$CPLEX_LDFLAGS" LIBS="$CPLEX_LIBS" cplex_test_prog=' //C version: extern "C" { #include } //C++ version #include #define IL_STD //<- tell CPLEX to use STL #include //<- fao: this is what we use ILOSTLBEGIN int main(int argc, char** argv) { //C version: CPXENVptr env = NULL; //C++ version //fao: some stuff we use in our code IloEnv env2; IloModel lpModel (env2); return 0; }' ac_ext=cpp ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='$CXX -c $CXXFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CXX -o conftest$ac_exeext $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_cxx_compiler_gnu cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $cplex_test_prog _ACEOF if ac_fn_cxx_try_link "$LINENO"; then : cplex_found=yes else cplex_found=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu CXXFLAGS="$lx_save_cxxflags" LDFLAGS="$lx_save_ldflags" LIBS="$lx_save_libs" #---end compile test program--- # Finally, execute ACTION-IF-FOUND/ACTION-IF-NOT-FOUND: if test x"$cplex_found" = x"yes"; then #cplex is found... $as_echo "#define HAVE_CPLEX 1" >>confdefs.h { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5 $as_echo "yes" >&6; } else #cplex is not found. { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: CPLEX not found, will not be able to use certain functionality!" >&5 $as_echo "$as_me: WARNING: CPLEX not found, will not be able to use certain functionality!" >&6;} fi fi if test x"$lx_cplex_found" = x"yes"; then HAVE_CPLEX_TRUE= HAVE_CPLEX_FALSE='#' else HAVE_CPLEX_TRUE='#' HAVE_CPLEX_FALSE= fi # Checks for library functions. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for error_at_line" >&5 $as_echo_n "checking for error_at_line... " >&6; } if ${ac_cv_lib_error_at_line+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { error_at_line (0, 0, "", 0, "an error occurred"); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_error_at_line=yes else ac_cv_lib_error_at_line=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_error_at_line" >&5 $as_echo "$ac_cv_lib_error_at_line" >&6; } if test $ac_cv_lib_error_at_line = no; then case " $LIBOBJS " in *" error.$ac_objext "* ) ;; *) LIBOBJS="$LIBOBJS error.$ac_objext" ;; esac fi for ac_func in pow strtoull do : as_ac_var=`$as_echo "ac_cv_func_$ac_func" | $as_tr_sh` ac_fn_c_check_func "$LINENO" "$ac_func" "$as_ac_var" if eval test \"x\$"$as_ac_var"\" = x"yes"; then : cat >>confdefs.h <<_ACEOF #define `$as_echo "HAVE_$ac_func" | $as_tr_cpp` 1 _ACEOF fi done ## Option for using compile -g flag for debugging symbols ## if true; then DEBUG_TRUE= DEBUG_FALSE='#' else DEBUG_TRUE='#' DEBUG_FALSE= fi # Check whether --enable-debug was given. if test "${enable_debug+set}" = set; then : enableval=$enable_debug; if test "x$enableval" = "xyes" ; then if true; then DEBUG_TRUE= DEBUG_FALSE='#' else DEBUG_TRUE='#' DEBUG_FALSE= fi fi fi ## Option for using compile -pg flag for profiling ## if false; then PROFILE_TRUE= PROFILE_FALSE='#' else PROFILE_TRUE='#' PROFILE_FALSE= fi # Check whether --enable-profile was given. if test "${enable_profile+set}" = set; then : enableval=$enable_profile; if test "x$enableval" = "xyes" ; then if true; then PROFILE_TRUE= PROFILE_FALSE='#' else PROFILE_TRUE='#' PROFILE_FALSE= fi fi fi ## Option for using dmalloc memory leak checking library ## if false; then DMALLOC_TRUE= DMALLOC_FALSE='#' else DMALLOC_TRUE='#' DMALLOC_FALSE= fi # Check whether --enable-dmalloc was given. if test "${enable_dmalloc+set}" = set; then : enableval=$enable_dmalloc; if test "x$enableval" = "xyes" ; then if true; then DMALLOC_TRUE= DMALLOC_FALSE='#' else DMALLOC_TRUE='#' DMALLOC_FALSE= fi fi fi # Checks for programs. ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}gcc", so it can be a program name with args. set dummy ${ac_tool_prefix}gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="${ac_tool_prefix}gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$ac_cv_prog_CC"; then ac_ct_CC=$CC # Extract the first word of "gcc", so it can be a program name with args. set dummy gcc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_CC="gcc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi else CC="$ac_cv_prog_CC" fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then # Extract the first word of "${ac_tool_prefix}cc", so it can be a program name with args. set dummy ${ac_tool_prefix}cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="${ac_tool_prefix}cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi fi if test -z "$CC"; then # Extract the first word of "cc", so it can be a program name with args. set dummy cc; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else ac_prog_rejected=no as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then if test "$as_dir/$ac_word$ac_exec_ext" = "/usr/ucb/cc"; then ac_prog_rejected=yes continue fi ac_cv_prog_CC="cc" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS if test $ac_prog_rejected = yes; then # We found a bogon in the path, so make sure we never use it. set dummy $ac_cv_prog_CC shift if test $# != 0; then # We chose a different compiler from the bogus one. # However, it has the same basename, so the bogon will be chosen # first if we set CC to just the basename; use the full file name. shift ac_cv_prog_CC="$as_dir/$ac_word${1+' '}$@" fi fi fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi fi if test -z "$CC"; then if test -n "$ac_tool_prefix"; then for ac_prog in cl.exe do # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. set dummy $ac_tool_prefix$ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_CC="$ac_tool_prefix$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi CC=$ac_cv_prog_CC if test -n "$CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CC" >&5 $as_echo "$CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$CC" && break done fi if test -z "$CC"; then ac_ct_CC=$CC for ac_prog in cl.exe do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5 $as_echo_n "checking for $ac_word... " >&6; } if ${ac_cv_prog_ac_ct_CC+:} false; then : $as_echo_n "(cached) " >&6 else if test -n "$ac_ct_CC"; then ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. else as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. for ac_exec_ext in '' $ac_executable_extensions; do if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then ac_cv_prog_ac_ct_CC="$ac_prog" $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5 break 2 fi done done IFS=$as_save_IFS fi fi ac_ct_CC=$ac_cv_prog_ac_ct_CC if test -n "$ac_ct_CC"; then { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_CC" >&5 $as_echo "$ac_ct_CC" >&6; } else { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5 $as_echo "no" >&6; } fi test -n "$ac_ct_CC" && break done if test "x$ac_ct_CC" = x; then CC="" else case $cross_compiling:$ac_tool_warned in yes:) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5 $as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;} ac_tool_warned=yes ;; esac CC=$ac_ct_CC fi fi fi test -z "$CC" && { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5 $as_echo "$as_me: error: in \`$ac_pwd':" >&2;} as_fn_error $? "no acceptable C compiler found in \$PATH See \`config.log' for more details" "$LINENO" 5; } # Provide some information about the compiler. $as_echo "$as_me:${as_lineno-$LINENO}: checking for C compiler version" >&5 set X $ac_compile ac_compiler=$2 for ac_option in --version -v -V -qversion; do { { ac_try="$ac_compiler $ac_option >&5" case "(($ac_try" in *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;; *) ac_try_echo=$ac_try;; esac eval ac_try_echo="\"\$as_me:${as_lineno-$LINENO}: $ac_try_echo\"" $as_echo "$ac_try_echo"; } >&5 (eval "$ac_compiler $ac_option >&5") 2>conftest.err ac_status=$? if test -s conftest.err; then sed '10a\ ... rest of stderr output deleted ... 10q' conftest.err >conftest.er1 cat conftest.er1 >&5 fi rm -f conftest.er1 conftest.err $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5 test $ac_status = 0; } done { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether we are using the GNU C compiler" >&5 $as_echo_n "checking whether we are using the GNU C compiler... " >&6; } if ${ac_cv_c_compiler_gnu+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #ifndef __GNUC__ choke me #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_compiler_gnu=yes else ac_compiler_gnu=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_cv_c_compiler_gnu=$ac_compiler_gnu fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_compiler_gnu" >&5 $as_echo "$ac_cv_c_compiler_gnu" >&6; } if test $ac_compiler_gnu = yes; then GCC=yes else GCC= fi ac_test_CFLAGS=${CFLAGS+set} ac_save_CFLAGS=$CFLAGS { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CC accepts -g" >&5 $as_echo_n "checking whether $CC accepts -g... " >&6; } if ${ac_cv_prog_cc_g+:} false; then : $as_echo_n "(cached) " >&6 else ac_save_c_werror_flag=$ac_c_werror_flag ac_c_werror_flag=yes ac_cv_prog_cc_g=no CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes else CFLAGS="" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : else ac_c_werror_flag=$ac_save_c_werror_flag CFLAGS="-g" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_g=yes fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext ac_c_werror_flag=$ac_save_c_werror_flag fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_g" >&5 $as_echo "$ac_cv_prog_cc_g" >&6; } if test "$ac_test_CFLAGS" = set; then CFLAGS=$ac_save_CFLAGS elif test $ac_cv_prog_cc_g = yes; then if test "$GCC" = yes; then CFLAGS="-g -O2" else CFLAGS="-g" fi else if test "$GCC" = yes; then CFLAGS="-O2" else CFLAGS= fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking for $CC option to accept ISO C89" >&5 $as_echo_n "checking for $CC option to accept ISO C89... " >&6; } if ${ac_cv_prog_cc_c89+:} false; then : $as_echo_n "(cached) " >&6 else ac_cv_prog_cc_c89=no ac_save_CC=$CC cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include struct stat; /* Most of the following tests are stolen from RCS 5.7's src/conf.sh. */ struct buf { int x; }; FILE * (*rcsopen) (struct buf *, struct stat *, int); static char *e (p, i) char **p; int i; { return p[i]; } static char *f (char * (*g) (char **, int), char **p, ...) { char *s; va_list v; va_start (v,p); s = g (p, va_arg (v,int)); va_end (v); return s; } /* OSF 4.0 Compaq cc is some sort of almost-ANSI by default. It has function prototypes and stuff, but not '\xHH' hex character constants. These don't provoke an error unfortunately, instead are silently treated as 'x'. The following induces an error, until -std is added to get proper ANSI mode. Curiously '\x00'!='x' always comes out true, for an array size at least. It's necessary to write '\x00'==0 to get something that's true only with -std. */ int osf4_cc_array ['\x00' == 0 ? 1 : -1]; /* IBM C 6 for AIX is almost-ANSI by default, but it replaces macro parameters inside strings and character constants. */ #define FOO(x) 'x' int xlc6_cc_array[FOO(a) == 'x' ? 1 : -1]; int test (int i, double x); struct s1 {int (*f) (int a);}; struct s2 {int (*f) (double a);}; int pairnames (int, char **, FILE *(*)(struct buf *, struct stat *, int), int, int); int argc; char **argv; int main () { return f (e, argv, 0) != argv[0] || f (e, argv, 1) != argv[1]; ; return 0; } _ACEOF for ac_arg in '' -qlanglvl=extc89 -qlanglvl=ansi -std \ -Ae "-Aa -D_HPUX_SOURCE" "-Xc -D__EXTENSIONS__" do CC="$ac_save_CC $ac_arg" if ac_fn_c_try_compile "$LINENO"; then : ac_cv_prog_cc_c89=$ac_arg fi rm -f core conftest.err conftest.$ac_objext test "x$ac_cv_prog_cc_c89" != "xno" && break done rm -f conftest.$ac_ext CC=$ac_save_CC fi # AC_CACHE_VAL case "x$ac_cv_prog_cc_c89" in x) { $as_echo "$as_me:${as_lineno-$LINENO}: result: none needed" >&5 $as_echo "none needed" >&6; } ;; xno) { $as_echo "$as_me:${as_lineno-$LINENO}: result: unsupported" >&5 $as_echo "unsupported" >&6; } ;; *) CC="$CC $ac_cv_prog_cc_c89" { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_prog_cc_c89" >&5 $as_echo "$ac_cv_prog_cc_c89" >&6; } ;; esac if test "x$ac_cv_prog_cc_c89" != xno; then : fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $CC understands -c and -o together" >&5 $as_echo_n "checking whether $CC understands -c and -o together... " >&6; } if ${am_cv_prog_cc_c_o+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { ; return 0; } _ACEOF # Make sure it works both with $CC and with simple cc. # Following AC_PROG_CC_C_O, we do the test twice because some # compilers refuse to overwrite an existing .o file with -o, # though they will create one. am_cv_prog_cc_c_o=yes for am_i in 1 2; do if { echo "$as_me:$LINENO: $CC -c conftest.$ac_ext -o conftest2.$ac_objext" >&5 ($CC -c conftest.$ac_ext -o conftest2.$ac_objext) >&5 2>&5 ac_status=$? echo "$as_me:$LINENO: \$? = $ac_status" >&5 (exit $ac_status); } \ && test -f conftest2.$ac_objext; then : OK else am_cv_prog_cc_c_o=no break fi done rm -f core conftest* unset am_i fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_prog_cc_c_o" >&5 $as_echo "$am_cv_prog_cc_c_o" >&6; } if test "$am_cv_prog_cc_c_o" != yes; then # Losing compiler, so override with the script. # FIXME: It is wrong to rewrite CC. # But if we don't then we get into trouble of one sort or another. # A longer-term fix would be to have automake use am__CC in this case, # and then we could set am__CC="\$(top_srcdir)/compile \$(CC)" CC="$am_aux_dir/compile $CC" fi ac_ext=c ac_cpp='$CPP $CPPFLAGS' ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' ac_compiler_gnu=$ac_cv_c_compiler_gnu depcc="$CC" am_compiler_list= { $as_echo "$as_me:${as_lineno-$LINENO}: checking dependency style of $depcc" >&5 $as_echo_n "checking dependency style of $depcc... " >&6; } if ${am_cv_CC_dependencies_compiler_type+:} false; then : $as_echo_n "(cached) " >&6 else if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then # We make a subdir and do the tests there. Otherwise we can end up # making bogus files that we don't know about and never remove. For # instance it was reported that on HP-UX the gcc test will end up # making a dummy file named 'D' -- because '-MD' means "put the output # in D". rm -rf conftest.dir mkdir conftest.dir # Copy depcomp to subdir because otherwise we won't find it if we're # using a relative directory. cp "$am_depcomp" conftest.dir cd conftest.dir # We will build objects and dependencies in a subdirectory because # it helps to detect inapplicable dependency modes. For instance # both Tru64's cc and ICC support -MD to output dependencies as a # side effect of compilation, but ICC will put the dependencies in # the current directory while Tru64 will put them in the object # directory. mkdir sub am_cv_CC_dependencies_compiler_type=none if test "$am_compiler_list" = ""; then am_compiler_list=`sed -n 's/^#*\([a-zA-Z0-9]*\))$/\1/p' < ./depcomp` fi am__universal=false case " $depcc " in #( *\ -arch\ *\ -arch\ *) am__universal=true ;; esac for depmode in $am_compiler_list; do # Setup a source with many dependencies, because some compilers # like to wrap large dependency lists on column 80 (with \), and # we should not choose a depcomp mode which is confused by this. # # We need to recreate these files for each test, as the compiler may # overwrite some of them when testing with obscure command lines. # This happens at least with the AIX C compiler. : > sub/conftest.c for i in 1 2 3 4 5 6; do echo '#include "conftst'$i'.h"' >> sub/conftest.c # Using ": > sub/conftst$i.h" creates only sub/conftst1.h with # Solaris 10 /bin/sh. echo '/* dummy */' > sub/conftst$i.h done echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf # We check with '-c' and '-o' for the sake of the "dashmstdout" # mode. It turns out that the SunPro C++ compiler does not properly # handle '-M -o', and we need to detect this. Also, some Intel # versions had trouble with output in subdirs. am__obj=sub/conftest.${OBJEXT-o} am__minus_obj="-o $am__obj" case $depmode in gcc) # This depmode causes a compiler race in universal mode. test "$am__universal" = false || continue ;; nosideeffect) # After this tag, mechanisms are not by side-effect, so they'll # only be used when explicitly requested. if test "x$enable_dependency_tracking" = xyes; then continue else break fi ;; msvc7 | msvc7msys | msvisualcpp | msvcmsys) # This compiler won't grok '-c -o', but also, the minuso test has # not run yet. These depmodes are late enough in the game, and # so weak that their functioning should not be impacted. am__obj=conftest.${OBJEXT-o} am__minus_obj= ;; none) break ;; esac if depmode=$depmode \ source=sub/conftest.c object=$am__obj \ depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \ $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \ >/dev/null 2>conftest.err && grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 && grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 && grep $am__obj sub/conftest.Po > /dev/null 2>&1 && ${MAKE-make} -s -f confmf > /dev/null 2>&1; then # icc doesn't choke on unknown options, it will just issue warnings # or remarks (even with -Werror). So we grep stderr for any message # that says an option was ignored or not supported. # When given -MP, icc 7.0 and 7.1 complain thusly: # icc: Command line warning: ignoring option '-M'; no argument required # The diagnosis changed in icc 8.0: # icc: Command line remark: option '-MP' not supported if (grep 'ignoring option' conftest.err || grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else am_cv_CC_dependencies_compiler_type=$depmode break fi fi done cd .. rm -rf conftest.dir else am_cv_CC_dependencies_compiler_type=none fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_CC_dependencies_compiler_type" >&5 $as_echo "$am_cv_CC_dependencies_compiler_type" >&6; } CCDEPMODE=depmode=$am_cv_CC_dependencies_compiler_type if test "x$enable_dependency_tracking" != xno \ && test "$am_cv_CC_dependencies_compiler_type" = gcc3; then am__fastdepCC_TRUE= am__fastdepCC_FALSE='#' else am__fastdepCC_TRUE='#' am__fastdepCC_FALSE= fi #AC_PROG_YACC #AM_PROG_LEX # Checks for libraries. # FIXME: Replace `main' with a function in `-lcplex': #AC_CHECK_LIB([cplex], [main]) # Checks for header files. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for ANSI C header files" >&5 $as_echo_n "checking for ANSI C header files... " >&6; } if ${ac_cv_header_stdc+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include #include int main () { ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_header_stdc=yes else ac_cv_header_stdc=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext if test $ac_cv_header_stdc = yes; then # SunOS 4.x string.h does not declare mem*, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "memchr" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI. cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include _ACEOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | $EGREP "free" >/dev/null 2>&1; then : else ac_cv_header_stdc=no fi rm -f conftest* fi if test $ac_cv_header_stdc = yes; then # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi. if test "$cross_compiling" = yes; then : : else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #if ((' ' & 0x0FF) == 0x020) # define ISLOWER(c) ('a' <= (c) && (c) <= 'z') # define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c)) #else # define ISLOWER(c) \ (('a' <= (c) && (c) <= 'i') \ || ('j' <= (c) && (c) <= 'r') \ || ('s' <= (c) && (c) <= 'z')) # define TOUPPER(c) (ISLOWER(c) ? ((c) | 0x40) : (c)) #endif #define XOR(e, f) (((e) && !(f)) || (!(e) && (f))) int main () { int i; for (i = 0; i < 256; i++) if (XOR (islower (i), ISLOWER (i)) || toupper (i) != TOUPPER (i)) return 2; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : else ac_cv_header_stdc=no fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_stdc" >&5 $as_echo "$ac_cv_header_stdc" >&6; } if test $ac_cv_header_stdc = yes; then $as_echo "#define STDC_HEADERS 1" >>confdefs.h fi for ac_header in float.h limits.h stddef.h stdlib.h string.h sys/time.h unistd.h do : as_ac_Header=`$as_echo "ac_cv_header_$ac_header" | $as_tr_sh` ac_fn_c_check_header_mongrel "$LINENO" "$ac_header" "$as_ac_Header" "$ac_includes_default" if eval test \"x\$"$as_ac_Header"\" = x"yes"; then : cat >>confdefs.h <<_ACEOF #define `$as_echo "HAVE_$ac_header" | $as_tr_cpp` 1 _ACEOF fi done # Checks for typedefs, structures, and compiler characteristics. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for an ANSI C-conforming const" >&5 $as_echo_n "checking for an ANSI C-conforming const... " >&6; } if ${ac_cv_c_const+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ int main () { #ifndef __cplusplus /* Ultrix mips cc rejects this sort of thing. */ typedef int charset[2]; const charset cs = { 0, 0 }; /* SunOS 4.1.1 cc rejects this. */ char const *const *pcpcc; char **ppc; /* NEC SVR4.0.2 mips cc rejects this. */ struct point {int x, y;}; static struct point const zero = {0,0}; /* AIX XL C 1.02.0.0 rejects this. It does not let you subtract one const X* pointer from another in an arm of an if-expression whose if-part is not a constant expression */ const char *g = "string"; pcpcc = &g + (g ? g-g : 0); /* HPUX 7.0 cc rejects these. */ ++pcpcc; ppc = (char**) pcpcc; pcpcc = (char const *const *) ppc; { /* SCO 3.2v4 cc rejects this sort of thing. */ char tx; char *t = &tx; char const *s = 0 ? (char *) 0 : (char const *) 0; *t++ = 0; if (s) return 0; } { /* Someone thinks the Sun supposedly-ANSI compiler will reject this. */ int x[] = {25, 17}; const int *foo = &x[0]; ++foo; } { /* Sun SC1.0 ANSI compiler rejects this -- but not the above. */ typedef const int *iptr; iptr p = 0; ++p; } { /* AIX XL C 1.02.0.0 rejects this sort of thing, saying "k.c", line 2.27: 1506-025 (S) Operand must be a modifiable lvalue. */ struct s { int j; const int *ap[3]; } bx; struct s *b = &bx; b->j = 5; } { /* ULTRIX-32 V3.1 (Rev 9) vcc rejects this */ const int foo = 10; if (!foo) return 0; } return !cs[0] && !zero.x; #endif ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_c_const=yes else ac_cv_c_const=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_c_const" >&5 $as_echo "$ac_cv_c_const" >&6; } if test $ac_cv_c_const = no; then $as_echo "#define const /**/" >>confdefs.h fi ac_fn_c_check_type "$LINENO" "size_t" "ac_cv_type_size_t" "$ac_includes_default" if test "x$ac_cv_type_size_t" = xyes; then : else cat >>confdefs.h <<_ACEOF #define size_t unsigned int _ACEOF fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking whether time.h and sys/time.h may both be included" >&5 $as_echo_n "checking whether time.h and sys/time.h may both be included... " >&6; } if ${ac_cv_header_time+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include #include int main () { if ((struct tm *) 0) return 0; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_header_time=yes else ac_cv_header_time=no fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_header_time" >&5 $as_echo "$ac_cv_header_time" >&6; } if test $ac_cv_header_time = yes; then $as_echo "#define TIME_WITH_SYS_TIME 1" >>confdefs.h fi # Checks for library functions. { $as_echo "$as_me:${as_lineno-$LINENO}: checking for error_at_line" >&5 $as_echo_n "checking for error_at_line... " >&6; } if ${ac_cv_lib_error_at_line+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include int main () { error_at_line (0, 0, "", 0, "an error occurred"); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_error_at_line=yes else ac_cv_lib_error_at_line=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_error_at_line" >&5 $as_echo "$ac_cv_lib_error_at_line" >&6; } if test $ac_cv_lib_error_at_line = no; then case " $LIBOBJS " in *" error.$ac_objext "* ) ;; *) LIBOBJS="$LIBOBJS error.$ac_objext" ;; esac fi for ac_header in stdlib.h do : ac_fn_c_check_header_mongrel "$LINENO" "stdlib.h" "ac_cv_header_stdlib_h" "$ac_includes_default" if test "x$ac_cv_header_stdlib_h" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_STDLIB_H 1 _ACEOF fi done { $as_echo "$as_me:${as_lineno-$LINENO}: checking for GNU libc compatible malloc" >&5 $as_echo_n "checking for GNU libc compatible malloc... " >&6; } if ${ac_cv_func_malloc_0_nonnull+:} false; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : ac_cv_func_malloc_0_nonnull=no else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #if defined STDC_HEADERS || defined HAVE_STDLIB_H # include #else char *malloc (); #endif int main () { return ! malloc (0); ; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : ac_cv_func_malloc_0_nonnull=yes else ac_cv_func_malloc_0_nonnull=no fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_func_malloc_0_nonnull" >&5 $as_echo "$ac_cv_func_malloc_0_nonnull" >&6; } if test $ac_cv_func_malloc_0_nonnull = yes; then : $as_echo "#define HAVE_MALLOC 1" >>confdefs.h else $as_echo "#define HAVE_MALLOC 0" >>confdefs.h case " $LIBOBJS " in *" malloc.$ac_objext "* ) ;; *) LIBOBJS="$LIBOBJS malloc.$ac_objext" ;; esac $as_echo "#define malloc rpl_malloc" >>confdefs.h fi for ac_header in stdlib.h do : ac_fn_c_check_header_mongrel "$LINENO" "stdlib.h" "ac_cv_header_stdlib_h" "$ac_includes_default" if test "x$ac_cv_header_stdlib_h" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_STDLIB_H 1 _ACEOF fi done { $as_echo "$as_me:${as_lineno-$LINENO}: checking for GNU libc compatible realloc" >&5 $as_echo_n "checking for GNU libc compatible realloc... " >&6; } if ${ac_cv_func_realloc_0_nonnull+:} false; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : ac_cv_func_realloc_0_nonnull=no else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #if defined STDC_HEADERS || defined HAVE_STDLIB_H # include #else char *realloc (); #endif int main () { return ! realloc (0, 0); ; return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : ac_cv_func_realloc_0_nonnull=yes else ac_cv_func_realloc_0_nonnull=no fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_func_realloc_0_nonnull" >&5 $as_echo "$ac_cv_func_realloc_0_nonnull" >&6; } if test $ac_cv_func_realloc_0_nonnull = yes; then : $as_echo "#define HAVE_REALLOC 1" >>confdefs.h else $as_echo "#define HAVE_REALLOC 0" >>confdefs.h case " $LIBOBJS " in *" realloc.$ac_objext "* ) ;; *) LIBOBJS="$LIBOBJS realloc.$ac_objext" ;; esac $as_echo "#define realloc rpl_realloc" >>confdefs.h fi { $as_echo "$as_me:${as_lineno-$LINENO}: checking return type of signal handlers" >&5 $as_echo_n "checking return type of signal handlers... " >&6; } if ${ac_cv_type_signal+:} false; then : $as_echo_n "(cached) " >&6 else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ #include #include int main () { return *(signal (0, 0)) (0) == 1; ; return 0; } _ACEOF if ac_fn_c_try_compile "$LINENO"; then : ac_cv_type_signal=int else ac_cv_type_signal=void fi rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_type_signal" >&5 $as_echo "$ac_cv_type_signal" >&6; } cat >>confdefs.h <<_ACEOF #define RETSIGTYPE $ac_cv_type_signal _ACEOF { $as_echo "$as_me:${as_lineno-$LINENO}: checking for working strtod" >&5 $as_echo_n "checking for working strtod... " >&6; } if ${ac_cv_func_strtod+:} false; then : $as_echo_n "(cached) " >&6 else if test "$cross_compiling" = yes; then : ac_cv_func_strtod=no else cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ $ac_includes_default #ifndef strtod double strtod (); #endif int main() { { /* Some versions of Linux strtod mis-parse strings with leading '+'. */ char *string = " +69"; char *term; double value; value = strtod (string, &term); if (value != 69 || term != (string + 4)) return 1; } { /* Under Solaris 2.4, strtod returns the wrong value for the terminating character under some conditions. */ char *string = "NaN"; char *term; strtod (string, &term); if (term != string && *(term - 1) == 0) return 1; } return 0; } _ACEOF if ac_fn_c_try_run "$LINENO"; then : ac_cv_func_strtod=yes else ac_cv_func_strtod=no fi rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext \ conftest.$ac_objext conftest.beam conftest.$ac_ext fi fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_func_strtod" >&5 $as_echo "$ac_cv_func_strtod" >&6; } if test $ac_cv_func_strtod = no; then case " $LIBOBJS " in *" strtod.$ac_objext "* ) ;; *) LIBOBJS="$LIBOBJS strtod.$ac_objext" ;; esac ac_fn_c_check_func "$LINENO" "pow" "ac_cv_func_pow" if test "x$ac_cv_func_pow" = xyes; then : fi if test $ac_cv_func_pow = no; then { $as_echo "$as_me:${as_lineno-$LINENO}: checking for pow in -lm" >&5 $as_echo_n "checking for pow in -lm... " >&6; } if ${ac_cv_lib_m_pow+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lm $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char pow (); int main () { return pow (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_m_pow=yes else ac_cv_lib_m_pow=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_m_pow" >&5 $as_echo "$ac_cv_lib_m_pow" >&6; } if test "x$ac_cv_lib_m_pow" = xyes; then : POW_LIB=-lm else { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cannot find library containing definition of pow" >&5 $as_echo "$as_me: WARNING: cannot find library containing definition of pow" >&2;} fi fi fi for ac_func in vprintf do : ac_fn_c_check_func "$LINENO" "vprintf" "ac_cv_func_vprintf" if test "x$ac_cv_func_vprintf" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_VPRINTF 1 _ACEOF ac_fn_c_check_func "$LINENO" "_doprnt" "ac_cv_func__doprnt" if test "x$ac_cv_func__doprnt" = xyes; then : $as_echo "#define HAVE_DOPRNT 1" >>confdefs.h fi fi done for ac_func in bzero floor gettimeofday memset pow sqrt strstr do : as_ac_var=`$as_echo "ac_cv_func_$ac_func" | $as_tr_sh` ac_fn_c_check_func "$LINENO" "$ac_func" "$as_ac_var" if eval test \"x\$"$as_ac_var"\" = x"yes"; then : cat >>confdefs.h <<_ACEOF #define `$as_echo "HAVE_$ac_func" | $as_tr_cpp` 1 _ACEOF fi done #---------------end of stuff required for pomdp-solve ------------------------------------ #For OS-dependent compilation case $host_os in *darwin*) HOST_OS=darwin { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: \"Compiling on OSX. Some functionalities will not be available.\"" >&5 $as_echo "$as_me: WARNING: \"Compiling on OSX. Some functionalities will not be available.\"" >&2;} ;; #Other os-specific instructions can go here. esac if test x$HOST_OS = xdarwin; then DARWIN_TRUE= DARWIN_FALSE='#' else DARWIN_TRUE='#' DARWIN_FALSE= fi #Small check for OSX systems where glibc ports may leave argp_parse undefined { $as_echo "$as_me:${as_lineno-$LINENO}: checking for library containing argp_parse" >&5 $as_echo_n "checking for library containing argp_parse... " >&6; } if ${ac_cv_search_argp_parse+:} false; then : $as_echo_n "(cached) " >&6 else ac_func_search_save_LIBS=$LIBS cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char argp_parse (); int main () { return argp_parse (); ; return 0; } _ACEOF for ac_lib in '' argp; do if test -z "$ac_lib"; then ac_res="none required" else ac_res=-l$ac_lib LIBS="-l$ac_lib $ac_func_search_save_LIBS" fi if ac_fn_c_try_link "$LINENO"; then : ac_cv_search_argp_parse=$ac_res fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext if ${ac_cv_search_argp_parse+:} false; then : break fi done if ${ac_cv_search_argp_parse+:} false; then : else ac_cv_search_argp_parse=no fi rm conftest.$ac_ext LIBS=$ac_func_search_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_search_argp_parse" >&5 $as_echo "$ac_cv_search_argp_parse" >&6; } ac_res=$ac_cv_search_argp_parse if test "$ac_res" != no; then : test "$ac_res" = "none required" || LIBS="$ac_res $LIBS" else as_fn_error $? "unable to find the argp_parse() function" "$LINENO" 5 fi #Check for libxml2 (required for ParserProbModelXML) { $as_echo "$as_me:${as_lineno-$LINENO}: checking for xmlInitParser in -lxml2" >&5 $as_echo_n "checking for xmlInitParser in -lxml2... " >&6; } if ${ac_cv_lib_xml2_xmlInitParser+:} false; then : $as_echo_n "(cached) " >&6 else ac_check_lib_save_LIBS=$LIBS LIBS="-lxml2 $LIBS" cat confdefs.h - <<_ACEOF >conftest.$ac_ext /* end confdefs.h. */ /* Override any GCC internal prototype to avoid an error. Use char because int might match the return type of a GCC builtin and then its argument prototype would still apply. */ #ifdef __cplusplus extern "C" #endif char xmlInitParser (); int main () { return xmlInitParser (); ; return 0; } _ACEOF if ac_fn_c_try_link "$LINENO"; then : ac_cv_lib_xml2_xmlInitParser=yes else ac_cv_lib_xml2_xmlInitParser=no fi rm -f core conftest.err conftest.$ac_objext \ conftest$ac_exeext conftest.$ac_ext LIBS=$ac_check_lib_save_LIBS fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_cv_lib_xml2_xmlInitParser" >&5 $as_echo "$ac_cv_lib_xml2_xmlInitParser" >&6; } if test "x$ac_cv_lib_xml2_xmlInitParser" = xyes; then : cat >>confdefs.h <<_ACEOF #define HAVE_LIBXML2 1 _ACEOF LIBS="-lxml2 $LIBS" fi ac_fn_c_check_header_mongrel "$LINENO" "libxml2/libxml/xmlexports.h" "ac_cv_header_libxml2_libxml_xmlexports_h" "$ac_includes_default" if test "x$ac_cv_header_libxml2_libxml_xmlexports_h" = xyes; then : fi if test "x$ac_cv_header_libxml2_libxml_xmlexports_h" == xyes; then FOUND_LIBXML2_TRUE= FOUND_LIBXML2_FALSE='#' else FOUND_LIBXML2_TRUE='#' FOUND_LIBXML2_FALSE= fi ac_config_files="$ac_config_files Makefile src/Makefile src/parser/Makefile src/base/Makefile src/support/Makefile src/planning/Makefile src/madp/Makefile src/utils/Makefile src/examples/Makefile src/libDAI/Makefile src/solvers/Makefile" #avoid ": compiling `test_gsl.c' with per-target flags requires `AM_PROG_CC_C_O' in `configure.ac'" cat >confcache <<\_ACEOF # This file is a shell script that caches the results of configure # tests run on this system so they can be shared between configure # scripts and configure runs, see configure's option --config-cache. # It is not useful on other systems. If it contains results you don't # want to keep, you may remove or edit it. # # config.status only pays attention to the cache file if you give it # the --recheck option to rerun configure. # # `ac_cv_env_foo' variables (set or unset) will be overridden when # loading this file, other *unset* `ac_cv_foo' will be assigned the # following values. _ACEOF # The following way of writing the cache mishandles newlines in values, # but we know of no workaround that is simple, portable, and efficient. # So, we kill variables containing newlines. # Ultrix sh set writes to stderr and can't be redirected directly, # and sets the high bit in the cache file unless we assign to the vars. ( for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do eval ac_val=\$$ac_var case $ac_val in #( *${as_nl}*) case $ac_var in #( *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5 $as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;; esac case $ac_var in #( _ | IFS | as_nl) ;; #( BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #( *) { eval $ac_var=; unset $ac_var;} ;; esac ;; esac done (set) 2>&1 | case $as_nl`(ac_space=' '; set) 2>&1` in #( *${as_nl}ac_space=\ *) # `set' does not quote correctly, so add quotes: double-quote # substitution turns \\\\ into \\, and sed turns \\ into \. sed -n \ "s/'/'\\\\''/g; s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p" ;; #( *) # `set' quotes correctly as required by POSIX, so do not add quotes. sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p" ;; esac | sort ) | sed ' /^ac_cv_env_/b end t clear :clear s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/ t end s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/ :end' >>confcache if diff "$cache_file" confcache >/dev/null 2>&1; then :; else if test -w "$cache_file"; then if test "x$cache_file" != "x/dev/null"; then { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5 $as_echo "$as_me: updating cache $cache_file" >&6;} if test ! -f "$cache_file" || test -h "$cache_file"; then cat confcache >"$cache_file" else case $cache_file in #( */* | ?:*) mv -f confcache "$cache_file"$$ && mv -f "$cache_file"$$ "$cache_file" ;; #( *) mv -f confcache "$cache_file" ;; esac fi fi else { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5 $as_echo "$as_me: not updating unwritable cache $cache_file" >&6;} fi fi rm -f confcache test "x$prefix" = xNONE && prefix=$ac_default_prefix # Let make expand exec_prefix. test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' DEFS=-DHAVE_CONFIG_H ac_libobjs= ac_ltlibobjs= U= for ac_i in : $LIBOBJS; do test "x$ac_i" = x: && continue # 1. Remove the extension, and $U if already installed. ac_script='s/\$U\././;s/\.o$//;s/\.obj$//' ac_i=`$as_echo "$ac_i" | sed "$ac_script"` # 2. Prepend LIBOBJDIR. When used with automake>=1.10 LIBOBJDIR # will be set to the directory where LIBOBJS objects are built. as_fn_append ac_libobjs " \${LIBOBJDIR}$ac_i\$U.$ac_objext" as_fn_append ac_ltlibobjs " \${LIBOBJDIR}$ac_i"'$U.lo' done LIBOBJS=$ac_libobjs LTLIBOBJS=$ac_ltlibobjs { $as_echo "$as_me:${as_lineno-$LINENO}: checking that generated files are newer than configure" >&5 $as_echo_n "checking that generated files are newer than configure... " >&6; } if test -n "$am_sleep_pid"; then # Hide warnings about reused PIDs. wait $am_sleep_pid 2>/dev/null fi { $as_echo "$as_me:${as_lineno-$LINENO}: result: done" >&5 $as_echo "done" >&6; } if test -n "$EXEEXT"; then am__EXEEXT_TRUE= am__EXEEXT_FALSE='#' else am__EXEEXT_TRUE='#' am__EXEEXT_FALSE= fi if test -z "${AMDEP_TRUE}" && test -z "${AMDEP_FALSE}"; then as_fn_error $? "conditional \"AMDEP\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${am__fastdepCXX_TRUE}" && test -z "${am__fastdepCXX_FALSE}"; then as_fn_error $? "conditional \"am__fastdepCXX\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${am__fastdepCC_TRUE}" && test -z "${am__fastdepCC_FALSE}"; then as_fn_error $? "conditional \"am__fastdepCC\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${HAVE_CPLEX_TRUE}" && test -z "${HAVE_CPLEX_FALSE}"; then as_fn_error $? "conditional \"HAVE_CPLEX\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${DEBUG_TRUE}" && test -z "${DEBUG_FALSE}"; then as_fn_error $? "conditional \"DEBUG\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${DEBUG_TRUE}" && test -z "${DEBUG_FALSE}"; then as_fn_error $? "conditional \"DEBUG\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${PROFILE_TRUE}" && test -z "${PROFILE_FALSE}"; then as_fn_error $? "conditional \"PROFILE\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${PROFILE_TRUE}" && test -z "${PROFILE_FALSE}"; then as_fn_error $? "conditional \"PROFILE\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${DMALLOC_TRUE}" && test -z "${DMALLOC_FALSE}"; then as_fn_error $? "conditional \"DMALLOC\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${DMALLOC_TRUE}" && test -z "${DMALLOC_FALSE}"; then as_fn_error $? "conditional \"DMALLOC\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${am__fastdepCC_TRUE}" && test -z "${am__fastdepCC_FALSE}"; then as_fn_error $? "conditional \"am__fastdepCC\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${DARWIN_TRUE}" && test -z "${DARWIN_FALSE}"; then as_fn_error $? "conditional \"DARWIN\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi if test -z "${FOUND_LIBXML2_TRUE}" && test -z "${FOUND_LIBXML2_FALSE}"; then as_fn_error $? "conditional \"FOUND_LIBXML2\" was never defined. Usually this means the macro was only invoked conditionally." "$LINENO" 5 fi : "${CONFIG_STATUS=./config.status}" ac_write_fail=0 ac_clean_files_save=$ac_clean_files ac_clean_files="$ac_clean_files $CONFIG_STATUS" { $as_echo "$as_me:${as_lineno-$LINENO}: creating $CONFIG_STATUS" >&5 $as_echo "$as_me: creating $CONFIG_STATUS" >&6;} as_write_fail=0 cat >$CONFIG_STATUS <<_ASEOF || as_write_fail=1 #! $SHELL # Generated by $as_me. # Run this file to recreate the current configuration. # Compiler output produced by configure, useful for debugging # configure, is in config.log if it exists. debug=false ac_cs_recheck=false ac_cs_silent=false SHELL=\${CONFIG_SHELL-$SHELL} export SHELL _ASEOF cat >>$CONFIG_STATUS <<\_ASEOF || as_write_fail=1 ## -------------------- ## ## M4sh Initialization. ## ## -------------------- ## # Be more Bourne compatible DUALCASE=1; export DUALCASE # for MKS sh if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then : emulate sh NULLCMD=: # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which # is contrary to our usage. Disable this feature. alias -g '${1+"$@"}'='"$@"' setopt NO_GLOB_SUBST else case `(set -o) 2>/dev/null` in #( *posix*) : set -o posix ;; #( *) : ;; esac fi as_nl=' ' export as_nl # Printing a long string crashes Solaris 7 /usr/bin/printf. as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\' as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo # Prefer a ksh shell builtin over an external printf program on Solaris, # but without wasting forks for bash or zsh. if test -z "$BASH_VERSION$ZSH_VERSION" \ && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='print -r --' as_echo_n='print -rn --' elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then as_echo='printf %s\n' as_echo_n='printf %s' else if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"' as_echo_n='/usr/ucb/echo -n' else as_echo_body='eval expr "X$1" : "X\\(.*\\)"' as_echo_n_body='eval arg=$1; case $arg in #( *"$as_nl"*) expr "X$arg" : "X\\(.*\\)$as_nl"; arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;; esac; expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl" ' export as_echo_n_body as_echo_n='sh -c $as_echo_n_body as_echo' fi export as_echo_body as_echo='sh -c $as_echo_body as_echo' fi # The user is always right. if test "${PATH_SEPARATOR+set}" != set; then PATH_SEPARATOR=: (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && { (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 || PATH_SEPARATOR=';' } fi # IFS # We need space, tab and new line, in precisely that order. Quoting is # there to prevent editors from complaining about space-tab. # (If _AS_PATH_WALK were called with IFS unset, it would disable word # splitting by setting IFS to empty value.) IFS=" "" $as_nl" # Find who we are. Look in the path if we contain no directory separator. as_myself= case $0 in #(( *[\\/]* ) as_myself=$0 ;; *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR for as_dir in $PATH do IFS=$as_save_IFS test -z "$as_dir" && as_dir=. test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break done IFS=$as_save_IFS ;; esac # We did not find ourselves, most probably we were run as `sh COMMAND' # in which case we are not to be found in the path. if test "x$as_myself" = x; then as_myself=$0 fi if test ! -f "$as_myself"; then $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2 exit 1 fi # Unset variables that we do not need and which cause bugs (e.g. in # pre-3.0 UWIN ksh). But do not cause bugs in bash 2.01; the "|| exit 1" # suppresses any "Segmentation fault" message there. '((' could # trigger a bug in pdksh 5.2.14. for as_var in BASH_ENV ENV MAIL MAILPATH do eval test x\${$as_var+set} = xset \ && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || : done PS1='$ ' PS2='> ' PS4='+ ' # NLS nuisances. LC_ALL=C export LC_ALL LANGUAGE=C export LANGUAGE # CDPATH. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH # as_fn_error STATUS ERROR [LINENO LOG_FD] # ---------------------------------------- # Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are # provided, also output the error to LOG_FD, referencing LINENO. Then exit the # script with STATUS, using 1 if that was 0. as_fn_error () { as_status=$1; test $as_status -eq 0 && as_status=1 if test "$4"; then as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4 fi $as_echo "$as_me: error: $2" >&2 as_fn_exit $as_status } # as_fn_error # as_fn_set_status STATUS # ----------------------- # Set $? to STATUS, without forking. as_fn_set_status () { return $1 } # as_fn_set_status # as_fn_exit STATUS # ----------------- # Exit the shell with STATUS, even in a "trap 0" or "set -e" context. as_fn_exit () { set +e as_fn_set_status $1 exit $1 } # as_fn_exit # as_fn_unset VAR # --------------- # Portably unset VAR. as_fn_unset () { { eval $1=; unset $1;} } as_unset=as_fn_unset # as_fn_append VAR VALUE # ---------------------- # Append the text in VALUE to the end of the definition contained in VAR. Take # advantage of any shell optimizations that allow amortized linear growth over # repeated appends, instead of the typical quadratic growth present in naive # implementations. if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then : eval 'as_fn_append () { eval $1+=\$2 }' else as_fn_append () { eval $1=\$$1\$2 } fi # as_fn_append # as_fn_arith ARG... # ------------------ # Perform arithmetic evaluation on the ARGs, and store the result in the # global $as_val. Take advantage of shells that can avoid forks. The arguments # must be portable across $(()) and expr. if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then : eval 'as_fn_arith () { as_val=$(( $* )) }' else as_fn_arith () { as_val=`expr "$@" || test $? -eq 1` } fi # as_fn_arith if expr a : '\(a\)' >/dev/null 2>&1 && test "X`expr 00001 : '.*\(...\)'`" = X001; then as_expr=expr else as_expr=false fi if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then as_basename=basename else as_basename=false fi if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then as_dirname=dirname else as_dirname=false fi as_me=`$as_basename -- "$0" || $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ X"$0" : 'X\(//\)$' \| \ X"$0" : 'X\(/\)' \| . 2>/dev/null || $as_echo X/"$0" | sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/ q } /^X\/\(\/\/\)$/{ s//\1/ q } /^X\/\(\/\).*/{ s//\1/ q } s/.*/./; q'` # Avoid depending upon Character Ranges. as_cr_letters='abcdefghijklmnopqrstuvwxyz' as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' as_cr_Letters=$as_cr_letters$as_cr_LETTERS as_cr_digits='0123456789' as_cr_alnum=$as_cr_Letters$as_cr_digits ECHO_C= ECHO_N= ECHO_T= case `echo -n x` in #((((( -n*) case `echo 'xy\c'` in *c*) ECHO_T=' ';; # ECHO_T is single tab character. xy) ECHO_C='\c';; *) echo `echo ksh88 bug on AIX 6.1` > /dev/null ECHO_T=' ';; esac;; *) ECHO_N='-n';; esac rm -f conf$$ conf$$.exe conf$$.file if test -d conf$$.dir; then rm -f conf$$.dir/conf$$.file else rm -f conf$$.dir mkdir conf$$.dir 2>/dev/null fi if (echo >conf$$.file) 2>/dev/null; then if ln -s conf$$.file conf$$ 2>/dev/null; then as_ln_s='ln -s' # ... but there are two gotchas: # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail. # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable. # In both cases, we have to default to `cp -pR'. ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe || as_ln_s='cp -pR' elif ln conf$$.file conf$$ 2>/dev/null; then as_ln_s=ln else as_ln_s='cp -pR' fi else as_ln_s='cp -pR' fi rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file rmdir conf$$.dir 2>/dev/null # as_fn_mkdir_p # ------------- # Create "$as_dir" as a directory, including parents if necessary. as_fn_mkdir_p () { case $as_dir in #( -*) as_dir=./$as_dir;; esac test -d "$as_dir" || eval $as_mkdir_p || { as_dirs= while :; do case $as_dir in #( *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'( *) as_qdir=$as_dir;; esac as_dirs="'$as_qdir' $as_dirs" as_dir=`$as_dirname -- "$as_dir" || $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$as_dir" : 'X\(//\)[^/]' \| \ X"$as_dir" : 'X\(//\)$' \| \ X"$as_dir" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$as_dir" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` test -d "$as_dir" && break done test -z "$as_dirs" || eval "mkdir $as_dirs" } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir" } # as_fn_mkdir_p if mkdir -p . 2>/dev/null; then as_mkdir_p='mkdir -p "$as_dir"' else test -d ./-p && rmdir ./-p as_mkdir_p=false fi # as_fn_executable_p FILE # ----------------------- # Test if FILE is an executable regular file. as_fn_executable_p () { test -f "$1" && test -x "$1" } # as_fn_executable_p as_test_x='test -x' as_executable_p=as_fn_executable_p # Sed expression to map a string onto a valid CPP name. as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'" # Sed expression to map a string onto a valid variable name. as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'" exec 6>&1 ## ----------------------------------- ## ## Main body of $CONFIG_STATUS script. ## ## ----------------------------------- ## _ASEOF test $as_write_fail = 0 && chmod +x $CONFIG_STATUS || ac_write_fail=1 cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # Save the log message, to keep $0 and so on meaningful, and to # report actual input values of CONFIG_FILES etc. instead of their # values after options handling. ac_log=" This file was extended by MADP $as_me 0.4, which was generated by GNU Autoconf 2.69. Invocation command line was CONFIG_FILES = $CONFIG_FILES CONFIG_HEADERS = $CONFIG_HEADERS CONFIG_LINKS = $CONFIG_LINKS CONFIG_COMMANDS = $CONFIG_COMMANDS $ $0 $@ on `(hostname || uname -n) 2>/dev/null | sed 1q` " _ACEOF case $ac_config_files in *" "*) set x $ac_config_files; shift; ac_config_files=$*;; esac case $ac_config_headers in *" "*) set x $ac_config_headers; shift; ac_config_headers=$*;; esac cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 # Files that config.status was made for. config_files="$ac_config_files" config_headers="$ac_config_headers" config_commands="$ac_config_commands" _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 ac_cs_usage="\ \`$as_me' instantiates files and other configuration actions from templates according to the current configuration. Unless the files and actions are specified as TAGs, all are instantiated by default. Usage: $0 [OPTION]... [TAG]... -h, --help print this help, then exit -V, --version print version number and configuration settings, then exit --config print configuration, then exit -q, --quiet, --silent do not print progress messages -d, --debug don't remove temporary files --recheck update $as_me by reconfiguring in the same conditions --file=FILE[:TEMPLATE] instantiate the configuration file FILE --header=FILE[:TEMPLATE] instantiate the configuration header FILE Configuration files: $config_files Configuration headers: $config_headers Configuration commands: $config_commands Report bugs to ." _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_cs_config="`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`" ac_cs_version="\\ MADP config.status 0.4 configured by $0, generated by GNU Autoconf 2.69, with options \\"\$ac_cs_config\\" Copyright (C) 2012 Free Software Foundation, Inc. This config.status script is free software; the Free Software Foundation gives unlimited permission to copy, distribute and modify it." ac_pwd='$ac_pwd' srcdir='$srcdir' INSTALL='$INSTALL' MKDIR_P='$MKDIR_P' AWK='$AWK' test -n "\$AWK" || AWK=awk _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # The default lists apply if the user does not specify any file. ac_need_defaults=: while test $# != 0 do case $1 in --*=?*) ac_option=`expr "X$1" : 'X\([^=]*\)='` ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'` ac_shift=: ;; --*=) ac_option=`expr "X$1" : 'X\([^=]*\)='` ac_optarg= ac_shift=: ;; *) ac_option=$1 ac_optarg=$2 ac_shift=shift ;; esac case $ac_option in # Handling of the options. -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r) ac_cs_recheck=: ;; --version | --versio | --versi | --vers | --ver | --ve | --v | -V ) $as_echo "$ac_cs_version"; exit ;; --config | --confi | --conf | --con | --co | --c ) $as_echo "$ac_cs_config"; exit ;; --debug | --debu | --deb | --de | --d | -d ) debug=: ;; --file | --fil | --fi | --f ) $ac_shift case $ac_optarg in *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;; '') as_fn_error $? "missing file argument" ;; esac as_fn_append CONFIG_FILES " '$ac_optarg'" ac_need_defaults=false;; --header | --heade | --head | --hea ) $ac_shift case $ac_optarg in *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;; esac as_fn_append CONFIG_HEADERS " '$ac_optarg'" ac_need_defaults=false;; --he | --h) # Conflict between --help and --header as_fn_error $? "ambiguous option: \`$1' Try \`$0 --help' for more information.";; --help | --hel | -h ) $as_echo "$ac_cs_usage"; exit ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil | --si | --s) ac_cs_silent=: ;; # This is an error. -*) as_fn_error $? "unrecognized option: \`$1' Try \`$0 --help' for more information." ;; *) as_fn_append ac_config_targets " $1" ac_need_defaults=false ;; esac shift done ac_configure_extra_args= if $ac_cs_silent; then exec 6>/dev/null ac_configure_extra_args="$ac_configure_extra_args --silent" fi _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 if \$ac_cs_recheck; then set X $SHELL '$0' $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion shift \$as_echo "running CONFIG_SHELL=$SHELL \$*" >&6 CONFIG_SHELL='$SHELL' export CONFIG_SHELL exec "\$@" fi _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 exec 5>>config.log { echo sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX ## Running $as_me. ## _ASBOX $as_echo "$ac_log" } >&5 _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 # # INIT-COMMANDS # AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir" # The HP-UX ksh and POSIX shell print the target directory to stdout # if CDPATH is set. (unset CDPATH) >/dev/null 2>&1 && unset CDPATH sed_quote_subst='$sed_quote_subst' double_quote_subst='$double_quote_subst' delay_variable_subst='$delay_variable_subst' macro_version='`$ECHO "$macro_version" | $SED "$delay_single_quote_subst"`' macro_revision='`$ECHO "$macro_revision" | $SED "$delay_single_quote_subst"`' enable_shared='`$ECHO "$enable_shared" | $SED "$delay_single_quote_subst"`' enable_static='`$ECHO "$enable_static" | $SED "$delay_single_quote_subst"`' pic_mode='`$ECHO "$pic_mode" | $SED "$delay_single_quote_subst"`' enable_fast_install='`$ECHO "$enable_fast_install" | $SED "$delay_single_quote_subst"`' SHELL='`$ECHO "$SHELL" | $SED "$delay_single_quote_subst"`' ECHO='`$ECHO "$ECHO" | $SED "$delay_single_quote_subst"`' PATH_SEPARATOR='`$ECHO "$PATH_SEPARATOR" | $SED "$delay_single_quote_subst"`' host_alias='`$ECHO "$host_alias" | $SED "$delay_single_quote_subst"`' host='`$ECHO "$host" | $SED "$delay_single_quote_subst"`' host_os='`$ECHO "$host_os" | $SED "$delay_single_quote_subst"`' build_alias='`$ECHO "$build_alias" | $SED "$delay_single_quote_subst"`' build='`$ECHO "$build" | $SED "$delay_single_quote_subst"`' build_os='`$ECHO "$build_os" | $SED "$delay_single_quote_subst"`' SED='`$ECHO "$SED" | $SED "$delay_single_quote_subst"`' Xsed='`$ECHO "$Xsed" | $SED "$delay_single_quote_subst"`' GREP='`$ECHO "$GREP" | $SED "$delay_single_quote_subst"`' EGREP='`$ECHO "$EGREP" | $SED "$delay_single_quote_subst"`' FGREP='`$ECHO "$FGREP" | $SED "$delay_single_quote_subst"`' LD='`$ECHO "$LD" | $SED "$delay_single_quote_subst"`' NM='`$ECHO "$NM" | $SED "$delay_single_quote_subst"`' LN_S='`$ECHO "$LN_S" | $SED "$delay_single_quote_subst"`' max_cmd_len='`$ECHO "$max_cmd_len" | $SED "$delay_single_quote_subst"`' ac_objext='`$ECHO "$ac_objext" | $SED "$delay_single_quote_subst"`' exeext='`$ECHO "$exeext" | $SED "$delay_single_quote_subst"`' lt_unset='`$ECHO "$lt_unset" | $SED "$delay_single_quote_subst"`' lt_SP2NL='`$ECHO "$lt_SP2NL" | $SED "$delay_single_quote_subst"`' lt_NL2SP='`$ECHO "$lt_NL2SP" | $SED "$delay_single_quote_subst"`' lt_cv_to_host_file_cmd='`$ECHO "$lt_cv_to_host_file_cmd" | $SED "$delay_single_quote_subst"`' lt_cv_to_tool_file_cmd='`$ECHO "$lt_cv_to_tool_file_cmd" | $SED "$delay_single_quote_subst"`' reload_flag='`$ECHO "$reload_flag" | $SED "$delay_single_quote_subst"`' reload_cmds='`$ECHO "$reload_cmds" | $SED "$delay_single_quote_subst"`' OBJDUMP='`$ECHO "$OBJDUMP" | $SED "$delay_single_quote_subst"`' deplibs_check_method='`$ECHO "$deplibs_check_method" | $SED "$delay_single_quote_subst"`' file_magic_cmd='`$ECHO "$file_magic_cmd" | $SED "$delay_single_quote_subst"`' file_magic_glob='`$ECHO "$file_magic_glob" | $SED "$delay_single_quote_subst"`' want_nocaseglob='`$ECHO "$want_nocaseglob" | $SED "$delay_single_quote_subst"`' DLLTOOL='`$ECHO "$DLLTOOL" | $SED "$delay_single_quote_subst"`' sharedlib_from_linklib_cmd='`$ECHO "$sharedlib_from_linklib_cmd" | $SED "$delay_single_quote_subst"`' AR='`$ECHO "$AR" | $SED "$delay_single_quote_subst"`' AR_FLAGS='`$ECHO "$AR_FLAGS" | $SED "$delay_single_quote_subst"`' archiver_list_spec='`$ECHO "$archiver_list_spec" | $SED "$delay_single_quote_subst"`' STRIP='`$ECHO "$STRIP" | $SED "$delay_single_quote_subst"`' RANLIB='`$ECHO "$RANLIB" | $SED "$delay_single_quote_subst"`' old_postinstall_cmds='`$ECHO "$old_postinstall_cmds" | $SED "$delay_single_quote_subst"`' old_postuninstall_cmds='`$ECHO "$old_postuninstall_cmds" | $SED "$delay_single_quote_subst"`' old_archive_cmds='`$ECHO "$old_archive_cmds" | $SED "$delay_single_quote_subst"`' lock_old_archive_extraction='`$ECHO "$lock_old_archive_extraction" | $SED "$delay_single_quote_subst"`' CC='`$ECHO "$CC" | $SED "$delay_single_quote_subst"`' CFLAGS='`$ECHO "$CFLAGS" | $SED "$delay_single_quote_subst"`' compiler='`$ECHO "$compiler" | $SED "$delay_single_quote_subst"`' GCC='`$ECHO "$GCC" | $SED "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_pipe='`$ECHO "$lt_cv_sys_global_symbol_pipe" | $SED "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_to_cdecl='`$ECHO "$lt_cv_sys_global_symbol_to_cdecl" | $SED "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_to_c_name_address='`$ECHO "$lt_cv_sys_global_symbol_to_c_name_address" | $SED "$delay_single_quote_subst"`' lt_cv_sys_global_symbol_to_c_name_address_lib_prefix='`$ECHO "$lt_cv_sys_global_symbol_to_c_name_address_lib_prefix" | $SED "$delay_single_quote_subst"`' nm_file_list_spec='`$ECHO "$nm_file_list_spec" | $SED "$delay_single_quote_subst"`' lt_sysroot='`$ECHO "$lt_sysroot" | $SED "$delay_single_quote_subst"`' objdir='`$ECHO "$objdir" | $SED "$delay_single_quote_subst"`' MAGIC_CMD='`$ECHO "$MAGIC_CMD" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_no_builtin_flag='`$ECHO "$lt_prog_compiler_no_builtin_flag" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_pic='`$ECHO "$lt_prog_compiler_pic" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_wl='`$ECHO "$lt_prog_compiler_wl" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_static='`$ECHO "$lt_prog_compiler_static" | $SED "$delay_single_quote_subst"`' lt_cv_prog_compiler_c_o='`$ECHO "$lt_cv_prog_compiler_c_o" | $SED "$delay_single_quote_subst"`' need_locks='`$ECHO "$need_locks" | $SED "$delay_single_quote_subst"`' MANIFEST_TOOL='`$ECHO "$MANIFEST_TOOL" | $SED "$delay_single_quote_subst"`' DSYMUTIL='`$ECHO "$DSYMUTIL" | $SED "$delay_single_quote_subst"`' NMEDIT='`$ECHO "$NMEDIT" | $SED "$delay_single_quote_subst"`' LIPO='`$ECHO "$LIPO" | $SED "$delay_single_quote_subst"`' OTOOL='`$ECHO "$OTOOL" | $SED "$delay_single_quote_subst"`' OTOOL64='`$ECHO "$OTOOL64" | $SED "$delay_single_quote_subst"`' libext='`$ECHO "$libext" | $SED "$delay_single_quote_subst"`' shrext_cmds='`$ECHO "$shrext_cmds" | $SED "$delay_single_quote_subst"`' extract_expsyms_cmds='`$ECHO "$extract_expsyms_cmds" | $SED "$delay_single_quote_subst"`' archive_cmds_need_lc='`$ECHO "$archive_cmds_need_lc" | $SED "$delay_single_quote_subst"`' enable_shared_with_static_runtimes='`$ECHO "$enable_shared_with_static_runtimes" | $SED "$delay_single_quote_subst"`' export_dynamic_flag_spec='`$ECHO "$export_dynamic_flag_spec" | $SED "$delay_single_quote_subst"`' whole_archive_flag_spec='`$ECHO "$whole_archive_flag_spec" | $SED "$delay_single_quote_subst"`' compiler_needs_object='`$ECHO "$compiler_needs_object" | $SED "$delay_single_quote_subst"`' old_archive_from_new_cmds='`$ECHO "$old_archive_from_new_cmds" | $SED "$delay_single_quote_subst"`' old_archive_from_expsyms_cmds='`$ECHO "$old_archive_from_expsyms_cmds" | $SED "$delay_single_quote_subst"`' archive_cmds='`$ECHO "$archive_cmds" | $SED "$delay_single_quote_subst"`' archive_expsym_cmds='`$ECHO "$archive_expsym_cmds" | $SED "$delay_single_quote_subst"`' module_cmds='`$ECHO "$module_cmds" | $SED "$delay_single_quote_subst"`' module_expsym_cmds='`$ECHO "$module_expsym_cmds" | $SED "$delay_single_quote_subst"`' with_gnu_ld='`$ECHO "$with_gnu_ld" | $SED "$delay_single_quote_subst"`' allow_undefined_flag='`$ECHO "$allow_undefined_flag" | $SED "$delay_single_quote_subst"`' no_undefined_flag='`$ECHO "$no_undefined_flag" | $SED "$delay_single_quote_subst"`' hardcode_libdir_flag_spec='`$ECHO "$hardcode_libdir_flag_spec" | $SED "$delay_single_quote_subst"`' hardcode_libdir_separator='`$ECHO "$hardcode_libdir_separator" | $SED "$delay_single_quote_subst"`' hardcode_direct='`$ECHO "$hardcode_direct" | $SED "$delay_single_quote_subst"`' hardcode_direct_absolute='`$ECHO "$hardcode_direct_absolute" | $SED "$delay_single_quote_subst"`' hardcode_minus_L='`$ECHO "$hardcode_minus_L" | $SED "$delay_single_quote_subst"`' hardcode_shlibpath_var='`$ECHO "$hardcode_shlibpath_var" | $SED "$delay_single_quote_subst"`' hardcode_automatic='`$ECHO "$hardcode_automatic" | $SED "$delay_single_quote_subst"`' inherit_rpath='`$ECHO "$inherit_rpath" | $SED "$delay_single_quote_subst"`' link_all_deplibs='`$ECHO "$link_all_deplibs" | $SED "$delay_single_quote_subst"`' always_export_symbols='`$ECHO "$always_export_symbols" | $SED "$delay_single_quote_subst"`' export_symbols_cmds='`$ECHO "$export_symbols_cmds" | $SED "$delay_single_quote_subst"`' exclude_expsyms='`$ECHO "$exclude_expsyms" | $SED "$delay_single_quote_subst"`' include_expsyms='`$ECHO "$include_expsyms" | $SED "$delay_single_quote_subst"`' prelink_cmds='`$ECHO "$prelink_cmds" | $SED "$delay_single_quote_subst"`' postlink_cmds='`$ECHO "$postlink_cmds" | $SED "$delay_single_quote_subst"`' file_list_spec='`$ECHO "$file_list_spec" | $SED "$delay_single_quote_subst"`' variables_saved_for_relink='`$ECHO "$variables_saved_for_relink" | $SED "$delay_single_quote_subst"`' need_lib_prefix='`$ECHO "$need_lib_prefix" | $SED "$delay_single_quote_subst"`' need_version='`$ECHO "$need_version" | $SED "$delay_single_quote_subst"`' version_type='`$ECHO "$version_type" | $SED "$delay_single_quote_subst"`' runpath_var='`$ECHO "$runpath_var" | $SED "$delay_single_quote_subst"`' shlibpath_var='`$ECHO "$shlibpath_var" | $SED "$delay_single_quote_subst"`' shlibpath_overrides_runpath='`$ECHO "$shlibpath_overrides_runpath" | $SED "$delay_single_quote_subst"`' libname_spec='`$ECHO "$libname_spec" | $SED "$delay_single_quote_subst"`' library_names_spec='`$ECHO "$library_names_spec" | $SED "$delay_single_quote_subst"`' soname_spec='`$ECHO "$soname_spec" | $SED "$delay_single_quote_subst"`' install_override_mode='`$ECHO "$install_override_mode" | $SED "$delay_single_quote_subst"`' postinstall_cmds='`$ECHO "$postinstall_cmds" | $SED "$delay_single_quote_subst"`' postuninstall_cmds='`$ECHO "$postuninstall_cmds" | $SED "$delay_single_quote_subst"`' finish_cmds='`$ECHO "$finish_cmds" | $SED "$delay_single_quote_subst"`' finish_eval='`$ECHO "$finish_eval" | $SED "$delay_single_quote_subst"`' hardcode_into_libs='`$ECHO "$hardcode_into_libs" | $SED "$delay_single_quote_subst"`' sys_lib_search_path_spec='`$ECHO "$sys_lib_search_path_spec" | $SED "$delay_single_quote_subst"`' sys_lib_dlsearch_path_spec='`$ECHO "$sys_lib_dlsearch_path_spec" | $SED "$delay_single_quote_subst"`' hardcode_action='`$ECHO "$hardcode_action" | $SED "$delay_single_quote_subst"`' enable_dlopen='`$ECHO "$enable_dlopen" | $SED "$delay_single_quote_subst"`' enable_dlopen_self='`$ECHO "$enable_dlopen_self" | $SED "$delay_single_quote_subst"`' enable_dlopen_self_static='`$ECHO "$enable_dlopen_self_static" | $SED "$delay_single_quote_subst"`' old_striplib='`$ECHO "$old_striplib" | $SED "$delay_single_quote_subst"`' striplib='`$ECHO "$striplib" | $SED "$delay_single_quote_subst"`' compiler_lib_search_dirs='`$ECHO "$compiler_lib_search_dirs" | $SED "$delay_single_quote_subst"`' predep_objects='`$ECHO "$predep_objects" | $SED "$delay_single_quote_subst"`' postdep_objects='`$ECHO "$postdep_objects" | $SED "$delay_single_quote_subst"`' predeps='`$ECHO "$predeps" | $SED "$delay_single_quote_subst"`' postdeps='`$ECHO "$postdeps" | $SED "$delay_single_quote_subst"`' compiler_lib_search_path='`$ECHO "$compiler_lib_search_path" | $SED "$delay_single_quote_subst"`' LD_CXX='`$ECHO "$LD_CXX" | $SED "$delay_single_quote_subst"`' reload_flag_CXX='`$ECHO "$reload_flag_CXX" | $SED "$delay_single_quote_subst"`' reload_cmds_CXX='`$ECHO "$reload_cmds_CXX" | $SED "$delay_single_quote_subst"`' old_archive_cmds_CXX='`$ECHO "$old_archive_cmds_CXX" | $SED "$delay_single_quote_subst"`' compiler_CXX='`$ECHO "$compiler_CXX" | $SED "$delay_single_quote_subst"`' GCC_CXX='`$ECHO "$GCC_CXX" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_no_builtin_flag_CXX='`$ECHO "$lt_prog_compiler_no_builtin_flag_CXX" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_pic_CXX='`$ECHO "$lt_prog_compiler_pic_CXX" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_wl_CXX='`$ECHO "$lt_prog_compiler_wl_CXX" | $SED "$delay_single_quote_subst"`' lt_prog_compiler_static_CXX='`$ECHO "$lt_prog_compiler_static_CXX" | $SED "$delay_single_quote_subst"`' lt_cv_prog_compiler_c_o_CXX='`$ECHO "$lt_cv_prog_compiler_c_o_CXX" | $SED "$delay_single_quote_subst"`' archive_cmds_need_lc_CXX='`$ECHO "$archive_cmds_need_lc_CXX" | $SED "$delay_single_quote_subst"`' enable_shared_with_static_runtimes_CXX='`$ECHO "$enable_shared_with_static_runtimes_CXX" | $SED "$delay_single_quote_subst"`' export_dynamic_flag_spec_CXX='`$ECHO "$export_dynamic_flag_spec_CXX" | $SED "$delay_single_quote_subst"`' whole_archive_flag_spec_CXX='`$ECHO "$whole_archive_flag_spec_CXX" | $SED "$delay_single_quote_subst"`' compiler_needs_object_CXX='`$ECHO "$compiler_needs_object_CXX" | $SED "$delay_single_quote_subst"`' old_archive_from_new_cmds_CXX='`$ECHO "$old_archive_from_new_cmds_CXX" | $SED "$delay_single_quote_subst"`' old_archive_from_expsyms_cmds_CXX='`$ECHO "$old_archive_from_expsyms_cmds_CXX" | $SED "$delay_single_quote_subst"`' archive_cmds_CXX='`$ECHO "$archive_cmds_CXX" | $SED "$delay_single_quote_subst"`' archive_expsym_cmds_CXX='`$ECHO "$archive_expsym_cmds_CXX" | $SED "$delay_single_quote_subst"`' module_cmds_CXX='`$ECHO "$module_cmds_CXX" | $SED "$delay_single_quote_subst"`' module_expsym_cmds_CXX='`$ECHO "$module_expsym_cmds_CXX" | $SED "$delay_single_quote_subst"`' with_gnu_ld_CXX='`$ECHO "$with_gnu_ld_CXX" | $SED "$delay_single_quote_subst"`' allow_undefined_flag_CXX='`$ECHO "$allow_undefined_flag_CXX" | $SED "$delay_single_quote_subst"`' no_undefined_flag_CXX='`$ECHO "$no_undefined_flag_CXX" | $SED "$delay_single_quote_subst"`' hardcode_libdir_flag_spec_CXX='`$ECHO "$hardcode_libdir_flag_spec_CXX" | $SED "$delay_single_quote_subst"`' hardcode_libdir_separator_CXX='`$ECHO "$hardcode_libdir_separator_CXX" | $SED "$delay_single_quote_subst"`' hardcode_direct_CXX='`$ECHO "$hardcode_direct_CXX" | $SED "$delay_single_quote_subst"`' hardcode_direct_absolute_CXX='`$ECHO "$hardcode_direct_absolute_CXX" | $SED "$delay_single_quote_subst"`' hardcode_minus_L_CXX='`$ECHO "$hardcode_minus_L_CXX" | $SED "$delay_single_quote_subst"`' hardcode_shlibpath_var_CXX='`$ECHO "$hardcode_shlibpath_var_CXX" | $SED "$delay_single_quote_subst"`' hardcode_automatic_CXX='`$ECHO "$hardcode_automatic_CXX" | $SED "$delay_single_quote_subst"`' inherit_rpath_CXX='`$ECHO "$inherit_rpath_CXX" | $SED "$delay_single_quote_subst"`' link_all_deplibs_CXX='`$ECHO "$link_all_deplibs_CXX" | $SED "$delay_single_quote_subst"`' always_export_symbols_CXX='`$ECHO "$always_export_symbols_CXX" | $SED "$delay_single_quote_subst"`' export_symbols_cmds_CXX='`$ECHO "$export_symbols_cmds_CXX" | $SED "$delay_single_quote_subst"`' exclude_expsyms_CXX='`$ECHO "$exclude_expsyms_CXX" | $SED "$delay_single_quote_subst"`' include_expsyms_CXX='`$ECHO "$include_expsyms_CXX" | $SED "$delay_single_quote_subst"`' prelink_cmds_CXX='`$ECHO "$prelink_cmds_CXX" | $SED "$delay_single_quote_subst"`' postlink_cmds_CXX='`$ECHO "$postlink_cmds_CXX" | $SED "$delay_single_quote_subst"`' file_list_spec_CXX='`$ECHO "$file_list_spec_CXX" | $SED "$delay_single_quote_subst"`' hardcode_action_CXX='`$ECHO "$hardcode_action_CXX" | $SED "$delay_single_quote_subst"`' compiler_lib_search_dirs_CXX='`$ECHO "$compiler_lib_search_dirs_CXX" | $SED "$delay_single_quote_subst"`' predep_objects_CXX='`$ECHO "$predep_objects_CXX" | $SED "$delay_single_quote_subst"`' postdep_objects_CXX='`$ECHO "$postdep_objects_CXX" | $SED "$delay_single_quote_subst"`' predeps_CXX='`$ECHO "$predeps_CXX" | $SED "$delay_single_quote_subst"`' postdeps_CXX='`$ECHO "$postdeps_CXX" | $SED "$delay_single_quote_subst"`' compiler_lib_search_path_CXX='`$ECHO "$compiler_lib_search_path_CXX" | $SED "$delay_single_quote_subst"`' LTCC='$LTCC' LTCFLAGS='$LTCFLAGS' compiler='$compiler_DEFAULT' # A function that is used when there is no print builtin or printf. func_fallback_echo () { eval 'cat <<_LTECHO_EOF \$1 _LTECHO_EOF' } # Quote evaled strings. for var in SHELL \ ECHO \ PATH_SEPARATOR \ SED \ GREP \ EGREP \ FGREP \ LD \ NM \ LN_S \ lt_SP2NL \ lt_NL2SP \ reload_flag \ OBJDUMP \ deplibs_check_method \ file_magic_cmd \ file_magic_glob \ want_nocaseglob \ DLLTOOL \ sharedlib_from_linklib_cmd \ AR \ AR_FLAGS \ archiver_list_spec \ STRIP \ RANLIB \ CC \ CFLAGS \ compiler \ lt_cv_sys_global_symbol_pipe \ lt_cv_sys_global_symbol_to_cdecl \ lt_cv_sys_global_symbol_to_c_name_address \ lt_cv_sys_global_symbol_to_c_name_address_lib_prefix \ nm_file_list_spec \ lt_prog_compiler_no_builtin_flag \ lt_prog_compiler_pic \ lt_prog_compiler_wl \ lt_prog_compiler_static \ lt_cv_prog_compiler_c_o \ need_locks \ MANIFEST_TOOL \ DSYMUTIL \ NMEDIT \ LIPO \ OTOOL \ OTOOL64 \ shrext_cmds \ export_dynamic_flag_spec \ whole_archive_flag_spec \ compiler_needs_object \ with_gnu_ld \ allow_undefined_flag \ no_undefined_flag \ hardcode_libdir_flag_spec \ hardcode_libdir_separator \ exclude_expsyms \ include_expsyms \ file_list_spec \ variables_saved_for_relink \ libname_spec \ library_names_spec \ soname_spec \ install_override_mode \ finish_eval \ old_striplib \ striplib \ compiler_lib_search_dirs \ predep_objects \ postdep_objects \ predeps \ postdeps \ compiler_lib_search_path \ LD_CXX \ reload_flag_CXX \ compiler_CXX \ lt_prog_compiler_no_builtin_flag_CXX \ lt_prog_compiler_pic_CXX \ lt_prog_compiler_wl_CXX \ lt_prog_compiler_static_CXX \ lt_cv_prog_compiler_c_o_CXX \ export_dynamic_flag_spec_CXX \ whole_archive_flag_spec_CXX \ compiler_needs_object_CXX \ with_gnu_ld_CXX \ allow_undefined_flag_CXX \ no_undefined_flag_CXX \ hardcode_libdir_flag_spec_CXX \ hardcode_libdir_separator_CXX \ exclude_expsyms_CXX \ include_expsyms_CXX \ file_list_spec_CXX \ compiler_lib_search_dirs_CXX \ predep_objects_CXX \ postdep_objects_CXX \ predeps_CXX \ postdeps_CXX \ compiler_lib_search_path_CXX; do case \`eval \\\\\$ECHO \\\\""\\\\\$\$var"\\\\"\` in *[\\\\\\\`\\"\\\$]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"\\\$\$var\\" | \\\$SED \\"\\\$sed_quote_subst\\"\\\`\\\\\\"" ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done # Double-quote double-evaled strings. for var in reload_cmds \ old_postinstall_cmds \ old_postuninstall_cmds \ old_archive_cmds \ extract_expsyms_cmds \ old_archive_from_new_cmds \ old_archive_from_expsyms_cmds \ archive_cmds \ archive_expsym_cmds \ module_cmds \ module_expsym_cmds \ export_symbols_cmds \ prelink_cmds \ postlink_cmds \ postinstall_cmds \ postuninstall_cmds \ finish_cmds \ sys_lib_search_path_spec \ sys_lib_dlsearch_path_spec \ reload_cmds_CXX \ old_archive_cmds_CXX \ old_archive_from_new_cmds_CXX \ old_archive_from_expsyms_cmds_CXX \ archive_cmds_CXX \ archive_expsym_cmds_CXX \ module_cmds_CXX \ module_expsym_cmds_CXX \ export_symbols_cmds_CXX \ prelink_cmds_CXX \ postlink_cmds_CXX; do case \`eval \\\\\$ECHO \\\\""\\\\\$\$var"\\\\"\` in *[\\\\\\\`\\"\\\$]*) eval "lt_\$var=\\\\\\"\\\`\\\$ECHO \\"\\\$\$var\\" | \\\$SED -e \\"\\\$double_quote_subst\\" -e \\"\\\$sed_quote_subst\\" -e \\"\\\$delay_variable_subst\\"\\\`\\\\\\"" ;; *) eval "lt_\$var=\\\\\\"\\\$\$var\\\\\\"" ;; esac done ac_aux_dir='$ac_aux_dir' xsi_shell='$xsi_shell' lt_shell_append='$lt_shell_append' # See if we are running on zsh, and set the options which allow our # commands through without removal of \ escapes INIT. if test -n "\${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi PACKAGE='$PACKAGE' VERSION='$VERSION' TIMESTAMP='$TIMESTAMP' RM='$RM' ofile='$ofile' _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # Handling of arguments. for ac_config_target in $ac_config_targets do case $ac_config_target in "config.h") CONFIG_HEADERS="$CONFIG_HEADERS config.h" ;; "depfiles") CONFIG_COMMANDS="$CONFIG_COMMANDS depfiles" ;; "libtool") CONFIG_COMMANDS="$CONFIG_COMMANDS libtool" ;; "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;; "src/Makefile") CONFIG_FILES="$CONFIG_FILES src/Makefile" ;; "src/parser/Makefile") CONFIG_FILES="$CONFIG_FILES src/parser/Makefile" ;; "src/base/Makefile") CONFIG_FILES="$CONFIG_FILES src/base/Makefile" ;; "src/support/Makefile") CONFIG_FILES="$CONFIG_FILES src/support/Makefile" ;; "src/planning/Makefile") CONFIG_FILES="$CONFIG_FILES src/planning/Makefile" ;; "src/madp/Makefile") CONFIG_FILES="$CONFIG_FILES src/madp/Makefile" ;; "src/utils/Makefile") CONFIG_FILES="$CONFIG_FILES src/utils/Makefile" ;; "src/examples/Makefile") CONFIG_FILES="$CONFIG_FILES src/examples/Makefile" ;; "src/libDAI/Makefile") CONFIG_FILES="$CONFIG_FILES src/libDAI/Makefile" ;; "src/solvers/Makefile") CONFIG_FILES="$CONFIG_FILES src/solvers/Makefile" ;; *) as_fn_error $? "invalid argument: \`$ac_config_target'" "$LINENO" 5;; esac done # If the user did not use the arguments to specify the items to instantiate, # then the envvar interface is used. Set only those that are not. # We use the long form for the default assignment because of an extremely # bizarre bug on SunOS 4.1.3. if $ac_need_defaults; then test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files test "${CONFIG_HEADERS+set}" = set || CONFIG_HEADERS=$config_headers test "${CONFIG_COMMANDS+set}" = set || CONFIG_COMMANDS=$config_commands fi # Have a temporary directory for convenience. Make it in the build tree # simply because there is no reason against having it here, and in addition, # creating and moving files from /tmp can sometimes cause problems. # Hook for its removal unless debugging. # Note that there is a small window in which the directory will not be cleaned: # after its creation but before its name has been assigned to `$tmp'. $debug || { tmp= ac_tmp= trap 'exit_status=$? : "${ac_tmp:=$tmp}" { test ! -d "$ac_tmp" || rm -fr "$ac_tmp"; } && exit $exit_status ' 0 trap 'as_fn_exit 1' 1 2 13 15 } # Create a (secure) tmp directory for tmp files. { tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` && test -d "$tmp" } || { tmp=./conf$$-$RANDOM (umask 077 && mkdir "$tmp") } || as_fn_error $? "cannot create a temporary directory in ." "$LINENO" 5 ac_tmp=$tmp # Set up the scripts for CONFIG_FILES section. # No need to generate them if there are no CONFIG_FILES. # This happens for instance with `./config.status config.h'. if test -n "$CONFIG_FILES"; then ac_cr=`echo X | tr X '\015'` # On cygwin, bash can eat \r inside `` if the user requested igncr. # But we know of no other shell where ac_cr would be empty at this # point, so we can use a bashism as a fallback. if test "x$ac_cr" = x; then eval ac_cr=\$\'\\r\' fi ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' /dev/null` if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then ac_cs_awk_cr='\\r' else ac_cs_awk_cr=$ac_cr fi echo 'BEGIN {' >"$ac_tmp/subs1.awk" && _ACEOF { echo "cat >conf$$subs.awk <<_ACEOF" && echo "$ac_subst_vars" | sed 's/.*/&!$&$ac_delim/' && echo "_ACEOF" } >conf$$subs.sh || as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 ac_delim_num=`echo "$ac_subst_vars" | grep -c '^'` ac_delim='%!_!# ' for ac_last_try in false false false false false :; do . ./conf$$subs.sh || as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 ac_delim_n=`sed -n "s/.*$ac_delim\$/X/p" conf$$subs.awk | grep -c X` if test $ac_delim_n = $ac_delim_num; then break elif $ac_last_try; then as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5 else ac_delim="$ac_delim!$ac_delim _$ac_delim!! " fi done rm -f conf$$subs.sh cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK && _ACEOF sed -n ' h s/^/S["/; s/!.*/"]=/ p g s/^[^!]*!// :repl t repl s/'"$ac_delim"'$// t delim :nl h s/\(.\{148\}\)..*/\1/ t more1 s/["\\]/\\&/g; s/^/"/; s/$/\\n"\\/ p n b repl :more1 s/["\\]/\\&/g; s/^/"/; s/$/"\\/ p g s/.\{148\}// t nl :delim h s/\(.\{148\}\)..*/\1/ t more2 s/["\\]/\\&/g; s/^/"/; s/$/"/ p b :more2 s/["\\]/\\&/g; s/^/"/; s/$/"\\/ p g s/.\{148\}// t delim ' >$CONFIG_STATUS || ac_write_fail=1 rm -f conf$$subs.awk cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 _ACAWK cat >>"\$ac_tmp/subs1.awk" <<_ACAWK && for (key in S) S_is_set[key] = 1 FS = "" } { line = $ 0 nfields = split(line, field, "@") substed = 0 len = length(field[1]) for (i = 2; i < nfields; i++) { key = field[i] keylen = length(key) if (S_is_set[key]) { value = S[key] line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3) len += length(value) + length(field[++i]) substed = 1 } else len += 1 + keylen } print line } _ACAWK _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g" else cat fi < "$ac_tmp/subs1.awk" > "$ac_tmp/subs.awk" \ || as_fn_error $? "could not setup config files machinery" "$LINENO" 5 _ACEOF # VPATH may cause trouble with some makes, so we remove sole $(srcdir), # ${srcdir} and @srcdir@ entries from VPATH if srcdir is ".", strip leading and # trailing colons and then remove the whole line if VPATH becomes empty # (actually we leave an empty line to preserve line numbers). if test "x$srcdir" = x.; then ac_vpsub='/^[ ]*VPATH[ ]*=[ ]*/{ h s/// s/^/:/ s/[ ]*$/:/ s/:\$(srcdir):/:/g s/:\${srcdir}:/:/g s/:@srcdir@:/:/g s/^:*// s/:*$// x s/\(=[ ]*\).*/\1/ G s/\n// s/^[^=]*=[ ]*$// }' fi cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 fi # test -n "$CONFIG_FILES" # Set up the scripts for CONFIG_HEADERS section. # No need to generate them if there are no CONFIG_HEADERS. # This happens for instance with `./config.status Makefile'. if test -n "$CONFIG_HEADERS"; then cat >"$ac_tmp/defines.awk" <<\_ACAWK || BEGIN { _ACEOF # Transform confdefs.h into an awk script `defines.awk', embedded as # here-document in config.status, that substitutes the proper values into # config.h.in to produce config.h. # Create a delimiter string that does not exist in confdefs.h, to ease # handling of long lines. ac_delim='%!_!# ' for ac_last_try in false false :; do ac_tt=`sed -n "/$ac_delim/p" confdefs.h` if test -z "$ac_tt"; then break elif $ac_last_try; then as_fn_error $? "could not make $CONFIG_HEADERS" "$LINENO" 5 else ac_delim="$ac_delim!$ac_delim _$ac_delim!! " fi done # For the awk script, D is an array of macro values keyed by name, # likewise P contains macro parameters if any. Preserve backslash # newline sequences. ac_word_re=[_$as_cr_Letters][_$as_cr_alnum]* sed -n ' s/.\{148\}/&'"$ac_delim"'/g t rset :rset s/^[ ]*#[ ]*define[ ][ ]*/ / t def d :def s/\\$// t bsnl s/["\\]/\\&/g s/^ \('"$ac_word_re"'\)\(([^()]*)\)[ ]*\(.*\)/P["\1"]="\2"\ D["\1"]=" \3"/p s/^ \('"$ac_word_re"'\)[ ]*\(.*\)/D["\1"]=" \2"/p d :bsnl s/["\\]/\\&/g s/^ \('"$ac_word_re"'\)\(([^()]*)\)[ ]*\(.*\)/P["\1"]="\2"\ D["\1"]=" \3\\\\\\n"\\/p t cont s/^ \('"$ac_word_re"'\)[ ]*\(.*\)/D["\1"]=" \2\\\\\\n"\\/p t cont d :cont n s/.\{148\}/&'"$ac_delim"'/g t clear :clear s/\\$// t bsnlc s/["\\]/\\&/g; s/^/"/; s/$/"/p d :bsnlc s/["\\]/\\&/g; s/^/"/; s/$/\\\\\\n"\\/p b cont ' >$CONFIG_STATUS || ac_write_fail=1 cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 for (key in D) D_is_set[key] = 1 FS = "" } /^[\t ]*#[\t ]*(define|undef)[\t ]+$ac_word_re([\t (]|\$)/ { line = \$ 0 split(line, arg, " ") if (arg[1] == "#") { defundef = arg[2] mac1 = arg[3] } else { defundef = substr(arg[1], 2) mac1 = arg[2] } split(mac1, mac2, "(") #) macro = mac2[1] prefix = substr(line, 1, index(line, defundef) - 1) if (D_is_set[macro]) { # Preserve the white space surrounding the "#". print prefix "define", macro P[macro] D[macro] next } else { # Replace #undef with comments. This is necessary, for example, # in the case of _POSIX_SOURCE, which is predefined and required # on some systems where configure will not decide to define it. if (defundef == "undef") { print "/*", prefix defundef, macro, "*/" next } } } { print } _ACAWK _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 as_fn_error $? "could not setup config headers machinery" "$LINENO" 5 fi # test -n "$CONFIG_HEADERS" eval set X " :F $CONFIG_FILES :H $CONFIG_HEADERS :C $CONFIG_COMMANDS" shift for ac_tag do case $ac_tag in :[FHLC]) ac_mode=$ac_tag; continue;; esac case $ac_mode$ac_tag in :[FHL]*:*);; :L* | :C*:*) as_fn_error $? "invalid tag \`$ac_tag'" "$LINENO" 5;; :[FH]-) ac_tag=-:-;; :[FH]*) ac_tag=$ac_tag:$ac_tag.in;; esac ac_save_IFS=$IFS IFS=: set x $ac_tag IFS=$ac_save_IFS shift ac_file=$1 shift case $ac_mode in :L) ac_source=$1;; :[FH]) ac_file_inputs= for ac_f do case $ac_f in -) ac_f="$ac_tmp/stdin";; *) # Look for the file first in the build tree, then in the source tree # (if the path is not absolute). The absolute path cannot be DOS-style, # because $ac_f cannot contain `:'. test -f "$ac_f" || case $ac_f in [\\/$]*) false;; *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";; esac || as_fn_error 1 "cannot find input file: \`$ac_f'" "$LINENO" 5;; esac case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac as_fn_append ac_file_inputs " '$ac_f'" done # Let's still pretend it is `configure' which instantiates (i.e., don't # use $as_me), people would be surprised to read: # /* config.h. Generated by config.status. */ configure_input='Generated from '` $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g' `' by configure.' if test x"$ac_file" != x-; then configure_input="$ac_file. $configure_input" { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5 $as_echo "$as_me: creating $ac_file" >&6;} fi # Neutralize special characters interpreted by sed in replacement strings. case $configure_input in #( *\&* | *\|* | *\\* ) ac_sed_conf_input=`$as_echo "$configure_input" | sed 's/[\\\\&|]/\\\\&/g'`;; #( *) ac_sed_conf_input=$configure_input;; esac case $ac_tag in *:-:* | *:-) cat >"$ac_tmp/stdin" \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;; esac ;; esac ac_dir=`$as_dirname -- "$ac_file" || $as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$ac_file" : 'X\(//\)[^/]' \| \ X"$ac_file" : 'X\(//\)$' \| \ X"$ac_file" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$ac_file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` as_dir="$ac_dir"; as_fn_mkdir_p ac_builddir=. case "$ac_dir" in .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'` # A ".." for each directory in $ac_dir_suffix. ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'` case $ac_top_builddir_sub in "") ac_top_builddir_sub=. ac_top_build_prefix= ;; *) ac_top_build_prefix=$ac_top_builddir_sub/ ;; esac ;; esac ac_abs_top_builddir=$ac_pwd ac_abs_builddir=$ac_pwd$ac_dir_suffix # for backward compatibility: ac_top_builddir=$ac_top_build_prefix case $srcdir in .) # We are building in place. ac_srcdir=. ac_top_srcdir=$ac_top_builddir_sub ac_abs_top_srcdir=$ac_pwd ;; [\\/]* | ?:[\\/]* ) # Absolute name. ac_srcdir=$srcdir$ac_dir_suffix; ac_top_srcdir=$srcdir ac_abs_top_srcdir=$srcdir ;; *) # Relative name. ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix ac_top_srcdir=$ac_top_build_prefix$srcdir ac_abs_top_srcdir=$ac_pwd/$srcdir ;; esac ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix case $ac_mode in :F) # # CONFIG_FILE # case $INSTALL in [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;; *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;; esac ac_MKDIR_P=$MKDIR_P case $MKDIR_P in [\\/$]* | ?:[\\/]* ) ;; */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;; esac _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 # If the template does not know about datarootdir, expand it. # FIXME: This hack should be removed a few years after 2.60. ac_datarootdir_hack=; ac_datarootdir_seen= ac_sed_dataroot=' /datarootdir/ { p q } /@datadir@/p /@docdir@/p /@infodir@/p /@localedir@/p /@mandir@/p' case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in *datarootdir*) ac_datarootdir_seen=yes;; *@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5 $as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;} _ACEOF cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_datarootdir_hack=' s&@datadir@&$datadir&g s&@docdir@&$docdir&g s&@infodir@&$infodir&g s&@localedir@&$localedir&g s&@mandir@&$mandir&g s&\\\${datarootdir}&$datarootdir&g' ;; esac _ACEOF # Neutralize VPATH when `$srcdir' = `.'. # Shell code in configure.ac might set extrasub. # FIXME: do we really want to maintain this feature? cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1 ac_sed_extra="$ac_vpsub $extrasub _ACEOF cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1 :t /@[a-zA-Z_][a-zA-Z_0-9]*@/!b s|@configure_input@|$ac_sed_conf_input|;t t s&@top_builddir@&$ac_top_builddir_sub&;t t s&@top_build_prefix@&$ac_top_build_prefix&;t t s&@srcdir@&$ac_srcdir&;t t s&@abs_srcdir@&$ac_abs_srcdir&;t t s&@top_srcdir@&$ac_top_srcdir&;t t s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t s&@builddir@&$ac_builddir&;t t s&@abs_builddir@&$ac_abs_builddir&;t t s&@abs_top_builddir@&$ac_abs_top_builddir&;t t s&@INSTALL@&$ac_INSTALL&;t t s&@MKDIR_P@&$ac_MKDIR_P&;t t $ac_datarootdir_hack " eval sed \"\$ac_sed_extra\" "$ac_file_inputs" | $AWK -f "$ac_tmp/subs.awk" \ >$ac_tmp/out || as_fn_error $? "could not create $ac_file" "$LINENO" 5 test -z "$ac_datarootdir_hack$ac_datarootdir_seen" && { ac_out=`sed -n '/\${datarootdir}/p' "$ac_tmp/out"`; test -n "$ac_out"; } && { ac_out=`sed -n '/^[ ]*datarootdir[ ]*:*=/p' \ "$ac_tmp/out"`; test -z "$ac_out"; } && { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir' which seems to be undefined. Please make sure it is defined" >&5 $as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir' which seems to be undefined. Please make sure it is defined" >&2;} rm -f "$ac_tmp/stdin" case $ac_file in -) cat "$ac_tmp/out" && rm -f "$ac_tmp/out";; *) rm -f "$ac_file" && mv "$ac_tmp/out" "$ac_file";; esac \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;; :H) # # CONFIG_HEADER # if test x"$ac_file" != x-; then { $as_echo "/* $configure_input */" \ && eval '$AWK -f "$ac_tmp/defines.awk"' "$ac_file_inputs" } >"$ac_tmp/config.h" \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 if diff "$ac_file" "$ac_tmp/config.h" >/dev/null 2>&1; then { $as_echo "$as_me:${as_lineno-$LINENO}: $ac_file is unchanged" >&5 $as_echo "$as_me: $ac_file is unchanged" >&6;} else rm -f "$ac_file" mv "$ac_tmp/config.h" "$ac_file" \ || as_fn_error $? "could not create $ac_file" "$LINENO" 5 fi else $as_echo "/* $configure_input */" \ && eval '$AWK -f "$ac_tmp/defines.awk"' "$ac_file_inputs" \ || as_fn_error $? "could not create -" "$LINENO" 5 fi # Compute "$ac_file"'s index in $config_headers. _am_arg="$ac_file" _am_stamp_count=1 for _am_header in $config_headers :; do case $_am_header in $_am_arg | $_am_arg:* ) break ;; * ) _am_stamp_count=`expr $_am_stamp_count + 1` ;; esac done echo "timestamp for $_am_arg" >`$as_dirname -- "$_am_arg" || $as_expr X"$_am_arg" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$_am_arg" : 'X\(//\)[^/]' \| \ X"$_am_arg" : 'X\(//\)$' \| \ X"$_am_arg" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$_am_arg" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'`/stamp-h$_am_stamp_count ;; :C) { $as_echo "$as_me:${as_lineno-$LINENO}: executing $ac_file commands" >&5 $as_echo "$as_me: executing $ac_file commands" >&6;} ;; esac case $ac_file$ac_mode in "depfiles":C) test x"$AMDEP_TRUE" != x"" || { # Older Autoconf quotes --file arguments for eval, but not when files # are listed without --file. Let's play safe and only enable the eval # if we detect the quoting. case $CONFIG_FILES in *\'*) eval set x "$CONFIG_FILES" ;; *) set x $CONFIG_FILES ;; esac shift for mf do # Strip MF so we end up with the name of the file. mf=`echo "$mf" | sed -e 's/:.*$//'` # Check whether this is an Automake generated Makefile or not. # We used to match only the files named 'Makefile.in', but # some people rename them; so instead we look at the file content. # Grep'ing the first line is not enough: some people post-process # each Makefile.in and add a new line on top of each file to say so. # Grep'ing the whole file is not good either: AIX grep has a line # limit of 2048, but all sed's we know have understand at least 4000. if sed -n 's,^#.*generated by automake.*,X,p' "$mf" | grep X >/dev/null 2>&1; then dirpart=`$as_dirname -- "$mf" || $as_expr X"$mf" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$mf" : 'X\(//\)[^/]' \| \ X"$mf" : 'X\(//\)$' \| \ X"$mf" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$mf" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` else continue fi # Extract the definition of DEPDIR, am__include, and am__quote # from the Makefile without running 'make'. DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"` test -z "$DEPDIR" && continue am__include=`sed -n 's/^am__include = //p' < "$mf"` test -z "$am__include" && continue am__quote=`sed -n 's/^am__quote = //p' < "$mf"` # Find all dependency output files, they are included files with # $(DEPDIR) in their names. We invoke sed twice because it is the # simplest approach to changing $(DEPDIR) to its actual value in the # expansion. for file in `sed -n " s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \ sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g'`; do # Make sure the directory exists. test -f "$dirpart/$file" && continue fdir=`$as_dirname -- "$file" || $as_expr X"$file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ X"$file" : 'X\(//\)[^/]' \| \ X"$file" : 'X\(//\)$' \| \ X"$file" : 'X\(/\)' \| . 2>/dev/null || $as_echo X"$file" | sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/ q } /^X\(\/\/\)[^/].*/{ s//\1/ q } /^X\(\/\/\)$/{ s//\1/ q } /^X\(\/\).*/{ s//\1/ q } s/.*/./; q'` as_dir=$dirpart/$fdir; as_fn_mkdir_p # echo "creating $dirpart/$file" echo '# dummy' > "$dirpart/$file" done done } ;; "libtool":C) # See if we are running on zsh, and set the options which allow our # commands through without removal of \ escapes. if test -n "${ZSH_VERSION+set}" ; then setopt NO_GLOB_SUBST fi cfgfile="${ofile}T" trap "$RM \"$cfgfile\"; exit 1" 1 2 15 $RM "$cfgfile" cat <<_LT_EOF >> "$cfgfile" #! $SHELL # `$ECHO "$ofile" | sed 's%^.*/%%'` - Provide generalized library-building support services. # Generated automatically by $as_me ($PACKAGE$TIMESTAMP) $VERSION # Libtool was configured on host `(hostname || uname -n) 2>/dev/null | sed 1q`: # NOTE: Changes made to this file will be lost: look at ltmain.sh. # # Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, # 2006, 2007, 2008, 2009, 2010, 2011 Free Software # Foundation, Inc. # Written by Gordon Matzigkeit, 1996 # # This file is part of GNU Libtool. # # GNU Libtool 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 2 of # the License, or (at your option) any later version. # # As a special exception to the GNU General Public License, # if you distribute this file as part of a program or library that # is built using GNU Libtool, you may include this file under the # same distribution terms that you use for the rest of that program. # # GNU Libtool 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 GNU Libtool; see the file COPYING. If not, a copy # can be downloaded from http://www.gnu.org/licenses/gpl.html, or # obtained by writing to the Free Software Foundation, Inc., # 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. # The names of the tagged configurations supported by this script. available_tags="CXX " # ### BEGIN LIBTOOL CONFIG # Which release of libtool.m4 was used? macro_version=$macro_version macro_revision=$macro_revision # Whether or not to build shared libraries. build_libtool_libs=$enable_shared # Whether or not to build static libraries. build_old_libs=$enable_static # What type of objects to build. pic_mode=$pic_mode # Whether or not to optimize for fast installation. fast_install=$enable_fast_install # Shell to use when invoking shell scripts. SHELL=$lt_SHELL # An echo program that protects backslashes. ECHO=$lt_ECHO # The PATH separator for the build system. PATH_SEPARATOR=$lt_PATH_SEPARATOR # The host system. host_alias=$host_alias host=$host host_os=$host_os # The build system. build_alias=$build_alias build=$build build_os=$build_os # A sed program that does not truncate output. SED=$lt_SED # Sed that helps us avoid accidentally triggering echo(1) options like -n. Xsed="\$SED -e 1s/^X//" # A grep program that handles long lines. GREP=$lt_GREP # An ERE matcher. EGREP=$lt_EGREP # A literal string matcher. FGREP=$lt_FGREP # A BSD- or MS-compatible name lister. NM=$lt_NM # Whether we need soft or hard links. LN_S=$lt_LN_S # What is the maximum length of a command? max_cmd_len=$max_cmd_len # Object file suffix (normally "o"). objext=$ac_objext # Executable file suffix (normally ""). exeext=$exeext # whether the shell understands "unset". lt_unset=$lt_unset # turn spaces into newlines. SP2NL=$lt_lt_SP2NL # turn newlines into spaces. NL2SP=$lt_lt_NL2SP # convert \$build file names to \$host format. to_host_file_cmd=$lt_cv_to_host_file_cmd # convert \$build files to toolchain format. to_tool_file_cmd=$lt_cv_to_tool_file_cmd # An object symbol dumper. OBJDUMP=$lt_OBJDUMP # Method to check whether dependent libraries are shared objects. deplibs_check_method=$lt_deplibs_check_method # Command to use when deplibs_check_method = "file_magic". file_magic_cmd=$lt_file_magic_cmd # How to find potential files when deplibs_check_method = "file_magic". file_magic_glob=$lt_file_magic_glob # Find potential files using nocaseglob when deplibs_check_method = "file_magic". want_nocaseglob=$lt_want_nocaseglob # DLL creation program. DLLTOOL=$lt_DLLTOOL # Command to associate shared and link libraries. sharedlib_from_linklib_cmd=$lt_sharedlib_from_linklib_cmd # The archiver. AR=$lt_AR # Flags to create an archive. AR_FLAGS=$lt_AR_FLAGS # How to feed a file listing to the archiver. archiver_list_spec=$lt_archiver_list_spec # A symbol stripping program. STRIP=$lt_STRIP # Commands used to install an old-style archive. RANLIB=$lt_RANLIB old_postinstall_cmds=$lt_old_postinstall_cmds old_postuninstall_cmds=$lt_old_postuninstall_cmds # Whether to use a lock for old archive extraction. lock_old_archive_extraction=$lock_old_archive_extraction # A C compiler. LTCC=$lt_CC # LTCC compiler flags. LTCFLAGS=$lt_CFLAGS # Take the output of nm and produce a listing of raw symbols and C names. global_symbol_pipe=$lt_lt_cv_sys_global_symbol_pipe # Transform the output of nm in a proper C declaration. global_symbol_to_cdecl=$lt_lt_cv_sys_global_symbol_to_cdecl # Transform the output of nm in a C name address pair. global_symbol_to_c_name_address=$lt_lt_cv_sys_global_symbol_to_c_name_address # Transform the output of nm in a C name address pair when lib prefix is needed. global_symbol_to_c_name_address_lib_prefix=$lt_lt_cv_sys_global_symbol_to_c_name_address_lib_prefix # Specify filename containing input files for \$NM. nm_file_list_spec=$lt_nm_file_list_spec # The root where to search for dependent libraries,and in which our libraries should be installed. lt_sysroot=$lt_sysroot # The name of the directory that contains temporary libtool files. objdir=$objdir # Used to examine libraries when file_magic_cmd begins with "file". MAGIC_CMD=$MAGIC_CMD # Must we lock files when doing compilation? need_locks=$lt_need_locks # Manifest tool. MANIFEST_TOOL=$lt_MANIFEST_TOOL # Tool to manipulate archived DWARF debug symbol files on Mac OS X. DSYMUTIL=$lt_DSYMUTIL # Tool to change global to local symbols on Mac OS X. NMEDIT=$lt_NMEDIT # Tool to manipulate fat objects and archives on Mac OS X. LIPO=$lt_LIPO # ldd/readelf like tool for Mach-O binaries on Mac OS X. OTOOL=$lt_OTOOL # ldd/readelf like tool for 64 bit Mach-O binaries on Mac OS X 10.4. OTOOL64=$lt_OTOOL64 # Old archive suffix (normally "a"). libext=$libext # Shared library suffix (normally ".so"). shrext_cmds=$lt_shrext_cmds # The commands to extract the exported symbol list from a shared archive. extract_expsyms_cmds=$lt_extract_expsyms_cmds # Variables whose values should be saved in libtool wrapper scripts and # restored at link time. variables_saved_for_relink=$lt_variables_saved_for_relink # Do we need the "lib" prefix for modules? need_lib_prefix=$need_lib_prefix # Do we need a version for libraries? need_version=$need_version # Library versioning type. version_type=$version_type # Shared library runtime path variable. runpath_var=$runpath_var # Shared library path variable. shlibpath_var=$shlibpath_var # Is shlibpath searched before the hard-coded library search path? shlibpath_overrides_runpath=$shlibpath_overrides_runpath # Format of library name prefix. libname_spec=$lt_libname_spec # List of archive names. First name is the real one, the rest are links. # The last name is the one that the linker finds with -lNAME library_names_spec=$lt_library_names_spec # The coded name of the library, if different from the real name. soname_spec=$lt_soname_spec # Permission mode override for installation of shared libraries. install_override_mode=$lt_install_override_mode # Command to use after installation of a shared archive. postinstall_cmds=$lt_postinstall_cmds # Command to use after uninstallation of a shared archive. postuninstall_cmds=$lt_postuninstall_cmds # Commands used to finish a libtool library installation in a directory. finish_cmds=$lt_finish_cmds # As "finish_cmds", except a single script fragment to be evaled but # not shown. finish_eval=$lt_finish_eval # Whether we should hardcode library paths into libraries. hardcode_into_libs=$hardcode_into_libs # Compile-time system search path for libraries. sys_lib_search_path_spec=$lt_sys_lib_search_path_spec # Run-time system search path for libraries. sys_lib_dlsearch_path_spec=$lt_sys_lib_dlsearch_path_spec # Whether dlopen is supported. dlopen_support=$enable_dlopen # Whether dlopen of programs is supported. dlopen_self=$enable_dlopen_self # Whether dlopen of statically linked programs is supported. dlopen_self_static=$enable_dlopen_self_static # Commands to strip libraries. old_striplib=$lt_old_striplib striplib=$lt_striplib # The linker used to build libraries. LD=$lt_LD # How to create reloadable object files. reload_flag=$lt_reload_flag reload_cmds=$lt_reload_cmds # Commands used to build an old-style archive. old_archive_cmds=$lt_old_archive_cmds # A language specific compiler. CC=$lt_compiler # Is the compiler the GNU compiler? with_gcc=$GCC # Compiler flag to turn off builtin functions. no_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag # Additional compiler flags for building library objects. pic_flag=$lt_lt_prog_compiler_pic # How to pass a linker flag through the compiler. wl=$lt_lt_prog_compiler_wl # Compiler flag to prevent dynamic linking. link_static_flag=$lt_lt_prog_compiler_static # Does compiler simultaneously support -c and -o options? compiler_c_o=$lt_lt_cv_prog_compiler_c_o # Whether or not to add -lc for building shared libraries. build_libtool_need_lc=$archive_cmds_need_lc # Whether or not to disallow shared libs when runtime libs are static. allow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes # Compiler flag to allow reflexive dlopens. export_dynamic_flag_spec=$lt_export_dynamic_flag_spec # Compiler flag to generate shared objects directly from archives. whole_archive_flag_spec=$lt_whole_archive_flag_spec # Whether the compiler copes with passing no objects directly. compiler_needs_object=$lt_compiler_needs_object # Create an old-style archive from a shared archive. old_archive_from_new_cmds=$lt_old_archive_from_new_cmds # Create a temporary old-style archive to link instead of a shared archive. old_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds # Commands used to build a shared archive. archive_cmds=$lt_archive_cmds archive_expsym_cmds=$lt_archive_expsym_cmds # Commands used to build a loadable module if different from building # a shared archive. module_cmds=$lt_module_cmds module_expsym_cmds=$lt_module_expsym_cmds # Whether we are building with GNU ld or not. with_gnu_ld=$lt_with_gnu_ld # Flag that allows shared libraries with undefined symbols to be built. allow_undefined_flag=$lt_allow_undefined_flag # Flag that enforces no undefined symbols. no_undefined_flag=$lt_no_undefined_flag # Flag to hardcode \$libdir into a binary during linking. # This must work even if \$libdir does not exist hardcode_libdir_flag_spec=$lt_hardcode_libdir_flag_spec # Whether we need a single "-rpath" flag with a separated argument. hardcode_libdir_separator=$lt_hardcode_libdir_separator # Set to "yes" if using DIR/libNAME\${shared_ext} during linking hardcodes # DIR into the resulting binary. hardcode_direct=$hardcode_direct # Set to "yes" if using DIR/libNAME\${shared_ext} during linking hardcodes # DIR into the resulting binary and the resulting library dependency is # "absolute",i.e impossible to change by setting \${shlibpath_var} if the # library is relocated. hardcode_direct_absolute=$hardcode_direct_absolute # Set to "yes" if using the -LDIR flag during linking hardcodes DIR # into the resulting binary. hardcode_minus_L=$hardcode_minus_L # Set to "yes" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR # into the resulting binary. hardcode_shlibpath_var=$hardcode_shlibpath_var # Set to "yes" if building a shared library automatically hardcodes DIR # into the library and all subsequent libraries and executables linked # against it. hardcode_automatic=$hardcode_automatic # Set to yes if linker adds runtime paths of dependent libraries # to runtime path list. inherit_rpath=$inherit_rpath # Whether libtool must link a program against all its dependency libraries. link_all_deplibs=$link_all_deplibs # Set to "yes" if exported symbols are required. always_export_symbols=$always_export_symbols # The commands to list exported symbols. export_symbols_cmds=$lt_export_symbols_cmds # Symbols that should not be listed in the preloaded symbols. exclude_expsyms=$lt_exclude_expsyms # Symbols that must always be exported. include_expsyms=$lt_include_expsyms # Commands necessary for linking programs (against libraries) with templates. prelink_cmds=$lt_prelink_cmds # Commands necessary for finishing linking programs. postlink_cmds=$lt_postlink_cmds # Specify filename containing input files. file_list_spec=$lt_file_list_spec # How to hardcode a shared library path into an executable. hardcode_action=$hardcode_action # The directories searched by this compiler when creating a shared library. compiler_lib_search_dirs=$lt_compiler_lib_search_dirs # Dependencies to place before and after the objects being linked to # create a shared library. predep_objects=$lt_predep_objects postdep_objects=$lt_postdep_objects predeps=$lt_predeps postdeps=$lt_postdeps # The library search path used internally by the compiler when linking # a shared library. compiler_lib_search_path=$lt_compiler_lib_search_path # ### END LIBTOOL CONFIG _LT_EOF case $host_os in aix3*) cat <<\_LT_EOF >> "$cfgfile" # AIX sometimes has problems with the GCC collect2 program. For some # reason, if we set the COLLECT_NAMES environment variable, the problems # vanish in a puff of smoke. if test "X${COLLECT_NAMES+set}" != Xset; then COLLECT_NAMES= export COLLECT_NAMES fi _LT_EOF ;; esac ltmain="$ac_aux_dir/ltmain.sh" # We use sed instead of cat because bash on DJGPP gets confused if # if finds mixed CR/LF and LF-only lines. Since sed operates in # text mode, it properly converts lines to CR/LF. This bash problem # is reportedly fixed, but why not run on old versions too? sed '$q' "$ltmain" >> "$cfgfile" \ || (rm -f "$cfgfile"; exit 1) if test x"$xsi_shell" = xyes; then sed -e '/^func_dirname ()$/,/^} # func_dirname /c\ func_dirname ()\ {\ \ case ${1} in\ \ */*) func_dirname_result="${1%/*}${2}" ;;\ \ * ) func_dirname_result="${3}" ;;\ \ esac\ } # Extended-shell func_dirname implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_basename ()$/,/^} # func_basename /c\ func_basename ()\ {\ \ func_basename_result="${1##*/}"\ } # Extended-shell func_basename implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_dirname_and_basename ()$/,/^} # func_dirname_and_basename /c\ func_dirname_and_basename ()\ {\ \ case ${1} in\ \ */*) func_dirname_result="${1%/*}${2}" ;;\ \ * ) func_dirname_result="${3}" ;;\ \ esac\ \ func_basename_result="${1##*/}"\ } # Extended-shell func_dirname_and_basename implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_stripname ()$/,/^} # func_stripname /c\ func_stripname ()\ {\ \ # pdksh 5.2.14 does not do ${X%$Y} correctly if both X and Y are\ \ # positional parameters, so assign one to ordinary parameter first.\ \ func_stripname_result=${3}\ \ func_stripname_result=${func_stripname_result#"${1}"}\ \ func_stripname_result=${func_stripname_result%"${2}"}\ } # Extended-shell func_stripname implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_split_long_opt ()$/,/^} # func_split_long_opt /c\ func_split_long_opt ()\ {\ \ func_split_long_opt_name=${1%%=*}\ \ func_split_long_opt_arg=${1#*=}\ } # Extended-shell func_split_long_opt implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_split_short_opt ()$/,/^} # func_split_short_opt /c\ func_split_short_opt ()\ {\ \ func_split_short_opt_arg=${1#??}\ \ func_split_short_opt_name=${1%"$func_split_short_opt_arg"}\ } # Extended-shell func_split_short_opt implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_lo2o ()$/,/^} # func_lo2o /c\ func_lo2o ()\ {\ \ case ${1} in\ \ *.lo) func_lo2o_result=${1%.lo}.${objext} ;;\ \ *) func_lo2o_result=${1} ;;\ \ esac\ } # Extended-shell func_lo2o implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_xform ()$/,/^} # func_xform /c\ func_xform ()\ {\ func_xform_result=${1%.*}.lo\ } # Extended-shell func_xform implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_arith ()$/,/^} # func_arith /c\ func_arith ()\ {\ func_arith_result=$(( $* ))\ } # Extended-shell func_arith implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_len ()$/,/^} # func_len /c\ func_len ()\ {\ func_len_result=${#1}\ } # Extended-shell func_len implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: fi if test x"$lt_shell_append" = xyes; then sed -e '/^func_append ()$/,/^} # func_append /c\ func_append ()\ {\ eval "${1}+=\\${2}"\ } # Extended-shell func_append implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: sed -e '/^func_append_quoted ()$/,/^} # func_append_quoted /c\ func_append_quoted ()\ {\ \ func_quote_for_eval "${2}"\ \ eval "${1}+=\\\\ \\$func_quote_for_eval_result"\ } # Extended-shell func_append_quoted implementation' "$cfgfile" > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: # Save a `func_append' function call where possible by direct use of '+=' sed -e 's%func_append \([a-zA-Z_]\{1,\}\) "%\1+="%g' $cfgfile > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: else # Save a `func_append' function call even when '+=' is not available sed -e 's%func_append \([a-zA-Z_]\{1,\}\) "%\1="$\1%g' $cfgfile > $cfgfile.tmp \ && mv -f "$cfgfile.tmp" "$cfgfile" \ || (rm -f "$cfgfile" && cp "$cfgfile.tmp" "$cfgfile" && rm -f "$cfgfile.tmp") test 0 -eq $? || _lt_function_replace_fail=: fi if test x"$_lt_function_replace_fail" = x":"; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: Unable to substitute extended shell functions in $ofile" >&5 $as_echo "$as_me: WARNING: Unable to substitute extended shell functions in $ofile" >&2;} fi mv -f "$cfgfile" "$ofile" || (rm -f "$ofile" && cp "$cfgfile" "$ofile" && rm -f "$cfgfile") chmod +x "$ofile" cat <<_LT_EOF >> "$ofile" # ### BEGIN LIBTOOL TAG CONFIG: CXX # The linker used to build libraries. LD=$lt_LD_CXX # How to create reloadable object files. reload_flag=$lt_reload_flag_CXX reload_cmds=$lt_reload_cmds_CXX # Commands used to build an old-style archive. old_archive_cmds=$lt_old_archive_cmds_CXX # A language specific compiler. CC=$lt_compiler_CXX # Is the compiler the GNU compiler? with_gcc=$GCC_CXX # Compiler flag to turn off builtin functions. no_builtin_flag=$lt_lt_prog_compiler_no_builtin_flag_CXX # Additional compiler flags for building library objects. pic_flag=$lt_lt_prog_compiler_pic_CXX # How to pass a linker flag through the compiler. wl=$lt_lt_prog_compiler_wl_CXX # Compiler flag to prevent dynamic linking. link_static_flag=$lt_lt_prog_compiler_static_CXX # Does compiler simultaneously support -c and -o options? compiler_c_o=$lt_lt_cv_prog_compiler_c_o_CXX # Whether or not to add -lc for building shared libraries. build_libtool_need_lc=$archive_cmds_need_lc_CXX # Whether or not to disallow shared libs when runtime libs are static. allow_libtool_libs_with_static_runtimes=$enable_shared_with_static_runtimes_CXX # Compiler flag to allow reflexive dlopens. export_dynamic_flag_spec=$lt_export_dynamic_flag_spec_CXX # Compiler flag to generate shared objects directly from archives. whole_archive_flag_spec=$lt_whole_archive_flag_spec_CXX # Whether the compiler copes with passing no objects directly. compiler_needs_object=$lt_compiler_needs_object_CXX # Create an old-style archive from a shared archive. old_archive_from_new_cmds=$lt_old_archive_from_new_cmds_CXX # Create a temporary old-style archive to link instead of a shared archive. old_archive_from_expsyms_cmds=$lt_old_archive_from_expsyms_cmds_CXX # Commands used to build a shared archive. archive_cmds=$lt_archive_cmds_CXX archive_expsym_cmds=$lt_archive_expsym_cmds_CXX # Commands used to build a loadable module if different from building # a shared archive. module_cmds=$lt_module_cmds_CXX module_expsym_cmds=$lt_module_expsym_cmds_CXX # Whether we are building with GNU ld or not. with_gnu_ld=$lt_with_gnu_ld_CXX # Flag that allows shared libraries with undefined symbols to be built. allow_undefined_flag=$lt_allow_undefined_flag_CXX # Flag that enforces no undefined symbols. no_undefined_flag=$lt_no_undefined_flag_CXX # Flag to hardcode \$libdir into a binary during linking. # This must work even if \$libdir does not exist hardcode_libdir_flag_spec=$lt_hardcode_libdir_flag_spec_CXX # Whether we need a single "-rpath" flag with a separated argument. hardcode_libdir_separator=$lt_hardcode_libdir_separator_CXX # Set to "yes" if using DIR/libNAME\${shared_ext} during linking hardcodes # DIR into the resulting binary. hardcode_direct=$hardcode_direct_CXX # Set to "yes" if using DIR/libNAME\${shared_ext} during linking hardcodes # DIR into the resulting binary and the resulting library dependency is # "absolute",i.e impossible to change by setting \${shlibpath_var} if the # library is relocated. hardcode_direct_absolute=$hardcode_direct_absolute_CXX # Set to "yes" if using the -LDIR flag during linking hardcodes DIR # into the resulting binary. hardcode_minus_L=$hardcode_minus_L_CXX # Set to "yes" if using SHLIBPATH_VAR=DIR during linking hardcodes DIR # into the resulting binary. hardcode_shlibpath_var=$hardcode_shlibpath_var_CXX # Set to "yes" if building a shared library automatically hardcodes DIR # into the library and all subsequent libraries and executables linked # against it. hardcode_automatic=$hardcode_automatic_CXX # Set to yes if linker adds runtime paths of dependent libraries # to runtime path list. inherit_rpath=$inherit_rpath_CXX # Whether libtool must link a program against all its dependency libraries. link_all_deplibs=$link_all_deplibs_CXX # Set to "yes" if exported symbols are required. always_export_symbols=$always_export_symbols_CXX # The commands to list exported symbols. export_symbols_cmds=$lt_export_symbols_cmds_CXX # Symbols that should not be listed in the preloaded symbols. exclude_expsyms=$lt_exclude_expsyms_CXX # Symbols that must always be exported. include_expsyms=$lt_include_expsyms_CXX # Commands necessary for linking programs (against libraries) with templates. prelink_cmds=$lt_prelink_cmds_CXX # Commands necessary for finishing linking programs. postlink_cmds=$lt_postlink_cmds_CXX # Specify filename containing input files. file_list_spec=$lt_file_list_spec_CXX # How to hardcode a shared library path into an executable. hardcode_action=$hardcode_action_CXX # The directories searched by this compiler when creating a shared library. compiler_lib_search_dirs=$lt_compiler_lib_search_dirs_CXX # Dependencies to place before and after the objects being linked to # create a shared library. predep_objects=$lt_predep_objects_CXX postdep_objects=$lt_postdep_objects_CXX predeps=$lt_predeps_CXX postdeps=$lt_postdeps_CXX # The library search path used internally by the compiler when linking # a shared library. compiler_lib_search_path=$lt_compiler_lib_search_path_CXX # ### END LIBTOOL TAG CONFIG: CXX _LT_EOF ;; esac done # for ac_tag as_fn_exit 0 _ACEOF ac_clean_files=$ac_clean_files_save test $ac_write_fail = 0 || as_fn_error $? "write failure creating $CONFIG_STATUS" "$LINENO" 5 # configure is writing to config.log, and then calls config.status. # config.status does its own redirection, appending to config.log. # Unfortunately, on DOS this fails, as config.log is still kept open # by configure, so config.status won't be able to write to it; its # output is simply discarded. So we exec the FD to /dev/null, # effectively closing config.log, so it can be properly (re)opened and # appended to by config.status. When coming back to configure, we # need to make the FD available again. if test "$no_create" != yes; then ac_cs_success=: ac_config_status_args= test "$silent" = yes && ac_config_status_args="$ac_config_status_args --quiet" exec 5>/dev/null $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false exec 5>>config.log # Use ||, not &&, to avoid exiting from the if with $? = 1, which # would make configure fail if this is the last instruction. $ac_cs_success || as_fn_exit 1 fi if test -n "$ac_unrecognized_opts" && test "$enable_option_checking" != no; then { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: unrecognized options: $ac_unrecognized_opts" >&5 $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2;} fi madp-0.4/PaxHeaders.5405/Makefile.in0000644000000000000000000000013212717644307014030 xustar0030 mtime=1463765191.961625438 30 atime=1463765200.073560647 30 ctime=1463765200.997553268 madp-0.4/Makefile.in0000664000372100037210000006300112717644307014664 0ustar00fransfrans00000000000000# Makefile.in generated by automake 1.14.1 from Makefile.am. # @configure_input@ # Copyright (C) 1994-2013 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ VPATH = @srcdir@ am__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)' am__make_running_with_option = \ case $${target_option-} in \ ?) ;; \ *) echo "am__make_running_with_option: internal error: invalid" \ "target option '$${target_option-}' specified" >&2; \ exit 1;; \ esac; \ has_opt=no; \ sane_makeflags=$$MAKEFLAGS; \ if $(am__is_gnu_make); then \ sane_makeflags=$$MFLAGS; \ else \ case $$MAKEFLAGS in \ *\\[\ \ ]*) \ bs=\\; \ sane_makeflags=`printf '%s\n' "$$MAKEFLAGS" \ | sed "s/$$bs$$bs[$$bs $$bs ]*//g"`;; \ esac; \ fi; \ skip_next=no; \ strip_trailopt () \ { \ flg=`printf '%s\n' "$$flg" | sed "s/$$1.*$$//"`; \ }; \ for flg in $$sane_makeflags; do \ test $$skip_next = yes && { skip_next=no; continue; }; \ case $$flg in \ *=*|--*) continue;; \ -*I) strip_trailopt 'I'; skip_next=yes;; \ -*I?*) strip_trailopt 'I';; \ -*O) strip_trailopt 'O'; skip_next=yes;; \ -*O?*) strip_trailopt 'O';; \ -*l) strip_trailopt 'l'; skip_next=yes;; \ -*l?*) strip_trailopt 'l';; \ -[dEDm]) skip_next=yes;; \ -[JT]) skip_next=yes;; \ esac; \ case $$flg in \ *$$target_option*) has_opt=yes; break;; \ esac; \ done; \ test $$has_opt = yes am__make_dryrun = (target_option=n; $(am__make_running_with_option)) am__make_keepgoing = (target_option=k; $(am__make_running_with_option)) pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ subdir = . DIST_COMMON = INSTALL NEWS README AUTHORS ChangeLog \ $(srcdir)/Makefile.in $(srcdir)/Makefile.am \ $(top_srcdir)/configure $(am__configure_deps) \ $(srcdir)/config.h.in COPYING compile config.guess config.sub \ depcomp install-sh missing ltmain.sh ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_cplex.m4 \ $(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \ $(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \ $(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) am__CONFIG_DISTCLEAN_FILES = config.status config.cache config.log \ configure.lineno config.status.lineno mkinstalldirs = $(install_sh) -d CONFIG_HEADER = config.h CONFIG_CLEAN_FILES = CONFIG_CLEAN_VPATH_FILES = AM_V_P = $(am__v_P_@AM_V@) am__v_P_ = $(am__v_P_@AM_DEFAULT_V@) am__v_P_0 = false am__v_P_1 = : AM_V_GEN = $(am__v_GEN_@AM_V@) am__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@) am__v_GEN_0 = @echo " GEN " $@; am__v_GEN_1 = AM_V_at = $(am__v_at_@AM_V@) am__v_at_ = $(am__v_at_@AM_DEFAULT_V@) am__v_at_0 = @ am__v_at_1 = SOURCES = DIST_SOURCES = RECURSIVE_TARGETS = all-recursive check-recursive cscopelist-recursive \ ctags-recursive dvi-recursive html-recursive info-recursive \ install-data-recursive install-dvi-recursive \ install-exec-recursive install-html-recursive \ install-info-recursive install-pdf-recursive \ install-ps-recursive install-recursive installcheck-recursive \ installdirs-recursive pdf-recursive ps-recursive \ tags-recursive uninstall-recursive am__can_run_installinfo = \ case $$AM_UPDATE_INFO_DIR in \ n|no|NO) false;; \ *) (install-info --version) >/dev/null 2>&1;; \ esac RECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive \ distclean-recursive maintainer-clean-recursive am__recursive_targets = \ $(RECURSIVE_TARGETS) \ $(RECURSIVE_CLEAN_TARGETS) \ $(am__extra_recursive_targets) AM_RECURSIVE_TARGETS = $(am__recursive_targets:-recursive=) TAGS CTAGS \ cscope distdir dist dist-all distcheck am__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) \ $(LISP)config.h.in # Read a list of newline-separated strings from the standard input, # and print each of them once, without duplicates. Input order is # *not* preserved. am__uniquify_input = $(AWK) '\ BEGIN { nonempty = 0; } \ { items[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in items) print i; }; } \ ' # Make sure the list of sources is unique. This is necessary because, # e.g., the same source file might be shared among _SOURCES variables # for different programs/libraries. am__define_uniq_tagged_files = \ list='$(am__tagged_files)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | $(am__uniquify_input)` ETAGS = etags CTAGS = ctags CSCOPE = cscope DIST_SUBDIRS = $(SUBDIRS) DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) distdir = $(PACKAGE)-$(VERSION) top_distdir = $(distdir) am__remove_distdir = \ if test -d "$(distdir)"; then \ find "$(distdir)" -type d ! -perm -200 -exec chmod u+w {} ';' \ && rm -rf "$(distdir)" \ || { sleep 5 && rm -rf "$(distdir)"; }; \ else :; fi am__post_remove_distdir = $(am__remove_distdir) am__relativize = \ dir0=`pwd`; \ sed_first='s,^\([^/]*\)/.*$$,\1,'; \ sed_rest='s,^[^/]*/*,,'; \ sed_last='s,^.*/\([^/]*\)$$,\1,'; \ sed_butlast='s,/*[^/]*$$,,'; \ while test -n "$$dir1"; do \ first=`echo "$$dir1" | sed -e "$$sed_first"`; \ if test "$$first" != "."; then \ if test "$$first" = ".."; then \ dir2=`echo "$$dir0" | sed -e "$$sed_last"`/"$$dir2"; \ dir0=`echo "$$dir0" | sed -e "$$sed_butlast"`; \ else \ first2=`echo "$$dir2" | sed -e "$$sed_first"`; \ if test "$$first2" = "$$first"; then \ dir2=`echo "$$dir2" | sed -e "$$sed_rest"`; \ else \ dir2="../$$dir2"; \ fi; \ dir0="$$dir0"/"$$first"; \ fi; \ fi; \ dir1=`echo "$$dir1" | sed -e "$$sed_rest"`; \ done; \ reldir="$$dir2" DIST_ARCHIVES = $(distdir).tar.gz GZIP_ENV = --best DIST_TARGETS = dist-gzip distuninstallcheck_listfiles = find . -type f -print am__distuninstallcheck_listfiles = $(distuninstallcheck_listfiles) \ | sed 's|^\./|$(prefix)/|' | grep -v '$(infodir)/dir$$' distcleancheck_listfiles = find . -type f -print ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ AM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFLAGS = @CFLAGS@ CPLEX_INCLUDES = @CPLEX_INCLUDES@ CPLEX_LDFLAGS = @CPLEX_LDFLAGS@ CPLEX_LIBS = @CPLEX_LIBS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CSTANDARD = @CSTANDARD@ CSTD = @CSTD@ CSTD11 = @CSTD11@ CSTDGNU = @CSTDGNU@ CSTDGNU11 = @CSTDGNU11@ CXX = @CXX@ CXXCPP = @CXXCPP@ CXXDEPMODE = @CXXDEPMODE@ CXXFLAGS = @CXXFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DLLTOOL = @DLLTOOL@ DSYMUTIL = @DSYMUTIL@ DUMPBIN = @DUMPBIN@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ FGREP = @FGREP@ GREP = @GREP@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LD = @LD@ LDFLAGS = @LDFLAGS@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LIBTOOL = @LIBTOOL@ LIPO = @LIPO@ LN_S = @LN_S@ LTLIBOBJS = @LTLIBOBJS@ MAKEINFO = @MAKEINFO@ MANIFEST_TOOL = @MANIFEST_TOOL@ MKDIR_P = @MKDIR_P@ NM = @NM@ NMEDIT = @NMEDIT@ OBJDUMP = @OBJDUMP@ OBJEXT = @OBJEXT@ OTOOL = @OTOOL@ OTOOL64 = @OTOOL64@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ POW_LIB = @POW_LIB@ RANLIB = @RANLIB@ SED = @SED@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STRIP = @STRIP@ VERSION = @VERSION@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_AR = @ac_ct_AR@ ac_ct_CC = @ac_ct_CC@ ac_ct_CXX = @ac_ct_CXX@ ac_ct_DUMPBIN = @ac_ct_DUMPBIN@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localedir = @localedir@ localstatedir = @localstatedir@ mandir = @mandir@ mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ ACLOCAL_AMFLAGS = -I m4 SUBDIRS = src EXTRA_DIST = src/include/versions.h \ src/include/configuration.h \ src/parser/dpomdp.spirit \ src/parser/pomdp.spirit \ problems \ doc \ src/boost \ src/solvers/GMAA-IC \ src/solvers/GMAA-ICE all: config.h $(MAKE) $(AM_MAKEFLAGS) all-recursive .SUFFIXES: am--refresh: Makefile @: $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ echo ' cd $(srcdir) && $(AUTOMAKE) --gnu'; \ $(am__cd) $(srcdir) && $(AUTOMAKE) --gnu \ && exit 0; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --gnu Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ echo ' $(SHELL) ./config.status'; \ $(SHELL) ./config.status;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe);; \ esac; $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) $(SHELL) ./config.status --recheck $(top_srcdir)/configure: $(am__configure_deps) $(am__cd) $(srcdir) && $(AUTOCONF) $(ACLOCAL_M4): $(am__aclocal_m4_deps) $(am__cd) $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS) $(am__aclocal_m4_deps): config.h: stamp-h1 @test -f $@ || rm -f stamp-h1 @test -f $@ || $(MAKE) $(AM_MAKEFLAGS) stamp-h1 stamp-h1: $(srcdir)/config.h.in $(top_builddir)/config.status @rm -f stamp-h1 cd $(top_builddir) && $(SHELL) ./config.status config.h $(srcdir)/config.h.in: $(am__configure_deps) ($(am__cd) $(top_srcdir) && $(AUTOHEADER)) rm -f stamp-h1 touch $@ distclean-hdr: -rm -f config.h stamp-h1 mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs distclean-libtool: -rm -f libtool config.lt # This directory's subdirectories are mostly independent; you can cd # into them and run 'make' without going through this Makefile. # To change the values of 'make' variables: instead of editing Makefiles, # (1) if the variable is set in 'config.status', edit 'config.status' # (which will cause the Makefiles to be regenerated when you run 'make'); # (2) otherwise, pass the desired values on the 'make' command line. $(am__recursive_targets): @fail=; \ if $(am__make_keepgoing); then \ failcom='fail=yes'; \ else \ failcom='exit 1'; \ fi; \ dot_seen=no; \ target=`echo $@ | sed s/-recursive//`; \ case "$@" in \ distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \ *) list='$(SUBDIRS)' ;; \ esac; \ for subdir in $$list; do \ echo "Making $$target in $$subdir"; \ if test "$$subdir" = "."; then \ dot_seen=yes; \ local_target="$$target-am"; \ else \ local_target="$$target"; \ fi; \ ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \ || eval $$failcom; \ done; \ if test "$$dot_seen" = "no"; then \ $(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \ fi; test -z "$$fail" ID: $(am__tagged_files) $(am__define_uniq_tagged_files); mkid -fID $$unique tags: tags-recursive TAGS: tags tags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files) set x; \ here=`pwd`; \ if ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \ include_option=--etags-include; \ empty_fix=.; \ else \ include_option=--include; \ empty_fix=; \ fi; \ list='$(SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ test ! -f $$subdir/TAGS || \ set "$$@" "$$include_option=$$here/$$subdir/TAGS"; \ fi; \ done; \ $(am__define_uniq_tagged_files); \ shift; \ if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \ test -n "$$unique" || unique=$$empty_fix; \ if test $$# -gt 0; then \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ "$$@" $$unique; \ else \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ $$unique; \ fi; \ fi ctags: ctags-recursive CTAGS: ctags ctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files) $(am__define_uniq_tagged_files); \ test -z "$(CTAGS_ARGS)$$unique" \ || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \ $$unique GTAGS: here=`$(am__cd) $(top_builddir) && pwd` \ && $(am__cd) $(top_srcdir) \ && gtags -i $(GTAGS_ARGS) "$$here" cscope: cscope.files test ! -s cscope.files \ || $(CSCOPE) -b -q $(AM_CSCOPEFLAGS) $(CSCOPEFLAGS) -i cscope.files $(CSCOPE_ARGS) clean-cscope: -rm -f cscope.files cscope.files: clean-cscope cscopelist cscopelist: cscopelist-recursive cscopelist-am: $(am__tagged_files) list='$(am__tagged_files)'; \ case "$(srcdir)" in \ [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \ *) sdir=$(subdir)/$(srcdir) ;; \ esac; \ for i in $$list; do \ if test -f "$$i"; then \ echo "$(subdir)/$$i"; \ else \ echo "$$sdir/$$i"; \ fi; \ done >> $(top_builddir)/cscope.files distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags -rm -f cscope.out cscope.in.out cscope.po.out cscope.files distdir: $(DISTFILES) $(am__remove_distdir) test -d "$(distdir)" || mkdir "$(distdir)" @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done @list='$(DIST_SUBDIRS)'; for subdir in $$list; do \ if test "$$subdir" = .; then :; else \ $(am__make_dryrun) \ || test -d "$(distdir)/$$subdir" \ || $(MKDIR_P) "$(distdir)/$$subdir" \ || exit 1; \ dir1=$$subdir; dir2="$(distdir)/$$subdir"; \ $(am__relativize); \ new_distdir=$$reldir; \ dir1=$$subdir; dir2="$(top_distdir)"; \ $(am__relativize); \ new_top_distdir=$$reldir; \ echo " (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) top_distdir="$$new_top_distdir" distdir="$$new_distdir" \\"; \ echo " am__remove_distdir=: am__skip_length_check=: am__skip_mode_fix=: distdir)"; \ ($(am__cd) $$subdir && \ $(MAKE) $(AM_MAKEFLAGS) \ top_distdir="$$new_top_distdir" \ distdir="$$new_distdir" \ am__remove_distdir=: \ am__skip_length_check=: \ am__skip_mode_fix=: \ distdir) \ || exit 1; \ fi; \ done $(MAKE) $(AM_MAKEFLAGS) \ top_distdir="$(top_distdir)" distdir="$(distdir)" \ dist-hook -test -n "$(am__skip_mode_fix)" \ || find "$(distdir)" -type d ! -perm -755 \ -exec chmod u+rwx,go+rx {} \; -o \ ! -type d ! -perm -444 -links 1 -exec chmod a+r {} \; -o \ ! -type d ! -perm -400 -exec chmod a+r {} \; -o \ ! -type d ! -perm -444 -exec $(install_sh) -c -m a+r {} {} \; \ || chmod -R a+r "$(distdir)" dist-gzip: distdir tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz $(am__post_remove_distdir) dist-bzip2: distdir tardir=$(distdir) && $(am__tar) | BZIP2=$${BZIP2--9} bzip2 -c >$(distdir).tar.bz2 $(am__post_remove_distdir) dist-lzip: distdir tardir=$(distdir) && $(am__tar) | lzip -c $${LZIP_OPT--9} >$(distdir).tar.lz $(am__post_remove_distdir) dist-xz: distdir tardir=$(distdir) && $(am__tar) | XZ_OPT=$${XZ_OPT--e} xz -c >$(distdir).tar.xz $(am__post_remove_distdir) dist-tarZ: distdir @echo WARNING: "Support for shar distribution archives is" \ "deprecated." >&2 @echo WARNING: "It will be removed altogether in Automake 2.0" >&2 tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z $(am__post_remove_distdir) dist-shar: distdir @echo WARNING: "Support for distribution archives compressed with" \ "legacy program 'compress' is deprecated." >&2 @echo WARNING: "It will be removed altogether in Automake 2.0" >&2 shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz $(am__post_remove_distdir) dist-zip: distdir -rm -f $(distdir).zip zip -rq $(distdir).zip $(distdir) $(am__post_remove_distdir) dist dist-all: $(MAKE) $(AM_MAKEFLAGS) $(DIST_TARGETS) am__post_remove_distdir='@:' $(am__post_remove_distdir) # This target untars the dist file and tries a VPATH configuration. Then # it guarantees that the distribution is self-contained by making another # tarfile. distcheck: dist case '$(DIST_ARCHIVES)' in \ *.tar.gz*) \ GZIP=$(GZIP_ENV) gzip -dc $(distdir).tar.gz | $(am__untar) ;;\ *.tar.bz2*) \ bzip2 -dc $(distdir).tar.bz2 | $(am__untar) ;;\ *.tar.lz*) \ lzip -dc $(distdir).tar.lz | $(am__untar) ;;\ *.tar.xz*) \ xz -dc $(distdir).tar.xz | $(am__untar) ;;\ *.tar.Z*) \ uncompress -c $(distdir).tar.Z | $(am__untar) ;;\ *.shar.gz*) \ GZIP=$(GZIP_ENV) gzip -dc $(distdir).shar.gz | unshar ;;\ *.zip*) \ unzip $(distdir).zip ;;\ esac chmod -R a-w $(distdir) chmod u+w $(distdir) mkdir $(distdir)/_build $(distdir)/_inst chmod a-w $(distdir) test -d $(distdir)/_build || exit 0; \ dc_install_base=`$(am__cd) $(distdir)/_inst && pwd | sed -e 's,^[^:\\/]:[\\/],/,'` \ && dc_destdir="$${TMPDIR-/tmp}/am-dc-$$$$/" \ && am__cwd=`pwd` \ && $(am__cd) $(distdir)/_build \ && ../configure \ $(AM_DISTCHECK_CONFIGURE_FLAGS) \ $(DISTCHECK_CONFIGURE_FLAGS) \ --srcdir=.. --prefix="$$dc_install_base" \ && $(MAKE) $(AM_MAKEFLAGS) \ && $(MAKE) $(AM_MAKEFLAGS) dvi \ && $(MAKE) $(AM_MAKEFLAGS) check \ && $(MAKE) $(AM_MAKEFLAGS) install \ && $(MAKE) $(AM_MAKEFLAGS) installcheck \ && $(MAKE) $(AM_MAKEFLAGS) uninstall \ && $(MAKE) $(AM_MAKEFLAGS) distuninstallcheck_dir="$$dc_install_base" \ distuninstallcheck \ && chmod -R a-w "$$dc_install_base" \ && ({ \ (cd ../.. && umask 077 && mkdir "$$dc_destdir") \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" install \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" uninstall \ && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" \ distuninstallcheck_dir="$$dc_destdir" distuninstallcheck; \ } || { rm -rf "$$dc_destdir"; exit 1; }) \ && rm -rf "$$dc_destdir" \ && $(MAKE) $(AM_MAKEFLAGS) dist \ && rm -rf $(DIST_ARCHIVES) \ && $(MAKE) $(AM_MAKEFLAGS) distcleancheck \ && cd "$$am__cwd" \ || exit 1 $(am__post_remove_distdir) @(echo "$(distdir) archives ready for distribution: "; \ list='$(DIST_ARCHIVES)'; for i in $$list; do echo $$i; done) | \ sed -e 1h -e 1s/./=/g -e 1p -e 1x -e '$$p' -e '$$x' distuninstallcheck: @test -n '$(distuninstallcheck_dir)' || { \ echo 'ERROR: trying to run $@ with an empty' \ '$$(distuninstallcheck_dir)' >&2; \ exit 1; \ }; \ $(am__cd) '$(distuninstallcheck_dir)' || { \ echo 'ERROR: cannot chdir into $(distuninstallcheck_dir)' >&2; \ exit 1; \ }; \ test `$(am__distuninstallcheck_listfiles) | wc -l` -eq 0 \ || { echo "ERROR: files left after uninstall:" ; \ if test -n "$(DESTDIR)"; then \ echo " (check DESTDIR support)"; \ fi ; \ $(distuninstallcheck_listfiles) ; \ exit 1; } >&2 distcleancheck: distclean @if test '$(srcdir)' = . ; then \ echo "ERROR: distcleancheck can only run from a VPATH build" ; \ exit 1 ; \ fi @test `$(distcleancheck_listfiles) | wc -l` -eq 0 \ || { echo "ERROR: files left in build directory after distclean:" ; \ $(distcleancheck_listfiles) ; \ exit 1; } >&2 check-am: all-am check: check-recursive all-am: Makefile config.h installdirs: installdirs-recursive installdirs-am: install: install-recursive install-exec: install-exec-recursive install-data: install-data-recursive uninstall: uninstall-recursive install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-recursive install-strip: if test -z '$(STRIP)'; then \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ install; \ else \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \ fi mostlyclean-generic: clean-generic: distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-recursive clean-am: clean-generic clean-libtool mostlyclean-am distclean: distclean-recursive -rm -f $(am__CONFIG_DISTCLEAN_FILES) -rm -f Makefile distclean-am: clean-am distclean-generic distclean-hdr \ distclean-libtool distclean-tags dvi: dvi-recursive dvi-am: html: html-recursive html-am: info: info-recursive info-am: install-data-am: install-dvi: install-dvi-recursive install-dvi-am: install-exec-am: install-html: install-html-recursive install-html-am: install-info: install-info-recursive install-info-am: install-man: install-pdf: install-pdf-recursive install-pdf-am: install-ps: install-ps-recursive install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-recursive -rm -f $(am__CONFIG_DISTCLEAN_FILES) -rm -rf $(top_srcdir)/autom4te.cache -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-recursive mostlyclean-am: mostlyclean-generic mostlyclean-libtool pdf: pdf-recursive pdf-am: ps: ps-recursive ps-am: uninstall-am: .MAKE: $(am__recursive_targets) all install-am install-strip .PHONY: $(am__recursive_targets) CTAGS GTAGS TAGS all all-am \ am--refresh check check-am clean clean-cscope clean-generic \ clean-libtool cscope cscopelist-am ctags ctags-am dist \ dist-all dist-bzip2 dist-gzip dist-hook dist-lzip dist-shar \ dist-tarZ dist-xz dist-zip distcheck distclean \ distclean-generic distclean-hdr distclean-libtool \ distclean-tags distcleancheck distdir distuninstallcheck dvi \ dvi-am html html-am info info-am install install-am \ install-data install-data-am install-dvi install-dvi-am \ install-exec install-exec-am install-html install-html-am \ install-info install-info-am install-man install-pdf \ install-pdf-am install-ps install-ps-am install-strip \ installcheck installcheck-am installdirs installdirs-am \ maintainer-clean maintainer-clean-generic mostlyclean \ mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \ tags tags-am uninstall uninstall-am #removes subversion dirs before packing dist-hook: rm -rf `find $(distdir) -name .svn` bak: bak-recursive bak-recursive: list='$(SUBDIRS)'; for subdir in $$list; do \ test "$$subdir" = . || (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) bak); \ done htmldoc: doxygen doc/doxygen.conf; package: rm -fr madp-0.3.1 cp madp-0.3.1.tar.gz madp_0.3.1.orig.tar.gz tar xf madp_0.3.1.orig.tar.gz cp -r debian madp-0.3.1/ cd madp-0.3.1 && debuild -us -uc # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: madp-0.4/PaxHeaders.5405/config.guess0000644000000000000000000000013212717644307014300 xustar0030 mtime=1463765191.881626077 30 atime=1463765194.629604128 30 ctime=1463765201.013553139 madp-0.4/config.guess0000755000372100037210000012355012717644307015143 0ustar00fransfrans00000000000000#! /bin/sh # Attempt to guess a canonical system name. # Copyright 1992-2014 Free Software Foundation, Inc. timestamp='2014-03-23' # This file 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. # # This program 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 this program; if not, see . # # As a special exception to the GNU General Public License, if you # distribute this file as part of a program that contains a # configuration script generated by Autoconf, you may include it under # the same distribution terms that you use for the rest of that # program. This Exception is an additional permission under section 7 # of the GNU General Public License, version 3 ("GPLv3"). # # Originally written by Per Bothner. # # You can get the latest version of this script from: # http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.guess;hb=HEAD # # Please send patches with a ChangeLog entry to config-patches@gnu.org. me=`echo "$0" | sed -e 's,.*/,,'` usage="\ Usage: $0 [OPTION] Output the configuration name of the system \`$me' is run on. Operation modes: -h, --help print this help, then exit -t, --time-stamp print date of last modification, then exit -v, --version print version number, then exit Report bugs and patches to ." version="\ GNU config.guess ($timestamp) Originally written by Per Bothner. Copyright 1992-2014 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." help=" Try \`$me --help' for more information." # Parse command line while test $# -gt 0 ; do case $1 in --time-stamp | --time* | -t ) echo "$timestamp" ; exit ;; --version | -v ) echo "$version" ; exit ;; --help | --h* | -h ) echo "$usage"; exit ;; -- ) # Stop option processing shift; break ;; - ) # Use stdin as input. break ;; -* ) echo "$me: invalid option $1$help" >&2 exit 1 ;; * ) break ;; esac done if test $# != 0; then echo "$me: too many arguments$help" >&2 exit 1 fi trap 'exit 1' 1 2 15 # CC_FOR_BUILD -- compiler used by this script. Note that the use of a # compiler to aid in system detection is discouraged as it requires # temporary files to be created and, as you can see below, it is a # headache to deal with in a portable fashion. # Historically, `CC_FOR_BUILD' used to be named `HOST_CC'. We still # use `HOST_CC' if defined, but it is deprecated. # Portable tmp directory creation inspired by the Autoconf team. set_cc_for_build=' trap "exitcode=\$?; (rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null) && exit \$exitcode" 0 ; trap "rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null; exit 1" 1 2 13 15 ; : ${TMPDIR=/tmp} ; { tmp=`(umask 077 && mktemp -d "$TMPDIR/cgXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" ; } || { test -n "$RANDOM" && tmp=$TMPDIR/cg$$-$RANDOM && (umask 077 && mkdir $tmp) ; } || { tmp=$TMPDIR/cg-$$ && (umask 077 && mkdir $tmp) && echo "Warning: creating insecure temp directory" >&2 ; } || { echo "$me: cannot create a temporary directory in $TMPDIR" >&2 ; exit 1 ; } ; dummy=$tmp/dummy ; tmpfiles="$dummy.c $dummy.o $dummy.rel $dummy" ; case $CC_FOR_BUILD,$HOST_CC,$CC in ,,) echo "int x;" > $dummy.c ; for c in cc gcc c89 c99 ; do if ($c -c -o $dummy.o $dummy.c) >/dev/null 2>&1 ; then CC_FOR_BUILD="$c"; break ; fi ; done ; if test x"$CC_FOR_BUILD" = x ; then CC_FOR_BUILD=no_compiler_found ; fi ;; ,,*) CC_FOR_BUILD=$CC ;; ,*,*) CC_FOR_BUILD=$HOST_CC ;; esac ; set_cc_for_build= ;' # This is needed to find uname on a Pyramid OSx when run in the BSD universe. # (ghazi@noc.rutgers.edu 1994-08-24) if (test -f /.attbin/uname) >/dev/null 2>&1 ; then PATH=$PATH:/.attbin ; export PATH fi UNAME_MACHINE=`(uname -m) 2>/dev/null` || UNAME_MACHINE=unknown UNAME_RELEASE=`(uname -r) 2>/dev/null` || UNAME_RELEASE=unknown UNAME_SYSTEM=`(uname -s) 2>/dev/null` || UNAME_SYSTEM=unknown UNAME_VERSION=`(uname -v) 2>/dev/null` || UNAME_VERSION=unknown case "${UNAME_SYSTEM}" in Linux|GNU|GNU/*) # If the system lacks a compiler, then just pick glibc. # We could probably try harder. LIBC=gnu eval $set_cc_for_build cat <<-EOF > $dummy.c #include #if defined(__UCLIBC__) LIBC=uclibc #elif defined(__dietlibc__) LIBC=dietlibc #else LIBC=gnu #endif EOF eval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep '^LIBC' | sed 's, ,,g'` ;; esac # Note: order is significant - the case branches are not exclusive. case "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" in *:NetBSD:*:*) # NetBSD (nbsd) targets should (where applicable) match one or # more of the tuples: *-*-netbsdelf*, *-*-netbsdaout*, # *-*-netbsdecoff* and *-*-netbsd*. For targets that recently # switched to ELF, *-*-netbsd* would select the old # object file format. This provides both forward # compatibility and a consistent mechanism for selecting the # object file format. # # Note: NetBSD doesn't particularly care about the vendor # portion of the name. We always set it to "unknown". sysctl="sysctl -n hw.machine_arch" UNAME_MACHINE_ARCH=`(/sbin/$sysctl 2>/dev/null || \ /usr/sbin/$sysctl 2>/dev/null || echo unknown)` case "${UNAME_MACHINE_ARCH}" in armeb) machine=armeb-unknown ;; arm*) machine=arm-unknown ;; sh3el) machine=shl-unknown ;; sh3eb) machine=sh-unknown ;; sh5el) machine=sh5le-unknown ;; *) machine=${UNAME_MACHINE_ARCH}-unknown ;; esac # The Operating System including object format, if it has switched # to ELF recently, or will in the future. case "${UNAME_MACHINE_ARCH}" in arm*|i386|m68k|ns32k|sh3*|sparc|vax) eval $set_cc_for_build if echo __ELF__ | $CC_FOR_BUILD -E - 2>/dev/null \ | grep -q __ELF__ then # Once all utilities can be ECOFF (netbsdecoff) or a.out (netbsdaout). # Return netbsd for either. FIX? os=netbsd else os=netbsdelf fi ;; *) os=netbsd ;; esac # The OS release # Debian GNU/NetBSD machines have a different userland, and # thus, need a distinct triplet. However, they do not need # kernel version information, so it can be replaced with a # suitable tag, in the style of linux-gnu. case "${UNAME_VERSION}" in Debian*) release='-gnu' ;; *) release=`echo ${UNAME_RELEASE}|sed -e 's/[-_].*/\./'` ;; esac # Since CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM: # contains redundant information, the shorter form: # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM is used. echo "${machine}-${os}${release}" exit ;; *:Bitrig:*:*) UNAME_MACHINE_ARCH=`arch | sed 's/Bitrig.//'` echo ${UNAME_MACHINE_ARCH}-unknown-bitrig${UNAME_RELEASE} exit ;; *:OpenBSD:*:*) UNAME_MACHINE_ARCH=`arch | sed 's/OpenBSD.//'` echo ${UNAME_MACHINE_ARCH}-unknown-openbsd${UNAME_RELEASE} exit ;; *:ekkoBSD:*:*) echo ${UNAME_MACHINE}-unknown-ekkobsd${UNAME_RELEASE} exit ;; *:SolidBSD:*:*) echo ${UNAME_MACHINE}-unknown-solidbsd${UNAME_RELEASE} exit ;; macppc:MirBSD:*:*) echo powerpc-unknown-mirbsd${UNAME_RELEASE} exit ;; *:MirBSD:*:*) echo ${UNAME_MACHINE}-unknown-mirbsd${UNAME_RELEASE} exit ;; alpha:OSF1:*:*) case $UNAME_RELEASE in *4.0) UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $3}'` ;; *5.*) UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $4}'` ;; esac # According to Compaq, /usr/sbin/psrinfo has been available on # OSF/1 and Tru64 systems produced since 1995. I hope that # covers most systems running today. This code pipes the CPU # types through head -n 1, so we only detect the type of CPU 0. ALPHA_CPU_TYPE=`/usr/sbin/psrinfo -v | sed -n -e 's/^ The alpha \(.*\) processor.*$/\1/p' | head -n 1` case "$ALPHA_CPU_TYPE" in "EV4 (21064)") UNAME_MACHINE="alpha" ;; "EV4.5 (21064)") UNAME_MACHINE="alpha" ;; "LCA4 (21066/21068)") UNAME_MACHINE="alpha" ;; "EV5 (21164)") UNAME_MACHINE="alphaev5" ;; "EV5.6 (21164A)") UNAME_MACHINE="alphaev56" ;; "EV5.6 (21164PC)") UNAME_MACHINE="alphapca56" ;; "EV5.7 (21164PC)") UNAME_MACHINE="alphapca57" ;; "EV6 (21264)") UNAME_MACHINE="alphaev6" ;; "EV6.7 (21264A)") UNAME_MACHINE="alphaev67" ;; "EV6.8CB (21264C)") UNAME_MACHINE="alphaev68" ;; "EV6.8AL (21264B)") UNAME_MACHINE="alphaev68" ;; "EV6.8CX (21264D)") UNAME_MACHINE="alphaev68" ;; "EV6.9A (21264/EV69A)") UNAME_MACHINE="alphaev69" ;; "EV7 (21364)") UNAME_MACHINE="alphaev7" ;; "EV7.9 (21364A)") UNAME_MACHINE="alphaev79" ;; esac # A Pn.n version is a patched version. # A Vn.n version is a released version. # A Tn.n version is a released field test version. # A Xn.n version is an unreleased experimental baselevel. # 1.2 uses "1.2" for uname -r. echo ${UNAME_MACHINE}-dec-osf`echo ${UNAME_RELEASE} | sed -e 's/^[PVTX]//' | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'` # Reset EXIT trap before exiting to avoid spurious non-zero exit code. exitcode=$? trap '' 0 exit $exitcode ;; Alpha\ *:Windows_NT*:*) # How do we know it's Interix rather than the generic POSIX subsystem? # Should we change UNAME_MACHINE based on the output of uname instead # of the specific Alpha model? echo alpha-pc-interix exit ;; 21064:Windows_NT:50:3) echo alpha-dec-winnt3.5 exit ;; Amiga*:UNIX_System_V:4.0:*) echo m68k-unknown-sysv4 exit ;; *:[Aa]miga[Oo][Ss]:*:*) echo ${UNAME_MACHINE}-unknown-amigaos exit ;; *:[Mm]orph[Oo][Ss]:*:*) echo ${UNAME_MACHINE}-unknown-morphos exit ;; *:OS/390:*:*) echo i370-ibm-openedition exit ;; *:z/VM:*:*) echo s390-ibm-zvmoe exit ;; *:OS400:*:*) echo powerpc-ibm-os400 exit ;; arm:RISC*:1.[012]*:*|arm:riscix:1.[012]*:*) echo arm-acorn-riscix${UNAME_RELEASE} exit ;; arm*:riscos:*:*|arm*:RISCOS:*:*) echo arm-unknown-riscos exit ;; SR2?01:HI-UX/MPP:*:* | SR8000:HI-UX/MPP:*:*) echo hppa1.1-hitachi-hiuxmpp exit ;; Pyramid*:OSx*:*:* | MIS*:OSx*:*:* | MIS*:SMP_DC-OSx*:*:*) # akee@wpdis03.wpafb.af.mil (Earle F. Ake) contributed MIS and NILE. if test "`(/bin/universe) 2>/dev/null`" = att ; then echo pyramid-pyramid-sysv3 else echo pyramid-pyramid-bsd fi exit ;; NILE*:*:*:dcosx) echo pyramid-pyramid-svr4 exit ;; DRS?6000:unix:4.0:6*) echo sparc-icl-nx6 exit ;; DRS?6000:UNIX_SV:4.2*:7* | DRS?6000:isis:4.2*:7*) case `/usr/bin/uname -p` in sparc) echo sparc-icl-nx7; exit ;; esac ;; s390x:SunOS:*:*) echo ${UNAME_MACHINE}-ibm-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4H:SunOS:5.*:*) echo sparc-hal-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:5.*:* | tadpole*:SunOS:5.*:*) echo sparc-sun-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; i86pc:AuroraUX:5.*:* | i86xen:AuroraUX:5.*:*) echo i386-pc-auroraux${UNAME_RELEASE} exit ;; i86pc:SunOS:5.*:* | i86xen:SunOS:5.*:*) eval $set_cc_for_build SUN_ARCH="i386" # If there is a compiler, see if it is configured for 64-bit objects. # Note that the Sun cc does not turn __LP64__ into 1 like gcc does. # This test works for both compilers. if [ "$CC_FOR_BUILD" != 'no_compiler_found' ]; then if (echo '#ifdef __amd64'; echo IS_64BIT_ARCH; echo '#endif') | \ (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) | \ grep IS_64BIT_ARCH >/dev/null then SUN_ARCH="x86_64" fi fi echo ${SUN_ARCH}-pc-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:6*:*) # According to config.sub, this is the proper way to canonicalize # SunOS6. Hard to guess exactly what SunOS6 will be like, but # it's likely to be more like Solaris than SunOS4. echo sparc-sun-solaris3`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; sun4*:SunOS:*:*) case "`/usr/bin/arch -k`" in Series*|S4*) UNAME_RELEASE=`uname -v` ;; esac # Japanese Language versions have a version number like `4.1.3-JL'. echo sparc-sun-sunos`echo ${UNAME_RELEASE}|sed -e 's/-/_/'` exit ;; sun3*:SunOS:*:*) echo m68k-sun-sunos${UNAME_RELEASE} exit ;; sun*:*:4.2BSD:*) UNAME_RELEASE=`(sed 1q /etc/motd | awk '{print substr($5,1,3)}') 2>/dev/null` test "x${UNAME_RELEASE}" = "x" && UNAME_RELEASE=3 case "`/bin/arch`" in sun3) echo m68k-sun-sunos${UNAME_RELEASE} ;; sun4) echo sparc-sun-sunos${UNAME_RELEASE} ;; esac exit ;; aushp:SunOS:*:*) echo sparc-auspex-sunos${UNAME_RELEASE} exit ;; # The situation for MiNT is a little confusing. The machine name # can be virtually everything (everything which is not # "atarist" or "atariste" at least should have a processor # > m68000). The system name ranges from "MiNT" over "FreeMiNT" # to the lowercase version "mint" (or "freemint"). Finally # the system name "TOS" denotes a system which is actually not # MiNT. But MiNT is downward compatible to TOS, so this should # be no problem. atarist[e]:*MiNT:*:* | atarist[e]:*mint:*:* | atarist[e]:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; atari*:*MiNT:*:* | atari*:*mint:*:* | atarist[e]:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; *falcon*:*MiNT:*:* | *falcon*:*mint:*:* | *falcon*:*TOS:*:*) echo m68k-atari-mint${UNAME_RELEASE} exit ;; milan*:*MiNT:*:* | milan*:*mint:*:* | *milan*:*TOS:*:*) echo m68k-milan-mint${UNAME_RELEASE} exit ;; hades*:*MiNT:*:* | hades*:*mint:*:* | *hades*:*TOS:*:*) echo m68k-hades-mint${UNAME_RELEASE} exit ;; *:*MiNT:*:* | *:*mint:*:* | *:*TOS:*:*) echo m68k-unknown-mint${UNAME_RELEASE} exit ;; m68k:machten:*:*) echo m68k-apple-machten${UNAME_RELEASE} exit ;; powerpc:machten:*:*) echo powerpc-apple-machten${UNAME_RELEASE} exit ;; RISC*:Mach:*:*) echo mips-dec-mach_bsd4.3 exit ;; RISC*:ULTRIX:*:*) echo mips-dec-ultrix${UNAME_RELEASE} exit ;; VAX*:ULTRIX*:*:*) echo vax-dec-ultrix${UNAME_RELEASE} exit ;; 2020:CLIX:*:* | 2430:CLIX:*:*) echo clipper-intergraph-clix${UNAME_RELEASE} exit ;; mips:*:*:UMIPS | mips:*:*:RISCos) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #ifdef __cplusplus #include /* for printf() prototype */ int main (int argc, char *argv[]) { #else int main (argc, argv) int argc; char *argv[]; { #endif #if defined (host_mips) && defined (MIPSEB) #if defined (SYSTYPE_SYSV) printf ("mips-mips-riscos%ssysv\n", argv[1]); exit (0); #endif #if defined (SYSTYPE_SVR4) printf ("mips-mips-riscos%ssvr4\n", argv[1]); exit (0); #endif #if defined (SYSTYPE_BSD43) || defined(SYSTYPE_BSD) printf ("mips-mips-riscos%sbsd\n", argv[1]); exit (0); #endif #endif exit (-1); } EOF $CC_FOR_BUILD -o $dummy $dummy.c && dummyarg=`echo "${UNAME_RELEASE}" | sed -n 's/\([0-9]*\).*/\1/p'` && SYSTEM_NAME=`$dummy $dummyarg` && { echo "$SYSTEM_NAME"; exit; } echo mips-mips-riscos${UNAME_RELEASE} exit ;; Motorola:PowerMAX_OS:*:*) echo powerpc-motorola-powermax exit ;; Motorola:*:4.3:PL8-*) echo powerpc-harris-powermax exit ;; Night_Hawk:*:*:PowerMAX_OS | Synergy:PowerMAX_OS:*:*) echo powerpc-harris-powermax exit ;; Night_Hawk:Power_UNIX:*:*) echo powerpc-harris-powerunix exit ;; m88k:CX/UX:7*:*) echo m88k-harris-cxux7 exit ;; m88k:*:4*:R4*) echo m88k-motorola-sysv4 exit ;; m88k:*:3*:R3*) echo m88k-motorola-sysv3 exit ;; AViiON:dgux:*:*) # DG/UX returns AViiON for all architectures UNAME_PROCESSOR=`/usr/bin/uname -p` if [ $UNAME_PROCESSOR = mc88100 ] || [ $UNAME_PROCESSOR = mc88110 ] then if [ ${TARGET_BINARY_INTERFACE}x = m88kdguxelfx ] || \ [ ${TARGET_BINARY_INTERFACE}x = x ] then echo m88k-dg-dgux${UNAME_RELEASE} else echo m88k-dg-dguxbcs${UNAME_RELEASE} fi else echo i586-dg-dgux${UNAME_RELEASE} fi exit ;; M88*:DolphinOS:*:*) # DolphinOS (SVR3) echo m88k-dolphin-sysv3 exit ;; M88*:*:R3*:*) # Delta 88k system running SVR3 echo m88k-motorola-sysv3 exit ;; XD88*:*:*:*) # Tektronix XD88 system running UTekV (SVR3) echo m88k-tektronix-sysv3 exit ;; Tek43[0-9][0-9]:UTek:*:*) # Tektronix 4300 system running UTek (BSD) echo m68k-tektronix-bsd exit ;; *:IRIX*:*:*) echo mips-sgi-irix`echo ${UNAME_RELEASE}|sed -e 's/-/_/g'` exit ;; ????????:AIX?:[12].1:2) # AIX 2.2.1 or AIX 2.1.1 is RT/PC AIX. echo romp-ibm-aix # uname -m gives an 8 hex-code CPU id exit ;; # Note that: echo "'`uname -s`'" gives 'AIX ' i*86:AIX:*:*) echo i386-ibm-aix exit ;; ia64:AIX:*:*) if [ -x /usr/bin/oslevel ] ; then IBM_REV=`/usr/bin/oslevel` else IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE} fi echo ${UNAME_MACHINE}-ibm-aix${IBM_REV} exit ;; *:AIX:2:3) if grep bos325 /usr/include/stdio.h >/dev/null 2>&1; then eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #include main() { if (!__power_pc()) exit(1); puts("powerpc-ibm-aix3.2.5"); exit(0); } EOF if $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` then echo "$SYSTEM_NAME" else echo rs6000-ibm-aix3.2.5 fi elif grep bos324 /usr/include/stdio.h >/dev/null 2>&1; then echo rs6000-ibm-aix3.2.4 else echo rs6000-ibm-aix3.2 fi exit ;; *:AIX:*:[4567]) IBM_CPU_ID=`/usr/sbin/lsdev -C -c processor -S available | sed 1q | awk '{ print $1 }'` if /usr/sbin/lsattr -El ${IBM_CPU_ID} | grep ' POWER' >/dev/null 2>&1; then IBM_ARCH=rs6000 else IBM_ARCH=powerpc fi if [ -x /usr/bin/oslevel ] ; then IBM_REV=`/usr/bin/oslevel` else IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE} fi echo ${IBM_ARCH}-ibm-aix${IBM_REV} exit ;; *:AIX:*:*) echo rs6000-ibm-aix exit ;; ibmrt:4.4BSD:*|romp-ibm:BSD:*) echo romp-ibm-bsd4.4 exit ;; ibmrt:*BSD:*|romp-ibm:BSD:*) # covers RT/PC BSD and echo romp-ibm-bsd${UNAME_RELEASE} # 4.3 with uname added to exit ;; # report: romp-ibm BSD 4.3 *:BOSX:*:*) echo rs6000-bull-bosx exit ;; DPX/2?00:B.O.S.:*:*) echo m68k-bull-sysv3 exit ;; 9000/[34]??:4.3bsd:1.*:*) echo m68k-hp-bsd exit ;; hp300:4.4BSD:*:* | 9000/[34]??:4.3bsd:2.*:*) echo m68k-hp-bsd4.4 exit ;; 9000/[34678]??:HP-UX:*:*) HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'` case "${UNAME_MACHINE}" in 9000/31? ) HP_ARCH=m68000 ;; 9000/[34]?? ) HP_ARCH=m68k ;; 9000/[678][0-9][0-9]) if [ -x /usr/bin/getconf ]; then sc_cpu_version=`/usr/bin/getconf SC_CPU_VERSION 2>/dev/null` sc_kernel_bits=`/usr/bin/getconf SC_KERNEL_BITS 2>/dev/null` case "${sc_cpu_version}" in 523) HP_ARCH="hppa1.0" ;; # CPU_PA_RISC1_0 528) HP_ARCH="hppa1.1" ;; # CPU_PA_RISC1_1 532) # CPU_PA_RISC2_0 case "${sc_kernel_bits}" in 32) HP_ARCH="hppa2.0n" ;; 64) HP_ARCH="hppa2.0w" ;; '') HP_ARCH="hppa2.0" ;; # HP-UX 10.20 esac ;; esac fi if [ "${HP_ARCH}" = "" ]; then eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #define _HPUX_SOURCE #include #include int main () { #if defined(_SC_KERNEL_BITS) long bits = sysconf(_SC_KERNEL_BITS); #endif long cpu = sysconf (_SC_CPU_VERSION); switch (cpu) { case CPU_PA_RISC1_0: puts ("hppa1.0"); break; case CPU_PA_RISC1_1: puts ("hppa1.1"); break; case CPU_PA_RISC2_0: #if defined(_SC_KERNEL_BITS) switch (bits) { case 64: puts ("hppa2.0w"); break; case 32: puts ("hppa2.0n"); break; default: puts ("hppa2.0"); break; } break; #else /* !defined(_SC_KERNEL_BITS) */ puts ("hppa2.0"); break; #endif default: puts ("hppa1.0"); break; } exit (0); } EOF (CCOPTS= $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null) && HP_ARCH=`$dummy` test -z "$HP_ARCH" && HP_ARCH=hppa fi ;; esac if [ ${HP_ARCH} = "hppa2.0w" ] then eval $set_cc_for_build # hppa2.0w-hp-hpux* has a 64-bit kernel and a compiler generating # 32-bit code. hppa64-hp-hpux* has the same kernel and a compiler # generating 64-bit code. GNU and HP use different nomenclature: # # $ CC_FOR_BUILD=cc ./config.guess # => hppa2.0w-hp-hpux11.23 # $ CC_FOR_BUILD="cc +DA2.0w" ./config.guess # => hppa64-hp-hpux11.23 if echo __LP64__ | (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) | grep -q __LP64__ then HP_ARCH="hppa2.0w" else HP_ARCH="hppa64" fi fi echo ${HP_ARCH}-hp-hpux${HPUX_REV} exit ;; ia64:HP-UX:*:*) HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'` echo ia64-hp-hpux${HPUX_REV} exit ;; 3050*:HI-UX:*:*) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #include int main () { long cpu = sysconf (_SC_CPU_VERSION); /* The order matters, because CPU_IS_HP_MC68K erroneously returns true for CPU_PA_RISC1_0. CPU_IS_PA_RISC returns correct results, however. */ if (CPU_IS_PA_RISC (cpu)) { switch (cpu) { case CPU_PA_RISC1_0: puts ("hppa1.0-hitachi-hiuxwe2"); break; case CPU_PA_RISC1_1: puts ("hppa1.1-hitachi-hiuxwe2"); break; case CPU_PA_RISC2_0: puts ("hppa2.0-hitachi-hiuxwe2"); break; default: puts ("hppa-hitachi-hiuxwe2"); break; } } else if (CPU_IS_HP_MC68K (cpu)) puts ("m68k-hitachi-hiuxwe2"); else puts ("unknown-hitachi-hiuxwe2"); exit (0); } EOF $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` && { echo "$SYSTEM_NAME"; exit; } echo unknown-hitachi-hiuxwe2 exit ;; 9000/7??:4.3bsd:*:* | 9000/8?[79]:4.3bsd:*:* ) echo hppa1.1-hp-bsd exit ;; 9000/8??:4.3bsd:*:*) echo hppa1.0-hp-bsd exit ;; *9??*:MPE/iX:*:* | *3000*:MPE/iX:*:*) echo hppa1.0-hp-mpeix exit ;; hp7??:OSF1:*:* | hp8?[79]:OSF1:*:* ) echo hppa1.1-hp-osf exit ;; hp8??:OSF1:*:*) echo hppa1.0-hp-osf exit ;; i*86:OSF1:*:*) if [ -x /usr/sbin/sysversion ] ; then echo ${UNAME_MACHINE}-unknown-osf1mk else echo ${UNAME_MACHINE}-unknown-osf1 fi exit ;; parisc*:Lites*:*:*) echo hppa1.1-hp-lites exit ;; C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*) echo c1-convex-bsd exit ;; C2*:ConvexOS:*:* | convex:ConvexOS:C2*:*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit ;; C34*:ConvexOS:*:* | convex:ConvexOS:C34*:*) echo c34-convex-bsd exit ;; C38*:ConvexOS:*:* | convex:ConvexOS:C38*:*) echo c38-convex-bsd exit ;; C4*:ConvexOS:*:* | convex:ConvexOS:C4*:*) echo c4-convex-bsd exit ;; CRAY*Y-MP:*:*:*) echo ymp-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*[A-Z]90:*:*:*) echo ${UNAME_MACHINE}-cray-unicos${UNAME_RELEASE} \ | sed -e 's/CRAY.*\([A-Z]90\)/\1/' \ -e y/ABCDEFGHIJKLMNOPQRSTUVWXYZ/abcdefghijklmnopqrstuvwxyz/ \ -e 's/\.[^.]*$/.X/' exit ;; CRAY*TS:*:*:*) echo t90-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*T3E:*:*:*) echo alphaev5-cray-unicosmk${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; CRAY*SV1:*:*:*) echo sv1-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; *:UNICOS/mp:*:*) echo craynv-cray-unicosmp${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' exit ;; F30[01]:UNIX_System_V:*:* | F700:UNIX_System_V:*:*) FUJITSU_PROC=`uname -m | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'` FUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\///'` FUJITSU_REL=`echo ${UNAME_RELEASE} | sed -e 's/ /_/'` echo "${FUJITSU_PROC}-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}" exit ;; 5000:UNIX_System_V:4.*:*) FUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\///'` FUJITSU_REL=`echo ${UNAME_RELEASE} | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/ /_/'` echo "sparc-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}" exit ;; i*86:BSD/386:*:* | i*86:BSD/OS:*:* | *:Ascend\ Embedded/OS:*:*) echo ${UNAME_MACHINE}-pc-bsdi${UNAME_RELEASE} exit ;; sparc*:BSD/OS:*:*) echo sparc-unknown-bsdi${UNAME_RELEASE} exit ;; *:BSD/OS:*:*) echo ${UNAME_MACHINE}-unknown-bsdi${UNAME_RELEASE} exit ;; *:FreeBSD:*:*) UNAME_PROCESSOR=`/usr/bin/uname -p` case ${UNAME_PROCESSOR} in amd64) echo x86_64-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; *) echo ${UNAME_PROCESSOR}-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; esac exit ;; i*:CYGWIN*:*) echo ${UNAME_MACHINE}-pc-cygwin exit ;; *:MINGW64*:*) echo ${UNAME_MACHINE}-pc-mingw64 exit ;; *:MINGW*:*) echo ${UNAME_MACHINE}-pc-mingw32 exit ;; *:MSYS*:*) echo ${UNAME_MACHINE}-pc-msys exit ;; i*:windows32*:*) # uname -m includes "-pc" on this system. echo ${UNAME_MACHINE}-mingw32 exit ;; i*:PW*:*) echo ${UNAME_MACHINE}-pc-pw32 exit ;; *:Interix*:*) case ${UNAME_MACHINE} in x86) echo i586-pc-interix${UNAME_RELEASE} exit ;; authenticamd | genuineintel | EM64T) echo x86_64-unknown-interix${UNAME_RELEASE} exit ;; IA64) echo ia64-unknown-interix${UNAME_RELEASE} exit ;; esac ;; [345]86:Windows_95:* | [345]86:Windows_98:* | [345]86:Windows_NT:*) echo i${UNAME_MACHINE}-pc-mks exit ;; 8664:Windows_NT:*) echo x86_64-pc-mks exit ;; i*:Windows_NT*:* | Pentium*:Windows_NT*:*) # How do we know it's Interix rather than the generic POSIX subsystem? # It also conflicts with pre-2.0 versions of AT&T UWIN. Should we # UNAME_MACHINE based on the output of uname instead of i386? echo i586-pc-interix exit ;; i*:UWIN*:*) echo ${UNAME_MACHINE}-pc-uwin exit ;; amd64:CYGWIN*:*:* | x86_64:CYGWIN*:*:*) echo x86_64-unknown-cygwin exit ;; p*:CYGWIN*:*) echo powerpcle-unknown-cygwin exit ;; prep*:SunOS:5.*:*) echo powerpcle-unknown-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit ;; *:GNU:*:*) # the GNU system echo `echo ${UNAME_MACHINE}|sed -e 's,[-/].*$,,'`-unknown-${LIBC}`echo ${UNAME_RELEASE}|sed -e 's,/.*$,,'` exit ;; *:GNU/*:*:*) # other systems with GNU libc and userland echo ${UNAME_MACHINE}-unknown-`echo ${UNAME_SYSTEM} | sed 's,^[^/]*/,,' | tr '[A-Z]' '[a-z]'``echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`-${LIBC} exit ;; i*86:Minix:*:*) echo ${UNAME_MACHINE}-pc-minix exit ;; aarch64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; aarch64_be:Linux:*:*) UNAME_MACHINE=aarch64_be echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; alpha:Linux:*:*) case `sed -n '/^cpu model/s/^.*: \(.*\)/\1/p' < /proc/cpuinfo` in EV5) UNAME_MACHINE=alphaev5 ;; EV56) UNAME_MACHINE=alphaev56 ;; PCA56) UNAME_MACHINE=alphapca56 ;; PCA57) UNAME_MACHINE=alphapca56 ;; EV6) UNAME_MACHINE=alphaev6 ;; EV67) UNAME_MACHINE=alphaev67 ;; EV68*) UNAME_MACHINE=alphaev68 ;; esac objdump --private-headers /bin/sh | grep -q ld.so.1 if test "$?" = 0 ; then LIBC="gnulibc1" ; fi echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; arc:Linux:*:* | arceb:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; arm*:Linux:*:*) eval $set_cc_for_build if echo __ARM_EABI__ | $CC_FOR_BUILD -E - 2>/dev/null \ | grep -q __ARM_EABI__ then echo ${UNAME_MACHINE}-unknown-linux-${LIBC} else if echo __ARM_PCS_VFP | $CC_FOR_BUILD -E - 2>/dev/null \ | grep -q __ARM_PCS_VFP then echo ${UNAME_MACHINE}-unknown-linux-${LIBC}eabi else echo ${UNAME_MACHINE}-unknown-linux-${LIBC}eabihf fi fi exit ;; avr32*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; cris:Linux:*:*) echo ${UNAME_MACHINE}-axis-linux-${LIBC} exit ;; crisv32:Linux:*:*) echo ${UNAME_MACHINE}-axis-linux-${LIBC} exit ;; frv:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; hexagon:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; i*86:Linux:*:*) echo ${UNAME_MACHINE}-pc-linux-${LIBC} exit ;; ia64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; m32r*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; m68*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; mips:Linux:*:* | mips64:Linux:*:*) eval $set_cc_for_build sed 's/^ //' << EOF >$dummy.c #undef CPU #undef ${UNAME_MACHINE} #undef ${UNAME_MACHINE}el #if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL) CPU=${UNAME_MACHINE}el #else #if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB) CPU=${UNAME_MACHINE} #else CPU= #endif #endif EOF eval `$CC_FOR_BUILD -E $dummy.c 2>/dev/null | grep '^CPU'` test x"${CPU}" != x && { echo "${CPU}-unknown-linux-${LIBC}"; exit; } ;; openrisc*:Linux:*:*) echo or1k-unknown-linux-${LIBC} exit ;; or32:Linux:*:* | or1k*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; padre:Linux:*:*) echo sparc-unknown-linux-${LIBC} exit ;; parisc64:Linux:*:* | hppa64:Linux:*:*) echo hppa64-unknown-linux-${LIBC} exit ;; parisc:Linux:*:* | hppa:Linux:*:*) # Look for CPU level case `grep '^cpu[^a-z]*:' /proc/cpuinfo 2>/dev/null | cut -d' ' -f2` in PA7*) echo hppa1.1-unknown-linux-${LIBC} ;; PA8*) echo hppa2.0-unknown-linux-${LIBC} ;; *) echo hppa-unknown-linux-${LIBC} ;; esac exit ;; ppc64:Linux:*:*) echo powerpc64-unknown-linux-${LIBC} exit ;; ppc:Linux:*:*) echo powerpc-unknown-linux-${LIBC} exit ;; ppc64le:Linux:*:*) echo powerpc64le-unknown-linux-${LIBC} exit ;; ppcle:Linux:*:*) echo powerpcle-unknown-linux-${LIBC} exit ;; s390:Linux:*:* | s390x:Linux:*:*) echo ${UNAME_MACHINE}-ibm-linux-${LIBC} exit ;; sh64*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; sh*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; sparc:Linux:*:* | sparc64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; tile*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; vax:Linux:*:*) echo ${UNAME_MACHINE}-dec-linux-${LIBC} exit ;; x86_64:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; xtensa*:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux-${LIBC} exit ;; i*86:DYNIX/ptx:4*:*) # ptx 4.0 does uname -s correctly, with DYNIX/ptx in there. # earlier versions are messed up and put the nodename in both # sysname and nodename. echo i386-sequent-sysv4 exit ;; i*86:UNIX_SV:4.2MP:2.*) # Unixware is an offshoot of SVR4, but it has its own version # number series starting with 2... # I am not positive that other SVR4 systems won't match this, # I just have to hope. -- rms. # Use sysv4.2uw... so that sysv4* matches it. echo ${UNAME_MACHINE}-pc-sysv4.2uw${UNAME_VERSION} exit ;; i*86:OS/2:*:*) # If we were able to find `uname', then EMX Unix compatibility # is probably installed. echo ${UNAME_MACHINE}-pc-os2-emx exit ;; i*86:XTS-300:*:STOP) echo ${UNAME_MACHINE}-unknown-stop exit ;; i*86:atheos:*:*) echo ${UNAME_MACHINE}-unknown-atheos exit ;; i*86:syllable:*:*) echo ${UNAME_MACHINE}-pc-syllable exit ;; i*86:LynxOS:2.*:* | i*86:LynxOS:3.[01]*:* | i*86:LynxOS:4.[02]*:*) echo i386-unknown-lynxos${UNAME_RELEASE} exit ;; i*86:*DOS:*:*) echo ${UNAME_MACHINE}-pc-msdosdjgpp exit ;; i*86:*:4.*:* | i*86:SYSTEM_V:4.*:*) UNAME_REL=`echo ${UNAME_RELEASE} | sed 's/\/MP$//'` if grep Novell /usr/include/link.h >/dev/null 2>/dev/null; then echo ${UNAME_MACHINE}-univel-sysv${UNAME_REL} else echo ${UNAME_MACHINE}-pc-sysv${UNAME_REL} fi exit ;; i*86:*:5:[678]*) # UnixWare 7.x, OpenUNIX and OpenServer 6. case `/bin/uname -X | grep "^Machine"` in *486*) UNAME_MACHINE=i486 ;; *Pentium) UNAME_MACHINE=i586 ;; *Pent*|*Celeron) UNAME_MACHINE=i686 ;; esac echo ${UNAME_MACHINE}-unknown-sysv${UNAME_RELEASE}${UNAME_SYSTEM}${UNAME_VERSION} exit ;; i*86:*:3.2:*) if test -f /usr/options/cb.name; then UNAME_REL=`sed -n 's/.*Version //p' /dev/null >/dev/null ; then UNAME_REL=`(/bin/uname -X|grep Release|sed -e 's/.*= //')` (/bin/uname -X|grep i80486 >/dev/null) && UNAME_MACHINE=i486 (/bin/uname -X|grep '^Machine.*Pentium' >/dev/null) \ && UNAME_MACHINE=i586 (/bin/uname -X|grep '^Machine.*Pent *II' >/dev/null) \ && UNAME_MACHINE=i686 (/bin/uname -X|grep '^Machine.*Pentium Pro' >/dev/null) \ && UNAME_MACHINE=i686 echo ${UNAME_MACHINE}-pc-sco$UNAME_REL else echo ${UNAME_MACHINE}-pc-sysv32 fi exit ;; pc:*:*:*) # Left here for compatibility: # uname -m prints for DJGPP always 'pc', but it prints nothing about # the processor, so we play safe by assuming i586. # Note: whatever this is, it MUST be the same as what config.sub # prints for the "djgpp" host, or else GDB configury will decide that # this is a cross-build. echo i586-pc-msdosdjgpp exit ;; Intel:Mach:3*:*) echo i386-pc-mach3 exit ;; paragon:*:*:*) echo i860-intel-osf1 exit ;; i860:*:4.*:*) # i860-SVR4 if grep Stardent /usr/include/sys/uadmin.h >/dev/null 2>&1 ; then echo i860-stardent-sysv${UNAME_RELEASE} # Stardent Vistra i860-SVR4 else # Add other i860-SVR4 vendors below as they are discovered. echo i860-unknown-sysv${UNAME_RELEASE} # Unknown i860-SVR4 fi exit ;; mini*:CTIX:SYS*5:*) # "miniframe" echo m68010-convergent-sysv exit ;; mc68k:UNIX:SYSTEM5:3.51m) echo m68k-convergent-sysv exit ;; M680?0:D-NIX:5.3:*) echo m68k-diab-dnix exit ;; M68*:*:R3V[5678]*:*) test -r /sysV68 && { echo 'm68k-motorola-sysv'; exit; } ;; 3[345]??:*:4.0:3.0 | 3[34]??A:*:4.0:3.0 | 3[34]??,*:*:4.0:3.0 | 3[34]??/*:*:4.0:3.0 | 4400:*:4.0:3.0 | 4850:*:4.0:3.0 | SKA40:*:4.0:3.0 | SDS2:*:4.0:3.0 | SHG2:*:4.0:3.0 | S7501*:*:4.0:3.0) OS_REL='' test -r /etc/.relid \ && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid` /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4.3${OS_REL}; exit; } /bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \ && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;; 3[34]??:*:4.0:* | 3[34]??,*:*:4.0:*) /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4; exit; } ;; NCR*:*:4.2:* | MPRAS*:*:4.2:*) OS_REL='.3' test -r /etc/.relid \ && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid` /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ && { echo i486-ncr-sysv4.3${OS_REL}; exit; } /bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \ && { echo i586-ncr-sysv4.3${OS_REL}; exit; } /bin/uname -p 2>/dev/null | /bin/grep pteron >/dev/null \ && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;; m68*:LynxOS:2.*:* | m68*:LynxOS:3.0*:*) echo m68k-unknown-lynxos${UNAME_RELEASE} exit ;; mc68030:UNIX_System_V:4.*:*) echo m68k-atari-sysv4 exit ;; TSUNAMI:LynxOS:2.*:*) echo sparc-unknown-lynxos${UNAME_RELEASE} exit ;; rs6000:LynxOS:2.*:*) echo rs6000-unknown-lynxos${UNAME_RELEASE} exit ;; PowerPC:LynxOS:2.*:* | PowerPC:LynxOS:3.[01]*:* | PowerPC:LynxOS:4.[02]*:*) echo powerpc-unknown-lynxos${UNAME_RELEASE} exit ;; SM[BE]S:UNIX_SV:*:*) echo mips-dde-sysv${UNAME_RELEASE} exit ;; RM*:ReliantUNIX-*:*:*) echo mips-sni-sysv4 exit ;; RM*:SINIX-*:*:*) echo mips-sni-sysv4 exit ;; *:SINIX-*:*:*) if uname -p 2>/dev/null >/dev/null ; then UNAME_MACHINE=`(uname -p) 2>/dev/null` echo ${UNAME_MACHINE}-sni-sysv4 else echo ns32k-sni-sysv fi exit ;; PENTIUM:*:4.0*:*) # Unisys `ClearPath HMP IX 4000' SVR4/MP effort # says echo i586-unisys-sysv4 exit ;; *:UNIX_System_V:4*:FTX*) # From Gerald Hewes . # How about differentiating between stratus architectures? -djm echo hppa1.1-stratus-sysv4 exit ;; *:*:*:FTX*) # From seanf@swdc.stratus.com. echo i860-stratus-sysv4 exit ;; i*86:VOS:*:*) # From Paul.Green@stratus.com. echo ${UNAME_MACHINE}-stratus-vos exit ;; *:VOS:*:*) # From Paul.Green@stratus.com. echo hppa1.1-stratus-vos exit ;; mc68*:A/UX:*:*) echo m68k-apple-aux${UNAME_RELEASE} exit ;; news*:NEWS-OS:6*:*) echo mips-sony-newsos6 exit ;; R[34]000:*System_V*:*:* | R4000:UNIX_SYSV:*:* | R*000:UNIX_SV:*:*) if [ -d /usr/nec ]; then echo mips-nec-sysv${UNAME_RELEASE} else echo mips-unknown-sysv${UNAME_RELEASE} fi exit ;; BeBox:BeOS:*:*) # BeOS running on hardware made by Be, PPC only. echo powerpc-be-beos exit ;; BeMac:BeOS:*:*) # BeOS running on Mac or Mac clone, PPC only. echo powerpc-apple-beos exit ;; BePC:BeOS:*:*) # BeOS running on Intel PC compatible. echo i586-pc-beos exit ;; BePC:Haiku:*:*) # Haiku running on Intel PC compatible. echo i586-pc-haiku exit ;; x86_64:Haiku:*:*) echo x86_64-unknown-haiku exit ;; SX-4:SUPER-UX:*:*) echo sx4-nec-superux${UNAME_RELEASE} exit ;; SX-5:SUPER-UX:*:*) echo sx5-nec-superux${UNAME_RELEASE} exit ;; SX-6:SUPER-UX:*:*) echo sx6-nec-superux${UNAME_RELEASE} exit ;; SX-7:SUPER-UX:*:*) echo sx7-nec-superux${UNAME_RELEASE} exit ;; SX-8:SUPER-UX:*:*) echo sx8-nec-superux${UNAME_RELEASE} exit ;; SX-8R:SUPER-UX:*:*) echo sx8r-nec-superux${UNAME_RELEASE} exit ;; Power*:Rhapsody:*:*) echo powerpc-apple-rhapsody${UNAME_RELEASE} exit ;; *:Rhapsody:*:*) echo ${UNAME_MACHINE}-apple-rhapsody${UNAME_RELEASE} exit ;; *:Darwin:*:*) UNAME_PROCESSOR=`uname -p` || UNAME_PROCESSOR=unknown eval $set_cc_for_build if test "$UNAME_PROCESSOR" = unknown ; then UNAME_PROCESSOR=powerpc fi if test `echo "$UNAME_RELEASE" | sed -e 's/\..*//'` -le 10 ; then if [ "$CC_FOR_BUILD" != 'no_compiler_found' ]; then if (echo '#ifdef __LP64__'; echo IS_64BIT_ARCH; echo '#endif') | \ (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) | \ grep IS_64BIT_ARCH >/dev/null then case $UNAME_PROCESSOR in i386) UNAME_PROCESSOR=x86_64 ;; powerpc) UNAME_PROCESSOR=powerpc64 ;; esac fi fi elif test "$UNAME_PROCESSOR" = i386 ; then # Avoid executing cc on OS X 10.9, as it ships with a stub # that puts up a graphical alert prompting to install # developer tools. Any system running Mac OS X 10.7 or # later (Darwin 11 and later) is required to have a 64-bit # processor. This is not true of the ARM version of Darwin # that Apple uses in portable devices. UNAME_PROCESSOR=x86_64 fi echo ${UNAME_PROCESSOR}-apple-darwin${UNAME_RELEASE} exit ;; *:procnto*:*:* | *:QNX:[0123456789]*:*) UNAME_PROCESSOR=`uname -p` if test "$UNAME_PROCESSOR" = "x86"; then UNAME_PROCESSOR=i386 UNAME_MACHINE=pc fi echo ${UNAME_PROCESSOR}-${UNAME_MACHINE}-nto-qnx${UNAME_RELEASE} exit ;; *:QNX:*:4*) echo i386-pc-qnx exit ;; NEO-?:NONSTOP_KERNEL:*:*) echo neo-tandem-nsk${UNAME_RELEASE} exit ;; NSE-*:NONSTOP_KERNEL:*:*) echo nse-tandem-nsk${UNAME_RELEASE} exit ;; NSR-?:NONSTOP_KERNEL:*:*) echo nsr-tandem-nsk${UNAME_RELEASE} exit ;; *:NonStop-UX:*:*) echo mips-compaq-nonstopux exit ;; BS2000:POSIX*:*:*) echo bs2000-siemens-sysv exit ;; DS/*:UNIX_System_V:*:*) echo ${UNAME_MACHINE}-${UNAME_SYSTEM}-${UNAME_RELEASE} exit ;; *:Plan9:*:*) # "uname -m" is not consistent, so use $cputype instead. 386 # is converted to i386 for consistency with other x86 # operating systems. if test "$cputype" = "386"; then UNAME_MACHINE=i386 else UNAME_MACHINE="$cputype" fi echo ${UNAME_MACHINE}-unknown-plan9 exit ;; *:TOPS-10:*:*) echo pdp10-unknown-tops10 exit ;; *:TENEX:*:*) echo pdp10-unknown-tenex exit ;; KS10:TOPS-20:*:* | KL10:TOPS-20:*:* | TYPE4:TOPS-20:*:*) echo pdp10-dec-tops20 exit ;; XKL-1:TOPS-20:*:* | TYPE5:TOPS-20:*:*) echo pdp10-xkl-tops20 exit ;; *:TOPS-20:*:*) echo pdp10-unknown-tops20 exit ;; *:ITS:*:*) echo pdp10-unknown-its exit ;; SEI:*:*:SEIUX) echo mips-sei-seiux${UNAME_RELEASE} exit ;; *:DragonFly:*:*) echo ${UNAME_MACHINE}-unknown-dragonfly`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` exit ;; *:*VMS:*:*) UNAME_MACHINE=`(uname -p) 2>/dev/null` case "${UNAME_MACHINE}" in A*) echo alpha-dec-vms ; exit ;; I*) echo ia64-dec-vms ; exit ;; V*) echo vax-dec-vms ; exit ;; esac ;; *:XENIX:*:SysV) echo i386-pc-xenix exit ;; i*86:skyos:*:*) echo ${UNAME_MACHINE}-pc-skyos`echo ${UNAME_RELEASE}` | sed -e 's/ .*$//' exit ;; i*86:rdos:*:*) echo ${UNAME_MACHINE}-pc-rdos exit ;; i*86:AROS:*:*) echo ${UNAME_MACHINE}-pc-aros exit ;; x86_64:VMkernel:*:*) echo ${UNAME_MACHINE}-unknown-esx exit ;; esac cat >&2 < in order to provide the needed information to handle your system. config.guess timestamp = $timestamp uname -m = `(uname -m) 2>/dev/null || echo unknown` uname -r = `(uname -r) 2>/dev/null || echo unknown` uname -s = `(uname -s) 2>/dev/null || echo unknown` uname -v = `(uname -v) 2>/dev/null || echo unknown` /usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null` /bin/uname -X = `(/bin/uname -X) 2>/dev/null` hostinfo = `(hostinfo) 2>/dev/null` /bin/universe = `(/bin/universe) 2>/dev/null` /usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null` /bin/arch = `(/bin/arch) 2>/dev/null` /usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null` /usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null` UNAME_MACHINE = ${UNAME_MACHINE} UNAME_RELEASE = ${UNAME_RELEASE} UNAME_SYSTEM = ${UNAME_SYSTEM} UNAME_VERSION = ${UNAME_VERSION} EOF exit 1 # Local variables: # eval: (add-hook 'write-file-hooks 'time-stamp) # time-stamp-start: "timestamp='" # time-stamp-format: "%:y-%02m-%02d" # time-stamp-end: "'" # End: madp-0.4/PaxHeaders.5405/ChangeLog0000644000000000000000000000007312717644140013534 xustar0029 atime=1463765180.05772051 30 ctime=1463765200.997553268 madp-0.4/ChangeLog0000664000372100037210000000326012717644140014365 0ustar00fransfrans000000000000002016-05-20 Frans Oliehoek * Release 0.4 * Includes spirit parser for .pomdp files * Includes new code for pruning POMDP vectors; obviates dependence on Cassandra's code and old LP solve version. * Includes new factor graph solution code * generalized firefighting CGBG domain aded * simulation class for Factored Dec-POMDPs and TOI Dec-MDPs * approximate BG clustering methods * kGMAA with clustering 2015-02-22 Frans Oliehoek * Release 0.3.1 * switched to 'c++98' standard. * added Max Plus solver for regular (non-graphical) Bayesian games. * Improved documentation. * Clearer distinction between examples and solvers. * More examples added. 2014-05-01 Frans Oliehoek * Release 0.3 * Many new features and algorithms: * Support for factored models. * Parsing ProbModelXML models. * GMAA*-ICE, DP-LPC. * Collaborative Graphical Bayesian Games + solvers. * Support for RL. * etc. 2010-03-12 Matthijs Spaan * Release 0.2.1, bugfix release mainly. * Update code to compile with GCC 4.4. * Allow for sparse reward models, and don't add zero entries. Thanks fo Silvano Bonacina for reporting this. * Added Clone() functionality to most abstract base classes. * Several small bugfixes. 2009-09-07 Matthijs Spaan * Release 0.2 * Many new classes and bugfixes, and some classes were moved to a different library. * The portion of the Boost libraries that MADP uses is shipped in the tarball now. 2008-01-21 Matthijs Spaan * Release 0.1 madp-0.4/PaxHeaders.5405/src0000644000000000000000000000013212717644322012472 xustar0030 mtime=1463765202.333542598 30 atime=1463765202.453541638 30 ctime=1463765202.333542598 madp-0.4/src/0000775000372100037210000000000012717644322013403 5ustar00fransfrans00000000000000madp-0.4/src/PaxHeaders.5405/parser0000644000000000000000000000013212717644321013765 xustar0030 mtime=1463765201.801546846 30 atime=1463765202.453541638 30 ctime=1463765201.801546846 madp-0.4/src/parser/0000775000372100037210000000000012717644321014676 5ustar00fransfrans00000000000000madp-0.4/src/parser/PaxHeaders.5405/dpomdp.spirit0000644000000000000000000000007412717644140016565 xustar0030 atime=1463765180.197719392 30 ctime=1463765201.021553076 madp-0.4/src/parser/dpomdp.spirit0000664000372100037210000003451112717644140017420 0ustar00fransfrans00000000000000//we can't simply skip end of lines as they have semantics in the multi-agent //case - this means we have to explicitly parse the eol's EOLTOK = eol_p; #if SUBGRAMMAR == 0 AGENTSTOK //new for DECENTRALIZED pomdp = str_p("agents"); DISCOUNTTOK = str_p("discount"); VALUESTOK = str_p("values"); STATESTOK = str_p("states"); ACTIONSTOK = str_p("actions"); OBSERVATIONSTOK = str_p("observations"); TTOK = str_p("T"); OTOK = str_p("O"); RTOK = str_p("R"); UNIFORMTOK = EOLTOK >> str_p("uniform") [SetLastParsedType(self._m_parserObject, UNIFORM)]; INTTOK = uint_p[StoreLastParsedElement(self._m_parserObject)]; #endif IDENTITYTOK = EOLTOK >> str_p("identity") [SetLastParsedType(self._m_parserObject, IDENTITY)]; REWARDTOK = str_p("reward"); COSTTOK = str_p("cost"); STARTTOK = str_p("start"); INCLUDETOK = str_p("include"); EXCLUDETOK = str_p("exclude"); RESETTOK = str_p("reset"); COLONTOK = str_p(":"); ASTERICKTOK = str_p("*")[SetLastParsedType(self._m_parserObject, ASTERICK)]; PLUSTOK = str_p("+"); MINUSTOK = str_p("-"); FLOATTOK = real_p[StoreLastParsedElement(self._m_parserObject)]; //([0-9]+ \. [0-9]* | \. [0-9]+ | [0-9]+ ) ([eE] [+-]? [0-9]+)? STRINGTOK = (lexeme_d[alpha_p >> *(alnum_p | ch_p('_') | ch_p('-') ) ] - reserved_word)[StoreLastParsedElement(self._m_parserObject)]; ; reserved_word = AGENTSTOK | DISCOUNTTOK | ACTIONSTOK | OBSERVATIONSTOK | TTOK | OTOK | RTOK ; dpomdp_file = eps_p[Initialize(self._m_parserObject)] >> dpomdp[InitializeDPOMDP(self._m_parserObject)] ; dpomdp = //NOTE start_state has been moved to a fixed place in the preamble //cassandra's def: preamble start_state param_list preamble[AddModels(self._m_parserObject)] >> param_list ; preamble = //NOTE the order of the preamble is now fixed //cassandra's def: preamble param_type | /* empty */ agents_param[DebugOutput("preamble_agents_param")] >> discount_param[DebugOutput("preamble_discount_param")] >> value_param[DebugOutput("preamble_value_param")] >> state_param[DebugOutput("preamble_state_param")] >> start_state[DebugOutput("preamble_start_state")] [InitializeStates(self._m_parserObject)] >> action_param[DebugOutput("preamble_action_param")] [InitializeActions(self._m_parserObject)] >> obs_param[DebugOutput("preamble_obs_param")] [InitializeObservations(self._m_parserObject)] ; agents_param = AGENTSTOK[DebugOutput("ap_AGENTSTOK")] >> COLONTOK >> agents_tail >> EOLTOK ; agents_tail = INTTOK [SetNrAgents(self._m_parserObject)] | ( +( STRINGTOK[DebugOutput("il_STRINGTOK_next")] [NextStringOfIdentList(self._m_parserObject)] ) )[AddAgents(self._m_parserObject)] ; discount_param = DISCOUNTTOK >> COLONTOK >> FLOATTOK[dp_SetDiscountParam(self. _m_parserObject)] >> EOLTOK ; value_param = VALUESTOK >> COLONTOK >> value_tail[DebugOutput("vp_value_tail")] >> EOLTOK ; value_tail = REWARDTOK[vt_REWARDTOK(self._m_parserObject)] | COSTTOK[vt_COSTTOK(self._m_parserObject)] ; state_param = STATESTOK[SetNrStates(self._m_parserObject,0)] >> COLONTOK >> state_tail[DebugOutput("sp_state_tail")] >> EOLTOK ; state_tail = INTTOK[SetNrStates(self._m_parserObject)] [DebugOutput("st_INTTOK")] | state_list[DebugOutput("st_ident_list")] ; state_list = // ident_list >> STRINGTOK | STRINGTOK +( STRINGTOK[AddState(self._m_parserObject)] ) ; //new - each agent has its actions on its own line action_param = ACTIONSTOK[SetAgentIndex(self._m_parserObject, 0)] >> COLONTOK >> +(EOLTOK >> action_param_line[DebugOutput("ap_action_param_line")]) >> EOLTOK ; action_param_line = action_tail[DebugOutput("apl_action_tail")][SetNextAgentIndex( self._m_parserObject)] ; action_tail = INTTOK[SetNrActions(self._m_parserObject)] | action_list[DebugOutput("at_ident_list")] ; action_list = +( STRINGTOK[AddAction(self._m_parserObject)] ) ; obs_param = OBSERVATIONSTOK[SetAgentIndex(self._m_parserObject, 0)] >> COLONTOK >> +(EOLTOK >> obs_param_line[DebugOutput("op_obs_param_line")]) >> EOLTOK ; obs_param_line = obs_tail[DebugOutput("opl_obs_tail")][SetNextAgentIndex( self._m_parserObject)] ; obs_tail = INTTOK[SetNrObservations(self._m_parserObject)] | obs_list[DebugOutput("ot_ident_list")] ; obs_list = +( STRINGTOK[AddObservation(self._m_parserObject)] ) ; start_state = ( STARTTOK[ResetCurMatrix(self._m_parserObject)] >> ( ( COLONTOK >> ( u_matrix[StartStateRowProbs(self._m_parserObject)] | STRINGTOK[AddStartState(self._m_parserObject)] [ProcessStartStateList(self._m_parserObject)] | INTTOK[AddStartState(self._m_parserObject)] [ProcessStartStateList(self._m_parserObject)] ) ) | (INCLUDETOK >> COLONTOK >> start_state_list [ProcessStartStateList(self._m_parserObject)]) | (EXCLUDETOK[StartStateExludes(self._m_parserObject)] >> COLONTOK >> start_state_list [ProcessStartStateList(self._m_parserObject)]) ) ) >> EOLTOK ; /*changed to remove left recursion: */ start_state_list = // cassandra's def: start_state_list state_or_indiv_act_or_obs | state_or_indiv_act_or_obs // easy substitute: +(state_or_indiv_act_or_obs) // NOTE - this allows '*' as states here... // we don't want that, so : +(STRINGTOK[AddStartState(self._m_parserObject)] [DebugOutput("ssl_STRINGTOK")] | INTTOK[AddStartState(self._m_parserObject)] [DebugOutput("ssl_INTTOK")]) ; param_list = *(param_spec) ; param_spec = trans_prob_spec | obs_prob_spec | reward_spec ; trans_prob_spec = TTOK[DebugOutput("tps_TTOK")][ResetCurMatrix(self._m_parserObject)] >> COLONTOK >> trans_spec_tail >> EOLTOK ; trans_spec_tail = joint_action[DebugOutput("tst_joint_action")] >> COLONTOK[DebugOutput("tst_COLON")] >> ( ( from_state[DebugOutput("tst_statefrom")] >> COLONTOK >> ( to_state[DebugOutput("tst_stateto")] >> COLONTOK >> prob [DebugOutput("tst_prob")] [ProcessTProb(self._m_parserObject)] | u_matrix[DebugOutput("tst_u_matrix")] [ProcessTRow(self._m_parserObject)] ) ) | ui_matrix[DebugOutput("tst_ui_matrix")] [ProcessTMatrix(self._m_parserObject)] ) ; obs_prob_spec = OTOK[DebugOutput("ops_OTOK")][ResetCurMatrix(self._m_parserObject)] >> COLONTOK >> obs_spec_tail >> EOLTOK ; obs_spec_tail = joint_action[DebugOutput("ost_joint_action")] >> COLONTOK >> ( ( to_state[DebugOutput("ost_stateto")] >> COLONTOK >> ( joint_obs[DebugOutput("ost_joint_obs")] >> COLONTOK >> prob [DebugOutput("ost_prob")] [ProcessOProb(self._m_parserObject)] | u_matrix[DebugOutput("ost_u_matrix")] [ProcessORow(self._m_parserObject)] ) ) | u_matrix[DebugOutput("ost_u_matrix")] [ProcessOMatrix(self._m_parserObject)] ) ; reward_spec = RTOK[DebugOutput("rs_rtok")][ResetCurMatrix(self._m_parserObject)] >> COLONTOK >> reward_spec_tail >> EOLTOK ; reward_spec_tail = joint_action[DebugOutput("rst_joint_action")] >> COLONTOK >> from_state[DebugOutput("rst_statefrom")] >> COLONTOK >> ( ( to_state[DebugOutput("rst_stateto")] >> COLONTOK >> ( joint_obs[DebugOutput("rst_jointobs")] >> COLONTOK >> FLOATTOK[DebugOutput("rst_FLOATTOK")] [ProcessR(self._m_parserObject)] | floats_matrix [DebugOutput("rst_floats_matrix")] [ProcessRRow(self._m_parserObject)] ) ) | floats_matrix [DebugOutput("rst_floats_matrix")] [ProcessRMatrix(self._m_parserObject)] ) ; ui_matrix = ( UNIFORMTOK[DebugOutput("ui_matrix UNIFORMTOK ")] | IDENTITYTOK | floats_matrix ) ; u_matrix = UNIFORMTOK[DebugOutput("um_UNIFORMTOK")] // | RESETTOK - NOTE:reset is not documented by cassandra, therefore // omitted here | floats_matrix[DebugOutput("um_floats_matrix")] ; floats_matrix = //floats_matrix >> floats | floats +(floats_row_vector[DebugOutput("pm_floats_row_vector")] [NextRowOfMatrix(self._m_parserObject)]) ; floats_row_vector = EOLTOK >> +(FLOATTOK[NextFloatOfRow(self._m_parserObject)]) ; //difference between prob and num is deprecated - only parse doubles // and do typechecking when putting data in model...(easier) /* prob_matrix = //prob_matrix >> prob | prob +(prob_row_vector[DebugOutput("pm_prob_row_vector")][NextRowOfMatrix( self._m_parserObject)]) ; prob_row_vector = EOLTOK >> +(prob[DebugOutput("prv_prob")][NextProbOfRow(self._m_parserObject)]) ; num_matrix = //num_matrix >> number | number +(num_row_vector[DebugOutput("nm_num_row_vector")]) ; num_row_vector = EOLTOK >> +(number[DebugOutput("nrv_number")]) ; */ from_state = state_or_indiv_act_or_obs[StoreLPFromState(self._m_parserObject)] ; to_state = state_or_indiv_act_or_obs[StoreLPToState(self._m_parserObject)] ; /* state_or_indiv_act_or_obs = INTTOK | STRINGTOK | ASTERICKTOK ; */ /*in order to discriminate between a joint action specified by * 1) a joint action index (or '*') * and * 2) multiple individual actions (indices, '*'s or action names) * * we have to require at least two individual indices in case (2).*/ joint_action = ( state_or_indiv_act_or_obs[StoreLPAction(self._m_parserObject)] >> +(state_or_indiv_act_or_obs[StoreLPAction(self._m_parserObject)]) )[StoreLPJointAction(self._m_parserObject)] | INTTOK[StoreLPJointAction(self._m_parserObject, true)] | ASTERICKTOK [WildCardJointAction(self._m_parserObject)] [StoreLPJointAction(self._m_parserObject)] //NYI(" the * joint action ")]//to indicate any joint action... ; /* the parsed sub-rules set the "_m_lp_type" variable, which is used by * StoreLPAction above. Therefore, no functions need to be called here.*/ state_or_indiv_act_or_obs = INTTOK | STRINGTOK | ASTERICKTOK //[NYI(" the * individual action ")] ; joint_obs = //first try to catch joint actions specified as "* * ... *" which //denote all joint observations // (we don't want to expand these individual joint observations...) ( ASTERICKTOK >> +ASTERICKTOK ) [WildCardJointObservation(self._m_parserObject)] | //the regular case of specifying individual observation(indice)s ( state_or_indiv_act_or_obs[StoreLPObservation(self._m_parserObject)] >> +(state_or_indiv_act_or_obs[StoreLPObservation(self._m_parserObject)]) )[StoreLPJointObservation(self._m_parserObject)] | //a joint observation index INTTOK[StoreLPJointObservation(self._m_parserObject, true)] | //a single '*' denoting all joint observations: ASTERICKTOK [WildCardJointObservation(self._m_parserObject)] //NYI(" the * joint obs ")]//to indicate any joint obs... ; /* state_or_indiv_act_or_obs = INTTOK | STRINGTOK | ASTERICKTOK ; */ /* old joint_obs = +(state_or_indiv_act_or_obs) | ASTERICKTOK //to indicate any joint observation... ; state_or_indiv_act_or_obs = INTTOK | STRINGTOK | ASTERICKTOK ; ident_list = // ident_list >> STRINGTOK | STRINGTOK +( STRINGTOK[DebugOutput("il_STRINGTOK_next")] [NextStringOfIdentList(self._m_parserObject)] ) ; */ prob = FLOATTOK // try float first -> don't want to be left with ".024" | INTTOK ; //XXX: // //this works: //R: open-left open-left : tiger-right : * : * +20 //but this doesn't: //R: open-right open-right : tiger-left : * : * 20 /* number // try float first -> don't want to be left with ".024" = float_r | int_r ; float_r = FLOATTOK[n_SetLPNumberType(self._m_parserObject,DOUBLE)] ; int_r = (optional_sign[n_SetLPNumUsedOptSign(self._m_parserObject,true)]) >> INTTOK[n_SetLPNumberType(self._m_parserObject,INT)] [n_ProcessNegation(self._m_parserObject)] | INTTOK[n_SetLPNumUsedOptSign(self._m_parserObject,false)] [n_SetLPNumberType(self._m_parserObject,INT)] ; optional_sign = PLUSTOK[os_SetNegated(self._m_parserObject,false)] | MINUSTOK[os_SetNegated(self._m_parserObject,true)] // | eps_p[DebugOutput("optional_sign_epsmatch")] ; */ madp-0.4/src/parser/PaxHeaders.5405/ParserPOMDPFormat_Spirit.cpp0000644000000000000000000000013012717644275021313 xustar0028 mtime=1463765181.6617077 30 atime=1463765181.649707795 30 ctime=1463765201.793546909 madp-0.4/src/parser/ParserPOMDPFormat_Spirit.cpp0000664000372100037210000013375612717644275022170 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * * For contact information please see the included AUTHORS file. */ #include "ParserPOMDPFormat_Spirit.h" //#include "CommentOrBlankParser.h" #include "CommentBlankOrNewlineParser.h" using namespace std; namespace POMDPFormatParsing{ /**Outputs the file_position structure info (gotten from * postion_iterator::get_position() ). */ std::ostream& operator<<(std::ostream& out, file_position const& lc) { return out << "\nFile:\t" << lc.file << "\nLine:\t" << lc.line << "\nCol:\t" << lc.column << endl; } //Default constructor ParserPOMDPFormat_Spirit::ParserPOMDPFormat_Spirit(POMDPDiscrete* problem) : // UNIFORMTOK(this), _m_decPOMDPDiscrete(problem) { if(DEBUG_POMDP_PARSE) { cout << "Creating parser, referring to problem..."; cout << problem->MultiAgentDecisionProcess::SoftPrint(); cout << endl; } //need to reset the parse matrix the first time... _m_matrixModified = true; _m_identListModified = false; _m_startStateListExclude = false; _m_nrA = 0; _m_curAI = 0; // UNIFORMTOK = uniformtok(this); } /* // Actions void ParserPOMDPFormat_Spirit::echo(iterator_t first, iterator_t const& last) { while (first != last) std::cout << *first++; } */ // Main program void ParserPOMDPFormat_Spirit::Parse() { string pf = GetPOMDPDiscrete()->GetProblemFile(); const char* pf_c = pf.c_str(); // Create a file iterator for this file iterator_t_fi first_fi(pf_c); if (!first_fi) { stringstream ss; ss << "Unable to open file: "< info; // Parse try{ // Spirit changed when upgrading from 1.33.1 to 1.34.0: // trailing spaces are no longer accepted, which the next line // to fail on some problems (those with trailing comments). Adding // ">> !end_p" to the grammar works around this problem. info = parse(first, last , pomdpfp >> !end_p, skip_parser); if (info.full) { if(DEBUG_POMDP_PARSE) cout << ">>>Parsing succeeded\n"; } else { iterator_t st = info.stop; iterator_t st2 = info.stop; for(Index i=1;i<200 && st2 != last ;i++)st2++; string unparsed(st, st2); cout << "stopped at: " << info.stop.get_position() << "-> unparsed : "<< "\"" << unparsed << "\"\n"; cout << "partial match? hit: \"" << info.hit << "\"\n"; cout << "consumed chars - length: \"" << info.length << "\"\n"; throw E("Parsing failed"); } } catch(E& e) { e.Print(); } if(DEBUG_POMDP_PARSE) cout << "-------------------------\n"; return; } //used functor functions: void ParserPOMDPFormat_Spirit::DebugOutput::operator()(iterator_t str, iterator_t end) const { if(DEBUG_POMDP_PARSE) cout << s <<" parsed: \"" << string(str,end) << "\""<_m_lp_int = i; _m_po->_m_lp_type = INT; } void ParserPOMDPFormat_Spirit::StoreLastParsedElement::operator()(const unsigned int i) const { if(DEBUG_POMDP_PARSE) cout << "Stored Last Parsed: uint "<_m_lp_uint = i; _m_po->_m_lp_type = UINT; } void ParserPOMDPFormat_Spirit::StoreLastParsedElement::operator()(const double f) const { if(DEBUG_POMDP_PARSE) cout << "Stored Last Parsed: double "<_m_lp_double = f; _m_po->_m_lp_type = DOUBLE; } void ParserPOMDPFormat_Spirit::StoreLastParsedElement::operator()(iterator_t str, iterator_t end) const { _m_po->_m_lp_string.clear(); _m_po->_m_lp_string = string(str, end); if(DEBUG_POMDP_PARSE) cout << "Stored Last Parsed: string "<< _m_po->_m_lp_string << endl; _m_po->_m_lp_type = STRING; } void ParserPOMDPFormat_Spirit::SetNrAgents::operator()(iterator_t first, iterator_t last) const { if(DEBUG_POMDP_PARSE) {cout <<"setting number of agents to 1..."<GetPOMDPDiscrete()->SetNrAgents(1); _m_po->_m_nrA = 1; return; #if 0 if (_m_po->_m_lp_type != UINT) { stringstream msg; msg << "SetNrAgents::operator()(iterator_t first, iterator_t last) requires that last parsed element is a UINT!"<< "(at " << _m_po->_m_first->get_position() << ")" << endl; throw EParse(msg); } size_t nrA = _m_po->_m_lp_uint; if(DEBUG_POMDP_PARSE){cout <<"agt_SetNrAgents - nrA="<GetPOMDPDiscrete()->SetNrAgents(nrA); _m_po->_m_nrA = nrA; #endif } void ParserPOMDPFormat_Spirit::SetNrAgents::operator()(const int& i) const { if(DEBUG_POMDP_PARSE) {cout <<"setting number of agents to 1..."<GetPOMDPDiscrete()->SetNrAgents(1); _m_po->_m_nrA = 1; return; #if 0 if(DEBUG_POMDP_PARSE){cout << "i="<_m_lp_JA.push_back(_m_po->_m_anyJAIndex); } } /* void ParserPOMDPFormat_Spirit::StoreLPJointAction::operator()(iterator_t str, iterator_t end) const { _m_po->_m_lp_JAI.clear(); if(_m_isJointActionIndex) { //_m_lp_JA not necessary: clear it. _m_po->_m_lp_JA.clear(); _m_po->_m_lp_JAI.push_back(_m_po->_m_lp_int); return; } try{ MatchingJointActions(0,_m_po->_m_lp_JA); } catch(E e) { file_position fp = str.get_position(); stringstream ermsg; ermsg << e.SoftPrint() << endl << "(at " << fp << ")"<_m_lp_JA.clear(); } void ParserPOMDPFormat_Spirit::StoreLPJointAction::operator()(const unsigned int&) const { _m_po->_m_lp_JAI.clear(); if(_m_isJointActionIndex) { //_m_lp_JA not necessary: clear it. _m_po->_m_lp_JA.clear(); _m_po->_m_lp_JAI.push_back(_m_po->_m_lp_int); return; } MatchingJointActions(0,_m_po->_m_lp_JA); _m_po->_m_lp_JA.clear(); } */ void ParserPOMDPFormat_Spirit::StoreLPJointAction::Store() const { _m_po->_m_lp_JAI.clear(); //check to see if the last parsed index was a joint action index if(_m_isJointActionIndex) { //_m_lp_JA not necessary: clear it. _m_po->_m_lp_JA.clear(); //do check that the last parsed element was a index (uint) if (_m_po->_m_lp_type != UINT) { stringstream msg; msg << "StoreLPJointAction::Store() requires that last parsed element is a UINT! (last parsed index was a joint action index)"<< endl; throw EParse(msg); } _m_po->_m_lp_JAI.push_back(_m_po->_m_lp_uint); return; } MatchingJointActions(0,_m_po->_m_lp_JA); _m_po->_m_lp_JA.clear(); } //Construct the set of joint actions that may match any wildcards recursively: void ParserPOMDPFormat_Spirit::StoreLPJointAction::MatchingJointActions (Index curAgent, vector indIndices) const { if(_m_po->_m_nrA != indIndices.size()) { stringstream msg; msg << "individual indices vector has wrong size. ("<< indIndices.size() << " while nrAgents is " << _m_po->_m_nrA << ")"<< "at(" << _m_po->_m_first->get_position() << ")" << endl;; throw EParse(msg); } if(curAgent == _m_po->_m_nrA) //past last agent: all work done { Index jaI = 0; try { jaI = _m_po->GetPOMDPDiscrete()->IndividualToJointActionIndices(indIndices); _m_po->_m_lp_JAI.push_back(jaI); } catch(E e) { stringstream ss; ss << e.SoftPrint() << "(at "<< _m_po->_m_first-> get_position()<<")"<::iterator it = indIndices.begin(); vector::iterator last = indIndices.end(); while(it != last){ cout << *it <<" "; it++;} cout << "> = "<_m_anyJAIndex) //<- IF THIS IS A WILDCARD { //do for each action of this agent //size_t nrAc = _m_po->GetPOMDPDiscrete()->GetNrActions(curAgent); size_t nrAc = _m_po->GetPOMDPDiscrete()->GetNrSingleAgentActions(); for(Index ai=0; ai < nrAc; ai++) { indIndices[curAgent] = ai; MatchingJointActions(curAgent+1, indIndices); } } else MatchingJointActions(curAgent+1, indIndices); } } void ParserPOMDPFormat_Spirit::WildCardJointObservation::operator()(iterator_t str, iterator_t end) const { if(DEBUG_POMDP_PARSE ) cout << "WildCardJointObservation: _m_lp_JOI.size()="<<_m_po->_m_lp_JOI.size(); //this (can) contain elements from a failed indiv_action parse. _m_po->_m_lp_JO.clear(); _m_po->_m_lp_JOI.clear(); //this is different from how we handle joint actions: joint actions are //immediately expanded (i.e. '*'/ANY_INDEX is replaced by all matching //indices.) //For joint observations, this is not practical, as for most common reward //forms, this is not required. I.e., one will typically specify //R: ja : s : * : * : prob //then we want to call addReward(ja,s) and not expand the succesor states //and joint observations... _m_po->_m_lp_JOI.push_back(_m_po->_m_anyJOIndex); } /* void ParserPOMDPFormat_Spirit::StoreLPJointObservation::operator()(const unsigned int&) const { Store(); } void ParserPOMDPFormat_Spirit::StoreLPJointObservation::operator()(iterator_t str, iterator_t end) const { Store(); } */ void ParserPOMDPFormat_Spirit::StoreLPJointObservation::Store() const { _m_po->_m_lp_JOI.clear(); if(_m_isJointObservationIndex) //as opposed to parsing individual indices { //_m_lp_JO not necessary: clear it. _m_po->_m_lp_JO.clear(); //do check that the last parsed element was a index (uint) if (_m_po->_m_lp_type != UINT) { stringstream msg; msg << "StoreLPJointObservation::Store() requires that last parsed element is a UINT! (last parsed index was a joint action index)"<< endl; throw EParse(msg); } _m_po->_m_lp_JOI.push_back(_m_po->_m_lp_uint); return; } MatchingJointObservations(0,_m_po->_m_lp_JO); _m_po->_m_lp_JO.clear(); } /* void ParserPOMDPFormat_Spirit::StoreLPJointObservation::operator()(iterator_t str, iterator_t end) const { _m_po->_m_lp_JOI.clear(); if(_m_isJointObservationIndex) //as opposed to parsing individual indices { //_m_lp_JO not necessary: clear it. _m_po->_m_lp_JO.clear(); _m_po->_m_lp_JOI.push_back(_m_po->_m_lp_int); return; } try{ MatchingJointObservations(0,_m_po->_m_lp_JO); } catch(E e) { stringstream ermsg; ermsg << e.SoftPrint() << endl << "(at " << str.get_position() << ")"<_m_lp_JO.clear(); } */ void ParserPOMDPFormat_Spirit::StoreLPJointObservation::MatchingJointObservations (Index curAgent, vector indIndices) const { if(_m_po->_m_nrA != indIndices.size()) { stringstream msg; msg << "individual obs indices vector has wrong size. ("<_m_nrA << ")" << "at(" << _m_po->_m_first->get_position() << ")" << endl;; throw EParse(msg); } if(curAgent == _m_po->_m_nrA) //past last agent: all work done { Index joI = 0; try { joI = _m_po->GetPOMDPDiscrete()->IndividualToJointObservationIndices( indIndices); _m_po->_m_lp_JOI.push_back(joI); } catch(E e) { stringstream ss; ss <_m_first->get_position() << ")" << endl; throw EParse(ss); } if(DEBUG_POMDP_PARSE) { cout<<"MatchingJointObservations: joint observation index for < "; vector::iterator it = indIndices.begin(); vector::iterator last = indIndices.end(); while(it != last){ cout << *it <<" "; it++;} cout << "> = "<_m_anyJOIndex) { //do for each action of this agent //size_t nrObs = _m_po->GetPOMDPDiscrete()->GetNrObservations(curAgent); size_t nrObs = _m_po->GetPOMDPDiscrete()->GetNrSingleAgentObservations(); for(Index oi=0; oi < nrObs; oi++) { indIndices[curAgent] = oi; MatchingJointObservations(curAgent+1, indIndices); } } else MatchingJointObservations(curAgent+1, indIndices); } } void ParserPOMDPFormat_Spirit::StoreLPFromState::operator()(iterator_t str, iterator_t end) const { if(DEBUG_POMDP_PARSE) cout << "StoreLPFromState: pushing "<_m_lp_sI"<_m_lp_fromSI.clear(); if(_m_po->_m_lp_type == UINT) { unsigned int index = _m_po->_m_lp_uint; size_t nrS = _m_po->GetPOMDPDiscrete()->GetNrStates(); if(index >= nrS) { stringstream ss; ss<<"StoreLPFromState: '"<< index<< "' is not a valid state index!? Number of states is " << nrS <<" (at " <_m_lp_fromSI.push_back( _m_po->_m_lp_uint ); } else if(_m_po->_m_lp_type == STRING) { try { Index sI = _m_po->GetPOMDPDiscrete()->GetStateIndexByName( _m_po->_m_lp_string); _m_po->_m_lp_fromSI.push_back(sI); } catch(E e) { stringstream ermsg; ermsg << e.SoftPrint() << " (at " << str.get_position() << ")"<_m_lp_type == ASTERICK ) _m_po->_m_lp_fromSI.push_back(_m_po->_m_anyStateIndex); else throw E("StoreLPFromState expected that the last parsed type is a state index(uint), state name (string) or wilcard ('*')."); } void ParserPOMDPFormat_Spirit::StoreLPToState::operator()(iterator_t str, iterator_t end) const { if(DEBUG_POMDP_PARSE) cout << "StoreLPToState: pushing "<_m_lp_sI"<_m_lp_toSI.clear(); if(_m_po->_m_lp_type == UINT) { unsigned int index = _m_po->_m_lp_uint; size_t nrS = _m_po->GetPOMDPDiscrete()->GetNrStates(); if(index >= nrS) { stringstream ss; ss<<"StoreLPToState: '"<< index<< "' is not a valid state index!? Number of states is " << nrS <<" (at " <_m_lp_toSI.push_back( _m_po->_m_lp_uint ); } else if(_m_po->_m_lp_type == STRING) { try { Index sI = _m_po->GetPOMDPDiscrete()->GetStateIndexByName( _m_po->_m_lp_string); _m_po->_m_lp_toSI.push_back(sI); } catch(E e) { stringstream ermsg; ermsg << e.SoftPrint() << " (at " << str.get_position() << ")"<_m_lp_type == ASTERICK ) _m_po->_m_lp_toSI.push_back(_m_po->_m_anyStateIndex); else throw E("StoreLPToState expected that the last parsed type is a state index(uint), state name (string) or wilcard ('*')."); } void ParserPOMDPFormat_Spirit::ProcessTProb::operator()(iterator_t str, iterator_t end) const { if(_m_po->_m_lp_type != DOUBLE) { stringstream ss; ss<<"ProcessTProb:last parsed type should be a double. (at " <_m_lp_double; if( _m_po->_m_lp_fromSI.size() != 1 || _m_po-> _m_lp_toSI.size() != 1 ) { stringstream ss; ss<<"ProcessTProb:_m_lp_fromSI or _m_lp_toSI has size != 1. (at " <_m_lp_fromSI[0]; Index sucSI = _m_po-> _m_lp_toSI[0]; Index jaI = 0; if( sI != _m_po->_m_anyStateIndex && sucSI != _m_po->_m_anyStateIndex && _m_po->_m_lp_JAI.size() != 1 ) { jaI = _m_po->_m_lp_JAI[0]; _m_po->GetPOMDPDiscrete()->SetTransitionProbability(sI, jaI, sucSI, prob); if(DEBUG_POMDP_PARSE) cout << "Setting T("<_m_anyStateIndex ) { _m_po->_m_lp_fromSI.clear(); for(Index si=0; si < _m_po->GetPOMDPDiscrete()->GetNrStates();si++) _m_po->_m_lp_fromSI.push_back(si); } if( sucSI == _m_po->_m_anyStateIndex ) { _m_po->_m_lp_toSI.clear(); for(Index si=0; si < _m_po->GetPOMDPDiscrete()->GetNrStates();si++) _m_po->_m_lp_toSI.push_back(si); } vector::iterator sI_it = _m_po->_m_lp_fromSI.begin(); vector::iterator sI_last = _m_po->_m_lp_fromSI.end(); while(sI_it != sI_last) { sI = *sI_it; vector::iterator jaI_it = _m_po->_m_lp_JAI.begin(); vector::iterator jaI_last = _m_po->_m_lp_JAI.end(); while(jaI_it != jaI_last) { jaI = *jaI_it; vector::iterator sucSI_it = _m_po->_m_lp_toSI.begin(); vector::iterator sucSI_last = _m_po->_m_lp_toSI.end(); while(sucSI_it != sucSI_last) { sucSI = *sucSI_it; _m_po->GetPOMDPDiscrete()->SetTransitionProbability(sI, jaI, sucSI, prob); if(DEBUG_POMDP_PARSE) cout << "Setting T("<_m_lp_fromSI.size() != 1 ) { stringstream ss; ss<<"ProcessTRow:_m_lp_fromSI has size != 1. (at " <IsRowMatrixLP() ) { stringstream ss; ss<<"ProcessTRow: a row matrix should have been parsed. (at " < row = _m_po->_m_curMatrix[0]; size_t nrS = _m_po->GetPOMDPDiscrete()->GetNrStates(); if( row.size() != nrS) { stringstream ss; ss<<"ProcessTRow: exected a row matrix with nrStates="<_m_lp_fromSI[0]; Index jaI = 0; if( sI == _m_po->_m_anyStateIndex ) { _m_po->_m_lp_fromSI.clear(); for(Index si=0; si < _m_po->GetPOMDPDiscrete()->GetNrStates();si++) _m_po->_m_lp_fromSI.push_back(si); } vector::iterator sI_it = _m_po->_m_lp_fromSI.begin(); vector::iterator sI_last = _m_po->_m_lp_fromSI.end(); while(sI_it != sI_last) { sI = *sI_it; vector::iterator jaI_it = _m_po->_m_lp_JAI.begin(); vector::iterator jaI_last = _m_po->_m_lp_JAI.end(); while(jaI_it != jaI_last) { jaI = *jaI_it; for(Index sucSI=0; sucSI < nrS; sucSI++) { _m_po->GetPOMDPDiscrete()->SetTransitionProbability(sI, jaI, sucSI, row[sucSI]); if(DEBUG_POMDP_PARSE) cout << "Setting T("<GetPOMDPDiscrete()->GetNrStates(); if(_m_po->_m_lp_type == DOUBLE) { #if POMDPFORMAT_NEWLINES_SKIPPED /* code for POMDP file format, which skips newlines and thus delivers the matrix as a single row...*/ if(!_m_po->IsDimensionOfMatrix(1,nrS*nrS)) { stringstream ss; ss << "Expected a 1 x (nrS*nrS) row matrix."<<" (nrS="<< nrS <<"). At "<PrintDimensionOfMatrix() << ")" << endl; throw E(ss); } vector& row_vector = _m_po->_m_curMatrix.at(0); //also need to loop through matchin (joint) actions, since wildcards might have been used Index jaI = 0; vector::iterator jaI_it = _m_po->_m_lp_JAI.begin(); vector::iterator jaI_last = _m_po->_m_lp_JAI.end(); while(jaI_it != jaI_last) { jaI = *jaI_it; Index row_vector_index = 0; for(Index sI = 0; sI < nrS; sI++) { for(Index sucSI=0; sucSI < nrS; sucSI++) { double prob = row_vector.at(row_vector_index); // corresponds to _m_po->_m_curMatrix[sI][sucSI]; _m_po->GetPOMDPDiscrete()->SetTransitionProbability(sI, jaI, sucSI, prob); row_vector_index++; if(DEBUG_POMDP_PARSE) cout << "Setting T("<IsDimensionOfMatrix(nrS,nrS)) { stringstream ss; ss << "Expected a nrS x nrS matrix."<<" (nrS="<< nrS <<"). At "<PrintDimensionOfMatrix() << ")" << endl; throw E(ss); } Index jaI = 0; for(Index sI = 0; sI < nrS; sI++) { vector::iterator jaI_it = _m_po->_m_lp_JAI.begin(); vector::iterator jaI_last = _m_po->_m_lp_JAI.end(); while(jaI_it != jaI_last) { jaI = *jaI_it; for(Index sucSI=0; sucSI < nrS; sucSI++) { double prob = _m_po->_m_curMatrix[sI][sucSI]; _m_po->GetPOMDPDiscrete()->SetTransitionProbability (sI, jaI, sucSI, prob); if(DEBUG_POMDP_PARSE) cout << "Setting T("<_m_lp_type = "<<_m_po->_m_lp_type <_m_lp_type != DOUBLE) { stringstream ss; ss<<"ProcessOProb:last parsed type should be a double. (at " <_m_lp_double; if( _m_po-> _m_lp_toSI.size() != 1 ) { stringstream ss; ss<<"ProcessOProb: _m_lp_toSI has size != 1. (at " <_m_lp_JOI.size() <= 0 ) { stringstream ss; ss<<"ProcessOProb: _m_lp_JOI has size <= 0. (at " < _m_lp_toSI[0]; Index joI = _m_po->_m_lp_JOI[0]; if( sucSI == _m_po->_m_anyStateIndex ) //if '*' -> replace by a list of all state indices { _m_po->_m_lp_toSI.clear(); for(Index si=0; si < _m_po->GetPOMDPDiscrete()->GetNrStates();si++) _m_po->_m_lp_toSI.push_back(si); } if( joI == _m_po->_m_anyJOIndex ) //if '*' -> replace by list of all joint obs.indices { _m_po->_m_lp_JOI.clear(); for(Index jo=0; jo<_m_po->GetPOMDPDiscrete()->GetNrJointObservations();jo++) _m_po->_m_lp_JOI.push_back(jo); } vector::iterator joI_it = _m_po->_m_lp_JOI.begin(); vector::iterator joI_last = _m_po->_m_lp_JOI.end(); while(joI_it != joI_last) { joI = *joI_it; vector::iterator jaI_it = _m_po->_m_lp_JAI.begin(); vector::iterator jaI_last = _m_po->_m_lp_JAI.end(); while(jaI_it != jaI_last) { Index jaI = *jaI_it; vector::iterator sucSI_it = _m_po-> _m_lp_toSI.begin(); vector::iterator sucSI_last = _m_po-> _m_lp_toSI.end(); while(sucSI_it != sucSI_last) { sucSI = *sucSI_it; _m_po->GetPOMDPDiscrete()->SetObservationProbability (jaI, sucSI, joI, prob); if(DEBUG_POMDP_PARSE) cout << "Setting O("<IsRowMatrixLP() ) { stringstream ss; ss<<"ProcessORow: a row matrix should have been parsed. (at " < row = _m_po->_m_curMatrix[0]; size_t nrS = _m_po->GetPOMDPDiscrete()->GetNrStates(); size_t nrJO = _m_po->GetPOMDPDiscrete()->GetNrJointObservations(); if( row.size() != nrJO) { stringstream ss; ss<<"ProcessORow: exected a row matrix with nrJO="<_m_lp_toSI[0] == _m_po->_m_anyStateIndex ) { _m_po->_m_lp_toSI.clear(); for(Index si=0; si < nrS; si++) _m_po->_m_lp_toSI.push_back(si); } vector::iterator sI_it = _m_po->_m_lp_toSI.begin(); vector::iterator sI_last = _m_po->_m_lp_toSI.end(); while(sI_it != sI_last) { Index sucSI = *sI_it; vector::iterator jaI_it = _m_po->_m_lp_JAI.begin(); vector::iterator jaI_last = _m_po->_m_lp_JAI.end(); while(jaI_it != jaI_last) { Index jaI = *jaI_it; for(Index joI=0; joI < nrJO; joI++) { _m_po->GetPOMDPDiscrete()->SetObservationProbability (jaI, sucSI, joI, row[joI]); if(DEBUG_POMDP_PARSE) cout << "Setting O("<PrintDimensionOfMatrix() << ")" << endl; throw E(ss); } vector& row_vector = _m_po->_m_curMatrix.at(0); //also need to loop through matchin (joint) actions, since wildcards might have been used Index jaI = 0; vector::iterator jaI_it = _m_po->_m_lp_JAI.begin(); vector::iterator jaI_last = _m_po->_m_lp_JAI.end(); while(jaI_it != jaI_last) { jaI = *jaI_it; Index row_vector_index = 0; for(Index sucSI=0; sucSI < nrS; sucSI++) { for(Index joI = 0; joI < nrJO; joI++) { double prob = row_vector.at(row_vector_index); // corresponds to _m_po->_m_curMatrix[sucSI][joI]; _m_po->GetPOMDPDiscrete()->SetObservationProbability(jaI, sucSI, joI, prob); row_vector_index++; if(DEBUG_POMDP_PARSE) cout << "Setting O("<IsDimensionOfMatrix(nrS,nrJO)) { stringstream ss; ss << "Expected a nrS x nrJO matrix."<<" (nrS="<< nrS <<", nrJO="<PrintDimensionOfMatrix() << ")" << endl; throw E(ss); } Index jaI = 0; for(Index joI = 0; joI < nrJO; joI++) { vector::iterator jaI_it = _m_po->_m_lp_JAI.begin(); vector::iterator jaI_last = _m_po->_m_lp_JAI.end(); while(jaI_it != jaI_last) { jaI = *jaI_it; for(Index sucSI=0; sucSI < nrS; sucSI++) { double prob = _m_po->_m_curMatrix[sucSI][joI]; _m_po->GetPOMDPDiscrete()->SetObservationProbability(jaI, sucSI, joI, prob); if(DEBUG_POMDP_PARSE) cout << "Setting O("<_m_lp_type == UNIFORM) { double uniform_prob = 1.0 / nrJO; for(Index joI = 0; joI < nrJO; joI++) { vector::iterator jaI_it = _m_po->_m_lp_JAI.begin(); vector::iterator jaI_last = _m_po->_m_lp_JAI.end(); while(jaI_it != jaI_last) { Index jaI = *jaI_it; for(Index sucSI=0; sucSI < nrS; sucSI++) { double prob = uniform_prob;//_m_po->_m_curMatrix[sI][sucSI]; _m_po->GetPOMDPDiscrete()->SetObservationProbability (jaI, sucSI, joI, prob); if(DEBUG_POMDP_PARSE) cout << "Setting O("<_m_lp_type = "<<_m_po->_m_lp_type <_m_lp_type != DOUBLE) { stringstream ss; ss<<"ProcessR:last parsed type should be a double. (at " <_m_lp_double; if( _m_po-> _m_lp_fromSI.size() != 1 ) { stringstream ss; ss<<"ProcessR: _m_lp_fromSI has size != 1. (at " < _m_lp_toSI.size() != 1 ) { stringstream ss; ss<<"ProcessR: _m_lp_toSI has size != 1. (at " <GetPOMDPDiscrete()->GetNrStates(); //size_t nrJO = _m_po->GetPOMDPDiscrete()->GetNrJointObservations(); Index sucSI = _m_po-> _m_lp_toSI[0]; Index joI = _m_po->_m_lp_JOI[0]; if( sucSI == _m_po->_m_anyStateIndex && joI == _m_po->_m_anyJOIndex) { // rewards of the form R: ja : s : * : * : %f, so we can simply do // AddReward() if(_m_po->_m_lp_fromSI[0] == _m_po->_m_anyStateIndex) { _m_po->_m_lp_fromSI.clear(); for(Index si=0; si < nrS; si++) _m_po->_m_lp_fromSI.push_back(si); } vector::iterator sI_it = _m_po->_m_lp_fromSI.begin(); vector::iterator sI_last = _m_po->_m_lp_fromSI.end(); while(sI_it != sI_last) { Index sI = *sI_it; vector::iterator jaI_it = _m_po->_m_lp_JAI.begin(); vector::iterator jaI_last = _m_po->_m_lp_JAI.end(); while(jaI_it != jaI_last) { Index jaI = *jaI_it; _m_po->GetPOMDPDiscrete()->SetReward(sI, jaI, reward); if(DEBUG_POMDP_PARSE) cout << "Setting R("<_m_anyJOIndex ) //but end-state is not ANY_INDEX { if( _m_po->_m_lp_fromSI[0] == _m_po->_m_anyStateIndex ) { _m_po->_m_lp_fromSI.clear(); for(Index si=0; si < _m_po->GetPOMDPDiscrete()->GetNrStates();si++) _m_po->_m_lp_fromSI.push_back(si); } /* Obsolete test... if( sucSI == ANY_INDEX ) { _m_po->_m_lp_toSI.clear(); for(Index si=0; si < _m_po->GetPOMDPDiscrete()->GetNrStates();si++) _m_po->_m_lp_toSI.push_back(si); }*/ vector::iterator sI_it = _m_po->_m_lp_fromSI.begin(); vector::iterator sI_last = _m_po->_m_lp_fromSI.end(); while(sI_it != sI_last) { Index sI = *sI_it; vector::iterator jaI_it = _m_po->_m_lp_JAI.begin(); vector::iterator jaI_last = _m_po->_m_lp_JAI.end(); while(jaI_it != jaI_last) { Index jaI = *jaI_it; vector::iterator sucSI_it = _m_po->_m_lp_toSI.begin(); vector::iterator sucSI_last = _m_po->_m_lp_toSI.end(); while(sucSI_it != sucSI_last) { sucSI = *sucSI_it; _m_po->GetPOMDPDiscrete()->SetReward(sI, jaI, sucSI, reward); if(DEBUG_POMDP_PARSE) cout << "Setting R("<_m_lp_fromSI[0] == _m_po->_m_anyStateIndex ) { _m_po->_m_lp_fromSI.clear(); for(Index si=0; si < _m_po->GetPOMDPDiscrete()->GetNrStates();si++) _m_po->_m_lp_fromSI.push_back(si); } if( _m_po->_m_lp_toSI[0] == _m_po->_m_anyStateIndex ) { _m_po->_m_lp_toSI.clear(); for(Index si=0; si < _m_po->GetPOMDPDiscrete()->GetNrStates();si++) _m_po->_m_lp_toSI.push_back(si); } vector::iterator joI_it = _m_po->_m_lp_JOI.begin(); vector::iterator joI_last = _m_po->_m_lp_JOI.end(); while(joI_it != joI_last) { joI = *joI_it; vector::iterator sI_it = _m_po->_m_lp_fromSI.begin(); vector::iterator sI_last = _m_po->_m_lp_fromSI.end(); while(sI_it != sI_last) { Index sI = *sI_it; vector::iterator jaI_it = _m_po->_m_lp_JAI.begin(); vector::iterator jaI_last = _m_po->_m_lp_JAI.end(); while(jaI_it != jaI_last) { Index jaI = *jaI_it; vector::iterator sucSI_it = _m_po->_m_lp_toSI.begin(); vector::iterator sucSI_last = _m_po->_m_lp_toSI.end(); while(sucSI_it != sucSI_last) { sucSI = *sucSI_it; _m_po->GetPOMDPDiscrete()->SetReward(sI, jaI, sucSI,joI, reward); if(DEBUG_POMDP_PARSE) cout << "Setting R("<_m_lp_toSI.size() != 1 ) { stringstream ss; ss<<"ProcessRRow:_m_lp_fromSI has size != 1. (at " <IsRowMatrixLP() ) { stringstream ss; ss<<"ProcessRRow: a row matrix should have been parsed. (at " < row = _m_po->_m_curMatrix[0]; size_t nrS = _m_po->GetPOMDPDiscrete()->GetNrStates(); size_t nrJO = _m_po->GetPOMDPDiscrete()->GetNrJointObservations(); if( row.size() != nrJO) { stringstream ss; ss<<"ProcessRRow: exected a row matrix with nrJO="<_m_lp_fromSI[0] == _m_po->_m_anyStateIndex ) { _m_po->_m_lp_fromSI.clear(); for(Index si=0; si < _m_po->GetPOMDPDiscrete()->GetNrStates();si++) _m_po->_m_lp_fromSI.push_back(si); } if( _m_po->_m_lp_toSI[0] == _m_po->_m_anyStateIndex ) { _m_po->_m_lp_toSI.clear(); for(Index si=0; si < nrS; si++) _m_po->_m_lp_toSI.push_back(si); } vector::iterator sI_it = _m_po->_m_lp_fromSI.begin(); vector::iterator sI_last = _m_po->_m_lp_fromSI.end(); while(sI_it != sI_last) { Index sI = *sI_it; vector::iterator jaI_it = _m_po->_m_lp_JAI.begin(); vector::iterator jaI_last = _m_po->_m_lp_JAI.end(); while(jaI_it != jaI_last) { Index jaI = *jaI_it; vector::iterator sucSI_it = _m_po->_m_lp_toSI.begin(); vector::iterator sucSI_last = _m_po->_m_lp_toSI.end(); while(sucSI_it != sucSI_last) { Index sucSI = *sucSI_it; for(Index joI=0; joI < nrJO; joI++) { _m_po->GetPOMDPDiscrete()->SetReward(sI, jaI, sucSI,joI, row[joI]); if(DEBUG_POMDP_PARSE) cout << "Setting R("<IsDimensionOfMatrix(nrS,nrJO)) { stringstream ss; ss << "Expected a nrS x nrJO matrix."<< " (nrS="<< nrS <<", nrJO="<_m_lp_fromSI[0] == _m_po->_m_anyStateIndex ) { _m_po->_m_lp_fromSI.clear(); for(Index si=0; si < _m_po->GetPOMDPDiscrete()->GetNrStates();si++) _m_po->_m_lp_fromSI.push_back(si); } vector::iterator sI_it = _m_po->_m_lp_fromSI.begin(); vector::iterator sI_last = _m_po->_m_lp_fromSI.end(); while(sI_it != sI_last) { Index sI = *sI_it; vector::iterator jaI_it = _m_po->_m_lp_JAI.begin(); vector::iterator jaI_last = _m_po->_m_lp_JAI.end(); while(jaI_it != jaI_last) { Index jaI = *jaI_it; for(Index sucSI=0; sucSIGetPOMDPDiscrete()->SetReward(sI, jaI, sucSI,joI, _m_po->_m_curMatrix[sucSI][joI]); if(DEBUG_POMDP_PARSE) { cout << "Setting R(" << sI << "," << jaI <<"," << sucSI; cout << "," << joI << ") = " << _m_po->_m_curMatrix[sucSI][joI] << endl; } } } jaI_it++; } sI_it++; } } }// end namespace POMDPFormatParsing madp-0.4/src/parser/PaxHeaders.5405/ParserTOICompactRewardDecPOMDPDiscrete.cpp0000644000000000000000000000012612717644275023744 xustar0028 mtime=1463765181.6617077 28 atime=1463765181.6617077 30 ctime=1463765201.801546846 madp-0.4/src/parser/ParserTOICompactRewardDecPOMDPDiscrete.cpp0000664000372100037210000000316312717644275024600 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "ParserTOICompactRewardDecPOMDPDiscrete.h" ParserTOICompactRewardDecPOMDPDiscrete:: ParserTOICompactRewardDecPOMDPDiscrete( TOICompactRewardDecPOMDPDiscrete *problem) : ParserTOIDecPOMDPDiscrete(problem), _m_problem(problem) { } void ParserTOICompactRewardDecPOMDPDiscrete:: StoreDecPOMDP(DecPOMDPDiscrete *decpomdp, Index id) { MultiAgentDecisionProcessDiscrete* madp = _m_problem->GetIndividualMADPD(id); decpomdp->ExtractMADPDiscrete(madp); _m_problem->SetIndividualRewardModel(decpomdp->GetRewardModelPtr(), id); _m_problem->SetIndividualDecPOMDPD(decpomdp,id); } void ParserTOICompactRewardDecPOMDPDiscrete::ParseRewards() { size_t nrAgentsInInteraction=2; std::vector nrStates(nrAgentsInInteraction,0), nrActions(nrAgentsInInteraction,0); for(Index i=0;i!=nrAgentsInInteraction;++i) { nrStates[i]=_m_problem->GetIndividualMADPD(i)->GetNrStates(); nrActions[i]=_m_problem->GetIndividualMADPD(i)->GetNrJointActions(); } ParseRewards(nrAgentsInInteraction,nrStates,nrActions); } madp-0.4/src/parser/PaxHeaders.5405/Makefile.am0000644000000000000000000000007412717644140016102 xustar0030 atime=1463765192.549620741 30 ctime=1463765201.781547005 madp-0.4/src/parser/Makefile.am0000664000372100037210000000254512717644140016737 0ustar00fransfrans00000000000000include $(top_srcdir)/src/Makefile.custom include $(top_srcdir)/config/Make-rules ############## # Includedirs, libdirs, libs and cflags for all programs INCLUDEPATH = -I$(top_srcdir)/src/base\ -I$(top_srcdir)/src/include\ $(MADP_INCLUDES) AM_LDFLAGS = LDADD = AM_CPPFLAGS = $(MADP_CPPFLAGS) $(INCLUDEPATH) AM_CXXFLAGS = $(MADP_CXXFLAGS) AM_CFLAGS = $(MADP_CFLAGS) if DARWIN AM_CPPFLAGS += -DDARWIN endif PARSER_CPPFILES=\ ParserDPOMDPFormat_Spirit.cpp\ ParserPOMDPFormat_Spirit.cpp\ ParserTOIDecPOMDPDiscrete.cpp\ ParserTOIDecMDPDiscrete.cpp\ ParserTOIFactoredRewardDecPOMDPDiscrete.cpp\ ParserTOICompactRewardDecPOMDPDiscrete.cpp\ ParserProbModelXML.cpp\ ParserPOMDPDiscrete.cpp\ MADPParser.cpp PARSER_HFILES=$(PARSER_CPPFILES:.cpp=.h) ParserInterface.h\ CommentOrBlankParser.h\ CommentBlankOrNewlineParser.h PARSER_FILES=$(PARSER_CPPFILES) $(PARSER_HFILES) ############### # All DYNAMIC libraries # the LTLIBRARIES (LibTool-libraries) # the library to be build... lib_LTLIBRARIES = noinst_LTLIBRARIES = libMADPParser.la # sources for the library: libMADPParser_la_SOURCES = $(PARSER_FILES) libMADPParser_la_CPPFLAGS = $(AM_CPPFLAGS) $(CPP_OPTIMIZATION_FLAGS) libMADPParser_la_LIBADD = libMADPParser_la_DEPENDENCIES = # for installing the headers libMADPParser_ladir = $(pkgincludedir)#/parser libMADPParser_la_HEADERS = $(PARSER_HFILES) madp-0.4/src/parser/PaxHeaders.5405/ParserTOIDecMDPDiscrete.h0000644000000000000000000000013212717644275020473 xustar0030 mtime=1463765181.649707795 30 atime=1463765181.649707795 30 ctime=1463765201.785546974 madp-0.4/src/parser/ParserTOIDecMDPDiscrete.h0000664000372100037210000000241212717644275021326 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _PARSERTOIDECMDPDISCRETE_H_ #define _PARSERTOIDECMDPDISCRETE_H_ 1 /* the include directives */ #include #include "Globals.h" #include "TOIDecMDPDiscrete.h" #include "ParserInterface.h" /**\brief ParserTOIDecMDPDiscrete is a parser for * TOIDecMDPDiscrete. */ class ParserTOIDecMDPDiscrete : public ParserInterface { private: TOIDecMDPDiscrete *_m_problem; protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor ParserTOIDecMDPDiscrete(TOIDecMDPDiscrete *problem); void Parse(); }; #endif /* !_PARSERTOIDECMDPDISCRETE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/parser/PaxHeaders.5405/ParserDPOMDPFormat_Spirit.h0000644000000000000000000000013112717644275021065 xustar0029 mtime=1463765181.68170754 30 atime=1463765181.669707636 30 ctime=1463765201.781547005 madp-0.4/src/parser/ParserDPOMDPFormat_Spirit.h0000664000372100037210000012305412717644275021727 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * * For contact information please see the included AUTHORS file. */ #ifndef _PARSERDECPOMDPDISCRETE_H_ #define _PARSERDECPOMDPDISCRETE_H_ 1 /* the include directives */ #include #include #include "Globals.h" #include "DecPOMDPDiscrete.h" #include "EParse.h" #include #if USE_BOOST_SPIRIT_CLASSIC #include #include #else #include #include #include #endif #include "CommentOrBlankParser.h" #include "ParserInterface.h" using namespace boost::spirit; /* constants */ //use subgrammars (or not?) #define SUBGRAMMAR 0 //General parsing debug informations #define DEBUG_PARSE 0 //debugging the 'comment' parser: #define DEBUG_COMPARS 0 //debugging the 'comment or blank parser' : #define DEBUG_COBP 0 // the 'any' individual action to denote the wildcard '*' #define ANY_INDEX -1 namespace DPOMDPFormatParsing{ /**Outputs the file_position structure info (gotten from * postion_iterator::get_position() ). */ std::ostream& operator<<(std::ostream& out, file_position const& lc); /**ParserDPOMDPFormat_Spirit is a parser for DecPOMDPDiscrete. * That is, it parses the .dpomdp file format. * \todo TODO: CHANGE NAME? */ class ParserDPOMDPFormat_Spirit : public ParserInterface { typedef char char_t; typedef file_iterator iterator_t_fi; typedef position_iterator iterator_t; typedef scanner scanner_t; typedef rule rule_t; //used to now what has been parsed: enum parsed_t { INT, DOUBLE, UINT, STRING, ASTERICK, UNIFORM, IDENTITY }; private: // TODO DecPOMDPDiscrete* _m_decPOMDPDiscrete; DecPOMDPDiscrete* GetDecPOMDPDiscrete() { return _m_decPOMDPDiscrete; } struct Initialize { ParserDPOMDPFormat_Spirit* _m_po; Initialize (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { _m_po->_m_first = &str; } }; struct DebugOutputNoParsed { std::string s; DebugOutputNoParsed (std::string s2){s = s2;} void operator()(iterator_t str, iterator_t end) const; void operator()(const unsigned int&) const; void operator()(const double &) const; }; struct DebugOutput { std::string s; DebugOutput (std::string s2){s = s2;} void operator()(iterator_t str, iterator_t end) const; void operator()(const int&) const; void operator()(const unsigned int&) const; void operator()(const double&) const; }; struct StoreLastParsedElement { ParserDPOMDPFormat_Spirit* _m_po; StoreLastParsedElement(ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(const int i) const; void operator()(const unsigned int i) const; void operator()(const double f) const; void operator()(iterator_t str, iterator_t end) const; }; struct SetLastParsedType { ParserDPOMDPFormat_Spirit* _m_po; parsed_t _m_lastParsedType; SetLastParsedType (ParserDPOMDPFormat_Spirit* po, parsed_t lpt) { _m_po = po; _m_lastParsedType = lpt; } void operator()(iterator_t str, iterator_t end) const { _m_po->_m_lp_type = _m_lastParsedType; } }; struct NYI//Not Yet Implemented { std::string msg; NYI(std::string s){msg = s;} void operator()(iterator_t str, iterator_t end) const { file_position fp = str.get_position(); std::stringstream ermsg; ermsg << "sorry, \""<< msg <<"\" is not yet implemented." << std::endl << "(at " << fp << ")"<_m_curAI = _m_temp_stor; } }; struct SetNextAgentIndex { ParserDPOMDPFormat_Spirit* _m_po; SetNextAgentIndex (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { if(_m_po->_m_curAI < _m_po->_m_nrA) _m_po->_m_curAI++; else std::cout << "SetNextAgentIndex - ERROR: current agent index ("<< _m_po->_m_curAI<<") out of bounds (number of agents="<< _m_po->_m_nrA<<")"<_m_curMatrix.push_back( std::vector() ); } }; struct NextFloatOfRow { ParserDPOMDPFormat_Spirit* _m_po; NextFloatOfRow (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { if(_m_po->_m_lp_type != DOUBLE) { std::cout <<"NextFloatOfRow - ERROR parsing probabilities, which" <<" means that doubles are expected, however last found" <<" type is #"<<_m_po->_m_lp_type<_m_curMatrix.size(); std::cout <<" _m_po->_m_curMatrix.size()= " << s <0) std::cout <<" _m_po->_m_curMatrix.back().size()= " << _m_po->_m_curMatrix.back().size()<_m_curMatrix.size(); if(s > 0) { double d = _m_po->_m_lp_double; //_m_curMatrix.back() isa vector _m_po->_m_curMatrix.back().push_back(d); _m_po->_m_matrixModified = true; } else std::cout << "NextFloatOfRow - ERROR _m_curMatrix contains no "<< "elements (i.e. there are no rows to add to...)."; if(DEBUG_PARSE){//DEBUG size_t s =_m_po->_m_curMatrix.size(); std::cout <<" _m_po->_m_curMatrix.size()= " << s <0) std::cout <<" _m_po->_m_curMatrix.back().size()= " << _m_po->_m_curMatrix.back().size()<_m_curIdentList.push_back(std::string(str,end)); _m_po->_m_identListModified = true; } }; struct SetNrStates { ParserDPOMDPFormat_Spirit* _m_po; size_t _m_target; bool _m_haveTarget; SetNrStates (ParserDPOMDPFormat_Spirit* po){ _m_po = po; _m_target = 0; _m_haveTarget = false; } SetNrStates (ParserDPOMDPFormat_Spirit* po, size_t i){ _m_po = po; _m_target = i; _m_haveTarget = true; } void operator()(const size_t& i) const { if(_m_haveTarget) _m_po->GetDecPOMDPDiscrete()->SetNrStates(_m_target); else _m_po->GetDecPOMDPDiscrete()->SetNrStates( i ); } void operator()(iterator_t str, iterator_t end) const { if(_m_haveTarget) _m_po->GetDecPOMDPDiscrete()->SetNrStates(_m_target); else if(_m_po->_m_lp_type == UINT)// || _m_lp_type _m_po->GetDecPOMDPDiscrete()->SetNrStates(_m_po->_m_lp_uint); else throw E("SetNrStates: no target value set and last parsed data type != UINT..."); } }; //this processes the start state specification in case of a specified //probability vector and in case of the keyword uniform. struct StartStateRowProbs { ParserDPOMDPFormat_Spirit* _m_po; StartStateRowProbs (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { if(_m_po->_m_lp_type == UNIFORM) { _m_po->GetDecPOMDPDiscrete()->SetUniformISD(); return; } //check size - it should be a row matrix... if( !_m_po->IsRowMatrixLP() ) throw E("StartStateRowProbs: _m_po->_m_curMatrix should \ be a row vector!"); if(_m_po->_m_curMatrix[0].size() != _m_po->GetDecPOMDPDiscrete()-> GetNrStates()) { std::string err = "StartStateRowProbs: _m_po->_m_curMatrix"; err += " [0] should contain NrStates(="; std::stringstream ss; ss << "StartStateRowProbs: _m_po->_m_curMatrix[0] " << "should contain NrStates(=" << _m_po->GetDecPOMDPDiscrete()-> GetNrStates() << ") entries! (not "<< _m_po->_m_curMatrix[0].size()<<")\n"; throw E( ss.str().c_str() ); } StateDistributionVector *isd=new StateDistributionVector(_m_po->_m_curMatrix[0]); _m_po->GetDecPOMDPDiscrete()->SetISD(isd); } }; //this adds states to the start state list - the first stage in //processing the other ways of specifying the start state distribution. struct AddStartState { ParserDPOMDPFormat_Spirit* _m_po; AddStartState (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { if(_m_po->_m_lp_type != STRING) { std::stringstream ss; ss << "SetStartState::operator()(iterator_t str, iterator_t end) - expected a string as last parsed type! (at"<GetDecPOMDPDiscrete()->GetStateIndexByName( _m_po->_m_lp_string); _m_po->_m_startStateListSI.push_back(sI); } catch(E e) { std::stringstream ss; ss << e.SoftPrint() << "(at"<< str.get_position() <<")"<_m_lp_type != UINT) { std::stringstream ss; ss << "SetStartState::operator()(const unsigned int i&) - expected a UINT as last parsed type! (at"<< _m_po->_m_first->get_position() <<")"<_m_startStateListSI.push_back( _m_po->_m_lp_uint); } }; //this functor specified that the states in the start state list should //be excluded, not included. struct StartStateExludes { ParserDPOMDPFormat_Spirit* _m_po; StartStateExludes (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { _m_po->_m_startStateListExclude = true; } }; struct ProcessStartStateList { ParserDPOMDPFormat_Spirit* _m_po; ProcessStartStateList (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(const unsigned int& i) const { ProcessList(); } void operator()(iterator_t str, iterator_t end) const { ProcessList(); } void ProcessList() const { size_t nrS = _m_po->GetDecPOMDPDiscrete()->GetNrStates(); size_t listSize = _m_po->_m_startStateListSI.size(); size_t nrIncS = (_m_po->_m_startStateListExclude)? nrS - listSize: listSize; double u_prob = 1.0 / nrIncS; std::vector init_probs; if(!_m_po->_m_startStateListExclude) //elems in list get uniform prob. init_probs = std::vector(nrS, 0.0); else //other elems get uniform prob init_probs = std::vector(nrS, u_prob); std::vector::iterator it = _m_po->_m_startStateListSI.begin(); std::vector::iterator last = _m_po->_m_startStateListSI.end(); while(it != last) { init_probs[*it] = _m_po->_m_startStateListExclude? 0.0 : u_prob; it++; } StateDistributionVector *isd=new StateDistributionVector(init_probs); _m_po->GetDecPOMDPDiscrete()->SetISD(isd); init_probs.clear(); _m_po->_m_startStateListSI.clear(); } }; struct SetNrActions { ParserDPOMDPFormat_Spirit* _m_po; SetNrActions (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { if(DEBUG_PARSE) { std::string s(str,end); std::cout << "SetNrActions: setting "<<_m_po->_m_lp_uint<< " actions for agent "<<_m_po->_m_curAI<GetDecPOMDPDiscrete()->SetNrActions(_m_po->_m_curAI, _m_po->_m_lp_uint); } void operator()(const unsigned int&) const { _m_po->GetDecPOMDPDiscrete()->SetNrActions(_m_po->_m_curAI, _m_po->_m_lp_uint); if(DEBUG_PARSE) std::cout << "SetNrActions: set "<<_m_po->_m_lp_uint<< " actions for agent "<<_m_po->_m_curAI<GetDecPOMDPDiscrete()->AddAction(_m_po->_m_curAI, s); if(DEBUG_PARSE) std::cout << "AddAction: added action "<_m_curAI<GetDecPOMDPDiscrete()->SetNrObservations(_m_po->_m_curAI, _m_po->_m_lp_uint); if(DEBUG_PARSE) std::cout << "SetNrObservations: set "<<_m_po->_m_lp_uint<< " observations for agent "<<_m_po->_m_curAI<GetDecPOMDPDiscrete()->SetNrObservations(_m_po->_m_curAI, _m_po->_m_lp_uint); if(DEBUG_PARSE) std::cout << "SetNrObservations: set "<<_m_po->_m_lp_uint<< " observations for agent "<<_m_po->_m_curAI<GetDecPOMDPDiscrete()->AddObservation(_m_po->_m_curAI, s); if(DEBUG_PARSE) std::cout << "AddObservation: added action "<_m_curAI<_m_anyStateIndex = _m_po->GetDecPOMDPDiscrete()->GetNrStates(); _m_po->GetDecPOMDPDiscrete()->SetStatesInitialized(true); } }; struct InitializeActions { ParserDPOMDPFormat_Spirit* _m_po; InitializeActions (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { _m_po->GetDecPOMDPDiscrete()->ConstructJointActions(); _m_po->GetDecPOMDPDiscrete()->SetActionsInitialized(true); _m_po->_m_anyJAIndex = _m_po->GetDecPOMDPDiscrete()-> GetNrJointActions(); } }; struct InitializeObservations { ParserDPOMDPFormat_Spirit* _m_po; InitializeObservations (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { _m_po->GetDecPOMDPDiscrete()->ConstructJointObservations(); _m_po->GetDecPOMDPDiscrete()->SetObservationsInitialized(true); _m_po->_m_anyJOIndex = _m_po->GetDecPOMDPDiscrete()-> GetNrJointObservations(); } }; struct AddModels { ParserDPOMDPFormat_Spirit* _m_po; AddModels (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { DecPOMDPDiscrete* p = _m_po->GetDecPOMDPDiscrete(); // add the transition model p->CreateNewTransitionModel(); p->CreateNewObservationModel(); p->CreateNewRewardModel(); //if(DEBUG_PARSE) _m_po->GetDecPOMDPDiscrete()->PrintInfo(); } }; struct StoreLPAction { ParserDPOMDPFormat_Spirit* _m_po; StoreLPAction (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { if(DEBUG_PARSE) std::cout << "StoreLPAction: pushing "<_m_lp_type == UINT) { unsigned int index = _m_po->_m_lp_uint; if(index >= _m_po->GetDecPOMDPDiscrete()->GetNrJointActions() ) { std::stringstream ss; ss<<"StoreLPAction: '"<< index<< "' is not valid!? Number of actions is " << _m_po->GetDecPOMDPDiscrete()->GetNrJointActions() <<" (at " <_m_lp_JA.push_back(_m_po->_m_lp_uint); } else if(_m_po->_m_lp_type == STRING) { //make sure that _m_lp_JA is cleared after each joint action //so we can do this: Index curAgIndex = _m_po->_m_lp_JA.size(); try { Index aI = _m_po->GetDecPOMDPDiscrete()->GetActionIndexByName( _m_po->_m_lp_string, curAgIndex); _m_po->_m_lp_JA.push_back(aI); } catch(E e) { std::stringstream ermsg; ermsg << e.SoftPrint() << " (at " << str.get_position() << ")"<_m_lp_type == ASTERICK ) _m_po->_m_lp_JA.push_back(_m_po->_m_anyJAIndex); else throw E("StoreLPAction expected that the last parsed type is a action index(uint), action name (string) or wilcard ('*')."); } }; /**called before StoreLPJointAction in case of a wildcard '*' joint * action. Effectively, this functions sets _m_lp_JA to a vector of * _m_po->_m_anyJAIndexs (one for each agent) .*/ struct WildCardJointAction { ParserDPOMDPFormat_Spirit* _m_po; WildCardJointAction (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct StoreLPJointAction { ParserDPOMDPFormat_Spirit* _m_po; bool _m_isJointActionIndex; StoreLPJointAction (ParserDPOMDPFormat_Spirit* po, bool b = false) { _m_po = po; _m_isJointActionIndex = b; } void operator()(iterator_t str, iterator_t end) const{Store();} void operator()(const unsigned int&) const{Store();} void Store() const; /**This function constructs the vector (_m_lp_JAI) of joint actions * that match with the vector with individual action indices. * * This is needed to properly deal with wild cards; a single action specification * in the (d)pomdp file may correspond to manu (joint) actions. */ void MatchingJointActions (Index curAgent, std::vector indIndices) const; }; struct StoreLPObservation { ParserDPOMDPFormat_Spirit* _m_po; StoreLPObservation (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { if(DEBUG_PARSE) std::cout << "StoreLPObservation: pushing "<_m_lp_type == UINT) _m_po->_m_lp_JO.push_back(_m_po->_m_lp_uint); else if(_m_po->_m_lp_type == STRING) { //make sure that _m_lp_JO is cleared after each joint action //so we can do this: Index curAgIndex = _m_po->_m_lp_JO.size(); try { Index aI = _m_po->GetDecPOMDPDiscrete()->GetObservationIndexByName( _m_po->_m_lp_string, curAgIndex); _m_po->_m_lp_JO.push_back(aI); } catch(E e) { std::stringstream ermsg; ermsg << e.SoftPrint() << " (at " << str.get_position() << ")"<_m_lp_type == ASTERICK ) _m_po->_m_lp_JO.push_back(_m_po->_m_anyJOIndex); else throw E("StoreLPObservation expected that the last parsed type is a action index(uint), action name (string) or wilcard ('*')."); } }; /**called before StoreLPJointObservation in case of a wildcard '*' joint * action. Effectively, this functions sets _m_lp_JO to a vector of * ANY_INDEXs (=_m_anyJOIndex) (one for each agent) .*/ struct WildCardJointObservation { ParserDPOMDPFormat_Spirit* _m_po; WildCardJointObservation (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct StoreLPJointObservation { ParserDPOMDPFormat_Spirit* _m_po; bool _m_isJointObservationIndex; StoreLPJointObservation (ParserDPOMDPFormat_Spirit* po, bool b = false) { _m_po = po; _m_isJointObservationIndex = b; } void operator()(iterator_t str, iterator_t end) const{Store();} void operator()(const unsigned int&) const{Store();} void Store() const; /**This function constructs the vector (_m_lp_JOI) of joint actions * that match with the vector with individual action indices. * * This is needed to properly deal with wild cards; a single specification * in the (d)pomdp file may correspond to many (joint) observations. * */ void MatchingJointObservations(Index curAgent, std::vector indIndices) const; }; struct StoreLPFromState { ParserDPOMDPFormat_Spirit* _m_po; StoreLPFromState (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct StoreLPToState { ParserDPOMDPFormat_Spirit* _m_po; StoreLPToState (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct ProcessTProb { ParserDPOMDPFormat_Spirit* _m_po; ProcessTProb (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct ProcessTRow { ParserDPOMDPFormat_Spirit* _m_po; ProcessTRow (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct ProcessTMatrix { ParserDPOMDPFormat_Spirit* _m_po; ProcessTMatrix (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct ProcessOProb { ParserDPOMDPFormat_Spirit* _m_po; ProcessOProb (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct ProcessORow { ParserDPOMDPFormat_Spirit* _m_po; ProcessORow (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct ProcessOMatrix { ParserDPOMDPFormat_Spirit* _m_po; ProcessOMatrix (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct ProcessR { ParserDPOMDPFormat_Spirit* _m_po; ProcessR (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct ProcessRRow { ParserDPOMDPFormat_Spirit* _m_po; ProcessRRow (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct ProcessRMatrix { ParserDPOMDPFormat_Spirit* _m_po; ProcessRMatrix (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct InitializeDPOMDP { ParserDPOMDPFormat_Spirit* _m_po; InitializeDPOMDP (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { _m_po->GetDecPOMDPDiscrete()->SetInitialized(true); } }; struct SetNrAgents { ParserDPOMDPFormat_Spirit* _m_po; SetNrAgents(ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t first, iterator_t last) const; void operator()(const int&) const; }; struct AddAgents { ParserDPOMDPFormat_Spirit* _m_po; AddAgents(ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t first, iterator_t last) const { _m_po->GetDecPOMDPDiscrete()->SetNrAgents(0); std::vector::iterator it = _m_po->_m_curIdentList.begin(); std::vector::iterator l = _m_po->_m_curIdentList.end(); while(it != l) { _m_po->GetDecPOMDPDiscrete()->AddAgent(*it); it++; _m_po->_m_nrA++; } _m_po->ClearCurIdentList(); } }; //discount param static void dp_number(iterator_t str, iterator_t end); struct dp_SetDiscountParam{ ParserDPOMDPFormat_Spirit* _m_po; dp_SetDiscountParam(ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t first, iterator_t last) const { std::string s(first, last); if(DEBUG_PARSE){std::cout << "discount="<_m_lp_type == DOUBLE ) { if(DEBUG_PARSE){std::cout <<"last parsed number was a DOUBLE"<< "(_m_po->_m_lp_double = "<<_m_po->_m_lp_double<<")\n";} discount = _m_po->_m_lp_double; } else if (_m_po->_m_lp_type == INT) { if(DEBUG_PARSE){std::cout <<"last parsed number was a INT"<< "(_m_po->_m_lp_int = "<<_m_po->_m_lp_int<<")\n";} //the discount was parsed as an int discount = (double) _m_po->_m_lp_int; } else if (_m_po->_m_lp_type == UINT) { if(DEBUG_PARSE){std::cout <<"last parsed number was a UINT"<< "(_m_po->_m_lp_uint = "<<_m_po->_m_lp_uint<<")\n";} //the discount was parsed as an int discount = (double) _m_po->_m_lp_uint; } if(DEBUG_PARSE){std::cout <<"dp_SetDiscountParam - discount="<< discount<GetDecPOMDPDiscrete()->SetDiscount(discount); } }; //value param static void vp_value_tail(iterator_t str, iterator_t end); struct vt_REWARDTOK { ParserDPOMDPFormat_Spirit* _m_po; vt_REWARDTOK (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { _m_po->GetDecPOMDPDiscrete()->SetRewardType(REWARD); } }; struct vt_COSTTOK { ParserDPOMDPFormat_Spirit* _m_po; vt_COSTTOK (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { _m_po->GetDecPOMDPDiscrete()->SetRewardType(COST); } }; //This is the functor which is called from the grammar (i.e. //dpomdp.spirit) to add the parsed state (names) to the problem. struct AddState { ParserDPOMDPFormat_Spirit* _m_po; AddState(ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t first, iterator_t last) const { if(DEBUG_PARSE){std::cout << "AddState - adding state \""<< _m_po->_m_lp_string<<"\"\n";} _m_po->GetDecPOMDPDiscrete()->AddState(_m_po->_m_lp_string); } }; struct DecPOMDPFileParser : public grammar { ParserDPOMDPFormat_Spirit* _m_parserObject; DecPOMDPDiscrete* _m_problem; DecPOMDPFileParser(ParserDPOMDPFormat_Spirit* parserObject) { _m_parserObject = parserObject; _m_problem = _m_parserObject->GetDecPOMDPDiscrete(); } template struct definition { #if SUBGRAMMAR #include "sub_grammar_defs.h" agentstok_parser AGENTSTOK; discounttok_parser DISCOUNTTOK; valuestok_parser VALUESTOK; statestok_parser STATESTOK; actionstok_parser ACTIONSTOK; observationstok_parser OBSERVATIONSTOK; ttok_parser TTOK; otok_parser OTOK; rtok_parser RTOK; //the parsers that need a reference: uniformtok_parser UNIFORMTOK; inttok_parser INTTOK; #endif definition(DecPOMDPFileParser const& self) #if SUBGRAMMAR : INTTOK(self._m_parserObject), UNIFORMTOK(self._m_parserObject) #endif { #include "dpomdp.spirit" } #if SUBGRAMMAR == 0 rule AGENTSTOK, DISCOUNTTOK,VALUESTOK,STATESTOK,ACTIONSTOK,OBSERVATIONSTOK,TTOK,OTOK,RTOK,UNIFORMTOK, INTTOK; #endif rule EOLTOK, IDENTITYTOK,REWARDTOK,COSTTOK,STARTTOK,INCLUDETOK,EXCLUDETOK,RESETTOK,COLONTOK,ASTERICKTOK,PLUSTOK,MINUSTOK,FLOATTOK,STRINGTOK, dpomdp_file,preamble,agents_param,discount_param,value_param,value_tail,state_param,state_tail,action_param,action_tail,obs_param,obs_tail,start_state,start_state_list,param_list,param_spec,trans_prob_spec,trans_spec_tail,obs_prob_spec,obs_spec_tail,reward_spec,reward_spec_tail,ui_matrix,u_matrix,prob, action_param_line,obs_param_line,joint_obs,joint_action,state_or_indiv_act_or_obs,agents_tail,prob_row_vector,num_row_vector,reserved_word,state_list, float_r, int_r, action_list,obs_list, floats_matrix, floats_row_vector, dpomdp, from_state, to_state ; rule const& start() const { return dpomdp_file; } }; }; protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor ParserDPOMDPFormat_Spirit(DecPOMDPDiscrete* problem=0); // Copy constructor. //ParserDPOMDPFormat_Spirit(const ParserDPOMDPFormat_Spirit& a); // Destructor. //~ParserDPOMDPFormat_Spirit(); //operators: //data manipulation (set) functions: /**The function that starts the parsing.*/ void Parse(); //get (data) functions: ///The last parsed ... unsigned int _m_lp_uint; int _m_lp_int; double _m_lp_double; std::string _m_lp_string; ///The type (INT or DOUBLE) of the last parsed number. parsed_t _m_lp_type; ///Whether the last 'number' used an optional sign ('+' or '-') bool _m_lp_number_used_opt_sign; ///Whether the last optional sign was a '-' bool _m_lp_number_negated; //the number of agents - used often therefore also stored here size_t _m_nrA; //the current agent index. Index _m_curAI; //The following are special indices denoting any state, (joint) action //or (joint) observation Index _m_anyJAIndex; Index _m_anyJOIndex; Index _m_anyStateIndex; std::vector< std::vector > _m_curMatrix; bool _m_matrixModified; struct ResetCurMatrix //TODO: move to proper place { ParserDPOMDPFormat_Spirit* _m_po; ResetCurMatrix (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { if(_m_po->_m_matrixModified) _m_po->ClearCurMatrix(); } }; void ClearCurMatrix()//TODO:move to proper place... { _m_curMatrix.clear();//no pointers stored, so this should not leak _m_curMatrix.push_back( std::vector() ); _m_matrixModified = false; } bool IsDimensionOfMatrix(size_t rows, size_t cols) { if(_m_curMatrix.size() != rows + 1) return false; for(Index r=0; r _m_curIdentList; bool _m_identListModified; struct ResetCurIdentList //TODO: move to proper place { ParserDPOMDPFormat_Spirit* _m_po; ResetCurIdentList (ParserDPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { //TODO:check whether the previous matrix was consistent if(_m_po->_m_identListModified) _m_po->ClearCurIdentList(); } }; void ClearCurIdentList()//TODO:move to proper place... { _m_curIdentList.clear();//no pointers stored, should not leak _m_identListModified = false; } /**A vector in which the currently parsed individual action indices * of a joint action are stored. (by StoreLPAction). * wild-cards (asterik) are stored as _m_anyJAIndex . */ std::vector _m_lp_JA; /**similar for the observations...*/ std::vector _m_lp_JO; /**A vector that stores the indices of joint actions that match the * last parsed joint action. (if the last parsed joint action didn't * contain any wildcards, the size of this vector is 1.) * This vector is constructed by StoreLPJointAction by transforming * the above vector (_m_lp_JA).*/ std::vector _m_lp_JAI; /**similar for the joint observations...*/ std::vector _m_lp_JOI; /**A vector that stores the last parsed from-state index. * Contrary to _m_lp_JAI above, this vector contains only 1 element,\ * which can be the ANY_INDEX (_m_anyStateIndex) . This is more * convenient, as it allows * easier selection of the proper AddReward and AddObservation * functions.*/ std::vector _m_lp_fromSI; /**idem, but for to-state.*/ std::vector _m_lp_toSI; /**A vector used to store the state indices for the start state * specification.*/ std::vector _m_startStateListSI; /**A boolean indicating whether the states in the start state list * should be excluded (versus the default: uniform prob. over the * specified states). */ bool _m_startStateListExclude; /**Pointer to the first iterator. This is used to give informative error messages. * (Specifically the position of the error.*/ iterator_t* _m_first; }; }// end namespace DPOMDPFormatParsing #endif /* !_PARSERDECPOMDPDISCRETE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/parser/PaxHeaders.5405/ParserTOIFactoredRewardDecPOMDPDiscrete.h0000644000000000000000000000013212717644275023547 xustar0030 mtime=1463765181.649707795 30 atime=1463765181.645707828 30 ctime=1463765201.785546974 madp-0.4/src/parser/ParserTOIFactoredRewardDecPOMDPDiscrete.h0000664000372100037210000000306612717644275024410 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _PARSERTOIFACTOREDREWARDDECPOMDPDISCRETE_H_ #define _PARSERTOIFACTOREDREWARDDECPOMDPDISCRETE_H_ 1 /* the include directives */ #include #include "Globals.h" #include "TOIFactoredRewardDecPOMDPDiscrete.h" #include "ParserTOIDecPOMDPDiscrete.h" #include "DecPOMDPDiscrete.h" /**\brief ParserTOIFactoredRewardDecPOMDPDiscrete is a parser for * TransitionObservationIndependentFactoredRewardDecPOMDPDiscrete. */ class ParserTOIFactoredRewardDecPOMDPDiscrete : public ParserTOIDecPOMDPDiscrete { private: TOIFactoredRewardDecPOMDPDiscrete *_m_problem; void StoreDecPOMDP(DecPOMDPDiscrete *decpomdp, Index id); protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor ParserTOIFactoredRewardDecPOMDPDiscrete( TOIFactoredRewardDecPOMDPDiscrete *problem); }; #endif /* !_PARSERTOIFACTOREDREWARDDECPOMDPDISCRETE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/parser/PaxHeaders.5405/Makefile.in0000644000000000000000000000013212717644310016105 xustar0030 mtime=1463765192.617620199 30 atime=1463765200.113560329 30 ctime=1463765201.781547005 madp-0.4/src/parser/Makefile.in0000664000372100037210000011672712717644310016757 0ustar00fransfrans00000000000000# Makefile.in generated by automake 1.14.1 from Makefile.am. # @configure_input@ # Copyright (C) 1994-2013 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ # Contains several project-wide Makefile options ##################################################################### # Optional software packages to be used, check configuration.h to # enable them # For using arbitrary length integers # Should be set if USE_ARBITRARY_PRECISION_INDEX is set to 1 #GMP_LD=-lgmpxx -lgmp VPATH = @srcdir@ am__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)' am__make_running_with_option = \ case $${target_option-} in \ ?) ;; \ *) echo "am__make_running_with_option: internal error: invalid" \ "target option '$${target_option-}' specified" >&2; \ exit 1;; \ esac; \ has_opt=no; \ sane_makeflags=$$MAKEFLAGS; \ if $(am__is_gnu_make); then \ sane_makeflags=$$MFLAGS; \ else \ case $$MAKEFLAGS in \ *\\[\ \ ]*) \ bs=\\; \ sane_makeflags=`printf '%s\n' "$$MAKEFLAGS" \ | sed "s/$$bs$$bs[$$bs $$bs ]*//g"`;; \ esac; \ fi; \ skip_next=no; \ strip_trailopt () \ { \ flg=`printf '%s\n' "$$flg" | sed "s/$$1.*$$//"`; \ }; \ for flg in $$sane_makeflags; do \ test $$skip_next = yes && { skip_next=no; continue; }; \ case $$flg in \ *=*|--*) continue;; \ -*I) strip_trailopt 'I'; skip_next=yes;; \ -*I?*) strip_trailopt 'I';; \ -*O) strip_trailopt 'O'; skip_next=yes;; \ -*O?*) strip_trailopt 'O';; \ -*l) strip_trailopt 'l'; skip_next=yes;; \ -*l?*) strip_trailopt 'l';; \ -[dEDm]) skip_next=yes;; \ -[JT]) skip_next=yes;; \ esac; \ case $$flg in \ *$$target_option*) has_opt=yes; break;; \ esac; \ done; \ test $$has_opt = yes am__make_dryrun = (target_option=n; $(am__make_running_with_option)) am__make_keepgoing = (target_option=k; $(am__make_running_with_option)) pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ DIST_COMMON = $(top_srcdir)/src/Makefile.custom \ $(top_srcdir)/config/Make-rules $(srcdir)/Makefile.in \ $(srcdir)/Makefile.am $(top_srcdir)/depcomp \ $(libMADPParser_la_HEADERS) @DARWIN_TRUE@am__append_1 = -DDARWIN subdir = src/parser ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_cplex.m4 \ $(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \ $(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \ $(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) mkinstalldirs = $(install_sh) -d CONFIG_HEADER = $(top_builddir)/config.h CONFIG_CLEAN_FILES = CONFIG_CLEAN_VPATH_FILES = am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; am__vpath_adj = case $$p in \ $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ *) f=$$p;; \ esac; am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`; am__install_max = 40 am__nobase_strip_setup = \ srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'` am__nobase_strip = \ for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||" am__nobase_list = $(am__nobase_strip_setup); \ for p in $$list; do echo "$$p $$p"; done | \ sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \ $(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \ if (++n[$$2] == $(am__install_max)) \ { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \ END { for (dir in files) print dir, files[dir] }' am__base_list = \ sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \ sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g' am__uninstall_files_from_dir = { \ test -z "$$files" \ || { test ! -d "$$dir" && test ! -f "$$dir" && test ! -r "$$dir"; } \ || { echo " ( cd '$$dir' && rm -f" $$files ")"; \ $(am__cd) "$$dir" && rm -f $$files; }; \ } am__installdirs = "$(DESTDIR)$(libdir)" \ "$(DESTDIR)$(libMADPParser_ladir)" LTLIBRARIES = $(lib_LTLIBRARIES) $(noinst_LTLIBRARIES) am__objects_1 = libMADPParser_la-ParserDPOMDPFormat_Spirit.lo \ libMADPParser_la-ParserPOMDPFormat_Spirit.lo \ libMADPParser_la-ParserTOIDecPOMDPDiscrete.lo \ libMADPParser_la-ParserTOIDecMDPDiscrete.lo \ libMADPParser_la-ParserTOIFactoredRewardDecPOMDPDiscrete.lo \ libMADPParser_la-ParserTOICompactRewardDecPOMDPDiscrete.lo \ libMADPParser_la-ParserProbModelXML.lo \ libMADPParser_la-ParserPOMDPDiscrete.lo \ libMADPParser_la-MADPParser.lo am__objects_2 = am__objects_3 = $(am__objects_2) am__objects_4 = $(am__objects_1) $(am__objects_3) am_libMADPParser_la_OBJECTS = $(am__objects_4) libMADPParser_la_OBJECTS = $(am_libMADPParser_la_OBJECTS) AM_V_lt = $(am__v_lt_@AM_V@) am__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@) am__v_lt_0 = --silent am__v_lt_1 = AM_V_P = $(am__v_P_@AM_V@) am__v_P_ = $(am__v_P_@AM_DEFAULT_V@) am__v_P_0 = false am__v_P_1 = : AM_V_GEN = $(am__v_GEN_@AM_V@) am__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@) am__v_GEN_0 = @echo " GEN " $@; am__v_GEN_1 = AM_V_at = $(am__v_at_@AM_V@) am__v_at_ = $(am__v_at_@AM_DEFAULT_V@) am__v_at_0 = @ am__v_at_1 = DEFAULT_INCLUDES = -I.@am__isrc@ -I$(top_builddir) depcomp = $(SHELL) $(top_srcdir)/depcomp am__depfiles_maybe = depfiles am__mv = mv -f CXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \ $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \ $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \ $(AM_CXXFLAGS) $(CXXFLAGS) AM_V_CXX = $(am__v_CXX_@AM_V@) am__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@) am__v_CXX_0 = @echo " CXX " $@; am__v_CXX_1 = CXXLD = $(CXX) CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \ $(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@ AM_V_CXXLD = $(am__v_CXXLD_@AM_V@) am__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@) am__v_CXXLD_0 = @echo " CXXLD " $@; am__v_CXXLD_1 = COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) \ $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \ $(AM_CFLAGS) $(CFLAGS) AM_V_CC = $(am__v_CC_@AM_V@) am__v_CC_ = $(am__v_CC_@AM_DEFAULT_V@) am__v_CC_0 = @echo " CC " $@; am__v_CC_1 = CCLD = $(CC) LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ $(AM_LDFLAGS) $(LDFLAGS) -o $@ AM_V_CCLD = $(am__v_CCLD_@AM_V@) am__v_CCLD_ = $(am__v_CCLD_@AM_DEFAULT_V@) am__v_CCLD_0 = @echo " CCLD " $@; am__v_CCLD_1 = SOURCES = $(libMADPParser_la_SOURCES) DIST_SOURCES = $(libMADPParser_la_SOURCES) am__can_run_installinfo = \ case $$AM_UPDATE_INFO_DIR in \ n|no|NO) false;; \ *) (install-info --version) >/dev/null 2>&1;; \ esac HEADERS = $(libMADPParser_la_HEADERS) am__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP) # Read a list of newline-separated strings from the standard input, # and print each of them once, without duplicates. Input order is # *not* preserved. am__uniquify_input = $(AWK) '\ BEGIN { nonempty = 0; } \ { items[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in items) print i; }; } \ ' # Make sure the list of sources is unique. This is necessary because, # e.g., the same source file might be shared among _SOURCES variables # for different programs/libraries. am__define_uniq_tagged_files = \ list='$(am__tagged_files)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | $(am__uniquify_input)` ETAGS = etags CTAGS = ctags DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ AM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFLAGS = @CFLAGS@ CPLEX_INCLUDES = @CPLEX_INCLUDES@ CPLEX_LDFLAGS = @CPLEX_LDFLAGS@ CPLEX_LIBS = @CPLEX_LIBS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CSTANDARD = @CSTANDARD@ CSTD = @CSTD@ CSTD11 = @CSTD11@ CSTDGNU = @CSTDGNU@ CSTDGNU11 = @CSTDGNU11@ CXX = @CXX@ CXXCPP = @CXXCPP@ CXXDEPMODE = @CXXDEPMODE@ CXXFLAGS = @CXXFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DLLTOOL = @DLLTOOL@ DSYMUTIL = @DSYMUTIL@ DUMPBIN = @DUMPBIN@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ FGREP = @FGREP@ GREP = @GREP@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LD = @LD@ LDFLAGS = @LDFLAGS@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LIBTOOL = @LIBTOOL@ LIPO = @LIPO@ LN_S = @LN_S@ LTLIBOBJS = @LTLIBOBJS@ MAKEINFO = @MAKEINFO@ MANIFEST_TOOL = @MANIFEST_TOOL@ MKDIR_P = @MKDIR_P@ NM = @NM@ NMEDIT = @NMEDIT@ OBJDUMP = @OBJDUMP@ OBJEXT = @OBJEXT@ OTOOL = @OTOOL@ OTOOL64 = @OTOOL64@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ POW_LIB = @POW_LIB@ RANLIB = @RANLIB@ SED = @SED@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STRIP = @STRIP@ VERSION = @VERSION@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_AR = @ac_ct_AR@ ac_ct_CC = @ac_ct_CC@ ac_ct_CXX = @ac_ct_CXX@ ac_ct_DUMPBIN = @ac_ct_DUMPBIN@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localedir = @localedir@ localstatedir = @localstatedir@ mandir = @mandir@ mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ LIBDAI_NORMAL = $(top_builddir)/src/libDAI/libDAI.la LIBDAI_INCLUDES = -I$(top_srcdir)/src/libDAI ##################################################################### # Compiler flags # the debug flags used - according to # http://sourceware.org/gdb/current/onlinedocs/gdb_13.html#SEC111 # dwarf-2 is best for c++ and gdb # -fno-inline should make things easier to debug DEBUG_FLAGS = -O0 -gdwarf-2 -fno-inline # Optimization flags used for building normal and profiling libraries. # -DNDEBUG speeds up the boost::numeric::ublas operations CPP_OPTIMIZATION_FLAGS = -O3 -DNDEBUG #machine architectecture specific flags #XXX: the following does not work on MacOS! (leave empty to resolve) # Matthijs: is it not just a problem with using a GCC version that is # too old to support this? MARCH_FLAGS = -march=native # automatically picks the correct settings for your system @FOUND_LIBXML2_TRUE@XML2_CXXFLAGS = `xml2-config --cflags` #default flags throughout all MADP: MADP_CXXFLAGS = -Wall -pipe $(MARCH_FLAGS) $(CSTANDARD) $(XML2_CXXFLAGS) MADP_CPPFLAGS = MADP_CFLAGS = ##################################################################### # The final include path MADP_INCLUDES = \ $(INCLUDE) \ $(LIBDAI_INCLUDES)\ -I$(top_srcdir)/src/boost MADP_LD = # $(LPSOLVE_LD) ##################################################################### # Lists of libs to be linked with binaries. # Note that the linking order matters, in order to correctly resolve symbols MADPLIBS_NORMAL_BASE = \ $(top_builddir)/src/base/libMADPBase.la MADPLIBS_NORMAL_BASE_SUPPORT = \ $(top_builddir)/src/support/libMADPSupport.la \ $(MADPLIBS_NORMAL_BASE) MADPLIBS_NORMAL_BASE_PARSER = \ $(top_builddir)/src/parser/libMADPParser.la \ $(MADPLIBS_NORMAL_BASE) \ $(LIBPOMDPSOLVE_NORMAL) $(LIBLPSOLVEOLD_NORMAL) $(LIBMDP_NORMAL) $(LIBLASPACK_NORMAL) MADPLIBS_NORMAL_BASE_PARSER_SUPPORT = \ $(top_builddir)/src/support/libMADPSupport.la \ $(MADPLIBS_NORMAL_BASE_PARSER) MADPLIBS_NORMAL = $(top_builddir)/src/madp/libMADP.la # $(top_builddir)/src/planning/libMADPPlanning.la \ # $(MADPLIBS_NORMAL_BASE_PARSER_SUPPORT) \ # $(LIBDAI_NORMAL) MADPLIBS_NORMAL_NOPARSER_NOPLANNING = $(MADPLIBS_NORMAL_BASE) MADPLIBS_NORMAL_NOPLANNING = $(MADPLIBS_NORMAL_BASE_PARSER_SUPPORT) MADPLIBS_NORMAL_NOPARSER = $(MADPLIBS_NORMAL) ############## # Includedirs, libdirs, libs and cflags for all programs INCLUDEPATH = -I$(top_srcdir)/src/base\ -I$(top_srcdir)/src/include\ $(MADP_INCLUDES) AM_LDFLAGS = LDADD = AM_CPPFLAGS = $(MADP_CPPFLAGS) $(INCLUDEPATH) $(am__append_1) AM_CXXFLAGS = $(MADP_CXXFLAGS) AM_CFLAGS = $(MADP_CFLAGS) PARSER_CPPFILES = \ ParserDPOMDPFormat_Spirit.cpp\ ParserPOMDPFormat_Spirit.cpp\ ParserTOIDecPOMDPDiscrete.cpp\ ParserTOIDecMDPDiscrete.cpp\ ParserTOIFactoredRewardDecPOMDPDiscrete.cpp\ ParserTOICompactRewardDecPOMDPDiscrete.cpp\ ParserProbModelXML.cpp\ ParserPOMDPDiscrete.cpp\ MADPParser.cpp PARSER_HFILES = $(PARSER_CPPFILES:.cpp=.h) ParserInterface.h\ CommentOrBlankParser.h\ CommentBlankOrNewlineParser.h PARSER_FILES = $(PARSER_CPPFILES) $(PARSER_HFILES) ############### # All DYNAMIC libraries # the LTLIBRARIES (LibTool-libraries) # the library to be build... lib_LTLIBRARIES = noinst_LTLIBRARIES = libMADPParser.la # sources for the library: libMADPParser_la_SOURCES = $(PARSER_FILES) libMADPParser_la_CPPFLAGS = $(AM_CPPFLAGS) $(CPP_OPTIMIZATION_FLAGS) libMADPParser_la_LIBADD = libMADPParser_la_DEPENDENCIES = # for installing the headers libMADPParser_ladir = $(pkgincludedir)#/parser libMADPParser_la_HEADERS = $(PARSER_HFILES) all: all-am .SUFFIXES: .SUFFIXES: .cpp .lo .o .obj $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(top_srcdir)/src/Makefile.custom $(top_srcdir)/config/Make-rules $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \ && { if test -f $@; then exit 0; else break; fi; }; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu src/parser/Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --gnu src/parser/Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ esac; $(top_srcdir)/src/Makefile.custom $(top_srcdir)/config/Make-rules: $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(top_srcdir)/configure: $(am__configure_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(ACLOCAL_M4): $(am__aclocal_m4_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(am__aclocal_m4_deps): install-libLTLIBRARIES: $(lib_LTLIBRARIES) @$(NORMAL_INSTALL) @list='$(lib_LTLIBRARIES)'; test -n "$(libdir)" || list=; \ list2=; for p in $$list; do \ if test -f $$p; then \ list2="$$list2 $$p"; \ else :; fi; \ done; \ test -z "$$list2" || { \ echo " $(MKDIR_P) '$(DESTDIR)$(libdir)'"; \ $(MKDIR_P) "$(DESTDIR)$(libdir)" || exit 1; \ echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'"; \ $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 "$(DESTDIR)$(libdir)"; \ } uninstall-libLTLIBRARIES: @$(NORMAL_UNINSTALL) @list='$(lib_LTLIBRARIES)'; test -n "$(libdir)" || list=; \ for p in $$list; do \ $(am__strip_dir) \ echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'"; \ $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f "$(DESTDIR)$(libdir)/$$f"; \ done clean-libLTLIBRARIES: -test -z "$(lib_LTLIBRARIES)" || rm -f $(lib_LTLIBRARIES) @list='$(lib_LTLIBRARIES)'; \ locs=`for p in $$list; do echo $$p; done | \ sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \ sort -u`; \ test -z "$$locs" || { \ echo rm -f $${locs}; \ rm -f $${locs}; \ } clean-noinstLTLIBRARIES: -test -z "$(noinst_LTLIBRARIES)" || rm -f $(noinst_LTLIBRARIES) @list='$(noinst_LTLIBRARIES)'; \ locs=`for p in $$list; do echo $$p; done | \ sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \ sort -u`; \ test -z "$$locs" || { \ echo rm -f $${locs}; \ rm -f $${locs}; \ } libMADPParser.la: $(libMADPParser_la_OBJECTS) $(libMADPParser_la_DEPENDENCIES) $(EXTRA_libMADPParser_la_DEPENDENCIES) $(AM_V_CXXLD)$(CXXLINK) $(libMADPParser_la_OBJECTS) $(libMADPParser_la_LIBADD) $(LIBS) mostlyclean-compile: -rm -f *.$(OBJEXT) distclean-compile: -rm -f *.tab.c @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPParser_la-MADPParser.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPParser_la-ParserDPOMDPFormat_Spirit.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPParser_la-ParserPOMDPDiscrete.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPParser_la-ParserPOMDPFormat_Spirit.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPParser_la-ParserProbModelXML.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPParser_la-ParserTOICompactRewardDecPOMDPDiscrete.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPParser_la-ParserTOIDecMDPDiscrete.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPParser_la-ParserTOIDecPOMDPDiscrete.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPParser_la-ParserTOIFactoredRewardDecPOMDPDiscrete.Plo@am__quote@ .cpp.o: @am__fastdepCXX_TRUE@ $(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.o$$||'`;\ @am__fastdepCXX_TRUE@ $(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\ @am__fastdepCXX_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.Po @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $< .cpp.obj: @am__fastdepCXX_TRUE@ $(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.obj$$||'`;\ @am__fastdepCXX_TRUE@ $(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\ @am__fastdepCXX_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.Po @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'` .cpp.lo: @am__fastdepCXX_TRUE@ $(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.lo$$||'`;\ @am__fastdepCXX_TRUE@ $(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\ @am__fastdepCXX_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $< libMADPParser_la-ParserDPOMDPFormat_Spirit.lo: ParserDPOMDPFormat_Spirit.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPParser_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPParser_la-ParserDPOMDPFormat_Spirit.lo -MD -MP -MF $(DEPDIR)/libMADPParser_la-ParserDPOMDPFormat_Spirit.Tpo -c -o libMADPParser_la-ParserDPOMDPFormat_Spirit.lo `test -f 'ParserDPOMDPFormat_Spirit.cpp' || echo '$(srcdir)/'`ParserDPOMDPFormat_Spirit.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPParser_la-ParserDPOMDPFormat_Spirit.Tpo $(DEPDIR)/libMADPParser_la-ParserDPOMDPFormat_Spirit.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='ParserDPOMDPFormat_Spirit.cpp' object='libMADPParser_la-ParserDPOMDPFormat_Spirit.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPParser_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPParser_la-ParserDPOMDPFormat_Spirit.lo `test -f 'ParserDPOMDPFormat_Spirit.cpp' || echo '$(srcdir)/'`ParserDPOMDPFormat_Spirit.cpp libMADPParser_la-ParserPOMDPFormat_Spirit.lo: ParserPOMDPFormat_Spirit.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPParser_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPParser_la-ParserPOMDPFormat_Spirit.lo -MD -MP -MF $(DEPDIR)/libMADPParser_la-ParserPOMDPFormat_Spirit.Tpo -c -o libMADPParser_la-ParserPOMDPFormat_Spirit.lo `test -f 'ParserPOMDPFormat_Spirit.cpp' || echo '$(srcdir)/'`ParserPOMDPFormat_Spirit.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPParser_la-ParserPOMDPFormat_Spirit.Tpo $(DEPDIR)/libMADPParser_la-ParserPOMDPFormat_Spirit.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='ParserPOMDPFormat_Spirit.cpp' object='libMADPParser_la-ParserPOMDPFormat_Spirit.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPParser_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPParser_la-ParserPOMDPFormat_Spirit.lo `test -f 'ParserPOMDPFormat_Spirit.cpp' || echo '$(srcdir)/'`ParserPOMDPFormat_Spirit.cpp libMADPParser_la-ParserTOIDecPOMDPDiscrete.lo: ParserTOIDecPOMDPDiscrete.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPParser_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPParser_la-ParserTOIDecPOMDPDiscrete.lo -MD -MP -MF $(DEPDIR)/libMADPParser_la-ParserTOIDecPOMDPDiscrete.Tpo -c -o libMADPParser_la-ParserTOIDecPOMDPDiscrete.lo `test -f 'ParserTOIDecPOMDPDiscrete.cpp' || echo '$(srcdir)/'`ParserTOIDecPOMDPDiscrete.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPParser_la-ParserTOIDecPOMDPDiscrete.Tpo $(DEPDIR)/libMADPParser_la-ParserTOIDecPOMDPDiscrete.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='ParserTOIDecPOMDPDiscrete.cpp' object='libMADPParser_la-ParserTOIDecPOMDPDiscrete.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPParser_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPParser_la-ParserTOIDecPOMDPDiscrete.lo `test -f 'ParserTOIDecPOMDPDiscrete.cpp' || echo '$(srcdir)/'`ParserTOIDecPOMDPDiscrete.cpp libMADPParser_la-ParserTOIDecMDPDiscrete.lo: ParserTOIDecMDPDiscrete.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPParser_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPParser_la-ParserTOIDecMDPDiscrete.lo -MD -MP -MF $(DEPDIR)/libMADPParser_la-ParserTOIDecMDPDiscrete.Tpo -c -o libMADPParser_la-ParserTOIDecMDPDiscrete.lo `test -f 'ParserTOIDecMDPDiscrete.cpp' || echo '$(srcdir)/'`ParserTOIDecMDPDiscrete.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPParser_la-ParserTOIDecMDPDiscrete.Tpo $(DEPDIR)/libMADPParser_la-ParserTOIDecMDPDiscrete.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='ParserTOIDecMDPDiscrete.cpp' object='libMADPParser_la-ParserTOIDecMDPDiscrete.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPParser_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPParser_la-ParserTOIDecMDPDiscrete.lo `test -f 'ParserTOIDecMDPDiscrete.cpp' || echo '$(srcdir)/'`ParserTOIDecMDPDiscrete.cpp libMADPParser_la-ParserTOIFactoredRewardDecPOMDPDiscrete.lo: ParserTOIFactoredRewardDecPOMDPDiscrete.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPParser_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPParser_la-ParserTOIFactoredRewardDecPOMDPDiscrete.lo -MD -MP -MF $(DEPDIR)/libMADPParser_la-ParserTOIFactoredRewardDecPOMDPDiscrete.Tpo -c -o libMADPParser_la-ParserTOIFactoredRewardDecPOMDPDiscrete.lo `test -f 'ParserTOIFactoredRewardDecPOMDPDiscrete.cpp' || echo '$(srcdir)/'`ParserTOIFactoredRewardDecPOMDPDiscrete.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPParser_la-ParserTOIFactoredRewardDecPOMDPDiscrete.Tpo $(DEPDIR)/libMADPParser_la-ParserTOIFactoredRewardDecPOMDPDiscrete.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='ParserTOIFactoredRewardDecPOMDPDiscrete.cpp' object='libMADPParser_la-ParserTOIFactoredRewardDecPOMDPDiscrete.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPParser_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPParser_la-ParserTOIFactoredRewardDecPOMDPDiscrete.lo `test -f 'ParserTOIFactoredRewardDecPOMDPDiscrete.cpp' || echo '$(srcdir)/'`ParserTOIFactoredRewardDecPOMDPDiscrete.cpp libMADPParser_la-ParserTOICompactRewardDecPOMDPDiscrete.lo: ParserTOICompactRewardDecPOMDPDiscrete.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPParser_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPParser_la-ParserTOICompactRewardDecPOMDPDiscrete.lo -MD -MP -MF $(DEPDIR)/libMADPParser_la-ParserTOICompactRewardDecPOMDPDiscrete.Tpo -c -o libMADPParser_la-ParserTOICompactRewardDecPOMDPDiscrete.lo `test -f 'ParserTOICompactRewardDecPOMDPDiscrete.cpp' || echo '$(srcdir)/'`ParserTOICompactRewardDecPOMDPDiscrete.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPParser_la-ParserTOICompactRewardDecPOMDPDiscrete.Tpo $(DEPDIR)/libMADPParser_la-ParserTOICompactRewardDecPOMDPDiscrete.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='ParserTOICompactRewardDecPOMDPDiscrete.cpp' object='libMADPParser_la-ParserTOICompactRewardDecPOMDPDiscrete.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPParser_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPParser_la-ParserTOICompactRewardDecPOMDPDiscrete.lo `test -f 'ParserTOICompactRewardDecPOMDPDiscrete.cpp' || echo '$(srcdir)/'`ParserTOICompactRewardDecPOMDPDiscrete.cpp libMADPParser_la-ParserProbModelXML.lo: ParserProbModelXML.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPParser_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPParser_la-ParserProbModelXML.lo -MD -MP -MF $(DEPDIR)/libMADPParser_la-ParserProbModelXML.Tpo -c -o libMADPParser_la-ParserProbModelXML.lo `test -f 'ParserProbModelXML.cpp' || echo '$(srcdir)/'`ParserProbModelXML.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPParser_la-ParserProbModelXML.Tpo $(DEPDIR)/libMADPParser_la-ParserProbModelXML.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='ParserProbModelXML.cpp' object='libMADPParser_la-ParserProbModelXML.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPParser_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPParser_la-ParserProbModelXML.lo `test -f 'ParserProbModelXML.cpp' || echo '$(srcdir)/'`ParserProbModelXML.cpp libMADPParser_la-ParserPOMDPDiscrete.lo: ParserPOMDPDiscrete.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPParser_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPParser_la-ParserPOMDPDiscrete.lo -MD -MP -MF $(DEPDIR)/libMADPParser_la-ParserPOMDPDiscrete.Tpo -c -o libMADPParser_la-ParserPOMDPDiscrete.lo `test -f 'ParserPOMDPDiscrete.cpp' || echo '$(srcdir)/'`ParserPOMDPDiscrete.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPParser_la-ParserPOMDPDiscrete.Tpo $(DEPDIR)/libMADPParser_la-ParserPOMDPDiscrete.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='ParserPOMDPDiscrete.cpp' object='libMADPParser_la-ParserPOMDPDiscrete.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPParser_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPParser_la-ParserPOMDPDiscrete.lo `test -f 'ParserPOMDPDiscrete.cpp' || echo '$(srcdir)/'`ParserPOMDPDiscrete.cpp libMADPParser_la-MADPParser.lo: MADPParser.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPParser_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPParser_la-MADPParser.lo -MD -MP -MF $(DEPDIR)/libMADPParser_la-MADPParser.Tpo -c -o libMADPParser_la-MADPParser.lo `test -f 'MADPParser.cpp' || echo '$(srcdir)/'`MADPParser.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPParser_la-MADPParser.Tpo $(DEPDIR)/libMADPParser_la-MADPParser.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='MADPParser.cpp' object='libMADPParser_la-MADPParser.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPParser_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPParser_la-MADPParser.lo `test -f 'MADPParser.cpp' || echo '$(srcdir)/'`MADPParser.cpp mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs install-libMADPParser_laHEADERS: $(libMADPParser_la_HEADERS) @$(NORMAL_INSTALL) @list='$(libMADPParser_la_HEADERS)'; test -n "$(libMADPParser_ladir)" || list=; \ if test -n "$$list"; then \ echo " $(MKDIR_P) '$(DESTDIR)$(libMADPParser_ladir)'"; \ $(MKDIR_P) "$(DESTDIR)$(libMADPParser_ladir)" || exit 1; \ fi; \ for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ echo "$$d$$p"; \ done | $(am__base_list) | \ while read files; do \ echo " $(INSTALL_HEADER) $$files '$(DESTDIR)$(libMADPParser_ladir)'"; \ $(INSTALL_HEADER) $$files "$(DESTDIR)$(libMADPParser_ladir)" || exit $$?; \ done uninstall-libMADPParser_laHEADERS: @$(NORMAL_UNINSTALL) @list='$(libMADPParser_la_HEADERS)'; test -n "$(libMADPParser_ladir)" || list=; \ files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \ dir='$(DESTDIR)$(libMADPParser_ladir)'; $(am__uninstall_files_from_dir) ID: $(am__tagged_files) $(am__define_uniq_tagged_files); mkid -fID $$unique tags: tags-am TAGS: tags tags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files) set x; \ here=`pwd`; \ $(am__define_uniq_tagged_files); \ shift; \ if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \ test -n "$$unique" || unique=$$empty_fix; \ if test $$# -gt 0; then \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ "$$@" $$unique; \ else \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ $$unique; \ fi; \ fi ctags: ctags-am CTAGS: ctags ctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files) $(am__define_uniq_tagged_files); \ test -z "$(CTAGS_ARGS)$$unique" \ || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \ $$unique GTAGS: here=`$(am__cd) $(top_builddir) && pwd` \ && $(am__cd) $(top_srcdir) \ && gtags -i $(GTAGS_ARGS) "$$here" cscopelist: cscopelist-am cscopelist-am: $(am__tagged_files) list='$(am__tagged_files)'; \ case "$(srcdir)" in \ [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \ *) sdir=$(subdir)/$(srcdir) ;; \ esac; \ for i in $$list; do \ if test -f "$$i"; then \ echo "$(subdir)/$$i"; \ else \ echo "$$sdir/$$i"; \ fi; \ done >> $(top_builddir)/cscope.files distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags distdir: $(DISTFILES) @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done check-am: all-am check: check-am all-am: Makefile $(LTLIBRARIES) $(HEADERS) installdirs: for dir in "$(DESTDIR)$(libdir)" "$(DESTDIR)$(libMADPParser_ladir)"; do \ test -z "$$dir" || $(MKDIR_P) "$$dir"; \ done install: install-am install-exec: install-exec-am install-data: install-data-am uninstall: uninstall-am install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-am install-strip: if test -z '$(STRIP)'; then \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ install; \ else \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \ fi mostlyclean-generic: clean-generic: distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-am clean-am: clean-generic clean-libLTLIBRARIES clean-libtool \ clean-noinstLTLIBRARIES mostlyclean-am distclean: distclean-am -rm -rf ./$(DEPDIR) -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-tags dvi: dvi-am dvi-am: html: html-am html-am: info: info-am info-am: install-data-am: install-libMADPParser_laHEADERS install-dvi: install-dvi-am install-dvi-am: install-exec-am: install-libLTLIBRARIES install-html: install-html-am install-html-am: install-info: install-info-am install-info-am: install-man: install-pdf: install-pdf-am install-pdf-am: install-ps: install-ps-am install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-am -rm -rf ./$(DEPDIR) -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-am mostlyclean-am: mostlyclean-compile mostlyclean-generic \ mostlyclean-libtool pdf: pdf-am pdf-am: ps: ps-am ps-am: uninstall-am: uninstall-libLTLIBRARIES \ uninstall-libMADPParser_laHEADERS .MAKE: install-am install-strip .PHONY: CTAGS GTAGS TAGS all all-am check check-am clean clean-generic \ clean-libLTLIBRARIES clean-libtool clean-noinstLTLIBRARIES \ cscopelist-am ctags ctags-am distclean distclean-compile \ distclean-generic distclean-libtool distclean-tags distdir dvi \ dvi-am html html-am info info-am install install-am \ install-data install-data-am install-dvi install-dvi-am \ install-exec install-exec-am install-html install-html-am \ install-info install-info-am install-libLTLIBRARIES \ install-libMADPParser_laHEADERS install-man install-pdf \ install-pdf-am install-ps install-ps-am install-strip \ installcheck installcheck-am installdirs maintainer-clean \ maintainer-clean-generic mostlyclean mostlyclean-compile \ mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \ tags tags-am uninstall uninstall-am uninstall-libLTLIBRARIES \ uninstall-libMADPParser_laHEADERS # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: madp-0.4/src/parser/PaxHeaders.5405/ParserTOICompactRewardDecPOMDPDiscrete.h0000644000000000000000000000012612717644275023411 xustar0028 mtime=1463765181.6617077 28 atime=1463765181.6617077 30 ctime=1463765201.785546974 madp-0.4/src/parser/ParserTOICompactRewardDecPOMDPDiscrete.h0000664000372100037210000000313412717644275024243 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _PARSERTOICOMPACTREWARDDECPOMDPDISCRETE_H_ #define _PARSERTOICOMPACTREWARDDECPOMDPDISCRETE_H_ 1 /* the include directives */ #include #include "Globals.h" #include "TOICompactRewardDecPOMDPDiscrete.h" #include "ParserTOIDecPOMDPDiscrete.h" #include "DecPOMDPDiscrete.h" /**\brief ParserTOICompactRewardDecPOMDPDiscrete is a parser for * TOICompactRewardDecPOMDPDiscrete. */ class ParserTOICompactRewardDecPOMDPDiscrete : public ParserTOIDecPOMDPDiscrete { private: TOICompactRewardDecPOMDPDiscrete *_m_problem; void StoreDecPOMDP(DecPOMDPDiscrete *decpomdp, Index id); using ParserTOIDecPOMDPDiscrete::ParseRewards; void ParseRewards(); protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor ParserTOICompactRewardDecPOMDPDiscrete( TOICompactRewardDecPOMDPDiscrete *problem); }; #endif /* !_PARSERTOICOMPACTREWARDDECPOMDPDISCRETE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/parser/PaxHeaders.5405/ParserPOMDPFormat_Spirit.h0000644000000000000000000000013212717644275020762 xustar0030 mtime=1463765181.717707253 30 atime=1463765181.697707412 30 ctime=1463765201.785546974 madp-0.4/src/parser/ParserPOMDPFormat_Spirit.h0000664000372100037210000012565112717644275021630 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _PARSERPOMDPFORMAT_H_ #define _PARSERPOMDPFORMAT_H_ 1 /* the include directives */ #include #include #include "Globals.h" #include "POMDPDiscrete.h" #include "EParse.h" #include #if USE_BOOST_SPIRIT_CLASSIC #include #include #else #include #include #include #endif #include "ParserInterface.h" using namespace boost::spirit; /* constants */ //use subgrammars (or not?) #define SUBGRAMMAR 0 //General parsing debug informations #define DEBUG_POMDP_PARSE 0 //whether or not newlines are skipped when parsing: //FAO: keep 1 - if set to 0 the code will not work #define POMDPFORMAT_NEWLINES_SKIPPED 1 //debugging the 'comment' parser: /*#define DEBUG_COMPARS 1*/ //debugging the 'comment or blank parser' : /*#define DEBUG_COBP 1*/ // the 'any' individual action to denote the wildcard '*' #define ANY_INDEX -1 #include "CommentBlankOrNewlineParser.h" namespace POMDPFormatParsing{ /**Outputs the file_position structure info (gotten from * postion_iterator::get_position() ). */ std::ostream& operator<<(std::ostream& out, file_position const& lc); /** \brief ParserPOMDPFormat_Spirit is a parser for the .pomdp file format. * * \todo: TODO: currently massive amount of code duplication from .dpomdp format * parsing. At some point we may want to resolve, but first let's get it to * work. * **/ class ParserPOMDPFormat_Spirit : public ParserInterface { typedef char char_t; typedef file_iterator iterator_t_fi; typedef position_iterator iterator_t; typedef scanner scanner_t; typedef rule rule_t; //used to now what has been parsed: enum parsed_t { INT, DOUBLE, UINT, STRING, ASTERICK, UNIFORM, IDENTITY }; private: // TODO POMDPDiscrete* _m_decPOMDPDiscrete; POMDPDiscrete* GetPOMDPDiscrete() { return _m_decPOMDPDiscrete; } struct Initialize { ParserPOMDPFormat_Spirit* _m_po; Initialize (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { _m_po->_m_first = &str; } }; struct DebugOutputNoParsed { std::string s; DebugOutputNoParsed (std::string s2){s = s2;} void operator()(iterator_t str, iterator_t end) const; void operator()(const unsigned int&) const; void operator()(const double &) const; }; struct DebugOutput { std::string s; DebugOutput (std::string s2){s = s2;} void operator()(iterator_t str, iterator_t end) const; void operator()(const int&) const; void operator()(const unsigned int&) const; void operator()(const double&) const; }; struct StoreLastParsedElement { ParserPOMDPFormat_Spirit* _m_po; StoreLastParsedElement(ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(const int i) const; void operator()(const unsigned int i) const; void operator()(const double f) const; void operator()(iterator_t str, iterator_t end) const; }; struct SetLastParsedType { ParserPOMDPFormat_Spirit* _m_po; parsed_t _m_lastParsedType; SetLastParsedType (ParserPOMDPFormat_Spirit* po, parsed_t lpt) { _m_po = po; _m_lastParsedType = lpt; } void operator()(iterator_t str, iterator_t end) const { _m_po->_m_lp_type = _m_lastParsedType; } }; struct NYI//Not Yet Implemented { std::string msg; NYI(std::string s){msg = s;} void operator()(iterator_t str, iterator_t end) const { file_position fp = str.get_position(); std::stringstream ermsg; ermsg << "sorry, \""<< msg <<"\" is not yet implemented." << std::endl << "(at " << fp << ")"<_m_curAI = 0; } }; struct SetNextAgentIndex { ParserPOMDPFormat_Spirit* _m_po; SetNextAgentIndex (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { std::cerr << "Warning ParserPOMDPFormat_Spirit::SetNextAgentIndex called ?!? ignoring" << std::endl; return; /* if(_m_po->_m_curAI < _m_po->_m_nrA) _m_po->_m_curAI++; else std::cout << "SetNextAgentIndex - ERROR: current agent index ("<<_m_po->_m_curAI<<") out of bounds (number of agents="<<_m_po->_m_nrA<<")"<_m_curMatrix.push_back( std::vector() ); } }; struct NextFloatOfRow { ParserPOMDPFormat_Spirit* _m_po; NextFloatOfRow (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { if(_m_po->_m_lp_type != DOUBLE) { std::cout <<"NextFloatOfRow - ERROR parsing probabilities, which" <<" means that doubles are expected, however last found" <<" type is #"<<_m_po->_m_lp_type<_m_curMatrix.size(); std::cout <<" _m_po->_m_curMatrix.size()= " << s <0) std::cout <<" _m_po->_m_curMatrix.back().size()= " << _m_po->_m_curMatrix.back().size()<_m_curMatrix.size(); if(s > 0) { double d = _m_po->_m_lp_double; //_m_curMatrix.back() isa vector _m_po->_m_curMatrix.back().push_back(d); _m_po->_m_matrixModified = true; } else std::cout << "NextFloatOfRow - ERROR _m_curMatrix contains no "<< "elements (i.e. there are no rows to add to...)."; if(DEBUG_POMDP_PARSE){//DEBUG size_t s =_m_po->_m_curMatrix.size(); std::cout <<" _m_po->_m_curMatrix.size()= " << s <0) std::cout <<" _m_po->_m_curMatrix.back().size()= " << _m_po->_m_curMatrix.back().size()<_m_curIdentList.push_back(std::string(str,end)); _m_po->_m_identListModified = true; } }; struct SetNrStates { ParserPOMDPFormat_Spirit* _m_po; size_t _m_target; bool _m_haveTarget; SetNrStates (ParserPOMDPFormat_Spirit* po){ _m_po = po; _m_target = 0; _m_haveTarget = false; } SetNrStates (ParserPOMDPFormat_Spirit* po, size_t i){ _m_po = po; _m_target = i; _m_haveTarget = true; } void operator()(const size_t& i) const { if(_m_haveTarget) _m_po->GetPOMDPDiscrete()->SetNrStates(_m_target); else _m_po->GetPOMDPDiscrete()->SetNrStates( i ); } void operator()(iterator_t str, iterator_t end) const { if(_m_haveTarget) _m_po->GetPOMDPDiscrete()->SetNrStates(_m_target); else if(_m_po->_m_lp_type == UINT)// || _m_lp_type _m_po->GetPOMDPDiscrete()->SetNrStates(_m_po->_m_lp_uint); else throw E("SetNrStates: no target value set and last parsed data type != UINT..."); } }; //this processes the start state specification in case of a specified //probability vector and in case of the keyword uniform. struct StartStateRowProbs { ParserPOMDPFormat_Spirit* _m_po; StartStateRowProbs (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { if(_m_po->_m_lp_type == UNIFORM) { _m_po->GetPOMDPDiscrete()->SetUniformISD(); return; } //check size - it should be a row matrix... if( !_m_po->IsRowMatrixLP() ) throw E("StartStateRowProbs: _m_po->_m_curMatrix should be a row vector!"); if(_m_po->_m_curMatrix[0].size() != _m_po->GetPOMDPDiscrete()-> GetNrStates()) { std::string err = "StartStateRowProbs: _m_po->_m_curMatrix"; err += " [0] should contain NrStates(="; std::stringstream ss; ss << "StartStateRowProbs: _m_po->_m_curMatrix[0] " << "should contain NrStates(=" << _m_po->GetPOMDPDiscrete()-> GetNrStates() << ") entries! (not "<< _m_po->_m_curMatrix[0].size()<<")\n"; throw E( ss.str().c_str() ); } StateDistributionVector *isd=new StateDistributionVector(_m_po->_m_curMatrix[0]); _m_po->GetPOMDPDiscrete()->SetISD(isd); } }; //this adds states to the start state list - the first stage in //processing the other ways of specifying the start state distribution. struct AddStartState { ParserPOMDPFormat_Spirit* _m_po; AddStartState (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { if(_m_po->_m_lp_type != STRING) { std::stringstream ss; ss << "SetStartState::operator()(iterator_t str, iterator_t end) - expected a string as last parsed type! (at"<GetPOMDPDiscrete()->GetStateIndexByName( _m_po->_m_lp_string); _m_po->_m_startStateListSI.push_back(sI); } catch(E e) { std::stringstream ss; ss << e.SoftPrint() << "(at"<< str.get_position() <<")"<_m_lp_type != UINT) { std::stringstream ss; ss << "SetStartState::operator()(const unsigned int i&) - expected a UINT as last parsed type! (at"<< _m_po->_m_first->get_position() <<")"<_m_startStateListSI.push_back( _m_po->_m_lp_uint); } }; //this functor specified that the states in the start state list should //be excluded, not included. struct StartStateExludes { ParserPOMDPFormat_Spirit* _m_po; StartStateExludes (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { _m_po->_m_startStateListExclude = true; } }; struct ProcessStartStateList { ParserPOMDPFormat_Spirit* _m_po; ProcessStartStateList (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(const unsigned int& i) const { ProcessList(); } void operator()(iterator_t str, iterator_t end) const { ProcessList(); } void ProcessList() const { size_t nrS = _m_po->GetPOMDPDiscrete()->GetNrStates(); size_t listSize = _m_po->_m_startStateListSI.size(); size_t nrIncS = (_m_po->_m_startStateListExclude)? nrS - listSize: listSize; double u_prob = 1.0 / nrIncS; std::vector init_probs; if(!_m_po->_m_startStateListExclude) //elems in list get uniform prob. init_probs = std::vector(nrS, 0.0); else //other elems get uniform prob init_probs = std::vector(nrS, u_prob); std::vector::iterator it = _m_po->_m_startStateListSI.begin(); std::vector::iterator last = _m_po->_m_startStateListSI.end(); while(it != last) { init_probs[*it] = _m_po->_m_startStateListExclude? 0.0 : u_prob; it++; } StateDistributionVector *isd=new StateDistributionVector(init_probs); _m_po->GetPOMDPDiscrete()->SetISD(isd); init_probs.clear(); _m_po->_m_startStateListSI.clear(); } }; struct SetNrActions { ParserPOMDPFormat_Spirit* _m_po; SetNrActions (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { if(DEBUG_POMDP_PARSE) { std::string s(str,end); std::cout << "SetNrActions: setting "<<_m_po->_m_lp_uint<<" actions for agent "<<_m_po->_m_curAI<GetPOMDPDiscrete()->SetNrSingleAgentActions(_m_po->_m_lp_uint); } void operator()(const unsigned int&) const { _m_po->GetPOMDPDiscrete()->SetNrSingleAgentActions(_m_po->_m_lp_uint); if(DEBUG_POMDP_PARSE) std::cout << "SetNrActions: set "<<_m_po->_m_lp_uint<<" actions for agent "<<_m_po->_m_curAI<GetPOMDPDiscrete()->AddSingleAgentAction(s); if(DEBUG_POMDP_PARSE) std::cout << "AddAction: added action "<_m_curAI<GetPOMDPDiscrete()->SetNrSingleAgentObservations(_m_po->_m_lp_uint); if(DEBUG_POMDP_PARSE) std::cout << "SetNrObservations: set "<<_m_po->_m_lp_uint<<" observations for agent "<<_m_po->_m_curAI<GetPOMDPDiscrete()->SetNrSingleAgentObservations(_m_po->_m_lp_uint); if(DEBUG_POMDP_PARSE) std::cout << "SetNrObservations: set "<<_m_po->_m_lp_uint<<" observations for agent "<<_m_po->_m_curAI<GetPOMDPDiscrete()->AddSingleAgentObservation(s); if(DEBUG_POMDP_PARSE) std::cout << "AddObservation: added action "<_m_curAI<_m_anyStateIndex = _m_po->GetPOMDPDiscrete()->GetNrStates(); _m_po->GetPOMDPDiscrete()->SetStatesInitialized(true); } }; struct InitializeActions { ParserPOMDPFormat_Spirit* _m_po; InitializeActions (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { _m_po->GetPOMDPDiscrete()->ConstructJointActions(); _m_po->GetPOMDPDiscrete()->SetActionsInitialized(true); _m_po->_m_anyJAIndex = _m_po->GetPOMDPDiscrete()-> GetNrJointActions(); } }; struct InitializeObservations { ParserPOMDPFormat_Spirit* _m_po; InitializeObservations (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { _m_po->GetPOMDPDiscrete()->ConstructJointObservations(); _m_po->GetPOMDPDiscrete()->SetObservationsInitialized(true); _m_po->_m_anyJOIndex = _m_po->GetPOMDPDiscrete()-> GetNrJointObservations(); } }; struct AddModels { ParserPOMDPFormat_Spirit* _m_po; AddModels (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { POMDPDiscrete* p = _m_po->GetPOMDPDiscrete(); // add the transition model p->CreateNewTransitionModel(); p->CreateNewObservationModel(); p->CreateNewRewardModel(); //if(DEBUG_POMDP_PARSE) _m_po->GetPOMDPDiscrete()->PrintInfo(); } }; ///Stores the last-parsed action: struct StoreLPAction { ParserPOMDPFormat_Spirit* _m_po; StoreLPAction (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { if(DEBUG_POMDP_PARSE) std::cout << "StoreLPAction: pushing "<_m_lp_type == UINT) { unsigned int index = _m_po->_m_lp_uint; if(index >= _m_po->GetPOMDPDiscrete()->GetNrJointActions() ) { std::stringstream ss; ss<<"StoreLPAction: '"<< index<< "' is not valid!? Number of actions is " << _m_po->GetPOMDPDiscrete()->GetNrJointActions() <<" (at " <_m_lp_JA.push_back(_m_po->_m_lp_uint); } else if(_m_po->_m_lp_type == STRING) { //make sure that _m_lp_JA is cleared after each joint action //so we can do this: Index curAgIndex = _m_po->_m_lp_JA.size(); try { Index aI = _m_po->GetPOMDPDiscrete()->GetActionIndexByName( _m_po->_m_lp_string, curAgIndex); _m_po->_m_lp_JA.push_back(aI); } catch(E e) { std::stringstream ermsg; ermsg << e.SoftPrint() << " (at " << str.get_position() << ")"<_m_lp_type == ASTERICK ) _m_po->_m_lp_JA.push_back(_m_po->_m_anyJAIndex); else throw E("StoreLPAction expected that the last parsed type is a action index(uint), action name (string) or wilcard ('*')."); } }; /**called before StoreLPJointAction in case of a wildcard '*' joint * action. Effectively, this functions sets _m_lp_JA to a vector of * _m_po->_m_anyJAIndexs (one for each agent) .*/ struct WildCardJointAction { ParserPOMDPFormat_Spirit* _m_po; WildCardJointAction (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct StoreLPJointAction { ParserPOMDPFormat_Spirit* _m_po; bool _m_isJointActionIndex; StoreLPJointAction (ParserPOMDPFormat_Spirit* po, bool b = false) { _m_po = po; _m_isJointActionIndex = b; } void operator()(iterator_t str, iterator_t end) const{Store();} void operator()(const unsigned int&) const{Store();} void Store() const; /**This function constructs the vector (_m_lp_JAI) of joint actions * that match with the vector with individual action indices. * * This is needed to properly deal with wild cards; a single action specification * in the (d)pomdp file may correspond to manu (joint) actions. * * */ void MatchingJointActions (Index curAgent, std::vector indIndices) const; }; struct StoreLPObservation { ParserPOMDPFormat_Spirit* _m_po; StoreLPObservation (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { if(DEBUG_POMDP_PARSE) std::cout << "StoreLPObservation: pushing "<_m_lp_type == UINT) _m_po->_m_lp_JO.push_back(_m_po->_m_lp_uint); else if(_m_po->_m_lp_type == STRING) { //make sure that _m_lp_JO is cleared after each joint action //so we can do this: Index curAgIndex = _m_po->_m_lp_JO.size(); try { Index aI = _m_po->GetPOMDPDiscrete()->GetObservationIndexByName( _m_po->_m_lp_string, curAgIndex); _m_po->_m_lp_JO.push_back(aI); } catch(E e) { std::stringstream ermsg; ermsg << e.SoftPrint() << " (at " << str.get_position() << ")"<_m_lp_type == ASTERICK ) _m_po->_m_lp_JO.push_back(_m_po->_m_anyJOIndex); else throw E("StoreLPObservation expected that the last parsed type is a action index(uint), action name (string) or wilcard ('*')."); } }; /**called before StoreLPJointObservation in case of a wildcard '*' joint * action. Effectively, this functions sets _m_lp_JO to a vector of * ANY_INDEXs (=_m_anyJOIndex) (one for each agent) .*/ struct WildCardJointObservation { ParserPOMDPFormat_Spirit* _m_po; WildCardJointObservation (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct StoreLPJointObservation { ParserPOMDPFormat_Spirit* _m_po; bool _m_isJointObservationIndex; StoreLPJointObservation (ParserPOMDPFormat_Spirit* po, bool b = false) { _m_po = po; _m_isJointObservationIndex = b; } void operator()(iterator_t str, iterator_t end) const{Store();} void operator()(const unsigned int&) const{Store();} void Store() const; /**This function constructs the vector (_m_lp_JOI) of joint actions * that match with the vector with individual action indices.*/ void MatchingJointObservations(Index curAgent, std::vector indIndices) const; }; struct StoreLPFromState { ParserPOMDPFormat_Spirit* _m_po; StoreLPFromState (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct StoreLPToState { ParserPOMDPFormat_Spirit* _m_po; StoreLPToState (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct ProcessTProb { ParserPOMDPFormat_Spirit* _m_po; ProcessTProb (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct ProcessTRow { ParserPOMDPFormat_Spirit* _m_po; ProcessTRow (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct ProcessTMatrix { ParserPOMDPFormat_Spirit* _m_po; ProcessTMatrix (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct ProcessOProb { ParserPOMDPFormat_Spirit* _m_po; ProcessOProb (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct ProcessORow { ParserPOMDPFormat_Spirit* _m_po; ProcessORow (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct ProcessOMatrix { ParserPOMDPFormat_Spirit* _m_po; ProcessOMatrix (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct ProcessR { ParserPOMDPFormat_Spirit* _m_po; ProcessR (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct ProcessRRow { ParserPOMDPFormat_Spirit* _m_po; ProcessRRow (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct ProcessRMatrix { ParserPOMDPFormat_Spirit* _m_po; ProcessRMatrix (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const; }; struct InitializePOMDP { ParserPOMDPFormat_Spirit* _m_po; InitializePOMDP (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { _m_po->GetPOMDPDiscrete()->SetInitialized(true); } }; struct SetNrAgents { ParserPOMDPFormat_Spirit* _m_po; SetNrAgents(ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t first, iterator_t last) const; void operator()(const int&) const; }; /* struct AddAgents { ParserPOMDPFormat_Spirit* _m_po; AddAgents(ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t first, iterator_t last) const { _m_po->GetPOMDPDiscrete()->SetNrAgents(0); std::vector::iterator it = _m_po->_m_curIdentList.begin(); std::vector::iterator l = _m_po->_m_curIdentList.end(); while(it != l) { _m_po->GetPOMDPDiscrete()->AddAgent(*it); it++; _m_po->_m_nrA++; } _m_po->ClearCurIdentList(); } }; */ //discount param static void dp_number(iterator_t str, iterator_t end); struct dp_SetDiscountParam{ ParserPOMDPFormat_Spirit* _m_po; dp_SetDiscountParam(ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t first, iterator_t last) const { std::string s(first, last); if(DEBUG_POMDP_PARSE){std::cout << "dp_SetDiscountParam::operator():discount="<< s << std::endl;} double discount = -1.0; if( _m_po->_m_lp_type == DOUBLE ) { if(DEBUG_POMDP_PARSE){std::cout <<"last parsed number was a DOUBLE"<< "(_m_po->_m_lp_double = "<<_m_po->_m_lp_double<<")\n";} discount = _m_po->_m_lp_double; } else if (_m_po->_m_lp_type == INT) { if(DEBUG_POMDP_PARSE){std::cout <<"last parsed number was a INT"<< "(_m_po->_m_lp_int = "<<_m_po->_m_lp_int<<")\n";} //the discount was parsed as an int discount = (double) _m_po->_m_lp_int; } else if (_m_po->_m_lp_type == UINT) { if(DEBUG_POMDP_PARSE){std::cout <<"last parsed number was a UINT"<< "(_m_po->_m_lp_uint = "<<_m_po->_m_lp_uint<<")\n";} //the discount was parsed as an int discount = (double) _m_po->_m_lp_uint; } else { std::cerr << "WARNING, discount not parsed correctly?!?, _m_po->_m_lp_type : " << _m_po->_m_lp_type << std::endl; } if(DEBUG_POMDP_PARSE){std::cout <<"dp_SetDiscountParam - discount=" << discount << std::endl;} _m_po->GetPOMDPDiscrete()->SetDiscount(discount); } }; //value param static void vp_value_tail(iterator_t str, iterator_t end); struct vt_REWARDTOK { ParserPOMDPFormat_Spirit* _m_po; vt_REWARDTOK (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { _m_po->GetPOMDPDiscrete()->SetRewardType(REWARD); } }; struct vt_COSTTOK { ParserPOMDPFormat_Spirit* _m_po; vt_COSTTOK (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { _m_po->GetPOMDPDiscrete()->SetRewardType(COST); } }; //This is the functor which is called from the grammar (i.e. //dpomdp.spirit) to add the parsed state (names) to the problem. struct AddState { ParserPOMDPFormat_Spirit* _m_po; AddState(ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t first, iterator_t last) const { if(DEBUG_POMDP_PARSE){std::cout << "AddState - adding state \""<< _m_po->_m_lp_string<<"\"\n";} _m_po->GetPOMDPDiscrete()->AddState(_m_po->_m_lp_string); } }; struct POMDPFileParser : public grammar { ParserPOMDPFormat_Spirit* _m_parserObject; POMDPDiscrete* _m_problem; POMDPFileParser(ParserPOMDPFormat_Spirit* parserObject) { _m_parserObject = parserObject; _m_problem = _m_parserObject->GetPOMDPDiscrete(); } template struct definition { #if SUBGRAMMAR #include "sub_grammar_defs.h" agentstok_parser AGENTSTOK; discounttok_parser DISCOUNTTOK; valuestok_parser VALUESTOK; statestok_parser STATESTOK; actionstok_parser ACTIONSTOK; observationstok_parser OBSERVATIONSTOK; ttok_parser TTOK; otok_parser OTOK; rtok_parser RTOK; //the parsers that need a reference: uniformtok_parser UNIFORMTOK; inttok_parser INTTOK; #endif definition(POMDPFileParser const& self) #if SUBGRAMMAR : INTTOK(self._m_parserObject), UNIFORMTOK(self._m_parserObject) #endif { #include "pomdp.spirit" } #if SUBGRAMMAR == 0 rule AGENTSTOK, DISCOUNTTOK,VALUESTOK,STATESTOK,ACTIONSTOK,OBSERVATIONSTOK,TTOK,OTOK,RTOK,UNIFORMTOK, INTTOK; #endif rule EOLTOK, IDENTITYTOK, REWARDTOK, COSTTOK, STARTTOK, INCLUDETOK, EXCLUDETOK, RESETTOK, COLONTOK, ASTERICKTOK, PLUSTOK, MINUSTOK, FLOATTOK, STRINGTOK, pomdp_file, preamble, preamble_unordered, preamble_item, agents_param, discount_param, value_param, value_tail, state_param, state_tail, action_param, action_tail, obs_param, obs_tail, start_state, start_state_list, param_list, param_spec, trans_prob_spec, trans_spec_tail, obs_prob_spec, obs_spec_tail, reward_spec, reward_spec_tail, ui_matrix, u_matrix, u_row, prob, action_param_line, obs_param_line, joint_obs, obs, joint_action, paction, state_or_indiv_act_or_obs, agents_tail, prob_row_vector, num_row_vector, reserved_word, state_list, float_r, int_r, action_list, obs_list, floats_matrix, floats_row_vector, pomdp, from_state, to_state ; rule const& start() const { return pomdp_file; } }; }; protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor ParserPOMDPFormat_Spirit(POMDPDiscrete* problem=0); // Copy constructor. //ParserPOMDPFormat_Spirit(const ParserPOMDPFormat_Spirit& a); // Destructor. //~ParserPOMDPFormat_Spirit(); //operators: //data manipulation (set) functions: /**The function that starts the parsing.*/ void Parse(); //get (data) functions: ///The last parsed ... unsigned int _m_lp_uint; int _m_lp_int; double _m_lp_double; std::string _m_lp_string; ///The type (INT or DOUBLE) of the last parsed number. parsed_t _m_lp_type; ///Whether the last 'number' used an optional sign ('+' or '-') bool _m_lp_number_used_opt_sign; ///Whether the last optional sign was a '-' bool _m_lp_number_negated; //the number of agents - used often therefore also stored here size_t _m_nrA; //the current agent index. Index _m_curAI; //The following are special indices denoting any state, (joint) action //or (joint) observation Index _m_anyJAIndex; Index _m_anyJOIndex; Index _m_anyStateIndex; std::vector< std::vector > _m_curMatrix; bool _m_matrixModified; struct ResetCurMatrix //TODO: move to proper place { ParserPOMDPFormat_Spirit* _m_po; ResetCurMatrix (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { if(DEBUG_POMDP_PARSE) std::cout << "ResetCurMatrix() called... "; if(_m_po->_m_matrixModified) { if(DEBUG_POMDP_PARSE) std::cout << "resetting current matrix..." ; _m_po->ClearCurMatrix(); } if(DEBUG_POMDP_PARSE) std::cout << std::endl; } }; void ClearCurMatrix()//TODO:move to proper place... { _m_curMatrix.clear();//no pointers stored, so this should not leak _m_curMatrix.push_back( std::vector() ); _m_matrixModified = false; } std::string PrintDimensionOfMatrix() { std::stringstream ss; ss << _m_curMatrix.size() << "rows, of size: "; for(Index r=0; r<_m_curMatrix.size(); r++) ss << _m_curMatrix[r].size() << ", "; return(ss.str()); } bool IsDimensionOfMatrix(size_t rows, size_t cols) { if(_m_curMatrix.size() != rows + 1) return false; for(Index r=0; r _m_curIdentList; bool _m_identListModified; struct ResetCurIdentList //TODO: move to proper place { ParserPOMDPFormat_Spirit* _m_po; ResetCurIdentList (ParserPOMDPFormat_Spirit* po){_m_po = po;} void operator()(iterator_t str, iterator_t end) const { //TODO:check whether the previous matrix was consistent if(_m_po->_m_identListModified) _m_po->ClearCurIdentList(); } }; void ClearCurIdentList()//TODO:move to proper place... { _m_curIdentList.clear();//no pointers stored, should not leak _m_identListModified = false; } /**A vector in which the currently parsed individual action indices * of a joint action are stored. (by StoreLPAction). * wild-cards (asterik) are stored as _m_anyJAIndex . */ std::vector _m_lp_JA; /**similar for the observations...*/ std::vector _m_lp_JO; /**A vector that stores the indices of joint actions that match the * last parsed joint action. (if the last parsed joint action didn't * contain any wildcards, the size of this vector is 1.) * This vector is constructed by StoreLPJointAction by transforming * the above vector (_m_lp_JA).*/ std::vector _m_lp_JAI; /**similar for the joint observations...*/ std::vector _m_lp_JOI; /**A vector that stores the last parsed from-state index. * Contrary to _m_lp_JAI above, this vector contains only 1 element,\ * which can be the ANY_INDEX (_m_anyStateIndex) . This is more * convenient, as it allows * easier selection of the proper AddReward and AddObservation * functions.*/ std::vector _m_lp_fromSI; /**idem, but for to-state.*/ std::vector _m_lp_toSI; /**A vector used to store the state indices for the start state * specification.*/ std::vector _m_startStateListSI; /**A boolean indicating whether the states in the start state list * should be excluded (versus the default: uniform prob. over the * specified states). */ bool _m_startStateListExclude; /**Pointer to the first iterator. This is used to give informative error messages. * (Specifically the position of the error.*/ iterator_t* _m_first; #if 0 private: protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor ParserPOMDPFormat_Spirit(); /// Copy constructor. ParserPOMDPFormat_Spirit(const ParserPOMDPFormat_Spirit& a); /// Destructor. ~ParserPOMDPFormat_Spirit(); /// Copy assignment operator ParserPOMDPFormat_Spirit& operator= (const ParserPOMDPFormat_Spirit& o); //operators: //data manipulation (set) functions: //get (data) functions: #endif }; }// end namespace POMDPFormatParsing #endif /* !_PARSERPOMDPFORMAT_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/parser/PaxHeaders.5405/ParserProbModelXML.h0000644000000000000000000000013212717644275017644 xustar0030 mtime=1463765181.665707667 30 atime=1463765181.665707667 30 ctime=1463765201.789546942 madp-0.4/src/parser/ParserProbModelXML.h0000664000372100037210000002541112717644275020503 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Joao Messias * Frans Oliehoek * * For contact information please see the included AUTHORS file. */ #ifndef _PARSERPROBMODELXML_H_ #define _PARSERPROBMODELXML_H_ 1 /* the include directives */ #include #include #include "Globals.h" #include "FactoredDecPOMDPDiscrete.h" #include "EParse.h" #include #include "ParserInterface.h" #include "StringTools.h" #include "IndexTools.h" #include "RewardModelMapping.h" #include "StateFactorDiscrete.h" #include "FSDist_COF.h" #include #include #include "boost/bind.hpp" #include #ifdef HAVE_LIBXML2 #include #include #include #endif //General parsing debug informations #ifndef DEBUG_PARSE #define DEBUG_PARSE 0 #endif /** ParserProbModelXML is a parser for factored Dec-POMDP models written in ProbModelXML.*/ class ParserProbModelXML : public ParserInterface { public: enum elm_type {STATE, ACTION, OBSERVATION, REWARD}; // Constructor, destructor and copy assignment. /// (default) Constructor ParserProbModelXML(FactoredDecPOMDPDiscrete *problem=0); // Destructor. //~ParserProbModelXML(); /**The function that starts the parsing.*/ void Parse(); #ifdef HAVE_LIBXML2 /** These methods are public since they need to be called by the * functions that will be passed onto the FactoredDecPOMDP.*/ /**Given an xpath expression, this function simply returns a * pointer to respective set of results, or a null pointer if the * xpath is invalid (the caller must explicitly handle that case).*/ const xmlXPathObjectPtr GetNodesMatchingExpression(const xmlChar *expr, const xmlNodePtr context_node = 0); /**This function simply extracts the "name" attribute from an element node.*/ std::string GetVariableName(const xmlNodePtr node) const; /**This function extracts the "timeslice" attribute from an element node.*/ int GetVariableTimeslice(const xmlNodePtr node) const; /**Given the name of an element node, this function recovers its type * (an elm_type defined above) and the respective index of its factor. * This is necessary since elements in ProbModelXML are always indexed * by their name. * This function assumes that all states, actions and observations have * been initialized.*/ const std::pair GetParsedElement(const std::string name) const; /**This does the opposite of GetParsedElement: given the element type and * index, it returns the name of that variable.*/ std::string GetParsedElementName(const std::pair elm) const; /**This function simply reads a string of numbers in a node into a vector of doubles.*/ const std::vector* ParseArray(const xmlNodePtr node); /**The GetPotential function returns the potential (i.e. probability or reward) * associated with a given named variable, given the values of its parents. * These dependencies are passed as maps of the following form: * > * Dependencies must be explicitly organized into timeslices, and rewards * must also be signaled externally, since their specification is a bit different * (although much of the parsing is the same).*/ double GetPotential(const std::string var_name, const std::map > t0_deps, const std::map > t1_deps, const bool isUtility = false); /**In MADP it is assumed that each agent has * its own observation factor. In an asynchronous model there is * only one observation factor, but actions can still be factored; * then, the ParserProbModelXML is forced to produce fully-centralized model * with only one agent/action factor, even if there are multiple agents * in the DBN. Action Scopes/Names are maintained locally, in this case (see below).*/ /**From a joint action index and a state factor index, extract the factored action values and respective agent scope.*/ void ConvertToLocalSFActionScope(Index sfI, Index aI, std::vector& AValues, Scope& AScope); /**From a joint action index and an observation factor index, extract the factored action values and respective agent scope.*/ void ConvertToLocalObsActionScope(Index oI, Index aI, std::vector& AValues, Scope& AScope); /**Public interfaces to add actions to state factor, observations, lrf scopes*/ void AddToLocalSFActionScope(Index sfI, Scope AScope); void AddToLocalObsActionScope(Index oI, Scope AScope); void AddToLocalLRFActionScope(Index lrfI, Scope AScope); bool IsAsynchronous() {return _m_asynchronousModel;} /**Note that the resulting FactoredDecPOMDP, if it is asynchronous, is only factored in its state space. * Therefore, only the parser knows the actual number of actions for each agent*/ size_t GetLocalNrActions(Index aI) {return _m_ASizes.at(aI);} #endif private: #ifdef HAVE_LIBXML2 /**Parses all the "chance" elements at the first timeslice as state factors*/ void ReadStates(); /**Parses the agent team size and respective names*/ void ReadAgents(); /**Parses all the "decision" elements as actions and assigns them to agents*/ void ReadActions(); /**Reads all "chance" elements which link to actions at the second timeslice * as observations (this is how observations are specified in OpenMarkov).*/ void ReadObservations(); /**Fetches the potentials of all state factor nodes at the first timeslice and * loads them into the model ISD.*/ void SetISD(); /**This function finds out how many factors there are for the reward function, * and initializes their scopes.*/ void InitializeLRFs(); /**After the scopes of the LRFs have been found, this function reads all "utility" * potentials into the reward model.*/ void ReadLRFs(); /**Reads optional ProbNet properties set by the user.*/ void ReadProperties(); /**This opens the problem file of the FactoredDecPOMDP with libxml2, * ready to be queried with xpath.*/ void InitializeXPath(); /**Given an absolute xpath to a variable, this tries to match its children with the relative * xpath in 'expr'. This is necessary since libxml2 doesn't handle relative xpaths on its own.*/ const xmlXPathObjectPtr GetChildrenMatchingExpression(const std::string var_path, const xmlChar *expr) const; /**This just loads any comments in a variable as plain text.*/ std::string GetVariableComment(const xmlNodePtr); /**Given a pointer to a table element, and the parent factor names, values, and sizes, this * gets the respective probability or reward.*/ double QueryTable(const xmlNodePtr node, const std::map > t0_deps, const std::map > t1_deps); /**Given a pointer to a 'Tree/ADD' element, and the parent factor names, values, and sizes, this * gets the respective probability or reward. * QueryADD can be recursive (if nodes are themselves ADDs), so we keep track of the root node. */ double QueryADD(const xmlNodePtr root_node, const xmlNodePtr current_node, const std::map > t0_deps, const std::map > t1_deps); xmlNodePtr FindChild(const xmlNodePtr node, const std::string child) const; /**xpath utility function. Gets the context.*/ const xmlXPathContextPtr GetContext() const {return _m_context;} /**libxml2 utility function. Gets the document pointer.*/ const xmlDocPtr GetDoc() const {return _m_doc;} /**xpath utility function. Sets the query context to a given node.*/ void SetContext(const xmlNodePtr context_node) {((xmlXPathContext *) _m_context)->node = context_node;} /**xpath utility function. Resets the query context to the doc root node.*/ void ResetContext() {((xmlXPathContext *) _m_context)->node = xmlDocGetRootElement(_m_doc);} /**libxml2 utility function. Sets the document pointer.*/ void SetDoc(const xmlDocPtr doc){_m_doc = doc;} /**Context pointer needed for xpath queries.*/ xmlXPathContextPtr _m_context; /**Libxml2 parsed document object*/ xmlDocPtr _m_doc; /**Storage for parsed elements, so that they can be accessed by their name * when reading links and probabilities. * From here we can figure out the respective factor in the model.*/ std::map > _m_parsedElements; std::map* > _m_arrayCache; #endif /**Whether or not agents have been found and initialized. * If no agent names are present in the file, the parser infers * the team size by the number of action nodes and addresses * everyone by their indexes.*/ bool _m_agentsInitialized; FactoredDecPOMDPDiscrete* _m_fDecPOMDP; /**The following variables are used for asynchronous models with * factored actions.*/ bool _m_asynchronousModel; ///whether or not this is an asynchronous model /**Locally maintained action scopes for state factors, observations and lrfs.*/ std::vector _m_AScopes_Y; std::vector _m_AScopes_O; std::vector _m_AScopes_LRF; /**Locally maintained action names*/ std::vector > _m_ANames; /**Locally maintained action sizes*/ std::vector _m_ASizes; }; #endif // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/parser/PaxHeaders.5405/ParserPOMDPDiscrete.h0000644000000000000000000000013212717644275017742 xustar0030 mtime=1463765181.697707412 30 atime=1463765181.693707444 30 ctime=1463765201.789546942 madp-0.4/src/parser/ParserPOMDPDiscrete.h0000664000372100037210000000242112717644275020575 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _PARSERPOMDPDISCRETE_H_ #define _PARSERPOMDPDISCRETE_H_ 1 /* the include directives */ #include #include "Globals.h" #include "POMDPDiscrete.h" #include "ParserInterface.h" /**\brief \deprecated ParserPOMDPDiscrete is a parser for * POMDPDiscrete that makes use of Tony Cassandra's POMDPsolve to do the parsing.*/ class ParserPOMDPDiscrete : public ParserInterface { private: POMDPDiscrete *_m_problem; protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor ParserPOMDPDiscrete(POMDPDiscrete *problem); void Parse(); }; #endif /* !_PARSERPOMDPDISCRETE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/parser/PaxHeaders.5405/CommentOrBlankParser.h0000644000000000000000000000013012717644275020251 xustar0029 mtime=1463765181.68170754 29 atime=1463765181.68170754 30 ctime=1463765201.793546909 madp-0.4/src/parser/CommentOrBlankParser.h0000664000372100037210000000741012717644275021111 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _COMMENTORBLANKPARSER_H_ #define _COMMENTORBLANKPARSER_H_ 1 #if USE_BOOST_SPIRIT_CLASSIC #include "boost/spirit/include/classic_core.hpp" #else #include "boost/spirit/core.hpp" #endif namespace boost { namespace spirit #if USE_BOOST_SPIRIT_CLASSIC { namespace classic #endif { template struct sub_grammar : public parser { typedef sub_grammar self_t; typedef DerivedT const& embed_t; template struct result { typedef typename parser_result< typename DerivedT::start_t, ScannerT>::type type; }; DerivedT const& derived() const { return *static_cast(this); } template typename parser_result::type parse(ScannerT const& scan) const { return derived().start.parse(scan); } }; }} #if USE_BOOST_SPIRIT_CLASSIC } #endif #if USE_BOOST_SPIRIT_CLASSIC using namespace boost::spirit::classic; #else using namespace boost::spirit; #endif /* aliases */ /* constants */ #define DEBUG_COMPARS 0 #define DEBUG_COBP 0 namespace comment_cobp { typedef char char_t; //typedef file_iterator iterator_t; typedef file_iterator iterator_t_fi; typedef position_iterator iterator_t; typedef scanner scanner_t; typedef rule rule_t; namespace{ void cp_eol(iterator_t, iterator_t) { if(DEBUG_COMPARS) std::cout << "EOL\n"; } //void cp_endinput(iterator_t, iterator_t) //{ if(DEBUG_COMPARS) std::cout << "END OF INPUT\n"; } void cp_startcomment(char_t) { if(DEBUG_COMPARS) std::cout<< "#-STARTCOMMENT\n"; } void cobp_blank(char_t) {if(DEBUG_COBP) std::cout << "SKIPPED BLANK\n";}; //void cobp_emptyline(iterator_t str, iterator_t end) //{ if(DEBUG_COBP) std::cout << "SKIPPED EMPTYLINE\n"; }; void cobp_comment(iterator_t str, iterator_t end) { std::string s(str, end); if(DEBUG_COBP) std::cout<< "SKIPPED COMMENT: \""<< s << "\""<< std::endl; }; } //CommentParser struct CommentParser : public sub_grammar { typedef sequence, void (*)(comment_cobp::char_t)>, kleene_star > >, kleene_star > > start_t; CommentParser() : start ( //commenttoken ch_p('#')[&cp_startcomment] >> //lineremainder *( print_p | /* alnum_p |*/ blank_p ) >> *( eol_p[&cp_eol] ) ) {} start_t start; }; CommentParser const commentParser_p = CommentParser(); struct CommentOrBlankParser : public sub_grammar { typedef alternative, action > start_t; CommentOrBlankParser() : start ( blank_p[&cobp_blank] | commentParser_p[&cobp_comment] ) {} start_t start; }; CommentOrBlankParser const commentOrBlankParser_p = CommentOrBlankParser(); } #endif /* !_COMMENTORBLANKPARSER_H_ */ madp-0.4/src/parser/PaxHeaders.5405/pomdp.spirit0000644000000000000000000000007412717644140016421 xustar0030 atime=1463765180.197719392 30 ctime=1463765201.021553076 madp-0.4/src/parser/pomdp.spirit0000664000372100037210000004451012717644140017254 0ustar00fransfrans00000000000000#if SUBGRAMMAR == 0 AGENTSTOK //new for DECENTRALIZED pomdp = str_p("agents"); DISCOUNTTOK = str_p("discount"); VALUESTOK = str_p("values"); STATESTOK = str_p("states"); ACTIONSTOK = str_p("actions")[DebugOutput("'actions' keyword")]; OBSERVATIONSTOK = str_p("observations")[DebugOutput("'observations' keyword")]; TTOK = str_p("T")[DebugOutput("'T' keyword")]; OTOK = str_p("O")[DebugOutput("'O' keyword")]; RTOK = str_p("R")[DebugOutput("'R' keyword")]; UNIFORMTOK = str_p("uniform")[SetLastParsedType(self._m_parserObject, UNIFORM)]; INTTOK = uint_p[StoreLastParsedElement(self._m_parserObject)]; #endif IDENTITYTOK = str_p("identity")[SetLastParsedType(self._m_parserObject, IDENTITY)]; REWARDTOK = str_p("reward"); COSTTOK = str_p("cost"); STARTTOK = str_p("start")[DebugOutput("'start' keyword")]; INCLUDETOK = str_p("include"); EXCLUDETOK = str_p("exclude"); RESETTOK = str_p("reset"); COLONTOK = str_p(":"); ASTERICKTOK = str_p("*")[SetLastParsedType(self._m_parserObject, ASTERICK)]; PLUSTOK = str_p("+"); MINUSTOK = str_p("-"); FLOATTOK = real_p[StoreLastParsedElement(self._m_parserObject)][DebugOutput("FLOATTOK")]; //([0-9]+ \. [0-9]* | \. [0-9]+ | [0-9]+ ) ([eE] [+-]? [0-9]+)? STRINGTOK = (lexeme_d[alpha_p >> *(alnum_p | ch_p('_') | ch_p('-') ) ] - reserved_word)[StoreLastParsedElement(self._m_parserObject)]; ; reserved_word = AGENTSTOK | DISCOUNTTOK | ACTIONSTOK | OBSERVATIONSTOK | TTOK | OTOK | RTOK | STARTTOK ; pomdp_file = eps_p[DebugOutput("start of pomdp file")][Initialize(self._m_parserObject)] >> pomdp[DebugOutput("pomdp")][InitializePOMDP(self._m_parserObject)] ; /* pomdp_file = //NOTE start_state has been moved to a fixed place in the preamble //cassandra's def: preamble start_state param_list preamble >> param_list ; */ pomdp = eps_p[DebugOutput("setting number of agents...")][SetNrAgents(self._m_parserObject)] >> preamble_unordered[DebugOutput("preamble_unordered")][AddModels(self._m_parserObject)] >> //start_state is optional: !start_state[DebugOutput("preamble_start_state")][InitializeStates(self._m_parserObject)] >> param_list[DebugOutput("param_list")] ; preamble_unordered = // 5 lines for preamble: preamble_item >> preamble_item >> preamble_item >> preamble_item >> preamble_item ; preamble_item = discount_param[DebugOutput("preamble_discount_param")] | value_param[DebugOutput("preamble_value_param")] | state_param[DebugOutput("preamble_state_param")] | action_param[DebugOutput("preamble_action_param")][InitializeActions(self._m_parserObject)] | obs_param[DebugOutput("preamble_obs_param")][InitializeObservations(self._m_parserObject)] ; preamble = //NOTE the order of the preamble is now fixed //cassandra's def: preamble param_type | /* empty */ eps_p[DebugOutput("preamble: setting number of agents...")][SetNrAgents(self._m_parserObject)] >> discount_param[DebugOutput("preamble_discount_param")] >> value_param[DebugOutput("preamble_value_param")] >> state_param[DebugOutput("preamble_state_param")] >> //this is a much more logical place for start state and compatible with the .dpomdp file format: //(but of course not with Cassandra's format...) !start_state[DebugOutput("preamble_start_state")][InitializeStates(self._m_parserObject)] >> action_param[DebugOutput("preamble_action_param")][InitializeActions(self._m_parserObject)] >> obs_param[DebugOutput("preamble_obs_param")][InitializeObservations(self._m_parserObject)] ; //preamble // = //NOTE the order of the preamble is now fixed // //cassandra's def: preamble param_type | /* empty */ // agents_param >> // discount_param >> // value_param >> // state_param >> // start_state >> // action_param >> // obs_param //; /* deprecated param_type = discount_param | value_param | state_param | action_param | obs_param ;*/ /* new:*/ //agents_param // = AGENTSTOK >> COLONTOK >> INTTOK // = AGENTSTOK[DebugOutput("ap_AGENTSTOK")] >> COLONTOK >> agents_tail >> // ; discount_param // = DISCOUNTTOK >> COLONTOK >> number = DISCOUNTTOK >> COLONTOK >> FLOATTOK[dp_SetDiscountParam(self._m_parserObject)] ; value_param = VALUESTOK >> COLONTOK >> value_tail[DebugOutput("vp_value_tail")] // = VALUESTOK >> COLONTOK >> value_tail ; value_tail // = REWARDTOK // | COSTTOK = REWARDTOK[vt_REWARDTOK(self._m_parserObject)] | COSTTOK[vt_COSTTOK(self._m_parserObject)] ; state_param // = STATESTOK >> COLONTOK >> state_tail = STATESTOK[SetNrStates(self._m_parserObject,0)] >> COLONTOK >> state_tail[DebugOutput("sp_state_tail")] ; state_tail // = INTTOK // | ident_list = INTTOK[SetNrStates(self._m_parserObject)] [DebugOutput("st_INTTOK")] | state_list[DebugOutput("st_ident_list")] ; state_list = // ident_list >> STRINGTOK | STRINGTOK +( STRINGTOK[AddState(self._m_parserObject)] ) ; //// for multiple agents, setting the action is more complex: ////new - each agent has its actions on its own line //action_param // = ACTIONSTOK[SetAgentIndex(self._m_parserObject, 0)] >> COLONTOK >> // +(EOLTOK >> action_param_line[DebugOutput("ap_action_param_line")]) // ; //action_param_line // = action_tail[DebugOutput("apl_action_tail")][SetNextAgentIndex( // self._m_parserObject)] // ; //action_tail // = INTTOK[SetNrActions(self._m_parserObject)] // | action_list[DebugOutput("at_ident_list")] // ; //action_list // = +( STRINGTOK[AddAction(self._m_parserObject)] ) // ; // //// action_param = ACTIONSTOK >> COLONTOK >> action_tail ; action_tail // = INTTOK // | ident_list = INTTOK[SetNrActions(self._m_parserObject)] | action_list[DebugOutput("at_ident_list")] ; action_list = +( STRINGTOK[AddAction(self._m_parserObject)] ) ; obs_param // = OBSERVATIONSTOK >> COLONTOK >> obs_param_tail = OBSERVATIONSTOK[SetAgentIndex(self._m_parserObject, 0)] >> COLONTOK >> obs_tail // +(EOLTOK >> obs_param_line[DebugOutput("op_obs_param_line")]) >> EOLTOK ; //obs_param_tail // = INTTOK // | ident_list //; obs_tail = INTTOK[SetNrObservations(self._m_parserObject)] | obs_list[DebugOutput("ot_ident_list")] ; obs_list = +( STRINGTOK[AddObservation(self._m_parserObject)] ) ; start_state // = STARTTOK >> COLONTOK >> u_matrix //distribution specified // | STARTTOK >> COLONTOK >> STRINGTOK //name of start state // | STARTTOK >> INCLUDETOK >> COLONTOK >> start_state_list // | STARTTOK >> EXCLUDETOK >> COLONTOK >> start_state_list // // empty not valid | /* empty */ = ( STARTTOK[DebugOutput("STARTTOK")][ResetCurMatrix(self._m_parserObject)] >> ( ( COLONTOK[DebugOutput("COLONTOK")] >> ( u_matrix[DebugOutput("u_matrix")][StartStateRowProbs(self._m_parserObject)] | STRINGTOK[AddStartState(self._m_parserObject)] [ProcessStartStateList(self._m_parserObject)] | INTTOK[AddStartState(self._m_parserObject)] [ProcessStartStateList(self._m_parserObject)] ) ) | (INCLUDETOK >> COLONTOK >> start_state_list [ProcessStartStateList(self._m_parserObject)]) | (EXCLUDETOK[StartStateExludes(self._m_parserObject)] >> COLONTOK >> start_state_list [ProcessStartStateList(self._m_parserObject)]) ) ) ; ; /*changed to remove left recursion: */ start_state_list = // cassandra's def: start_state_list state | state // easy substitute: +(state) // NOTE - this allows '*' as states here... // we don't want that, so : // +(STRINGTOK) // | +(INTTOK) +(STRINGTOK[AddStartState(self._m_parserObject)][DebugOutput("ssl_STRINGTOK")] | INTTOK[AddStartState(self._m_parserObject)][DebugOutput("ssl_INTTOK")]) ; /*remove left recursion...*/ param_list = // cassandra's def: param_list param_spec | /* empty */ *(param_spec) ; param_spec = trans_prob_spec[DebugOutput("trans_prob_spec")] | obs_prob_spec[DebugOutput("obs_prob_spec")] | reward_spec[DebugOutput("reward_spec")] ; trans_prob_spec // = TTOK >> COLONTOK >> trans_spec_tail = TTOK[DebugOutput("tps_TTOK")][ResetCurMatrix(self._m_parserObject)] >> COLONTOK >> trans_spec_tail ; trans_spec_tail // = paction >> COLONTOK >> state >> COLONTOK >> state >> prob // | paction >> COLONTOK >> state >> u_matrix // | paction >> ui_matrix = paction[DebugOutput("tst_paction")] >> ( ( //case 1 or 2 COLONTOK[DebugOutput("tst_COLON2")] >> from_state[DebugOutput("tst_statefrom")] >> ( ( //case 1 COLONTOK[DebugOutput("tst_COLON3")] >> to_state[DebugOutput("tst_stateto")] >> prob[DebugOutput("tst_prob")][ProcessTProb(self._m_parserObject)] ) | ( //case 2 u_matrix[DebugOutput("tst_u_matrix")][ProcessTRow(self._m_parserObject)] ) ) ) | ( //case 3 ui_matrix[DebugOutput("tst_ui_matrix")][ProcessTMatrix(self._m_parserObject)] ) ) ; obs_prob_spec // = OTOK >> COLONTOK >> obs_spec_tail = OTOK[DebugOutput("ops_OTOK")][ResetCurMatrix(self._m_parserObject)] >> COLONTOK >> obs_spec_tail ; obs_spec_tail // = paction >> COLONTOK >> state >> COLONTOK >> obs >> prob // | paction >> COLONTOK >> state >> u_matrix // | paction >> u_matrix = paction[DebugOutput("tst_paction")] >> ( ( //case 1 or 2 COLONTOK[DebugOutput("tst_COLON2")] >> to_state[DebugOutput("ost_stateto")] >> ( ( //case 1 COLONTOK[DebugOutput("tst_COLON3")] >> obs[DebugOutput("ost_obs")] >> prob[DebugOutput("ost_prob")][ProcessOProb(self._m_parserObject)] ) | ( //case 2 u_matrix[DebugOutput("ost_u_matrix")][ProcessORow(self._m_parserObject)] ) ) ) | ( //case 3 ui_matrix[DebugOutput("tst_ui_matrix")][ProcessOMatrix(self._m_parserObject)] ) ) ; ; reward_spec // = RTOK >> COLONTOK >> reward_spec_tail = RTOK[DebugOutput("rs_rtok")][ResetCurMatrix(self._m_parserObject)] >> COLONTOK >> reward_spec_tail[DebugOutput("reward_spec_tail")] ; reward_spec_tail // = paction >> COLONTOK >> state >> COLONTOK >> state >> COLONTOK >> obs >> number // | paction >> COLONTOK >> state >> COLONTOK >> state >> num_matrix // | paction >> COLONTOK >> state >> num_matrix = paction[DebugOutput("rst_paction")] >> COLONTOK >> from_state[DebugOutput("rst_statefrom")] >> ( ( COLONTOK >> to_state[DebugOutput("rst_stateto")] >> COLONTOK >> ( //case 1 obs[DebugOutput("rst_obs")] >> FLOATTOK[DebugOutput("rst_FLOATTOK")][ProcessR(self._m_parserObject)] | //case 2: floats_matrix[DebugOutput("rst_floats_matrix")][ProcessRRow(self._m_parserObject)] ) ) | //case 3 floats_matrix[DebugOutput("rst_floats_matrix")][ProcessRMatrix(self._m_parserObject)] ) ; ; ui_matrix // = UNIFORMTOK // | IDENTITYTOK // | prob_matrixx = ( UNIFORMTOK[DebugOutput("ui_matrix UNIFORMTOK ")] | IDENTITYTOK | floats_matrix ) ; u_matrix // = UNIFORMTOK // | RESETTOK // | prob_matrix = UNIFORMTOK[DebugOutput("um_UNIFORMTOK")] // | RESETTOK - NOTE:reset is not documented by cassandra, therefore // omitted here | floats_matrix[DebugOutput("um_floats_matrix")] ; floats_matrix = //floats_matrix >> floats | floats +(floats_row_vector[DebugOutput("pm_floats_row_vector")][NextRowOfMatrix(self._m_parserObject)]) ; floats_row_vector = lexeme_d [ + ( *blank_p[DebugOutput("blank")] >> FLOATTOK[NextFloatOfRow(self._m_parserObject)] ) // >> // *blank_p[DebugOutput("blank")] // >> // eol_p[DebugOutput("eol")] ] ; //difference between prob and num is deprecated - only parse doubles // and do typechecking when putting data in model...(easier) /* prob_matrix = //prob_matrix >> prob | prob +(prob_row_vector[DebugOutput("pm_prob_row_vector")][NextRowOfMatrix( self._m_parserObject)]) ; prob_row_vector = +(prob[DebugOutput("prv_prob")][NextProbOfRow(self._m_parserObject)]) ; num_matrix = //num_matrix >> number | number +(num_row_vector[DebugOutput("nm_num_row_vector")]) ; num_row_vector = +(number[DebugOutput("nrv_number")]) ; */ from_state = state_or_indiv_act_or_obs[StoreLPFromState(self._m_parserObject)] ; to_state = state_or_indiv_act_or_obs[StoreLPToState(self._m_parserObject)] ; /* state = INTTOK | STRINGTOK | ASTERICKTOK ; */ /* the parsed sub-rules set the "_m_lp_type" variable, which is used by * StoreLPAction above. Therefore, no functions need to be called here.*/ state_or_indiv_act_or_obs = INTTOK | STRINGTOK | ASTERICKTOK ; paction //original // = // INTTOK // | STRINGTOK // | ASTERICKTOK //but probably easier to just treat as a joint action with 1 element: = state_or_indiv_act_or_obs[StoreLPAction(self._m_parserObject)][StoreLPJointAction(self._m_parserObject)] | INTTOK[StoreLPJointAction(self._m_parserObject, true)] | ASTERICKTOK[WildCardJointAction(self._m_parserObject)][StoreLPJointAction(self._m_parserObject)] #if 0 /*in order to discriminate between a joint action specified by * 1) a joint action index (or '*') * and * 2) multiple individual actions (indices, '*'s or action names) * * we have to require at least two individual indices in case (2).*/ joint_action = ( state_or_indiv_act_or_obs[StoreLPAction(self._m_parserObject)] >> +(state_or_indiv_act_or_obs[StoreLPAction(self._m_parserObject)]) )[StoreLPJointAction(self._m_parserObject)] | INTTOK[StoreLPJointAction(self._m_parserObject, true)] | ASTERICKTOK[WildCardJointAction(self._m_parserObject)][StoreLPJointAction(self._m_parserObject)] //NYI(" the * joint action ")]//to indicate any joint action... ; joint_obs = //first try to catch joint actions specified as "* * ... *" which //denote all joint observations // (we don't want to expand these individual joint observations...) ( ASTERICKTOK >> +ASTERICKTOK ) [WildCardJointObservation(self._m_parserObject)] | //the regular case of specifying individual observation(indice)s ( state_or_indiv_act_or_obs[StoreLPObservation(self._m_parserObject)] >> +(state_or_indiv_act_or_obs[StoreLPObservation(self._m_parserObject)]) )[StoreLPJointObservation(self._m_parserObject)] | //a joint observation index INTTOK[StoreLPJointObservation(self._m_parserObject, true)] | //a single '*' denoting all joint observations: ASTERICKTOK[WildCardJointObservation(self._m_parserObject)] //NYI(" the * joint obs ")]//to indicate any joint obs... ; #endif ; obs // = INTTOK // | STRINGTOK // | ASTERICKTOK //but probably easier to just treat as a joint observation with 1 element: = state_or_indiv_act_or_obs[StoreLPObservation(self._m_parserObject)][StoreLPJointObservation(self._m_parserObject)] | INTTOK[StoreLPJointAction(self._m_parserObject, true)] | ASTERICKTOK[WildCardJointAction(self._m_parserObject)][StoreLPJointAction(self._m_parserObject)] ; //ident_list // = // ident_list >> STRINGTOK | STRINGTOK //// +(STRINGTOK) // +( STRINGTOK[DebugOutput("il_STRINGTOK_next")][NextStringOfIdentList(self._m_parserObject)] ) // ; prob = FLOATTOK // try float first -> don't want to be left with ".024" | INTTOK ; /* number // try float first -> don't want to be left with ".024" = float_r | int_r ; float_r = FLOATTOK[n_SetLPNumberType(self._m_parserObject,DOUBLE)] ; int_r = (optional_sign[n_SetLPNumUsedOptSign(self._m_parserObject,true)]) >> INTTOK[n_SetLPNumberType(self._m_parserObject,INT)] [n_ProcessNegation(self._m_parserObject)] | INTTOK[n_SetLPNumUsedOptSign(self._m_parserObject,false)] [n_SetLPNumberType(self._m_parserObject,INT)] ; optional_sign = PLUSTOK[os_SetNegated(self._m_parserObject,false)] | MINUSTOK[os_SetNegated(self._m_parserObject,true)] // | eps_p[DebugOutput("optional_sign_epsmatch")] ; */ madp-0.4/src/parser/PaxHeaders.5405/ParserInterface.h0000644000000000000000000000012612717644275017303 xustar0028 mtime=1463765181.6617077 28 atime=1463765181.6617077 30 ctime=1463765201.789546942 madp-0.4/src/parser/ParserInterface.h0000664000372100037210000000206412717644275020136 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _PARSERINTERFACE_H_ #define _PARSERINTERFACE_H_ 1 /* the include directives */ #include /// ParserInterface is an interface for parsers. class ParserInterface { private: protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor ParserInterface(){}; virtual ~ParserInterface(){}; virtual void Parse() = 0; }; #endif /* !_PARSERINTERFACE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/parser/PaxHeaders.5405/ParserTOIFactoredRewardDecPOMDPDiscrete.cpp0000644000000000000000000000013212717644275024102 xustar0030 mtime=1463765181.669707636 30 atime=1463765181.669707636 30 ctime=1463765201.797546879 madp-0.4/src/parser/ParserTOIFactoredRewardDecPOMDPDiscrete.cpp0000664000372100037210000000224012717644275024734 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "ParserTOIFactoredRewardDecPOMDPDiscrete.h" ParserTOIFactoredRewardDecPOMDPDiscrete:: ParserTOIFactoredRewardDecPOMDPDiscrete( TOIFactoredRewardDecPOMDPDiscrete *problem) : ParserTOIDecPOMDPDiscrete(problem), _m_problem(problem) { } void ParserTOIFactoredRewardDecPOMDPDiscrete:: StoreDecPOMDP(DecPOMDPDiscrete *decpomdp, Index id) { MultiAgentDecisionProcessDiscrete* madp = _m_problem->GetIndividualMADPD(id); decpomdp->ExtractMADPDiscrete(madp); _m_problem->SetIndividualRewardModel(decpomdp->GetRewardModelPtr(), id); _m_problem->SetIndividualDecPOMDPD(decpomdp,id); } madp-0.4/src/parser/PaxHeaders.5405/ParserPOMDPDiscrete.cpp0000644000000000000000000000013212717644275020275 xustar0030 mtime=1463765181.697707412 30 atime=1463765181.697707412 30 ctime=1463765201.801546846 madp-0.4/src/parser/ParserPOMDPDiscrete.cpp0000664000372100037210000000631512717644275021136 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "ParserPOMDPDiscrete.h" #include #if USE_POMDPSOLVE_LIBRARY extern "C" { #include "mdp/mdp.h" } #endif using namespace std; ParserPOMDPDiscrete:: ParserPOMDPDiscrete(POMDPDiscrete *problem) : _m_problem(problem) { } void ParserPOMDPDiscrete::Parse() { #if USE_POMDPSOLVE_LIBRARY string filename=_m_problem->GetProblemFile(); readMDP(const_cast(filename.c_str())); _m_problem->SetNrAgents(1); _m_problem->SetNrStates(gNumStates); _m_problem->SetDiscount(gDiscount); if(gValueType==REWARD_value_type) _m_problem->SetRewardType(REWARD); else if(gValueType==COST_value_type) _m_problem->SetRewardType(COST); _m_problem->SetNrActions(0,gNumActions); _m_problem->ConstructJointActions(); _m_problem->SetActionsInitialized(true); _m_problem->SetNrObservations(0,gNumObservations); _m_problem->ConstructJointObservations(); _m_problem->SetObservationsInitialized(true); vector isdVector(_m_problem->GetNrStates()); for(Index s=0;s!=_m_problem->GetNrStates();++s) isdVector.at(s)=gInitialBelief[s]; StateDistribution* isd= new StateDistributionVector(isdVector); _m_problem->SetISD(isd); _m_problem->CreateNewTransitionModel(); for(Index a=0;a!=_m_problem->GetNrActions();++a) for(Index s=0;s!=_m_problem->GetNrStates();++s) for(Index s1=0;s1!=_m_problem->GetNrStates();++s1) { // this isn't the fastest way, since it does a lookup // in the sparse matrix, but at least we don't have to // mess with the internals double p=getEntryMatrix(P[a],s,s1); _m_problem->SetTransitionProbability(s,a,s1,p); } _m_problem->CreateNewObservationModel(); for(Index a=0;a!=_m_problem->GetNrActions();++a) for(Index s=0;s!=_m_problem->GetNrStates();++s) for(Index o=0;o!=_m_problem->GetNrObservations();++o) { // this isn't the fastest way, since it does a lookup // in the sparse matrix, but at least we don't have to // mess with the internals double p=getEntryMatrix(R[a],s,o); _m_problem->SetObservationProbability(a,s,o,p); } _m_problem->CreateNewRewardModel(); for(Index a=0;a!=_m_problem->GetNrActions();++a) for( Index i = Q->row_start[a]; i < Q->row_start[a] + Q->row_length[a]; i++ ) _m_problem->SetReward(Q->col[i],a,Q->mat_val[i]); _m_problem->SetInitialized(true); #else throw(E("ParserPOMDPDiscrete needs to be compiled with USE_POMDPSOLVE_LIBRARY")); #endif } madp-0.4/src/parser/PaxHeaders.5405/CommentBlankOrNewlineParser.h0000644000000000000000000000013012717644275021573 xustar0029 mtime=1463765181.68170754 29 atime=1463765181.68170754 30 ctime=1463765201.793546909 madp-0.4/src/parser/CommentBlankOrNewlineParser.h0000664000372100037210000000541412717644275022435 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _COMMENTBLANKORNEWLINEPARSER_H_ #define _COMMENTBLANKORNEWLINEPARSER_H_ 1 #if USE_BOOST_SPIRIT_CLASSIC #include #else #include #endif #include "CommentOrBlankParser.h" #if USE_BOOST_SPIRIT_CLASSIC using namespace boost::spirit::classic; #else using namespace boost::spirit; #endif /* aliases */ /* constants */ #define DEBUG_CBONL_COMPARS 0 #define DEBUG_CBONL_COBP 0 namespace comment_cbonlp { typedef char char_t; //typedef file_iterator iterator_t; typedef file_iterator iterator_t_fi; typedef position_iterator iterator_t; typedef scanner scanner_t; typedef rule rule_t; namespace{ void cbonlp_eol(iterator_t, iterator_t) { if(DEBUG_CBONL_COMPARS) std::cout << "EOL\n"; } void cbonlp_comment_or_blank(iterator_t str, iterator_t end) { if(DEBUG_CBONL_COBP) { std::string s(str, end); std::cout<< "SKIPPED COMMENT: \""<< s << "\""<< std::endl; } }; } struct CommentBlankorNewLineParser : public sub_grammar { /*typedef int start_t; //<- used to infer the following type:*/ typedef alternative< action< comment_cobp::CommentOrBlankParser, void (*)(position_iterator< file_iterator >, position_iterator< file_iterator >) >, action< eol_parser, void (*)(position_iterator< file_iterator >, position_iterator< file_iterator >) > > start_t; CommentBlankorNewLineParser() : start ( comment_cobp::commentOrBlankParser_p[&cbonlp_comment_or_blank] | eol_p[&cbonlp_eol] ) {} start_t start; }; } #endif /* !_COMMENTBLANKORNEWLINEPARSER_H_ */ madp-0.4/src/parser/PaxHeaders.5405/ParserTOIDecPOMDPDiscrete.h0000644000000000000000000000013212717644275020732 xustar0030 mtime=1463765181.669707636 30 atime=1463765181.665707667 30 ctime=1463765201.785546974 madp-0.4/src/parser/ParserTOIDecPOMDPDiscrete.h0000664000372100037210000000331512717644275021570 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _PARSERTOIDECPOMDPDISCRETE_H_ #define _PARSERTOIDECPOMDPDISCRETE_H_ 1 /* the include directives */ #include #include "Globals.h" #include "TOIDecPOMDPDiscrete.h" #include "DecPOMDPDiscrete.h" #include "ParserInterface.h" /**\brief ParserTOIDecPOMDPDiscrete is a parser for * TOIDecPOMDPDiscrete. */ class ParserTOIDecPOMDPDiscrete : public ParserInterface { private: TOIDecPOMDPDiscrete *_m_problem; void ParseBase(); void ParseAgent(Index id); virtual void StoreDecPOMDP(DecPOMDPDiscrete *decpomdp, Index id); protected: void ParseRewards(size_t nrAgents, const std::vector &nrStates, const std::vector &nrActions); virtual void ParseRewards(); public: // Constructor, destructor and copy assignment. /// (default) Constructor ParserTOIDecPOMDPDiscrete(TOIDecPOMDPDiscrete *problem); virtual ~ParserTOIDecPOMDPDiscrete(){}; void Parse(); }; #endif /* !_PARSERTOIDECPOMDPDISCRETE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/parser/PaxHeaders.5405/ParserTOIDecPOMDPDiscrete.cpp0000644000000000000000000000013212717644275021265 xustar0030 mtime=1463765181.669707636 30 atime=1463765181.669707636 30 ctime=1463765201.797546879 madp-0.4/src/parser/ParserTOIDecPOMDPDiscrete.cpp0000664000372100037210000001025312717644275022122 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "ParserTOIDecPOMDPDiscrete.h" #include "ParserDPOMDPFormat_Spirit.h" #include using namespace std; ParserTOIDecPOMDPDiscrete:: ParserTOIDecPOMDPDiscrete(TOIDecPOMDPDiscrete *problem) : _m_problem(problem) { } void ParserTOIDecPOMDPDiscrete::Parse() { ParseBase(); for(Index i=0;i!=_m_problem->GetNrAgents();++i) ParseAgent(i); ParseRewards(); _m_problem->SetInitialized(true); } void ParserTOIDecPOMDPDiscrete::ParseRewards() { vector nrStates(_m_problem->GetNrAgents(),0), nrActions(_m_problem->GetNrAgents(),0); for(Index i=0;i!=_m_problem->GetNrAgents();++i) { nrStates[i]=_m_problem->GetIndividualMADPD(i)->GetNrStates(); nrActions[i]=_m_problem->GetIndividualMADPD(i)->GetNrJointActions(); } ParseRewards(_m_problem->GetNrAgents(),nrStates,nrActions); } void ParserTOIDecPOMDPDiscrete::ParseBase() { unsigned int nrAgents; double gamma; string filename=_m_problem->GetProblemFile() + ".base"; ifstream fp(filename.c_str()); if(!fp) { cerr << "ParserTOIDecPOMDPDiscrete::ParseBase: failed to " << "open file " << filename << endl; abort(); } int line=0; string buffer; while(!getline(fp,buffer).eof()) { istringstream is(buffer); switch(line) { case 0: is >> nrAgents; break; case 1: is >> gamma; break; } line++; } _m_problem->SetNrAgents(nrAgents); _m_problem->SetDiscount(gamma); } void ParserTOIDecPOMDPDiscrete::ParseAgent(Index id) { MultiAgentDecisionProcessDiscrete* madp = _m_problem->GetIndividualMADPD(id); DecPOMDPDiscrete *decpomdp; decpomdp=new DecPOMDPDiscrete("", "", madp->GetProblemFile()); decpomdp->SetSparse(madp->GetSparse()); DPOMDPFormatParsing::ParserDPOMDPFormat_Spirit parser(decpomdp); parser.Parse(); if(decpomdp->GetNrAgents()!=1) throw(E("ParserTOIDecPOMDPDiscrete::ParseAgent individual models can only be defined for a single agent")); StoreDecPOMDP(decpomdp,id); } void ParserTOIDecPOMDPDiscrete::StoreDecPOMDP(DecPOMDPDiscrete *decpomdp, Index id) { MultiAgentDecisionProcessDiscrete* madp = _m_problem->GetIndividualMADPD(id); decpomdp->ExtractMADPDiscrete(madp); _m_problem->SetIndividualDecPOMDPD(decpomdp,id); } /** Format for .rewards file is a set of lines: * */ void ParserTOIDecPOMDPDiscrete::ParseRewards(size_t nrAgents, const vector &nrStates, const vector &nrActions) { vector states, actions; unsigned int state,action; double reward; string filename=_m_problem->GetProblemFile() + ".rewards"; ifstream fp(filename.c_str()); if(!fp) { cerr << "ParserTOIDecPOMDPDiscrete::ParseRewards: failed to " << "open file " << filename << endl; } _m_problem->CreateNewRewardModel(); string buffer; while(!getline(fp,buffer).eof()) { istringstream is(buffer); states.clear(); actions.clear(); for(unsigned int i=0;i!=nrAgents;++i) { is >> state; states.push_back(state); } for(unsigned int i=0;i!=nrAgents;++i) { is >> action; actions.push_back(action); } is >> reward; _m_problem-> SetReward(states, actions, reward); } } madp-0.4/src/parser/PaxHeaders.5405/MADPParser.cpp0000644000000000000000000000013012717644275016452 xustar0030 mtime=1463765181.665707667 28 atime=1463765181.6617077 30 ctime=1463765201.801546846 madp-0.4/src/parser/MADPParser.cpp0000664000372100037210000000371512717644275017316 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "MADPParser.h" #include "ParserDPOMDPFormat_Spirit.h" #include "ParserTOIDecPOMDPDiscrete.h" #include "ParserTOIDecMDPDiscrete.h" #include "ParserTOIFactoredRewardDecPOMDPDiscrete.h" #include "ParserTOICompactRewardDecPOMDPDiscrete.h" #include "ParserPOMDPFormat_Spirit.h" #include "ParserProbModelXML.h" #include "DecPOMDPDiscrete.h" #include "TOIDecPOMDPDiscrete.h" #include "TOIDecMDPDiscrete.h" #include "TOIFactoredRewardDecPOMDPDiscrete.h" #include "TOICompactRewardDecPOMDPDiscrete.h" #include "POMDPDiscrete.h" void MADPParser::Parse(DecPOMDPDiscrete *model) { DPOMDPFormatParsing::ParserDPOMDPFormat_Spirit parser(model); parser.Parse(); } void MADPParser::Parse(TOIDecPOMDPDiscrete *model) { ParserTOIDecPOMDPDiscrete parser(model); parser.Parse(); } void MADPParser::Parse(TOIDecMDPDiscrete *model) { ParserTOIDecMDPDiscrete parser(model); parser.Parse(); } void MADPParser::Parse(TOIFactoredRewardDecPOMDPDiscrete *model) { ParserTOIFactoredRewardDecPOMDPDiscrete parser(model); parser.Parse(); } void MADPParser::Parse(TOICompactRewardDecPOMDPDiscrete *model) { ParserTOICompactRewardDecPOMDPDiscrete parser(model); parser.Parse(); } void MADPParser::Parse(FactoredDecPOMDPDiscrete *model) { ParserProbModelXML parser(model); parser.Parse(); } void MADPParser::Parse(POMDPDiscrete *model) { POMDPFormatParsing::ParserPOMDPFormat_Spirit parser(model); parser.Parse(); } madp-0.4/src/parser/PaxHeaders.5405/ParserTOIDecMDPDiscrete.cpp0000644000000000000000000000013212717644275021026 xustar0030 mtime=1463765181.665707667 30 atime=1463765181.665707667 30 ctime=1463765201.797546879 madp-0.4/src/parser/ParserTOIDecMDPDiscrete.cpp0000664000372100037210000000164312717644275021666 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "ParserTOIDecMDPDiscrete.h" #include "ParserTOIDecPOMDPDiscrete.h" //Default constructor ParserTOIDecMDPDiscrete:: ParserTOIDecMDPDiscrete(TOIDecMDPDiscrete *problem) : _m_problem(problem) { } void ParserTOIDecMDPDiscrete::Parse() { ParserTOIDecPOMDPDiscrete parser(_m_problem); parser.Parse(); _m_problem->CreateStateObservations(); } madp-0.4/src/parser/PaxHeaders.5405/MADPParser.h0000644000000000000000000000013112717644275016120 xustar0029 mtime=1463765181.72170722 30 atime=1463765181.717707253 30 ctime=1463765201.789546942 madp-0.4/src/parser/MADPParser.h0000664000372100037210000000365712717644275016770 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _MADPPARSER_H_ #define _MADPPARSER_H_ 1 /* the include directives */ #include #include #include "Globals.h" class DecPOMDPDiscrete; class FactoredDecPOMDPDiscrete; class TOIDecPOMDPDiscrete; class TOIDecMDPDiscrete; class TOIFactoredRewardDecPOMDPDiscrete; class TOICompactRewardDecPOMDPDiscrete; class POMDPDiscrete; /// MADPParser is a general class for parsers in MADP. /** It is templatized to allow for different parsers to be * implemented. When constructed with particular model, the proper * parser is instantiated, and its Parse() function is called (see * ParserInterface). */ class MADPParser { private: /// Parse a DecPOMDPDiscrete using ParserDPOMDPFormat_Spirit. void Parse(DecPOMDPDiscrete *model); void Parse(TOIDecPOMDPDiscrete *model); void Parse(TOIDecMDPDiscrete *model); void Parse(TOIFactoredRewardDecPOMDPDiscrete *model); void Parse(TOICompactRewardDecPOMDPDiscrete *model); void Parse(FactoredDecPOMDPDiscrete *model); void Parse(POMDPDiscrete *model); protected: public: // Constructor, destructor and copy assignment. /// Constructor, on return the model has been parsed. template MADPParser(A* model){ Parse(model); } /// Destructor. ~MADPParser(){}; }; #endif /* !_MADPPARSER_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/parser/PaxHeaders.5405/ParserProbModelXML.cpp0000644000000000000000000000013112717644275020176 xustar0030 mtime=1463765181.745707029 29 atime=1463765181.72170722 30 ctime=1463765201.801546846 madp-0.4/src/parser/ParserProbModelXML.cpp0000664000372100037210000015613312717644275021044 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Joao Messias * * For contact information please see the included AUTHORS file. */ #include "ParserProbModelXML.h" #include /*strcmp*/ using namespace std; namespace{ #ifdef HAVE_LIBXML2 void SetScopes(ParserProbModelXML* parser, FactoredDecPOMDPDiscrete* decpomdp) { xmlChar *xpath = (xmlChar*) "/ProbModelXML/ProbNet/Links/Link[@directed='true']"; xmlXPathObjectPtr link_nodes = parser->GetNodesMatchingExpression(xpath); if(link_nodes == NULL) throw EParse("No links were found in target file."); xmlNodeSetPtr link_nodeset = link_nodes->nodesetval; vector reward_links; for(int i = 0; i < link_nodeset->nodeNr; i++) { xmlNodePtr parent_node = xmlFirstElementChild(link_nodeset->nodeTab[i]); xmlNodePtr child_node = xmlLastElementChild(link_nodeset->nodeTab[i]); string parent_name = parser->GetVariableName(parent_node); int timeslice = parser->GetVariableTimeslice(parent_node); string child_name = parser->GetVariableName(child_node); std::pair parent_elm = parser->GetParsedElement(parent_name); std::pair child_elm = parser->GetParsedElement(child_name); Index cidx = child_elm.second, pidx = parent_elm.second; Scope ASoI; Scope ASoILocal; Scope XSoI; //State factor SoI at t Scope YSoI; //State factor SoI at t+1 switch(child_elm.first) //child type { case ParserProbModelXML::STATE: ASoI = decpomdp->GetASoI_Y(cidx); XSoI = decpomdp->GetXSoI_Y(cidx); YSoI = decpomdp->GetYSoI_Y(cidx); break; case ParserProbModelXML::OBSERVATION: XSoI = decpomdp->GetXSoI_O(cidx); ASoI = decpomdp->GetASoI_O(cidx); YSoI = decpomdp->GetYSoI_O(cidx); break; case ParserProbModelXML::REWARD: //Reward links have to be handled differently, since they may depend on either 1st or 2nd time-slice factors, //and we have to backup the scopes in the latter case. reward_links.push_back(link_nodeset->nodeTab[i]); continue; default: continue; //links to Actions can be ignored, since they imply observations. } switch(parent_elm.first) //parent type { case ParserProbModelXML::STATE: if(timeslice == 0) { if(!XSoI.Contains(pidx)) { XSoI.Insert(pidx); } } else { if(!YSoI.Contains(pidx)) { YSoI.Insert(pidx); } } break; case ParserProbModelXML::ACTION: if(parser->IsAsynchronous()){ ASoILocal.Insert(pidx); pidx = 0; } if(!ASoI.Contains(pidx)) { ASoI.Insert(pidx); } break; default: if(DEBUG_PARSE) cout << "Parent is an observation. Ignoring." << endl; break; //links from Observations are ignored for now. } switch(child_elm.first) //child type { case ParserProbModelXML::STATE: decpomdp->SetSoI_Y(cidx, XSoI, //const Scope & XSoI ASoI, //const Scope & ASoI YSoI); //const Scope & YSoI if(parser->IsAsynchronous() && !ASoILocal.empty()) parser->AddToLocalSFActionScope(cidx,ASoILocal); break; case ParserProbModelXML::OBSERVATION: decpomdp->SetSoI_O(cidx, XSoI, //const Scope & XSoI ASoI, //const Scope & ASoI YSoI, //const Scope & YSoI Scope("<>")); //const Scope & OSoI if(parser->IsAsynchronous() && !ASoILocal.empty()) parser->AddToLocalObsActionScope(cidx,ASoILocal); break; default: continue; //links to Actions can be ignored, since they imply observations. } if(DEBUG_PARSE) cout << "found a link from " << parent_name << " ["<< timeslice <<"] to " << child_name << endl; } for(size_t i = 0; i < reward_links.size(); i++) { //now for the rewards xmlNodePtr parent_node = xmlFirstElementChild(reward_links[i]); xmlNodePtr child_node = xmlLastElementChild(reward_links[i]); string parent_name = parser->GetVariableName(parent_node); string child_name = parser->GetVariableName(child_node); std::pair parent_elm = parser->GetParsedElement(parent_name); std::pair child_elm = parser->GetParsedElement(child_name); Index LRFidx = child_elm.second, pidx = parent_elm.second; Scope ASoI = decpomdp->GetAgentScopeForLRF(LRFidx); Scope ASoILocal; Scope XSoI = decpomdp->GetStateFactorScopeForLRF(LRFidx); Scope YSoI; Scope OSoI; int timeslice = parser->GetVariableTimeslice(parent_node); if(timeslice == 0) { //the usual case switch(parent_elm.first) //parent type { case ParserProbModelXML::STATE: if(!XSoI.Contains(pidx)) { XSoI.Insert(pidx); } break; case ParserProbModelXML::ACTION: if(parser->IsAsynchronous()){ ASoILocal.Insert(pidx); pidx = 0; } if(!ASoI.Contains(pidx)) { ASoI.Insert(pidx); } break; default: continue; //links from Observations are ignored for now. } } else { switch(parent_elm.first) //parent type { case ParserProbModelXML::STATE: YSoI.Insert(pidx); break; case ParserProbModelXML::OBSERVATION: OSoI.Insert(pidx); break; default: continue; //links from NS actions are invalid. } } decpomdp->SetScopeForLRF(LRFidx, XSoI, ASoI, YSoI, OSoI); if(parser->IsAsynchronous() && !ASoILocal.empty()) parser->AddToLocalLRFActionScope(LRFidx,ASoILocal); } xmlXPathFreeObject (link_nodes); } /* FAO 2016-03-14, unused function, so commenting out. bool CompareParsedDependencies(pair p1, pair p2) { return p1.first < p2.first; } */ bool CompareParsedActions(pair p1, pair p2) { return p1.first < p2.first; } double ComputeTransitionProb(Index y, Index yVal, const std::vector< Index>& Xs, const std::vector< Index>& As, const std::vector< Index>& Ys, ParserProbModelXML* parser, const FactoredDecPOMDPDiscrete* decpomdp) { Scope XSoI = decpomdp->GetXSoI_Y(y); Scope ASoI; const std::vector< Index>* p_As = 0; std::vector< Index> AsLocal; if(!parser->IsAsynchronous()){ ASoI = decpomdp->GetASoI_Y(y); p_As = &As; } else if(As.size() > 0) { parser->ConvertToLocalSFActionScope(y,As[0],AsLocal,ASoI); p_As = &AsLocal; } Scope YSoI = decpomdp->GetYSoI_Y(y); map > t0_deps; map > t1_deps; for(size_t i = 0; i < Xs.size(); i++) { Index xi = XSoI[i]; string factor_name = decpomdp->GetStateFactorDiscrete(xi)->GetName(); t0_deps[factor_name] = make_pair(Xs[i], decpomdp->GetNrValuesForFactor(xi)); } if(p_As != 0) { for(size_t i = 0; i < p_As->size(); i++) { //Decision node names are not stored in the decpomdp: only the names of their values. Index ai = ASoI[i]; pair elm = make_pair(ParserProbModelXML::ACTION, ai); string factor_name = parser->GetParsedElementName(elm); size_t nrActions; if(!parser->IsAsynchronous()) nrActions = decpomdp->GetNrActions(ai); else nrActions = parser->GetLocalNrActions(ai); t0_deps[factor_name] = make_pair(p_As->at(i), nrActions); } } for(size_t i = 0; i < Ys.size(); i++) { Index yi = YSoI[i]; string factor_name = decpomdp->GetStateFactorDiscrete(yi)->GetName(); t1_deps[factor_name] = make_pair(Ys[i], decpomdp->GetNrValuesForFactor(yi)); } const StateFactorDiscrete* sf = decpomdp->GetStateFactorDiscrete(y); string sf_name = sf->GetName(); t1_deps[sf_name] = make_pair(yVal, decpomdp->GetNrValuesForFactor(y)); double_t p = parser->GetPotential(sf_name, t0_deps, t1_deps); if(DEBUG_PARSE) { cout << "Xs: "; for(size_t i = 0; i < Xs.size(); i++) cout << Xs[i] << " "; cout << "| As: "; if(!parser->IsAsynchronous()){ for(size_t i = 0; i < p_As->size(); i++) cout << p_As->at(i) << " "; }else{ for(size_t i = 0; i < AsLocal.size(); i++) cout << AsLocal[i] << " "; } cout << "| Ys: "; for(size_t i = 0; i < Ys.size(); i++) cout << Ys[i] << " "; cout << "| y=" << y << " | yVal=" << yVal << " | p = " << p << endl; } return p; } double ComputeObservationProb(Index o, Index oVal, const std::vector< Index>& Xs, const std::vector< Index>& As, const std::vector< Index>& Ys, const std::vector< Index>& Os, ParserProbModelXML* parser, const FactoredDecPOMDPDiscrete* decpomdp) { Scope XSoI = decpomdp->GetXSoI_O(o); Scope ASoI; const std::vector< Index>* p_As = 0; std::vector< Index> AsLocal; if(!parser->IsAsynchronous()){ ASoI = decpomdp->GetASoI_O(o); p_As = &As; } else if(As.size() > 0) { parser->ConvertToLocalObsActionScope(o,As[0],AsLocal,ASoI); p_As = &AsLocal; } Scope YSoI = decpomdp->GetYSoI_O(o); Scope OSoI = decpomdp->GetOSoI_O(o); map > t0_deps; map > t1_deps; if(p_As != 0) { for(size_t i = 0; i < p_As->size(); i++) { //Decision node names are not stored in the decpomdp: only the names of their values. Index ai = ASoI[i]; pair elm = make_pair(ParserProbModelXML::ACTION, ai); string factor_name = parser->GetParsedElementName(elm); size_t nrActions; if(!parser->IsAsynchronous()) nrActions = decpomdp->GetNrActions(ai); else nrActions = parser->GetLocalNrActions(ai); t0_deps[factor_name] = make_pair(p_As->at(i), nrActions); } } for(size_t i = 0; i < Xs.size(); i++) { Index xi = XSoI[i]; string factor_name = decpomdp->GetStateFactorDiscrete(xi)->GetName(); t0_deps[factor_name] = make_pair(Xs[i], decpomdp->GetNrValuesForFactor(xi)); } for(size_t i = 0; i < Ys.size(); i++) { Index yi = YSoI[i]; string factor_name = decpomdp->GetStateFactorDiscrete(yi)->GetName(); t1_deps[factor_name] = make_pair(Ys[i], decpomdp->GetNrValuesForFactor(yi)); } for(size_t i = 0; i < Os.size(); i++) { //Decision node names are not stored in the decpomdp: only the names of their values. Index oi = OSoI[i]; pair elm = make_pair(ParserProbModelXML::OBSERVATION, oi); string factor_name = parser->GetParsedElementName(elm); t1_deps[factor_name] = make_pair(Os[i], decpomdp->GetNrObservations(oi)); } pair elm = make_pair(ParserProbModelXML::OBSERVATION, o); string obs_name = parser->GetParsedElementName(elm); t1_deps[obs_name] = make_pair(oVal, decpomdp->GetNrObservations(o)); double p = parser->GetPotential(obs_name, t0_deps, t1_deps); if(DEBUG_PARSE) { cout << "Xs: "; for(size_t i = 0; i < Xs.size(); i++) cout << Xs[i] << " "; cout << "| As: "; for(size_t i = 0; i < As.size(); i++) cout << As[i] << " "; cout << "| Ys: "; for(size_t i = 0; i < Ys.size(); i++) cout << Ys[i] << " "; cout << "| Os: "; for(size_t i = 0; i < Os.size(); i++) cout << Os[i] << " "; cout << "| o=" << o << " | oVal=" << oVal << " | p = " << p << endl; } return p; } class ProbModelXMLScopeFunctor : public MultiAgentDecisionProcessDiscreteFactoredStates::ScopeFunctor { public: ProbModelXMLScopeFunctor(ParserProbModelXML* parser, FactoredDecPOMDPDiscrete* fdecpomdp) : _m_parser(parser), _m_fDecPOMDP(fdecpomdp){}; void operator()(){SetScopes(_m_parser,_m_fDecPOMDP);}; ParserProbModelXML* _m_parser; FactoredDecPOMDPDiscrete* _m_fDecPOMDP; }; class ProbModelXMLTransitionProbFunctor : public MultiAgentDecisionProcessDiscreteFactoredStates::TransitionProbFunctor { public: ProbModelXMLTransitionProbFunctor(ParserProbModelXML* parser, FactoredDecPOMDPDiscrete* fdecpomdp) : _m_parser(parser), _m_fDecPOMDP(fdecpomdp){}; double operator()(Index y, Index yVal, const std::vector< Index>& Xs, const std::vector< Index>& As, const std::vector< Index>& Ys) const {return ComputeTransitionProb (y,yVal,Xs,As,Ys,_m_parser,_m_fDecPOMDP);}; ParserProbModelXML* _m_parser; FactoredDecPOMDPDiscrete* _m_fDecPOMDP; }; class ProbModelXMLObservationProbFunctor : public MultiAgentDecisionProcessDiscreteFactoredStates::ObservationProbFunctor { public: ProbModelXMLObservationProbFunctor(ParserProbModelXML* parser, FactoredDecPOMDPDiscrete* fdecpomdp) : _m_parser(parser), _m_fDecPOMDP(fdecpomdp){}; double operator()(Index o, Index oVal, const std::vector< Index>& Xs, const std::vector< Index>& As, const std::vector< Index>& Ys, const std::vector< Index>& Os) const {return ComputeObservationProb (o,oVal,Xs,As,Ys,Os,_m_parser,_m_fDecPOMDP);}; ParserProbModelXML* _m_parser; FactoredDecPOMDPDiscrete* _m_fDecPOMDP; }; #endif } //Default constructor ParserProbModelXML::ParserProbModelXML(FactoredDecPOMDPDiscrete* problem) : _m_agentsInitialized(false), _m_fDecPOMDP(problem), _m_asynchronousModel(false) { if(DEBUG_PARSE) { cout << "Creating XML parser, referring to problem..."; cout << problem->MultiAgentDecisionProcess::SoftPrint(); cout << endl; } } #ifdef HAVE_LIBXML2 void ParserProbModelXML::InitializeXPath() { string pf = _m_fDecPOMDP->GetProblemFile(); const char* pf_c = pf.c_str(); _m_doc = xmlParseFile(pf_c); if(_m_doc == NULL) throw EParse("Could not open XML file."); _m_context = xmlXPathNewContext(_m_doc); //context for global lookups if (_m_context == NULL) { throw EParse("Could not retrieve context from XML file."); } } const xmlXPathObjectPtr ParserProbModelXML::GetNodesMatchingExpression(const xmlChar *expr, const xmlNodePtr context_node) { if(context_node != 0){ SetContext(context_node); } xmlXPathObjectPtr match = xmlXPathEvalExpression(expr, GetContext()); if (match == NULL) return NULL; if(xmlXPathNodeSetIsEmpty(match->nodesetval)) { xmlXPathFreeObject(match); return NULL; } if(context_node != 0){ ResetContext(); } return match; } string ParserProbModelXML::GetVariableName(const xmlNodePtr node) const { if(!xmlHasProp(node, (xmlChar*) "name")){ cout << "Warning: Attempted to extract the name of a nameless node" << endl; return ""; } string name = (char*) xmlGetProp(node, (xmlChar*) "name"); size_t pos = name.find_last_not_of(" \t"); //remove the [0]/[1] tag from the name if it exists (for older versions of OpenMarkov). if(pos <= name.length()-1 && pos > 0) { if(name[pos] == ']') name.erase(pos-2); } //remove remaining whitespace return StringTools::Trim(name); } int ParserProbModelXML::GetVariableTimeslice(const xmlNodePtr node) const { if(!xmlHasProp(node, (xmlChar*) "timeSlice")){ cout << "Warning: Attempted to extract the timeSlice of a time-less node. Defaulting to 0." << endl; return 0; } string timeslice = (char*) xmlGetProp(node, (xmlChar*) "timeSlice"); return atoi(timeslice.c_str()); } std::string ParserProbModelXML::GetVariableComment(const xmlNodePtr node) { //only works for plain text comments so far. string comment = ""; xmlXPathObjectPtr comment_node = GetNodesMatchingExpression((xmlChar*) "Comment",node); if(comment_node != NULL) { comment = (char*) xmlNodeListGetString(GetDoc(), comment_node->nodesetval->nodeTab[0]->xmlChildrenNode, 1); if(DEBUG_PARSE) { cout << "read comment: " << comment << endl; } xmlXPathFreeObject (comment_node); } return comment; } void ParserProbModelXML::ReadStates() { if(DEBUG_PARSE) { cout << " --- Now Parsing States ---" << endl; } xmlChar *xpath = (xmlChar*) "/ProbModelXML/ProbNet/Variables/Variable[@timeSlice='0' and @role='chance']"; xmlXPathObjectPtr state_nodes = GetNodesMatchingExpression(xpath); if (state_nodes == NULL) throw EParse("No state nodes found in target file."); xmlNodeSetPtr state_nodeset = state_nodes->nodesetval; for (int i = 0; i < state_nodeset->nodeNr; i++) { xmlXPathObjectPtr child_nodes = GetNodesMatchingExpression((xmlChar*) "States/State",state_nodeset->nodeTab[i]); if(child_nodes != NULL) { xmlNodeSetPtr child_nodeset = child_nodes->nodesetval; if(child_nodeset->nodeNr > 1) { string factorName = GetVariableName(state_nodeset->nodeTab[i]); if(DEBUG_PARSE) { cout << "Added state with name: " << factorName << endl; } Index sfI = _m_fDecPOMDP->AddStateFactor(factorName, GetVariableComment(state_nodeset->nodeTab[i])); for(int j = 0; j < child_nodeset->nodeNr; j++) { _m_fDecPOMDP->AddStateFactorValue(sfI, GetVariableName(child_nodeset->nodeTab[j])); if(DEBUG_PARSE) { cout << " Added value: " << GetVariableName(child_nodeset->nodeTab[j]) << endl; } } pair element = make_pair(STATE, i); _m_parsedElements[factorName] = element; } xmlXPathFreeObject (child_nodes); } } _m_fDecPOMDP->SetStatesInitialized(true); xmlXPathFreeObject (state_nodes); return; } void ParserProbModelXML::ReadAgents() { xmlChar *xpath = (xmlChar*) "/ProbModelXML/ProbNet/Agents/Agent"; xmlXPathObjectPtr agent_nodes = GetNodesMatchingExpression(xpath); if (_m_asynchronousModel || agent_nodes == NULL || agent_nodes->nodesetval->nodeNr < 2){ _m_fDecPOMDP->SetNrAgents(1); xmlXPathFreeObject (agent_nodes); _m_agentsInitialized = true; return; } xmlNodeSetPtr nodeset = agent_nodes->nodesetval; for (int i = 0; i < nodeset->nodeNr; i++) { _m_fDecPOMDP->AddAgent(GetVariableName(nodeset->nodeTab[i])); } xmlXPathFreeObject (agent_nodes); _m_agentsInitialized = true; return; } void ParserProbModelXML::ReadActions() { if(DEBUG_PARSE) { cout << " --- Now Parsing Actions ---" << endl; } xmlChar *xpath = (xmlChar*) "/ProbModelXML/ProbNet/Variables/Variable[@timeSlice='0' and @role='decision']"; xmlXPathObjectPtr action_nodes = GetNodesMatchingExpression(xpath); if (action_nodes == NULL) throw EParse("No action nodes found in target file."); xmlNodeSetPtr action_nodeset = action_nodes->nodesetval; if(!_m_agentsInitialized || _m_fDecPOMDP->GetNrAgents() != (unsigned) action_nodeset->nodeNr) { if(!_m_asynchronousModel){ //this is a failsafe for models with more than one action space factor, but no specified agents. cout << "Warning: The specified number of agents is different from the number of decision nodes." << endl; _m_fDecPOMDP->SetNrAgents(action_nodeset->nodeNr); _m_agentsInitialized = false; } } for (int i = 0; i < action_nodeset->nodeNr; i++) { Index aI; if(_m_agentsInitialized && _m_fDecPOMDP->GetNrAgents() > 1) { xmlXPathObjectPtr agent_node = GetNodesMatchingExpression((xmlChar*) "Agent",action_nodeset->nodeTab[i]); if(agent_node == NULL) throw EParse("Found an action node with no associated agent."); string agent_name = GetVariableName(agent_node->nodesetval->nodeTab[0]); aI = _m_fDecPOMDP->GetAgentIndexByName(agent_name); xmlXPathFreeObject (agent_node); } else { aI = i; } xmlXPathObjectPtr child_nodes = GetNodesMatchingExpression((xmlChar*) "States/State",action_nodeset->nodeTab[i]); if(child_nodes != NULL) { xmlNodeSetPtr child_nodeset = child_nodes->nodesetval; if(child_nodeset->nodeNr > 0) { string comment = GetVariableComment(action_nodeset->nodeTab[i]); for(int j = 0; j < child_nodeset->nodeNr; j++) { if(!_m_asynchronousModel) { _m_fDecPOMDP->AddAction(aI, GetVariableName(child_nodeset->nodeTab[j]), comment); if(DEBUG_PARSE) { cout << "Added action: " << GetVariableName(child_nodeset->nodeTab[j]) << " to agent " << aI << endl; } } else { if(_m_ASizes.size() <= aI) _m_ASizes.push_back(child_nodeset->nodeNr); if(_m_ANames.size() <= aI) _m_ANames.push_back(vector (1,GetVariableName(child_nodeset->nodeTab[j]))); else _m_ANames[aI].push_back(GetVariableName(child_nodeset->nodeTab[j])); } } pair element = make_pair(ACTION, aI); _m_parsedElements[GetVariableName(action_nodeset->nodeTab[i])] = element; } xmlXPathFreeObject (child_nodes); } } xmlXPathFreeObject (action_nodes); if(_m_asynchronousModel) { vector As(_m_ASizes.size(),0); do{ stringstream aName; for(size_t i = 0; i < As.size(); i++) { aName << _m_ANames[i][As[i]]; if(i+1 < As.size()) aName << "_"; } _m_fDecPOMDP->AddAction(0, aName.str()); if(DEBUG_PARSE) { cout << "Added action: " << aName.str() << " to agent 0" << endl; } } while(! IndexTools::Increment( As, _m_ASizes ) ); } // _m_fDecPOMDP->ConstructJointActions(); _m_fDecPOMDP->SetActionsInitialized(true); return; } void ParserProbModelXML::ReadObservations() { if(DEBUG_PARSE) { cout << " --- Now Parsing Observations ---" << endl; } xmlChar *xpath = (xmlChar*) "/ProbModelXML/ProbNet/Variables/Variable[@timeSlice='1' and @role='decision']"; xmlXPathObjectPtr action_nodes = GetNodesMatchingExpression(xpath); if (action_nodes == NULL){ cout << "Warning: No action nodes for the second timeslice were found in the target file. There are no observations in the model." << endl; return; } xmlNodeSetPtr action_nodeset = action_nodes->nodesetval; vector > parsed_actions; for (int i = 0; i < action_nodeset->nodeNr; i++) { Index aI; if(_m_agentsInitialized && _m_fDecPOMDP->GetNrAgents() > 1) { xmlXPathObjectPtr agent_node = GetNodesMatchingExpression((xmlChar*) "Agent",action_nodeset->nodeTab[i]); if(agent_node == NULL) throw EParse("Found an action node with no associated agent."); string agent_name = GetVariableName(agent_node->nodesetval->nodeTab[0]); aI = _m_fDecPOMDP->GetAgentIndexByName(agent_name); xmlXPathFreeObject (agent_node); } else { aI = i; } parsed_actions.push_back(make_pair(aI, action_nodeset->nodeTab[i])); } //Observations have to be loaded in agent-wise order sort(parsed_actions.begin(), parsed_actions.end(), CompareParsedActions); for (size_t i = 0; i < parsed_actions.size(); i++) { Index aI; if(_m_asynchronousModel) aI = 0; //asynchronous models are assumed to be centralized, for now. else aI = parsed_actions[i].first; //retrieving the nodes which link to each decision node for T+1 stringstream link_path_ss; link_path_ss << "/ProbModelXML/ProbNet/Links/Link/Variable[starts-with(@name, \"" << (char*) xmlGetProp(parsed_actions[i].second, (xmlChar*) "name") << "\") and @timeSlice='1']"; xmlXPathObjectPtr link_nodes = GetNodesMatchingExpression((xmlChar*) link_path_ss.str().c_str()); if(link_nodes != NULL) { xmlNodeSetPtr link_nodeset = link_nodes->nodesetval; if(link_nodeset->nodeNr > 1){ cout << "Warning: multiple obervation factors for one agent are not yet supported." << endl; } //For now, it is assumed that the observation model is factored agent-wise - that is, there is no more than one //chance node linked to each decision node in slice T+1. If support for this feature is needed, it should be added here. //Each link_nodeset->nodeTab element should represent one of the observation factors of agent i. xmlNodePtr parent_node = xmlFirstElementChild(link_nodeset->nodeTab[0]->parent); string parent_name = GetVariableName(parent_node); //now we must retrieve the original chance nodes with this name and parse them. stringstream obs_path_ss; obs_path_ss << "/ProbModelXML/ProbNet/Variables/Variable[(@name='" << parent_name << "' or @name='" << parent_name << " [1]') and @timeSlice='1' and @role='chance']"; string comment = GetVariableComment(parent_node); obs_path_ss << "/States/State"; xmlXPathObjectPtr obs_nodes = GetNodesMatchingExpression((xmlChar*) obs_path_ss.str().c_str()); if(obs_nodes != NULL) { xmlNodeSetPtr obs_nodeset = obs_nodes->nodesetval; for(int j = 0; j < obs_nodeset->nodeNr; j++) { string obs_name = GetVariableName(obs_nodeset->nodeTab[j]); _m_fDecPOMDP->AddObservation(aI, obs_name, comment); pair element = make_pair(OBSERVATION, aI); _m_parsedElements[GetVariableName(parent_node)] = element; if(DEBUG_PARSE) { cout << "Added observation: " << obs_name << " to agent " << aI << endl; } } xmlXPathFreeObject (obs_nodes); } xmlXPathFreeObject (link_nodes); } } xmlXPathFreeObject (action_nodes); _m_fDecPOMDP->SetObservationsInitialized(true); return; } const std::pair ParserProbModelXML::GetParsedElement(const std::string name) const { map >::const_iterator it = _m_parsedElements.find(name); if(it == _m_parsedElements.end()) { throw EParse("Requested undefined variable \"" + name + "\"."); } return it->second; } std::string ParserProbModelXML::GetParsedElementName(const std::pair elm) const { map >::const_iterator it; for(it = _m_parsedElements.begin(); it != _m_parsedElements.end(); it++) { if(elm == (*it).second) return (*it).first; } return " "; } void ParserProbModelXML::SetISD() { FSDist_COF* isd = new FSDist_COF(*_m_fDecPOMDP); for(size_t i = 0; i < _m_fDecPOMDP->GetNrStateFactors(); i++) { bool setUniform = false; string factor_name = _m_fDecPOMDP->GetStateFactorDiscrete(i)->GetName(); stringstream xpath_ss; xpath_ss << "/ProbModelXML/ProbNet/Potentials/Potential[@role='conditionalProbability']/Variables/Variable"; xpath_ss << "[starts-with(@name, \"" << factor_name << "\") and @timeSlice='0']"; xmlXPathObjectPtr isd_nodes = GetNodesMatchingExpression((xmlChar*) xpath_ss.str().c_str()); if(isd_nodes == NULL) { cout << "Warning: Variable " << factor_name << " has no ISD. Setting to uniform. " << endl; setUniform = true; } else { xmlNodeSetPtr isd_nodeset = isd_nodes->nodesetval; xmlNodePtr isd_node = isd_nodeset->nodeTab[0]; for(int j = 0; j < isd_nodeset->nodeNr; j++) { isd_node = isd_nodeset->nodeTab[j]; xmlNodePtr p = isd_node->parent; if(xmlChildElementCount(p) == 1) break; //ISD nodes are one-dimensional arrays } if(xmlChildElementCount(isd_node->parent) != 1) { cout << "Warning: Variable " << factor_name << " has no ISD. Setting to uniform. " << endl; setUniform = true; } string CPD_type = (char*) xmlGetProp(isd_node->parent->parent, (xmlChar*) "type"); //Potential if(CPD_type == "Table") { xmlNodePtr data_node = FindChild(isd_node->parent->parent, "Values"); if(data_node == NULL) throw EParse("Variable " + factor_name + " has an empty ISD"); const vector* dist = ParseArray(data_node); for(size_t j = 0; j < dist->size(); j++) { isd->SetProbability(i, j, dist->at(j)); } } else if(CPD_type == "Uniform") { setUniform = true; } else if(CPD_type == "Tree/ADD") { throw EParse("At variable " + factor_name + ": CPD type \"" + CPD_type + "\" not allowed for initial belief."); } } if(setUniform) { size_t n = _m_fDecPOMDP->GetNrValuesForFactor(i); for(size_t j = 0; j < n; j++) { isd->SetProbability(i, j, 1.0/(float) n); } } xmlXPathFreeObject (isd_nodes); } isd->SanityCheck(); _m_fDecPOMDP->SetISD(isd); return; } double ParserProbModelXML::GetPotential(const std::string var_name, const std::map > t0_deps, const std::map > t1_deps, const bool isUtility) { stringstream xpath_ss; xmlXPathObjectPtr var_nodes; xpath_ss << "/ProbModelXML/ProbNet/Potentials/Potential"; if(!isUtility) { xpath_ss << "[@role='conditionalProbability']/Variables/Variable[@timeSlice='1' and contains(@name, \"" << var_name << "\")]"; } else { xpath_ss << "[@role='utility']/UtilityVariable[starts-with(@name, \"" << var_name << "\")]/following-sibling::Variables/Variable"; } var_nodes = GetNodesMatchingExpression((xmlChar*) xpath_ss.str().c_str()); if(var_nodes == NULL) throw EParse("Could not find CPD for variable " + var_name); xmlNodeSetPtr var_nodeset = var_nodes->nodesetval; xmlNodePtr top = var_nodeset->nodeTab[0]; if(!isUtility) { bool cpd_found = false; for(int i = 0; !cpd_found && i < var_nodeset->nodeNr; i++) { top = var_nodeset->nodeTab[i]; cpd_found = (top == xmlFirstElementChild(top->parent) && GetVariableName(top) == var_name); //this prevents possible partial matchings in the variable name } if(!cpd_found) throw EParse("Could not find CPD for variable " + var_name + "(empty potential)"); } xmlNodePtr parent = top->parent->parent; string CPD_type = (char*) xmlGetProp(parent, (xmlChar*) "type"); //Potential if(CPD_type == "Uniform") { map >::const_iterator it = t1_deps.find(var_name); double p = 1.0/(it->second.second); if(DEBUG_PARSE) { cout << "Output: " << var_name << "=" << it->second.first << " | Input: Uniform | " << "p=" << p << endl; } xmlXPathFreeObject (var_nodes); return p; } else if(CPD_type == "Table") { double p = QueryTable(parent, t0_deps, t1_deps); xmlXPathFreeObject (var_nodes); return p; } else if(CPD_type == "Tree/ADD") { double p = QueryADD(parent, parent, t0_deps, t1_deps); xmlXPathFreeObject (var_nodes); return p; } else { throw EParse("CPD type \"" + CPD_type + "\" not supported."); } } xmlNodePtr ParserProbModelXML::FindChild(const xmlNodePtr node, const std::string child) const { xmlNodePtr cur = xmlFirstElementChild(node); while(cur != NULL && strcmp((char*) cur->name,child.c_str())) cur = cur->next; return cur; } double ParserProbModelXML::QueryADD(const xmlNodePtr root_node, const xmlNodePtr current_node, const std::map > t0_deps, const std::map > t1_deps) { //find top variable xmlNodePtr top = FindChild(current_node, "TopVariable"); if(top == NULL) throw EParse("Incorrectly specified Tree/ADD (no top variable)."); string top_name = GetVariableName(top); int timeslice = GetVariableTimeslice(top); map >::const_iterator it; if(timeslice == 0){ it = t0_deps.find(top_name); if(it == t0_deps.end()) { throw EParse("Top variable " + top_name + " not present in dependencies."); } } else { it = t1_deps.find(top_name); if(it == t1_deps.end()) { throw EParse("Top variable " + top_name + " not present in dependencies."); } } Index value = it->second.first; //the (integer) value of the requested top variable std::pair elm = GetParsedElement(top_name); string value_name; switch(elm.first) { case STATE: value_name = _m_fDecPOMDP->GetStateFactorDiscrete(elm.second)->GetStateFactorValue(value); break; case ACTION: if(!_m_asynchronousModel) value_name = _m_fDecPOMDP->GetAction(elm.second, value)->GetName(); else value_name = _m_ANames[elm.second][value]; break; case OBSERVATION: value_name = _m_fDecPOMDP->GetObservation(elm.second, value)->GetName(); break; default: throw EParse("Variable " + top_name + " has unrecognized dependencies."); break; } xmlNodePtr branch_set = FindChild(current_node, "Branches"); if(branch_set == NULL) throw EParse("Incorrectly specified Tree/ADD (no branches)."); xmlNodePtr branch = xmlFirstElementChild(branch_set); bool found_branch = false; while(branch != NULL && !found_branch) { if(branch->type == XML_ELEMENT_NODE) { xmlNodePtr states = FindChild(branch, "States"); if(xmlChildElementCount(states) == 0) { found_branch = true; } else { xmlNodePtr var_state = xmlFirstElementChild(states); while(var_state != NULL && !found_branch) { if(var_state->type == XML_ELEMENT_NODE) { string var_name = GetVariableName(var_state); if(value_name == var_name) { found_branch = true; } } var_state = var_state->next; } } if(found_branch) { //Check if it is a reference to another branch xmlNodePtr reference = FindChild(branch, "Reference"); if(reference != NULL) { string ref_name((char*) xmlNodeListGetString(GetDoc(), reference->xmlChildrenNode, 1)); string xpath_str = ".//Branch/Label[contains(.,'"+ref_name+"')]"; xmlXPathObjectPtr label_nodes = GetNodesMatchingExpression((xmlChar*) xpath_str.c_str(),root_node); if(label_nodes == NULL) { throw EParse("Label \"" + ref_name + "\" not found."); } else if(label_nodes->nodesetval->nodeNr > 1) { throw EParse("Label \"" + ref_name + "\" defined multiple times."); } branch = label_nodes->nodesetval->nodeTab[0]->parent; } xmlNodePtr potential = FindChild(branch, "Potential"); if(potential != NULL) { string CPD_type = (char*) xmlGetProp(potential, (xmlChar*) "type"); if(CPD_type == "Tree/ADD") { return QueryADD(root_node, potential, t0_deps, t1_deps); } else if(CPD_type == "Table") { return QueryTable(potential, t0_deps, t1_deps); } else if(CPD_type == "Uniform") { map >::const_iterator it; xmlNodePtr dep_var = FindChild(FindChild(potential, "Variables"), "Variable"); string dep_var_name = GetVariableName(dep_var); int dep_var_time = GetVariableTimeslice(dep_var); if(dep_var_time == 0) { it = t0_deps.find(dep_var_name); } else { it = t1_deps.find(dep_var_name); } return 1.0/(float) it->second.second; } else { throw EParse("CPD type \"" + CPD_type + "\" not supported."); } } } } branch = branch->next; } throw EParse("Probability under top variable " + top_name + " not found."); } double ParserProbModelXML::QueryTable(const xmlNodePtr node, const std::map > t0_deps, const std::map > t1_deps) { xmlNodePtr data_node = FindChild(node, "Values"); if(data_node == NULL) throw EParse("Variable " + GetVariableName(node) + " has an empty CPD"); const vector* data = ParseArray(data_node); if(data->size() == 1) //typically the case for rewards in ADDs return data->at(0); xmlNodePtr current = xmlLastElementChild(FindChild(node, "Variables")); vector factor_values; vector factor_sizes; map >::const_iterator it; for(Index i = 0; current != NULL;) { if(current->type == XML_ELEMENT_NODE) { int timeslice = GetVariableTimeslice(current); string name = GetVariableName(current); if(timeslice == 0) { it = t0_deps.find(name); } else { it = t1_deps.find(name); } if(it == t0_deps.end() || it == t1_deps.end()) { throw EParse("Requested variable \"" + name + "\" which is not present in the dependencies of this CPT."); } factor_values.push_back(it->second.first); factor_sizes.push_back(it->second.second); i++; } current = current->prev; } Index jIdx = IndexTools::IndividualToJointIndices(factor_values, factor_sizes); if(jIdx < data->size()) { return data->at(jIdx); } else { stringstream ss; ss << "CPD indexed value for variable " << GetVariableName(node) << " out of bounds"; throw EParse(ss.str()); } } const vector* ParserProbModelXML::ParseArray(const xmlNodePtr node) { if(_m_arrayCache.count(node) == 0) { //need to create new array vector* p = new vector(); stringstream data; data << (char*) xmlNodeListGetString(GetDoc(), node->xmlChildrenNode, 1); double d; while(!data.eof()) { data >> skipws >> d; p->push_back(d); } _m_arrayCache[node] = p; } return _m_arrayCache[node]; } void ParserProbModelXML::InitializeLRFs() { xmlChar *xpath = (xmlChar*) "/ProbModelXML/ProbNet/Variables/Variable[@role='utility']"; xmlXPathObjectPtr reward_nodes = GetNodesMatchingExpression(xpath); if(reward_nodes == NULL){ throw EParse("No reward variables found in the model."); } xmlNodeSetPtr reward_nodeset = reward_nodes->nodesetval; for(int i = 0; i < reward_nodeset->nodeNr; i++) { string name = GetVariableName(reward_nodeset->nodeTab[i]); pair element = make_pair(REWARD, i); _m_parsedElements[name] = element; } _m_fDecPOMDP->SetNrLRFs(reward_nodeset->nodeNr); xmlXPathFreeObject (reward_nodes); } void ParserProbModelXML::ReadLRFs() { _m_fDecPOMDP->InitializeInstantiationInformation(); xmlChar *xpath = (xmlChar*) "/ProbModelXML/ProbNet/Potentials/Potential[@role='utility']"; xmlXPathObjectPtr reward_potentials = GetNodesMatchingExpression(xpath); if(reward_potentials == NULL){ throw EParse("No reward potentials found in the model."); } xmlNodeSetPtr potentials_nodeset = reward_potentials->nodesetval; for(int i = 0; i < potentials_nodeset->nodeNr; i++) { xmlXPathObjectPtr utility_var_node = GetNodesMatchingExpression((xmlChar*) "UtilityVariable",potentials_nodeset->nodeTab[i]); if(utility_var_node == NULL) throw EParse("Found a reward table node with no codomain."); string utility_var_name = GetVariableName(utility_var_node->nodesetval->nodeTab[0]); std::pair elm; elm = GetParsedElement(utility_var_name); if(elm.first != REWARD) throw EParse("Found a reward table defined over non-reward variable \"" + utility_var_name + "\"."); Index LRFix = elm.second; //LRF index xmlXPathObjectPtr vars = GetNodesMatchingExpression((xmlChar*) "Variables/Variable",potentials_nodeset->nodeTab[i]); xmlNodeSetPtr var_nodeset = vars->nodesetval; Scope X, A, Y, O; vector Xs, As, Ys, Os; vector* > ptr_values; vector factor_sizes; vector factor_names; vector factor_times; int nValues = 1; for(int j = var_nodeset->nodeNr-1; j >= 0; j--) //have to store everything bottom-up { size_t size; xmlNodePtr node = var_nodeset->nodeTab[j]; string var_name = GetVariableName(node); elm = GetParsedElement(var_name); switch(elm.first) { case STATE: { int timeslice = GetVariableTimeslice(node); size = _m_fDecPOMDP->GetNrValuesForFactor(elm.second); if(timeslice == 0) { X.Insert(elm.second); ptr_values.push_back(&Xs); factor_times.push_back(0); } else { Y.Insert(elm.second); ptr_values.push_back(&Ys); factor_times.push_back(1); } } break; case ACTION: if(!_m_asynchronousModel){ size = _m_fDecPOMDP->GetNrActions(elm.second); }else{ size = _m_ASizes[elm.second]; } A.Insert(elm.second); ptr_values.push_back(&As); factor_times.push_back(0); break; case OBSERVATION: if(!_m_asynchronousModel) size = _m_fDecPOMDP->GetNrObservations(elm.second); else size = _m_fDecPOMDP->GetNrObservations(0); O.Insert(elm.second); ptr_values.push_back(&Os); factor_times.push_back(1); break; default: throw EParse("Reward \"" + utility_var_name + "\" depends on unrecognized factors."); } factor_names.push_back(var_name); factor_sizes.push_back(size); nValues *=size; } vector factor_values(factor_names.size(), 0); const Scope& sfSC = _m_fDecPOMDP->GetStateFactorScopeForLRF(LRFix); const Scope& agSC = _m_fDecPOMDP->GetAgentScopeForLRF(LRFix); string sf_descr = sfSC.SoftPrint(); string ag_descr = agSC.SoftPrint(); size_t nrXIs = _m_fDecPOMDP->GetNrXIs(LRFix); size_t nrAIs = _m_fDecPOMDP->GetNrAIs(LRFix); RewardModelMapping* RMe = new RewardModelMapping(nrXIs, nrAIs, sf_descr, ag_descr); _m_fDecPOMDP->SetRM(LRFix, RMe); map > t0_deps; map > t1_deps; for(int j = 0; j < nValues; j++) { for(size_t k = 0; k < factor_names.size(); k++) { if(factor_times[k] == 0) t0_deps[factor_names[k]] = make_pair(factor_values[k], factor_sizes[k]); else t1_deps[factor_names[k]] = make_pair(factor_values[k], factor_sizes[k]); } double r = GetPotential(utility_var_name, t0_deps, t1_deps, true); for(size_t k = 0; k < ptr_values.size(); k++) { ptr_values[k]->push_back(factor_values[k]); } if(!_m_asynchronousModel) _m_fDecPOMDP->SetRewardForLRF(LRFix, X, Xs, A, As, Y, Ys, O, Os, r); else{ Scope jaScope; jaScope.Insert(0); if(As.size() > 0){ ///now we have to go over all joint actions which map to A, As... vector AsAll(_m_ASizes.size(), 0); vector r_AsAll = _m_ASizes; for(size_t i = 0; i < A.size(); i++){ r_AsAll[A[i]] = 1; ///this prevents Increment from going over the variables already in the scope. AsAll[A[i]] = As[i]; } do{ Index jaI = IndexTools::IndividualToJointIndices(AsAll,_m_ASizes); _m_fDecPOMDP->SetRewardForLRF(LRFix, X, Xs, jaScope, vector(1,jaI), Y, Ys, O, Os, r); }while(! IndexTools::Increment( AsAll, r_AsAll )); } else { _m_fDecPOMDP->SetRewardForLRF(LRFix, X, Xs, Scope(), vector(), Y, Ys, O, Os, r); } } Xs.clear(); As.clear(); Ys.clear(); Os.clear(); if(DEBUG_PARSE) { cout << "X: " << X.SoftPrint() << "->"; for(size_t k = 0; k < Xs.size(); k++) cout << Xs[k] << " "; cout << endl << "Y: " << Y.SoftPrint() << "->"; for(size_t k = 0; k < Ys.size(); k++) cout << Ys[k] << " "; cout << endl << "A: " << A.SoftPrint() << "->"; for(size_t k = 0; k < As.size(); k++) cout << As[k] << " "; cout << endl << "O: " << O.SoftPrint() << "->"; for(size_t k = 0; k < Os.size(); k++) cout << Os[k] << " "; cout << endl; cout << "LRF " << LRFix << " has sf scope " << sf_descr << " and ag scope " << ag_descr << " and for indexes "; for(size_t k = 0; k < factor_values.size(); k++) cout << factor_values[k] << " "; cout << "it has reward " << r << endl; } IndexTools::Increment(factor_values, factor_sizes); } xmlXPathFreeObject (utility_var_node); xmlXPathFreeObject (vars); } xmlXPathFreeObject (reward_potentials); } void ParserProbModelXML::ReadProperties() { xmlChar *xpath = (xmlChar*) "/ProbModelXML/ProbNet/AdditionalProperties/Property"; xmlXPathObjectPtr properties = GetNodesMatchingExpression(xpath); if(properties == NULL) return; ///Properties are optional. xmlNodeSetPtr properties_nodeset = properties->nodesetval; for(int i = 0; i < properties_nodeset->nodeNr; i++) { string property_name = GetVariableName(properties->nodesetval->nodeTab[i]); if(property_name == "EventDriven"){ string value = (char*) xmlGetProp(properties->nodesetval->nodeTab[i], (xmlChar*) "value"); _m_asynchronousModel = (value != "0"); }else{ //Additional properties go here. } } xmlXPathFreeObject (properties); } void ParserProbModelXML::ConvertToLocalSFActionScope(Index sfI, Index aI, vector& AValues, Scope& AScope) { try{ AScope = _m_AScopes_Y.at(sfI); } catch(E& e) { e.Print(); } vector allAValues = IndexTools::JointToIndividualIndices(aI, _m_ASizes); AValues.clear(); for(size_t i = 0; i < AScope.size(); i++) AValues.push_back(allAValues.at(AScope[i])); } void ParserProbModelXML::ConvertToLocalObsActionScope(Index oI, Index aI, vector& AValues, Scope& AScope) { try{ AScope = _m_AScopes_O.at(oI); } catch(E& e) { e.Print(); } vector allAValues = IndexTools::JointToIndividualIndices(aI, _m_ASizes); AValues.clear(); for(size_t i = 0; i < AScope.size(); i++) AValues.push_back(allAValues.at(AScope[i])); } void ParserProbModelXML::AddToLocalSFActionScope(Index sfI, Scope AScope) { while(_m_AScopes_Y.size() <= sfI) _m_AScopes_Y.push_back(Scope()); _m_AScopes_Y[sfI].Insert(AScope); } void ParserProbModelXML::AddToLocalObsActionScope(Index oI, Scope AScope) { while(_m_AScopes_O.size() <= oI) _m_AScopes_O.push_back(Scope()); _m_AScopes_O[oI].Insert(AScope); } void ParserProbModelXML::AddToLocalLRFActionScope(Index lrfI, Scope AScope) { while(_m_AScopes_LRF.size() <= lrfI) _m_AScopes_LRF.push_back(Scope()); _m_AScopes_LRF[lrfI].Insert(AScope); } #endif //Main program void ParserProbModelXML::Parse() { #ifdef HAVE_LIBXML2 xmlInitParser(); //Parse try{ InitializeXPath(); ReadProperties(); ReadAgents(); ReadStates(); ReadActions(); ReadObservations(); InitializeLRFs(); ProbModelXMLScopeFunctor sf(this,_m_fDecPOMDP); ProbModelXMLTransitionProbFunctor tf(this,_m_fDecPOMDP); ProbModelXMLObservationProbFunctor of(this,_m_fDecPOMDP); _m_fDecPOMDP->SetEventObservability(_m_asynchronousModel); _m_fDecPOMDP->Initialize2DBN(sf,tf,of); SetISD(); ReadLRFs(); xmlXPathFreeContext(GetContext()); if(DEBUG_PARSE) cout << ">>>Parsing succeeded\n"; } catch(E& e) { e.Print(); } xmlCleanupParser(); if(DEBUG_PARSE) cout << "-------------------------\n"; #else throw(E("ParserProbModelXML: not compiled with libxml2 support")); #endif return; } madp-0.4/src/parser/PaxHeaders.5405/ParserDPOMDPFormat_Spirit.cpp0000644000000000000000000000013112717644275021420 xustar0030 mtime=1463765181.693707444 29 atime=1463765181.68170754 30 ctime=1463765201.793546909 madp-0.4/src/parser/ParserDPOMDPFormat_Spirit.cpp0000664000372100037210000012522212717644275022261 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * * For contact information please see the included AUTHORS file. */ #include "ParserDPOMDPFormat_Spirit.h" using namespace std; namespace DPOMDPFormatParsing{ /**Outputs the file_position structure info (gotten from * postion_iterator::get_position() ). */ std::ostream& operator<<(std::ostream& out, file_position const& lc) { return out << "\nFile:\t" << lc.file << "\nLine:\t" << lc.line << "\nCol:\t" << lc.column << endl; } //Default constructor ParserDPOMDPFormat_Spirit::ParserDPOMDPFormat_Spirit(DecPOMDPDiscrete* problem) : // UNIFORMTOK(this), _m_decPOMDPDiscrete(problem) { if(DEBUG_PARSE) { cout << "Creating parser, referring to problem..."; cout << problem->MultiAgentDecisionProcess::SoftPrint(); cout << endl; } //need to reset the parse matrix the first time... _m_matrixModified = true; _m_identListModified = false; _m_startStateListExclude = false; _m_nrA = 0; // UNIFORMTOK = uniformtok(this); } /* //Copy assignment constructor. ParserDPOMDPFormat_Spirit::ParserDPOMDPFormat_Spirit(const ParserDPOMDPFormat_Spirit& o) { } //Destructor ParserDPOMDPFormat_Spirit::~ParserDPOMDPFormat_Spirit() { } */ /* bool ParserDPOMDPFormat_Spirit::Parse() { string pf = GetDecPOMDPDiscrete()->GetProblemFile(); } void ParserDPOMDPFormat_Spirit::FileTest() { string pf = GetDecPOMDPDiscrete()->GetProblemFile(); const char* pf_c = pf.c_str(); cout << "pf_c is \""<> str) cout << "\"" << str<<"\""<GetProblemFile(); const char* pf_c = pf.c_str(); // Create a file iterator for this file iterator_t_fi first_fi(pf_c); if (!first_fi) { stringstream ss; ss << "Unable to open file: "< info; // Parse try{ // Spirit changed when upgrading from 1.33.1 to 1.34.0: // trailing spaces are no longer accepted, which the next line // to fail on some problems (those with trailing comments). Adding // ">> !end_p" to the grammar works around this problem. info = parse(first, last , dpomdp >> !end_p, skip_parser); if (info.full) { if(DEBUG_PARSE) cout << ">>>Parsing succeeded\n"; } else { iterator_t st = info.stop; iterator_t st2 = info.stop; for(Index i=1;i<200 && st2 != last ;i++)st2++; string unparsed(st, st2); cout << "stopped at: " << info.stop.get_position() << "-> unparsed : "<< "\"" << unparsed << "\"\n"; cout << "partial match? hit: \"" << info.hit << "\"\n"; cout << "consumed chars - length: \"" << info.length << "\"\n"; throw E("Parsing failed"); } } catch(E& e) { e.Print(); } if(DEBUG_PARSE) cout << "-------------------------\n"; return; } //used functor functions: void ParserDPOMDPFormat_Spirit::DebugOutput::operator()(iterator_t str, iterator_t end) const { if(DEBUG_PARSE) cout << s <<" parsed \"" << string(str,end) << "\""<_m_lp_int = i; _m_po->_m_lp_type = INT; } void ParserDPOMDPFormat_Spirit::StoreLastParsedElement::operator()(const unsigned int i) const { if(DEBUG_PARSE) cout << "Stored Last Parsed: uint "<_m_lp_uint = i; _m_po->_m_lp_type = UINT; } void ParserDPOMDPFormat_Spirit::StoreLastParsedElement::operator()(const double f) const { if(DEBUG_PARSE) cout << "Stored Last Parsed: double "<_m_lp_double = f; _m_po->_m_lp_type = DOUBLE; } void ParserDPOMDPFormat_Spirit::StoreLastParsedElement::operator()(iterator_t str, iterator_t end) const { _m_po->_m_lp_string.clear(); _m_po->_m_lp_string = string(str, end); if(DEBUG_PARSE) cout << "Stored Last Parsed: string "<< _m_po->_m_lp_string << endl; _m_po->_m_lp_type = STRING; } void ParserDPOMDPFormat_Spirit::SetNrAgents::operator()(iterator_t first, iterator_t last) const { if (_m_po->_m_lp_type != UINT) { stringstream msg; msg << "SetNrAgents::operator()(iterator_t first, iterator_t last) requires that last parsed element is a UINT!"<< "(at " << _m_po->_m_first->get_position() << ")" << endl; throw EParse(msg); } size_t nrA = _m_po->_m_lp_uint; if(DEBUG_PARSE){cout <<"agt_SetNrAgents - nrA="<GetDecPOMDPDiscrete()->SetNrAgents(nrA); _m_po->_m_nrA = nrA; } void ParserDPOMDPFormat_Spirit::SetNrAgents::operator()(const int& i) const { if(DEBUG_PARSE){cout << "i="<_m_lp_JA.push_back(_m_po->_m_anyJAIndex); } } /* void ParserDPOMDPFormat_Spirit::StoreLPJointAction::operator()(iterator_t str, iterator_t end) const { _m_po->_m_lp_JAI.clear(); if(_m_isJointActionIndex) { //_m_lp_JA not necessary: clear it. _m_po->_m_lp_JA.clear(); _m_po->_m_lp_JAI.push_back(_m_po->_m_lp_int); return; } try{ MatchingJointActions(0,_m_po->_m_lp_JA); } catch(E e) { file_position fp = str.get_position(); stringstream ermsg; ermsg << e.SoftPrint() << endl << "(at " << fp << ")"<_m_lp_JA.clear(); } void ParserDPOMDPFormat_Spirit::StoreLPJointAction::operator()(const unsigned int&) const { _m_po->_m_lp_JAI.clear(); if(_m_isJointActionIndex) { //_m_lp_JA not necessary: clear it. _m_po->_m_lp_JA.clear(); _m_po->_m_lp_JAI.push_back(_m_po->_m_lp_int); return; } MatchingJointActions(0,_m_po->_m_lp_JA); _m_po->_m_lp_JA.clear(); } */ void ParserDPOMDPFormat_Spirit::StoreLPJointAction::Store() const { _m_po->_m_lp_JAI.clear(); //check to see if the last parsed index was a joint action index if(_m_isJointActionIndex) { //_m_lp_JA not necessary: clear it. _m_po->_m_lp_JA.clear(); //do check that the last parsed element was a index (uint) if (_m_po->_m_lp_type != UINT) { stringstream msg; msg << "StoreLPJointAction::Store() requires that last parsed element is a UINT! (last parsed index was a joint action index)"<< endl; throw EParse(msg); } _m_po->_m_lp_JAI.push_back(_m_po->_m_lp_uint); return; } MatchingJointActions(0,_m_po->_m_lp_JA); _m_po->_m_lp_JA.clear(); } void ParserDPOMDPFormat_Spirit::StoreLPJointAction::MatchingJointActions (Index curAgent, vector indIndices) const { if(_m_po->_m_nrA != indIndices.size()) { stringstream msg; msg << "individual indices vector has wrong size. ("<< indIndices.size() << " while nrAgents is " << _m_po->_m_nrA << ")"<< "at(" << _m_po->_m_first->get_position() << ")" << endl;; throw EParse(msg); } if(curAgent == _m_po->_m_nrA) //past last agent: all work done { Index jaI = 0; try { jaI = _m_po->GetDecPOMDPDiscrete()->IndividualToJointActionIndices( indIndices); _m_po->_m_lp_JAI.push_back(jaI); } catch(E e) { stringstream ss; ss << e.SoftPrint() << "(at "<< _m_po->_m_first-> get_position()<<")"<::iterator it = indIndices.begin(); vector::iterator last = indIndices.end(); while(it != last){ cout << *it <<" "; it++;} cout << "> = "<_m_anyJAIndex) { //do for each action of this agent size_t nrAc = _m_po->GetDecPOMDPDiscrete()->GetNrActions(curAgent); for(Index ai=0; ai < nrAc; ai++) { indIndices[curAgent] = ai; MatchingJointActions(curAgent+1, indIndices); } } else MatchingJointActions(curAgent+1, indIndices); } } void ParserDPOMDPFormat_Spirit::WildCardJointObservation::operator()(iterator_t str, iterator_t end) const { if(DEBUG_PARSE ) cout << "WildCardJointObservation: _m_lp_JOI.size()="<<_m_po->_m_lp_JOI.size(); //this (can) contain elements from a failed indiv_action parse. _m_po->_m_lp_JO.clear(); _m_po->_m_lp_JOI.clear(); //this is different from how we handle joint actions: joint actions are //immediately expanded (i.e. '*'/ANY_INDEX is replaced by all matching //indices.) //For joint observations, this is not practical, as for most common reward //forms, this is not required. I.e., one will typically specify //R: ja : s : * : * : prob //then we want to call addReward(ja,s) and not expand the succesor states //and joint observations... _m_po->_m_lp_JOI.push_back(_m_po->_m_anyJOIndex); } /* void ParserDPOMDPFormat_Spirit::StoreLPJointObservation::operator()(const unsigned int&) const { Store(); } void ParserDPOMDPFormat_Spirit::StoreLPJointObservation::operator()(iterator_t str, iterator_t end) const { Store(); } */ void ParserDPOMDPFormat_Spirit::StoreLPJointObservation::Store() const { _m_po->_m_lp_JOI.clear(); if(_m_isJointObservationIndex) //as opposed to parsing individual indices { //_m_lp_JO not necessary: clear it. _m_po->_m_lp_JO.clear(); //do check that the last parsed element was a index (uint) if (_m_po->_m_lp_type != UINT) { stringstream msg; msg << "StoreLPJointObservation::Store() requires that last parsed element is a UINT! (last parsed index was a joint action index)"<< endl; throw EParse(msg); } _m_po->_m_lp_JOI.push_back(_m_po->_m_lp_uint); return; } MatchingJointObservations(0,_m_po->_m_lp_JO); _m_po->_m_lp_JO.clear(); } /* void ParserDPOMDPFormat_Spirit::StoreLPJointObservation::operator()(iterator_t str, iterator_t end) const { _m_po->_m_lp_JOI.clear(); if(_m_isJointObservationIndex) //as opposed to parsing individual indices { //_m_lp_JO not necessary: clear it. _m_po->_m_lp_JO.clear(); _m_po->_m_lp_JOI.push_back(_m_po->_m_lp_int); return; } try{ MatchingJointObservations(0,_m_po->_m_lp_JO); } catch(E e) { stringstream ermsg; ermsg << e.SoftPrint() << endl << "(at " << str.get_position() << ")"<_m_lp_JO.clear(); } */ void ParserDPOMDPFormat_Spirit::StoreLPJointObservation::MatchingJointObservations (Index curAgent, vector indIndices) const { if(_m_po->_m_nrA != indIndices.size()) { stringstream msg; msg << "individual obs indices vector has wrong size. ("<_m_nrA << ")" << "at(" << _m_po->_m_first->get_position() << ")" << endl;; throw EParse(msg); } if(curAgent == _m_po->_m_nrA) //past last agent: all work done { Index joI = 0; try { joI = _m_po->GetDecPOMDPDiscrete()->IndividualToJointObservationIndices( indIndices); _m_po->_m_lp_JOI.push_back(joI); } catch(E e) { stringstream ss; ss <_m_first->get_position() << ")" << endl; throw EParse(ss); } if(DEBUG_PARSE) { cout<<"MatchingJointObservations: joint observation index for < "; vector::iterator it = indIndices.begin(); vector::iterator last = indIndices.end(); while(it != last){ cout << *it <<" "; it++;} cout << "> = "<_m_anyJOIndex) { //do for each action of this agent size_t nrObs = _m_po->GetDecPOMDPDiscrete()->GetNrObservations(curAgent); for(Index oi=0; oi < nrObs; oi++) { indIndices[curAgent] = oi; MatchingJointObservations(curAgent+1, indIndices); } } else MatchingJointObservations(curAgent+1, indIndices); } } void ParserDPOMDPFormat_Spirit::StoreLPFromState::operator()(iterator_t str, iterator_t end) const { if(DEBUG_PARSE) cout << "StoreLPFromState: pushing "<_m_lp_sI"<_m_lp_fromSI.clear(); if(_m_po->_m_lp_type == UINT) { unsigned int index = _m_po->_m_lp_uint; size_t nrS = _m_po->GetDecPOMDPDiscrete()->GetNrStates(); if(index >= nrS) { stringstream ss; ss<<"StoreLPFromState: '"<< index<< "' is not a valid state index!? Number of states is " << nrS <<" (at " <_m_lp_fromSI.push_back( _m_po->_m_lp_uint ); } else if(_m_po->_m_lp_type == STRING) { try { Index sI = _m_po->GetDecPOMDPDiscrete()->GetStateIndexByName( _m_po->_m_lp_string); _m_po->_m_lp_fromSI.push_back(sI); } catch(E e) { stringstream ermsg; ermsg << e.SoftPrint() << " (at " << str.get_position() << ")"<_m_lp_type == ASTERICK ) _m_po->_m_lp_fromSI.push_back(_m_po->_m_anyStateIndex); else throw E("StoreLPFromState expected that the last parsed type is a state index(uint), state name (string) or wilcard ('*')."); } void ParserDPOMDPFormat_Spirit::StoreLPToState::operator()(iterator_t str, iterator_t end) const { if(DEBUG_PARSE) cout << "StoreLPToState: pushing "<_m_lp_sI"<_m_lp_toSI.clear(); if(_m_po->_m_lp_type == UINT) { unsigned int index = _m_po->_m_lp_uint; size_t nrS = _m_po->GetDecPOMDPDiscrete()->GetNrStates(); if(index >= nrS) { stringstream ss; ss<<"StoreLPToState: '"<< index<< "' is not a valid state index!? Number of states is " << nrS <<" (at " <_m_lp_toSI.push_back( _m_po->_m_lp_uint ); } else if(_m_po->_m_lp_type == STRING) { try { Index sI = _m_po->GetDecPOMDPDiscrete()->GetStateIndexByName( _m_po->_m_lp_string); _m_po->_m_lp_toSI.push_back(sI); } catch(E e) { stringstream ermsg; ermsg << e.SoftPrint() << " (at " << str.get_position() << ")"<_m_lp_type == ASTERICK ) _m_po->_m_lp_toSI.push_back(_m_po->_m_anyStateIndex); else throw E("StoreLPToState expected that the last parsed type is a state index(uint), state name (string) or wilcard ('*')."); } void ParserDPOMDPFormat_Spirit::ProcessTProb::operator()(iterator_t str, iterator_t end) const { if(_m_po->_m_lp_type != DOUBLE) { stringstream ss; ss<<"ProcessTProb:last parsed type should be a double. (at " <_m_lp_double; if( _m_po->_m_lp_fromSI.size() != 1 || _m_po-> _m_lp_toSI.size() != 1 ) { stringstream ss; ss<<"ProcessTProb:_m_lp_fromSI or _m_lp_toSI has size != 1. (at " <_m_lp_fromSI[0]; Index sucSI = _m_po-> _m_lp_toSI[0]; Index jaI = 0; if( sI != _m_po->_m_anyStateIndex && sucSI != _m_po->_m_anyStateIndex && _m_po->_m_lp_JAI.size() != 1 ) { jaI = _m_po->_m_lp_JAI[0]; _m_po->GetDecPOMDPDiscrete()->SetTransitionProbability(sI, jaI, sucSI, prob); if(DEBUG_PARSE) cout << "Setting T("<_m_anyStateIndex ) { _m_po->_m_lp_fromSI.clear(); for(Index si=0; si < _m_po->GetDecPOMDPDiscrete()->GetNrStates();si++) _m_po->_m_lp_fromSI.push_back(si); } if( sucSI == _m_po->_m_anyStateIndex ) { _m_po->_m_lp_toSI.clear(); for(Index si=0; si < _m_po->GetDecPOMDPDiscrete()->GetNrStates();si++) _m_po->_m_lp_toSI.push_back(si); } vector::iterator sI_it = _m_po->_m_lp_fromSI.begin(); vector::iterator sI_last = _m_po->_m_lp_fromSI.end(); while(sI_it != sI_last) { sI = *sI_it; vector::iterator jaI_it = _m_po->_m_lp_JAI.begin(); vector::iterator jaI_last = _m_po->_m_lp_JAI.end(); while(jaI_it != jaI_last) { jaI = *jaI_it; vector::iterator sucSI_it = _m_po->_m_lp_toSI.begin(); vector::iterator sucSI_last = _m_po->_m_lp_toSI.end(); while(sucSI_it != sucSI_last) { sucSI = *sucSI_it; _m_po->GetDecPOMDPDiscrete()->SetTransitionProbability(sI, jaI, sucSI, prob); if(DEBUG_PARSE) cout << "Setting T("<_m_lp_fromSI.size() != 1 ) { stringstream ss; ss<<"ProcessTRow:_m_lp_fromSI has size != 1. (at " <IsRowMatrixLP() ) { stringstream ss; ss<<"ProcessTRow: a row matrix should have been parsed. (at " < row = _m_po->_m_curMatrix[0]; size_t nrS = _m_po->GetDecPOMDPDiscrete()->GetNrStates(); if( row.size() != nrS) { stringstream ss; ss<<"ProcessTRow: exected a row matrix with nrStates="<_m_lp_fromSI[0]; Index jaI = 0; if( sI == _m_po->_m_anyStateIndex ) { _m_po->_m_lp_fromSI.clear(); for(Index si=0; si < _m_po->GetDecPOMDPDiscrete()->GetNrStates();si++) _m_po->_m_lp_fromSI.push_back(si); } vector::iterator sI_it = _m_po->_m_lp_fromSI.begin(); vector::iterator sI_last = _m_po->_m_lp_fromSI.end(); while(sI_it != sI_last) { sI = *sI_it; vector::iterator jaI_it = _m_po->_m_lp_JAI.begin(); vector::iterator jaI_last = _m_po->_m_lp_JAI.end(); while(jaI_it != jaI_last) { jaI = *jaI_it; for(Index sucSI=0; sucSI < nrS; sucSI++) { _m_po->GetDecPOMDPDiscrete()->SetTransitionProbability (sI, jaI, sucSI, row[sucSI]); if(DEBUG_PARSE) cout << "Setting T("<::iterator jaI_it = _m_po->_m_lp_JAI.begin(); vector::iterator jaI_last = _m_po->_m_lp_JAI.end(); while(jaI_it != jaI_last) { jaI = *jaI_it; for(Index sucSI=0; sucSI < nrS; sucSI++) { double prob = _m_po->_m_curMatrix[sI][sucSI]; _m_po->GetDecPOMDPDiscrete()->SetTransitionProbability (sI, jaI, sucSI, prob); if(DEBUG_PARSE) cout << "Setting T("<_m_lp_type = "<<_m_po->_m_lp_type <_m_lp_type != DOUBLE) { stringstream ss; ss<<"ProcessOProb:last parsed type should be a double. (at " <_m_lp_double; if( _m_po-> _m_lp_toSI.size() != 1 ) { stringstream ss; ss<<"ProcessOProb: _m_lp_toSI has size != 1. (at " <_m_lp_JOI.size() <= 0 ) { stringstream ss; ss<<"ProcessOProb: _m_lp_JOI has size <= 0. (at " < _m_lp_toSI[0]; Index joI = _m_po->_m_lp_JOI[0]; if( sucSI == _m_po->_m_anyStateIndex ) //if '*' -> replace by a list of all state indices { _m_po->_m_lp_toSI.clear(); for(Index si=0; si < _m_po->GetDecPOMDPDiscrete()->GetNrStates();si++) _m_po->_m_lp_toSI.push_back(si); } if( joI == _m_po->_m_anyJOIndex ) //if '*' -> replace by list of all joint obs.indices { _m_po->_m_lp_JOI.clear(); for(Index jo=0; jo<_m_po->GetDecPOMDPDiscrete()->GetNrJointObservations();jo++) _m_po->_m_lp_JOI.push_back(jo); } vector::iterator joI_it = _m_po->_m_lp_JOI.begin(); vector::iterator joI_last = _m_po->_m_lp_JOI.end(); while(joI_it != joI_last) { joI = *joI_it; vector::iterator jaI_it = _m_po->_m_lp_JAI.begin(); vector::iterator jaI_last = _m_po->_m_lp_JAI.end(); while(jaI_it != jaI_last) { Index jaI = *jaI_it; vector::iterator sucSI_it = _m_po-> _m_lp_toSI.begin(); vector::iterator sucSI_last = _m_po-> _m_lp_toSI.end(); while(sucSI_it != sucSI_last) { sucSI = *sucSI_it; _m_po->GetDecPOMDPDiscrete()->SetObservationProbability (jaI, sucSI, joI, prob); if(DEBUG_PARSE) cout << "Setting O("<IsRowMatrixLP() ) { stringstream ss; ss<<"ProcessORow: a row matrix should have been parsed. (at " < row = _m_po->_m_curMatrix[0]; size_t nrS = _m_po->GetDecPOMDPDiscrete()->GetNrStates(); size_t nrJO = _m_po->GetDecPOMDPDiscrete()->GetNrJointObservations(); if( row.size() != nrJO) { stringstream ss; ss<<"ProcessORow: exected a row matrix with nrJO="<_m_lp_toSI[0] == _m_po->_m_anyStateIndex ) { _m_po->_m_lp_toSI.clear(); for(Index si=0; si < nrS; si++) _m_po->_m_lp_toSI.push_back(si); } vector::iterator sI_it = _m_po->_m_lp_toSI.begin(); vector::iterator sI_last = _m_po->_m_lp_toSI.end(); while(sI_it != sI_last) { Index sucSI = *sI_it; vector::iterator jaI_it = _m_po->_m_lp_JAI.begin(); vector::iterator jaI_last = _m_po->_m_lp_JAI.end(); while(jaI_it != jaI_last) { Index jaI = *jaI_it; for(Index joI=0; joI < nrJO; joI++) { _m_po->GetDecPOMDPDiscrete()->SetObservationProbability (jaI, sucSI, joI, row[joI]); if(DEBUG_PARSE) cout << "Setting O("<::iterator jaI_it = _m_po->_m_lp_JAI.begin(); vector::iterator jaI_last = _m_po->_m_lp_JAI.end(); while(jaI_it != jaI_last) { jaI = *jaI_it; for(Index sucSI=0; sucSI < nrS; sucSI++) { double prob = _m_po->_m_curMatrix[sucSI][joI]; _m_po->GetDecPOMDPDiscrete()->SetObservationProbability (jaI, sucSI, joI, prob); if(DEBUG_PARSE) cout << "Setting O("<_m_lp_type = "<<_m_po->_m_lp_type <_m_lp_type != DOUBLE) { stringstream ss; ss<<"ProcessR:last parsed type should be a double. (at " <_m_lp_double; if( _m_po-> _m_lp_fromSI.size() != 1 ) { stringstream ss; ss<<"ProcessR: _m_lp_fromSI has size != 1. (at " < _m_lp_toSI.size() != 1 ) { stringstream ss; ss<<"ProcessR: _m_lp_toSI has size != 1. (at " <GetDecPOMDPDiscrete()->GetNrStates(); //size_t nrJO = _m_po->GetDecPOMDPDiscrete()->GetNrJointObservations(); Index sucSI = _m_po-> _m_lp_toSI[0]; Index joI = _m_po->_m_lp_JOI[0]; if( sucSI == _m_po->_m_anyStateIndex && joI == _m_po->_m_anyJOIndex) { // rewards of the form R: ja : s : * : * : %f, so we can simply do // AddReward() if(_m_po->_m_lp_fromSI[0] == _m_po->_m_anyStateIndex) { _m_po->_m_lp_fromSI.clear(); for(Index si=0; si < nrS; si++) _m_po->_m_lp_fromSI.push_back(si); } vector::iterator sI_it = _m_po->_m_lp_fromSI.begin(); vector::iterator sI_last = _m_po->_m_lp_fromSI.end(); while(sI_it != sI_last) { Index sI = *sI_it; vector::iterator jaI_it = _m_po->_m_lp_JAI.begin(); vector::iterator jaI_last = _m_po->_m_lp_JAI.end(); while(jaI_it != jaI_last) { Index jaI = *jaI_it; _m_po->GetDecPOMDPDiscrete()->SetReward(sI, jaI, reward); if(DEBUG_PARSE) cout << "Setting R("<_m_anyJOIndex ) //but end-state is not ANY_INDEX { if( _m_po->_m_lp_fromSI[0] == _m_po->_m_anyStateIndex ) { _m_po->_m_lp_fromSI.clear(); for(Index si=0; si < _m_po->GetDecPOMDPDiscrete()->GetNrStates();si++) _m_po->_m_lp_fromSI.push_back(si); } /* Obsolete test... if( sucSI == ANY_INDEX ) { _m_po->_m_lp_toSI.clear(); for(Index si=0; si < _m_po->GetDecPOMDPDiscrete()->GetNrStates();si++) _m_po->_m_lp_toSI.push_back(si); }*/ vector::iterator sI_it = _m_po->_m_lp_fromSI.begin(); vector::iterator sI_last = _m_po->_m_lp_fromSI.end(); while(sI_it != sI_last) { Index sI = *sI_it; vector::iterator jaI_it = _m_po->_m_lp_JAI.begin(); vector::iterator jaI_last = _m_po->_m_lp_JAI.end(); while(jaI_it != jaI_last) { Index jaI = *jaI_it; vector::iterator sucSI_it = _m_po->_m_lp_toSI.begin(); vector::iterator sucSI_last = _m_po->_m_lp_toSI.end(); while(sucSI_it != sucSI_last) { sucSI = *sucSI_it; _m_po->GetDecPOMDPDiscrete()->SetReward(sI, jaI, sucSI, reward); if(DEBUG_PARSE) cout << "Setting R("<_m_lp_fromSI[0] == _m_po->_m_anyStateIndex ) { _m_po->_m_lp_fromSI.clear(); for(Index si=0; si < _m_po->GetDecPOMDPDiscrete()->GetNrStates();si++) _m_po->_m_lp_fromSI.push_back(si); } if( _m_po->_m_lp_toSI[0] == _m_po->_m_anyStateIndex ) { _m_po->_m_lp_toSI.clear(); for(Index si=0; si < _m_po->GetDecPOMDPDiscrete()->GetNrStates();si++) _m_po->_m_lp_toSI.push_back(si); } vector::iterator joI_it = _m_po->_m_lp_JOI.begin(); vector::iterator joI_last = _m_po->_m_lp_JOI.end(); while(joI_it != joI_last) { joI = *joI_it; vector::iterator sI_it = _m_po->_m_lp_fromSI.begin(); vector::iterator sI_last = _m_po->_m_lp_fromSI.end(); while(sI_it != sI_last) { Index sI = *sI_it; vector::iterator jaI_it = _m_po->_m_lp_JAI.begin(); vector::iterator jaI_last = _m_po->_m_lp_JAI.end(); while(jaI_it != jaI_last) { Index jaI = *jaI_it; vector::iterator sucSI_it = _m_po->_m_lp_toSI.begin(); vector::iterator sucSI_last = _m_po->_m_lp_toSI.end(); while(sucSI_it != sucSI_last) { sucSI = *sucSI_it; _m_po->GetDecPOMDPDiscrete()->SetReward(sI, jaI, sucSI,joI, reward); if(DEBUG_PARSE) cout << "Setting R("<_m_lp_toSI.size() != 1 ) { stringstream ss; ss<<"ProcessRRow:_m_lp_fromSI has size != 1. (at " <IsRowMatrixLP() ) { stringstream ss; ss<<"ProcessRRow: a row matrix should have been parsed. (at " < row = _m_po->_m_curMatrix[0]; size_t nrS = _m_po->GetDecPOMDPDiscrete()->GetNrStates(); size_t nrJO = _m_po->GetDecPOMDPDiscrete()->GetNrJointObservations(); if( row.size() != nrJO) { stringstream ss; ss<<"ProcessRRow: exected a row matrix with nrJO="<_m_lp_fromSI[0] == _m_po->_m_anyStateIndex ) { _m_po->_m_lp_fromSI.clear(); for(Index si=0; si < _m_po->GetDecPOMDPDiscrete()->GetNrStates();si++) _m_po->_m_lp_fromSI.push_back(si); } if( _m_po->_m_lp_toSI[0] == _m_po->_m_anyStateIndex ) { _m_po->_m_lp_toSI.clear(); for(Index si=0; si < nrS; si++) _m_po->_m_lp_toSI.push_back(si); } vector::iterator sI_it = _m_po->_m_lp_fromSI.begin(); vector::iterator sI_last = _m_po->_m_lp_fromSI.end(); while(sI_it != sI_last) { Index sI = *sI_it; vector::iterator jaI_it = _m_po->_m_lp_JAI.begin(); vector::iterator jaI_last = _m_po->_m_lp_JAI.end(); while(jaI_it != jaI_last) { Index jaI = *jaI_it; vector::iterator sucSI_it = _m_po->_m_lp_toSI.begin(); vector::iterator sucSI_last = _m_po->_m_lp_toSI.end(); while(sucSI_it != sucSI_last) { Index sucSI = *sucSI_it; for(Index joI=0; joI < nrJO; joI++) { _m_po->GetDecPOMDPDiscrete()->SetReward(sI, jaI, sucSI,joI, row[joI]); if(DEBUG_PARSE) cout << "Setting R("<IsDimensionOfMatrix(nrS,nrJO)) { stringstream ss; ss << "Expected a nrS x nrJO matrix."<< " (nrS="<< nrS <<", nrJO="<_m_lp_fromSI[0] == _m_po->_m_anyStateIndex ) { _m_po->_m_lp_fromSI.clear(); for(Index si=0; si < _m_po->GetDecPOMDPDiscrete()->GetNrStates();si++) _m_po->_m_lp_fromSI.push_back(si); } vector::iterator sI_it = _m_po->_m_lp_fromSI.begin(); vector::iterator sI_last = _m_po->_m_lp_fromSI.end(); while(sI_it != sI_last) { Index sI = *sI_it; vector::iterator jaI_it = _m_po->_m_lp_JAI.begin(); vector::iterator jaI_last = _m_po->_m_lp_JAI.end(); while(jaI_it != jaI_last) { Index jaI = *jaI_it; for(Index sucSI=0; sucSIGetDecPOMDPDiscrete()->SetReward(sI, jaI, sucSI,joI, _m_po->_m_curMatrix[sucSI][joI]); if(DEBUG_PARSE) { cout << "Setting R(" << sI << "," << jaI <<"," << sucSI; cout << "," << joI << ") = " << _m_po->_m_curMatrix[sucSI][joI] << endl; } } } jaI_it++; } sI_it++; } } }// end namespace DPOMDPFormatParsing madp-0.4/src/PaxHeaders.5405/include0000644000000000000000000000013212717644321014114 xustar0030 mtime=1463765201.017553108 30 atime=1463765202.457541607 30 ctime=1463765201.017553108 madp-0.4/src/include/0000775000372100037210000000000012717644321015025 5ustar00fransfrans00000000000000madp-0.4/src/include/PaxHeaders.5405/versions.h0000644000000000000000000000013212717644275016222 xustar0030 mtime=1463765181.749706996 30 atime=1463765181.749706996 30 ctime=1463765201.017553108 madp-0.4/src/include/versions.h0000664000372100037210000000172412717644275017062 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "boost/version.hpp" #if BOOST_VERSION < 103300 #define BOOST_1_32_OR_LOWER 1 #else #define BOOST_1_32_OR_LOWER 0 #endif #if BOOST_VERSION >= 103600 #define BOOST_1_36_OR_HIGHER 1 #else #define BOOST_1_36_OR_HIGHER 0 #endif #if BOOST_VERSION >= 103800 // Spirit V2 has been merged in the Boost, so now we need to use the // "classic" version #define USE_BOOST_SPIRIT_CLASSIC 1 #else #define USE_BOOST_SPIRIT_CLASSIC 0 #endif madp-0.4/src/include/PaxHeaders.5405/configuration.h0000644000000000000000000000013212717644275017221 xustar0030 mtime=1463765181.749706996 30 atime=1463765181.749706996 30 ctime=1463765201.017553108 madp-0.4/src/include/configuration.h0000664000372100037210000000226312717644275020060 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ // This file contains some project-wide defines that indicate the // availability of certain software libraries. Enabling something here // usually also requires modifying Makefile.custom. // Indicates whether we use libgmp to represent LIndex. #define USE_ARBITRARY_PRECISION_INDEX 0 // Indicates whether to use the pomdp-solve library, or call an external program. // #if !DARWIN // #define USE_POMDPSOLVE_LIBRARY 1 // #else // on OSX the pomdpsolve library doesn't get compiled in, so this // // should always be set to 0 // #define USE_POMDPSOLVE_LIBRARY 0 // #endif //FAO: we don't want to use it anymore... #define USE_POMDPSOLVE_LIBRARY 0 madp-0.4/src/PaxHeaders.5405/support0000644000000000000000000000013212717644321014205 xustar0030 mtime=1463765201.749547262 30 atime=1463765202.457541607 30 ctime=1463765201.749547262 madp-0.4/src/support/0000775000372100037210000000000012717644321015116 5ustar00fransfrans00000000000000madp-0.4/src/support/PaxHeaders.5405/PlanningUnitTOIDecPOMDPDiscrete.h0000644000000000000000000000013212717644275022324 xustar0030 mtime=1463765181.461709297 30 atime=1463765181.461709297 30 ctime=1463765201.681547805 madp-0.4/src/support/PlanningUnitTOIDecPOMDPDiscrete.h0000664000372100037210000000710212717644275023160 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _PLANNINGUNITTOIDECPOMDPDISCRETE_H_ #define _PLANNINGUNITTOIDECPOMDPDISCRETE_H_ 1 /* the include directives */ #include #include "Globals.h" #include "PlanningUnitDecPOMDPDiscrete.h" #include "TOIDecPOMDPDiscrete.h" class JointPolicyPureVector; /** \brief PlanningUnitTOIDecPOMDPDiscrete represents a planning unit for * transition observation independent discrete Dec-POMDPs. */ class PlanningUnitTOIDecPOMDPDiscrete : public PlanningUnitDecPOMDPDiscrete { private: bool SanityCheck() const; ///ref to the pu TOIDecPOMDPDiscrete* _m_TOIDecPOMDPDiscrete; protected: public: // Constructor, destructor and copy assignment. ///the (default) Constructor. PlanningUnitTOIDecPOMDPDiscrete( const PlanningUnitMADPDiscreteParameters ¶ms, size_t horizon=3, TOIDecPOMDPDiscrete* p=0 ); PlanningUnitTOIDecPOMDPDiscrete( size_t horizon=3, TOIDecPOMDPDiscrete* p=0 ); //operators: //data manipulation (set) functions: /// Tell which SetReferred to use by default. void SetReferred(TOIDecPOMDPDiscrete* p) {_m_TOIDecPOMDPDiscrete=p;} ///Set the problem (TOIDecPOMDPDiscrete) using a pointer. void SetProblem(TOIDecPOMDPDiscrete* p); TOIDecPOMDPDiscrete* GetTOIDecPOMDPDiscrete() {return _m_TOIDecPOMDPDiscrete;} //get (data) functions: /// Returns the TOIDecPOMDPDiscrete pointer. /** Tell which GetReferred to use by default... (nl. the * Referrer::GetReferred(), not the * PlanningUnitMADPDiscrete::GetReferred(). */ TOIDecPOMDPDiscrete* GetReferred() const {return _m_TOIDecPOMDPDiscrete;} /**\brief returns a vector of individual (local) state indices * corresponding to joint state index jointSI.*/ const std::vector& JointToIndividualStateIndices(Index jointSI) const { return(_m_TOIDecPOMDPDiscrete->JointToIndividualStateIndices(jointSI)); } /**\brief returns the joint index for indivStateIndices*/ Index IndividualToJointStateIndices(const std::vector& indivStateIndices) const { return(_m_TOIDecPOMDPDiscrete->IndividualToJointStateIndices(indivStateIndices)); } std::vector SampleSuccessorState(const std::vector &sIs, const std::vector &aIs) const { return(_m_TOIDecPOMDPDiscrete->SampleSuccessorState(sIs,aIs)); } std::vector SampleJointObservation(const std::vector &aIs, const std::vector &sucIs) const { return(_m_TOIDecPOMDPDiscrete->SampleJointObservation(aIs,sucIs)); } std::vector SampleInitialStates(void) const { return(_m_TOIDecPOMDPDiscrete->SampleInitialStates()); } }; #endif /* !_PLANNINGUNITTOIDECPOMDPDISCRETE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/JointPolicyDiscretePure.h0000644000000000000000000000013212717644275021225 xustar0030 mtime=1463765181.505708945 30 atime=1463765181.505708945 30 ctime=1463765201.617548316 madp-0.4/src/support/JointPolicyDiscretePure.h0000664000372100037210000001246312717644275022067 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _JOINTPOLICYDISCRETEPURE_H_ #define _JOINTPOLICYDISCRETEPURE_H_ 1 /* the include directives */ #include #include "Globals.h" #include "Interface_ProblemToPolicyDiscretePure.h" #include "JointActionDiscrete.h" #include "JointPolicyDiscrete.h" #include "boost/shared_ptr.hpp" class JointPolicyDiscretePure; typedef boost::shared_ptr JPDP_sharedPtr; class JointPolicyPureVector; class PolicyDiscretePure; /** \brief JointPolicyDiscretePure is represents a pure joint policy * for a discrete MADP. * * The number of pure joint policies as represented by this class is finite. * */ class JointPolicyDiscretePure : public JointPolicyDiscrete { private: protected: public: // Constructor, destructor and copy assignment. /// default Constructor - constructs empty policy JointPolicyDiscretePure() {}; /// (default) Constructor JointPolicyDiscretePure(const Interface_ProblemToPolicyDiscretePure* pu, PolicyGlobals::PolicyDomainCategory idc ); JointPolicyDiscretePure(const I_PtPDpure_constPtr &pu, PolicyGlobals::PolicyDomainCategory idc ); /// Copy constructor. JointPolicyDiscretePure(const JointPolicyDiscretePure& a); /// Destructor. virtual ~JointPolicyDiscretePure() {}; /// Copy assignment operator virtual JointPolicyDiscretePure& operator= (const JointPolicyDiscretePure& o); //operators: //data manipulation (set) functions: ///Randomly initialize the joint policy. virtual void RandomInitialization() = 0; ///Randomly initialize the policy for agentI. virtual void RandomInitialization(Index agentI) = 0; //get (data) functions: /// Return pointer to the Interface_ProblemToPolicyDiscretePure. const Interface_ProblemToPolicyDiscretePure* GetInterfacePTPDiscretePure() const { const Interface_ProblemToPolicyDiscrete* p = GetInterfacePTPDiscrete(); const Interface_ProblemToPolicyDiscretePure* pp = dynamic_cast(p); return pp; } boost::shared_ptr GetInterfacePTPDiscretePureShared() const { boost::shared_ptr p = GetInterfacePTPDiscreteShared(); boost::shared_ptr pp = boost::dynamic_pointer_cast(p); return pp; } ///Sets the planning unit for this joint policy inline void SetInterfacePTPDiscretePure( Interface_ProblemToPolicyDiscretePure* pu); ///Sets the policy for agentI to domainI->aI. virtual void SetAction(Index agentI, Index domainI, Index aI) =0; ///Returns the jaI taken by this policy for joint domain index johI. virtual Index GetJointActionIndex(Index i) const = 0; ///Returns the jaI taken by this policy for joint domain index johI. virtual Index GetJointActionIndex(LIndex i) const = 0; ///Returns the action index for domainI for agent aI. virtual Index GetActionIndex(Index aI, Index domainI) const = 0; virtual boost::shared_ptr ToJointPolicyPureVector() const =0; /**\brief Returns the probability that the policy specifies joint * action a for domain index i. * * Required by JointPolicyDiscrete. */ double GetJointActionProb( Index i, Index ja ) const; /**\brief Returns the probability that the policy specifies joint * action a for domain index i. * * Required by JointPolicyDiscrete. */ double GetJointActionProb( LIndex i, Index ja ) const; /**\brief Returns the probability that the policy specifies * action aI for domain index domI for agentI. * * Required by JointPolicyDiscrete. */ double GetActionProb( Index agentI, Index domI, Index aI ) const; /// Returns a pointer to a copy of this class. virtual JointPolicyDiscretePure* Clone() const = 0; /// Prints a description of this JointPolicyPureVector to a string. virtual std::string SoftPrint() const = 0; /// Prints a brief description to a string. virtual std::string SoftPrintBrief() const = 0; }; #endif /* !_JOINTPOLICYDISCRETEPURE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/JointActionHistory.cpp0000644000000000000000000000013212717644275020601 xustar0030 mtime=1463765181.457709328 30 atime=1463765181.453709361 30 ctime=1463765201.721547484 madp-0.4/src/support/JointActionHistory.cpp0000664000372100037210000000742012717644275021440 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "JointActionHistory.h" #include "JointAction.h" //Necessary as header file contains a forward declaration: #include "PlanningUnitMADPDiscrete.h" using namespace std; #define DEBUG_JOH 0 //Default constructor JointActionHistory::JointActionHistory(PlanningUnitMADPDiscrete& pu) : _m_planningUnitMADPDiscrete(&pu) { SetLength(0); _m_jointActionI = 0; _m_isEmpty = true; _m_pred = 0; size_t nrAgents = pu.GetNrAgents(); _m_individualActionHistories = vector(nrAgents,0); } JointActionHistory::JointActionHistory(PlanningUnitMADPDiscrete& pu, Index jObsI) { throw E("JointActionHistory::JointActionHistory(Index obsI) not yet implemented - non-empty initial actions not yet supported."); } JointActionHistory::JointActionHistory(Index jaI, JointActionHistory* pred) : _m_planningUnitMADPDiscrete(pred->_m_planningUnitMADPDiscrete) { SetLength(pred->GetLength() + 1); _m_jointActionI = jaI; _m_isEmpty = false; _m_pred = pred; size_t nrAgents = pred->_m_individualActionHistories.size(); vector indivActionIndices = _m_planningUnitMADPDiscrete-> JointToIndividualActionIndices(jaI); for(Index aI=0; aI < nrAgents; aI++) { //get previous history index for agent ai Index predOHindex_ai = pred->_m_individualActionHistories[aI]; //get the corresponding previous history //ActionHistoryTree* oht_ai = GetReferred()-> //GetActionHistoryTree(aI, predOHindex_ai); //get the successor for the action taken by ai //Index sucOHindex_ai = oht_ai->GetSuccessor(indivActionIndices[aI])-> //GetIndex(); //and store it... Index sucOHindex_ai = _m_planningUnitMADPDiscrete -> GetSuccessorAHI(aI,predOHindex_ai, indivActionIndices[aI] ) ; _m_individualActionHistories.push_back(sucOHindex_ai); } } //Copy assignment constructor. JointActionHistory::JointActionHistory(const JointActionHistory& o) { if(DEBUG_JOH){ cout << "Cloning JointActionHistory: "; Print(); cout <& JointActionHistory::GetIndividualActionHistoryIndices() const { return(_m_individualActionHistories); } string JointActionHistory::SoftPrint() const { stringstream ss; if(_m_pred != 0) { //if the predec. is the empty action sequence (with length 0) //we don't want to print this. (and this is the case when //this action history has length 1) if(_m_length >= 1) // action histories of length 1 have a pred. ss << _m_pred->SoftPrint(); else if (_m_length < 1) { ss << "JointActionHistory:Print() - Warning:_m_pred != "<< "null, but lenght < 1 !"<GetJointAction( _m_jointActionI)->SoftPrintBrief(); } else ss << "EMPTY_JAH"; return(ss.str()); } madp-0.4/src/support/PaxHeaders.5405/JointPolicyPureVector.cpp0000644000000000000000000000013012717644275021256 xustar0029 mtime=1463765181.49770901 29 atime=1463765181.49770901 30 ctime=1463765201.705547613 madp-0.4/src/support/JointPolicyPureVector.cpp0000664000372100037210000000410712717644275022116 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "JointPolicyPureVector.h" #include "IndexTools.h" #include "boost/make_shared.hpp" using namespace std; #define DEBUG_JPPT 0 #define DEBUG_JPPT_GETJA_LOCAL 0 JointPolicyPureVector& JointPolicyPureVector::operator= (const JointPolicyPureVector& o) { #if DEBUG_JPOLASSIGN cout << "JointPolicyPureVector::operator=(const JointPolicyPureVector& jp) called"<( o ); return operator=(p); } string JointPolicyPureVector::SoftPrint(void) const { stringstream ss; ss << "JointPolicyPureVector: " <(*this); } madp-0.4/src/support/PaxHeaders.5405/JPolComponent_VectorImplementation.cpp0000644000000000000000000000013212717644275023755 xustar0030 mtime=1463765181.533708721 30 atime=1463765181.525708786 30 ctime=1463765201.705547613 madp-0.4/src/support/JPolComponent_VectorImplementation.cpp0000664000372100037210000003553612717644275024625 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "JPolComponent_VectorImplementation.h" #include "IndexTools.h" using namespace std; void JPolComponent_VectorImplementation::Construct( const Interface_ProblemToPolicyDiscretePure* pu, PolicyGlobals::PolicyDomainCategory idc, size_t depth ) { #if 0 if(depth==MAXHORIZON) throw(E("JPolComponent_VectorImplementation can only be used for finite horizons.")); #endif _m_idc = idc; for(Index agI = 0; agI < pu->GetNrAgents(); agI++) { PolicyPureVector* pol = new PolicyPureVector(pu, agI, idc, depth); _m_indivPols_PolicyPureVector.at(agI) = pol; } //allocate a new array for temporarily storing indiv. actions _m_indivActionIndices = new Index[pu->GetNrAgents()]; } void JPolComponent_VectorImplementation::Construct( const I_PtPDpure_constPtr &pu, PolicyGlobals::PolicyDomainCategory idc, size_t depth ) { #if 0 if(depth==MAXHORIZON) throw(E("JPolComponent_VectorImplementation can only be used for finite horizons.")); #endif _m_idc = idc; for(Index agI = 0; agI < pu->GetNrAgents(); agI++) { PolicyPureVector* pol = new PolicyPureVector(pu, agI, idc, depth); _m_indivPols_PolicyPureVector.at(agI) = pol; } //allocate a new array for temporarily storing indiv. actions _m_indivActionIndices = new Index[pu->GetNrAgents()]; } JPolComponent_VectorImplementation::JPolComponent_VectorImplementation( const Interface_ProblemToPolicyDiscretePure* pu, size_t depth) : _m_PTPDP(pu) , _m_indivPols_PolicyPureVector(pu->GetNrAgents()) { Construct( pu, pu->GetDefaultIndexDomCat(), depth); } JPolComponent_VectorImplementation::JPolComponent_VectorImplementation( const Interface_ProblemToPolicyDiscretePure* pu, PolicyGlobals::PolicyDomainCategory idc, size_t depth ) : _m_PTPDP(pu) , _m_indivPols_PolicyPureVector(pu->GetNrAgents()) { Construct( pu, idc, depth); } JPolComponent_VectorImplementation::JPolComponent_VectorImplementation( const I_PtPDpure_constPtr &pu, size_t depth) : _m_PTPDP(0), _m_PTPDPshared(pu), _m_indivPols_PolicyPureVector(pu->GetNrAgents()) { Construct( pu, pu->GetDefaultIndexDomCat(), depth); } JPolComponent_VectorImplementation::JPolComponent_VectorImplementation( const I_PtPDpure_constPtr &pu, PolicyGlobals::PolicyDomainCategory idc, size_t depth ) : _m_PTPDP(0), _m_PTPDPshared(pu) , _m_indivPols_PolicyPureVector(pu->GetNrAgents()) { Construct( pu, idc, depth); } //Copy constructor. JPolComponent_VectorImplementation::JPolComponent_VectorImplementation(const JPolComponent_VectorImplementation& o) { // we want to create an actual clone of this joint policy and thus // of the member (individual policies) this->PrivClone(o); } void JPolComponent_VectorImplementation::PrivClone(const JPolComponent_VectorImplementation& o) { _m_idc = o._m_idc; _m_PTPDP = o._m_PTPDP; _m_PTPDPshared = o._m_PTPDPshared; _m_indivPols_PolicyPureVector.resize( o._m_indivPols_PolicyPureVector.size() ); vector::const_iterator it = o._m_indivPols_PolicyPureVector.begin(); vector::const_iterator last = o._m_indivPols_PolicyPureVector.end(); Index i=0; while(it != last) { //make a copy of the individual policy PolicyPureVector* ind_pol = new PolicyPureVector(**it); //store the reference to the new copy _m_indivPols_PolicyPureVector[i] = (ind_pol); it++; i++; } //allocate a new array for temporarily storing indiv. actions _m_indivActionIndices = new Index[ GetInterfacePTPDiscretePure()->GetNrAgents() ]; } //Destructor JPolComponent_VectorImplementation::~JPolComponent_VectorImplementation() { //prevent memory leakage... should delete the individual policies referred //to... ClearIndividualPolicies(); delete [] _m_indivActionIndices; } void JPolComponent_VectorImplementation::ClearIndividualPolicies() { //NOTE: this means that when adding a ind. policy p to the joint policy (or //replacing one) we should make a copy of p and insert the ref to this copy. //Otherwise deleting the joint policy deletes the individual policies, //whose other references become dangling. vector::iterator it = _m_indivPols_PolicyPureVector.begin(); vector::iterator last = _m_indivPols_PolicyPureVector.end(); while(it != last) { delete (*it); it++; } _m_indivPols_PolicyPureVector.clear(); } //Copy assignment operator JPolComponent_VectorImplementation& JPolComponent_VectorImplementation::operator= (const JPolComponent_VectorImplementation& o) { if (this == &o) return *this; // Gracefully handle self assignment // Put the normal assignment duties here... //we delete the PolicyPureVectors pointed to: //this means that we should not be able //to add indiv. policies without copying them!!! size_t s = _m_indivPols_PolicyPureVector.size() ; if( s != o._m_indivPols_PolicyPureVector.size() ) { ClearIndividualPolicies(); _m_indivPols_PolicyPureVector.resize( o._m_indivPols_PolicyPureVector.size(), 0); } for(Index i=0; i < _m_indivPols_PolicyPureVector.size() ; i++) { PolicyPureVector* o_pol = o._m_indivPols_PolicyPureVector[i]; PolicyPureVector* this_pol = this->_m_indivPols_PolicyPureVector[i]; if(this_pol == 0) // this->_m_indivPols_PolicyPureVector[i] == 0 { //this pol is not a jppv yet, so we need to copy PolicyPureVector* copy = new PolicyPureVector(*o_pol); this->_m_indivPols_PolicyPureVector[i] = copy; } else { //this_pol is an existing ppv: do assignment. (*this_pol) = (*o_pol); } } return *this; } void JPolComponent_VectorImplementation::RandomInitialization() { for(Index agI = 0; agI < _m_indivPols_PolicyPureVector.size(); agI++) RandomInitialization(agI); } void JPolComponent_VectorImplementation::RandomInitialization(Index agI) { PolicyPureVector* this_pol = this->_m_indivPols_PolicyPureVector[agI]; if(this_pol == 0) { throw E(" JPolComponent_VectorImplementation::RandomInitialization(agI) this_pol is 0!?"); } this_pol->RandomInitialization(); } void JPolComponent_VectorImplementation::ZeroInitialization() { for(Index agI = 0; agI < _m_indivPols_PolicyPureVector.size(); agI++) ZeroInitialization(agI); } void JPolComponent_VectorImplementation::ZeroInitialization(Index agI) { PolicyPureVector* this_pol = this->_m_indivPols_PolicyPureVector[agI]; if(this_pol == 0) { throw E(" JPolComponent_VectorImplementation::ZeroInitialization(agI) this_pol is 0!?"); } this_pol->ZeroInitialization(); } bool JPolComponent_VectorImplementation::Increment() { bool carry_over = true; size_t nrAgents = GetInterfacePTPDiscretePure()->GetNrAgents(); if(nrAgents == 0) return true; Index agentI = nrAgents - 1; while(carry_over /*&& agentI >= 0*/) { PolicyPureVector* p = _m_indivPols_PolicyPureVector.at(agentI); carry_over = p->Increment() ; if(agentI >=1) agentI--; else//agentI is 0; -- will get huge unsigned int leading to seg.fault //if we don't jump out break; } return(carry_over); } LIndex JPolComponent_VectorImplementation::GetIndex() const { int nrAgents=GetInterfacePTPDiscretePure()->GetNrAgents(); vector nrElems(2); nrElems[0]=1; nrElems[1]=1; vector indexVec(2); vector nrIndPol(nrAgents); vector individualIndices(nrAgents); for(int k=0;kGetNrPolicies(k, _m_idc, _m_indivPols_PolicyPureVector[k]-> GetDepth()); individualIndices[k]=_m_indivPols_PolicyPureVector[k]->GetIndex(); } LIndex i=individualIndices[0]; for(int k=1;kGetNrAgents(); vector nrElems(2); nrElems[0]=1; nrElems[1]=1; vector indexVec(2); //contains the number of individual policies per agent: vector nrIndPol(nrAgents); for(int k=0;kGetNrPolicies(k, _m_idc ); nrElems[0]*=nrIndPol[k]; } //nrElems[0] now containts the number of joint policies: // 1 * nrIndPol[1] * ... * nrIndPol[nrAgents-1] // Matthijs... wtf is happening here?!? for(int k=nrAgents-1;k>0;--k) { nrElems[0]*=nrIndPol[k-1]; nrElems[1]=nrIndPol[k]; indexVec=IndexTools::JointToIndividualIndices(i,nrElems); _m_indivPols_PolicyPureVector[k]->SetIndex(indexVec[1]); i=indexVec[0]; //this seems to be a remainder?! #if 0 cout << SoftPrintVector(nrIndPol) << " " << k << " " << SoftPrintVector(indexVec) << " " << SoftPrintVector(nrElems) << endl; #endif } _m_indivPols_PolicyPureVector[0]->SetIndex(indexVec[0]); } Index JPolComponent_VectorImplementation::GetJointActionIndex(LIndex jdI) const { return(GetJointActionIndex(CastLIndexToIndex(jdI))); } Index JPolComponent_VectorImplementation::GetJointActionIndex(Index jdI) const { Index ohI, aThisAgent, ja_i; // it is possible to cache the joint->individual observ. history mapping // If this is done we want to use it by calling // JointToIndividualObservationHistoryIndicesRef // as it is faster. // Otherwise we have to use // JointToIndividualObservationHistoryIndices // to avoid a segfault. // // The mentioned cache is calculated, when generating joint observation // histories. This is controlled by the // PlanningUnitMADPDiscreteParameters of the PlanningUnitMADPDiscrete. // ( _m_params.GetComputeJointObservationHistories() in particular ) //if the "Interface_ProblemToPolicyDiscretePure"-implementing object this //policy caches joint -> indiv OH indices if(GetInterfacePTPDiscretePure()->AreCachedJointToIndivIndices(_m_idc ) ) { const vector &individualDomainIndices = GetInterfacePTPDiscretePure()-> JointToIndividualPolicyDomainIndicesRef(jdI, _m_idc ); //vector individualActionIndices(individualDomainIndices.size()); for( Index agentI=0; agentI < _m_indivPols_PolicyPureVector.size() ; agentI++ ) { ohI=individualDomainIndices[agentI]; aThisAgent = _m_indivPols_PolicyPureVector[agentI]-> GetActionIndex(ohI); _m_indivActionIndices[agentI]=aThisAgent; } ja_i = GetInterfacePTPDiscretePure()->IndividualToJointActionIndices(_m_indivActionIndices); } else { vector individualDomainIndices = GetInterfacePTPDiscretePure()-> JointToIndividualPolicyDomainIndices(jdI,_m_idc); size_t nrA = GetInterfacePTPDiscretePure()->GetNrAgents(); if( individualDomainIndices.size() != static_cast::size_type>(nrA) ) { stringstream ss; ss<<" JPolComponent_VectorImplementation::GetJointActionIndex Dimension "<< "mismatch, jdI has " << individualDomainIndices.size() << "individual actions, but there are "<< nrA <<" agents!\n"; throw E(ss); } vector individualActionIndices(individualDomainIndices.size()); for( Index agentI=0; agentI < individualDomainIndices.size(); ++agentI ) { ohI=individualDomainIndices[agentI]; aThisAgent = _m_indivPols_PolicyPureVector[agentI]->GetActionIndex(ohI); individualActionIndices[agentI]=aThisAgent; } ja_i = GetInterfacePTPDiscretePure()->IndividualToJointActionIndices( individualActionIndices); } return(ja_i); } void JPolComponent_VectorImplementation::SetDepthForIndivPols(size_t d) { vector::iterator it = _m_indivPols_PolicyPureVector.begin(); vector::iterator last = _m_indivPols_PolicyPureVector.end(); while(it != last) { (*it)->SetDepth(d); it++; } } string JPolComponent_VectorImplementation::SoftPrint(void) const { //if(_m_PTPDP == 0 ) //throw E("JPolComponent_VectorImplementation:SoftPrintBrief - Error!!! _m_PTPDP==0"); stringstream ss; ss << "JPolComponent_VectorImplementation "; try{ LIndex i = GetIndex(); ss << "index " << i << endl; }catch(EOverflow& e){ ss << "no index available (overflowing)"; } for( Index agentI = 0; agentI < static_cast< vector::size_type> (GetInterfacePTPDiscretePure()->GetNrAgents()); agentI++ ) { ss << "Policy for agent " << agentI << " (index " << _m_indivPols_PolicyPureVector.at(agentI)->GetIndex() << "):" << endl << _m_indivPols_PolicyPureVector.at(agentI)->SoftPrint(); } return(ss.str()); } string JPolComponent_VectorImplementation::SoftPrintBrief(void) const { //if(_m_PTPDP == 0 ) //throw E("JPolComponent_VectorImplementation::SoftPrintBrief - Error!!! _m_PTPDP==0"); stringstream ss; ss << GetIndex(); return(ss.str()); } madp-0.4/src/support/PaxHeaders.5405/ProblemFOBSFireFightingGraph.cpp0000644000000000000000000000013212717644275022320 xustar0030 mtime=1463765181.397709807 30 atime=1463765181.397709807 30 ctime=1463765201.717547517 madp-0.4/src/support/ProblemFOBSFireFightingGraph.cpp0000664000372100037210000001075512717644275023164 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Philipp Robbel * * For contact information please see the included AUTHORS file. */ #include "ProblemFOBSFireFightingGraph.h" using namespace std; //Default constructor ProblemFOBSFireFightingGraph::ProblemFOBSFireFightingGraph(size_t nrAgents, size_t nrFireLevels) : // number of houses is one more than the number of agents ProblemFOBSFireFightingFactored(nrAgents,nrAgents+1,nrFireLevels, // no move cost for Graph version 0.0, // dont include positions of agents in state false, // don't initialize PFFF, need to do // that after PFFG has been // constructed false) { InitializePFFF(); } string ProblemFOBSFireFightingGraph::SoftPrintBriefDescription( size_t nrAgents, size_t nrHouses, size_t nrFLs) const { stringstream ss; ss << "_FireFightingGraph_" << nrAgents << "_" << nrHouses << "_" << nrFLs; return ss.str(); } string ProblemFOBSFireFightingGraph::SoftPrintDescription(size_t nrAgents, size_t nrHouses, size_t nrFLs) const { stringstream ss; ss << "The fully-observable factored graph FireFighting problem with " << nrAgents << " Agents, " << nrHouses << " houses and " << nrFLs << " fire levels for each house.\n" << "Factored means that the state space is factored, and thus that the \ transition and reward models are represented in a factored way \ (by a 2DBN and a collection of reward functions).\n\ Graph means that the actions of the agents are restricted (i.e., they \ can go to only two houses)"; return ss.str(); } void ProblemFOBSFireFightingGraph::ConstructActions() { //cout << "ProblemFOBSFireFightingGraph::ConstructActions()" << endl; for(Index agentIndex=0; agentIndex < GetNrAgents(); agentIndex++) { AddAction(agentIndex, "left", "Go and fight fire on the house on the left"); AddAction(agentIndex, "right", "Go and fight fire on the house on the right"); } } size_t ProblemFOBSFireFightingGraph::GetAgentLocation(Index action, Index agI) const { return(agI+action); } Scope ProblemFOBSFireFightingGraph::GetHousesAgentInfluences(Index agI) const { Scope houses; // agent's actions only influence two houses houses.Insert(agI); houses.Insert(agI+1); return(houses); } void ProblemFOBSFireFightingGraph::SetYScopes() { //specify connections for the 2DBN #if DEBUG_PFFF cout << "About to set the SoIs for all next-stage(NS) SFs Y..."< 0) { x.Insert(yI-1); a.Insert(yI-1); } x.Insert(yI); // firelevel of house yI influenced by its PS firelevel if(yI < (_m_nrHouses-1) ) { x.Insert(yI+1); a.Insert(yI); } SetSoI_Y( yI, //sfacI = 0 -> house 0 x, a, //allAgents, Scope("<>") // no interdependencies between next-stage FLs ); } } size_t ProblemFOBSFireFightingGraph::GetNrAgentsAtHouse(const std::vector< Index>& As, Index hI) const { Index y = hI; const Scope& ASoI_y = GetASoI_Y(y); size_t nrAgentsAtLocation = 0; for(Index i=0; i < ASoI_y.size(); i++) { Index agI = ASoI_y.at(i); if(GetAgentLocation(As.at(i),agI) == hI) nrAgentsAtLocation++; } return(nrAgentsAtLocation); } madp-0.4/src/support/PaxHeaders.5405/Interface_ProblemToPolicyDiscrete.h0000644000000000000000000000013212717644275023171 xustar0030 mtime=1463765181.409709712 30 atime=1463765181.405709744 30 ctime=1463765201.625548252 madp-0.4/src/support/Interface_ProblemToPolicyDiscrete.h0000664000372100037210000001221612717644275024027 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _INTERFACE_PROBLEMTOPOLICYDISCRETE_H_ #define _INTERFACE_PROBLEMTOPOLICYDISCRETE_H_ 1 /* the include directives */ #include #include #include #include "Globals.h" #include "PolicyGlobals.h" #include "boost/shared_ptr.hpp" class Interface_ProblemToPolicyDiscrete; typedef boost::shared_ptr I_PtPD_sharedPtr; typedef boost::shared_ptr I_PtPD_constPtr; /** \brief Interface_ProblemToPolicyDiscrete is an interface from * discrete problems to policies. * * I.e., it defines functions that must be implemented by a derived * (problem) class such that it can be used to construct a * JointPolicyPureVector / PolicyPureVector. * * (the class (Joint)PolicyPureVector refers to objects implementing * this interface. ) */ class Interface_ProblemToPolicyDiscrete { private: protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor Interface_ProblemToPolicyDiscrete() {} /// Destructor. virtual ~Interface_ProblemToPolicyDiscrete() {} /// Check whether certain index conversions are cached. /** \deprecated policy should not need to now! */ virtual bool AreCachedJointToIndivIndices( const PolicyGlobals::PolicyDomainCategory pdc) const = 0; /// Get the number of agents involved in this problem. virtual size_t GetNrAgents() const = 0; /// Get the number of joint actions. size_t GetNrJointActions() const { size_t nrJA = 1; for(Index i=0; i < GetNrAgents(); i++) nrJA *= GetNrActions(i); return(nrJA); } /// Get the number of invididual actions of a particular agent. virtual size_t GetNrActions(Index agentI) const = 0; /// Get the number of elements in the domain of an agent's policy. virtual size_t GetNrPolicyDomainElements(Index agentI, PolicyGlobals::PolicyDomainCategory cat, size_t depth=MAXHORIZON) const = 0; /// Converts individual action indices to a joint action index. /** indivIndices is an array of size GetNrAgents() */ virtual Index IndividualToJointActionIndices( const Index* indivIndices) const = 0; /// Converts individual action indices to a joint action index. virtual Index IndividualToJointActionIndices( const std::vector& indivIndices) const = 0; /// Return the default PolicyDomainCategory for the problem. virtual PolicyGlobals::PolicyDomainCategory GetDefaultIndexDomCat() const = 0; /// Converts joint indices to individual policy domain element indices. /**A function that should be implemented by a derived class, * if this derived class caches index vectors of the policy * domains elements corresponding to a joint index. See * AreCachedJointToIndivIndices() */ virtual std::vector JointToIndividualPolicyDomainIndices(Index jdI, PolicyGlobals::PolicyDomainCategory cat) const = 0; /// Converts individual policy domain element indices to joint indices. /**A function that should be implemented by a derived class, * if this derived class caches index vectors of the policy * domains elements corresponding to a joint index. See * AreCachedJointToIndivIndices() */ virtual const std::vector& JointToIndividualPolicyDomainIndicesRef( Index jdI, PolicyGlobals::PolicyDomainCategory cat) const = 0; /**Virtual function that has to be implemented by derived class. * This should return a string describing element dIndex of the domain * (e.g. an observation history) of agent agentI.*/ virtual std::string SoftPrintPolicyDomainElement(Index agentI, Index dIndex, PolicyGlobals::PolicyDomainCategory cat ) const=0; /**Virtual function that has to be implemented by derived class. * This should return a string describing action actionI * of agent agentI.*/ virtual std::string SoftPrintAction(Index agentI, Index actionI) const =0; //operators: //data manipulation (set) functions: //get (data) functions: }; #endif /* !_INTERFACE_PROBLEMTOPOLICYDISCRETE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/JointActionObservationHistoryTree.h0000644000000000000000000000013212717644275023302 xustar0030 mtime=1463765181.453709361 30 atime=1463765181.453709361 30 ctime=1463765201.649548061 madp-0.4/src/support/JointActionObservationHistoryTree.h0000664000372100037210000000772712717644275024153 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _JOINTACTIONOBSERVATIONHISTORYTREE_H_ #define _JOINTACTIONOBSERVATIONHISTORYTREE_H_ 1 /* the include directives */ #include #include "Globals.h" #include "TreeNode.h" #include "JointActionObservationHistory.h" /** * \brief JointActionObservationHistoryTree is derived from #TreeNode, * and similar to #ObservationHistoryTree: * * JointActionObservationHistoryTree is a class that represents a wrapper for * the JointActionObservationHistory class. An * JointActionObservationHistoryTree actually * represents a node in the tree of observation histories. But each node also * specifies a (sub-)tree so there is no actual difference between a tree and * a node. * This implementation assumes that ActionObservationHistories are always * contained in exactly 1 JointActionObservationHistoryTree: i.e., deleting an * object of JointActionObservationHistoryTree will free the memory of the node * and the subtree represented by it as well as the memory of all the contained * ActionObservationHistories. * * A difference with #ObservationHistoryTree is that here a successor is * specified by 2 indices. One option would be to combine these into a joint * index, but this would add calculation every time we're traversing the tree. * Instead this class defines 2 types of nodes: ones that specify the * action successor (A_SUC) and ones that specify the observation successor * (O_SUC). * Only the A_SUC nodes contain actual ActionObservationHistories, O_SUC nodes * are 'intermediate nodes' and no operations should be performed on them. * */ class JointActionObservationHistoryTree : public TreeNode { private: enum aoh_t {A_SUC, O_SUC}; aoh_t _m_nodeType; protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor JointActionObservationHistoryTree(aoh_t nt = A_SUC) : TreeNode (), _m_nodeType(nt){}; /// Create a joint observation history tree for joh JointActionObservationHistoryTree(JointActionObservationHistory *const aoh, aoh_t nt = A_SUC); //operators: //data manipulation (set) functions: /// Sets the index to i. void SetIndex(LIndex i); /// Sets the sucI'th successor of this TreeNode to suc. /** For example, the successor for observation number sucI. */ void SetSuccessor(Index jaI, Index joI, JointActionObservationHistoryTree* suc); //get (data) functions: ///Returns the length of the containted JointActionObservationHistory. size_t GetLength() const {return(GetContainedElement()->GetLength());} /**\brief Returns the successor * JointActionObservationHistoryTree* for joint action jaI and * joint observation joI.*/ JointActionObservationHistoryTree* GetSuccessor(Index jaI, Index joI); ///Returns the predecessor JointActionObservationHistoryTree*. JointActionObservationHistoryTree* GetPredecessor() const; ///Returns the contained JointActionObservationHistory*. JointActionObservationHistory* GetJointActionObservationHistory() const; void Print() const; }; #endif /* !_JOINTACTIONOBSERVATIONHISTORYTREE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/PlanningUnitFactoredDecPOMDPDiscrete.h0000644000000000000000000000013212717644275023420 xustar0030 mtime=1463765181.585708307 30 atime=1463765181.585708307 30 ctime=1463765201.681547805 madp-0.4/src/support/PlanningUnitFactoredDecPOMDPDiscrete.h0000664000372100037210000000603712717644275024262 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _PLANNINGUNITFACTOREDDECPOMDPDISCRETE_H_ #define _PLANNINGUNITFACTOREDDECPOMDPDISCRETE_H_ 1 /* the include directives */ #include #include "Globals.h" #include "PlanningUnitDecPOMDPDiscrete.h" #include "FactoredDecPOMDPDiscreteInterface.h" class FactoredStateAOHDistribution; class PartialJointPolicyDiscretePure; /**PlanningUnitFactoredDecPOMDPDiscrete is a class that represents a * planning unit for factored discrete Dec-POMDPs. */ class PlanningUnitFactoredDecPOMDPDiscrete : // public Referrer, public PlanningUnitDecPOMDPDiscrete { private: FactoredDecPOMDPDiscreteInterface* _m_fDecPOMDP; protected: public: // Constructor, destructor and copy assignment. /**the (default) Constructor. */ PlanningUnitFactoredDecPOMDPDiscrete( const PlanningUnitMADPDiscreteParameters ¶ms, size_t horizon=3, FactoredDecPOMDPDiscreteInterface* p=0 ); PlanningUnitFactoredDecPOMDPDiscrete( size_t horizon=3, FactoredDecPOMDPDiscreteInterface* p=0 ); //operators: //data manipulation (set) functions: /**Set the problem (FactoredDecPOMDPDiscreteInterface) using a pointer*/ void SetProblem(FactoredDecPOMDPDiscreteInterface* p); //get (data) functions: /**Returns the FactoredDecPOMDPDiscreteInterface pointer. Tell which GetFDPOMDPD to use by default... (nl. the Referrer::GetFDPOMDPD(), not the PlanningUnitDecPOMDPDiscrete::GetFDPOMDPD(). */ ///GetFDPOMDPDModel is unique name and can be used publicly const FactoredDecPOMDPDiscreteInterface* GetFDPOMDPD() const {return( _m_fDecPOMDP);} // Get the vector of Factor indices corresponding to stateI */ std::vector StateIndexToFactorValueIndices(Index stateI) const {return _m_fDecPOMDP->StateIndexToFactorValueIndices(stateI);} //factored state distributions etc.: virtual FactoredStateAOHDistribution* GetNewFactoredStateAOHDistribution() const; void ComputeFSAOHDist( FactoredStateAOHDistribution* fsaoh, const PartialJointPolicyDiscretePure& pJPol) const; }; #endif /* !_PLANNINGUNITFACTOREDDECPOMDPDISCRETE_H_ */ // Local Variables: *** // mode:c++ *** // End: ***` madp-0.4/src/support/PaxHeaders.5405/QTable.h0000644000000000000000000000013212717644275015613 xustar0030 mtime=1463765181.545708625 30 atime=1463765181.541708658 30 ctime=1463765201.693547709 madp-0.4/src/support/QTable.h0000664000372100037210000000545112717644275016454 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _QTABLE_H_ #define _QTABLE_H_ 1 /* the include directives */ #include "Globals.h" #include "QTableInterface.h" #include "boost/numeric/ublas/matrix.hpp" #include "boost/numeric/ublas/matrix_proxy.hpp" typedef boost::numeric::ublas::matrix matrix_t; typedef boost::numeric::ublas::matrix_row row_t; class QTable; /// A Q-table for each time step. typedef std::vector QTables; /** \brief QTable implements QTableInterface using a full matrix. */ class QTable : public QTableInterface, public matrix_t { private: protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor QTable(){} QTable(size_t S, size_t A) : matrix_t(S,A){} QTable(size_t S, size_t A, double init) : matrix_t(S,A,init){} /// Copy constructor. QTable(const QTable& a) : matrix_t(a) {} virtual double Get(Index s_i, Index ja_i) const { return this->operator() (s_i, ja_i); } row_t GetRow(Index s_i) const { return row_t(*this, s_i); } size_t GetNrStates() const { return this->size1(); } size_t GetNrActions() const { return this->size2(); } virtual void Set(Index s_i, Index ja_i, double rew) { this->operator() (s_i, ja_i) = rew; } virtual void SetToZero(); /// Returns a pointer to a copy of this class. virtual QTable* Clone() const { return new QTable(*this); } /// Load a QTable from disk, resulting QTable is stored in Q argument. static void Load(const std::string &filename, size_t nrRows, size_t nrColumns, QTable &Q); /// Loads QTables from disk, resulting QTables is stored in Qs argument. static void Load(const std::string &filename, size_t nrRows, size_t nrColumns, size_t nrTables, QTables &Qs); /// Save QTable Q to disk. static void Save(const QTable &Q, const std::string &filename); /// Save QTables Qs to disk. static void Save(const QTables &Qs, const std::string &filename); }; #endif /* !_QTABLE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/JointActionObservationHistory.h0000644000000000000000000000013212717644275022462 xustar0030 mtime=1463765181.541708658 30 atime=1463765181.541708658 30 ctime=1463765201.645548092 madp-0.4/src/support/JointActionObservationHistory.h0000664000372100037210000000765612717644275023334 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _JOINTACTIONOBSERVATIONHISTORY_H_ #define _JOINTACTIONOBSERVATIONHISTORY_H_ 1 /* the include directives */ #include #include "Globals.h" #include "JointHistory.h" //forward declation: class PlanningUnitMADPDiscrete; /// JointActionObservationHistory represents a joint action observation history. class JointActionObservationHistory : public JointHistory { private: ///The last joint action (index). Index _m_jaI; ///The last joint observation (index). Index _m_joI; /**The predecessor together with the last joint actionObservation * (_m_actionObservationI) this gives a full description of * this joint actionObservation history.*/ JointActionObservationHistory* _m_pred; /**A vector of Indices which are the indices of individual * ActionObservationHistories this gives an alternate description of the * current JointActionObservation History. */ std::vector _m_individualActionObservationHistories; ///pointer to the pu PlanningUnitMADPDiscrete* _m_planningUnitMADPDiscrete; void GetJointActionObservationHistoryVectorsRecursive( std::vector &jaIs, std::vector &joIs); protected: public: // Constructor, destructor and copy assignment. /** \brief (default) Constructor - creates a new initial * (=empty) JointActionObservationHistory. */ JointActionObservationHistory(PlanningUnitMADPDiscrete& pu); /** \brief Creates the joint action-obs. history resulting * from joint action jaI and obs. joI after * JointActionObservationHistory pred.*/ JointActionObservationHistory(Index jaI, Index joI, JointActionObservationHistory* pred); //operators: //data manipulation (set) functions: //get (data) functions: ///Returns the indices of the indiv. action observation histories. const std::vector& GetIndividualActionObservationHistoryIndices() const {return _m_individualActionObservationHistories;} ///Returns PlanningUnitMADPDiscrete PlanningUnitMADPDiscrete* GetPlanningUnitMADPDiscrete() { return _m_planningUnitMADPDiscrete;} //other ///SoftPrints the history. std::string SoftPrint() const; ///SoftPrints the history in terms of joint action/observation indices. std::string SoftPrintJointIndices() const; ///Prints the history. void Print() const {std::cout << SoftPrint(); } /** \brief Get vectors of joint action and observation indices * stored by this history. */ void GetJointActionObservationHistoryVectors( std::vector &jaIs, std::vector &joIs); ///Gets the last joint action index. Index GetJointActionIndex() const {return _m_jaI;} ///Gets the last joint observation index. Index GetJointObservationIndex() const {return _m_joI;} /// Returns a pointer to a copy of this class. virtual JointActionObservationHistory* Clone() const { return new JointActionObservationHistory(*this); } }; #endif /* !_JOINTACTIONOBSERVATIONHISTORY_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/PlanningUnit.h0000644000000000000000000000013212717644275017051 xustar0030 mtime=1463765181.505708945 30 atime=1463765181.505708945 30 ctime=1463765201.677547837 madp-0.4/src/support/PlanningUnit.h0000664000372100037210000000634312717644275017713 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _PLANNINGUNIT_H_ #define _PLANNINGUNIT_H_ 1 /* the include directives */ #include #include #include "Globals.h" #include "MultiAgentDecisionProcessInterface.h" #define DEBUG_PU_CONSTRUCTORS 0 class JointPolicy; /** \brief PlanningUnit represents a planning unit, i.e., a planning * algorithm. * * This is a very general class, that only manages the planning * horizon and can initialize the random number generator (srand). */ class PlanningUnit { private: /// Pointer to the problem. MultiAgentDecisionProcessInterface *_m_problem; /// Used by GetNextAgentIndex(). Index _m_agentI; /// The planning horizon: MAXHORIZON for infinite horizon. */ size_t _m_horizon; /// The random seed. int _m_seed; protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor /// Constructor which sets the horizon and the problem. PlanningUnit(size_t horizon, MultiAgentDecisionProcessInterface* p) : _m_problem(p), _m_agentI(0), _m_horizon(horizon), _m_seed(0) {} /// Destructor. virtual ~PlanningUnit(){} //operators: //data manipulation (set) functions: /// Stores the random seed and calls InitSeed(). void SetSeed(int s){ _m_seed = s; InitSeed(); } /// Updates the problem pointer. void SetProblem(MultiAgentDecisionProcessInterface* p) { _m_problem = p; } /// Updates the horizon of the planning problem. virtual void SetHorizon(size_t horizon) { _m_horizon = horizon; } /// Initializes the random number generator (srand) to the stored seed. void InitSeed() const { srand(_m_seed); } //get (data) functions: /// Returns the planning horizon. size_t GetHorizon() const { return(_m_horizon); } /// Returns the random seed stored. int GetSeed() const { return(_m_seed); } /// Return the number of agents. size_t GetNrAgents() const { return(_m_problem->GetNrAgents()); } /// Maintains a agent index and returns the next one on calling */ Index GetNextAgentIndex() { Index curIndex = _m_agentI; _m_agentI = (_m_agentI+1) % GetNrAgents(); return(curIndex); } /// Get the problem pointer. const MultiAgentDecisionProcessInterface* GetProblem() const { return(_m_problem); } //other /// The function that performs the actual planning. virtual void Plan() = 0; /// Returns a pointer to the computed joint policy. virtual boost::shared_ptr GetJointPolicy() = 0; }; #endif /* !_PLANNINGUNIT_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/ProblemFireFighting.h0000644000000000000000000000013212717644275020331 xustar0030 mtime=1463765181.461709297 30 atime=1463765181.461709297 30 ctime=1463765201.633548187 madp-0.4/src/support/ProblemFireFighting.h0000664000372100037210000000661312717644275021173 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _PROBLEMFIREFIGHTING_H_ #define _PROBLEMFIREFIGHTING_H_ 1 /* the include directives */ #include "Globals.h" #include "DecPOMDPDiscrete.h" #include "IndexTools.h" /** \brief ProblemFireFighting is a class that represents * the firefighting problem as described in #refGMAA (DOC-references.h). * */ class ProblemFireFighting : public DecPOMDPDiscrete { private: enum observation_t { FLAMES, NOFLAMES }; size_t _m_nrAgents; size_t _m_nrHouses; size_t _m_nrFireLevels; bool _m_includePositions; size_t _m_nrStateFeatures; //vector that stores the number of values per state feature. std::vector _m_nrPerStateFeatureVec; size_t _m_nrJointFirelevels; //vector that stores the number of values per state feature. std::vector _m_nrFLs_vec; ///Construct all the Actions and actionSets (the vector _m_actionVecs). void ConstructActions(); ///Construct all the observations and observation sets. void ConstructObservations(); ///Fills the transition model with the problem transitions. void FillTransitionModel(); ///Fills the observation model with the problem obs. probs. void FillObservationModel(); ///Fills the reward model with the problem rewards. void FillRewardModel(); size_t NumberOfContainedStartPositions(const std::vector& state) const; protected: static std::string SoftPrintBriefDescription( size_t nrAgents, size_t nrHouses, size_t nrFLs); static std::string SoftPrintDescription(size_t nrAgents, size_t nrHouses, size_t nrFLs); std::vector< Index> GetStateVector(Index sI) const { return IndexTools::JointToIndividualIndices (sI, _m_nrPerStateFeatureVec ); } double ComputeTransitionProb( const std::vector< Index>& s1, const std::vector< Index>& ja, const std::vector< Index>& s2 ) const; double ComputeObservationProb( const std::vector< Index>& ja, const std::vector< Index>& s1, const std::vector< Index>& jo ) const; double ComputeReward(Index sI) const; //is a neighbor of house hI burning? static bool isNeighborBurning( const std::vector< Index>& s1, Index hI) ; public: // Constructor, destructor and copy assignment. /// (default) Constructor ProblemFireFighting(size_t nrAgents, size_t nrHouses, size_t nrFLs, double costOfMove=0.0, bool forcePositionRepres = false); }; #endif /* !_PROBLEMFIREFIGHTING_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/TreeNode.h0000644000000000000000000000013212717644275016150 xustar0030 mtime=1463765181.301710574 30 atime=1463765181.297710607 30 ctime=1463765201.653548029 madp-0.4/src/support/TreeNode.h0000664000372100037210000001674712717644275017023 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _TREENODE_H_ #define _TREENODE_H_ 1 /* the include directives */ #include #include #include "Globals.h" #include "E.h" #define DEBUG_TREENODE 0 /** \brief TreeNode represents a node in a tree of histories, for * instance observation histories. * * TreeNode is a class that represents a wrapper for the Tcontained * class. Each node also specifies a (sub-)tree so there is no actual * difference between a tree and a node. This implementation assumes * that ObservationHistories are always contained in exactly 1 * TreeNode: i.e., deleting an object of TreeNode will free the memory * of the node and the subtree represented by it as well as the memory * of all the contained ObservationHistories. */ template class TreeNode { private: protected: /**The map that stores the pointers to the successor * TreeNodes*/ std::map< LIndex, TreeNode* > _m_successor; ///A Pointer to the predecessor. TreeNode* _m_pred; /**The index of this TreeNode (and thus of the contained * Tcontained - typically an observation history).*/ LIndex _m_index; ///Whether the index is valid. bool _m_indexValid; ///The contained element Tcontained* _m_containedElem; public: // Constructor, destructor and copy assignment. /// (default) Constructor TreeNode() { _m_index = 42; // weird number to help track it down in gdb etc _m_indexValid = false; _m_containedElem = 0; _m_pred = 0; } TreeNode(Tcontained *const oh) { _m_index = 0; _m_indexValid = false; _m_containedElem = oh; _m_pred = 0; } /// Copy constructor. TreeNode(const TreeNode& a) { _m_successor=a._m_successor; _m_pred=a._m_pred; _m_index=a._m_index; _m_indexValid=a._m_indexValid; _m_containedElem=new Tcontained(*a._m_containedElem); #if DEBUG_TREENODE cerr << "Cloning TreeNode. This node "; PrintThisNode(); cerr << endl; #endif } /// Destructor. virtual ~TreeNode() { #if DEBUG_TREENODE cerr << "Deleting TreeNode. This node "; PrintThisNode();cerr << endl; #endif delete(_m_containedElem); while(!_m_successor.empty()) { delete _m_successor.begin()->second; // recursively // delete the // rest of the // tree _m_successor.erase(_m_successor.begin()); } } //operators: //data manipulation (set) functions: ///Sets the index to i void SetIndex(LIndex i){_m_index = i; _m_indexValid = true; }; /** \brief Sets the sucI'th successor of this TreeNode to suc. * * For example, the successor for observation number * sucI. Also sets the predecessor of suc to this.*/ void SetSuccessor(LIndex sucI, TreeNode* suc); /** \brief Sets the predecessor of this node to be pred. * * This function is typically called by SetSuccessor (not * manually).*/ void SetPredeccessor(TreeNode* pred) {_m_pred = pred;} //get (data) functions: ///Get the succesor TreeNode* for the sucI'th successor TreeNode* GetSuccessor(LIndex sucI); ///Get the predecessor TreeNode*. TreeNode* GetPredecessor() const {return(_m_pred);} /**\brief Returns the index of this TreeNode (and thus * corresponding to the contained element).*/ LIndex GetIndex() const { if(_m_indexValid) return(_m_index); else throw E("This TreeNode's index is invalid (not yet set)"); } ///Returns a pointer to the contained element (Tcontained) Tcontained* GetContainedElement() const {return(_m_containedElem);}; /// Check whether a particular successor sucI exists. bool ExistsSuccessor(LIndex sucI); /** \brief Prints the tree starting from this node of the * history tree (including the successors).*/ void Print() const; /** \brief Prints only this node of the history tree (not the * successors).*/ void PrintThisNode() const; }; template void TreeNode::SetSuccessor(LIndex sucI, TreeNode* suc) { if( ExistsSuccessor(sucI) ) { #if DEBUG_TREENODE cout << "_m_successor["<< sucI<< "] already set: overwriting!\n"; #endif _m_successor[sucI] = suc; } else { std::pair< LIndex, TreeNode* > arg_pair = std::make_pair(sucI, suc); std::pair< typename std::map< LIndex, TreeNode* >::iterator, bool> result_pair; result_pair = _m_successor.insert(arg_pair); if(result_pair.second == false) { std::stringstream ss; ss << "TreeNode::SetSuccessor insertion failed, " << "but _m_successor["<< sucI<< "] wasn't already set ?!?"; throw(E(ss)); } } suc->SetPredeccessor(this); } template TreeNode* TreeNode::GetSuccessor(LIndex sucI) { if(_m_successor.find(sucI)==_m_successor.end()) throw EInvalidIndex("TreeNode::GetSuccessor successor not found"); else return(_m_successor[sucI]); } template bool TreeNode::ExistsSuccessor(LIndex sucI) { if(_m_successor.find(sucI)==_m_successor.end()) return(false); else return(true); } template void TreeNode::PrintThisNode() const { if(_m_containedElem != 0) { std::cout << "index: "<<_m_index<<" - "; _m_containedElem->Print(); } } template void TreeNode::Print() const { if(_m_containedElem != 0) { std::cout << "index: "; if(_m_indexValid) std::cout<< _m_index; else std::cout << "INVALID"; std::cout << " - "; _m_containedElem->Print(); std::cout << std::endl; //typname dependent on template should be called using typename typename std::map< LIndex, TreeNode*>::const_iterator it = _m_successor.begin(); while(it != _m_successor.end()) { if(it->second != 0) it->second->Print(); it++; } } } #endif /* !_TREENODE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/IndividualBeliefJESP.cpp0000644000000000000000000000013112717644275020656 xustar0030 mtime=1463765181.437709489 29 atime=1463765181.43370952 30 ctime=1463765201.733547389 madp-0.4/src/support/IndividualBeliefJESP.cpp0000664000372100037210000002174712717644275021526 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "IndividualBeliefJESP.h" #include #include //Necessary as header file contains a forward declaration: #include "PlanningUnitMADPDiscrete.h" #include "JointPolicyPureVector.h" using namespace std; #define IndividualBeliefJESP_doSanityCheckAfterEveryUpdate 0 IndividualBeliefJESP::IndividualBeliefJESP(Index agentI, Index stage, const PlanningUnitMADPDiscrete& pu) : Belief(0), _m_pumadp(&pu), _m_stage(stage), _m_agentI(agentI) { //compute size of this belief: size_t nrS = _m_pumadp->GetNrStates(); _m_nrAgents= _m_pumadp->GetNrAgents(); size_t nrJOH_others = 1; for(Index j=0; j < _m_nrAgents; j++) { if(j == agentI) continue; //else: _m_others.push_back(j); size_t nrOH_j = _m_pumadp->GetNrObservationHistories(j, stage); nrJOH_others *= nrOH_j; _m_nrOH_others.push_back(nrOH_j); } size_t size = nrS * nrJOH_others; _m_b = vector(size,0.0); _m_sizeVec.push_back(nrS); _m_sizeVec.push_back(nrJOH_others); _m_stepsizeSJOH = IndexTools::CalculateStepSize(_m_sizeVec); //we will use // IndexTools::JointToIndividualIndicesStepSize(Index jointI, // const vector &step_size, size_t vec_size ) //and // IndexTools::IndividualToJointIndicesStepSize (const std::vector< Index > // &indices, const std::vector< size_t > &step_size) // // to do the conversions between JOHI_j <-> // // so we cah the step_size _m_stepsizeJOHOH = IndexTools::CalculateStepSize(_m_nrOH_others); } //Destructor IndividualBeliefJESP::~IndividualBeliefJESP() { delete [] _m_stepsizeJOHOH; delete [] _m_stepsizeSJOH; } IndividualBeliefJESP& IndividualBeliefJESP::operator= (const IndividualBeliefJESP& o) { if (this == &o) return *this; // Gracefully handle self assignment throw E("IndividualBeliefJESP assignment operator not implemented yet"); Belief::operator=(o); return(*this); } vector IndividualBeliefJESP::GetOthersObservationHistIndex(Index eI) const { //get vector v1 = IndexTools::JointToIndividualIndicesStepSize(eI, _m_stepsizeSJOH, 2); //get withinStageOHIndices_o = IndexTools::JointToIndividualIndicesStepSize( v1.at(1), _m_stepsizeJOHOH, _m_nrAgents-1 ); //add the offset for the stage to the indices: for(Index j=0; j < withinStageOHIndices_o.size(); j++) withinStageOHIndices_o[j] += CastLIndexToIndex(_m_pumadp-> GetFirstObservationHistoryIndex( _m_others[j], _m_stage)); return(withinStageOHIndices_o); } Index IndividualBeliefJESP::GetAugmentedStateIndex(Index sI, const vector& oHist_others) const { //get indices without the offset for the stage: vector withinStageOHIndices_o = vector(oHist_others.size()); for(Index j=0; j < withinStageOHIndices_o.size(); j++) withinStageOHIndices_o[j] = oHist_others[j] - CastLIndexToIndex(_m_pumadp->GetFirstObservationHistoryIndex( _m_others[j], _m_stage)); vector v; v.push_back(sI); v.push_back( IndexTools::IndividualToJointIndicesStepSize(withinStageOHIndices_o, _m_stepsizeJOHOH ) ); return( IndexTools::IndividualToJointIndicesStepSize( v, _m_stepsizeSJOH) ); } double IndividualBeliefJESP::Update( const IndividualBeliefJESP& b_prev, Index lastAI, Index newOI, const JointPolicyPureVector* jpol) { //set all probs of this belief to 0 _m_b = vector(_m_b.size(), 0.0); double Po_ba = 0.0; // P(o|b,a) with o=newJO vector newJB_unnorm; size_t nrJO_others = 1; Scope otherAgentIndices; vector nrO_others; for(Index j=0; j < _m_pumadp->GetNrAgents(); j++) { if(j == _m_agentI) continue; //else Index nrO_j = _m_pumadp->GetNrObservations(j); nrJO_others *= nrO_j; nrO_others.push_back(nrO_j); otherAgentIndices.push_back(j); } for(Index prev_eI=0; prev_eI < b_prev.Size(); prev_eI++) { double probPrev_eI=b_prev.Get(prev_eI); if(probPrev_eI>0)// only need to do this if this previous eI is possible { Index prev_sI = b_prev.GetStateIndex(prev_eI); vector prev_oHist_others = b_prev. GetOthersObservationHistIndex(prev_eI); vector actions(_m_nrAgents); actions.at(_m_agentI) = lastAI; for(Index j=0; j < otherAgentIndices.size(); j++) { Index ag_j = otherAgentIndices[j]; Index prev_oHist_j = prev_oHist_others[j];//not ag_j!!! Index act_j = jpol->GetActionIndex(ag_j, prev_oHist_j); actions.at(ag_j) = act_j; } Index jaI = _m_pumadp->IndividualToJointActionIndices(actions); for(Index next_sI=0; next_sI < _m_pumadp->GetNrStates(); next_sI++) { //note we do not loop over all possible next_eI, because *a lot* //of transitions will be 0 ( if next_oHistJ != (prev_oHistJ, oJ) ) // //rather we now loop over all possible oJ (observations of others) double Ps_as = _m_pumadp-> GetTransitionProbability(prev_sI, jaI, next_sI); if(Ps_as>0) // only need to do this if this transition can occur { for(Index JO_o=0; JO_o < nrJO_others; JO_o++) { vector oIs(_m_nrAgents); oIs.at(_m_agentI) = newOI; // `our' observation is fixed vector oIs_others = IndexTools::JointToIndividualIndices( JO_o, nrO_others); for(Index j=0; j < otherAgentIndices.size(); j++) oIs.at( otherAgentIndices.at(j) ) = oIs_others.at(j); Index joI = _m_pumadp->IndividualToJointObservationIndices(oIs); //compute P(joI | jaI,s') double Po_as = _m_pumadp->GetObservationProbability( jaI, next_sI, joI); //prob of next_eI = //AND prev_sI can now be computed. // //first, however, lets find the index, next_eI, for // // first find the next_oHist_others indices. vector next_oHist_others; for(Index j=0; j < otherAgentIndices.size(); j++) { Index next_oHist_j = _m_pumadp->GetSuccessorOHI(otherAgentIndices.at(j), prev_oHist_others[j], oIs_others[j] ); next_oHist_others.push_back(next_oHist_j); } Index next_eI = GetAugmentedStateIndex(next_sI, next_oHist_others); //p += P(oi | ai, ) * P(|,ai) * b() // = P(oi, |,ai) * b() // = P(s', jo | s, ja) b() //ja=,aj=pol(oHj) // = P(jo|ja,s')*P(s'|s,ja) double Pso_sa = Po_as * Ps_as * probPrev_eI; _m_b.at(next_eI) += Pso_sa; Po_ba += Pso_sa; //running sum of P(oi|b,ai) } } } } } for(Index eI=0; eI < this->Size(); eI++) _m_b.at(eI) = _m_b.at(eI) / Po_ba; return(Po_ba); } string IndividualBeliefJESP::SoftPrint() const { stringstream ss; for(Index eI=0; eI < Size(); eI++) { ss << "eI="< #include "Globals.h" #include "PolicyGlobals.h" ///Policy is a class that represents a policy for a single agent. /** It contains the notion of the depth of a policy: a positive number * that specifies for how many time steps this policy is * specified. I.e., if depth < horizon, the object represents a * partially specified policy (specified for time steps * 0,...,depth-1)*/ class Policy { private: /**\brief The depth of this joint policy. * * The depth of the policy is the number of stages for which it specifies actions. * It ranges from: \n * 0 (the empty policy), \n * 1 (a policy specified only for ts=0), \n * : * MAXHORIZON (a policy specified for all stages, the default value). \n */ size_t _m_depth; protected: Index _m_agentI; public: // Constructor, destructor and copy assignment. /// Constructor, initializes the depth to the maximum horizon. Policy(Index agentI) : _m_depth(MAXHORIZON), _m_agentI(agentI) {}; /// Destructor. virtual ~Policy(){}; ///Returns the depth of the policy. \sa _m_depth size_t GetDepth() const {return _m_depth;} /// Sets the depth of the policy. \sa _m_depth virtual void SetDepth(size_t d) {_m_depth = d;} /// Returns a pointer to a copy of this class. virtual Policy* Clone() const = 0; /// Prints a description of a policy to a string. virtual std::string SoftPrint() const = 0; /// Prints a description of a policy to cout. virtual void Print() const { std::cout << SoftPrint();} }; #endif /* !_POLICY_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/Belief.h0000644000000000000000000000013212717644275015631 xustar0030 mtime=1463765181.517708849 30 atime=1463765181.517708849 30 ctime=1463765201.661547964 madp-0.4/src/support/Belief.h0000664000372100037210000000551312717644275016471 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _BELIEF_H_ #define _BELIEF_H_ 1 /* the include directives */ #include #include "Globals.h" #include "BeliefInterface.h" #include "StateDistributionVector.h" class BeliefIterator; /// Belief represents a probability distribution over the state space. /** It is stored as a full vector. */ class Belief : virtual public BeliefInterface { private: friend class BeliefIterator; protected: /// The vector of probability values. //std::vector _m_b; StateDistributionVector _m_b; public: /// Constructor which sets the \a size of the belief. Belief(size_t size=0); /// Constructor which copies \a belief in this belief. Belief(const std::vector &belief); /// Constructor which copies \a belief in this belief. Belief(const BeliefInterface &belief); Belief(const StateDistribution& belief); /// Destructor. ~Belief(); Belief& operator= (const Belief& o); BeliefInterface& operator= (const BeliefInterface& o); // operators: double& operator[] (Index& i) { return(_m_b[i]); } double& operator[] (int& i) { return(_m_b[i]); } //data manipulation (set) functions: virtual void Set(const std::vector &belief); virtual void Set(Index sI, double prob) { _m_b[sI]=prob; } virtual void Set(const BeliefInterface &belief); virtual void Set(const StateDistribution& belief); //get (data) functions: double Get(Index sI) const { return(_m_b.at(sI)); }; std::vector Get() const { return(_m_b); }; void Clear(); std::string SoftPrint() const; void Print() const { std::cout << SoftPrint(); } unsigned int Size() const { return(_m_b.size()); } bool SanityCheck() const; double InnerProduct(const std::vector &values) const; std::vector InnerProduct(const VectorSet &v) const; std::vector InnerProduct(const VectorSet &v, const std::vector &mask) const; BeliefIteratorGeneric GetIterator() const; /// Returns a pointer to a copy of this class. virtual Belief* Clone() const { return new Belief(*this); } }; #endif /* !_BELIEF_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/ObservationHistoryTree.h0000644000000000000000000000013212717644275021140 xustar0030 mtime=1463765181.425709585 30 atime=1463765181.425709585 30 ctime=1463765201.641548124 madp-0.4/src/support/ObservationHistoryTree.h0000664000372100037210000000557212717644275022005 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _OBSERVATIONHISTORYTREE_H_ #define _OBSERVATIONHISTORYTREE_H_ 1 /* the include directives */ #include "ObservationHistory.h" #include "TreeNode.h" /// ObservationHistoryTree is a wrapper for the ObservationHistory class. /** * An ObservationHistoryTree actually represents a node in the tree of * observation histories. But each node also specifies a (sub-)tree so * there is no actual difference between a tree and a node. This * implementation assumes that ObservationHistories are always * contained in exactly 1 ObservationHistoryTree: i.e., deleting an * object of ObservationHistoryTree will free the memory of the node * and the subtree represented by it as well as the memory of all the * contained ObservationHistories. */ class ObservationHistoryTree : public TreeNode { private: protected: public: // Constructor, destructor and copy assignment. /// Create a joint observation history tree for joh ObservationHistoryTree(ObservationHistory *const oh) : TreeNode (oh) {} /// Copy constructor. ObservationHistoryTree(const ObservationHistoryTree& a): TreeNode (a) {} //operators: //data manipulation (set) functions: //get (data) functions: /// Returns the length of the contained ObservationHistory. size_t GetLength() const { return( (GetContainedElement()!=0)? GetContainedElement()->GetLength() : throw E("_m_jObsHist undefined!") ); }; ObservationHistory* GetObservationHistory() const {return GetContainedElement();} ObservationHistoryTree* GetPredecessor() const {return (ObservationHistoryTree*) //we know we only put pointers //to ObservationHistoryTree's in here. TreeNode::GetPredecessor();} ObservationHistoryTree* GetSuccessor(Index jObsI) {return (ObservationHistoryTree*) //we know we only put pointers //to ObservationHistoryTree's in here. TreeNode::GetSuccessor(jObsI);} }; #endif /* !_OBSERVATIONHISTORYTREE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/ProblemDecTigerWithCreaks.cpp0000644000000000000000000000013112717644275021771 xustar0030 mtime=1463765181.449709393 30 atime=1463765181.441709457 29 ctime=1463765201.70954758 madp-0.4/src/support/ProblemDecTigerWithCreaks.cpp0000664000372100037210000005532212717644275022635 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "ProblemDecTigerWithCreaks.h" using namespace std; #define DEBUG_PDT 0 #define DEBUG_TM 0 #define DEBUG_CJA 0 #define DEBUG_CJO 0 #define DEBUG_CA 0 #define DEBUG_CO 0 #define DEBUG_GETJA 0 ProblemDecTigerWithCreaks::ProblemDecTigerWithCreaks() : DecPOMDPDiscrete( "The Dec-Tiger with Creaks Problem", "Variation of the DecTiger problem", "DecTigerWithCreaks"), NUMBER_OF_STATES(2), NUMBER_OF_AGENTS(2), NUMBER_OF_OBSERVATIONS(6), NUMBER_OF_ACTIONS(3) { SetNrAgents(NUMBER_OF_AGENTS); SetNrStates(NUMBER_OF_STATES); SetUniformISD(); SetDiscount(1); // add actions: ConstructActions(); // add joint actions ConstructJointActions(); SetActionsInitialized(true); // add observations: ConstructObservations(); ConstructJointObservations(); SetObservationsInitialized(true); // add the transition model CreateNewTransitionModel(); FillTransitionModel(); // add observation model CreateNewObservationModel(); FillObservationModel(); MultiAgentDecisionProcessDiscrete::SetInitialized(true); // add rewards CreateNewRewardModel(); FillRewardModel(); DecPOMDPDiscrete::SetInitialized(true); } ProblemDecTigerWithCreaks::~ProblemDecTigerWithCreaks() { } void ProblemDecTigerWithCreaks::ConstructActions() { size_t nrJointActions = 1; for(Index agentIndex=0; agentIndex < _m_nrAgents; agentIndex++) { size_t nrActionsThisAgent = NUMBER_OF_ACTIONS; nrJointActions *= nrActionsThisAgent; vector av_temp; for(Index actionI=0; actionI < nrActionsThisAgent; actionI++) { string name("a"); stringstream ss; string strActionI, strAgentI; ss << agentIndex; ss >> strAgentI; name += strAgentI; ss.clear(); ss << actionI; ss >> strActionI; name += strActionI; string whatAction; switch(actionI){ case(LISTEN): whatAction = "Listen"; break; case(OPENLEFT): whatAction = "OpenLeft"; break; case(OPENRIGHT):whatAction = "OpenRight"; break; } name += ":" + whatAction; string descr("Action "); descr += whatAction+" - #"; descr += strActionI + " of agent " + strAgentI; AddAction(agentIndex, name, descr); name.clear(); strActionI.clear(); strAgentI.clear(); whatAction.clear(); descr.clear(); } } } void ProblemDecTigerWithCreaks::ConstructObservations() { /// add observations: size_t nrJointObservations = 1; for(Index agentIndex=0; agentIndex < _m_nrAgents; agentIndex++) { size_t nrObservationsThisAgent = NUMBER_OF_OBSERVATIONS; nrJointObservations *= nrObservationsThisAgent; for(Index obsI=0; obsI < nrObservationsThisAgent; obsI++) { string name("o"); stringstream ss; string strObsI, strAgentI; ss << agentIndex; ss >> strAgentI; name += strAgentI; ss.clear(); ss << obsI; ss >> strObsI; name += strObsI; string whatObs; switch(obsI){ case(GROWLLEFT_CREAKLEFT): whatObs = "GrowlLeftCreakRight"; break; case(GROWLLEFT_CREAKRIGHT):whatObs = "GrowlLeftCreakRight"; break; case(GROWLLEFT_SILENCE): whatObs = "GrowlLeftSilence"; break; case(GROWLRIGHT_CREAKLEFT):whatObs = "GrowlRightCreakLeft"; break; case(GROWLRIGHT_CREAKRIGHT): whatObs = "GrowlRightCreakRight"; break; case(GROWLRIGHT_SILENCE):whatObs = "GrowlRightSilence"; break; } name += ":" + whatObs; string descr("Observation "); descr += whatObs + " - #"; descr += strObsI + " of agent " + strAgentI; AddObservation(agentIndex,name,descr); name.clear(); strObsI.clear(); strAgentI.clear(); whatObs.clear(); descr.clear(); } } } Index ProblemDecTigerWithCreaks::GetJointActionIndex(Index a0, Index a1) const { vector aIs; aIs.push_back(a0); aIs.push_back(a1); return(IndividualToJointActionIndices(aIs)); } Index ProblemDecTigerWithCreaks::GetJointObsIndex(Index o0, Index o1) const { vector oIs; oIs.push_back(o0); oIs.push_back(o1); return(IndividualToJointObservationIndices(oIs)); } void ProblemDecTigerWithCreaks::FillTransitionModel() { // add transitions: for(Index s1=0; s1 oIs=JointToIndividualObservationIndices(jo); for(Index ja=0; ja< GetNrJointActions(); ja++) for(Index s1=0; s1 #include "Globals.h" #include "Policy.h" #include "Interface_ProblemToPolicyDiscrete.h" using namespace PolicyGlobals; /**\brief PolicyDiscrete is a class that represents a discrete * policy. * * A `discrete joint policy' is a policy for a discrete problem. I.e., the * problem specifies, for each agent, a discrete domain for the policy and * discrete actions. * * A PolicyDiscrete from discrete indices over the domain (typically * action-observation histories or types) to (degenerate) probability * distributions over indices over (joint) actions. * * This means that this class includes both pure and stochastic pure policies. * * */ class PolicyDiscrete : // public Referrer, public Policy { private: const Interface_ProblemToPolicyDiscrete* _m_I_PTPD; I_PtPD_constPtr _m_I_PTPDshared; /// Maintains the PolicyDomainCategory. PolicyGlobals::PolicyDomainCategory _m_indexDomCat; protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor PolicyDiscrete( const Interface_ProblemToPolicyDiscrete* iptpd, PolicyGlobals::PolicyDomainCategory idc, Index agentI ) : Policy(agentI), _m_I_PTPD(iptpd), _m_I_PTPDshared(), _m_indexDomCat(idc){}; PolicyDiscrete( const I_PtPD_constPtr &iptpd, PolicyGlobals::PolicyDomainCategory idc, Index agentI ) : Policy(agentI), _m_I_PTPD(0), _m_I_PTPDshared(iptpd), _m_indexDomCat(idc){}; /// Copy constructor. PolicyDiscrete(const PolicyDiscrete& a) : Policy(a), _m_I_PTPD(a._m_I_PTPD), _m_I_PTPDshared(a._m_I_PTPDshared), _m_indexDomCat(a._m_indexDomCat) {}; /// Destructor. virtual ~PolicyDiscrete() {}; //operators: //data manipulation (set) functions: /**\brief Sets the category of the domain over which the indices of * this policy are specified. */ void SetPolicyDomainCategory(PolicyDomainCategory idc) {_m_indexDomCat = idc;} //get (data) functions: /**\brief Returns the Category of the domain over which the indices of * this policy are specified. */ PolicyDomainCategory GetPolicyDomainCategory() const {return (_m_indexDomCat);} /**\brief Returns the probability that the policy specifies action * for domain index i. * * Implementations for pure policies clearly should return 0 or 1. */ virtual double GetActionProb( Index i, Index ja ) const = 0; /**\brief samples an action for domain index i. */ Index SampleAction( Index i ) const; /**\brief return a pointer to the referred * Interface_ProblemToPolicyDiscrete. */ const Interface_ProblemToPolicyDiscrete* GetInterfacePTPDiscrete() const { if(_m_I_PTPD) return _m_I_PTPD; else return _m_I_PTPDshared.get(); } /// Returns a pointer to a copy of this class. virtual PolicyDiscrete* Clone() const = 0; }; #endif /* !_POLICYDISCRETE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/ProblemType.cpp0000644000000000000000000000013212717644275017240 xustar0030 mtime=1463765181.313710478 30 atime=1463765181.313710478 30 ctime=1463765201.705547613 madp-0.4/src/support/ProblemType.cpp0000664000372100037210000000215312717644275020075 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "ProblemType.h" using namespace std; namespace ProblemType { string SoftPrint(Problem_t t) { switch(t) { case(PARSE):return("Parsed problem"); case(FF): return("Fire Fighting"); case(FFF): return("Factored Fire Fighting"); case(FFG): return("Factored Fire Graph"); case(DT): return("Dec-Tiger"); case(Aloha): return("Aloha"); case(DTcreak): return("Dec-Tiger with creaks"); default: return("Unrecognized ProblemType !"); } } }; madp-0.4/src/support/PaxHeaders.5405/JointActionObservationHistory.cpp0000644000000000000000000000013212717644275023015 xustar0030 mtime=1463765181.513708882 30 atime=1463765181.509708914 30 ctime=1463765201.725547454 madp-0.4/src/support/JointActionObservationHistory.cpp0000664000372100037210000001500712717644275023654 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "JointActionObservationHistory.h" #include "JointAction.h" #include "JointObservation.h" #include "PlanningUnitMADPDiscrete.h" #include "JointActionObservationHistoryTree.h" #include "ActionObservationHistoryTree.h" #include "IndexTools.h" using namespace std; #define DEBUG_JAOH 0 //Default constructor JointActionObservationHistory::JointActionObservationHistory(PlanningUnitMADPDiscrete& pu) : _m_planningUnitMADPDiscrete(&pu) { SetLength(0); _m_pred = 0; _m_jaI = 0; //HARDCODED _m_joI = 0; Index individualInitialAOHIndex = 0;//HARDCODED _m_individualActionObservationHistories = vector( _m_planningUnitMADPDiscrete->GetNrAgents(), individualInitialAOHIndex); } JointActionObservationHistory::JointActionObservationHistory(Index jaI, Index joI, JointActionObservationHistory* pred) : _m_planningUnitMADPDiscrete(pred->_m_planningUnitMADPDiscrete) { SetLength(pred->GetLength() + 1); _m_pred = pred; _m_jaI = jaI; _m_joI = joI; //calculate the new individual ActionObservationHistory indices... vector iA = _m_planningUnitMADPDiscrete->JointToIndividualActionIndices(jaI); vector iO = _m_planningUnitMADPDiscrete->JointToIndividualObservationIndices(joI); vector pred_iAOH= pred->GetIndividualActionObservationHistoryIndices(); for(Index agentI = 0; agentI < _m_planningUnitMADPDiscrete->GetNrAgents(); agentI++) { Index next_indivIndex = _m_planningUnitMADPDiscrete->GetSuccessorAOHI(agentI, pred_iAOH[agentI], iA[agentI], iO[agentI] ) ; //Index next_indivIndex = //GetReferred() //=PlanningUnitMADPDiscrete //->GetActionObservationHistoryTree(agentI, pred_iAOH[agentI])//=aoht //->GetSuccessor( iA[agentI], iO[agentI] ) //=aoht' //->GetIndex(); //=aohI' _m_individualActionObservationHistories.push_back(next_indivIndex); } } string JointActionObservationHistory::SoftPrint() const { stringstream ss; if(_m_pred != 0) { if(_m_length >= 1) { ss << _m_pred->SoftPrint(); ss << ", "; } else { ss << "JointActionObservationHistory:Print() -Warning:_m_pred != " << "null, but lenght <= 1 !"<= 1) { ss << "< "; ss << _m_planningUnitMADPDiscrete->GetJointAction(_m_jaI)->SoftPrintBrief(); ss << ", "; ss << _m_planningUnitMADPDiscrete->GetJointObservation(_m_joI)->SoftPrintBrief(); ss << " >"; } else ss << ""; return(ss.str()); } string JointActionObservationHistory::SoftPrintJointIndices() const { stringstream ss; if(_m_pred != 0) { if(_m_length >= 1) { ss << _m_pred->SoftPrintJointIndices(); ss << ", "; } else { ss << "JointActionObservationHistory:Print() -Warning:_m_pred != " << "null, but lenght <= 1 !"<= 1) { ss << "jaoI=" << IndexTools::ActionAndObservation_to_ActionObservationIndex( _m_jaI, _m_joI, _m_planningUnitMADPDiscrete->GetNrJointActions(), _m_planningUnitMADPDiscrete->GetNrJointObservations() ); ss << "(jaI="; ss << _m_jaI; ss << ",joI="; ss << _m_joI; ss << ")"; } else ss << "<>"; return(ss.str()); } void JointActionObservationHistory::GetJointActionObservationHistoryVectors( // JointActionObservationHistory *joah, vector &jaIs, vector &joIs) { vector jaIsReversed; vector joIsReversed; GetJointActionObservationHistoryVectorsRecursive( jaIsReversed, joIsReversed); // reverse both vectors for(vector::reverse_iterator it=jaIsReversed.rbegin(); it!=jaIsReversed.rend(); ++it) jaIs.push_back(*it); for(vector::reverse_iterator it=joIsReversed.rbegin(); it!=joIsReversed.rend(); ++it) joIs.push_back(*it); #if DEBUG_JAOH cout << SoftPrint() << " " << SoftPrintVector(jaIsReversed) << " " << SoftPrintVector(joIsReversed) << endl; #endif } void JointActionObservationHistory::GetJointActionObservationHistoryVectorsRecursive( vector &jaIs, vector &joIs) { if(_m_length >= 1) // for t=0, length=0 (and we don't want to include the //_m_jaI, _m_joI for that stage (they are def'd to be 0) ) { jaIs.push_back(_m_jaI); joIs.push_back(_m_joI); } if(_m_pred!=NULL) _m_pred->GetJointActionObservationHistoryVectorsRecursive(jaIs,joIs); } /* old - this seems strange... void JointActionObservationHistory::GetJointActionObservationHistoryVectors( JointActionObservationHistory *joah, vector &jaIs, vector &joIs) { vector jaIsReversed; vector joIsReversed; GetJointActionObservationHistoryVectorsRecursive(joah, jaIsReversed, joIsReversed); // reverse both vectors for(vector::reverse_iterator it=jaIsReversed.rbegin(); it!=jaIsReversed.rend(); ++it) jaIs.push_back(*it); for(vector::reverse_iterator it=joIsReversed.rbegin(); it!=joIsReversed.rend(); ++it) joIs.push_back(*it); } void JointActionObservationHistory::GetJointActionObservationHistoryVectorsRecursive( JointActionObservationHistory *joah, vector &jaIs, vector &joIs) { if(joah->_m_length > 1) { jaIs.push_back(joah->_m_jaI); joIs.push_back(joah->_m_joI); } if(joah->_m_pred!=NULL) GetJointActionObservationHistoryVectorsRecursive(joah->_m_pred, jaIs,joIs); } */ madp-0.4/src/support/PaxHeaders.5405/ActionObservationHistory.h0000644000000000000000000000013212717644275021456 xustar0030 mtime=1463765181.525708786 30 atime=1463765181.521708818 30 ctime=1463765201.649548061 madp-0.4/src/support/ActionObservationHistory.h0000664000372100037210000000602312717644275022313 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _ACTIONOBSERVATIONHISTORY_H_ #define _ACTIONOBSERVATIONHISTORY_H_ 1 /* the include directives */ #include #include "Globals.h" #include "IndividualHistory.h" //forward declation: class PlanningUnitMADPDiscrete; /// ActionObservationHistory represents an action-observation history of an agent. class ActionObservationHistory : public IndividualHistory { private: ///The index of the observation history contained. Index _m_ohI; ///The index of the action history contained. Index _m_ahI; /**The predecessor together with the last joint actionObservation * (_m_actionObservationI) this gives a full description of * this joint actionObservation history.*/ ActionObservationHistory* _m_pred; PlanningUnitMADPDiscrete* _m_planningUnitMADPDiscrete; protected: public: // Constructor, destructor and copy assignment. /** (default) Constructor - creates a new initial (=empty) * ObservationHistory for agent agentI*/ ActionObservationHistory(PlanningUnitMADPDiscrete& pu, Index agentI); /**Creates the action-observation history resulting from action aI and * obs. oI after ActionObservationHistory pred.*/ ActionObservationHistory(Index aI, Index oI, ActionObservationHistory* pred); //operators: //data manipulation (set) functions: ///Sets the action history index corresponding to this ActObsHist void SetActionHistoryIndex(Index ahI) {_m_ahI = ahI;} ///Sets the observation history index corresponding to this ActObsHist void SetObservationHistoryIndex(Index ohI) {_m_ohI = ohI;} //get (data) functions: ///Gets the action history index corresponding to this ActObsHist Index GetActionHistoryIndex() const {return _m_ahI;} ///Gets the observation history index corresponding to this ActObsHist Index GetObservationHistoryIndex() const {return _m_ohI;} //other /// Returns a pointer to a copy of this class. virtual ActionObservationHistory* Clone() const { return new ActionObservationHistory(*this); } std::string SoftPrint() const; void Print() const { std::cout << SoftPrint();}; }; #endif /* !_ACTIONOBSERVATIONHISTORY_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/MADPDiscreteStatistics.h0000644000000000000000000000013212717644275020722 xustar0030 mtime=1463765181.309710511 30 atime=1463765181.309710511 30 ctime=1463765201.689547741 madp-0.4/src/support/MADPDiscreteStatistics.h0000664000372100037210000000403312717644275021556 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _MADPDISCRETESTATISTICS_H_ #define _MADPDISCRETESTATISTICS_H_ 1 /* the include directives */ #include "Globals.h" #include "MultiAgentDecisionProcessDiscreteInterface.h" /** \brief MADPDiscreteStatistics is a class that represents * an object that can compute some statistics for a MADP Discrete. * These statistics are typically also available from the planning unit * but in some cases, one will want to know them *before* initilizing a PU. * (e.g., to know whether we can cache the joint beliefs). * */ class MADPDiscreteStatistics { private: MultiAgentDecisionProcessDiscreteInterface* _m_madp; size_t _m_h; protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor MADPDiscreteStatistics(MultiAgentDecisionProcessDiscreteInterface* madp, size_t horizon); /// Copy constructor. MADPDiscreteStatistics(const MADPDiscreteStatistics& a); /// Destructor. ~MADPDiscreteStatistics(); /// Copy assignment operator MADPDiscreteStatistics& operator= (const MADPDiscreteStatistics& o); //operators: //data manipulation (set) functions: //get (data) functions: size_t ComputeNrJointActionObservationHistories(); size_t ComputeEstimatedSizeForCachingJointBeliefs(); }; #endif /* !_MADPDISCRETESTATISTICS_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/ActionHistory.h0000644000000000000000000000013212717644275017242 xustar0030 mtime=1463765181.321710415 30 atime=1463765181.321710415 30 ctime=1463765201.645548092 madp-0.4/src/support/ActionHistory.h0000664000372100037210000000550412717644275020102 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _ACTIONHISTORY_H_ #define _ACTIONHISTORY_H_ 1 /* the include directives */ #include #include "Globals.h" #include "E.h" #include "IndividualHistory.h" class PlanningUnitMADPDiscrete; //forward declaration to avoid including each other /// ActionHistory represents an action history of a single agent. /** * It does so by storing an index and a pointer to a preceeding * action history. */ class ActionHistory : public IndividualHistory { private: ///The last action (index). Index _m_actionI; /**True if the last action (index) is empty (i.e., there is * no last action.) This is true for a action history at time step 0. */ bool _m_isEmpty; /**The predecessor joint belief. Together with the last joint * action(_m_actionI) this gives a full description of * this joint action history.*/ ActionHistory* _m_pred; PlanningUnitMADPDiscrete* _m_planningUnitMADPDiscrete; protected: public: // Constructor, destructor and copy assignment. /**(default) Constructor - creates a new initial (=empty) * ActionHistory for agent agentI*/ ActionHistory(PlanningUnitMADPDiscrete& pu, Index agentI); /**Creates a action history specifying aI for the last * action and pred as the preceeding ActionHistory.*/ ActionHistory(Index aI, ActionHistory* pred); /// Destructor. ~ActionHistory(); //operators: //data manipulation (set) functions: //get (data) functions: /// Check whether this history is empty. bool IsEmpty() const {return _m_isEmpty;} ///Returns the index of the last action. Index GetLastActionIndex() const { return _m_actionI; } //other /// Returns a pointer to a copy of this class. virtual ActionHistory* Clone() const { return new ActionHistory(*this); } /// Prints a description of *this* to a string. std::string SoftPrint() const; ///Print *this* to cout. void Print() const { std::cout << SoftPrint();} }; #endif /* !_ACTIONHISTORY_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/PlanningUnitFactoredDecPOMDPDiscrete.cpp0000644000000000000000000000013212717644275023753 xustar0030 mtime=1463765181.493709041 30 atime=1463765181.493709041 30 ctime=1463765201.741547326 madp-0.4/src/support/PlanningUnitFactoredDecPOMDPDiscrete.cpp0000664000372100037210000000574412717644275024621 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "PlanningUnitFactoredDecPOMDPDiscrete.h" #include "FactoredStateAOHDistribution.h" #include "PartialJointPolicyDiscretePure.h" #include "FSAOHDist_NECOF.h" using namespace std; //Default constructor PlanningUnitFactoredDecPOMDPDiscrete::PlanningUnitFactoredDecPOMDPDiscrete( const PlanningUnitMADPDiscreteParameters ¶ms, size_t horizon, FactoredDecPOMDPDiscreteInterface* p ) : PlanningUnitDecPOMDPDiscrete(params,horizon,p) ,_m_fDecPOMDP(p) { if(DEBUG_PU_CONSTRUCTORS) cout << "PlanningUnitFactoredDecPOMDPDiscrete(PlanningUnitMADPDiscreteParameters params, size_t horizon, FactoredDecPOMDPDiscreteInterface* p called" << endl; } PlanningUnitFactoredDecPOMDPDiscrete::PlanningUnitFactoredDecPOMDPDiscrete( size_t horizon, FactoredDecPOMDPDiscreteInterface* p ) : PlanningUnitDecPOMDPDiscrete(horizon,p) ,_m_fDecPOMDP(p) { if(DEBUG_PU_CONSTRUCTORS) cout << "PlanningUnitFactoredDecPOMDPDiscrete(size_t horizon, FactoredDecPOMDPDiscreteInterface* p called" << endl; } /* //Copy assignment constructor. PlanningUnitFactoredDecPOMDPDiscrete::PlanningUnitFactoredDecPOMDPDiscrete(const PlanningUnitFactoredDecPOMDPDiscrete& o) { } //Destructor PlanningUnitFactoredDecPOMDPDiscrete::~PlanningUnitFactoredDecPOMDPDiscrete() { } */ void PlanningUnitFactoredDecPOMDPDiscrete::SetProblem(FactoredDecPOMDPDiscreteInterface* p) { if(p == GetFDPOMDPD()) return; _m_fDecPOMDP = p; //set (and initialize) the problem at PlanningUnitDecPOMDPDiscrete level: DecPOMDPDiscreteInterface* p2 = static_cast(p); PlanningUnitDecPOMDPDiscrete::SetProblem(p2); } FactoredStateAOHDistribution* PlanningUnitFactoredDecPOMDPDiscrete:: GetNewFactoredStateAOHDistribution() const { return new FSAOHDist_NECOF(this); } void PlanningUnitFactoredDecPOMDPDiscrete:: ComputeFSAOHDist( FactoredStateAOHDistribution* fsaoh, const PartialJointPolicyDiscretePure& pJPol) const { Index depth = pJPol.GetDepth(); //cout << "computing factored FSAOHDist for policy of depth"<< depth<InitializeFromISD( GetFDPOMDPD()->GetFactoredISD() ); fsaoh->SanityCheck(); Index lastStage; if(depth > 0) //depth 1 specifies action for t=0 -> compute FSAOH for t=1 lastStage = depth; else return; //cerr<<"starting updates from t=0 to t<"<Update(pJPol); } madp-0.4/src/support/PaxHeaders.5405/Timing.cpp0000644000000000000000000000013212717644275016225 xustar0030 mtime=1463765181.429709553 30 atime=1463765181.425709585 30 ctime=1463765201.745547293 madp-0.4/src/support/Timing.cpp0000664000372100037210000001633212717644275017066 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "Timing.h" #include #include #include using namespace std; //Default constructor Timing::Timing() { _m_timeAtInitialization=GetCpuTime(); } //Destructor Timing::~Timing() { } void Timing::Start(const string & id) { Times newTimer; newTimer.start=GetCpuTime(); newTimer.end=0; newTimer.hasEnded=false; _m_timesMap[id].push_back(newTimer); } void Timing::Stop(const string & id, clock_t endTime) { map >::iterator it=_m_timesMap.find(id); if(it==_m_timesMap.end()) { stringstream ss; ss << "Timing::Stop Could not stop timing event called \"" << id << "\", no such event ever started"; throw(E(ss.str())); } else { it->second.size(); it->second.back().end=endTime; it->second.back().hasEnded=true; } } void Timing::Stop(const string & id) { Stop(id,GetCpuTime()); } void Timing::Print() const { map >::const_iterator i; for(i=_m_timesMap.begin(); i!=_m_timesMap.end(); ++i) { const vector ×=i->second; const string &id=i->first; for(vector::const_iterator j=times.begin(); j!=times.end();++j) { cout << id << ": "; if(j->hasEnded) { cout << j->end - j->start << " start " << j->start << " end " << j->end << endl; } else cout << "still running, started at " << j->start << endl; } } } void Timing::PrintSummary() const { map >::const_iterator i; for(i=_m_timesMap.begin(); i!=_m_timesMap.end(); ++i) { const vector ×=i->second; const string &id=i->first; clock_t total=0,maxTime=0,minTime=INT_MAX,current; int nrSamples=0; for(vector::const_iterator j=times.begin(); j!=times.end();++j) { if(j->hasEnded) { current=j->end - j->start; total+=current; if(current>maxTime) maxTime=current; if(current0) cout << ClockToSeconds(total) << " s in " << nrSamples << " measurements" << ", max " << ClockToSeconds(maxTime) << ", avg " << ClockToSeconds(total)/nrSamples << ", min " << ClockToSeconds(minTime) << endl; else if((times.size()-nrSamples)>0) // this will only // print the correct // "still running" // time if called from // the same process cout << (times.size()-nrSamples) << " still running, spent " << (ClockToSeconds(GetCpuTime()) - ClockToSeconds(i->second[0].start)) << endl; } } void Timing::Save(const string & filename) const { ofstream fp(filename.c_str()); if(!fp) { stringstream ss; ss << "Timing::Save: failed to open file " << filename; throw(E(ss.str())); } Save(fp); } void Timing::Save(ofstream &of) const { of << _m_timeAtInitialization << endl; map >::const_iterator i; for(i=_m_timesMap.begin(); i!=_m_timesMap.end(); ++i) { const vector ×=i->second; const string &id=i->first; for(vector::const_iterator j=times.begin(); j!=times.end();++j) { if(j->hasEnded) of << id << " " << j->start << " " << j->end << endl; } } } void Timing::Load(const string & filename) { bool first=true; ifstream fp(filename.c_str()); if(!fp) { stringstream ss; ss << "Timing::Load: failed to open file " << filename; throw(E(ss)); } _m_timesMap.clear(); string buffer; while(!getline(fp,buffer).eof()) { { string identification; clock_t start,end; Times times; istringstream is(buffer); if(first) { first=false; is >> start; _m_timeAtInitialization=start; } else { is >> identification; is >> start; is >> end; times.start=start; times.end=end; times.hasEnded=true; _m_timesMap[identification].push_back(times); } } } } clock_t Timing::GetCpuTime() const { struct tms timeStruct; times(&timeStruct); return(timeStruct.tms_utime + timeStruct.tms_stime); } double Timing::ClockToSeconds(clock_t clockTicks) const { return(static_cast(clockTicks) / sysconf(_SC_CLK_TCK)); } void Timing::AddEvent(const string & id, clock_t duration) { Start(id); Stop(id,GetCpuTime()+duration); } vector Timing::GetEventDurations(const string & id) const { vector durations; map >::const_iterator it=_m_timesMap.find(id); if(it==_m_timesMap.end()) { stringstream ss; ss << "Timing::GetEventDurations No events called \"" << id << "\" have been stored"; throw(E(ss.str())); } else { const vector ×=it->second; for(vector::const_iterator j=times.begin(); j!=times.end();++j) { if(j->hasEnded) durations.push_back(ClockToSeconds(j->end - j->start)); } } return(durations); } vector Timing::GetRunningEventDurations(const std::string & id) const { vector durations; map >::const_iterator it=_m_timesMap.find(id); if(it==_m_timesMap.end()) { stringstream ss; ss << "Timing::GetRunningEventDurations No events called \"" << id << "\" have been stored"; throw(E(ss.str())); } else { const vector ×=it->second; for(vector::const_iterator j=times.begin(); j!=times.end();++j) { // here we are only interested in events that are still running if(!j->hasEnded) durations.push_back(ClockToSeconds(GetCpuTime() - j->start)); } } return(durations); } madp-0.4/src/support/PaxHeaders.5405/JointBeliefSparse.h0000644000000000000000000000013212717644275020013 xustar0030 mtime=1463765181.313710478 30 atime=1463765181.313710478 30 ctime=1463765201.665547933 madp-0.4/src/support/JointBeliefSparse.h0000664000372100037210000000455512717644275020660 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _JOINTBELIEFSPARSE_H_ #define _JOINTBELIEFSPARSE_H_ 1 /* the include directives */ #include #include "Globals.h" #include "JointBeliefInterface.h" #include "BeliefSparse.h" class MultiAgentDecisionProcessDiscreteInterface; //forward declaration to avoid including each other /// JointBeliefSparse represents a sparse joint belief. class JointBeliefSparse : virtual public JointBeliefInterface, virtual public BeliefSparse { private: /// Slow version of Update(), if GetTransitionModelDiscretePtr() is 0. double UpdateSlow(const MultiAgentDecisionProcessDiscreteInterface &pu, Index lastJAI, Index newJOI); protected: public: // Constructor, destructor and copy assignment. /// Default Constructor JointBeliefSparse(); /// Constructor which sets the \a size of the joint belief. JointBeliefSparse(size_t size); /// Constructor which copies \a belief in this joint belief. JointBeliefSparse(const std::vector &belief); /// Constructor which copies \a belief in this joint belief. JointBeliefSparse(const JointBeliefInterface &belief); JointBeliefSparse(const StateDistribution& belief); /// Destructor. ~JointBeliefSparse(); // operators: using BeliefSparse::operator=; JointBeliefSparse& operator= (const JointBeliefSparse& o); JointBeliefInterface& operator= (const JointBeliefInterface& o); double Update(const MultiAgentDecisionProcessDiscreteInterface &pu, Index lastJAI, Index newJOI); /// Returns a pointer to a copy of this class. virtual JointBeliefSparse* Clone() const { return new JointBeliefSparse(*this); } }; #endif /* !_JOINTBELIEFSPARSE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/JointActionObservationHistoryTree.cpp0000644000000000000000000000013212717644275023635 xustar0030 mtime=1463765181.465709265 30 atime=1463765181.461709297 30 ctime=1463765201.725547454 madp-0.4/src/support/JointActionObservationHistoryTree.cpp0000664000372100037210000001575312717644275024504 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "JointActionObservationHistoryTree.h" #include "PlanningUnitMADPDiscrete.h" #define DEBUG_JAOHT 0 using namespace std; /// Create a joint observation history tree for joh JointActionObservationHistoryTree::JointActionObservationHistoryTree( JointActionObservationHistory * const oh, aoh_t nt) : TreeNode (oh) { _m_nodeType = nt; } //Default constructor /* JointActionObservationHistoryTree::JointActionObservationHistoryTree() { } //Copy constructor. JointActionObservationHistoryTree::JointActionObservationHistoryTree(const JointActionObservationHistoryTree& o) { } //Destructor JointActionObservationHistoryTree::~JointActionObservationHistoryTree() { } //Copy assignment operator JointActionObservationHistoryTree& JointActionObservationHistoryTree::operator= (const JointActionObservationHistoryTree& o) { if (this == &o) return *this; // Gracefully handle self assignment // Put the normal assignment duties here... return *this; } */ void JointActionObservationHistoryTree::SetIndex(LIndex i) { if (_m_nodeType == O_SUC) throw E("Trying JointActionObservationHistoryTree::SetIndex on O_SUC node"); this->TreeNode::SetIndex(i); /* _m_index = i; _m_indexValid = true; */ }; void JointActionObservationHistoryTree::SetSuccessor(Index aI, Index oI, JointActionObservationHistoryTree* suc) { if (_m_nodeType == O_SUC) throw E("Trying JointActionObservationHistoryTree::SetSuccessor(Index aI, Index oI, JointActionObservationHistoryTree* suc) on O_SUC node"); //first see if necessary to create a new intermediate node JointActionObservationHistoryTree* oNode; if (this->TreeNode::ExistsSuccessor(aI)) oNode = (JointActionObservationHistoryTree*) this->TreeNode::GetSuccessor(aI); else //we need to create an intermediate node { oNode = new JointActionObservationHistoryTree(O_SUC); //which is the aI'th successor of this node this->TreeNode::SetSuccessor(aI, oNode); } //let oNode point to the actual successor. //Note: SetSuccessor with 1 index should give no problem for O_SUC nodes oNode->TreeNode::SetSuccessor(oI, suc); } /** Generates a successor if it does not exist yet (in case we did not * generate cache the whole tree). */ JointActionObservationHistoryTree* JointActionObservationHistoryTree::GetSuccessor(Index aI, Index oI) { if (_m_nodeType == O_SUC) throw E("Trying JointActionObservationHistoryTree::SetSuccessor(Index aI, Index oI, JointActionObservationHistoryTree* suc) on O_SUC node"); JointActionObservationHistoryTree* suc; if(this->TreeNode::ExistsSuccessor(aI) && this->TreeNode::GetSuccessor(aI)-> TreeNode::ExistsSuccessor(oI)) // we only put JointActionObservationHistoryTree*'s in here so // this cast should be allowed. suc = (JointActionObservationHistoryTree*) this->TreeNode::GetSuccessor(aI)//oNode ->TreeNode::GetSuccessor(oI); else { // successor does not exist, so let's create it, as we would // in // PlanningUnitMADPDiscrete::CreateJointActionObservationHistories JointActionObservationHistory* jaoh = this-> GetJointActionObservationHistory(); JointActionObservationHistory* next_jaoh = new JointActionObservationHistory(aI, oI, jaoh); JointActionObservationHistoryTree* next_jaoht = new JointActionObservationHistoryTree(next_jaoh); this->SetSuccessor(aI, oI, next_jaoht); next_jaoht->SetIndex(next_jaoh->GetPlanningUnitMADPDiscrete()-> GetSuccessorJAOHI(this->GetIndex(),aI,oI)); // stores the pointer in the big reference vector next_jaoh->GetPlanningUnitMADPDiscrete()-> RegisterJointActionObservationHistoryTree(next_jaoht); suc=next_jaoht; } return(suc); } JointActionObservationHistoryTree* JointActionObservationHistoryTree::GetPredecessor() const { if (GetLength()==0) //ts 0 - length 0 NO INITIAL OBSERVATIONS throw E("Trying JointActionObservationHistoryTree::SetPredeccessor() on root node. (no predecessor)"); if (_m_nodeType == O_SUC) throw E("Trying JointActionObservationHistoryTree::GetPredecessor() on O_SUC node"); JointActionObservationHistoryTree* pred = //we only put JointActionObservationHistoryTree*'s in here so this cast //should be allowed. (JointActionObservationHistoryTree*) this->TreeNode::GetPredecessor()//=oNode ->TreeNode::GetPredecessor();//pred.aNode return(pred); } JointActionObservationHistory* JointActionObservationHistoryTree:: GetJointActionObservationHistory() const { if (_m_nodeType == O_SUC) throw E("Trying JointActionObservationHistoryTree::GetJointActionObservationHistory() on O_SUC node"); return GetContainedElement(); } void JointActionObservationHistoryTree::Print() const { if(_m_nodeType == A_SUC) { if(_m_containedElem == 0) return; cout << "index: "; if(_m_indexValid) cout<< _m_index; else cout << "INVALID"; cout << " - "; _m_containedElem->Print(); cout <*>::const_iterator it = _m_successor.begin(); while(it != _m_successor.end()) { pair< LIndex, TreeNode*> p = *it; TreeNode* suc_tn = p.second; //we only put JointActionObservationHistoryTree's as successors, so //we can do this: JointActionObservationHistoryTree* suc_jaoht = static_cast(suc_tn); if(suc_jaoht != 0) suc_jaoht->Print(); else throw E("JointActionObservationHistoryTree::Print() - encountered"\ "a successor of this JointActionObservationHistoryTree that is 0 (NULL) "); it++; } } madp-0.4/src/support/PaxHeaders.5405/ActionHistoryTree.h0000644000000000000000000000013212717644275020062 xustar0030 mtime=1463765181.297710607 30 atime=1463765181.297710607 30 ctime=1463765201.653548029 madp-0.4/src/support/ActionHistoryTree.h0000664000372100037210000000210212717644275020711 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _ACTIONHISTORYTREE_H_ #define _ACTIONHISTORYTREE_H_ 1 #include "TreeNode.h" /** \class ActionHistoryTree * \brief ActionHistoryTree is a wrapper for ActionHistory. * * See ObservationHistoryTree for documentation. */ class ActionHistory; //redefine GetActionHistory to be the function GetContainedElement #define GetActionHistory GetContainedElement typedef TreeNode ActionHistoryTree; #endif /* !_ACTIONHISTORYTREE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/PolicyPureVector.h0000644000000000000000000000013212717644275017721 xustar0030 mtime=1463765181.413709681 30 atime=1463765181.409709712 30 ctime=1463765201.613548348 madp-0.4/src/support/PolicyPureVector.h0000664000372100037210000001116112717644275020555 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _POLICYPUREVECTOR_H_ #define _POLICYPUREVECTOR_H_ 1 /* the include directives */ #include #include #include "PolicyDiscretePure.h" #include "ObservationHistoryTree.h" #include "E.h" /** \brief PolicyPureVector is a class that represents a pure * (=deterministic) policy. * * The implementation of this particular class is based on a vector of * length nrObservation-histories, that specifies an action index for * each observation history index. Also a policy PolicyPureVector is * a #Referrer to an object that implements the functions defined by * the #Interface_ProblemToPolicyDiscretePure (for example a planning * unit or Bayesian game). */ class PolicyPureVector : public PolicyDiscretePure { private: protected: ///The index of the agent to which this policy belongs. Index _m_agentI; /** \brief The vector that stores the action indices for each * observation history.*/ std::vector _m_domainToActionIndices; public: // Constructor, destructor and copy assignment. // (default) Constructor //PolicyPureVector(); /**Alternate constructor. Associates a problem and agent with the policy * . Information regarding the problem is used to construct a policy * of the proper shape.*/ PolicyPureVector(const Interface_ProblemToPolicyDiscretePure* pu, Index agentI, PolicyGlobals::PolicyDomainCategory idc, size_t depth=MAXHORIZON); PolicyPureVector(const I_PtPD_constPtr &pu, Index agentI, PolicyGlobals::PolicyDomainCategory idc, size_t depth=MAXHORIZON); /// Copy constructor. PolicyPureVector(const PolicyPureVector& a); /// Destructor. virtual ~PolicyPureVector(); virtual PolicyPureVector& operator= (const PolicyPureVector& o); //operators: ///Performs increment. See Increment(). bool operator++ () { return( this->Increment() ); }; /// Get the index of this policy. LIndex GetIndex() const; /// Sets the index of this policy. Updates the policy represented. void SetIndex(LIndex i); //data manipulation (set) functions: /// Initialize the policy to the first policy. /** This is the policy that specifies action 0 --the first * action-- for all observation histories.*/ void ZeroInitialization(); ///Randomly initialize the policy. void RandomInitialization(); ///Randomly initialize the policy for agent agentI. void RandomInitialization(Index agentI) { if(agentI != _m_agentI) throw E("Error, agent index doesn't match."); RandomInitialization(); } /// Increments the policy, used to iterate over policies. /**Policies are enumerable. This function changes a policy to the one * with the next IndexValue. Returns true when increment changes to * policy number from nrPolicies-1 to 0 (carry over signal).*/ bool Increment(); /** \brief Sets the number of time steps for which this policy * is valid.*/ void SetDepth(size_t d); ///Sets the policy to map ohI->aI. void SetAction(Index ohI, Index aI) {_m_domainToActionIndices.at(ohI) = aI;} //get (data) functions: /**Returns the action (index) this policy specifies for a * particular domain index. */ Index GetActionIndex(Index oh) const {return( _m_domainToActionIndices[oh] ); } /// Returns a pointer to a copy of this class. virtual PolicyPureVector* Clone() const { return new PolicyPureVector(*this); } /// Prints a description of this PolicyPureVector to a string. std::string SoftPrint() const; }; #endif /* !_POLICYPUREVECTOR_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/JointBeliefInterface.h0000644000000000000000000000013212717644275020456 xustar0030 mtime=1463765181.321710415 30 atime=1463765181.321710415 30 ctime=1463765201.669547901 madp-0.4/src/support/JointBeliefInterface.h0000664000372100037210000000511612717644275021315 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _JOINTBELIEFINTERFACE_H_ #define _JOINTBELIEFINTERFACE_H_ 1 /* the include directives */ #include #include "Globals.h" #include "BeliefInterface.h" class MultiAgentDecisionProcessDiscreteInterface; //forward declaration to avoid including each other /// JointBeliefInterface represents an interface for joint beliefs. class JointBeliefInterface : virtual public BeliefInterface { private: protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor JointBeliefInterface(){}; /// Destructor. virtual ~JointBeliefInterface(){}; /**\brief assignment operator. * * This must be implemented by the derived class (with this prototype). * * For now, this function is purely abstract. Might there be some * members added to this (base) class, then an implementation could * be made. This should then be called using * PolicyPoolInterface::operator=(o) * from the copy assignment operator of the derived class. See also * http://www.icu-project.org/docs/papers/cpp_report/the_assignment_operator_revisited.html . */ virtual JointBeliefInterface& operator= (const JointBeliefInterface& o)=0; /// Performs a joint belief update on this joint belief. /**Performs the belief update. I.e., given the current joint belief b * (which is represented by \e this), * we compute P(s'|b, a, o) for all new states s'. * This function updates this belief (alter this object). * Returned is the normalization factor P(o|b,a), which is also to * probability that this new history (belief) occurs given the previous * one. */ virtual double Update(const MultiAgentDecisionProcessDiscreteInterface &pu, Index lastJAI, Index newJOI) = 0; /// Returns a pointer to a copy of this class. virtual JointBeliefInterface* Clone() const = 0; }; #endif /* !_JOINTBELIEFINTERFACE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/TimedAlgorithm.cpp0000644000000000000000000000013212717644275017707 xustar0030 mtime=1463765181.413709681 30 atime=1463765181.413709681 30 ctime=1463765201.745547293 madp-0.4/src/support/TimedAlgorithm.cpp0000664000372100037210000000310412717644275020541 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "TimedAlgorithm.h" #include using namespace std; //Default constructor TimedAlgorithm::TimedAlgorithm() { _m_timer=new Timing(); } //Destructor TimedAlgorithm::~TimedAlgorithm() { delete _m_timer; } void TimedAlgorithm::StartTimer(const string & id) const { _m_timer->Start(id); } void TimedAlgorithm::StopTimer(const string & id) const { _m_timer->Stop(id); } void TimedAlgorithm::PrintTimers() const { _m_timer->Print(); } void TimedAlgorithm::SaveTimers(const string & filename) const { _m_timer->Save(filename); } void TimedAlgorithm::SaveTimers(ofstream &of) const { _m_timer->Save(of); } void TimedAlgorithm::LoadTimers(const string & filename) { _m_timer->Load(filename); } void TimedAlgorithm::PrintTimersSummary() const { _m_timer->PrintSummary(); } void TimedAlgorithm::AddTimedEvent(const string & id, clock_t duration) { _m_timer->AddEvent(id,duration); } vector TimedAlgorithm::GetTimedEventDurations(const string & id) { return(_m_timer->GetEventDurations(id)); } madp-0.4/src/support/PaxHeaders.5405/NullPlannerFactored.cpp0000644000000000000000000000013212717644275020700 xustar0030 mtime=1463765181.477709169 30 atime=1463765181.473709201 30 ctime=1463765201.745547293 madp-0.4/src/support/NullPlannerFactored.cpp0000664000372100037210000000327512717644275021543 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "NullPlannerFactored.h" NullPlannerFactored::NullPlannerFactored(FactoredDecPOMDPDiscreteInterface* p) { PlanningUnitMADPDiscreteParameters params; params.SetComputeAll(false); SetParams(params); SetProblem(p); } NullPlannerFactored::NullPlannerFactored(size_t horizon, FactoredDecPOMDPDiscreteInterface* p) { PlanningUnitMADPDiscreteParameters params; params.SetComputeAll(false); SetParams(params); SetProblem(p); SetHorizon(horizon); } NullPlannerFactored::NullPlannerFactored(const PlanningUnitMADPDiscreteParameters ¶ms, size_t horizon, FactoredDecPOMDPDiscreteInterface* p) : PlanningUnitFactoredDecPOMDPDiscrete(params,horizon,p) { } void NullPlannerFactored::Plan() { throw(E("NullPlannerFactored::Plan() should not be called")); } double NullPlannerFactored::GetExpectedReward() const { throw(E("NullPlannerFactored::GetExpectedReward() should not be called")); return(0); } boost::shared_ptr NullPlannerFactored::GetJointPolicy() { throw(E("NullPlannerFactored::GetJointPolicy() should not be called")); return(boost::shared_ptr()); } madp-0.4/src/support/PaxHeaders.5405/PolicyPureVector.cpp0000644000000000000000000000013212717644275020254 xustar0030 mtime=1463765181.325710382 30 atime=1463765181.321710415 30 ctime=1463765201.697547676 madp-0.4/src/support/PolicyPureVector.cpp0000664000372100037210000001466512717644275021124 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "PolicyPureVector.h" #include "IndexTools.h" #include using namespace std; #define DEBUG_PPV 0 using std::stringstream; PolicyPureVector::PolicyPureVector( const Interface_ProblemToPolicyDiscretePure* pu, Index agentI, PolicyGlobals::PolicyDomainCategory idc, size_t depth ) : PolicyDiscretePure(pu,idc, agentI) { Index nrDE = GetInterfacePTPDiscretePure()-> GetNrPolicyDomainElements(agentI, GetPolicyDomainCategory(), depth); if(DEBUG_PPV) cout << "PolicyPureVector(): creating policy for agent "<(nrDE, 0); } PolicyPureVector::PolicyPureVector( const I_PtPD_constPtr &pu, Index agentI, PolicyGlobals::PolicyDomainCategory idc, size_t depth ) : PolicyDiscretePure(pu,idc, agentI) { Index nrDE = GetInterfacePTPDiscretePure()-> GetNrPolicyDomainElements(agentI, GetPolicyDomainCategory(), depth); if(DEBUG_PPV) cout << "PolicyPureVector(): creating policy for agent "<(nrDE, 0); } //Copy assignment constructor. PolicyPureVector::PolicyPureVector(const PolicyPureVector& o) : PolicyDiscretePure(o) { if(DEBUG_PPV) cout << " clone PolicyPureVector "; _m_agentI = o._m_agentI; _m_domainToActionIndices =vector(o._m_domainToActionIndices); } //Destructor PolicyPureVector::~PolicyPureVector() { _m_domainToActionIndices.clear(); } PolicyPureVector& PolicyPureVector::operator= (const PolicyPureVector& o) { if (this == &o) return *this; // Gracefully handle self assignment // Put the normal assignment duties here... PolicyDiscretePure::operator= ( o ); _m_agentI = o._m_agentI; _m_domainToActionIndices = o._m_domainToActionIndices; return *this; } void PolicyPureVector::ZeroInitialization() { if(DEBUG_PPV)cout << ">>>PolicyPureVector::ZeroInitialization(): for agent " << _m_agentI << endl; vector::iterator it = _m_domainToActionIndices.begin(); vector::iterator last = _m_domainToActionIndices.end(); while(it != last) { *it = 0; it++; } } void PolicyPureVector::RandomInitialization() { if(DEBUG_PPV) cout << ">>>PolicyPureVector::RandomInitialization(): for agent " << _m_agentI << endl; Index nrA = GetInterfacePTPDiscretePure()->GetNrActions(_m_agentI); vector::iterator it = _m_domainToActionIndices.begin(); vector::iterator last = _m_domainToActionIndices.end(); while(it != last) { int r = rand(); if(DEBUG_PPV) cout << "rand() = " <GetNrActions(_m_agentI); size_t nrOH = GetInterfacePTPDiscretePure()-> GetNrPolicyDomainElements(_m_agentI, GetPolicyDomainCategory(), GetDepth()); //i is an integer index counting from nrObservationHistories-1 (=the last // observation history) to 0 //(corresponding to the first (empty) observation sequence. Index i = nrOH - 1; while(carry_over) { _m_domainToActionIndices.at(i) = (_m_domainToActionIndices.at(i) + 1) % nrA; carry_over = (_m_domainToActionIndices.at(i) == 0); if(i > 0) i--; else break; } return(carry_over); } LIndex PolicyPureVector::GetIndex() const { int nrO=GetInterfacePTPDiscretePure()-> GetNrPolicyDomainElements(_m_agentI, GetPolicyDomainCategory(), GetDepth() ), nrA=GetInterfacePTPDiscretePure()->GetNrActions(_m_agentI); LIndex i=0; vector nrElems(2); nrElems[0]=1; nrElems[1]=nrA; vector indexVec(2); for(int o=0;o!=nrO;++o) { nrElems[0]*=nrO; indexVec[0]=i; indexVec[1]=_m_domainToActionIndices[o]; i=IndexTools::IndividualToJointIndices(indexVec,nrElems); } return(i); } void PolicyPureVector::SetIndex(LIndex i) { int nrO=GetInterfacePTPDiscretePure()-> GetNrPolicyDomainElements(_m_agentI, GetPolicyDomainCategory(), GetDepth()), nrA=GetInterfacePTPDiscretePure()->GetNrActions(_m_agentI); vector nrElems(2); nrElems[0]=static_cast(pow(static_cast(nrA),nrO)); nrElems[1]=nrA; vector indexVec(2); for(int o=nrO-1;o>=0;--o) { nrElems[0]/=nrO; indexVec=IndexTools::JointToIndividualIndices(i,nrElems); SetAction(o,CastLIndexToIndex(indexVec[1])); i=indexVec[0]; } } void PolicyPureVector::SetDepth(size_t d) { Policy::SetDepth(d); _m_domainToActionIndices.resize( GetInterfacePTPDiscretePure()->GetNrPolicyDomainElements( _m_agentI, GetPolicyDomainCategory(), d)); } string PolicyPureVector::SoftPrint() const { vector::const_iterator it = _m_domainToActionIndices.begin(); vector::const_iterator last = _m_domainToActionIndices.end(); //const ObservationHistoryTree* oht; Index dIndex = 0; stringstream ss; while(it != last) { ss << GetInterfacePTPDiscretePure()->SoftPrintPolicyDomainElement (_m_agentI, dIndex, GetPolicyDomainCategory() ); ss << " --> "; ss << GetInterfacePTPDiscretePure()->SoftPrintAction(_m_agentI, *it); ss << endl; it++; dIndex++; } return(ss.str()); } madp-0.4/src/support/PaxHeaders.5405/PartialJointPolicyDiscretePure.cpp0000644000000000000000000000013212717644275023075 xustar0030 mtime=1463765181.453709361 30 atime=1463765181.453709361 30 ctime=1463765201.701547645 madp-0.4/src/support/PartialJointPolicyDiscretePure.cpp0000664000372100037210000000220612717644275023731 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "PartialJointPolicyDiscretePure.h" using namespace std; //Copy assignment operator PartialJointPolicyDiscretePure& PartialJointPolicyDiscretePure::operator= (const PartialJointPolicyDiscretePure& o) { #if DEBUG_JPOLASSIGN cerr << "PartialJointPolicyDiscretePure& PartialJointPolicyDiscretePure::operator= (const PartialJointPolicyDiscretePure& o) called"< #include "Globals.h" #include "Belief.h" #include "JointBeliefInterface.h" class MultiAgentDecisionProcessDiscreteInterface; //forward declaration to avoid including each other /** * \brief JointBelief stores a joint belief, represented as a regular * (dense) vector of doubles. */ class JointBelief : virtual public JointBeliefInterface, virtual public Belief { private: protected: public: /// Constructor which sets the \a size of the joint belief. JointBelief(size_t size=0); /// Constructor which copies \a belief in this joint belief. JointBelief(const std::vector &belief); /// Constructor which copies \a belief in this joint belief. JointBelief(const JointBeliefInterface &belief); JointBelief(const StateDistribution& belief); /// Destructor ~JointBelief(); JointBelief& operator= (const JointBelief& o); JointBeliefInterface& operator= (const JointBeliefInterface& o); double Update(const MultiAgentDecisionProcessDiscreteInterface &pu, Index lastJAI, Index newJOI); /// Returns a pointer to a copy of this class. virtual JointBelief* Clone() const { return new JointBelief(*this); } }; #endif /* !_JOINTBELIEF_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/Timing.h0000644000000000000000000000013212717644275015672 xustar0030 mtime=1463765181.477709169 30 atime=1463765181.477709169 30 ctime=1463765201.685547772 madp-0.4/src/support/Timing.h0000664000372100037210000000510112717644275016523 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _TIMING_H_ #define _TIMING_H_ 1 /* the include directives */ #include #include "Globals.h" #include #include #include #include /** \brief Timing provides a simple way of timing code. */ class Timing { private: /// Stores the start and end of a timespan, in clock cycles. struct Times { clock_t start, end; bool hasEnded; }; /// Keeps track of timing info. std::map > _m_timesMap; /// The clock cycle at which the class is initialized. clock_t _m_timeAtInitialization; clock_t GetCpuTime() const; double ClockToSeconds(clock_t clockTicks) const; void Stop(const std::string & id, clock_t duration); protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor Timing(); /// Destructor. ~Timing(); /// Start to time an event identified by \a id. void Start(const std::string & id); /// Stop to time an event identified by \a id. void Stop(const std::string & id); /// Print stored timing info. void Print() const; /// Sums data and prints out a summary. void PrintSummary() const; /// Save collected timing info to file \a filename. void Save(const std::string & filename) const; /// Save collected timing info to ofstream \a of. void Save(std::ofstream &of) const; /// Load timing info from file \a filename. void Load(const std::string & filename); /// Adds event of certain duration, e.g., an external program call. void AddEvent(const std::string & id, clock_t duration); /// Returns how long ago (in s) a particular event has been started. std::vector GetRunningEventDurations(const std::string & id) const; /// Returns all stored durations (in s) for a particular event. std::vector GetEventDurations(const std::string & id) const; }; #endif /* !_TIMING_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/JointPolicy.h0000644000000000000000000000013112717644275016705 xustar0030 mtime=1463765181.437709489 30 atime=1463765181.437709489 29 ctime=1463765201.62954822 madp-0.4/src/support/JointPolicy.h0000664000372100037210000000633712717644275017553 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _JOINTPOLICY_H_ #define _JOINTPOLICY_H_ 1 /* the include directives */ #include #include "Globals.h" #define DEBUG_JPOLASSIGN 0 ///JointPolicy is a class that represents a joint policy. /** It contains the notion of the depth of a policy: a positive number * that specifies for how many time steps this policy is * specified. I.e., if depth < horizon, the object represents a * partially specified policy (specified for time steps * 0,...,depth-1)*/ class JointPolicy { private: /**\brief The depth of this joint policy. * * The depth of the policy is the number of stages for which it specifies actions. * It ranges from: \n * 0 (the empty policy), \n * 1 (a policy specified only for ts=0), \n * : * MAXHORIZON (a policy specified for all stages, the default value). \n */ size_t _m_depth; protected: ///some other numbers we cache: size_t _m_nrAgents; public: // Constructor, destructor and copy assignment. /// Constructor, initializes the depth to the maximum horizon. JointPolicy(size_t nrAg) : _m_depth(MAXHORIZON), _m_nrAgents(nrAg) {}; /// copy constructor: JointPolicy(const JointPolicy& o) : _m_depth(o._m_depth),_m_nrAgents(o._m_nrAgents) {}; /// copy assignment operator virtual JointPolicy& operator= (const JointPolicy& o) { #if DEBUG_JPOLASSIGN std::cerr << "JointPolicy& JointPolicy::operator= (const JointPolicy& o) called\n"< #include "Globals.h" #include "boost/numeric/ublas/matrix_sparse.hpp" #include "boost/numeric/ublas/matrix.hpp" /// Represents a set of (alpha) vectors. typedef boost::numeric::ublas::matrix VectorSet; typedef VectorSet::const_iterator1 VScit1; typedef VectorSet::iterator1 VSit1; typedef VectorSet::const_iterator2 VScit2; typedef VectorSet::iterator2 VSit2; #endif /* !_VECTORSET_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/JointPolicyDiscrete.h0000644000000000000000000000013112717644275020370 xustar0030 mtime=1463765181.541708658 29 atime=1463765181.53770869 30 ctime=1463765201.617548316 madp-0.4/src/support/JointPolicyDiscrete.h0000664000372100037210000001500212717644275021223 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _JOINTPOLICYDISCRETE_H_ #define _JOINTPOLICYDISCRETE_H_ 1 /* the include directives */ #include #include #include "Globals.h" #include "JointPolicy.h" #include "Interface_ProblemToPolicyDiscrete.h" using namespace PolicyGlobals; class PolicyDiscrete; /**\brief JointPolicyDiscrete is a class that represents a discrete joint * policy. * * A `discrete joint policy' is a policy for a discrete problem. I.e., the * problem specifies, for each agent, a discrete domain for the policy and * discrete actions. * * A JointPolicyDiscrete from discrete indices over the domain (typically * action-observation histories or types) to (degenerate) probability * distributions over indices over (joint) actions. * * This means that this class includes both pure and stochastic pure policies. * * */ class JointPolicyDiscrete : public JointPolicy { private: /// Maintains the PolicyDomainCategory. PolicyGlobals::PolicyDomainCategory _m_indexDomCat; /// Interface that allows this policy to get some info on the problem const Interface_ProblemToPolicyDiscrete* _m_PTPD; I_PtPD_constPtr _m_PTPDshared; protected: public: // Constructor, destructor and copy assignment. /// default constructor creates an empty policy JointPolicyDiscrete() : JointPolicy(0), _m_PTPD(0) {}; /// (default) Constructor JointPolicyDiscrete(const Interface_ProblemToPolicyDiscrete *pu, PolicyGlobals::PolicyDomainCategory idc ); JointPolicyDiscrete(const I_PtPD_constPtr &pu, PolicyGlobals::PolicyDomainCategory idc ); /// Copy constructor. JointPolicyDiscrete(const JointPolicyDiscrete& a); /// Destructor. virtual ~JointPolicyDiscrete() {}; /// Assignment operator virtual JointPolicyDiscrete& operator= (const JointPolicyDiscrete& o); //operators: //data manipulation (set) functions: /**\brief sets the category of the domain over which the indices of * this policy are specified. */ void SetPolicyDomainCategory(PolicyDomainCategory idc) {_m_indexDomCat = idc;}; //get (data) functions: /**\brief returns the Category of the domain over which the indices of * this policy are specified. */ PolicyDomainCategory GetPolicyDomainCategory() const {return (_m_indexDomCat);}; /**\brief return pointer to individual policy of agent agI */ virtual PolicyDiscrete* GetIndividualPolicyDiscrete(Index agI) const = 0; /**\brief Returns the probability that the policy of * agentI specifies action aI * for domain index domI. * * Implementations for pure policies clearly should return 0 or 1. */ virtual double GetActionProb( Index agentI, Index domI, Index aI ) const = 0; /**\brief Returns the probability that the policy specifies joint action * for joint domain index i. * * Implementations for pure policies clearly should return 0 or 1. */ virtual double GetJointActionProb( Index i, Index ja ) const = 0; /**\brief Returns the probability that the policy specifies joint action * for joint domain index i. * * Implementations for pure policies clearly should return 0 or 1. */ virtual double GetJointActionProb( LIndex i, Index ja ) const = 0; /**\brief Returns a sampled joint action. * i is the i-th joint domain index */ Index SampleJointAction( Index i ) const; /**\brief Returns a sampled joint action. * Is is the vector of domain indices */ Index SampleJointAction( const std::vector& Is ) const; /**\brief Returns a sampled joint action. * i is the i-th joint domain index */ void SampleJointActionVector(Index i, std::vector& jaVec ) const; /**\brief Returns a sampled joint action. * Is is the vector of domain indices */ void SampleJointActionVector( const std::vector& Is, std::vector& jaVec ) const; /**\brief return a pointer to the referred * Interface_ProblemToPolicyDiscrete. */ const Interface_ProblemToPolicyDiscrete* GetInterfacePTPDiscrete() const { if(_m_PTPDshared!=0) std::cerr << "Calling GetInterfacePTPDiscrete(), should use GetInterfacePTPDiscreteShared() instead" << std::endl; if(_m_PTPD) return _m_PTPD; else return _m_PTPDshared.get(); } /**\brief return a shared pointer to the referred * Interface_ProblemToPolicyDiscrete. */ boost::shared_ptr GetInterfacePTPDiscreteShared() const { return _m_PTPDshared; } /**\brief sets the pointer to the Interface_ProblemToPolicyDiscrete. */ void SetInterfacePTPDiscrete(const Interface_ProblemToPolicyDiscrete* p) {_m_PTPD = p;} /**\brief sets the shared pointer to the Interface_ProblemToPolicyDiscrete. */ void SetInterfacePTPDiscrete(I_PtPD_constPtr p) {_m_PTPDshared = p;} /// Returns the number of policy domain elements for agent agentI. size_t GetNrDomainElements(Index agentI) const { return(GetInterfacePTPDiscrete()->GetNrPolicyDomainElements(agentI, GetPolicyDomainCategory() )); }; /// Returns a pointer to a copy of this class. virtual JointPolicyDiscrete* Clone() const = 0; }; #endif /* !_JOINTPOLICYDISCRETE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/PolicyDiscretePure.h0000644000000000000000000000013212717644275020221 xustar0030 mtime=1463765181.325710382 30 atime=1463765181.325710382 30 ctime=1463765201.613548348 madp-0.4/src/support/PolicyDiscretePure.h0000664000372100037210000000610512717644275021057 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _POLICYDISCRETEPURE_H_ #define _POLICYDISCRETEPURE_H_ 1 /* the include directives */ #include #include "Globals.h" #include "Interface_ProblemToPolicyDiscretePure.h" #include "PolicyDiscrete.h" /** \brief PolicyDiscretePure is an abstract class that represents a * pure policy for a discrete MADP. * * The number of pure policies as represented by this class is finite. * Therefore it is possible * */ class PolicyDiscretePure : public PolicyDiscrete { private: protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor PolicyDiscretePure( const Interface_ProblemToPolicyDiscretePure* pu, PolicyGlobals::PolicyDomainCategory idc, Index agentI ); PolicyDiscretePure( const I_PtPD_constPtr &pu, PolicyGlobals::PolicyDomainCategory idc, Index agentI ); /// Copy constructor. PolicyDiscretePure(const PolicyDiscretePure& a); /// Destructor. virtual ~PolicyDiscretePure() {} //operators: //data manipulation (set) functions: /// Randomly initialize the policy. //virtual void RandomInitialization() = 0; /// Randomly initialize the policy for agentI. virtual void RandomInitialization(Index agentI) = 0; //get (data) functions: /// Return pointer to the Interface_ProblemToPolicyDiscretePure. const Interface_ProblemToPolicyDiscretePure* GetInterfacePTPDiscretePure() const { const Interface_ProblemToPolicyDiscrete* p = GetInterfacePTPDiscrete(); const Interface_ProblemToPolicyDiscretePure* pp = dynamic_cast(p); return pp; } /** \brief Returns the jaI taken by this policy for domain * index i.*/ virtual Index GetActionIndex(Index i) const = 0; /**\brief Returns the probability that the policy specifies * action aI for domain index i. * * Required by PolicyDiscrete. */ double GetActionProb( Index i, Index aI ) const; /// Returns a pointer to a copy of this class. virtual PolicyDiscretePure* Clone() const = 0; }; #endif /* !_POLICYDISCRETEPURE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/Belief.cpp0000644000000000000000000000013212717644275016164 xustar0030 mtime=1463765181.405709744 30 atime=1463765181.401709776 30 ctime=1463765201.729547421 madp-0.4/src/support/Belief.cpp0000664000372100037210000001040212717644275017015 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "Belief.h" #include "BeliefIterator.h" #include "BeliefIteratorGeneric.h" #include #include "StateDistributionVector.h" using namespace std; #define Belief_CheckAndAbort 0 Belief::Belief(size_t size) { _m_b.assign(size,0); } Belief::Belief(const vector &belief) { _m_b=belief; #if Belief_CheckAndAbort if(!SanityCheck()) abort(); #endif } Belief::Belief(const BeliefInterface &belief) { _m_b.resize(belief.Size()); for(unsigned int i=0; i!=belief.Size(); ++i) _m_b[i]=belief.Get(i); #if BeliefSparse_CheckAndAbort if(!SanityCheck()) abort(); #endif } Belief::Belief(const StateDistribution& belief) { this->Set(belief); } //Destructor Belief::~Belief() { } Belief& Belief::operator= (const Belief& o) { if (this == &o) return *this; // Gracefully handle self assignment // Put the normal assignment duties here... _m_b = o._m_b; return *this; } BeliefInterface& Belief::operator= (const BeliefInterface& o) { if (this == &o) return *this; // Gracefully handle self assignment const Belief& casted_o = dynamic_cast(o); return(operator=(casted_o));// call the operator= for Belief } void Belief::Set(const vector &belief) { _m_b.resize(belief.size()); _m_b=belief; #if Belief_CheckAndAbort if(!SanityCheck()) abort(); #endif } void Belief::Set(const StateDistribution& belief) { const StateDistributionVector *b; if((b=dynamic_cast( &belief ))) _m_b=*b; else Set(belief.ToVectorOfDoubles()); } void Belief::Set(const BeliefInterface &belief) { _m_b.resize(belief.Size()); _m_b.clear(); for(unsigned int i=0; i!=belief.Size(); ++i) _m_b[i]=belief.Get(i); #if Belief_CheckAndAbort if(!SanityCheck()) abort(); #endif } void Belief::Clear() { _m_b.clear(); } string Belief::SoftPrint() const { #if Belief_CheckAndAbort if(!SanityCheck()) abort(); #endif return(SoftPrintVector( (vector) _m_b )); } bool Belief::SanityCheck() const { // check for negative and entries>1 double sum=0; for(vector::const_iterator it=_m_b.begin(); it!=_m_b.end(); ++it) { if(*it<0) return(false); if(*it>1) return(false); if(std::isnan(*it)) return(false); sum+=*it; } // check if sums to 1 if(abs(sum-1)>PROB_PRECISION) return(false); // check whether the size is not zero if(_m_b.size()==0) return(false); // if we haven't returned yet, the belief is fine return(true); } double Belief::InnerProduct(const vector &values) const { #if Belief_CheckAndAbort if(!SanityCheck()) abort(); #endif double x=0; for(unsigned int s=0; s!=_m_b.size(); ++s) x+=_m_b[s]*values[s]; return(x); } vector Belief::InnerProduct(const VectorSet &v) const { vector values(v.size1()); double x; for(unsigned int k=0;k!=v.size1();++k) { x=0; for(unsigned int s=0; s!=_m_b.size(); ++s) x+=_m_b[s]*v(k,s); values[k]=x; } return(values); } vector Belief::InnerProduct(const VectorSet &v, const vector &mask) const { vector values(v.size1(),-DBL_MAX); double x; for(unsigned int k=0;k!=v.size1();++k) { if(mask[k]) { x=0; for(unsigned int s=0; s!=_m_b.size(); ++s) x+=_m_b[s]*v(k,s); values[k]=x; } } return(values); } BeliefIteratorGeneric Belief::GetIterator() const { return(BeliefIteratorGeneric(new BeliefIterator(this))); } madp-0.4/src/support/PaxHeaders.5405/BeliefIterator.h0000644000000000000000000000013012717644275017341 xustar0029 mtime=1463765181.49770901 29 atime=1463765181.49770901 30 ctime=1463765201.673547868 madp-0.4/src/support/BeliefIterator.h0000664000372100037210000000326612717644275020206 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _BELIEFITERATOR_H_ #define _BELIEFITERATOR_H_ 1 /* the include directives */ #include "Globals.h" #include "BeliefIteratorInterface.h" #include "Belief.h" /** \brief BeliefIterator is an iterator for dense beliefs. */ class BeliefIterator : public BeliefIteratorInterface { private: Index _m_i; const Belief *_m_belief; protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor BeliefIterator(const Belief *b) : _m_i(0), _m_belief(b){} /// Destructor. virtual ~BeliefIterator(){} double GetProbability() const { return(_m_belief->_m_b[_m_i]); } Index GetStateIndex() const { return(_m_i); } bool Next() { if(_m_i>=(_m_belief->_m_b.size()-1)) return(false); else { _m_i++; return(true); } } /// Returns a pointer to a copy of this class. virtual BeliefIterator* Clone() const { return new BeliefIterator(*this); } }; #endif /* !_BELIEFITERATOR_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/JointPolicyPureVector.h0000644000000000000000000000013212717644275020725 xustar0030 mtime=1463765181.461709297 30 atime=1463765181.457709328 30 ctime=1463765201.621548283 madp-0.4/src/support/JointPolicyPureVector.h0000664000372100037210000002337112717644275021567 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _JOINTPOLICYPUREVECTOR_H_ #define _JOINTPOLICYPUREVECTOR_H_ 1 /* the include directives */ #include #include #include "Globals.h" #include "JointPolicyDiscretePure.h" #include "JPolComponent_VectorImplementation.h" #include "boost/shared_ptr.hpp" class JointPolicyPureVector; typedef boost::shared_ptr JPPV_sharedPtr; /// JointPolicyPureVector represents a discrete pure joint policy. /** * Each of the individual policies is a PolicyPureVector - a * deterministic mapping from observations to actions implemented by a * tree. This class acts as a wrapper. It contains a vector with * pointers to indiv. policies. * * we delete the PolicyPureVectors pointed to: this means that we should not * be able to add indiv. policies without copying them!!! * * */ class JointPolicyPureVector : //virtual <- this leads to pain in the ass... public JointPolicyDiscretePure, private JPolComponent_VectorImplementation // use private inheritance for composition { private: /** \brief Private function that deletes all the individual * policies pointed to.*/ void ClearIndividualPolicies(); protected: std::vector _m_indivPols_PolicyPureVector; public: // Constructor, destructor and copy assignment. /**\brief Constructor. * * Associates a problem (typically a planning unit) with the joint * policy. Information regarding the problem is used to construct a * joint policy of the proper shape. * * Use the default PolicyDomainCategory defined by pu. * */ JointPolicyPureVector(const Interface_ProblemToPolicyDiscretePure* pu) : JointPolicyDiscretePure( pu , pu->GetDefaultIndexDomCat() ), JPolComponent_VectorImplementation(pu, pu->GetDefaultIndexDomCat() ) {}; /**\brief Constructor. * * Associates a problem (typically a planning unit) with the joint * policy. Information regarding the problem is used to construct a * joint policy of the proper shape. * * idc is the PolicyDomainCategory over which the policy is specified. * * */ JointPolicyPureVector(const Interface_ProblemToPolicyDiscretePure* pu, PolicyGlobals::PolicyDomainCategory idc ) : JointPolicyDiscretePure(pu, idc), JPolComponent_VectorImplementation(pu, idc) {}; /**\brief Constructor. * * Associates a problem (typically a planning unit) with the joint * policy. Information regarding the problem is used to construct a * joint policy of the proper shape. * * Use the default PolicyDomainCategory defined by pu. * */ JointPolicyPureVector(I_PtPDpure_constPtr pu) : JointPolicyDiscretePure( pu , pu->GetDefaultIndexDomCat() ), JPolComponent_VectorImplementation(pu, pu->GetDefaultIndexDomCat() ) {}; /**\brief Constructor. * * Associates a problem (typically a planning unit) with the joint * policy. Information regarding the problem is used to construct a * joint policy of the proper shape. * * idc is the PolicyDomainCategory over which the policy is specified. * * */ JointPolicyPureVector(I_PtPDpure_constPtr pu, PolicyGlobals::PolicyDomainCategory idc ) : JointPolicyDiscretePure(pu, idc), JPolComponent_VectorImplementation(pu, idc) {}; /// Copy constructor. JointPolicyPureVector(const JointPolicyPureVector& a) : JointPolicyDiscretePure(a) , JPolComponent_VectorImplementation(a) {}; #if 0 // this can only lead to problems... /// Copy constructor from base class a JointPolicyPureVector(const JointPolicyDiscretePure& a) : JointPolicyDiscretePure(a), JPolComponent_VectorImplementation( dynamic_cast( a ) ) {}; #endif /// Copy constructor from base class a JointPolicyPureVector(const JointPolicyDiscretePure& a1, const JPolComponent_VectorImplementation& a2) : JointPolicyDiscretePure(a1), JPolComponent_VectorImplementation( a2 ) {}; private: public: /// Destructor. virtual ~JointPolicyPureVector() {}; /**The copy assignment operator - makes deep copies using * PolicyPureVector::operator= which makes deep copies.*/ JointPolicyPureVector& operator= (const JointPolicyPureVector& jp); /**The copy assignment operator - makes deep copies using * PolicyPureVector::operator= which makes deep copies.*/ JointPolicyPureVector& operator= (const JointPolicyDiscretePure& jp); bool operator< (const JointPolicy& o) const { const JointPolicyPureVector& p = dynamic_cast(o); return (*this) < p; } bool operator< (const JointPolicyPureVector& o) const { return (GetIndex() < o.GetIndex()) ; } /// Sets the depth of the joint policy. /** Also sets the depth of each of the invididual policies. */ void SetDepth(size_t d) { if(d==MAXHORIZON) throw(E("JointPolicyPureVector can only be used for finite horizons.")); JointPolicy::SetDepth(d); JPolComponent_VectorImplementation::SetDepthForIndivPols(d); }; /// Prints a description of this JointPolicyPureVector to a string. std::string SoftPrint() const; /// Prints a brief description to a string. std::string SoftPrintBrief() const; void PrintBrief() const { std::cout << SoftPrintBrief();} /**\brief Convert this joint policy to a JointPolicyPureVector. */ JPPV_sharedPtr ToJointPolicyPureVector() const; //relay the following functions to the JPolComponent_VectorImplementation: ///Performs increment. See Increment(). bool operator++ () { return( this->Increment() ); }; bool Increment(Index agentI) { return this->JPolComponent_VectorImplementation::Increment(agentI); } bool Increment() { return this->JPolComponent_VectorImplementation::Increment(); } /// Get the index of this joint policy. LIndex GetIndex() const { return this->JPolComponent_VectorImplementation::GetIndex(); } /// Sets the index of this joint policy.Updates the policies represented void SetIndex(LIndex i) { this->JPolComponent_VectorImplementation::SetIndex(i); } ///Returns the jaI taken by this policy for joint domain index johI. inline Index GetJointActionIndex(Index i) const { return JPolComponent_VectorImplementation::GetJointActionIndex(i); } inline Index GetJointActionIndex(LIndex i) const { return JPolComponent_VectorImplementation::GetJointActionIndex(i); } ///Returns the action index for domainI for agent aI. Index GetActionIndex(Index agI , Index domainI) const { return JPolComponent_VectorImplementation::GetActionIndex(agI , domainI);} PolicyDiscrete* GetIndividualPolicyDiscrete(Index i) const { return JPolComponent_VectorImplementation::GetIndividualPolicyDiscrete(i) ;} /// Returns a reference to the vector of pointers to individual policies /** This function should be used to manipulate individual policies. */ std::vector& GetIndividualPolicies() {return this->JPolComponent_VectorImplementation::GetIndividualPolicies();} /// Initialize the joint policy to the first joint policy. /** This is the joint policy that specifies action 0 --the * first action-- for all observation histories.*/ void ZeroInitialization() { JPolComponent_VectorImplementation::ZeroInitialization();} /// Initialize the policy of agentI to the first policy. /** This is the policy that specifies action 0 --the first * action-- for all observation histories.*/ void ZeroInitialization(Index i) { JPolComponent_VectorImplementation::ZeroInitialization(i);} ///Randomly initialize the joint policy. void RandomInitialization() { JPolComponent_VectorImplementation::RandomInitialization();} ///Randomly initialize the policy for agentI. void RandomInitialization(Index i) { JPolComponent_VectorImplementation::RandomInitialization(i);} void SetAction(Index agentI, Index domainI, Index aI) { JPolComponent_VectorImplementation::SetAction(agentI, domainI, aI);} /// Returns a pointer to a copy of this class. virtual JointPolicyPureVector* Clone() const { return new JointPolicyPureVector(*this); } }; #endif /* !_JOINTPOLICYPUREVECTOR_H_ */ // Local Variables: *** // mode:c++ *** ;// End: *** madp-0.4/src/support/PaxHeaders.5405/ProblemFireFightingFactored.cpp0000644000000000000000000000013212717644275022334 xustar0030 mtime=1463765181.473709201 30 atime=1463765181.465709265 30 ctime=1463765201.713547549 madp-0.4/src/support/ProblemFireFightingFactored.cpp0000664000372100037210000005567012717644275023205 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "StringTools.h" #include "ProblemFireFightingFactored.h" #include "DecPOMDPDiscrete.h" #include "JointBeliefInterface.h" #include "RewardModelMapping.h" using namespace std; #define DEBUG_PFFF 0 #define DEBUG_CTM 0 //Create Trans Model #define DEBUG_COM 0 //Create Obs Model #define DEBUG_CJA 0 #define DEBUG_CJO 0 #define DEBUG_CA 0 #define DEBUG_CO 0 ProblemFireFightingFactored::ProblemFireFightingFactored( size_t nrAgents, size_t nrHouses, size_t nrFLs, double costOfMove, bool forcePositionRepres, double multipleAgentExtinguishProb, bool initialize) : FactoredDecPOMDPDiscrete( "temp-name", "temp-description", "none"), _m_nrAgents(nrAgents), _m_nrHouses(nrHouses), _m_nrFireLevels(nrFLs), _m_costOfMove(costOfMove), _m_forcePositionRepres(forcePositionRepres), _m_multipleAgentExtinguishProb(multipleAgentExtinguishProb) { if(_m_multipleAgentExtinguishProb<0 || _m_multipleAgentExtinguishProb>1) throw(E("ProblemFireFightingFactored::ctor multipleAgentExtinguishProb should be >=0 and <=1")); if(initialize) InitializePFFF(); } void ProblemFireFightingFactored::InitializePFFF() { std::string name = this->SoftPrintBriefDescription(); std::string desc = this->SoftPrintDescription(); /*cout << "ProblemFireFightingFactored::InitializePFFF... " << endl; cout << "this (brief): " << name << endl; cout << "this : " << desc << endl;*/ SetName(name); SetDescription(desc); SetUnixName(name); /*SetName(SoftPrintBriefDescription(_m_nrAgents, _m_nrHouses, _m_nrFireLevels)); SetDescription(SoftPrintDescription(_m_nrAgents, _m_nrHouses, _m_nrFireLevels)); SetUnixName(SoftPrintBriefDescription(_m_nrAgents, _m_nrHouses, _m_nrFireLevels));*/ SetSparse(true); SetNrAgents(_m_nrAgents); double S = pow((double)_m_nrFireLevels, (double)_m_nrHouses); _m_nrJointFirelevels = (size_t) S; _m_nrFLs_vec = vector(_m_nrHouses, _m_nrFireLevels); //Create states, and ISD // //first add the state features describing the (firelevels of) the houses) for(Index hI = 0; hI < _m_nrHouses; hI++) { Index sfI = AddStateFactor( StringTools::Append("FL",hI) , StringTools::Append("The fire level of house ",hI)); for(Index flI=0; flI < _m_nrFireLevels; flI++) AddStateFactorValue(sfI, StringTools::Append("",flI)); } if(_m_costOfMove > 0.0 || _m_forcePositionRepres) { #if DEBUG_PFFF cout << "Including position"< _m_nrStateFeatures = _m_nrHouses+_m_nrAgents; size_t nrPos = _m_nrHouses+1; //include the 'start' position. _m_nrFLs_vec = vector(_m_nrHouses, _m_nrFireLevels); vector< size_t > nrPos_vec = vector(_m_nrAgents, nrPos); _m_nrPerStateFeatureVec = _m_nrFLs_vec; _m_nrPerStateFeatureVec.insert( _m_nrPerStateFeatureVec.end(), //insert position nrPos_vec.begin(), //the stuff that is nrPos_vec.end() //appended... ); if(DEBUG_PFFF) cout << "_m_nrPerStateFeatureVec=" << SoftPrintVector(_m_nrPerStateFeatureVec) << endl; } else { cout << "Not including positions" << endl; _m_includePositions = false; //the s_vec has the form _m_nrStateFeatures = _m_nrHouses; _m_nrPerStateFeatureVec = _m_nrFLs_vec; if(DEBUG_PFFF) cout << "_m_nrPerStateFeatureVec=" << SoftPrintVector(_m_nrPerStateFeatureVec) << endl; } SetStatesInitialized(true); //size_t nrS = GetNrStates(); //after initialization we can add the ISD: if(_m_includePositions) { /* vector isd(nrS, 0.0); double nrStartStates = pow((double)_m_nrFireLevels, (double)_m_nrHouses); double ssprob = 1.0 / nrStartStates; for(Index sI = 0; sI < nrS; sI++) { vector< Index> s_vec = GetStateVector(sI); Index t1 = _m_nrHouses; //we start with the first position feature bool isStartState = true; for(; t1 < _m_nrStateFeatures; t1++) { Index hI = s_vec.at(t1); if(hI == _m_nrHouses) //start position ; else isStartState = false; } if(isStartState) isd.at(sI) = ssprob; } this->SetISD(isd); */ this->SetUniformISD(); //TODO:set probability of position factors to 1 for all start positions throw E("ProblemFireFightingFactored - initialization of ISD with positions not implemented yet"); } else this->SetUniformISD(); #if DEBUG_PFFF cout << "states initialized: " << endl ; cout << MADPComponentFactoredStates::SoftPrint() << endl; #endif SetDiscount(1); #if DEBUG_PFFF cout << _m_2dbn.SoftPrint(); #endif // add actions: ConstructActions(); #if 0 // for factored models we typically don't want to use joint indices ConstructJointActions(); #endif SetActionsInitialized(true); // add observations: ConstructObservations(); #if 0 // for factored models we typically don't want to use joint indices ConstructJointObservations(); #endif SetObservationsInitialized(true); // Initialize the 2DBN in MultiAgentDecisionProcessDiscreteFactoredStates Initialize2DBN(); #if DEBUG_PFFF cout << ">>>Trans./obs. models created"< emptyVec; vector yVals(1, flI);// vector containing onyl flI SetRewardForLRF( e, emptySc, emptyVec, //X scope + value emptySc, emptyVec, //A scope + value ySc, yVals, emptySc, emptyVec, //O scope + value -(double)flI //the reward ); } } #if DEBUG_PFFF cout << "Model created..."<() ); for(Index actionI=0; actionI < nrActionsThisAgent; actionI++) { stringstream ss; //ss << "Ag" <() ); for(Index obsI=0; obsI < nrObservationsThisAgent; obsI++) { string whatObs; switch(obsI){ case(FLAMES): whatObs = "Flames__"; break; case(NOFLAMES): whatObs = "NoFlames"; break; } stringstream ss; //ss << "Ag" <& As, Index hI) const { size_t nrAgentsAtLocation = 0; for(Index aI=0; aI < As.size(); aI++) if(GetAgentLocation(As.at(aI),aI) == hI) nrAgentsAtLocation++; return(nrAgentsAtLocation); } /* size_t ProblemFireFightingFactored:: NumberOfContainedStartPositions(const vector& state) const { if(!_m_includePositions) return(0); size_t nrSPs = 0; //loop over the position features: for(Index i = _m_nrHouses; i < _m_nrStateFeatures; i++) if(state.at(i) == _m_nrHouses) //the 'start' postion index = nrHouses nrSPs++; return nrSPs; } */ /* void ProblemFireFightingFactored::FillTransitionModel() { // add transitions: for(Index ja=0; ja 0) neighborIsBurning = true; } //bool neighborIsBurning = isNeighborBurning(s1, hI); Index sameLevel = curLevel; Index higherLevel = min((size_t)sameLevel+1, _m_nrFireLevels-1); Index lowerLevel = (curLevel==0) ? 0 : (curLevel-1); double p2=0.0;// the prob. factor of ThisHouseFirelevel; switch(nrAgentsAtLocation) { case(0): { //this is kind of strange: when a house is not burning, but //its neigbhor is, it will increase its FL with p=0.8 //but when it is already burning (and its neighbor is not), it //increase with p=0.4... //fire is likely to increase if(neighborIsBurning) { if(nextLevel == sameLevel) p2+=0.2; if(nextLevel == higherLevel) p2+=0.8; } else if (curLevel == 0) //fire won't get ignited { if(0 == nextLevel) p2=1.0; else //not possible so we can quit... p2=0.0; } else //normal burning house { if(nextLevel == sameLevel) p2+=0.6; if(nextLevel == higherLevel) p2+=0.4; } break; } case(1): { //fire is likely to decrease if(neighborIsBurning) { if(nextLevel == sameLevel) p2+=0.4; if(nextLevel == lowerLevel) p2+=0.6; //.6 prob of extuinguishing 1 fl } else if (curLevel == 0) //fire won't get ignited { if(0 == nextLevel) p2=1.0; else //not possible so we can quit... p2=0.0; } else //normal burning house { if(nextLevel == sameLevel) p2+=0.0; if(nextLevel == lowerLevel) p2+=1.0; } break; } default: { #if 1 //more than 1 agent: fire is extinguished if(0 == nextLevel) p2=1.0; else //not possible so we can quit... p2=0.0; #else // made it depend on multipleAgentExtinguishProb if(0 == nextLevel) p2+=(GetMultipleAgentExtinguishProb()); if(nextLevel == lowerLevel) p2+=(1-GetMultipleAgentExtinguishProb()); #endif } } return(p2); } /* bool ProblemFireFightingFactored::isNeighborBurning( const std::vector< Index>& s, Index hI) { bool b = false; if(hI > 0) //check 'lower' neighbor if(s.at(hI-1) > 0) b = true; if(hI+1 < s.size()) //check 'higher' neighbor if(s.at(hI+1) > 0) b = true; return(b); } */ /* void ProblemFireFightingFactored::FillObservationModel() { for(Index ja=0; ja< GetNrJointActions(); ja++) for(Index s1=0; s1 ja_vec = JointToIndividualActionIndices(ja); vector< Index > s1_vec = GetStateVector(s1); vector< Index > jo_vec = JointToIndividualObservationIndices(jo); double prob = ComputeObservationProb(ja_vec, s1_vec, jo_vec); //SetObservationProbability(ja, s1, jo, prob); } } */ double ProblemFireFightingFactored::ComputeObservationProb( Index o, Index oVal, const std::vector< Index>& As, const std::vector< Index>& Ys, const std::vector< Index>& Os ) const { //Index agI = o; observation_t obsAgI = (observation_t) oVal; double p_o_thisAgent = 0.0; Index hI, FL; if(_m_includePositions) { //the agents position should be the last relevant //state variable (y): hI = Ys.at(Ys.size()-1); if(hI == _m_nrHouses) // agent at start position FL = 0; else FL = Ys.at(hI); } else { //the only relevant action gives the position (house) of agI // We don't use GetAgentLocation() because Ys will already // contain the scope of each's agent houses that it can reach hI=As.at(0);//GetAgentLocation(As.at(0),o); FL = Ys.at(hI); //the firelevel at that house } //we compute P(FLAMES) double pFlames = 0.0; switch(FL) { case(0): //no fire pFlames = 0.2; // 0.2 prob. of incorrectly observing break; case(1): pFlames = 0.5; break; default: pFlames = 0.8; } double pNoFlames = 1.0-pFlames; switch(obsAgI) { case(FLAMES): p_o_thisAgent = pFlames; break; case(NOFLAMES): p_o_thisAgent = pNoFlames; break; } return p_o_thisAgent; } size_t ProblemFireFightingFactored::GetAgentLocation(Index action, Index agI) const { return(action); } Scope ProblemFireFightingFactored::GetHousesAgentInfluences(Index agI) const { Scope allHouses; for(Index hI=0; hI < _m_nrHouses; hI++) allHouses.Insert(hI); return(allHouses); } void ProblemFireFightingFactored::SetYScopes() { //specify connections for the 2DBN #if DEBUG_PFFF cout << "About to set the SoIs for all next-stage(NS) SFs Y..."< 0) x.Insert(yI-1); x.Insert(yI); // firelevel of house yI influenced by its PS firelevel if(yI < (_m_nrHouses-1) ) x.Insert(yI+1); SetSoI_Y( yI, //sfacI = 0 -> house 0 x, allAgents, Scope("<>") // no interdependencies between next-stage FLs ); } } void ProblemFireFightingFactored::SetOScopes() { #if DEBUG_PFFF cout << "About to set the SoIs for all observations O..."< house 0 agSC, GetHousesAgentInfluences(oI), Scope("<>") // no interdependencies between next-stage Os ); } } double ProblemFireFightingFactored::GetMultipleAgentExtinguishProb() const { return(_m_multipleAgentExtinguishProb); } string ProblemFireFightingFactored::GetMultipleAgentExtinguishProbString() const { string extension=""; // we only want to add this probability to the filename if it is // not equal to 1 (which is the default value) if(GetMultipleAgentExtinguishProb()<1) { // convert the probability to a string without . stringstream prob; prob << _m_multipleAgentExtinguishProb; string probString=prob.str(); probString.erase(remove(probString.begin(), probString.end(), '.'), probString.end()); extension=string("_") + probString; } return(extension); } madp-0.4/src/support/PaxHeaders.5405/JointHistory.h0000644000000000000000000000013212717644275017110 xustar0030 mtime=1463765181.557708529 30 atime=1463765181.557708529 30 ctime=1463765201.657547996 madp-0.4/src/support/JointHistory.h0000664000372100037210000000215312717644275017745 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _JOINTHISTORY_H_ #define _JOINTHISTORY_H_ 1 /* the include directives */ #include #include "Globals.h" #include "History.h" ///JointHistory represents a joint history, i.e., a history for each agent. class JointHistory : public History { private: protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor JointHistory(){}; /// Destructor. virtual ~JointHistory(){}; }; #endif /* !_JOINTHISTORY_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/BeliefIteratorInterface.h0000644000000000000000000000013212717644275021164 xustar0030 mtime=1463765181.513708882 30 atime=1463765181.513708882 30 ctime=1463765201.669547901 madp-0.4/src/support/BeliefIteratorInterface.h0000664000372100037210000000277712717644275022035 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _BELIEFITERATORINTERFACE_H_ #define _BELIEFITERATORINTERFACE_H_ 1 /* the include directives */ #include "Globals.h" /** \brief BeliefIteratorInterface is an interface for iterators over * beliefs. */ class BeliefIteratorInterface { private: protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor BeliefIteratorInterface(){}; /// Destructor. virtual ~BeliefIteratorInterface(){}; /// Gets the probability at the current state. virtual double GetProbability() const = 0; /// Gets the index of the current state. virtual Index GetStateIndex() const = 0; /// Advance the iterator. Returns false if at the end. virtual bool Next() = 0; /// Returns a pointer to a copy of this class. virtual BeliefIteratorInterface* Clone() const = 0; }; #endif /* !_BELIEFITERATORINTERFACE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/ProblemAloha.cpp0000644000000000000000000000013212717644275017343 xustar0030 mtime=1463765181.493709041 30 atime=1463765181.485709106 30 ctime=1463765201.717547517 madp-0.4/src/support/ProblemAloha.cpp0000664000372100037210000005502212717644275020203 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "ProblemAloha.h" #include "StringTools.h" #include "FSDist_COF.h" #include "RewardModelMapping.h" #include "MultiAgentDecisionProcessDiscreteFactoredStatesInterface.h" using namespace std; // useful for debugging etc, no observation noise and each timestep an // island always gets a packet #define DETERMINISTIC_ALOHA 0 //Default constructor ProblemAloha::ProblemAloha(IslandConfiguration islands, AlohaVariation variation, size_t maxBacklog, size_t nrAgents, bool initialize): FactoredDecPOMDPDiscrete("", "", "none"), _m_islandConf(islands), _m_variation(variation), _m_maxBacklog(maxBacklog), _m_nrAgentsPassedOnCommandline(nrAgents) { if(initialize) InitializeAloha(); } void ProblemAloha::InitializeAloha() { SetSparse(true); /* -----------'ConstructNrAgents()' ------- */ switch(_m_islandConf) { case OneIsland: _m_nrIslands=1; break; case TwoIslands: case TwoIndependentIslands: _m_nrIslands=2; break; case ThreeIslandsInLine: case ThreeIslandsClustered: case SmallBigSmallInLine: _m_nrIslands=3; break; case FourIslandsInLine: case FourIslandsInSquare: _m_nrIslands=4; break; case FiveIslandsInLine: _m_nrIslands=5; break; case SixIslandsInLine: _m_nrIslands=6; break; case SevenIslandsInLine: _m_nrIslands=7; break; case InLine: _m_nrIslands=_m_nrAgentsPassedOnCommandline; break; default: throw(E("InitializeAloha() island config not handled")); } SetNrAgents(_m_nrIslands); // first we need to set the number of agents before the // SoftPrintBriefDescription() is correct SetName(SoftPrintBriefDescription()); SetDescription(SoftPrintDescription()); SetUnixName(SoftPrintBriefDescription()); vector nrElems(2); nrElems[0]=_m_maxBacklog; nrElems[1]=2; // yes or no _m_stepSizeState=IndexTools::CalculateStepSize(nrElems); nrElems[0]=3; nrElems[1]=2; // yes or no _m_stepSizeObservations=IndexTools::CalculateStepSize(nrElems); /* * -----------'ConstructStateSpace() ------- */ for(Index iI = 0; iI < _m_nrIslands; iI++) { Index sfI = AddStateFactor( StringTools::Append("BL",iI) , StringTools::Append("The back log of island ",iI)); switch(_m_variation) { case NewPacket: case NewPacketSendAll: case NewPacketProgressivePenalty: { for(Index sI=0;sI!=(_m_maxBacklog+1)*2;++sI) { Index bI,newPacket; splitState(sI,bI,newPacket); stringstream ss; ss << "bl" << bI; if(newPacket) ss << "newP"; else ss << "none"; AddStateFactorValue(sfI, ss.str()); } break; } case NoNewPacket: { for(Index bI=0; bI <= _m_maxBacklog; bI++) AddStateFactorValue(sfI, StringTools::Append("bl",bI)); break; } } } SetStatesInitialized(true); /*-----------'ConstructInitialStateDistribution' ------- */ //after initialization we can add the ISD: FSDist_COF *isd= new FSDist_COF(*this); for(Index iI = 0; iI < _m_nrIslands; iI++) { switch(_m_variation) { case NewPacket: case NewPacketSendAll: case NewPacketProgressivePenalty: // each island starts with backlog 0 and no new packet isd->SetProbability(iI,composeState(0,0),1.0); break; case NoNewPacket: isd->SetProbability(iI,0,1.0); // each island starts with backlog 0 break; } } SetISD(isd); // add actions: ConstructActions(); #if 0 // for factored models we typically don't want to use joint indices ConstructJointActions(); #endif SetActionsInitialized(true); // add observations: ConstructObservations(); #if 0 // for factored models we typically don't want to use joint indices ConstructJointObservations(); #endif SetObservationsInitialized(true); // Initialize the 2DBN in MultiAgentDecisionProcessDiscreteFactoredStates Initialize2DBN(); // cout << ">>>Trans./obs. models created"< emptyVec; vector yVals(1); switch(_m_variation) { case NewPacket: case NewPacketSendAll: case NewPacketProgressivePenalty: { for(Index j=0;j!=2;++j) { yVals[0]=composeState(bI,j); SetRewardForLRF( e, emptySc, emptyVec, //X scope + value emptySc, emptyVec, //A scope + value ySc, yVals, //Y scope + value emptySc, emptyVec, //O scope + value backlogToReward(bI) //the reward ); } break; } case NoNewPacket: { yVals[0]=bI; SetRewardForLRF( e, emptySc, emptyVec, //X scope + value emptySc, emptyVec, //A scope + value ySc, yVals, //Y scope + value emptySc, emptyVec, //O scope + value backlogToReward(bI) //the reward ); break; } } } } FactoredDecPOMDPDiscrete::SetInitialized(true); } double ProblemAloha::backlogToReward(Index backlog) const { double reward=42; switch(_m_variation) { case NewPacket: case NewPacketSendAll: case NoNewPacket: reward=-static_cast(backlog); break; case NewPacketProgressivePenalty: reward=1-pow(2,static_cast(backlog)); break; } return(reward); } void ProblemAloha::splitState(Index sI, Index &backlog, Index &newPacket) const { vector splitS= IndexTools::JointToIndividualIndicesStepSize(sI,_m_stepSizeState,2); backlog=splitS[0]; newPacket=splitS[1]; } Index ProblemAloha::composeState(Index backlog, Index newPacket) const { vector splitS(2); splitS[0]=backlog; splitS[1]=newPacket; return(IndexTools::IndividualToJointIndicesStepSize(splitS, _m_stepSizeState)); } void ProblemAloha::splitObservation(Index oI, Index &status, Index &newPacket) const { vector splitO= IndexTools::JointToIndividualIndicesStepSize(oI, _m_stepSizeObservations, 2); status=splitO[0]; newPacket=splitO[1]; } Index ProblemAloha::composeObservation(Index status, Index newPacket) const { vector splitO(2); splitO[0]=status; splitO[1]=newPacket; return(IndexTools::IndividualToJointIndicesStepSize(splitO, _m_stepSizeObservations)); } bool ProblemAloha::areNeighbors(Index x, Index y) const { bool neighbors=false; if(x==y) // you cannot be a neighbor of yourself return(false); switch(_m_islandConf) { case TwoIslands: // with two islands everybody's a neigbor neighbors=true; break; case OneIsland: break; case TwoIndependentIslands: break; case ThreeIslandsInLine: case SmallBigSmallInLine: case FourIslandsInLine: case FiveIslandsInLine: case SixIslandsInLine: case SevenIslandsInLine: case InLine: if(abs(static_cast(x)- static_cast(y))==1) neighbors=true; break; case ThreeIslandsClustered: // three islands clustered together neighbors=true; break; case FourIslandsInSquare: if(((x==0 && y==1) || (y==0 && x==1)) || // island 0 and 1 are neighbors ((x==1 && y==2) || (y==1 && x==2)) || // as well as 1 and 2 ((x==2 && y==3) || (y==2 && x==3)) || // as well as 2 and 3 ((x==0 && y==3) || (y==0 && x==3))) // as well as 0 and 3 neighbors=true; break; default: throw(E("ProblemAloha::areNeighbors not implemented for island configuration")); } return(neighbors); } double ProblemAloha::GetNewPacketProb(Index y) const { #if DETERMINISTIC_ALOHA double pHighProb=1.0, pLowProb=1.0, p=42; #else double pHighProb=0.6, pLowProb=0.2, p=42; #endif switch(_m_islandConf) { case TwoIslands: case OneIsland: case TwoIndependentIslands: case ThreeIslandsInLine: case ThreeIslandsClustered: case FiveIslandsInLine: case FourIslandsInLine: case FourIslandsInSquare: case SixIslandsInLine: case SevenIslandsInLine: case InLine: p=pHighProb; break; case SmallBigSmallInLine: if(y==1) // middle island is big -> high prob p=pHighProb; else p=pLowProb; break; default: throw(E("ProblemAloha::GetNewPacketProb not implemented for island configuration")); } return(p); } string ProblemAloha::IslandConfigToString(IslandConfiguration conf) { switch(conf) { case TwoIslands: return("TwoIslands"); case OneIsland: return("OneIsland"); case TwoIndependentIslands: return("TwoIndependentIslands"); case ThreeIslandsInLine: return("ThreeIslandsInLine"); case ThreeIslandsClustered: return("ThreeIslandsClustered"); case SmallBigSmallInLine: return("SmallBigSmallInLine"); case FiveIslandsInLine: return("FiveIslandsInLine"); case FourIslandsInLine: return("FourIslandsInLine"); case FourIslandsInSquare: return("FourIslandsInSquare"); case SixIslandsInLine: return("SixIslandsInLine"); case SevenIslandsInLine: return("SevenIslandsInLine"); case InLine: return("InLine"); } return("IslandConf not handled"); } string ProblemAloha::SoftPrintBriefDescription() const { stringstream ss; ss << "Aloha_" << SoftPrintVariation(GetVariation()) << "_"; if(GetIslandConfiguration()==InLine) ss << GetNrAgents(); ss << IslandConfigToString(GetIslandConfiguration()) << "_maxBL" << GetMaxBacklog(); return ss.str(); } string ProblemAloha::SoftPrintDescription() const { return SoftPrintBriefDescription(); } string ProblemAloha::SoftPrintVariation(AlohaVariation variation) const { switch(variation) { case NoNewPacket: return("NoNewPacket"); case NewPacket: return("NewPacket"); case NewPacketSendAll: return("NewPacketSendAll"); case NewPacketProgressivePenalty: return("NewPacketProgressivePenalty"); } return("AlohaVariation not handled"); } string ProblemAloha::transmissionStatusToString(Index status) const { string str; switch(status){ case(SUCCESS): str = "Succ"; break; case(IDLEo): str = "Idle"; break; case(COLLISION): str = "Coll"; break; } return(str); } void ProblemAloha::ConstructActions() { for(Index agentIndex=0; agentIndex < _m_nrAgents; agentIndex++) { // _m_nrActions.push_back(2); // _m_actionVecs.push_back(vector() ); if(SEND==0) // make sure we add them in the correct order { AddAction(agentIndex,"send","Attempt to send a packet"); AddAction(agentIndex,"idle","Do nothing, remain idle"); } else { AddAction(agentIndex,"send","Attempt to send a packet"); AddAction(agentIndex,"idle","Do nothing, remain idle"); } } } void ProblemAloha::ConstructObservations() { /// add observations: for(Index agentIndex=0; agentIndex < _m_nrAgents; agentIndex++) { size_t nrObservationsThisAgent = 0; switch(_m_variation) { case NewPacket: case NewPacketSendAll: case NewPacketProgressivePenalty: nrObservationsThisAgent = 6; break; case NoNewPacket: nrObservationsThisAgent = 3; // success, idle, collision break; } // _m_nrObservations.push_back(nrObservationsThisAgent); // _m_observationVecs.push_back( vector() ); for(Index obsI=0; obsI < nrObservationsThisAgent; obsI++) { stringstream ss; switch(_m_variation) { case NewPacket: case NewPacketSendAll: case NewPacketProgressivePenalty: { Index status,newPacket; splitObservation(obsI,status,newPacket); ss << transmissionStatusToString(status); if(newPacket) ss << "NewP"; else ss << "None"; break; } case NoNewPacket: { ss << transmissionStatusToString(obsI); break; } } string name = ss.str(); ss.str(""); ss << "Observation " << obsI << " of agent " << agentIndex << ": " << name; string descr = ss.str(); AddObservation(agentIndex,name,descr); // ObservationDiscrete od_temp = ObservationDiscrete(obsI,name,descr); // _m_observationVecs[agentIndex].push_back( od_temp ); } } } void ProblemAloha::SetYScopes() { //specify connections for the 2DBN for(Index yI=0; yI < _m_nrIslands; yI++) { //determine the X scope of influence (i.e., state factors at prev.stage) Scope x; Scope a; // depends on your own state and action x.Insert(yI); a.Insert(yI); for(Index yI1=0; yI1 < _m_nrIslands; yI1++) if(areNeighbors(yI,yI1)) // and on your neighbors { x.Insert(yI1); a.Insert(yI1); } SetSoI_Y( yI, x, a, Scope("<>") // no interdependencies in next stage ); } } void ProblemAloha::SetOScopes() { for(Index oI=0; oI < _m_nrAgents; oI++) { Scope aSC,ySC; aSC.Insert(oI); for(Index yI1=0; yI1 < _m_nrIslands; yI1++) if(areNeighbors(oI,yI1)) // and on your neighbors aSC.Insert(yI1); //ySC=aSC; ySC.Insert(oI); SetSoI_O( oI, aSC, ySC, Scope("<>") // no interdependencies between next-stage Os ); } } double ProblemAloha::ComputeTransitionProb( Index y, Index yVal, const std::vector< Index>& Xs, const std::vector< Index>& As, const std::vector< Index>& Ys ) const { double pNewPacket=GetNewPacketProb(y); double p=42; bool successfullSend=successFullySendPackage(y,Xs,As); const Scope& XSoI = GetXSoI_Y(y); Index Index_of_island_within_scope=XSoI.GetPositionForIndex(y); Index currentBacklog, nextBacklog; Index currentNewPacket, nextNewPacket; switch(_m_variation) { case NewPacket: case NewPacketSendAll: case NewPacketProgressivePenalty: splitState(Xs.at(Index_of_island_within_scope), currentBacklog, currentNewPacket); splitState(yVal, nextBacklog, nextNewPacket); break; case NoNewPacket: currentBacklog=Xs.at(Index_of_island_within_scope); nextBacklog=yVal; break; } bool gotPacket=false; if(successfullSend) { switch(_m_variation) { case NewPacket: case NewPacketProgressivePenalty: case NoNewPacket: // in these variations we send 1 packet if(currentBacklog==0 && nextBacklog==0) p=1; else if(nextBacklog==currentBacklog) // sent a packet but got a new one { p=pNewPacket; gotPacket=true; } else if(nextBacklog==(currentBacklog-1)) // sent a packet p=1-pNewPacket; else p=0; break; case NewPacketSendAll: // in these variation we send all packets we have in the backlog // if(currentBacklog==0 && nextBacklog==0) // p=1; // else if(nextBacklog==1) // sent all packets but got a new one { p=pNewPacket; gotPacket=true; } else if(nextBacklog==0) // sent all packets p=1-pNewPacket; else p=0; break; } } else { if(currentBacklog==_m_maxBacklog && nextBacklog==currentBacklog) // backlog is full p=1; else if(nextBacklog==(currentBacklog+1)) // we got a packet { p=pNewPacket; gotPacket=true; } else if(nextBacklog==currentBacklog) // no new packet p=1-pNewPacket; else p=0; } switch(_m_variation) { case NewPacket: case NewPacketSendAll: case NewPacketProgressivePenalty: // check if new state is consistent with whether we received a // packet or not if((nextNewPacket && !gotPacket) || (!nextNewPacket && gotPacket)) p=0; break; case NoNewPacket: break; } #if 0 if(p>0) cout << endl << "aloha y " << y << " yVal " << yVal << SoftPrintVector(Xs) << SoftPrintVector(As) << " p " << p << " send " << successfullSend << " cBL " << currentBacklog << " nBL " << nextBacklog << endl; #endif return(p); } bool ProblemAloha::successFullySendPackage(Index y, const std::vector< Index>& Xs, const std::vector< Index>& As) const { bool iSend=false; bool neighborsTryToSend=false; const Scope& XSoI = GetXSoI_Y(y); Index Index_of_island_within_scope=XSoI.GetPositionForIndex(y); if(As.at(Index_of_island_within_scope)==SEND) // we tried to send a packet iSend=true; for(Index i=0;i!=XSoI.size();++i) if(XSoI[i]!=y) { if(As.at(i)==SEND) // (the neighbor tried to send neighborsTryToSend=true; } // if I try to send and none of my neighbors, transmission is a success if(iSend && !neighborsTryToSend) return(true); else return(false); } double ProblemAloha::ComputeObservationProb( Index o, Index oVal, const std::vector< Index>& As, const std::vector< Index>& Ys, const std::vector< Index>& Os ) const { double p=42; Index status; switch(_m_variation) { case NewPacket: case NewPacketSendAll: case NewPacketProgressivePenalty: { const Scope& YSoI = GetYSoI_O(o); Index Index_of_island_within_scope=YSoI.GetPositionForIndex(o); Index backlog,newPacket; splitState(Ys.at(Index_of_island_within_scope), backlog, newPacket); Index newPacketObs; splitObservation(oVal,status,newPacketObs); // check for consistency of observation with state if(newPacket!=newPacketObs) return(0); break; } case NoNewPacket: status=oVal; break; } int nrSends=0; for(Index i=0;i!=As.size();++i) if(As[i]==SEND) nrSends++; Index correctObs; if(nrSends==0) correctObs=IDLEo; else if(nrSends==1) correctObs=SUCCESS; else correctObs=COLLISION; #if DETERMINISTIC_ALOHA double pCorrectObs=1.0; #else double pCorrectObs=0.9; #endif if(status==correctObs) p=pCorrectObs; else p=(1-pCorrectObs)/2; return(p); } madp-0.4/src/support/PaxHeaders.5405/PartialJointPolicy.cpp0000644000000000000000000000013212717644275020556 xustar0030 mtime=1463765181.301710574 30 atime=1463765181.301710574 30 ctime=1463765201.701547645 madp-0.4/src/support/PartialJointPolicy.cpp0000664000372100037210000000156612717644275021422 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "PartialJointPolicy.h" using namespace std; //Copy assignment operator PartialJointPolicy& PartialJointPolicy::operator= (const PartialJointPolicy& o) { if (this == &o) return *this; // Gracefully handle self assignment // Put the normal assignment duties here... _m_pastReward = o._m_pastReward; return *this; } madp-0.4/src/support/PaxHeaders.5405/ObservationHistory.cpp0000644000000000000000000000013112717644275020652 xustar0030 mtime=1463765181.581708338 29 atime=1463765181.57770837 30 ctime=1463765201.717547517 madp-0.4/src/support/ObservationHistory.cpp0000664000372100037210000000455012717644275021513 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "Observation.h" #include "ObservationHistory.h" //Necessary as header file contains a forward declaration: #include "PlanningUnitMADPDiscrete.h" using namespace std; #define DEBUG_OH 0 //Default constructor ObservationHistory::ObservationHistory(PlanningUnitMADPDiscrete& pu,Index agentI) : IndividualHistory(agentI), _m_PlanningUnitMADPDiscrete(&pu) { SetLength(0); _m_observationI = 0; _m_containsEmptyOI = true; _m_pred = 0; } ObservationHistory::ObservationHistory(PlanningUnitMADPDiscrete& pu, Index agentI, Index obsI) : IndividualHistory(agentI) { throw E("ObservationHistory::ObservationHistory(Index obsI) not yet implemented - non-empty initial observations not yet supported."); } ObservationHistory::ObservationHistory(Index obsI, ObservationHistory* pred): IndividualHistory(pred->_m_agentI), _m_PlanningUnitMADPDiscrete(pred->_m_PlanningUnitMADPDiscrete) { SetLength(pred->GetLength() + 1); _m_observationI = obsI; _m_containsEmptyOI = false; _m_pred = pred; } //Destructor ObservationHistory::~ObservationHistory() { if(DEBUG_OH){ cout << "Deleting observation history: "; Print(); cout << endl;} } string ObservationHistory::SoftPrint() const { stringstream ss; if(_m_pred != 0) { if(_m_length >= 1) ss << _m_pred->SoftPrint(); else throw E("ObservationHistory:SoftPrint() - Warning:_m_pred != null,\ but lenght <= 1 !"); } if (!_m_containsEmptyOI) // don't print the empty observation { // ss << GetReferred()->GetObservationDiscrete(_m_agentI, // let's see if this works... ss << _m_PlanningUnitMADPDiscrete->GetObservation(_m_agentI, _m_observationI)->SoftPrintBrief() << ", "; } else ss << "Oempty, "; return(ss.str()); } madp-0.4/src/support/PaxHeaders.5405/PlanningUnitMADPDiscrete.cpp0000644000000000000000000000013212717644275021531 xustar0030 mtime=1463765181.397709807 30 atime=1463765181.345710223 30 ctime=1463765201.737547358 madp-0.4/src/support/PlanningUnitMADPDiscrete.cpp0000664000372100037210000032543212717644275022376 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "PlanningUnitMADPDiscrete.h" #include #include "IndexTools.h" #include "Action.h" #include "ActionDiscrete.h" #include "JointActionDiscrete.h" #include "Observation.h" #include "ObservationDiscrete.h" #include "JointObservationDiscrete.h" #include "JointBelief.h" #include "JointBeliefSparse.h" #include "JointPolicyDiscrete.h" #include "PolicyDiscretePure.h" #include "ActionHistory.h" #include "ActionHistoryTree.h" #include "JointActionHistory.h" #include "JointActionHistoryTree.h" #include "ObservationHistoryTree.h" #include "JointObservationHistoryTree.h" #include "ActionObservationHistoryTree.h" #include "JointActionObservationHistoryTree.h" #include "ENotCached.h" #include "EOverflow.h" #define DEBUG_PUD 0 // debug individual observation/action/actionobservation histories generation #define DEBUG_PUDCOHT 0 #define DEBUG_PUDCAHT 0 #define DEBUG_PUDCAOHT 0 // debug joint observation/action/actionobservation histories generation #define DEBUG_PUDCJOHT 0 #define DEBUG_PUDCJAHT 0 #define DEBUG_PUDCJAOHT 0 #define DEBUG_PUD_JAOHPROBS 0 #define DEBUG_PUDCGETJB 0 using namespace std; //Default constructor PlanningUnitMADPDiscrete:: PlanningUnitMADPDiscrete(const PlanningUnitMADPDiscreteParameters ¶ms, size_t horizon, MultiAgentDecisionProcessDiscreteInterface* p ) : PlanningUnit(horizon,p), Interface_ProblemToPolicyDiscretePure() ,_m_madp(p) { if(DEBUG_PU_CONSTRUCTORS) cout << "PlanningUnitMADPDiscrete(PlanningUnitMADPDiscreteParameters params, size_t horizon, MultiAgentDecisionProcessDiscreteInterface* p) called" << endl; _m_initialized = false; params.SanityCheck(); _m_params=params; if(p != 0) Initialize(); } PlanningUnitMADPDiscrete:: PlanningUnitMADPDiscrete(size_t horizon, MultiAgentDecisionProcessDiscreteInterface* p ) : PlanningUnit(horizon,p), Interface_ProblemToPolicyDiscretePure() ,_m_madp(p) { if(DEBUG_PU_CONSTRUCTORS) cout << "PlanningUnitMADPDiscrete( size_t horizon, MultiAgentDecisionProcessDiscreteInterface* p) called" << endl; _m_params.SetComputeAll(true); _m_initialized = false; if(p != 0) Initialize(); } //Destructor PlanningUnitMADPDiscrete::~PlanningUnitMADPDiscrete() { Deinitialize(); } void PlanningUnitMADPDiscrete::SetProblem(MultiAgentDecisionProcessDiscreteInterface* m) { if(DEBUG_PUD){ cout << "\n>>>PlanningUnitMADPDiscrete::SetProblem - setting the following problem\n" << m->SoftPrint() << endl; } _m_madp = m; PlanningUnit::SetProblem(m); Deinitialize(); Initialize(); } void PlanningUnitMADPDiscrete::SetHorizon(size_t h) { Deinitialize(); PlanningUnit::SetHorizon(h); Initialize(); } void PlanningUnitMADPDiscrete:: SetParams(const PlanningUnitMADPDiscreteParameters ¶ms) { Deinitialize(); _m_params=params; Initialize(); } bool PlanningUnitMADPDiscrete::SanityCheck() const { return(true); } //call methods to initialize the Planning unit void PlanningUnitMADPDiscrete::Initialize() { if(DEBUG_PUD) cout << "PlanningUnitMADPDiscrete::Initialize()" < * temp = new vector; _m_observationHistoryTreeVectors.push_back(* temp ); _m_nrObservationHistoriesT.push_back(vector()); _m_firstOHIforT.push_back(vector()); delete temp; // temp is copied into the vector - so delete this imm. ObservationHistoryTree* treeThiAg = CreateObservationHistoryTree(i); _m_observationHistoryTreeRootPointers.push_back(treeThiAg); } } else { /*Calculates the number of individual observation histories * and stores this in _m_nrObservationHistories (and * _m_nrObservationHistoriesT). Only used when the observation * histories are not created. */ _m_nrObservationHistories.clear(); _m_nrObservationHistoriesT.clear(); _m_firstOHIforT.clear(); vector oh_per_t; vector firstOHindex_per_t; size_t total = 0; for(Index i=0; i < GetNrAgents(); i++) { size_t nrOi = GetMADPDI()->GetNrObservations(i); oh_per_t.clear(); firstOHindex_per_t.clear(); total = 0; for(Index t=0; t < GetHorizon(); t++) { firstOHindex_per_t.push_back(total); size_t oh_this_t = (size_t) pow( (double)nrOi, (double)t ); oh_per_t.push_back(oh_this_t); total += oh_this_t; } _m_firstOHIforT.push_back(firstOHindex_per_t); _m_nrObservationHistories.push_back(total); _m_nrObservationHistoriesT.push_back(oh_per_t); } } } //should only be called from CreateObservationHistories() //(should be called in the order of the agents) ObservationHistoryTree* PlanningUnitMADPDiscrete::CreateObservationHistoryTree(Index agentI) { //we want to number the Observation Histories breadth-first, so we //use a queue: queue ohtQueue; Index ObservationHistoryIndex = 0; Index maxLength = GetHorizon()-1;//max. observation hist length = h-1 size_t nrO = GetNrObservations(agentI); ObservationHistory* next_oh = 0; ObservationHistoryTree* next_oht = 0; // return a new initial (=empty) observation history ObservationHistory* oh = new ObservationHistory(*this, agentI); ObservationHistoryTree* root = new ObservationHistoryTree(oh);//, nrO); ohtQueue.push(root); Index ts = 0; _m_firstOHIforT[agentI].push_back(ObservationHistoryIndex); while(ohtQueue.size() > 0) { ObservationHistoryTree* oht = ohtQueue.front(); oht->SetIndex(ObservationHistoryIndex); _m_observationHistoryTreeVectors[agentI].push_back(oht); size_t thisLength = oht->GetContainedElement()->GetLength(); if(ts != (Index) thisLength) //length 1 <-> ts 1 { // we've now started processing OHs for the next ts Index nr_OHI_for_ts = ObservationHistoryIndex - CastLIndexToIndex(_m_firstOHIforT[agentI][ts]); #if DEBUG_PUDCOHT cout << "First oh for next ts+1: store nr of ts-OH..."<Print(); #endif if(thisLength < maxLength) { #if DEBUG_PUDCJOHT cout << "PlanningUnitMADPDiscrete::"<< "CreateJointObservationHistoryTree - Extending this joint "<< "observation history tree..."< GetJointObservationHistory(); #if DEBUG_PUDCJOHT cout << "( history of pred was:"; temp->Print(); cout << ") " << endl; #endif next_joh = new JointObservationHistory(jObsI,temp); next_joht = new JointObservationHistoryTree(next_joh); joht->SetSuccessor(jObsI, next_joht); johtQueue.push(next_joht);//this is safe - only the pointer is //copied } } johtQueue.pop(); } //for the last time step, the nrJointObs are not yet added, do it now: _m_nrJointObservationHistoriesT.push_back (JointObservationHistoryIndex - CastLIndexToIndex(_m_firstJOHIforT[ts])); _m_nrJointObservationHistories =_m_jointObservationHistoryTreeVector.size(); _m_jointObservationHistoryTreeRoot = root; } else { /*Calculates the number of joint observation histories and * stores this in _m_nrJointObservationHistories (and * _m_nrJointObservationHistoriesT). * Only used when the joint observation histories are not created. */ size_t nr=0; for (Index t=0; t * temp = new vector; _m_actionHistoryTreeVectors.push_back(* temp ); _m_nrActionHistoriesT.push_back(vector()); _m_firstAHIforT.push_back(vector()); delete temp; // temp is copied into the vector - so delete this imm. ActionHistoryTree* treeThiAg = CreateActionHistoryTree(i); _m_actionHistoryTreeRootPointers.push_back(treeThiAg); } } else { /*Calculates the number of individual action histories and * stores this in _m_nrActionHistories (and * _m_nrActionHistoriesT). * Only used when the Action histories are not created. */ _m_nrActionHistories.clear(); _m_nrActionHistoriesT.clear(); _m_firstAHIforT.clear(); vector oh_per_t; vector firstAHindex_per_t; size_t total = 0; for(Index i=0; i < GetNrAgents(); i++) { size_t nrAi = GetMADPDI()->GetNrActions(i); oh_per_t.clear(); firstAHindex_per_t.clear(); total = 0; for(Index t=0; t < GetHorizon(); t++) { firstAHindex_per_t.push_back(total); size_t oh_this_t = (size_t) pow( (double)nrAi, (double)t ); oh_per_t.push_back(oh_this_t); total += oh_this_t; } _m_firstAHIforT.push_back(firstAHindex_per_t); _m_nrActionHistories.push_back(total); _m_nrActionHistoriesT.push_back(oh_per_t); } } } //should only be called from CreateActionHistories() //(should be called in the order of the agents) ActionHistoryTree* PlanningUnitMADPDiscrete::CreateActionHistoryTree(Index agentI) { //we want to number the Action Histories breadth-first, so we //use a queue: queue ohtQueue; Index ActionHistoryIndex = 0; int maxLength = GetHorizon() - 1;//max. action hist length = h - 1 size_t nrO = GetNrActions(agentI); ActionHistory* next_oh = 0; ActionHistoryTree* next_oht = 0; // return a new initial (=empty) action history //action history never has an initial action //if(!GetMADPDI()->IsInitialActionEmpty()) // throw E("this MADP issues a non-empty initial action, but this is not yet supported by PlanningUnitMADPDiscrete::CreateActionHistoryTree"); ActionHistory* oh = new ActionHistory(*this, agentI); ActionHistoryTree* root = new ActionHistoryTree(oh);//, nrO); ohtQueue.push(root); Index ts = 0; _m_firstAHIforT[agentI].push_back(ActionHistoryIndex); while(ohtQueue.size() > 0) { ActionHistoryTree* oht = ohtQueue.front(); oht->SetIndex(ActionHistoryIndex); _m_actionHistoryTreeVectors[agentI].push_back(oht); int thisLength = oht->GetContainedElement()->GetLength(); if(ts != (Index) thisLength ) //length 0 <-> ts 0 { // we've now started processing AHs for the next ts Index nr_AHI_for_ts = ActionHistoryIndex - CastLIndexToIndex(_m_firstAHIforT[agentI][ts]); #if DEBUG_PUDCAHT cout << "First ah for next ts+1: store nr of ts-AH..."<Print(); #endif if(thisLength < maxLength) { #if DEBUG_PUDCJAHT cout << "PlanningUnitMADPDiscrete::CreateJointActionHistoryTree " << "- Extending this joint action history tree..."< GetJointActionHistory(); #if DEBUG_PUDCJAHT cout << "( history of pred was:"; temp->Print(); cout << ") " << endl; #endif next_jah = new JointActionHistory(jAI,temp); next_jaht = new JointActionHistoryTree(next_jah); jaht->SetSuccessor(jAI, next_jaht); jahtQueue.push(next_jaht);//this is safe - only the pointer is //copied } } jahtQueue.pop(); } _m_nrJointActionHistories =_m_jointActionHistoryTreeVector.size(); _m_jointActionHistoryTreeRoot = root; } else { /*Calculates the number of joint action histories and * stores this in _m_nrJointActionHistories (and * _m_nrJointActionHistoriesT). * Only used when the joint action histories are not created. */ size_t nr=0; for (Index t=0; t::iterator it = _m_actionHistoryTreeRootPointers.begin(); vector::iterator last = _m_actionHistoryTreeRootPointers.end(); while(it != last) { if( *it != 0 ) delete *it; //this recursively deletes the //whole ActionHistoryTree it++; } /* this is done automatically by compiler: while(int s = _m_actionHistoryTreeVectors.size() > 0 ) { _m_actionHistoryTreeVectors[s-1].clear(); _m_actionHistoryTreeVectors.pop_back(); } */ _m_actionHistoryTreeRootPointers.clear(); _m_actionHistoryTreeVectors.clear(); _m_nrActionHistories.clear(); _m_nrActionHistoriesT.clear(); _m_firstAHIforT.clear(); } void PlanningUnitMADPDiscrete::DeInitializeJointActionHistories() { delete _m_jointActionHistoryTreeRoot;//should recursively delet _m_jointActionHistoryTreeVector.clear(); _m_nrJointActionHistories=0; _m_nrJointActionHistoriesT.clear(); _m_firstJAHIforT.clear(); } void PlanningUnitMADPDiscrete::DeInitializeActionObservationHistories() { vector::iterator it = _m_actionObservationHistoryTreeRootPointers.begin(); vector::iterator last = _m_actionObservationHistoryTreeRootPointers.end(); while(it != last) { if( *it != 0 ) delete *it; //this recursively deletes the //whole ActionObservationHistoryTree it++; } _m_actionObservationHistoryTreeRootPointers.clear(); _m_actionObservationHistoryTreeVectors.clear(); _m_nrActionObservationHistories.clear(); _m_nrActionObservationHistoriesT.clear(); _m_firstAOHIforT.clear(); } void PlanningUnitMADPDiscrete::DeInitializeJointActionObservationHistories() { delete _m_jointActionObservationHistoryTreeRoot;//should recursively delete _m_jointActionObservationHistoryTreeVector.clear(); // clear the map if(!_m_jointActionObservationHistoryTreeMap.empty()) delete _m_jointActionObservationHistoryTreeMap[0]; _m_jointActionObservationHistoryTreeMap.clear(); if(_m_params.GetComputeJointBeliefs()) { vector::iterator it = _m_jBeliefCache.begin(); vector::iterator last = _m_jBeliefCache.end(); while(it != last) { delete(*it); it++; } _m_jBeliefCache.clear(); _m_jaohConditionalProbs.clear(); } _m_nrJointActionObservationHistories=0; _m_nrJointActionObservationHistoriesT.clear(); _m_firstJAOHIforT.clear(); } void PlanningUnitMADPDiscrete::InitializeActionObservationHistories() { if(_m_params.GetComputeIndividualActionObservationHistories()) { size_t nrAgents=GetNrAgents(); for(Index i = 0; i < nrAgents; i++) { vector * temp = new vector; _m_actionObservationHistoryTreeVectors.push_back(* temp ); _m_nrActionObservationHistoriesT.push_back(vector()); _m_firstAOHIforT.push_back(vector()); delete temp; // temp is copied into the vector - so delete this imm. ActionObservationHistoryTree* treeThiAg = CreateActionObservationHistoryTree(i); _m_actionObservationHistoryTreeRootPointers.push_back(treeThiAg); } } else { /*Calculates the number of individual action-observation histories and * stores this in _m_nrActionObservationHistories (and * _m_nrActionObservationHistoriesT). * Only used when the action-observation histories are not created. */ _m_nrActionObservationHistories.clear(); _m_nrActionObservationHistoriesT.clear(); _m_firstAOHIforT.clear(); vector oh_per_t; vector firstAOHindex_per_t; size_t total = 0; for(Index i=0; i < GetNrAgents(); i++) { size_t nrAOi = GetMADPDI()->GetNrActions(i) * GetMADPDI()->GetNrObservations(i); oh_per_t.clear(); firstAOHindex_per_t.clear(); total = 0; for(Index t=0; t < GetHorizon(); t++) { firstAOHindex_per_t.push_back(total); size_t oh_this_t = (size_t) pow( (double)nrAOi, (double)t ); oh_per_t.push_back(oh_this_t); total += oh_this_t; } _m_firstAOHIforT.push_back(firstAOHindex_per_t); _m_nrActionObservationHistories.push_back(total); _m_nrActionObservationHistoriesT.push_back(oh_per_t); // need to some similar as for the JointActionObservationHistoryTree // vector * temp = new // vector; // _m_actionObservationHistoryTreeVectors.push_back(* temp ); // _m_nrActionObservationHistoriesT.push_back(vector()); // _m_firstAOHIforT.push_back(vector()); // delete temp; // temp is copied into the vector - so delete this imm. // ActionObservationHistoryTree* treeThiAg = // CreateActionObservationHistoryTree(i); // _m_actionObservationHistoryTreeRootPointers.push_back(treeThiAg); // ActionObservationHistory* aoh_0 = // new ActionObservationHistory(*this); // ActionObservationHistoryTree* root = // new ActionObservationHistoryTree(aoh_0); // vector *temp = new // vector; // temp // root->SetIndex(0); // _m_ActionObservationHistoryTreeVector.push_back(root); } } } ActionObservationHistoryTree* PlanningUnitMADPDiscrete:: CreateActionObservationHistoryTree(Index agentI) { queue aohtQueue; Index aohI = 0; size_t maxLength = GetHorizon() - 1; size_t nrA = GetNrActions(agentI); size_t nrO = GetNrObservations(agentI); //initial ActionObservationHistory aoh_0 ActionObservationHistory* aoh_0 =new ActionObservationHistory(*this,agentI); ActionObservationHistoryTree* root =new ActionObservationHistoryTree(aoh_0); aohtQueue.push(root); Index ts = 0; _m_firstAOHIforT[agentI].push_back(aohI); while(aohtQueue.size() >= 1) { // aoh = queue.pop ActionObservationHistoryTree* aoht = aohtQueue.front(); ActionObservationHistory* aoh = aoht->GetActionObservationHistory(); aohtQueue.pop(); int thisLength = aoh->GetLength(); if(ts != (Index) thisLength ) //length 0 <-> ts 0 { // we've now started processing AOHs for the next ts Index nr_AOHI_for_ts = aohI - CastLIndexToIndex(_m_firstAOHIforT[agentI][ts]); #if DEBUG_PUDCAOHT cout << "First aoh for next ts+1: store nr of ts-OH..."<Print(); cout << endl; #endif ActionObservationHistoryTree* next_aoht = new ActionObservationHistoryTree(next_aoh); #if DEBUG_PUDCAOHT cout << "\ncreated new aoh tree:"<Print(); cout << endl; #endif aoht->SetSuccessor(aI, oI, next_aoht); aohtQueue.push(next_aoht); } } Index nr_AOHI_for_ts = aohI - CastLIndexToIndex(_m_firstAOHIforT[agentI][ts]); _m_nrActionObservationHistoriesT[agentI].push_back(nr_AOHI_for_ts); _m_nrActionObservationHistories.push_back(aohI); return(root); } void PlanningUnitMADPDiscrete::InitializeJointActionObservationHistories() { if(_m_params.GetComputeJointActionObservationHistories()) { queue jaohtQueue; LIndex jaohI = 0; size_t maxLength = GetHorizon() - 1; size_t nrJA = GetNrJointActions(); size_t nrJO = GetNrJointObservations(); //initial JointActionObservationHistory aoh_0 JointActionObservationHistory* aoh_0 = new JointActionObservationHistory(*this); JointActionObservationHistoryTree* root = new JointActionObservationHistoryTree(aoh_0); jaohtQueue.push(root); queue jBeliefQueue; queue cpQueue; queue pQueue; const JointBeliefInterface* jb; bool cacheJBs=_m_params.GetComputeJointBeliefs(); //put the initial belief and probs in the queues JointBeliefInterface* b0 = GetNewJointBeliefInterface(); const StateDistribution* sd = GetMADPDI()->GetISD(); b0->Set ( *sd ); // b0 is not yet in the cache! jBeliefQueue.push(b0); cpQueue.push(1.0); pQueue.push(1.0); //while(! empty(queue) ) Index ts = 0; _m_firstJAOHIforT.push_back(0);//ts=0 starts at index 0 while(jaohtQueue.size() >= 1) { // jaoh = queue.pop JointActionObservationHistoryTree* jaoht = jaohtQueue.front(); JointActionObservationHistory* jaoh = jaoht-> GetJointActionObservationHistory(); jaohtQueue.pop(); Index thisLength = jaoh//t->GetContainedElement() ->GetLength(); if(ts != thisLength ) //length 0 <-> ts 0 { // we've now started processing JOHs for the next ts _m_nrJointActionObservationHistoriesT.push_back( CastLIndexToIndex(jaohI - _m_firstJAOHIforT[ts])); if(++ts != thisLength ) cerr << "ERROR: CreateJointObservationHistories: ++ts != "<< "thisLength !!! ts (now) is: "<Print(); cout << endl; cout << "\ncreated new jaoh tree:"<Print(); cout << endl; #endif jaoht->SetSuccessor(jaI, joI, next_jaoht); jaohtQueue.push(next_jaoht); JointBeliefInterface* new_jb = GetNewJointBeliefInterface(); *new_jb = *jb; double new_cond_p = new_jb->Update(*GetMADPDI(),jaI, joI); jBeliefQueue.push(new_jb); cpQueue.push(new_cond_p); double new_p = prob * new_cond_p; pQueue.push(new_p); } if(!cacheJBs) //we no longer need jb delete jb; } _m_nrJointActionObservationHistories = CastLIndexToIndex(jaohI); _m_jointActionObservationHistoryTreeRoot = root; } else { /*Calculates the number of joint action-observation histories and * stores this in _m_nrJointActionObservationHistories (and * _m_nrJointActionObservationHistoriesT). Only used when the joint * act-observation histories are not created. * * !Also initializes the * root of JointActionObservationHistoryTree vector, for on-the-fly * generation of successors. */ size_t nr=0; for (Index t=0; tSetIndex(0); _m_jointActionObservationHistoryTreeMap[0]=root; _m_jointActionObservationHistoryTreeRoot = 0; } } // GET functions: // size_t PlanningUnitMADPDiscrete::GetNrStates() const { const MultiAgentDecisionProcessDiscreteInterface* p = GetMADPDI(); size_t nrs = p->GetNrStates(); return (nrs); } LIndex PlanningUnitMADPDiscrete::GetNrPolicies(Index agentI) const { #if 0 // don't use powl(), we want to detect overflow return( static_cast(powl( GetNrActions(agentI), GetNrObservationHistories(agentI)))); #endif LIndex nrPols=1; for(size_t k=0;k!=GetNrObservationHistories(agentI);++k) { LIndex nrPolsOld=nrPols; nrPols*=GetNrActions(agentI); if(nrPols PlanningUnitMADPDiscrete::GetNrObservationHistoriesVector() const { vector nrOHts; for(Index agentI = 0; agentI < GetNrAgents(); agentI++) nrOHts.push_back( GetNrObservationHistories(agentI) ); return nrOHts; } const vector PlanningUnitMADPDiscrete::GetNrObservationHistoriesVector(Index ts) const { vector nrOHts; for(Index agentI = 0; agentI < GetNrAgents(); agentI++) nrOHts.push_back( GetNrObservationHistories(agentI, ts) ); return nrOHts; } ObservationHistoryTree* PlanningUnitMADPDiscrete::GetObservationHistoryTree(Index agentI, Index ohI) const { if(!_m_params.GetComputeIndividualObservationHistories()) throw ENotCached("PlanningUnitMADPDiscrete::GetObservationHistoryTree IndividualObservationHistories are not cached!"); size_t nrA = GetNrAgents(); if(_m_observationHistoryTreeVectors.size() != nrA) throw E("_m_observationHistoryTreeVectors.size() != nrA)"); if(agentI < nrA ) { size_t nrOH = GetNrObservationHistories(agentI); if(DEBUG_PUD){cout << "_m_observationHistoryTreeVectors["< // (the numbers represent the stage of the oI) // ->then this history is for stage 4 (we have that t=4). // // the ohI is generated by: // ohI= oI[3] * nrO^3 + ... +oI[0] * nrO^0 // // we reconstruct this by performing // oI[3] = ohI / nrO^3 // remainder = ohI - (oI^3) // oI[2] = remainder / nrO^2 // etc. // // we start with stage size_t stage = (t-1) - t2; //we are going to calculate the joa that took place at time stage size_t b = (size_t) pow((double)nrO, (double)(stage)); Index oI_t2 = remainder / b; Indices[t2] = oI_t2; remainder -= oI_t2 * b; } } void PlanningUnitMADPDiscrete::GetJointActionObservationHistoryVectors (LIndex jaohI, vector &jaIs, vector &joIs) const { jaIs.clear(); joIs.clear(); JointActionObservationHistoryTree* jaoht = GetJointActionObservationHistoryTree(jaohI); // if it is not cached, jaoht will be set to 0 if(jaoht) { jaoht->GetJointActionObservationHistory()-> GetJointActionObservationHistoryVectors(jaIs, joIs); } else { Index t = GetTimeStepForJAOHI(jaohI); Index jaIs_arr[t]; Index joIs_arr[t]; GetJointActionObservationHistoryArrays(jaohI, t, jaIs_arr, joIs_arr ); for(size_t t2 = 0; t2 < t; t2++) { jaIs.push_back(jaIs_arr[t2]); joIs.push_back(joIs_arr[t2]); } } } void PlanningUnitMADPDiscrete::GetJointActionObservationHistoryArrays (LIndex jaohI, Index t, Index jaIs[], Index joIs[]) const { //substract the offset to find out what is the index within the time-step-t- //observation-histories. LIndex jaohIwithinThisT = jaohI - _m_firstJAOHIforT.at(t); LIndex remainder = jaohIwithinThisT; size_t vec_size = t; // the number of 'JAO' we are searching //note: this was t+1, but that is incorrect(?)! size_t nrJO = GetNrJointObservations(); size_t nrJA = GetNrJointActions(); size_t nrJAO = nrJO*nrJA; // Index jao_array[vec_size]; for(Index t2=0; t2 < vec_size ; t2++) { // suppose we have a jaoh = < jaoI[3], jaoI[2], jao[1], jaoI[0] > // (the numbers represent the stage of the jaoI) // ->then this history is for stage 4 (we have that t=4). // // the jaohI is generated by: // jaohI= jaoI[3] * nrJAO^3 + ... +jaoI[0] * nrJAO^0 // // we reconstruct this by performing // jaoI[3] = jaohI / nrJAO^3 // remainder = jaohI - (jaoI^3) // jaoI[2] = remainder / nrJAO^2 // etc. // // we start with stage size_t stage = (t-1) - t2; //we are going to calculate the joa that took place at time stage size_t b = (size_t) pow((double)nrJAO, (double)(stage)); LIndex jaoI_t2 = remainder / b; // jao_array[t2] = jaoI_t2; remainder -= jaoI_t2 * b; jaIs[t2] = IndexTools:: ActionObservation_to_ActionIndex(CastLIndexToIndex(jaoI_t2), nrJA, nrJO); joIs[t2] = IndexTools:: ActionObservation_to_ObservationIndex(CastLIndexToIndex(jaoI_t2), nrJA, nrJO); } } void PlanningUnitMADPDiscrete::GetJointObservationHistoryArrays (Index johI, Index t, Index joIs[]) const { //substract the offset to find out what is the index within the time-step-t- //observation-histories. Index johIwithinThisT = johI - CastLIndexToIndex(_m_firstJOHIforT.at(t)); Index remainder = johIwithinThisT; size_t vec_size = t; // the number of joint observations we are searching size_t nrJO = GetNrJointObservations(); //size_t nrJA = GetNrJointActions(); for(Index t2=0; t2 < vec_size ; t2++) { // for explanation see GetJointActionObservationHistoryArrays() // // we start with stage size_t stage = (t-1) - t2; //we are going to calculate the joa that took place at time stage size_t b = (size_t) pow((double)nrJO, (double)(stage)); Index joI_t2 = remainder / b; joIs[t2] = joI_t2; remainder -= joI_t2 * b; } } void PlanningUnitMADPDiscrete::GetActionObservationHistoryArrays (Index agentI, Index aohI, Index t, Index aIs[], Index oIs[]) const { //substract the offset to find out what is the index within the time-step-t- //observation-histories. Index aohIwithinThisT = aohI - CastLIndexToIndex(_m_firstAOHIforT.at(agentI).at(t)); Index remainder = aohIwithinThisT; size_t vec_size = t; // the number of 'JAO' we are searching size_t nrO = GetNrObservations(agentI); size_t nrA = GetNrActions(agentI); size_t nrAO = nrO*nrA; for(Index t2=0; t2 < vec_size ; t2++) { // for explanation see GetJointActionObservationHistoryArrays() // // we start with stage size_t stage = (t-1) - t2; //we are going to calculate the joa that took place at time stage size_t b = (size_t) pow((double)nrAO, (double)(stage)); Index aoI_t2 = remainder / b; remainder -= aoI_t2 * b; aIs[t2] = IndexTools:: ActionObservation_to_ActionIndex(aoI_t2, nrA, nrO); oIs[t2] = IndexTools:: ActionObservation_to_ObservationIndex(aoI_t2, nrA, nrO); } } void PlanningUnitMADPDiscrete::GetObservationHistoryArrays (Index agentI, Index ohI, Index t, Index oIs[]) const { //substract the offset to find out what is the index within the time-step-t- //observation-histories. Index ohIwithinThisT = ohI - CastLIndexToIndex(_m_firstOHIforT.at(agentI).at(t)); Index remainder = ohIwithinThisT; size_t vec_size = t; // the number of joint observations we are searching size_t nrO = GetNrObservations(agentI); //size_t nrJA = GetNrJointActions(); for(Index t2=0; t2 < vec_size ; t2++) { // for explanation see GetJointActionObservationHistoryArrays() // // we start with stage size_t stage = (t-1) - t2; //we are going to calculate the joa that took place at time stage size_t b = (size_t) pow((double)nrO, (double)(stage)); Index oI_t2 = remainder / b; oIs[t2] = oI_t2; remainder -= oI_t2 * b; } } void PlanningUnitMADPDiscrete::GetActionHistoryArrays (Index agentI, Index ahI, Index t, Index aIs[]) const { //substract the offset to find out what is the index within the time-step-t- //action-histories. Index ahIwithinThisT = ahI - CastLIndexToIndex(_m_firstAHIforT.at(agentI).at(t)); Index remainder = ahIwithinThisT; size_t vec_size = t; // the number of joint actions we are searching size_t nrA = GetNrActions(agentI); for(Index t2=0; t2 < vec_size ; t2++) { // for explanation see GetJointActionActionHistoryArrays() // // we start with stage size_t stage = (t-1) - t2; //we are going to calculate the joa that took place at time stage size_t b = (size_t) pow((double)nrA, (double)(stage)); Index aI_t2 = remainder / b; aIs[t2] = aI_t2; remainder -= aI_t2 * b; } } //------------------------------------------------- //END of "Get...HistoryArrays/Vectors()" functions //------------------------------------------------- //----------------------------------------- //BEGIN of "Get...HistoryIndex()" functions //----------------------------------------- Index PlanningUnitMADPDiscrete::GetJointObservationHistoryIndex( JointObservationHistoryTree* joh) const { throw E("GetJointObservationHistoryIndex(JointObservationHistoryTree* joh) seems like a dumb-ass function? I mean looping over exponentially many histories does not seem like a nice thing to do?"); for(Index i=0;i<_m_nrJointObservationHistories;i++) { if(_m_jointObservationHistoryTreeVector.at(i)==joh) return(i); } // we should not get here throw E("GetJointObservationHistoryIndex index not found"); return(0); } LIndex PlanningUnitMADPDiscrete::GetJointActionObservationHistoryIndex( JointActionObservationHistoryTree* jaoh) const { throw E("GetJointActionObservationHistoryIndex(JointActionObservationHistoryTree* joh) seems like a dumb-ass function? I mean looping over exponentially many histories does not seem like a nice thing to do?"); for(Index i=0;i<_m_nrJointActionObservationHistories;i++) { if(_m_jointActionObservationHistoryTreeVector.at(i)==jaoh) return(i); } // we should not get here throw E("GetJointObservationHistoryIndex index not found"); return(0); } Index PlanningUnitMADPDiscrete::ComputeHistoryIndex( Index t, //the stage Index t_offset, //for each stage t, there is an offset //const vector& indices, //the indices of the (J)(A/O)s const Index indices [], //the indices of the (J)(A/O)s size_t indexDomainSize //the indices range from 0...(indexDomainSize-1) ) const { //This example assumes we are computing the index of an observation history: // //indices is a vector with the observation indices for stage 0...t-1 // //from this we want to find the history observation index, which is given //by: // o^0 * |O|^(t-1) + ... + o^(t-1) * |O|^0 + stage offset // //where |O| is the `base' of the number as specified by the tuple of //indices // size_t HI=t_offset; for (Index ts=0; ts& observations) const { return( ComputeHistoryIndex( t, CastLIndexToIndex(_m_firstOHIforT.at(agentI).at(t)), &observations[0], GetNrObservations(agentI) ) ); //observations is a vector with the observation indices for stage 0...t-1 // //from this we want to find the history observation index, which is given //by: // o^0 * |O|^(t-1) + ... + o^(t-1) * |O|^0 + stage offset // //where |O| is the `base' of the number as specified by the tuple of //indices // // //size_t this_OHI=_m_firstOHIforT.at(agentI).at(t); //size_t nrO = GetNrObservations(agentI); //for (Index ts=0; ts& jointObservations) const { return( ComputeHistoryIndex( t, CastLIndexToIndex(_m_firstJOHIforT.at(t)), &jointObservations[0], GetNrJointObservations() ) ); /* size_t this_JOHI=_m_firstJOHIforT.at(t); size_t nrJO = GetNrJointObservations(); for (Index ts=0; ts& jointActions) const { return( ComputeHistoryIndex( t, CastLIndexToIndex(_m_firstJAHIforT.at(t)), &jointActions[0], GetNrJointActions() ) ); /* size_t this_JAHI=_m_firstJAHIforT.at(t); size_t nrJA = GetNrJointActions(); for (Index ts=0; ts& actions, const vector& observations ) const { //functioning is the same as for observation histories: only now the //base is the nr AO. //-> first convert to AO indices: size_t first_AOHI=CastLIndexToIndex(_m_firstAOHIforT.at(agentI).at(t)); size_t nrA = GetNrActions(agentI); size_t nrO = GetNrObservations(agentI); size_t nrAO = nrA * nrO; vector AO_Is(t, 0); for (Index ts=0; ts& Jactions, const vector& Jobservations ) const { //functioning is the same as for observation histories: //(only now the base is the nr AO) LIndex first_JAOHI=_m_firstJAOHIforT.at(t); size_t nrJA = GetNrJointActions(); size_t nrJO = GetNrJointObservations(); size_t nrJAO = nrJA * nrJO; vector JAO_Is(t, 0); for (Index ts=0; ts& Jactions, const vector& Jobservations, const Scope& agentSope ) const { //functioning is the same as for observation histories: //(only now the base is the nr AO) LIndex first_JAOHI=_m_firstJAOHIforT.at(t); size_t nrJA = GetNrJointActions(); size_t nrJO = GetNrJointObservations(); size_t nrJAO = nrJA * nrJO; vector JAO_Is(t, 0); for (Index ts=0; ts PlanningUnitMADPDiscrete::JointToIndividualObservationHistoryIndices(Index johI) const { Index t = GetTimeStepForJOHI(johI); Index jo_array[t]; GetJointObservationHistoryArrays(johI, t, jo_array ); //convert joint observations -> indiv. observations vector< vector > indivO_vec; for (Index agentI=0; agentI() ); for (Index ts=0; ts indivIndicesThisT = JointToIndividualObservationIndices(jo_array[ts]); for (Index agentI=0; agentI ohI_vec; for (Index agentI=0; agentI& PlanningUnitMADPDiscrete::JointToIndividualObservationHistoryIndicesRef(Index jObsHistI) const { if(jObsHistI < _m_nrJointObservationHistories) { JointObservationHistoryTree* joht = _m_jointObservationHistoryTreeVector.at(jObsHistI); return(joht->GetJointObservationHistory()-> GetIndividualObservationHistoryIndices()); } else { stringstream ss; ss << "PlanningUnitMADPDiscrete::JointToIndividualObservationHistory"<< "Indices ERROR: index ("<< jObsHistI <<") out of bounds!"<& PlanningUnitMADPDiscrete::JointToIndividualActionObservationHistoryIndicesRef( LIndex jaohI) const { if(jaohI < _m_nrJointActionObservationHistories) { JointActionObservationHistoryTree* jaoht = _m_jointActionObservationHistoryTreeVector[CastLIndexToIndex(jaohI)]; return(jaoht->GetJointActionObservationHistory()-> GetIndividualActionObservationHistoryIndices()); } else { stringstream ss; ss << "PlanningUnitMADPDiscrete::JointToIndividualActionActObserva"<< "tionHistory Indices ERROR: index ("<< jaohI << ") out of bounds!"< >& indivAO_vec ) const { throw E("PlanningUnitMADPDiscrete::JointAOHIndexToIndividualActionObservationVectors(Index jaohI, vector< vector >& indivAO_vec ) const is not yet implemented."); } void PlanningUnitMADPDiscrete::JointAOHIndexToIndividualActionObservationVectors( LIndex jaohI, vector< vector >& indivO_vec, vector< vector >& indivA_vec ) const { Index t = GetTimeStepForJAOHI(jaohI); Index jo_array[t]; Index ja_array[t]; GetJointActionObservationHistoryArrays(jaohI, t, ja_array, jo_array); size_t nrAgents = GetNrAgents(); //convert joint observations -> indiv. observations //indivO_vec[agentI][t] = oI indivO_vec = vector< vector >(nrAgents, vector(t, 0)); indivA_vec = vector< vector >(nrAgents, vector(t, 0)); for (Index ts=0; ts indivA_IndicesThisT = JointToIndividualActionIndices(ja_array[ts]); vector indivO_IndicesThisT = JointToIndividualObservationIndices(jo_array[ts]); for (Index agentI=0; agentI PlanningUnitMADPDiscrete::JointToIndividualActionObservationHistoryIndices( LIndex jaohI) const { Index t = GetTimeStepForJAOHI(jaohI); //indivO_vec[agentI][t] = oI size_t nrAgents = GetNrAgents(); vector< vector > indivO_vec(nrAgents, vector(t, 0)); vector< vector > indivA_vec(nrAgents, vector(t, 0)); JointAOHIndexToIndividualActionObservationVectors( jaohI, indivO_vec, indivA_vec ); //calculate indiv observation history index from seq. of indiv. observations vector aohI_vec; for (Index agentI=0; agentI PlanningUnitMADPDiscrete::JointToIndividualActionHistoryIndices( Index jObsHistI) const { throw E("PlanningUnitMADPDiscrete::JointToIndividualActionHistoryIndices(Index jObsHistI) NOT YET IMPLEMENTED"); } const vector& PlanningUnitMADPDiscrete::JointToIndividualActionHistoryIndicesRef(Index jObsHistI) const { if(jObsHistI < _m_nrJointActionHistories) { JointActionHistoryTree* joht = _m_jointActionHistoryTreeVector[jObsHistI]; return(joht->GetJointActionHistory()-> GetIndividualActionHistoryIndices()); } else { stringstream ss; ss << "PlanningUnitMADPDiscrete::JointToIndividualActionHistoryIndices" <<" ERROR: index ("<< jObsHistI <<") out of bounds!"< PlanningUnitMADPDiscrete:: JointToIndividualPolicyDomainIndices(Index jdI, PolicyGlobals::PolicyDomainCategory cat) const { switch ( cat ) { case PolicyGlobals::OHIST_INDEX : return JointToIndividualObservationHistoryIndices(jdI); break; case PolicyGlobals::AOHIST_INDEX : return JointToIndividualActionObservationHistoryIndices(jdI); break; case PolicyGlobals::TYPE_INDEX : throw(E("JointToIndividualPolicyDomainIndices: types are not a valid policy domain for a PlanningUnitMADPDiscrete")); break; default: throw(E("JointToIndividualPolicyDomainIndices: incorrect JointPolicyDiscrete::PolicyGlobals::PolicyDomainCategory")); break; } } const vector& PlanningUnitMADPDiscrete::JointToIndividualPolicyDomainIndicesRef( Index jdI, PolicyGlobals::PolicyDomainCategory cat) const { switch ( cat ) { case PolicyGlobals::OHIST_INDEX : return JointToIndividualObservationHistoryIndicesRef(jdI); break; case PolicyGlobals::AOHIST_INDEX : return JointToIndividualActionObservationHistoryIndicesRef(jdI); break; case PolicyGlobals::TYPE_INDEX : throw(E("JointToIndividualPolicyDomainIndicesRef: types are not a valid policy domain for a PlanningUnitMADPDiscrete")); break; default: throw(E("JointToIndividualPolicyDomainIndicesRef: incorrect JointPolicyDiscrete::PolicyGlobals::PolicyDomainCategory")); break; } } //----------------------------------------- //BEGIN of "IndividualToJoint...HistoryIndex()" functions //----------------------------------------- Index PlanningUnitMADPDiscrete::IndividualToJointObservationHistoryIndex(Index t, const vector& indivIs) const { //individual observation history index -> individual observation sequences size_t nrAg = GetNrAgents(); vector< Index* > observSeqs(nrAg); for (Index agentI = 0; agentI < nrAg; agentI++) { observSeqs[agentI] = new Index[t]; Index ohI_thisAgent = indivIs.at(agentI); GetObservationHistoryArrays (agentI, ohI_thisAgent, t, observSeqs[agentI] ); } // observSeqs[agent][ts] -> stageObserv[ts][agent] vector< vector > stageObserv(t, vector(nrAg) ); for (Index agentI = 0; agentI < nrAg; agentI++) for (Index ts = 0; ts < t; ts++) stageObserv[ts][agentI] = observSeqs[agentI][ts]; for (Index agentI = 0; agentI < nrAg; agentI++) delete [] observSeqs[agentI]; //individual observation sequences -> joint observation sequences. vector jobs(t); for (Index ts = 0; ts < t; ts++) jobs[ts] = IndividualToJointObservationIndices(stageObserv[ts]); //joint observation sequences -> joint history index. Index johI = GetJointObservationHistoryIndex(t, jobs); return(johI); } Index PlanningUnitMADPDiscrete::IndividualToJointActionHistoryIndex(Index t, const vector& indivIs) const { //individual action history index -> individual action sequences size_t nrAg = GetNrAgents(); vector< Index* > observSeqs(nrAg); for (Index agentI = 0; agentI < nrAg; agentI++) { observSeqs[agentI] = new Index[t]; Index ahI_thisAgent = indivIs.at(agentI); GetActionHistoryArrays (agentI, ahI_thisAgent, t, observSeqs[agentI] ); } // observSeqs[agent][ts] -> stageObserv[ts][agent] vector< vector > stageObserv(t, vector(nrAg) ); for (Index agentI = 0; agentI < nrAg; agentI++) for (Index ts = 0; ts < t; ts++) stageObserv[ts][agentI] = observSeqs[agentI][ts]; for (Index agentI = 0; agentI < nrAg; agentI++) delete [] observSeqs[agentI]; //individual action sequences -> jaint action sequences. vector jabs(t); for (Index ts = 0; ts < t; ts++) jabs[ts] = IndividualToJointActionIndices(stageObserv[ts]); //jaint action sequences -> jaint history index. Index jahI = GetJointActionHistoryIndex(t, jabs); return(jahI); } LIndex PlanningUnitMADPDiscrete::IndividualToJointActionObservationHistoryIndex( Index t, const vector& indivIs) const { //individual observation history index -> individual observation sequences size_t nrAg = GetNrAgents(); vector< Index* > observSeqs(nrAg); vector< Index* > actionSeqs(nrAg); for (Index agentI = 0; agentI < nrAg; agentI++) { observSeqs[agentI] = new Index[t]; actionSeqs[agentI] = new Index[t]; Index aohI_thisAgent = indivIs.at(agentI); GetActionObservationHistoryArrays (agentI, aohI_thisAgent, t, actionSeqs[agentI], observSeqs[agentI] ); } // observSeqs[agent][ts] -> stageObserv[ts][agent] vector< vector > stageObserv(t, vector(nrAg) ); vector< vector > stageAction(t, vector(nrAg) ); for (Index agentI = 0; agentI < nrAg; agentI++) for (Index ts = 0; ts < t; ts++) { stageObserv[ts][agentI] = observSeqs[agentI][ts]; stageAction[ts][agentI] = actionSeqs[agentI][ts]; } for (Index agentI = 0; agentI < nrAg; agentI++) { delete [] observSeqs[agentI]; delete [] actionSeqs[agentI]; } //individual observation sequences -> joint observation sequences. vector jobs(t); vector jacs(t); for (Index ts = 0; ts < t; ts++) { jobs[ts] = IndividualToJointObservationIndices(stageObserv[ts]); jacs[ts] = IndividualToJointActionIndices(stageAction[ts]); } //joint observation sequences -> joint history index. LIndex jaohI = GetJointActionObservationHistoryIndex(t, jacs, jobs); return(jaohI); } //----------------------------------------- //END of "IndividualToJoint...HistoryIndex()" functions //----------------------------------------- //start action hist functions... size_t PlanningUnitMADPDiscrete::GetNrActionHistories(Index agentI) const { if(agentI < _m_nrActionHistories.size() ) return(_m_nrActionHistories.at(agentI)); //else throw(E("ERROR PlanningUnitMADPDiscrete::GetNrActionHistories(Index agentI) index out of bounds or _m_nrActionHistories not yet initialized?!\n")); } size_t PlanningUnitMADPDiscrete::GetNrJointActionHistories() const { /* incorrect calculation (takes cartesian product over action histories * of different time-steps...) * size_t nrJointActionHistories = 1; size_t nrAgents = GetNrAgents(); for(Index agentI=0; agentI < nrAgents; agentI++) nrJointActionHistories *= GetNrActionHistories(agentI); if( nrJointActionHistories != _m_jointActionHistoryTreeVector. size() ) cerr << "WARNING: PlanningUnitMADPDiscrete::GetNrJointActionHistories() - nrJointActionHistories (= "<< nrJointActionHistories <<" ) != _m_jointActionHistoryTreeVector.size() (= "<< _m_jointActionHistoryTreeVector.size() <<" ) !!"< PlanningUnitMADPDiscrete::JointToIndividualActionIndices(Index joI) const { return(GetMADPDI()->JointToIndividualActionIndices(joI)); } JointBeliefInterface* PlanningUnitMADPDiscrete::GetJointBeliefInterface(LIndex jaohI) const { // NOTE: this function so that it always returns a _new_ // joint belief. This means we also do not have to worry about invalidating // the beliefs cache. if(_m_params.GetComputeJointBeliefs()) { JointBeliefInterface* jbi = GetNewJointBeliefInterface(); *jbi = *(_m_jBeliefCache.at(CastLIndexToIndex(jaohI))); //make a copy return jbi; } else { vector jaIs; vector joIs; GetJointActionObservationHistoryVectors(jaohI,jaIs,joIs); JointBeliefInterface* JB = GetNewJointBeliefFromISD(); for(unsigned i=0;i!=jaIs.size();++i) JB->Update(*GetMADPDI(),jaIs[i],joIs[i]); #if DEBUG_PUDCGETJB if(!JB->SanityCheck()) { JB->Print(); abort(); } #endif return(JB); } } double PlanningUnitMADPDiscrete::GetJAOHProbs( //output args: JointBeliefInterface* jb, //input args: LIndex jaohI, // the jaohI for which we want to know the probs LIndex p_jaohI, //=0 the GIVEN predecessor const JointBeliefInterface* p_jb,// = NULL, // the corresponding GIVEN jb of p const JointPolicyDiscrete * jpol// = NULL // the policy followed in ) const { if(p_jaohI == 0 && p_jb == NULL && jpol==NULL) //the cacheable case if(_m_params.GetComputeJointBeliefs() ) { //return the cached results... // //we have to make a copy (can't do jb = ..., because that would //not be reflected in the calling function) *jb = *_m_jBeliefCache[CastLIndexToIndex(jaohI)]; return (_m_jaohProbs[CastLIndexToIndex(jaohI)]); } //we can't get the cached result, so we have to compute. Index t = GetTimeStepForJAOHI(jaohI); Index t_p = GetTimeStepForJAOHI(p_jaohI); Index jaIs[t]; Index joIs[t]; GetJointActionObservationHistoryArrays(jaohI, t, jaIs, joIs); #if DEBUG_PUD_JAOHPROBS vector jaIsv,joIsv; JointActionObservationHistoryTree* jaoht = GetJointActionObservationHistoryTree(jaohI); jaoht->GetJointActionObservationHistory()-> GetJointActionObservationHistoryVectors(jaIsv, joIsv); cout << "t " << t << " " << jaohI << "\njaIsv:" << SoftPrintVector(jaIsv) << ", joIsv:" << SoftPrintVector(joIsv) << ", jaoht:" << jaoht->GetJointActionObservationHistory()->SoftPrint() << endl; for(Index i=0;i!=t;++i) cout << "jaIs["<= t) return (0.0); if(t_p == 0) throw E(" p_jaohI != 0 but t_p == 0 "); //and 2) the consistency check GetJointActionObservationHistoryArrays(p_jaohI, t_p, p_jaIs, p_joIs); for(Index tI=0; tI < t_p; tI++) { if ( jaIs[tI] == p_jaIs[tI] && joIs[tI] == p_joIs[tI] ) ; //consistent else { cerr << "GetJAOHProbs:: Warning pred. inconsistent with requested jaohI" << endl; return (0.0); // p_jaohI is inconsistent with jaohI. } } } //p_jaIs[ t_p ... (t-1) ] contains the joint actions `still to be taken' //to get from p_jaohI to jaohI. if(p_jaohI != 0 && p_jb == NULL) { // a predecessor is specified, but without accompanying joint belief. // In this case we assume that a pure (deterministic) joint policy // that is consistent with p_jaohI has been followed. if(_m_params.GetComputeJointBeliefs() ) { //if joint beliefs are cache use them: *jb = *_m_jBeliefCache[CastLIndexToIndex(jaohI)]; double pr = _m_jaohProbs[CastLIndexToIndex(jaohI)]; double p_pr = _m_jaohProbs[CastLIndexToIndex(p_jaohI)]; double pr_cond = pr / p_pr; return pr_cond; } else { // Here we compute the joint belief corresponding to p_jaohI for // such a pure joint policy. by performing the belief update // starting from the first time step jb->Set( *GetMADPDI()->GetISD() ); //*jb = *GetNewJointBeliefFromISD(); GetJAOHProbsRecursively(jb, p_jaIs, p_joIs, 0, t_p, Globals::INITIAL_JAOHI ); //GetJAOHProbsRecursively(jb, p_jaIs, p_joIs, t0, t_p, jaoh0 ); } } else if ( p_jb == NULL ) // and p_jaohI == 0 jb->Set( *GetMADPDI()->GetISD() ); //*jb = *GetNewJointBeliefFromISD(); else *jb = *p_jb; //copy by value, we don't want to alter p_jb! double p = GetJAOHProbsRecursively(jb, jaIs, joIs, t_p, t, //jaohI, p_jaohI, jpol); return(p); } double PlanningUnitMADPDiscrete::GetJAOHProbsRecursively( //input/output arg: JointBeliefInterface* jb, //input args: const Index jaIs[], const Index joIs[], Index t_p, Index t, // const Index jaohI, // the jaohI for which we want to know the probs LIndex p_jaohI,// = 0, // the GIVEN predecessor // const JointBelief* p_jb = NULL, // the corresponding GIVEN jb of p const JointPolicyDiscrete * jpol// = NULL // the policy followed in ) const { //if(jaohI == p_jaohI) if(t == t_p) return(1.0); Index jaI = jaIs[t_p]; Index joI = joIs[t_p]; double cond_P = jb->Update(*GetMADPDI(), jaI, joI); // Index next_p_jaohI = //??? double P_remainder = GetJAOHProbsRecursively( jb, jaIs, joIs, t_p + 1, t, // jaohI, GetSuccessorJAOHI(p_jaohI, jaI, joI), jpol ); //jb should now be the jb corresponding to jaohI double polProb = 0.0; if(jpol != NULL) { LIndex jdI = 0; switch ( jpol->GetPolicyDomainCategory() ) { case OHIST_INDEX : jdI = GetJointObservationHistoryIndex(t_p, joIs); break; case AOHIST_INDEX : jdI = p_jaohI; break; default: throw E("PlanningUnitMADPDiscrete::GetJAOHProbsRecursively --- policy has unsupported PolicyDomainCategory"); } polProb = jpol->GetJointActionProb( jdI, jaI ) ; } else polProb = 1.0; //line 10 of Algorithm 1 of the manual documentation: double Prob_jaohI = P_remainder * cond_P * polProb; return (Prob_jaohI); } double PlanningUnitMADPDiscrete::GetJAOHProb( LIndex jaohI, Index p_jaohI, // the GIVEN predecessor const JointBeliefInterface* p_jb, const JointPolicyDiscrete* jpol ) const { JointBeliefInterface* dummy = GetNewJointBeliefInterface(); double p = GetJAOHProbs(dummy, jaohI, p_jaohI, p_jb, jpol ); delete dummy; return p; } double PlanningUnitMADPDiscrete::GetJAOHProbGivenPred(LIndex jaohI) const { if(_m_params.GetComputeJointActionObservationHistories()) return(_m_jaohConditionalProbs[CastLIndexToIndex(jaohI)]); //else vector jaIs; vector joIs; GetJointActionObservationHistoryVectors(jaohI,jaIs,joIs); Index previous = GetJointActionObservationHistoryIndex(jaIs.size()-1, jaIs,joIs); JointBeliefInterface* dummy = GetNewJointBeliefInterface(); double prob = GetJAOHProbs(dummy, jaohI, previous); delete dummy; return prob; } //print functions void PlanningUnitMADPDiscrete::PrintObservationHistories() { size_t nrAgents=GetNrAgents(); for(Index i = 0; i < nrAgents; i++) { cout << "ObservationHistoryTree for agent "<Print(); } } void PlanningUnitMADPDiscrete::PrintActionHistories() { size_t nrAgents=GetNrAgents(); for(Index i = 0; i < nrAgents; i++) { cout << "ActionHistoryTree for agent "<Print(); } } void PlanningUnitMADPDiscrete::PrintActionObservationHistories() { if(!_m_params.GetComputeIndividualActionObservationHistories()) { cout<<"PlanningUnitMADPDiscrete::PrintActionObservationHistories()"<< " called on a P.U. that did not generate action-observation"<< " histories."<Print(); } } void PlanningUnitMADPDiscrete::Print() { if(! _m_initialized) cerr << "This PlanningUnitMADPDiscrete is not initialized (yet)" << endl; else { cout << "PlanningUnitMADPDiscrete parameters:" << endl; _m_params.Print(); //observ. cout << "number of individual observation histories: "; PrintVectorCout(_m_nrObservationHistories); cout << endl; cout << "number of individual observation histories per time step: "; PrintVectorCout(_m_nrObservationHistoriesT); cout << endl; cout << "index of first indiv. observation histories per time step: "; PrintVectorCout(_m_firstOHIforT); cout << endl; if(_m_params.GetComputeIndividualObservationHistories()) PrintObservationHistories(); cout << "number of joint observation histories: "<< _m_nrJointObservationHistories << endl; if(_m_params.GetComputeJointObservationHistories()) _m_jointObservationHistoryTreeRoot->Print(); //actions cout << "number of individual action histories: "; PrintVectorCout(_m_nrActionHistories); cout << endl; cout << "number of individual action histories per time step: "; PrintVectorCout(_m_nrActionHistoriesT); cout << endl; cout << "index of first indiv. action histories per time step: "; PrintVectorCout(_m_firstAHIforT); cout << endl; if(_m_params.GetComputeIndividualActionHistories()) PrintActionHistories(); cout << "number of joint action histories: "<< _m_nrJointActionHistories << endl; if(_m_params.GetComputeJointActionHistories()) _m_jointActionHistoryTreeRoot->Print(); //action-observations cout << "number of individual action-observation histories: "; PrintVectorCout(_m_nrActionObservationHistories); cout << endl; cout << "number of individual action-observ. histories per time step: "; PrintVectorCout(_m_nrActionObservationHistoriesT); cout << endl; cout << "index of first indiv. action-obs. histories per time step: "; PrintVectorCout(_m_firstAOHIforT); cout << endl; if(_m_params.GetComputeIndividualActionObservationHistories()) PrintActionObservationHistories(); cout << "number of joint action observation histories: "<< _m_nrJointActionObservationHistories << endl; if(_m_params.GetComputeJointActionObservationHistories()) _m_jointActionObservationHistoryTreeRoot->Print(); } } Index PlanningUnitMADPDiscrete::GetTimeStepForOHI(Index agI, Index ohI) const { if(_m_params.GetComputeIndividualObservationHistories()) return(GetObservationHistoryTree(agI, ohI)->GetContainedElement()-> GetLength() ); //else... find out what time step this is a joh for Index t = 0; size_t h=GetHorizon(); while( t < h && _m_firstOHIforT.at(agI).at(t) <= ohI ) t++; // _m_firstJOHIforT[t] > ohI OR t==GetHorizon if(t == h) t--; //last time step is h-1 else t--;//_m_nrJointObservationHistoriesT[t] > ohI so ohI belongs to //previous time step. return(t); } Index PlanningUnitMADPDiscrete::GetTimeStepForJOHI(Index johI) const { if(_m_params.GetComputeJointObservationHistories()) return(GetJointObservationHistoryTree(johI)->GetContainedElement()-> GetLength() ); //else... find out what time step this is a joh for Index t = 0; size_t h=GetHorizon(); while( t < h && _m_firstJOHIforT[t] <= johI ) t++; // _m_firstJOHIforT[t] > johI OR t==GetHorizon if(t == h) t--; //last time step is h-1 else t--;//_m_nrJointObservationHistoriesT[t] > johI so johI belongs to //previous time step. return(t); } Index PlanningUnitMADPDiscrete::GetSuccessorJOHI(Index johI, Index joI) const { if(_m_params.GetComputeJointObservationHistories()) return(CastLIndexToIndex(GetJointObservationHistoryTree(johI)->GetSuccessor(joI)-> GetIndex())); Index t = GetTimeStepForJOHI(johI); if(t >= GetHorizon() - 1) throw E("taking successor of last time step joint observation history"); //Index johI Without Offset: Index johI_wo = johI - CastLIndexToIndex(_m_firstJOHIforT[t]); //johI_wo = |jo|^t * joI(0) +...+ |jo|^0 * joI(t) //johIsuc_wo= |jo^|^(t+1) *joI(0) +...+ |jo|^1 * joI(t) + |jo|^0 * joI(t+1) //therefore the index of the successor (without offset) is: Index johIsuc_wo = johI_wo * GetNrJointObservations() + joI; return(johIsuc_wo + CastLIndexToIndex(_m_firstJOHIforT[t+1])); } Index PlanningUnitMADPDiscrete::GetSuccessorOHI(Index agI, Index ohI, Index oI) const { if(_m_params.GetComputeIndividualObservationHistories()) return(CastLIndexToIndex(GetObservationHistoryTree(agI, ohI)->GetSuccessor(oI)-> GetIndex())); Index t = GetTimeStepForOHI(agI, ohI); if(t >= GetHorizon() - 1) throw E("taking successor of last time step observation history"); //Index ohI Without Offset: Index ohI_wo = ohI - CastLIndexToIndex(_m_firstOHIforT.at(agI).at(t)); //ohI_wo = |o|^t * oI(0) +...+ |o|^0 * oI(t) //ohIsuc_wo= |o^|^(t+1) *oI(0) +...+ |o|^1 * oI(t) + |o|^0 * oI(t+1) //therefore the index of the successor (without offset) is: Index ohIsuc_wo = ohI_wo * GetNrObservations(agI) + oI; return(ohIsuc_wo + CastLIndexToIndex(_m_firstOHIforT.at(agI).at(t+1))); } Index PlanningUnitMADPDiscrete::GetTimeStepForAHI(Index agI, Index ahI) const { if(_m_params.GetComputeIndividualActionHistories()) return(GetActionHistoryTree(agI, ahI)->GetContainedElement()-> GetLength() ); //else... find out what time step this is a joh for Index t = 0; size_t h=GetHorizon(); while( t < h && _m_firstAHIforT.at(agI).at(t) <= ahI ) t++; // _m_firstJAHIforT[t] > ahI OR t==GetHorizon if(t == h) t--; //last time step is h-1 else t--;//_m_nrJointActionHistoriesT[t] > ahI so ahI belongs to //previous time step. return(t); } Index PlanningUnitMADPDiscrete::GetTimeStepForJAHI(Index jahI) const { if(_m_params.GetComputeJointActionHistories()) return(GetJointActionHistoryTree(jahI)->GetContainedElement()-> GetLength() ); //else... find out what time step this is a joh for Index t = 0; size_t h=GetHorizon(); while( t < h && _m_firstJAHIforT[t] <= jahI ) t++; // _m_firstJAHIforT[t] > jahI OR t==GetHorizon if(t == h) t--; //last time step is h-1 else t--;//_m_nrJointActionHistoriesT[t] > jahI so jahI belongs to //previous time step. return(t); } Index PlanningUnitMADPDiscrete::GetSuccessorJAHI(Index jahI, Index joI) const { if(_m_params.GetComputeJointActionHistories()) return(CastLIndexToIndex(GetJointActionHistoryTree(jahI)->GetSuccessor(joI)-> GetIndex())); Index t = GetTimeStepForJAHI(jahI); if(t >= GetHorizon() - 1) throw E("taking successor of last time step joint action history"); //Index jahI Without Offset: Index jahI_wo = jahI - CastLIndexToIndex(_m_firstJAHIforT[t]); //jahI_wo = |jo|^t * joI(0) +...+ |jo|^0 * joI(t) //jahIsuc_wo= |jo^|^(t+1) *joI(0) +...+ |jo|^1 * joI(t) + |jo|^0 * joI(t+1) //therefore the index of the successor (without offset) is: Index jahIsuc_wo = jahI_wo * GetNrJointActions() + joI; return(jahIsuc_wo + CastLIndexToIndex(_m_firstJAHIforT[t+1])); } Index PlanningUnitMADPDiscrete::GetSuccessorAHI(Index agI, Index ahI, Index oI) const { if(_m_params.GetComputeIndividualActionHistories()) return(CastLIndexToIndex(GetActionHistoryTree(agI, ahI)->GetSuccessor(oI)-> GetIndex())); Index t = GetTimeStepForAHI(agI, ahI); if(t >= GetHorizon() - 1) throw E("taking successor of last time step action history"); //Index ahI Without Offset: Index ahI_wo = ahI - CastLIndexToIndex(_m_firstAHIforT.at(agI).at(t)); //ahI_wo = |o|^t * oI(0) +...+ |o|^0 * oI(t) //ahIsuc_wo= |o^|^(t+1) *oI(0) +...+ |o|^1 * oI(t) + |o|^0 * oI(t+1) //therefore the index of the successor (without offset) is: Index ahIsuc_wo = ahI_wo * GetNrActions(agI) + oI; return(ahIsuc_wo + CastLIndexToIndex(_m_firstAHIforT.at(agI).at(t+1))); } Index PlanningUnitMADPDiscrete::GetTimeStepForAOHI(Index agI,Index aohI) const { // copied from GetTimeStepForJOHI if(_m_params.GetComputeIndividualActionObservationHistories()) return(CastLIndexToIndex(GetActionObservationHistoryTree(agI, aohI)-> GetContainedElement()->GetLength())); else { Index t = 0; while( t < GetHorizon() && _m_firstAOHIforT.at(agI).at(t) <= aohI ) t++; // _m_firstJAOHIforT[t] > johI OR t==GetHorizon if(t == GetHorizon()) t--; //last time step is h-1 else t--;//_m_nrJointActionObservationHistoriesT[t] > aohI so //johI belongs to previous time step. return(t); } } Index PlanningUnitMADPDiscrete::GetTimeStepForJAOHI(LIndex jaohI) const { // copied from GetTimeStepForJOHI if(_m_params.GetComputeJointActionObservationHistories()) return(GetJointActionObservationHistoryTree(jaohI)-> GetContainedElement()->GetLength() ); else { Index t = 0; if(GetHorizon()==MAXHORIZON) throw(E("PlanningUnitMADPDiscrete::GetTimeStepForJAOHI does not work yet for infinite-horizon case")); while( t < GetHorizon() && _m_firstJAOHIforT[t] <= jaohI ) t++; // _m_firstJAOHIforT[t] > johI OR t==GetHorizon if(t == GetHorizon()) t--; //last time step is h-1 else t--;//_m_nrJointActionObservationHistoriesT[t] > jaohI so //johI belongs to previous time step. return(t); } } Index PlanningUnitMADPDiscrete::GetSuccessorAOHI(Index agI, Index aohI, Index aI, Index oI) const { // copied from GetSuccessorJOHI, look there for comments if(_m_params.GetComputeIndividualActionObservationHistories()) return(CastLIndexToIndex(GetActionObservationHistoryTree(agI, aohI)-> GetSuccessor(aI,oI)->GetIndex())); else { Index t = GetTimeStepForAOHI(agI, aohI); if(t >= GetHorizon() - 1) throw E("taking successor of last time step action observation history"); Index aohI_wo = aohI - CastLIndexToIndex(_m_firstAOHIforT.at(agI).at(t)); Index aohIsuc_wo = aohI_wo * GetNrObservations(agI)* GetNrActions(agI) + aI * GetNrObservations(agI) +oI; return(aohIsuc_wo + CastLIndexToIndex(_m_firstAOHIforT.at(agI).at(t+1))); } } LIndex PlanningUnitMADPDiscrete::GetSuccessorJAOHI(LIndex jaohI, Index jaI, Index joI) const { LIndex jaohIsuc; // copied from GetSuccessorJOHI, look there for comments if(_m_params.GetComputeJointActionObservationHistories()) jaohIsuc=GetJointActionObservationHistoryTree(jaohI)-> GetSuccessor(jaI,joI)->GetIndex(); else { Index t = GetTimeStepForJAOHI(jaohI); if(t >= GetHorizon() - 1) throw E("taking successor of last time step joint action observation history"); LIndex jaohI_wo = jaohI - _m_firstJAOHIforT[t]; LIndex jaohIsuc_wo = jaohI_wo * GetNrJointObservations()* GetNrJointActions() + jaI * GetNrJointObservations() +joI; jaohIsuc=jaohIsuc_wo + _m_firstJAOHIforT[t+1]; } if(jaohIsucGetIndex()); _m_jointActionObservationHistoryTreeMap[i]=jaoht; } JointBeliefInterface* PlanningUnitMADPDiscrete::GetNewJointBeliefFromISD() const { JointBeliefInterface* b0 = GetNewJointBeliefInterface(); const MultiAgentDecisionProcessDiscreteInterface* madpd = GetMADPDI(); const StateDistribution* isd = madpd->GetISD(); b0->Set( *isd ); return(b0); } JointActionObservationHistoryTree* PlanningUnitMADPDiscrete::GetJointActionObservationHistoryTree(LIndex jaohI) const { if(_m_params.GetComputeJointActionObservationHistories()) return(_m_jointActionObservationHistoryTreeVector.at(CastLIndexToIndex(jaohI))); else { // cannot use m_jointActionObservationHistoryTreeMap[jaohI], // it violates the const, as it creates an empty object if // jaohI does not exist yet map::const_iterator cit = _m_jointActionObservationHistoryTreeMap.find(jaohI); if(cit!=_m_jointActionObservationHistoryTreeMap.end()) return(cit->second); else { return(0); // throw(E("GetJointActionObservationHistoryTree:: index not found in map")); } } } bool PlanningUnitMADPDiscrete::AreCachedJointToIndivIndices( PolicyGlobals::PolicyDomainCategory pdc) const { switch ( pdc ) { case PolicyGlobals::OHIST_INDEX : return _m_params.GetComputeJointObservationHistories(); break; case PolicyGlobals::AOHIST_INDEX : return _m_params.GetComputeJointActionObservationHistories(); break; case PolicyGlobals::TYPE_INDEX : throw(E("PlanningUnitMADPDiscrete::AreCachedJointToIndivIndices: types are not defined in a PlanningUnitMADPDiscrete context")); return false; break; default: throw(E("Used a JointPolicyDiscrete::PolicyGlobals::PolicyDomainCategory unknown to PlanningUnitMADPDiscrete!")); break; } /* ----- end switch ----- */ } string PlanningUnitMADPDiscrete::SoftPrintPolicyDomainElement( Index agentI, Index dI, PolicyGlobals::PolicyDomainCategory cat ) const { switch ( cat ) { case PolicyGlobals::OHIST_INDEX : { string s = SoftPrintObservationHistory(agentI, dI); return s; break; } case PolicyGlobals::AOHIST_INDEX : return GetActionObservationHistoryTree(agentI,dI)-> GetActionObservationHistory()->SoftPrint(); break; case PolicyGlobals::TYPE_INDEX : throw(E("SoftPrintPolicyDomain: types are not a valid policy domain for a PlanningUnitMADPDiscrete")); break; default: throw(E("SoftPrintPolicyDomain: incorrect JointPolicyDiscrete::PolicyGlobals::PolicyDomainCategory")); break; } return("IMPOSSIBLE!"); } size_t PlanningUnitMADPDiscrete::GetNrPolicyDomainElements( Index agentI, PolicyGlobals::PolicyDomainCategory cat, size_t depth ) const { switch ( cat ) { case PolicyGlobals::OHIST_INDEX: if(depth==MAXHORIZON || depth==GetHorizon()) return GetNrObservationHistories(agentI); else return(CastLIndexToIndex(_m_firstOHIforT.at(agentI).at(depth))); break; case PolicyGlobals::AOHIST_INDEX: if(depth==MAXHORIZON || depth==GetHorizon()) return GetNrActionObservationHistories(agentI); else return(CastLIndexToIndex(_m_firstAOHIforT.at(agentI).at(depth))); break; case PolicyGlobals::TYPE_INDEX : throw(E(" GetNrPolicyDomainElements: types are not a valid policy domain for a PlanningUnitMADPDiscrete")); break; default: throw(E("incorrect JointPolicyDiscrete::PolicyGlobals::PolicyDomainCategory")); break; } } PolicyGlobals::PolicyDomainCategory PlanningUnitMADPDiscrete::GetDefaultIndexDomCat() const { return PolicyGlobals::OHIST_INDEX; } JointBeliefInterface * PlanningUnitMADPDiscrete::GetNewJointBeliefInterface() const { if( _m_params.GetUseSparseJointBeliefs() ) return (new JointBeliefSparse(GetNrStates()) ); else return (new JointBelief(GetNrStates()) ); } JointBeliefInterface * PlanningUnitMADPDiscrete::GetNewJointBeliefInterface(size_t size) const { if( _m_params.GetUseSparseJointBeliefs() ) return (new JointBeliefSparse(size) ); else return (new JointBelief(size) ); } string PlanningUnitMADPDiscrete::SoftPrintObservationHistory(Index agentI, Index ohIndex) const { string s; if(_m_params.GetComputeIndividualObservationHistories()) s = GetObservationHistoryTree(agentI,ohIndex)-> GetObservationHistory()->SoftPrint(); else { Index t = GetTimeStepForOHI(agentI, ohIndex); Index obs[t]; GetObservationHistoryArrays(agentI, ohIndex, t, obs); stringstream ss; ss << "("; for(Index t2=0; t2GetName(); ss << oName; if(t2 + 1 < t) ss << ","; } ss << ")"; s = ss.str(); } return(s); } string PlanningUnitMADPDiscrete::SoftPrintAction(Index agentI, Index actionI) const { return(GetAction(agentI, actionI)->GetName()); } void PlanningUnitMADPDiscrete::ExportDotGraph(const std::string &filename, const PolicyDiscretePure &policy, Index agentI, bool labelEdges) const { ofstream fp(filename.c_str()); if(!fp) { stringstream ss; ss << "PlanningUnitMADPDiscrete::ExportDotGraph failed to open file " << filename << endl; throw E(ss); } fp << PolicyToDotGraph(policy,agentI,labelEdges); } string PlanningUnitMADPDiscrete::PolicyToDotGraph(const PolicyDiscretePure &policy, Index agentI, bool labelEdges) const { stringstream ss; ss << "digraph policyAgent" << agentI << " {" << endl; ss << "edge [dir=none];" << endl; // first we label each node with its action for(Index i=0; i!=GetNrObservationHistories(agentI); ++i) ss << "node" << i << " [ label=\"" << SoftPrintAction(agentI, policy.GetActionIndex(i)) << "\" ];" << endl; // then we draw all the edges for(Index i=0; i!=GetNrObservationHistories(agentI); ++i) { Index t = GetTimeStepForOHI(agentI, i); if(t >= GetHorizon() - 1) continue; for(Index o=0;o!=GetNrObservations(agentI);++o) { ss << "node" << i << " -> " << "node" << GetSuccessorOHI(agentI, i, o); if(labelEdges) ss << " [label=\"" << GetObservation(agentI, o)->GetName() << "\"]"; ss << ";" << endl; } } ss << "}" << endl; return(ss.str()); } madp-0.4/src/support/PaxHeaders.5405/NullPlanner.cpp0000644000000000000000000000013212717644275017230 xustar0030 mtime=1463765181.549708594 30 atime=1463765181.545708625 30 ctime=1463765201.741547326 madp-0.4/src/support/NullPlanner.cpp0000664000372100037210000000306512717644275020070 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "NullPlanner.h" NullPlanner::NullPlanner(DecPOMDPDiscreteInterface* p) { PlanningUnitMADPDiscreteParameters params; params.SetComputeAll(false); SetParams(params); SetProblem(p); } NullPlanner::NullPlanner(size_t horizon, DecPOMDPDiscreteInterface* p) { PlanningUnitMADPDiscreteParameters params; params.SetComputeAll(false); SetParams(params); SetProblem(p); SetHorizon(horizon); } NullPlanner::NullPlanner(const PlanningUnitMADPDiscreteParameters ¶ms, size_t horizon, DecPOMDPDiscreteInterface* p) : PlanningUnitDecPOMDPDiscrete(params,horizon,p) { } void NullPlanner::Plan() { throw(E("NullPlanner::Plan() should not be called")); } double NullPlanner::GetExpectedReward() const { throw(E("NullPlanner::GetExpectedReward() should not be called")); return(0); } boost::shared_ptr NullPlanner::GetJointPolicy() { throw(E("NullPlanner::GetJointPolicy() should not be called")); return(boost::shared_ptr()); } madp-0.4/src/support/PaxHeaders.5405/ProblemFOBSFireFightingGraph.h0000644000000000000000000000013012717644275021763 xustar0029 mtime=1463765181.57770837 29 atime=1463765181.57770837 30 ctime=1463765201.637548157 madp-0.4/src/support/ProblemFOBSFireFightingGraph.h0000664000372100037210000000364012717644275022624 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Philipp Robbel * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _PROBLEMFOBSFIREFIGHTINGGRAPH_H_ #define _PROBLEMFOBSFIREFIGHTINGGRAPH_H_ 1 /* the include directives */ #include "Globals.h" #include "ProblemFOBSFireFightingFactored.h" /** \brief ProblemFOBSFireFightingGraph is an implementation of a * fully overservable FireFightingGraph problem. */ class ProblemFOBSFireFightingGraph : public ProblemFOBSFireFightingFactored { private: std::string SoftPrintBriefDescription( size_t nrAgents, size_t nrHouses, size_t nrFLs) const; std::string SoftPrintDescription(size_t nrAgents, size_t nrHouses, size_t nrFLs) const; ///Construct all the Actions and actionSets (the vector _m_actionVecs). void ConstructActions(); size_t GetAgentLocation(Index action, Index agI) const; size_t GetNrAgentsAtHouse(const std::vector< Index>& As, Index hI) const; Scope GetHousesAgentInfluences(Index agI) const; //overide scope functions void SetYScopes(); public: /// (default) Constructor ProblemFOBSFireFightingGraph(size_t nrAgents, size_t nrFireLevels); /// Destructor. virtual ~ProblemFOBSFireFightingGraph(){}; }; #endif /* !_PROBLEMFOBSFIREFIGHTINGGRAPH_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/ObservationHistoryTree.cpp0000644000000000000000000000013212717644275021473 xustar0030 mtime=1463765181.305710543 30 atime=1463765181.301710574 30 ctime=1463765201.717547517 madp-0.4/src/support/ObservationHistoryTree.cpp0000664000372100037210000000612112717644275022327 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #define DEBUG_OHT 0 /* //Default constructor ObservationHistoryTree::ObservationHistoryTree() { _m_index = 0; _m_indexValid = false; _m_obsHist = 0; } ObservationHistoryTree::ObservationHistoryTree(ObservationHistory *const oh) { _m_index = 0; _m_indexValid = false; _m_obsHist = oh; } //Copy assignment constructor. ObservationHistoryTree::ObservationHistoryTree(const ObservationHistoryTree& o) { if(DEBUG_OHT){ cout << "Cloning ObservationHistoryTree. This node "; PrintThisNode();cout << endl;} } //Destructor -- deletes this node, the contained ObservationHistory and all //successors ObservationHistoryTree::~ObservationHistoryTree() { if(DEBUG_OHT){ cout << "Deleting ObservationHistoryTree. This node "; PrintThisNode();cout << endl;} delete(_m_obsHist); vector::iterator it = _m_successor.begin(); vector::iterator last = _m_successor.end(); while(it != last) { delete(*it); it++; } _m_successor.clear(); } void ObservationHistoryTree::SetSuccessor(Index observationI, ObservationHistoryTree* suc) { size_t cursize = _m_successor.size(); if(observationI == cursize) _m_successor.push_back(suc); else if(observationI < 0 || observationI > _m_successor.size() ) cout << "ObservationHistoryTree::SetSuccessor ERROR index out of" << " bounds! (perhaps setting _m_successor[" << observationI<< "] before _m_successor[" << observationI-1 << "] ?? )"; else { cout << "_m_successor["<< observationI<< "] already set: overwriting!"; _m_successor[observationI] = suc; } } ObservationHistoryTree* ObservationHistoryTree::GetSuccessor(Index observationI) const { if(observationI < 0 || observationI >= _m_successor.size() ) throw E("ObservationHistoryTree::GetSuccessor index out of bounds!"); else return(_m_successor[observationI]); } void ObservationHistoryTree::PrintThisNode() const { if(_m_obsHist != 0) { cout << "index: "<<_m_index<<" - "; _m_obsHist->Print(); } } void ObservationHistoryTree::Print() const { if(_m_obsHist != 0) { cout << "index: "<<_m_index<<" - "; _m_obsHist->Print(); cout <::const_iterator it = _m_successor.begin(); vector::const_iterator last = _m_successor.end(); while(it != last) { if(*it != 0) (*it)->Print(); it++; } } } */ madp-0.4/src/support/PaxHeaders.5405/JointBeliefEventDriven.cpp0000644000000000000000000000013212717644275021342 xustar0030 mtime=1463765181.301710574 30 atime=1463765181.301710574 30 ctime=1463765201.729547421 madp-0.4/src/support/JointBeliefEventDriven.cpp0000664000372100037210000001620012717644275022175 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Joao Messias * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "JointBeliefEventDriven.h" #include //Necessary as header file contains a forward declaration: #include "MultiAgentDecisionProcessDiscreteInterface.h" #include #include "TransitionModelMapping.h" #include "EventObservationModelMapping.h" using namespace std; #define JointBeliefEventDriven_doSanityCheckAfterEveryUpdate 0 #define JointBeliefEventDriven_hardCap 10 ///Maximum number of iterations. Limits computational time in large systems in exchange for accuracy. #define JointBeliefEventDriven_softCap 10 ///Protection against badly conditioned systems. #define JointBeliefEventDriven_convergenceTh 0.01 JointBeliefEventDriven::JointBeliefEventDriven(size_t size, int falseNegativeObs) : Belief(size), _m_falseNegativeObs(falseNegativeObs) { } JointBeliefEventDriven::JointBeliefEventDriven(const vector &belief, int falseNegativeObs) : Belief(belief), _m_falseNegativeObs(falseNegativeObs) { } JointBeliefEventDriven::JointBeliefEventDriven(const JointBeliefInterface &belief, int falseNegativeObs) : Belief(belief), _m_falseNegativeObs(falseNegativeObs) { } JointBeliefEventDriven::JointBeliefEventDriven(const StateDistribution& belief, int falseNegativeObs) : Belief(belief), _m_falseNegativeObs(falseNegativeObs) {} //Destructor JointBeliefEventDriven::~JointBeliefEventDriven() { } JointBeliefEventDriven& JointBeliefEventDriven::operator= (const JointBeliefEventDriven& o) { if (this == &o) return *this; // Gracefully handle self assignment Belief::operator=(o); return(*this); } JointBeliefInterface& JointBeliefEventDriven::operator= (const JointBeliefInterface& o) { //this code is called when we perform // jb1 = jb2 // and jb1 is a JointBeliefEventDriven (I.e., this is the operator= function of jb1 // and *this* is a JointBeliefEventDriven, since we got here) // // Therefore this code assumes that jb2 (I.e., 'o') is also a JointBeliefEventDriven // (and not a JointBeliefEventDrivenSparse or something like that). // // If it is something else, we get in trouble here! if (this == &o) return *this; // Gracefully handle self assignment try{ const JointBeliefEventDriven& casted_o = dynamic_cast(o); return(operator=(casted_o));// call the operator= for JointBeliefEventDriven }catch(std::bad_cast bc){ throw E("JointBeliefEventDriven::operator= bad_cast exception. Are you trying to assign me (a JointBeliefEventDriven) with some other JointBeliefInterface (e.g. JointBelief) ??"); } } double JointBeliefEventDriven::Update(const MultiAgentDecisionProcessDiscreteInterface &pu, Index lastJAI, Index newJOI) { using namespace boost::numeric::ublas; if(!pu.GetEventObservability()) throw E("Trying to use a JointBeliefEventDriven on a model without event observability."); size_t nrS = pu.GetNrStates(); const TransitionModelMapping *T = dynamic_cast(pu.GetTransitionModelDiscretePtr()); const EventObservationModelMapping *O = dynamic_cast(pu.GetObservationModelDiscretePtr()); double eta = 0; if(T != 0 && O != 0) { using namespace boost::numeric::ublas; //we need to break the abstraction here since we'll be using ublas over T and O. //Ideally, we could have some kind of built in conversion. const matrix* Ta = T->GetMatrixPtr(lastJAI); const matrix* Oao = O->GetMatrixPtr(lastJAI,newJOI); matrix* Hao = new matrix(element_prod(*Ta,*Oao)); matrix H = *Hao; double epsilon, last_epsilon = 0; //We need b in ublas form. boost::numeric::ublas::vector b(nrS); std::copy(_m_b.begin(), _m_b.end(), b.begin()); boost::numeric::ublas::vector res = zero_vector(nrS); boost::numeric::ublas::vector bUpdated = prod(b,H); epsilon = JointBeliefEventDriven_convergenceTh; if(_m_falseNegativeObs >= 0) { const matrix* Oaf = O->GetMatrixPtr(lastJAI,_m_falseNegativeObs); //At this point we have two |S|x|S| matrices //What we want to do is; //Hao = Ta.*Oao; //Haf = Ta.*Oaf; //b' = (b^T * (inv(I - Haf) * Hao))/n //Since we can't compute the inverse of arbitrarily large matrices, we have to approximate this //by cutting off the respective power series (I + Haf + Haf^2 + Haf^3 + ...) at some point. //Since Ta, Oao, Oaf are defined over (s,s') and we want to avoid having to transpose, //we have to left-multiply this by b^T to get the update //We also cannot rely on determinant / trace, so we have to keep track of b' and see if it is converging. matrix* Haf = new matrix(element_prod(*Ta,*Oaf)); for(int safety_s=0, safety_h=0; epsilon >= JointBeliefEventDriven_convergenceTh && safety_h < JointBeliefEventDriven_hardCap; safety_h++) { noalias(H) = prod(*Haf, H); //remember that we are implicitly using transposes. res = prod(b,H); bUpdated = bUpdated + res; last_epsilon = epsilon; if(sum(bUpdated) > 0) epsilon = sum(res); if(last_epsilon != 0 && epsilon >= last_epsilon){ safety_s++; }else{ safety_s=0; } if(safety_s >= JointBeliefEventDriven_softCap){ cout << "Warning: Event-driven belief update not converging! - The system has non-observable chains." << endl; break; } } delete Haf; } //only the normalization factor remains eta = sum(bUpdated); if(eta > 0) { bUpdated = bUpdated / eta; _m_b.clear(); _m_b.insert(_m_b.end(), bUpdated.begin(), bUpdated.end()); } else { cout << "Event-driven belief update failed: The system is badly conditioned. There is 0 probability of observing this symbol given this belief." << endl; } delete Hao; } #if JointBeliefEventDriven_doSanityCheckAfterEveryUpdate if(!SanityCheck()) throw(E("JointBeliefEventDriven::Update SanityCheck failed")); #endif return(eta); } madp-0.4/src/support/PaxHeaders.5405/ProblemFireFightingGraph.h0000644000000000000000000000013212717644275021313 xustar0030 mtime=1463765181.301710574 30 atime=1463765181.301710574 30 ctime=1463765201.637548157 madp-0.4/src/support/ProblemFireFightingGraph.h0000664000372100037210000000436312717644275022155 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _PROBLEMFIREFIGHTINGGRAPH_H_ #define _PROBLEMFIREFIGHTINGGRAPH_H_ 1 /* the include directives */ #include "Globals.h" #include "ProblemFireFightingFactored.h" /** \brief ProblemFireFightingGraph is an implementation of the * FactoredFireFighting problem introduced in (Oliehoek, Spaan, * Whiteson, Vlassis, AAMAS 2008). */ class ProblemFireFightingGraph : public ProblemFireFightingFactored { private: protected: ///used to set the problem name for output files, etc. (in ProblemFireFightingFactored.cpp) virtual std::string SoftPrintBriefDescription() const; virtual std::string SoftPrintDescription() const; ///Construct all the Actions and actionSets (the vector _m_actionVecs). void ConstructActions(); size_t GetAgentLocation(Index action, Index agI) const; virtual size_t GetNrAgentsAtHouse(const std::vector< Index>& As, Index hI) const; virtual Scope GetHousesAgentInfluences(Index agI) const; //overide scope functions virtual void SetYScopes(); virtual void SetOScopes(); public: // Constructor, destructor and copy assignment. /// (default) Constructor ProblemFireFightingGraph(size_t nrAgents, size_t nrFireLevels, double multipleAgentExtinguishProb=1.0, bool initialize=true //<- if FFG is the most derived class, it is in charge of 'initializing' ); /// Destructor. virtual ~ProblemFireFightingGraph(){}; }; #endif /* !_PROBLEMFIREFIGHTINGGRAPH_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/BeliefSparse.cpp0000644000000000000000000000013212717644275017342 xustar0030 mtime=1463765181.417709648 30 atime=1463765181.413709681 30 ctime=1463765201.729547421 madp-0.4/src/support/BeliefSparse.cpp0000664000372100037210000001220412717644275020175 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "BeliefSparse.h" #include "BeliefIteratorSparse.h" #include "BeliefIteratorGeneric.h" #include #include "StateDistributionVector.h" #define BeliefSparse_CheckAndAbort 0 using namespace std; BeliefSparse::BeliefSparse() { } BeliefSparse::BeliefSparse(size_t size) { _m_b.resize(size,false); } BeliefSparse::BeliefSparse(const vector &belief) { _m_b.resize(belief.size(),false); unsigned int i=0; for(vector::const_iterator it=belief.begin(); it!=belief.end(); ++it) { if(*it>0) _m_b[i]=*it; ++i; } #if BeliefSparse_CheckAndAbort if(!SanityCheck()) abort(); #endif } BeliefSparse::BeliefSparse(const BeliefInterface &belief) { Set(belief); } BeliefSparse::BeliefSparse(const StateDistribution& belief) { this->Set(belief); } //Destructor BeliefSparse::~BeliefSparse() { } BeliefSparse& BeliefSparse::operator= (const BeliefSparse& o) { if (this == &o) return *this; // Gracefully handle self assignment // Put the normal assignment duties here... _m_b = o._m_b; return *this; } BeliefInterface& BeliefSparse::operator= (const BeliefInterface& o) { if (this == &o) return *this; // Gracefully handle self assignment const BeliefSparse& casted_o = dynamic_cast(o); return(operator=(casted_o));// call the operator= for BeliefSparse } void BeliefSparse::Set(const BS &belief) { _m_b=belief; #if BeliefSparse_CheckAndAbort if(!SanityCheck()) abort(); #endif } void BeliefSparse::Set(const vector &belief) { _m_b.resize(belief.size(),false); _m_b.clear(); unsigned int i=0; for(vector::const_iterator it=belief.begin(); it!=belief.end(); ++it) { if(*it>0) _m_b[i]=*it; ++i; } #if BeliefSparse_CheckAndAbort if(!SanityCheck()) abort(); #endif } void BeliefSparse::Set(const StateDistribution& belief) { _m_b.resize(belief.GetNrStates(),false); _m_b.clear(); for(unsigned int i=0;i!=belief.GetNrStates();++i) { double p=belief.GetProbability(i); if(p>0) _m_b[i]=p; } } void BeliefSparse::Set(const BeliefInterface &belief) { _m_b.resize(belief.Size(),false); _m_b.clear(); for(unsigned int i=0; i!=belief.Size(); ++i) { if(belief.Get(i)>0) _m_b[i]=belief.Get(i); } #if BeliefSparse_CheckAndAbort if(!SanityCheck()) abort(); #endif } void BeliefSparse::Clear() { _m_b.clear(); } string BeliefSparse::SoftPrint() const { #if BeliefSparse_CheckAndAbort if(!SanityCheck()) abort(); #endif stringstream ss; ss << "[" << _m_b.size() << "]< "; for(BScit it=_m_b.begin(); it!=_m_b.end(); ++it) ss << it.index() << ":" << *it << " "; ss << ">"; return(ss.str()); } bool BeliefSparse::SanityCheck() const { // check for negative and entries>1 double sum=0; for(BScit it=_m_b.begin(); it!=_m_b.end(); ++it) { if(*it<0) return(false); if(*it>1 + PROB_PRECISION) return(false); if(std::isnan(*it)) return(false); sum+=*it; } // check if sums to 1 if(abs(sum-1)>PROB_PRECISION) return(false); // check whether the size is not zero if(_m_b.size()==0) return(false); // if we haven't returned yet, the belief is fine return(true); } double BeliefSparse::InnerProduct(const vector &values) const { #if BeliefSparse_CheckAndAbort if(!SanityCheck()) abort(); #endif double x=0; for(BScit it=_m_b.begin(); it!=_m_b.end(); ++it) x+=(*it)*values[it.index()]; return(x); } vector BeliefSparse::InnerProduct(const VectorSet &v) const { vector values(v.size1()); double x; for(unsigned int k=0;k!=v.size1();++k) { x=0; for(BScit it=_m_b.begin(); it!=_m_b.end(); ++it) x+=(*it)*v(k,it.index()); values[k]=x; } return(values); } vector BeliefSparse::InnerProduct(const VectorSet &v, const vector &mask) const { vector values(v.size1(),-DBL_MAX); double x; for(unsigned int k=0;k!=v.size1();++k) { if(mask[k]) { x=0; for(BScit it=_m_b.begin(); it!=_m_b.end(); ++it) x+=(*it)*v(k,it.index()); values[k]=x; } } return(values); } BeliefIteratorGeneric BeliefSparse::GetIterator() const { return(BeliefIteratorGeneric(new BeliefIteratorSparse(this))); } madp-0.4/src/support/PaxHeaders.5405/ActionObservationHistory.cpp0000644000000000000000000000013212717644275022011 xustar0030 mtime=1463765181.401709776 30 atime=1463765181.401709776 30 ctime=1463765201.725547454 madp-0.4/src/support/ActionObservationHistory.cpp0000664000372100037210000000573212717644275022654 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "ActionObservationHistory.h" #include "Action.h" #include "Observation.h" #include "PlanningUnitMADPDiscrete.h" #include "ActionHistory.h" #include "ObservationHistoryTree.h" using namespace std; #define DEBUG_AOH 0 //Default constructor ActionObservationHistory::ActionObservationHistory(PlanningUnitMADPDiscrete& pu, Index agentI) : IndividualHistory(agentI), _m_planningUnitMADPDiscrete(&pu) { SetLength(0); _m_pred = 0; _m_ahI = 0; //HARDCODED _m_ohI = 0; //HARDCODED } ActionObservationHistory::ActionObservationHistory(Index aI, Index oI,ActionObservationHistory* pred) : IndividualHistory(pred->_m_agentI), _m_planningUnitMADPDiscrete(pred->_m_planningUnitMADPDiscrete) { SetLength(pred->GetLength() + 1); _m_pred = pred; _m_ahI = CastLIndexToIndex(_m_planningUnitMADPDiscrete->GetActionHistoryTree(_m_agentI, pred->_m_ahI) //=aht ->GetSuccessor(aI) //=aht' ->GetIndex()); //=ahI' _m_ohI = CastLIndexToIndex(_m_planningUnitMADPDiscrete->GetObservationHistoryTree(_m_agentI, pred->_m_ohI) //=oht ->GetSuccessor(oI) //=oht' ->GetIndex()); //=ohI' } string ActionObservationHistory::SoftPrint() const { stringstream ss; if(_m_pred != 0) { if(_m_length >= 1) ss << _m_pred->SoftPrint(); else { ss << "ObservationHistory:Print() - Warning:_m_pred != "<< "null, but lenght < 1 !"<GetActionHistoryTree( _m_agentI, _m_ahI) //=aht ->GetContainedElement(); //=ah if (!ah->IsEmpty()) // don't print the empty observation { ss << ", "; Index aI = ah->GetLastActionIndex(); // aI ss << _m_planningUnitMADPDiscrete->GetAction(_m_agentI, aI)->SoftPrintBrief(); } else ss << "EMPTY_AH"; ss << ", "; ObservationHistory* oh = _m_planningUnitMADPDiscrete->GetObservationHistoryTree( _m_agentI, _m_ohI) //=oht ->GetContainedElement(); //=oh if (!oh->ContainsEmptyOI()) // don't print the empty observation { ss << ", "; Index oI = oh->GetLastObservationIndex(); // oI ss << _m_planningUnitMADPDiscrete->GetObservation(_m_agentI, oI)->SoftPrintBrief(); } else ss << "Oempty"; return(ss.str()); } madp-0.4/src/support/PaxHeaders.5405/JointPolicyDiscretePure.cpp0000644000000000000000000000013212717644275021560 xustar0030 mtime=1463765181.573708403 30 atime=1463765181.573708403 30 ctime=1463765201.697547676 madp-0.4/src/support/JointPolicyDiscretePure.cpp0000664000372100037210000000433712717644275022423 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "JointPolicyDiscretePure.h" using namespace std; //Default constructor JointPolicyDiscretePure::JointPolicyDiscretePure( const Interface_ProblemToPolicyDiscretePure* pu, PolicyGlobals::PolicyDomainCategory idc ) : JointPolicyDiscrete( pu , idc ) { } JointPolicyDiscretePure::JointPolicyDiscretePure( const I_PtPDpure_constPtr &pu, PolicyGlobals::PolicyDomainCategory idc ) : JointPolicyDiscrete( pu , idc ) { } //Copy constructor. JointPolicyDiscretePure::JointPolicyDiscretePure(const JointPolicyDiscretePure& o) : JointPolicyDiscrete( o ) { } //Destructor //JointPolicyDiscretePure::~JointPolicyDiscretePure() //{ //} //Copy assignment operator JointPolicyDiscretePure& JointPolicyDiscretePure::operator= (const JointPolicyDiscretePure& o) { #if DEBUG_JPOLASSIGN cerr << "JointPolicyDiscretePure::operator=(const JointPolicyDiscretePure& jp) called"< #include "Globals.h" #include "BeliefInterface.h" #include "boost/numeric/ublas/vector_sparse.hpp" #include "boost/numeric/ublas/io.hpp" class BeliefIteratorSparse; class StateDistribution; /// BeliefSparse represents a probability distribution over the state space. /** It is stored as a sparse vector. */ class BeliefSparse : virtual public BeliefInterface { private: friend class BeliefIteratorSparse; protected: #if BOOST_1_32_OR_LOWER // they renamed sparse_vector to mapped_vector typedef boost::numeric::ublas::sparse_vector BS; #else typedef boost::numeric::ublas::compressed_vector BS; #endif typedef BS::const_iterator BScit; typedef BS::iterator BSit; /// The sparse vector to store the belief. BS _m_b; public: /// Default Constructor BeliefSparse(); /// Constructor which sets the \a size of the joint belief. BeliefSparse(size_t size); /// Constructor which copies \a belief in this joint belief. BeliefSparse(const std::vector &belief); /// Constructor which copies \a belief in this joint belief. BeliefSparse(const BeliefInterface &belief); BeliefSparse(const StateDistribution& belief); /// Destructor. ~BeliefSparse(); // operators: BeliefSparse& operator= (const BeliefSparse& o); BeliefInterface& operator= (const BeliefInterface& o); #if BOOST_1_32_OR_LOWER // uses sparse_vector instead of mapped_vector. The former, however, does // not define .ref() double& operator[] (Index& i) { return //_m_b(i); //_m_b.BS::operator[](i); *_m_b.find_element(i); } double& operator[] (int& i) { return //_m_b(i); //_m_b.BS::operator()(i); *_m_b.find_element(i); } #else double& operator[] (Index& i) { return _m_b.ref(i); //_m_b.BS::operator[](i); } double& operator[] (int& i) { return _m_b.ref(i); //_m_b.BS::operator[](i); } #endif //data manipulation (set) functions: void Set(const BS &belief); void Set(const std::vector &belief); void Set(Index sI, double prob) { _m_b[sI]=prob; } void Set(const BeliefInterface &belief); virtual void Set(const StateDistribution& belief); //get (data) functions: double Get(Index sI) const { return(_m_b[sI]); }; std::vector Get() const { throw E("BeliefSparse::Get() is not yet implemented"); }; void Clear(); std::string SoftPrint() const; void Print() const { std::cout << SoftPrint(); } unsigned int Size() const { return(_m_b.size()); } unsigned int NumberNonZeros() const { return(_m_b.nnz()); } bool SanityCheck() const; double InnerProduct(const std::vector &values) const; std::vector InnerProduct(const VectorSet &v) const; std::vector InnerProduct(const VectorSet &v, const std::vector &mask) const; BeliefIteratorGeneric GetIterator() const; /// Returns a pointer to a copy of this class. virtual BeliefSparse* Clone() const { return new BeliefSparse(*this); } }; #endif /* !_BELIEFSPARSE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/JointObservationHistory.h0000644000000000000000000000013212717644275021324 xustar0030 mtime=1463765181.325710382 30 atime=1463765181.325710382 30 ctime=1463765201.641548124 madp-0.4/src/support/JointObservationHistory.h0000664000372100037210000000750512717644275022167 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _JOINTOBSERVATIONHISTORY_H_ #define _JOINTOBSERVATIONHISTORY_H_ 1 /* the include directives */ #include #include #include "Globals.h" #include "E.h" #include "JointHistory.h" class PlanningUnitMADPDiscrete; //forward declaration to avoid including each other /// JointObservationHistory represents a joint observation history. /** * This consists of a joint observation history index, the last joint * observation (index) a pointer to the predecessor JOH. and a vector * of indexes to the individual observation histories. */ class JointObservationHistory : public JointHistory { private: ///The last joint observation (index). Index _m_jointObservationI; /**True if the last joint observation (index) is empty (i.e., there is * no last joint observation.) This is particularly true for a * observation history at time step t=0 in a MADP that does not issue * an initial observation. (this behavior is defined in * MADPComponentDiscreteObservations)*/ bool _m_containsEmptyJOI; /**The predecessor joint belief. Together with the last joint * observation(_m_jointObservationI) this gives a full description of * this joint observation history.*/ JointObservationHistory* _m_pred; /**A vector of ints which are the indices of individual * ObservationHistories this gives an alternate description of the * current JointObservation History. */ std::vector _m_individualObservationHistories; ///ref to the pu PlanningUnitMADPDiscrete* _m_planningUnitMADPDiscrete; protected: public: // Constructor, destructor and copy assignment. /**Constructor - creates a new initial (=empty) JointObservationHistory. * This method relies on the fact that the empty individual * observation histories are indexed 0. */ JointObservationHistory(PlanningUnitMADPDiscrete& pu); /**Creates a observation history specifying jObsI for the last joint * observation and pred as the preceeding JointObservationHistory.*/ JointObservationHistory(Index jObsI, JointObservationHistory * pred); /// Copy constructor. JointObservationHistory(const JointObservationHistory& a); /// Destructor. ~JointObservationHistory(); //operators: //data manipulation (set) functions: //get (data) functions: ///Returns the indices of the indiv. observation histories. const std::vector& GetIndividualObservationHistoryIndices() const; ///Returns the index of the last received joint observation. Index GetJointObservationIndex() const {return(_m_jointObservationI);} //other /// Returns a pointer to a copy of this class. virtual JointObservationHistory* Clone() const { return new JointObservationHistory(*this); } ///SoftPrints the joint observation history. std::string SoftPrint() const; ///Prints the joint observation history. void Print() const {std::cout << SoftPrint(); } }; #endif /* !_OBSERVATIONHISTORY_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/JointObservationHistory.cpp0000644000000000000000000000013212717644275021657 xustar0030 mtime=1463765181.561708498 30 atime=1463765181.557708529 30 ctime=1463765201.721547484 madp-0.4/src/support/JointObservationHistory.cpp0000664000372100037210000000714212717644275022517 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "JointObservationHistory.h" #include "JointObservation.h" //Necessary as header file contains a forward declaration: #include "PlanningUnitMADPDiscrete.h" #include "ObservationHistoryTree.h" using namespace std; #define DEBUG_JOH 0 //Default constructor JointObservationHistory::JointObservationHistory(PlanningUnitMADPDiscrete& pu) : _m_planningUnitMADPDiscrete(&pu) { SetLength(0); _m_jointObservationI = 0; _m_containsEmptyJOI = true; _m_pred = 0; size_t nrAgents = pu.GetNrAgents(); _m_individualObservationHistories = vector(nrAgents,0); } /*Creates a observation history specifying jObsI for the last joint * observation and pred as the preceeding JointObservationHistory.*/ JointObservationHistory::JointObservationHistory(Index joI, JointObservationHistory* pred) : _m_planningUnitMADPDiscrete(pred->_m_planningUnitMADPDiscrete) { SetLength(pred->GetLength() + 1); _m_jointObservationI = joI; _m_containsEmptyJOI = false; _m_pred = pred; size_t nrAgents = pred->_m_individualObservationHistories.size(); const vector& indivOIndices = _m_planningUnitMADPDiscrete-> JointToIndividualObservationIndices(joI); //we also maintain the indices of the individual observation histories //represented by this joint observation history for(Index aI=0; aI < nrAgents; aI++) { //get the individual observation history for the predecessor Index predOHindex_ai = pred->_m_individualObservationHistories[aI]; ObservationHistoryTree* oht_ai = _m_planningUnitMADPDiscrete-> GetObservationHistoryTree(aI, predOHindex_ai); Index ai_last_observation = indivOIndices[aI]; Index sucOHindex_ai = CastLIndexToIndex(oht_ai->GetSuccessor(ai_last_observation)-> GetIndex()); _m_individualObservationHistories.push_back(sucOHindex_ai); } } //Copy assignment constructor. JointObservationHistory::JointObservationHistory(const JointObservationHistory& o) { if(DEBUG_JOH){ cout << "Cloning JointObservationHistory: "; Print(); cout <& JointObservationHistory::GetIndividualObservationHistoryIndices() const { return(_m_individualObservationHistories); } string JointObservationHistory::SoftPrint() const { stringstream ss; if(_m_pred != 0) { if(_m_length >= 1) ss << _m_pred->SoftPrint(); else { ss << "JointObservationHistory:Print() - Warning:_m_pred != "<< "null, but lenght <= 1 !"<GetJointObservation( _m_jointObservationI)->SoftPrintBrief() << ", "; } else ss << "JOnull, "; return(ss.str()); } madp-0.4/src/support/PaxHeaders.5405/PolicyDiscretePure.cpp0000644000000000000000000000013212717644275020554 xustar0030 mtime=1463765181.553708562 30 atime=1463765181.553708562 30 ctime=1463765201.697547676 madp-0.4/src/support/PolicyDiscretePure.cpp0000664000372100037210000000240412717644275021410 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "PolicyDiscretePure.h" //Default constructor PolicyDiscretePure::PolicyDiscretePure( const Interface_ProblemToPolicyDiscretePure* pu, PolicyGlobals::PolicyDomainCategory idc, Index agentI ) : PolicyDiscrete( pu , idc, agentI ) { } PolicyDiscretePure::PolicyDiscretePure( const I_PtPD_constPtr &pu, PolicyGlobals::PolicyDomainCategory idc, Index agentI ) : PolicyDiscrete( pu , idc, agentI ) { } //Copy constructor. PolicyDiscretePure::PolicyDiscretePure(const PolicyDiscretePure& o) : PolicyDiscrete( o ) { } double PolicyDiscretePure::GetActionProb(Index i, Index aI ) const { if(GetActionIndex(i) == aI) return(1.0); return(0.0); } madp-0.4/src/support/PaxHeaders.5405/NullPlannerTOI.cpp0000644000000000000000000000013212717644275017604 xustar0030 mtime=1463765181.481709137 30 atime=1463765181.481709137 30 ctime=1463765201.741547326 madp-0.4/src/support/NullPlannerTOI.cpp0000664000372100037210000000316212717644275020442 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "NullPlannerTOI.h" NullPlannerTOI::NullPlannerTOI(TOIDecPOMDPDiscrete* p) { PlanningUnitMADPDiscreteParameters params; params.SetComputeAll(false); SetParams(params); SetProblem(p); } NullPlannerTOI::NullPlannerTOI(size_t horizon, TOIDecPOMDPDiscrete* p) { PlanningUnitMADPDiscreteParameters params; params.SetComputeAll(false); SetParams(params); SetProblem(p); SetHorizon(horizon); } NullPlannerTOI::NullPlannerTOI(const PlanningUnitMADPDiscreteParameters ¶ms, size_t horizon, TOIDecPOMDPDiscrete* p) : PlanningUnitTOIDecPOMDPDiscrete(params,horizon,p) { } void NullPlannerTOI::Plan() { throw(E("NullPlannerTOI::Plan() should not be called")); } double NullPlannerTOI::GetExpectedReward() const { throw(E("NullPlannerTOI::GetExpectedReward() should not be called")); return(0); } boost::shared_ptr NullPlannerTOI::GetJointPolicy() { throw(E("NullPlannerTOI::GetJointPolicy() should not be called")); return(boost::shared_ptr()); } madp-0.4/src/support/PaxHeaders.5405/BeliefIteratorSparse.h0000644000000000000000000000013212717644275020521 xustar0030 mtime=1463765181.561708498 30 atime=1463765181.561708498 30 ctime=1463765201.673547868 madp-0.4/src/support/BeliefIteratorSparse.h0000664000372100037210000000553012717644275021360 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _BELIEFITERATORSPARSE_H_ #define _BELIEFITERATORSPARSE_H_ 1 /* the include directives */ #include "Globals.h" #include "BeliefIteratorInterface.h" #include "BeliefSparse.h" #define BeliefIteratorSparse_UseCIT 1 /** \brief BeliefIteratorSparse is an iterator for sparse beliefs. */ class BeliefIteratorSparse : public BeliefIteratorInterface { private: #if BeliefIteratorSparse_UseCIT BeliefSparse::BScit _m_it; #else Index _m_i; #endif const BeliefSparse *_m_belief; protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor #if BeliefIteratorSparse_UseCIT BeliefIteratorSparse(const BeliefSparse *b) : _m_belief(b) { _m_it=_m_belief->_m_b.begin(); if(_m_belief->Size()==0) throw(E("BeliefIteratorSparse ctor: belief has size 0")); if(_m_belief->NumberNonZeros()==0) throw(E("BeliefIteratorSparse ctor: belief is empty")); } #else BeliefIteratorSparse(const BeliefSparse *b) : _m_i(0), _m_belief(b) { if(_m_belief->_m_b.nnz()==0) throw(E("BeliefIteratorSparse ctor: belief is empty")); } #endif /// Destructor. virtual ~BeliefIteratorSparse(){} #if BeliefIteratorSparse_UseCIT double GetProbability() const { return(*_m_it); } Index GetStateIndex() const { return(_m_it.index()); } bool Next() { _m_it++; if(_m_it==_m_belief->_m_b.end()) return(false); else return(true); } #else double GetProbability() const { return(_m_belief-> _m_b.value_data()[_m_i]); } Index GetStateIndex() const { return(_m_belief-> _m_b.index_data()[_m_i]); } bool Next() { if(_m_i>=(_m_belief->_m_b.nnz()-1)) return(false); else { _m_i++; return(true); } } #endif /// Returns a pointer to a copy of this class. virtual BeliefIteratorSparse* Clone() const { return new BeliefIteratorSparse(*this); } }; #endif /* !_BELIEFITERATORSPARSE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/Makefile.am0000644000000000000000000000007312717644140016321 xustar0029 atime=1463765193.18961563 30 ctime=1463765201.609548379 madp-0.4/src/support/Makefile.am0000664000372100037210000000650312717644140017155 0ustar00fransfrans00000000000000include $(top_srcdir)/src/Makefile.custom include $(top_srcdir)/config/Make-rules ############## # Includedirs, libdirs, libs and cflags for all programs INCLUDEPATH = -I$(top_srcdir)/src/base\ -I$(top_srcdir)/src/include -I$(top_srcdir)/src/support \ $(MADP_INCLUDES) AM_LDFLAGS = LDADD = AM_CPPFLAGS = -Wall -pipe $(MARCH_FLAGS) $(INCLUDEPATH) if DARWIN AM_CPPFLAGS += -DDARWIN endif AM_CXXFLAGS = $(CSTANDARD) HISTORY_CPPFILES= ObservationHistory.cpp ObservationHistoryTree.cpp\ JointObservationHistory.cpp \ ActionHistory.cpp JointActionHistory.cpp\ JointActionObservationHistory.cpp JointActionObservationHistoryTree.cpp\ ActionObservationHistory.cpp ActionObservationHistoryTree.cpp HISTORY_HFILES=$(HISTORY_CPPFILES:.cpp=.h) TreeNode.h ActionHistoryTree.h\ JointActionHistoryTree.h History.h IndividualHistory.h JointHistory.h\ JointObservationHistoryTree.h POLICY_CPPFILES= \ PolicyDiscrete.cpp PolicyDiscretePure.cpp PolicyPureVector.cpp \ JointPolicyDiscrete.cpp JointPolicyDiscretePure.cpp\ PartialJointPolicy.cpp \ PartialJointPolicyDiscretePure.cpp \ PartialJointPolicyPureVector.cpp \ JointPolicyPureVector.cpp \ JPolComponent_VectorImplementation.cpp POLICY_HFILES=$(POLICY_CPPFILES:.cpp=.h) Interface_ProblemToPolicyDiscrete.h \ Interface_ProblemToPolicyDiscretePure.h Policy.h \ JointPolicy.h PolicyGlobals.h PROBLEM_CPPFILES= \ ProblemType.cpp\ ProblemDecTiger.cpp\ ProblemDecTigerWithCreaks.cpp\ ProblemFireFighting.cpp\ ProblemFireFightingFactored.cpp\ ProblemFireFightingGraph.cpp\ ProblemFOBSFireFightingFactored.cpp\ ProblemFOBSFireFightingGraph.cpp\ ProblemAloha.cpp PROBLEM_HFILES=$(PROBLEM_CPPFILES:.cpp=.h) BELIEF_CPPFILES=Belief.cpp JointBelief.cpp JointBeliefEventDriven.cpp\ BeliefSparse.cpp JointBeliefSparse.cpp \ FactoredStateAOHDistribution.cpp\ IndividualBeliefJESP.cpp\ FSAOHDist_NECOF.cpp BELIEF_HFILES=$(BELIEF_CPPFILES:.cpp=.h)\ JointBeliefInterface.h BeliefInterface.h BeliefIteratorInterface.h\ BeliefIterator.h BeliefIteratorSparse.h BeliefIteratorGeneric.h PLANNINGUNIT_CPPFILES=\ PlanningUnit.h \ PlanningUnitMADPDiscrete.cpp\ PlanningUnitDecPOMDPDiscrete.cpp PlanningUnitMADPDiscreteParameters.cpp\ PlanningUnitFactoredDecPOMDPDiscrete.cpp\ PlanningUnitTOIDecPOMDPDiscrete.cpp \ NullPlanner.cpp NullPlannerTOI.cpp NullPlannerFactored.cpp PLANNINGUNIT_HFILES=$(PLANNINGUNIT_CPPFILES:.cpp=.h) MISC_CPPFILES= Timing.cpp TimedAlgorithm.cpp \ FixedCapacityPriorityQueue.cpp \ MADPDiscreteStatistics.cpp\ QTable.cpp MISC_HFILES=$(MISC_CPPFILES:.cpp=.h) VectorSet.h SUPPORT_FILES=$(POLICY_CPPFILES) $(POLICY_HFILES) \ $(PROBLEM_CPPFILES) $(PROBLEM_HFILES)\ $(HISTORY_CPPFILES) $(HISTORY_HFILES) \ $(BELIEF_CPPFILES) $(BELIEF_HFILES)\ $(PLANNINGUNIT_CPPFILES) $(PLANNINGUNIT_HFILES)\ $(MISC_CPPFILES) $(MISC_HFILES) ############### # All DYNAMIC libraries # the LTLIBRARIES (LibTool-libraries) # the library to be build... lib_LTLIBRARIES = noinst_LTLIBRARIES = libMADPSupport.la # sources for the library: libMADPSupport_la_SOURCES = $(SUPPORT_FILES) libMADPSupport_la_CPPFLAGS = $(AM_CPPFLAGS) $(CPP_OPTIMIZATION_FLAGS) libMADPSupport_la_LDFLAGS = $(AM_LDFLAGS) # for installing the headers libMADPSupport_ladir = $(pkgincludedir)#/support libMADPSupport_la_HEADERS = $(POLICY_HFILES) $(PROBLEM_HFILES)\ $(HISTORY_HFILES) $(BELIEF_HFILES) $(PLANNINGUNIT_HFILES) $(MISC_HFILES) madp-0.4/src/support/PaxHeaders.5405/NullPlannerTOI.h0000644000000000000000000000013212717644275017251 xustar0030 mtime=1463765181.405709744 30 atime=1463765181.405709744 30 ctime=1463765201.685547772 madp-0.4/src/support/NullPlannerTOI.h0000664000372100037210000000314312717644275020106 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _NULLPLANNERTOI_H_ #define _NULLPLANNERTOI_H_ 1 /* the include directives */ #include #include "Globals.h" #include "PlanningUnitTOIDecPOMDPDiscrete.h" /** \brief NullPlannerTOI represents a planner which does nothing, but * can be used to instantiate a PlanningUnitTOIDecPOMDPDiscrete. */ class NullPlannerTOI : public PlanningUnitTOIDecPOMDPDiscrete { private: protected: public: /// (default) Constructor NullPlannerTOI(TOIDecPOMDPDiscrete* p); NullPlannerTOI(size_t horizon, TOIDecPOMDPDiscrete* p); NullPlannerTOI(const PlanningUnitMADPDiscreteParameters ¶ms, size_t horizon, TOIDecPOMDPDiscrete* p); ~NullPlannerTOI(){}; /// Only present to satisfy the interface. void Plan(); /// Only present to satisfy the interface. double GetExpectedReward() const; /// Only present to satisfy the interface. boost::shared_ptr GetJointPolicy(); }; #endif /* !_NULLPLANNERTOI_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/JointActionHistory.h0000644000000000000000000000013212717644275020246 xustar0030 mtime=1463765181.557708529 30 atime=1463765181.557708529 30 ctime=1463765201.645548092 madp-0.4/src/support/JointActionHistory.h0000664000372100037210000000705212717644275021106 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _JOINTACTIONHISTORY_H_ #define _JOINTACTIONHISTORY_H_ 1 /* the include directives */ #include #include #include "Globals.h" #include "TreeNode.h" #include "JointHistory.h" //#include "PlanningUnitMADPDiscrete.h" class PlanningUnitMADPDiscrete; //forward declaration to avoid including each other /// JointActionHistory represents a joint action history. /** * This consists of a joint action history index, the last joint * action (index) a pointer to the predecessor JOH. and a vector of * indexes to the individual action histories. */ class JointActionHistory : public JointHistory { private: ///The last joint action (index). Index _m_jointActionI; /**True if the last joint action (index) is empty (i.e., there is * no last joint action.) This is true for a action history at * time step 0. */ bool _m_isEmpty; /**The predecessor joint belief. Together with the last joint * action(_m_jointActionI) this gives a full description of * this joint action history.*/ JointActionHistory* _m_pred; /**A vector of ints which are the indices of individual * ActionHistories this gives an alternate description of the * current JointAction History. */ std::vector _m_individualActionHistories; PlanningUnitMADPDiscrete* _m_planningUnitMADPDiscrete; protected: public: // Constructor, destructor and copy assignment. /**Constructor - creates a new initial (=empty) JointActionHistory. * This method relies on the fact that the empty individual * action histories are indexed 0. */ JointActionHistory(PlanningUnitMADPDiscrete& pu); /**Creates a initial action history specifying obsI as the * action at time step t=0 (o^t=0) */ JointActionHistory(PlanningUnitMADPDiscrete& pu, Index jObsI); /**Creates a action history specifying jObsI for the last joint * action and pred as the preceeding JointActionHistory.*/ JointActionHistory(Index jObsI, JointActionHistory * pred); /// Copy constructor. JointActionHistory(const JointActionHistory& a); /// Destructor. ~JointActionHistory(); //operators: //data manipulation (set) functions: //get (data) functions: ///Returns the indices of the indiv. action histories. const std::vector& GetIndividualActionHistoryIndices() const; //other /// Returns a pointer to a copy of this class. virtual JointActionHistory* Clone() const { return new JointActionHistory(*this); } ///SoftPrints the joint observation history. std::string SoftPrint() const; ///Prints the joint observation history. void Print() const { std::cout << SoftPrint(); } }; #endif /* !_JOINTACTIONHISTORY_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/JointBeliefSparse.cpp0000644000000000000000000000013212717644275020346 xustar0030 mtime=1463765181.305710543 30 atime=1463765181.305710543 30 ctime=1463765201.733547389 madp-0.4/src/support/JointBeliefSparse.cpp0000664000372100037210000001440612717644275021207 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "JointBeliefSparse.h" #include "TransitionModelDiscrete.h" #include "ObservationModelDiscrete.h" #include "TGet.h" #include using namespace std; //Necessary as header file contains a forward declaration: #include "MultiAgentDecisionProcessDiscreteInterface.h" #define JointBeliefSparse_doSanityCheckAfterEveryUpdate 0 JointBeliefSparse::JointBeliefSparse() { } JointBeliefSparse::JointBeliefSparse(size_t size) : BeliefSparse(size) { } JointBeliefSparse::JointBeliefSparse(const vector &belief) : BeliefSparse(belief) { } JointBeliefSparse::JointBeliefSparse(const JointBeliefInterface &belief) : BeliefSparse(belief) { } JointBeliefSparse::JointBeliefSparse(const StateDistribution& belief) : BeliefSparse(belief) { } //Destructor JointBeliefSparse::~JointBeliefSparse() { } JointBeliefSparse& JointBeliefSparse::operator= (const JointBeliefSparse& o) { if (this == &o) return *this; // Gracefully handle self assignment // Put the normal assignment duties here... BeliefSparse::operator=(o); return *this; } JointBeliefInterface& JointBeliefSparse::operator= (const JointBeliefInterface& o) { if (this == &o) return *this; // Gracefully handle self assignment const JointBeliefSparse& casted_o = dynamic_cast(o); return(operator=(casted_o));// call the operator= for JointBeliefSparse } double JointBeliefSparse::Update(const MultiAgentDecisionProcessDiscreteInterface &pu, Index lastJAI, Index newJOI) { //const TransitionModelDiscrete* T=pu.GetTransitionModelDiscretePtr(); const ObservationModelDiscrete* O=pu.GetObservationModelDiscretePtr(); //pointer to the transition probability Get funtion: TGet* T = pu.GetTGet(); if(T==0) { return(UpdateSlow(pu,lastJAI,newJOI)); } double Po_ba = 0.0; // P(o|b,a) with o=newJO double Ps_ba, Po_as, Pso_ba; size_t nrS = _m_b.size(); BS newJB_unnorm(nrS); bool isEventDriven = pu.GetEventObservability(); for(Index sI=0; sI < nrS; sI++) { Pso_ba = 0; if(!isEventDriven) { //P(sI | b, a) = sum_(prec_s) P(sI | prec_s, a)*JB(prec_s) Ps_ba = 0.0; for(BScit it=_m_b.begin(); it!=_m_b.end(); ++it) Ps_ba += T->Get(it.index(), lastJAI, sI) * *it; if(Ps_ba>0) // if it is zero, Pso_ba will be zero anyway { //P(newJOI | lastJAI, sI) : Po_as = O->Get(lastJAI, sI, newJOI); //the new (unormalized) belief P(s,o|b,a) Pso_ba = Po_as * Ps_ba; } } else { for(BScit it=_m_b.begin(); it!=_m_b.end(); ++it) //P(sI, newJOI | b, a) = sum_(prec_s) P(newJOI | prec_sI, lastJAI, sI)*P(sI | prec_s, a)* JB(prec_s) Pso_ba += O->Get(it.index(), lastJAI, sI, newJOI) * T->Get(it.index(), lastJAI, sI) * *it; } if(Pso_ba>PROB_PRECISION) // we don't want to store very // small probabilities in a // sparse representation { newJB_unnorm[sI]=Pso_ba; //unnormalized new belief Po_ba += Pso_ba; //running sum of P(o|b,a) } } //normalize: if(Po_ba>0) for(BSit it=newJB_unnorm.begin(); it!=newJB_unnorm.end(); ++it) *it/=Po_ba; _m_b=newJB_unnorm; #if JointBeliefSparse_doSanityCheckAfterEveryUpdate if(!SanityCheck()) throw(E("JointBeliefSparse::Update SanityCheck failed")); #endif return(Po_ba); } /** Almost literal copy of Update(). */ double JointBeliefSparse::UpdateSlow(const MultiAgentDecisionProcessDiscreteInterface &pu, Index lastJAI, Index newJOI) { double Po_ba = 0.0; // P(o|b,a) with o=newJO double Ps_ba, Po_as, Pso_ba; size_t nrS = _m_b.size(); BS newJB_unnorm(nrS); bool isEventDriven = pu.GetEventObservability(); for(Index sI=0; sI < nrS; sI++) { Pso_ba = 0; if(!isEventDriven) { //P(sI | b, a) = sum_(prec_s) P(sI | prec_s, a)*JB(prec_s) Ps_ba = 0.0; for(BScit it=_m_b.begin(); it!=_m_b.end(); ++it) Ps_ba += pu.GetTransitionProbability(it.index(), lastJAI, sI) * *it; if(Ps_ba>0) // if it is zero, Pso_ba will be zero anyway { //P(newJOI | lastJAI, sI) : Po_as = pu.GetObservationProbability(lastJAI, sI, newJOI); //the new (unormalized) belief P(s,o|b,a) Pso_ba = Po_as * Ps_ba; } } else { for(BScit it=_m_b.begin(); it!=_m_b.end(); ++it) //P(sI, newJOI | b, a) = sum_(prec_s) P(newJOI | prec_sI, lastJAI, sI)*P(sI | prec_s, a)* JB(prec_s) Pso_ba += pu.GetObservationProbability(it.index(), lastJAI, sI, newJOI) * pu.GetTransitionProbability(it.index(), lastJAI, sI) * *it; } if(Pso_ba>PROB_PRECISION) // we don't want to store very // small probabilities in a // sparse representation { newJB_unnorm[sI]=Pso_ba; //unnormalized new belief Po_ba += Pso_ba; //running sum of P(o|b,a) } } //normalize: if(Po_ba>0) for(BSit it=newJB_unnorm.begin(); it!=newJB_unnorm.end(); ++it) *it/=Po_ba; _m_b=newJB_unnorm; #if JointBeliefSparse_doSanityCheckAfterEveryUpdate if(!SanityCheck()) throw(E("JointBeliefSparse::UpdateSlow SanityCheck failed")); #endif return(Po_ba); } madp-0.4/src/support/PaxHeaders.5405/PartialJointPolicyPureVector.h0000644000000000000000000000013212717644275022242 xustar0030 mtime=1463765181.549708594 30 atime=1463765181.549708594 30 ctime=1463765201.621548283 madp-0.4/src/support/PartialJointPolicyPureVector.h0000664000372100037210000001444412717644275023105 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _PARTIALJOINTPOLICYPUREVECTOR_H_ #define _PARTIALJOINTPOLICYPUREVECTOR_H_ 1 /* the include directives */ #include "Globals.h" #include "JPolComponent_VectorImplementation.h" #include "PartialJointPolicyDiscretePure.h" #include "boost/shared_ptr.hpp" class PartialJointPolicyPureVector; typedef boost::shared_ptr PJPPV_sharedPtr; /** \brief PartialJointPolicyPureVector implements a * PartialJointPolicy using a mapping of history indices to * actions. */ class PartialJointPolicyPureVector : // public JointPolicyPureVector , //<- don't use mutliple inheritance for code reuse.. public PartialJointPolicyDiscretePure, private JPolComponent_VectorImplementation // use private inheritance for composition { private: protected: public: // Constructor, destructor and copy assignment. PartialJointPolicyPureVector( const Interface_ProblemToPolicyDiscretePure * pu, PolicyGlobals::PolicyDomainCategory idc, double pastReward = 0.0, size_t depth = MAXHORIZON); PartialJointPolicyPureVector( const I_PtPDpure_constPtr &pu, PolicyGlobals::PolicyDomainCategory idc, double pastReward = 0.0, size_t depth = MAXHORIZON); /// Copy constructor. PartialJointPolicyPureVector(const PartialJointPolicyPureVector& a) : PartialJointPolicyDiscretePure(a) , JPolComponent_VectorImplementation(a) {}; PartialJointPolicyPureVector(const PartialJointPolicyDiscretePure& a) : PartialJointPolicyDiscretePure(a), JPolComponent_VectorImplementation( dynamic_cast( a ) ) {}; /// Destructor. virtual ~PartialJointPolicyPureVector() {}; /// Copy assignment operator virtual PartialJointPolicyPureVector& operator= (const PartialJointPolicyPureVector& o); virtual PartialJointPolicyPureVector& operator= (const PartialJointPolicyDiscretePure& o); bool operator< (const JointPolicy& o) const { const PartialJointPolicyPureVector& p = dynamic_cast(o); return (*this) < p; } bool operator< (const PartialJointPolicyPureVector& o) const { return (GetIndex() < o.GetIndex()) ; } /// Sets the depth of the joint policy. /** Also sets the depth of each of the invididual policies. */ void SetDepth(size_t d) { #if 0 if(d==MAXHORIZON) throw(E("PartialJointPolicyPureVector can only be used for finite horizons.")); #endif JointPolicy::SetDepth(d); JPolComponent_VectorImplementation::SetDepthForIndivPols(d); }; /// Prints a description of this JointPolicyPureVector to a string. virtual std::string SoftPrint() const; /// Prints a brief description to a string. virtual std::string SoftPrintBrief() const; void PrintBrief() const { std::cout << SoftPrintBrief();} /**\brief Convert this joint policy to a JointPolicyPureVector. */ virtual boost::shared_ptr ToJointPolicyPureVector() const; //relay the following functions to the JPolComponent_VectorImplementation: // bool operator++ () { return( this->Increment() ); }; bool Increment(Index agentI) { return this->JPolComponent_VectorImplementation::Increment(agentI); } bool Increment() { return this->JPolComponent_VectorImplementation::Increment(); } LIndex GetIndex() const { return this->JPolComponent_VectorImplementation::GetIndex(); } void SetIndex(LIndex i) { this->JPolComponent_VectorImplementation::SetIndex(i); } virtual Index GetJointActionIndex(Index i) const { return JPolComponent_VectorImplementation::GetJointActionIndex(i); } virtual Index GetJointActionIndex(LIndex i) const { return JPolComponent_VectorImplementation::GetJointActionIndex(i); } virtual Index GetActionIndex(Index agI , Index domainI) const { return JPolComponent_VectorImplementation::GetActionIndex(agI , domainI);} virtual PolicyDiscrete* GetIndividualPolicyDiscrete(Index i) const { return JPolComponent_VectorImplementation::GetIndividualPolicyDiscrete(i) ;} /// Returns a reference to the vector of pointers to individual policies /** This function should be used to manipulate individual policies. */ std::vector& GetIndividualPolicies() {return this->JPolComponent_VectorImplementation::GetIndividualPolicies();} virtual void ZeroInitialization() { JPolComponent_VectorImplementation::ZeroInitialization();} virtual void ZeroInitialization(Index i) { JPolComponent_VectorImplementation::ZeroInitialization(i);} virtual void RandomInitialization() { JPolComponent_VectorImplementation::RandomInitialization();} virtual void RandomInitialization(Index i) { JPolComponent_VectorImplementation::RandomInitialization(i);} virtual void SetAction(Index agentI, Index domainI, Index aI) { JPolComponent_VectorImplementation::SetAction(agentI, domainI, aI);} /// Returns a pointer to a copy of this class. virtual PartialJointPolicyPureVector* Clone() const { return new PartialJointPolicyPureVector(*this); } }; #endif /* !_PARTIALJOINTPOLICYPUREVECTOR_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/FSAOHDist_NECOF.cpp0000644000000000000000000000013212717644275017374 xustar0030 mtime=1463765181.573708403 30 atime=1463765181.565708466 30 ctime=1463765201.733547389 madp-0.4/src/support/FSAOHDist_NECOF.cpp0000664000372100037210000005114712717644275020240 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "FSAOHDist_NECOF.h" #include "FactoredStateDistribution.h" #include "PlanningUnitFactoredDecPOMDPDiscrete.h" #include "Scope.h" #include "IndexTools.h" #include "VectorTools.h" #include "CPDDiscreteInterface.h" #include "CPT.h" #include "JointPolicyDiscretePure.h" #include "TwoStageDynamicBayesianNetwork.h" #include "MADPComponentFactoredStates.h" using namespace std; #define DEBUG_UPDATE 0 #define DEBUG_CONSTRUCTOR 0 FSAOHDist_NECOF::FSAOHDist_NECOF() : _m_puf(0), _m_stage(0), _m_sfacMarginals(0), _m_oHistConditional( 0 ), _m_oHistMarginals( 0 ), _m_sfacSoI(0), _m_sfacSoI_ii_size(0), _m_stepsize(0) { } FSAOHDist_NECOF::FSAOHDist_NECOF(const PlanningUnitFactoredDecPOMDPDiscrete* p) : _m_puf(p) ,_m_stage(0) ,_m_sfacMarginals( new FSDist_COF() ) ,_m_oHistConditional( p->GetNrAgents(), 0 ) ,_m_oHistMarginals( vector< vector >( p->GetNrAgents(), vector(1, 1.0) ) ) ,_m_sfacSoI( p->GetFDPOMDPD()->GetNrAgents() ) ,_m_sfacSoI_ii_size( p->GetFDPOMDPD()->GetNrAgents() ) ,_m_stepsize( p->GetFDPOMDPD()->GetNrAgents(), 0) { const FactoredDecPOMDPDiscreteInterface* fd = _m_puf->GetFDPOMDPD(); const vector& nrValsPerSF = fd->GetNrValuesPerFactor(); //first fill the scope of influence for all agent's (observations) for(Index agI=0; agI < _m_puf->GetNrAgents(); agI++) { Scope sfSc_dummy; Scope agSc; agSc.Insert(agI); _m_sfacSoI.at(agI) = fd->Get2DBN()->GetYSoI_O(agI); #if DEBUG_CONSTRUCTOR cout << "_m_sfacSoI.at("< nrValsForScope(_m_sfacSoI.at(agI).size()); IndexTools::RestrictIndividualIndicesToScope(nrValsPerSF,_m_sfacSoI.at(agI), nrValsForScope); _m_sfacSoI_ii_size.at(agI) = VectorTools::VectorProduct(nrValsForScope); _m_stepsize.at(agI) = IndexTools::CalculateStepSize(nrValsForScope); } //now fill the probabilities of the (initial=empty) observation //history for each agent for(Index agI=0; agI < _m_puf->GetNrAgents(); agI++) { size_t nrXs = _m_sfacSoI_ii_size.at(agI); size_t nrOHs = 1; CPT* cpt = new CPT(nrOHs, nrXs ); for(Index xI=0; xI < nrXs; xI++) cpt->Set(0, xI, 1.0); _m_oHistConditional.at(agI) = cpt; } } //Copy constructor. FSAOHDist_NECOF::FSAOHDist_NECOF(const FSAOHDist_NECOF& o) : _m_puf(o._m_puf) ,_m_stage(o._m_stage) ,_m_sfacMarginals( o._m_sfacMarginals ) ,_m_oHistConditional( o._m_oHistConditional ) ,_m_oHistMarginals( o._m_oHistMarginals ) ,_m_sfacSoI(o._m_sfacSoI) ,_m_sfacSoI_ii_size( o._m_sfacSoI_ii_size ) // ,_m_stepsize(o._m_stepsize) { size_t nrAg = _m_puf->GetNrAgents(); //make a deep copy of the stepsize arrays _m_stepsize.resize(nrAg, 0); for( Index agI=0; agI < nrAg; agI++) { //check how many factors in the SoI of this agent's (agI's) observation size_t nrSFacsInSoI = _m_sfacSoI.at(agI).size(); size_t * sz_arr = new size_t [nrSFacsInSoI]; for(Index sfI=0; sfI < nrSFacsInSoI; sfI++) sz_arr[sfI] = o._m_stepsize.at(agI)[sfI]; _m_stepsize.at(agI) = sz_arr; } } //Destructor FSAOHDist_NECOF::~FSAOHDist_NECOF() { size_t nrAg = _m_oHistConditional.size(); if(_m_stepsize.size()== nrAg) { for( Index agI=0; agI < nrAg; agI++) { size_t * sz_arr = _m_stepsize[agI]; if( sz_arr != 0) delete [] sz_arr; } _m_stepsize.clear(); } for(Index agI=0; agI < nrAg; agI++) delete _m_oHistConditional.at(agI); delete _m_sfacMarginals; } //Copy assignment operator FSAOHDist_NECOF& FSAOHDist_NECOF::operator= (const FSAOHDist_NECOF& o) { if (this == &o) return *this; // Gracefully handle self assignment // Put the normal assignment duties here... return *this; } double FSAOHDist_NECOF::GetXProb( const Scope& sfSc, const std::vector& sfValI) const { return _m_sfacMarginals->GetProbability(sfSc, sfValI); } double FSAOHDist_NECOF::GetOHProb_relT( const Scope& agSc, const std::vector& ohI) const { double p = 1.0; for(Index i=0; i < agSc.size(); i++) { Index agI = agSc.at(i); Index ohI_agI = ohI.at(i); double p_this_agent = _m_oHistMarginals.at(agI).at(ohI_agI); p *= p_this_agent; } return p; } double FSAOHDist_NECOF::GetXOHProb_relT( const Scope& sfSc, const std::vector& sfacIndices, const Scope& agSc, const std::vector& ohIndices ) const { //we use a running example to illustrate the code: // ->we want to compute P(o1o2x1x2) //However, o1 additionally depends on x3 and o2 on x4 //first check if sfSc contains all state factors that can influence //the observation (and thus the OHs) of the agents in agentSc, if //not, we will need to marginalize over the state factors that are not //in sfSc (but are in the SoI). Scope all_relevant_sfacIs(sfSc); for(Index i=0; i < agSc.size(); i++) all_relevant_sfacIs.Insert( _m_puf->GetFDPOMDPD()-> Get2DBN()->GetYSoI_O( agSc[i] ) ); Scope to_marginalize_over_sfacIs(all_relevant_sfacIs); to_marginalize_over_sfacIs.Remove(sfSc); //p(x1x2) = P(x1)*P(x2) double p1 = GetXProb(sfSc, sfacIndices); vector marg_vec(to_marginalize_over_sfacIs.size(), 0); vector marg_nrSFvals( to_marginalize_over_sfacIs.size()); IndexTools::RestrictIndividualIndicesToScope( _m_puf->GetFDPOMDPD()->GetNrValuesPerFactor(), to_marginalize_over_sfacIs, marg_nrSFvals); //this will hold P(o1o2|x1x2) double p_ohIndices_given_sfacIndices = 0.0; do { //the probability of this instantiation of marg_vec //P(x3x4) double p2 = GetXProb(to_marginalize_over_sfacIs, marg_vec); if(p2>0) // optimalization: if p2 is zero the rest will be zero as well { //construct the 'full' state vector (i.e., containing all_relevant_sfacIs) //the vector x1x2x3x4 vector all_relevant_vals(sfacIndices); all_relevant_vals.insert(all_relevant_vals.end(), marg_vec.begin(), marg_vec.end()); //P(o1o2|x1x2x3x4) double p_ohIndices_given_all_relevant_vals = 1.0; for(Index i=0; i < agSc.size(); i++) { Index agI=agSc.at(i); Index ohI=ohIndices.at(i); vector sfacIrestr(_m_sfacSoI.at(agI).size()); try{ IndexTools::RestrictIndividualIndicesToNarrowerScope( all_relevant_vals, all_relevant_sfacIs, _m_sfacSoI.at(agI), sfacIrestr); }catch(ENoSubScope& e) { throw ENoSubScope("bah"); } Index x = IndexTools::IndividualToJointIndicesStepSize( sfacIrestr, _m_stepsize.at(agI) ); double p_OHi_given_all_relevant_vals = _m_oHistConditional.at(agI)->Get(ohI, x); //P(o1o2|x1x2x3x4) = P(o1|x1x2x3)P(o2|x1x2x4) p_ohIndices_given_all_relevant_vals *= p_OHi_given_all_relevant_vals; } //P(o1o2x3x4|x1x2) = P(o1o2|x1x2x3x4)P(x3x4) double p_ohIndices_marg_vec_given_sfacIndices = p2 * p_ohIndices_given_all_relevant_vals; //P(o1o2|x1x2) = sum_{x3x4} P(o1o2x3x4|x1x2) p_ohIndices_given_sfacIndices += p_ohIndices_marg_vec_given_sfacIndices; } }while (! IndexTools::Increment( marg_vec, marg_nrSFvals ) ); //finally P(o1o2x1x2): double result = p1 * p_ohIndices_given_sfacIndices; return(result); } double FSAOHDist_NECOF::GetXOHProb_relT_SufficientSFscope( const Scope& sfSc, const std::vector& sfacIndices, const Scope& agSc, const std::vector& ohIndices ) const { double p = GetXProb(sfSc, sfacIndices); for(Index i=0; i < agSc.size(); i++) { Index agI=agSc.at(i); Index ohI=ohIndices.at(i); vector sfacIrestr(_m_sfacSoI.at(agI).size()); try{ IndexTools::RestrictIndividualIndicesToNarrowerScope( sfacIndices, sfSc, _m_sfacSoI.at(agI), sfacIrestr ); }catch(ENoSubScope& e) { stringstream ss; ss <<"Error FSAOHDist_NECOF::GetXOHProb_relT should be called with all state factors on which the observation histories (of the agents in agSc) depend\n"; ss <<"sfSc="<SoftPrint() << endl; cout << "for jpol" << jpol.SoftPrint() << endl; #endif //make temp copies of old distr. FSDist_COF prev_sfacMarginals = *_m_sfacMarginals; vector< vector > prev_oHistMarginals = _m_oHistMarginals; Index prev_stage = _m_stage; //update stage _m_stage++; //set all sfac probs to 0 _m_sfacMarginals->SetZero(); //grow vectors representing OH probs for(Index agI=0; agI < _m_puf->GetNrAgents(); agI++) { _m_oHistMarginals[agI].clear(); size_t nrOHs = _m_puf->GetNrObservationHistories(agI, _m_stage); _m_oHistMarginals[agI] = vector( nrOHs, 0.0 ); delete _m_oHistConditional[agI]; size_t nrXs = _m_sfacSoI_ii_size.at(agI); CPT* cpt = new CPT(nrOHs, nrXs ); _m_oHistConditional.at(agI) = cpt; } //compute the action probabilities for each agent //(note that this is possible because we update from the marginals // of the observation histories, otherwise this should be done inside // the state-prob update loop) vector < vector > p_AgAc( _m_puf->GetNrAgents() );//p_AgAc[agI][acI] for(Index agI=0; agI < _m_puf->GetNrAgents(); agI++) { p_AgAc[agI].resize(_m_puf->GetNrActions(agI) ); for(Index ohIwithinPrevStage=0; ohIwithinPrevStage < _m_puf->GetNrObservationHistories(agI, prev_stage) ; ohIwithinPrevStage++) { Index ohI = ohIwithinPrevStage + CastLIndexToIndex(_m_puf->GetFirstObservationHistoryIndex(agI, prev_stage)); Index actionI = jpol.GetActionIndex(agI,ohI); p_AgAc[agI][actionI] += prev_oHistMarginals[agI][ohIwithinPrevStage]; } } const FactoredDecPOMDPDiscreteInterface* fd = _m_puf->GetFDPOMDPD(); const TwoStageDynamicBayesianNetwork* dbn = fd->Get2DBN(); //update state factor probs: //yI is the state factor index in the right side of the 2DBN for(Index yI=0; yI < fd->GetNrStateFactors(); yI++) { //compute probabilities of all values of xI at new stage _m_stage const Scope& sfSc = dbn->GetXSoI_Y(yI); vector xIs(sfSc.size(), 0); vector nr_xIs(sfSc.size()); IndexTools::RestrictIndividualIndicesToScope( fd->GetNrValuesPerFactor(), sfSc, nr_xIs); const Scope& agSc = dbn->GetASoI_Y(yI); vector actions(agSc.size(), 0); vector nr_actions(agSc.size()); IndexTools::RestrictIndividualIndicesToScope( _m_puf->GetNrActions(), agSc, nr_actions); //NOTE: currently intra-stage Y dependencies are not yet supported. //This is a workaround. vector Yii_dummy; do { //compute probability of xIs: double pX = prev_sfacMarginals.GetProbability(sfSc, xIs); do { //compute probability of actions: double pA = 1.0; for(Index i=0; i < agSc.size(); i++) { Index agI = agSc[i]; pA *= p_AgAc[agI][ actions[i] ]; } vector probs = fd->Get2DBN()->GetYProbabilitiesExactScopes( xIs, actions, Yii_dummy, yI); for(Index yVal=0; yVal < fd->GetNrValuesForFactor(yI); yVal++) { _m_sfacMarginals->GetReferrence(yI, yVal) += probs[yVal] * pX * pA; } } while ( ! IndexTools::Increment(actions, nr_actions) ); } while ( ! IndexTools::Increment(xIs, nr_xIs) ); } //update the OH conditionals and marginals for(Index agI=0; agI < _m_puf->GetNrAgents(); agI++) { const Scope& aSc = dbn->GetASoI_O(agI); const Scope& ySc = dbn->GetYSoI_O(agI); const Scope& oSc = dbn->GetOSoI_O(agI); //is agI in its own scope of influence? //(i.e., does its action affect its observation?) bool agI_in_ASoI_O_agI = aSc.Contains(agI); // nr Other Influencing Agents size_t nrOIA = aSc.size(); if(agI_in_ASoI_O_agI) nrOIA--; #if 0 if(nrOIA >= 1) throw E("FSAOHDist_NECOF:: influence of other agents j on agent i's observation not (yet?) supported,"); #endif if(oSc.size() != 0) throw E("FSAOHDist_NECOF:: correlated observations not (yet?) supported,"); vector aIs(aSc.size(), 0); vector nr_aIs(aSc.size()); IndexTools::RestrictIndividualIndicesToScope( _m_puf->GetNrActions(), aSc, nr_aIs); vector yIs(ySc.size(), 0); vector nr_yIs(ySc.size()); IndexTools::RestrictIndividualIndicesToScope( fd->GetNrValuesPerFactor(), ySc, nr_yIs); //compute the probability of all previous OH histories of this agent //extended by an observation. for(Index ohIwithinPrevStage=0; ohIwithinPrevStage < _m_puf->GetNrObservationHistories(agI, prev_stage) ; ohIwithinPrevStage++) { double PprevOHI = prev_oHistMarginals[agI][ohIwithinPrevStage]; Index prevOHI = ohIwithinPrevStage + CastLIndexToIndex(_m_puf->GetFirstObservationHistoryIndex(agI, prev_stage)); Index agI_s_actionI = jpol.GetActionIndex(agI, prevOHI); #if 0 vector aIs_dummy; //this should be constructed if(agI_in_ASoI_O_agI) aIs_dummy.push_back( agI_s_actionI ); #endif //when we want to model observation dependence, this //should be constructed to contain the observations that //can influence the observation of this agent (agI) vector oIs_dummy; do{ double Py = _m_sfacMarginals->GetProbability(ySc, yIs); // we loop over all joint actions for this scope, but // only consider the ones in which agI's action is // consistent with the policy do{ if(aIs[aSc.GetPositionForIndex(agI)]==agI_s_actionI) { vector O_probs = fd->Get2DBN()->GetOProbabilitiesExactScopes( aIs, yIs, oIs_dummy, agI); // marginalize the other influencing agents' actions double pOtherAgents=1; for(Index i=0; i < aSc.size(); i++) { if(aSc[i]!=agI) { Index otherAgent=aSc[i]; Index otherAgentAction=aIs[i]; pOtherAgents *= p_AgAc[otherAgent][otherAgentAction]; } } for(Index oI=0; oI < _m_puf->GetNrObservations(agI); oI++) { //P( oI| agI_s_actionI, yIs ) = P( oI| prevOHI, yIs) //Po_given_pOH_aIs_y = P(o|prev.OH, aIs, y) double Po_given_pOH_aIs_y = O_probs[oI]; // P(oI|..) = P(OH | y) = \Sum_aG - i.e., the probability of actions are // marginalized out. double P_OH_given_y = Po_given_pOH_aIs_y * PprevOHI * pOtherAgents; // compute indices for the new OH, and y Index sucOHI =_m_puf->GetSuccessorOHI(agI, prevOHI, oI); Index sucOHIwithinStage = sucOHI - CastLIndexToIndex(_m_puf->GetFirstObservationHistoryIndex(agI, _m_stage)); Index y = IndexTools::IndividualToJointIndicesStepSize( yIs, _m_stepsize.at(agI) ); //add the probability of oI (i.e. OH) for this configuration of actions aIs double pCond=_m_oHistConditional.at(agI)->Get(sucOHIwithinStage, y) + P_OH_given_y; _m_oHistConditional.at(agI)->Set(sucOHIwithinStage, y, pCond); _m_oHistMarginals.at(agI).at(sucOHIwithinStage) += P_OH_given_y * Py; } } } while ( ! IndexTools::Increment(aIs, nr_aIs) ); } while ( ! IndexTools::Increment(yIs, nr_yIs) ); } //end for ohIwithinPrevStage }//end for agI #if DEBUG_UPDATE cout << "Ended update. Result is ..."<< this->SoftPrint() << endl; #endif this->SanityCheck(); } void FSAOHDist_NECOF::InitializeFromISD(const FactoredStateDistribution * d) { FactoredStateDistribution *p1=d->Clone(); FSDist_COF* p = dynamic_cast(p1); if(p == 0) throw E("FSAOHDist_NECOF::InitializeFromISD cast failed"); //copy the distribution into this object delete _m_sfacMarginals; _m_sfacMarginals = p; } string FSAOHDist_NECOF::SoftPrint() const { stringstream ss; ss << "Nearly completely factored (S,OH)-distribution:"<SoftPrint() << endl; return (ss.str() ); } void FSAOHDist_NECOF::SanityCheck() { //cout << "Starting FSAOHDist_NECOF::SanityCheck()"<SanityCheck(); for(Index agentI=0; agentI < _m_oHistMarginals.size(); agentI++) { double psum = 0.0; for(Index ohI=0; ohI < _m_oHistMarginals.at(agentI).size(); ohI++) psum += _m_oHistMarginals.at(agentI).at(ohI); if(!Globals::EqualProbability(psum, 1.0)) { stringstream ss; ss << "Warning! - FSDist_COF::SanityCheck agentI="< 1e-12 ) cout << "Warning - - FSDist_COF::SanityCheck agentI="<SanityCheck(); } madp-0.4/src/support/PaxHeaders.5405/ProblemDecTigerWithCreaks.h0000644000000000000000000000013212717644275021437 xustar0030 mtime=1463765181.545708625 30 atime=1463765181.545708625 30 ctime=1463765201.633548187 madp-0.4/src/support/ProblemDecTigerWithCreaks.h0000664000372100037210000000552112717644275022276 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #ifndef _PROBLEMDECTIGERWITHCREAKS_H_ #define _PROBLEMDECTIGERWITHCREAKS_H_ 1 /* the include directives */ #include #include #include "DecPOMDPDiscrete.h" #include "ActionDiscrete.h" #include "JointActionDiscrete.h" #include "ObservationDiscrete.h" #include "JointObservationDiscrete.h" /** ProblemDecTigerWithCreaks implements a variation of the DecTiger problem, in which an agent can hear whether the other agent has tried to open a door. Defined in Gmytrasiewicz, P. J. and Doshi, P., "A Framework for Sequential Planning in Multi-Agent Settings", JAIR 24, 2005, pages 49-79. */ class ProblemDecTigerWithCreaks : public DecPOMDPDiscrete { private: /* aliases */ typedef std::vector ActionIVec; typedef std::vector ObservationIVec; /* constants */ const size_t NUMBER_OF_STATES; const size_t NUMBER_OF_AGENTS; const size_t NUMBER_OF_OBSERVATIONS; const size_t NUMBER_OF_ACTIONS; enum state_enum{ SLEFT, SRIGHT }; enum action_enum{ LISTEN, OPENLEFT, OPENRIGHT }; enum observation_enum{ GROWLLEFT_CREAKLEFT, GROWLLEFT_CREAKRIGHT, GROWLLEFT_SILENCE, GROWLRIGHT_CREAKLEFT, GROWLRIGHT_CREAKRIGHT, GROWLRIGHT_SILENCE }; ///Construct all the Actions and actionSets (the vector _m_actionVecs). void ConstructActions(); ///Construct all the observations and observation sets. void ConstructObservations(); ///Fills the transition model with the tiger problem transitions. void FillTransitionModel(); ///Fills the observation model with the tiger problem obs. probs. void FillObservationModel(); ///Fills the reward model with the tiger problem rewards. void FillRewardModel(); Index GetJointActionIndex(Index a0, Index a1) const; Index GetJointObsIndex(Index o0, Index o1) const; double GetObsProb(Index ja,Index s,Index agentI,Index oI) const; double GetRewardForAgent(Index s, Index ja, Index agentI) const; protected: public: // constructors etc. /// Default constructor. ProblemDecTigerWithCreaks(); /// Destructor. virtual ~ProblemDecTigerWithCreaks(); }; #endif //! _PROBLEMDECTIGERWITHCREAKS_H_ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/ProblemFOBSFireFightingFactored.h0000644000000000000000000000013212717644275022453 xustar0030 mtime=1463765181.325710382 30 atime=1463765181.325710382 30 ctime=1463765201.637548157 madp-0.4/src/support/ProblemFOBSFireFightingFactored.h0000664000372100037210000000757612717644275023326 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Philipp Robbel * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _PROBLEMFOBSFIREFIGHTINGFACTORED_H_ #define _PROBLEMFOBSFIREFIGHTINGFACTORED_H_ 1 /* the include directives */ #include "FactoredDecPOMDPDiscrete.h" #include "FactoredMMDPDiscrete.h" #include /** \brief This is a template of how to implement a fully-observable problem * from scratch (by deriving from FactoredMMDPDiscrete). * * As an example, we'd like to implement a fully-observable FireFightingFactored. * Since MADP already contains a (partially-observable) implementation, we merely * copy most of it into our versions of ProblemFOBSFireFightingFactored * below. The only differences concern the generation of observations which is * hidden from the user inside FactoredMMDPDiscrete in the fully-observable * case. * * In summary, the MADP interface for defining decision problem instances remains * identical. For partially-observable problems, derive from * FactoredDecPOMDPDiscrete, for fully-observable problems from FactoredMMDPDiscrete * (and do not worry about defining observations in the latter case). */ class ProblemFOBSFireFightingFactored : public FactoredMMDPDiscrete { protected: size_t _m_nrAgents; size_t _m_nrHouses; size_t _m_nrFireLevels; double _m_costOfMove; bool _m_forcePositionRepres; bool _m_includePositions; size_t _m_nrStateFeatures; //vector that stores the number of values per state feature. std::vector _m_nrPerStateFeatureVec; size_t _m_nrJointFirelevels; //vector that stores the number of values per state feature. std::vector _m_nrFLs_vec; std::vector< Index> GetStateVector(Index sI) const { return IndexTools::JointToIndividualIndices (sI, _m_nrPerStateFeatureVec ); } ///Compute the probability of value yVal of state variable y, given ii= double ComputeTransitionProb( Index y, Index yVal, const std::vector< Index>& Xs, const std::vector< Index>& As, const std::vector< Index>& Ys) const; virtual size_t GetNrAgentsAtHouse(const std::vector< Index>& As, Index hI) const; virtual size_t GetAgentLocation(Index action, Index agI) const; virtual std::string SoftPrintBriefDescription( size_t nrAgents, size_t nrHouses, size_t nrFLs) const; virtual std::string SoftPrintDescription(size_t nrAgents, size_t nrHouses, size_t nrFLs) const; ///Construct all the Actions and actionSets (the vector _m_actionVecs). virtual void ConstructActions(); virtual Scope GetHousesAgentInfluences(Index agI) const; void InitializePFFF(); virtual void SetYScopes(); public: ///Constructor ProblemFOBSFireFightingFactored( size_t nrAgents, size_t nrHouses, size_t nrFireLevels, double costOfMove=0.0, bool forcePositionRepres = false, bool initialize=true); /// Destructor. virtual ~ProblemFOBSFireFightingFactored(){}; /// Returns a pointer to a copy of this class. virtual ProblemFOBSFireFightingFactored* Clone() const { return new ProblemFOBSFireFightingFactored(*this); } }; #endif /* !_PROBLEMFOBSFIREFIGHTINGFACTORED_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/JointBeliefEventDriven.h0000644000000000000000000000013012717644275021005 xustar0029 mtime=1463765181.57770837 29 atime=1463765181.57770837 30 ctime=1463765201.661547964 madp-0.4/src/support/JointBeliefEventDriven.h0000664000372100037210000000442712717644275021652 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Joao Messias * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _JOINTBELIEFEVENTDRIVEN_H_ #define _JOINTBELIEFEVENTDRIVEN_H_ 1 /* the include directives */ #include #include "Globals.h" #include "Belief.h" #include "JointBeliefInterface.h" class MultiAgentDecisionProcessDiscreteInterface; //forward declaration to avoid including each other /** * \brief JointBeliefEventDriven stores a joint belief, represented as a regular * (dense) vector of doubles. */ class JointBeliefEventDriven : virtual public JointBeliefInterface, virtual public Belief { private: int _m_falseNegativeObs; protected: public: /// Constructor which sets the \a size of the joint belief. JointBeliefEventDriven(size_t size=0, int falseNegativeObs=-1); /// Constructor which copies \a belief in this joint belief. JointBeliefEventDriven(const std::vector &belief, int falseNegativeObs=-1); /// Constructor which copies \a belief in this joint belief. JointBeliefEventDriven(const JointBeliefInterface &belief, int falseNegativeObs=-1); JointBeliefEventDriven(const StateDistribution& belief, int falseNegativeObs=-1); /// Destructor ~JointBeliefEventDriven(); JointBeliefEventDriven& operator= (const JointBeliefEventDriven& o); JointBeliefInterface& operator= (const JointBeliefInterface& o); double Update(const MultiAgentDecisionProcessDiscreteInterface &pu, Index lastJAI, Index newJOI); /// Returns a pointer to a copy of this class. virtual JointBeliefEventDriven* Clone() const { return new JointBeliefEventDriven(*this); } }; #endif /* !_JOINTBELIEFEVENTDRIVEN_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/ActionHistory.cpp0000644000000000000000000000013212717644275017575 xustar0030 mtime=1463765181.481709137 30 atime=1463765181.481709137 30 ctime=1463765201.721547484 madp-0.4/src/support/ActionHistory.cpp0000664000372100037210000000427312717644275020437 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "ActionHistory.h" #include "Action.h" //Necessary as header file contains a forward declaration: #include "PlanningUnitMADPDiscrete.h" using namespace std; #define DEBUG_AH 0 //Default constructor ActionHistory::ActionHistory(PlanningUnitMADPDiscrete& pu, Index agentI) : IndividualHistory(agentI), _m_planningUnitMADPDiscrete(&pu) { SetLength(0); _m_actionI = 0; _m_isEmpty = true; _m_pred = 0; } ActionHistory::ActionHistory(Index aI, ActionHistory* pred): IndividualHistory(pred->_m_agentI), _m_planningUnitMADPDiscrete(pred->_m_planningUnitMADPDiscrete) { SetLength(pred->GetLength() + 1); _m_actionI = aI; _m_isEmpty = false; _m_pred = pred; } //Destructor ActionHistory::~ActionHistory() { if(DEBUG_AH){ cout << "Deleting action history: "; Print(); cout << endl;} } string ActionHistory::SoftPrint() const { stringstream ss; if(_m_pred != 0) { //if the predec. is the empty action sequence (with length 0) //we don't want to print this. (and this is the case when //this action history has length 1) if(_m_length >= 1) ss << _m_pred->SoftPrint(); else if (_m_length < 1) { ss << "ActionHistory:Print() - Warning:_m_pred != "<< "null, but lenght < 1 !"<GetAction(_m_agentI, _m_actionI))->SoftPrintBrief(); ss << ", "; } else ss << "EMPTY_AH"; return(ss.str()); } madp-0.4/src/support/PaxHeaders.5405/PlanningUnitMADPDiscrete.h0000644000000000000000000000013212717644275021176 xustar0030 mtime=1463765181.345710223 30 atime=1463765181.329710351 30 ctime=1463765201.677547837 madp-0.4/src/support/PlanningUnitMADPDiscrete.h0000664000372100037210000013273712717644275022047 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _PLANNINGUNITMADPDISCRETE_H_ #define _PLANNINGUNITMADPDISCRETE_H_ 1 /* the include directives */ #include #include #include #include "Globals.h" #include "PlanningUnit.h" #include "MultiAgentDecisionProcessDiscreteInterface.h" #include "Interface_ProblemToPolicyDiscretePure.h" #include "PlanningUnitMADPDiscreteParameters.h" //#include "Referrer.h" // forward declarations, very important in this class, as it will be // included by many many others class JointBelief; class JointBeliefSparse; class JointBeliefInterface; class JointPolicyDiscrete; class PolicyDiscretePure; class ActionHistory; class JointActionHistory; class ObservationHistory; class ObservationHistoryTree; class JointObservationHistory; class JointObservationHistoryTree; class ActionObservationHistory; class ActionObservationHistoryTree; class JointActionObservationHistory; class JointActionObservationHistoryTree; #include "ActionHistoryTree.h" #include "JointActionHistoryTree.h" /** * \brief PlanningUnitMADPDiscrete represents a Planning unit for a * discrete MADP (discrete actions, observations and states). */ class PlanningUnitMADPDiscrete : public PlanningUnit, public Interface_ProblemToPolicyDiscretePure //public Referrer { private: MultiAgentDecisionProcessDiscreteInterface* _m_madp; /// Calls functions to initialize the planning unit. void Initialize(); /// Cleans up and releases allocated memory. void Deinitialize(); ///A bool indicating whether this Planning unit has been initialized. bool _m_initialized; /// The parameters for this planning unit. PlanningUnitMADPDiscreteParameters _m_params; /** \brief Constructs all possible observation histories and puts * them in a tree per agent. * * Pointers to (the root nodes of) these trees are stored in * _m_observationHistoryTreeRootPointers. */ void InitializeObservationHistories(); /** \brief Breadth-first construction of the observation histories * and obs. history tree for agent agentI. * * Returns a pointer to the root of the tree. The function should * only be called from InitializeObservationHistories()! (should be * called in the order of the agents). */ ObservationHistoryTree* CreateObservationHistoryTree(Index agentI); ///Deletes all ObservationHistories(Trees) - used on reinitialization. void DeInitializeObservationHistories(); /** \brief Creates all the joint observation histories. * * The root is stored as _m_jointObservationHistoryTreeRoot and * all joint obs. histories are accessible by index through * _m_jointObservationHistoryTreeVector. */ void InitializeJointObservationHistories(); ///Deletes all joint observation histories. void DeInitializeJointObservationHistories(); /**\brief Constructs all possible action histories and puts them * in a tree per agent. * * Pointers to (the root nodes of) these trees are stored in * _m_actionHistoryTreeRootPointers. */ void InitializeActionHistories(); /** \brief Breadth-first construction of the action histories * and action history tree for agent agentI. * * Returns a pointer to the root of the tree. The function should * only be called from InitializeActionHistories()! (should be * called in the order of the agents). */ ActionHistoryTree* CreateActionHistoryTree(Index agentI); ///Deletes all ActionHistories(Trees) - used on reinitialization. void DeInitializeActionHistories(); /** \brief Creates all the joint action histories. * * The root is stored as _m_jointActionHistoryTreeRoot and * all joint action histories are accessible by index through * _m_jointActionHistoryTreeVector. */ void InitializeJointActionHistories(); ///Deletes all joint action histories. void DeInitializeJointActionHistories(); /** \brief Constructs all possible action-observation histories * and puts them in a tree per agent. * * Pointers to (the root nodes of) these trees are stored in * _m_observationHistoryTreeRootPointers. */ void InitializeActionObservationHistories(); /** \brief Breadth-first construction of the action-observation * histories and action-obs. history tree for agent agentI. * * Returns a pointer to the root of the tree. The function should * only be called from InitializeActionObservationHistories()! * (should be called in the order of the agents). */ ActionObservationHistoryTree* CreateActionObservationHistoryTree(Index agentI); /** \brief Deletes all ActionObservationHistories(Trees) - used on * reinitialization. */ void DeInitializeActionObservationHistories(); /** \brief Creates all the joint action-observation histories. * * The root is stored as _m_jointActionObservationHistoryTreeRoot * and all joint act-obs. histories are accessible by index * through _m_jointActionObservationHistoryTreeVector. Depending * on _m_params, the joint beliefs should are calculated and * stored (and their conditional probabilities). */ void InitializeJointActionObservationHistories(); ///Deletes all joint action-observation histories. void DeInitializeJointActionObservationHistories(); protected: /// Do some sanity checks, can be overridden. virtual bool SanityCheck() const; //Counters that keep track of the number of histories /** \brief A vector that keeps track of the number of observation * histories per agent. */ std::vector _m_nrObservationHistories; ///The number of joint observation histories. size_t _m_nrJointObservationHistories; /** \brief Keeps track of the number of observation histories per agent * per time step. _m_nrObservationHistoriesT[agentI][t] */ std::vector< std::vector > _m_nrObservationHistoriesT; ///The number of joint observation histories per time-step. std::vector _m_nrJointObservationHistoriesT; /**\brief The _m_firstOHIforT[aI][t] contains the first observation history * for time-step t of agent aI.*/ std::vector > _m_firstOHIforT; /**\brief The _m_firstJOHIforT[t] contains the first joint observation * history for time-step t.*/ std::vector _m_firstJOHIforT; /** \brief A vector that keeps track of the number of action * histories per agent. */ std::vector _m_nrActionHistories; ///The number of joint action histories. size_t _m_nrJointActionHistories; /**\brief A vector that keeps track of the number of action histories per * agent per time step. _m_nrActionHistoriesT[agentI][t] */ std::vector< std::vector > _m_nrActionHistoriesT; ///The number of joint action histories per time-step. std::vector _m_nrJointActionHistoriesT; /**\brief The _m_firstAHIforT[aI][t] contains the first action history * for time-step t of agent aI.*/ std::vector > _m_firstAHIforT; /**\brief The _m_firstJAHIforT[t] contains the first joint action history * for time-step t.*/ std::vector _m_firstJAHIforT; /** \brief A vector that keeps track of the number of * action-obs. histories per agent. */ std::vector _m_nrActionObservationHistories; ///The number of joint actionAction histories. size_t _m_nrJointActionObservationHistories; /**\brief Keeps track of the number of action-obs. histories per * agent per time step. _m_nrActionObservationHistoriesT[agentI][t] */ std::vector< std::vector > _m_nrActionObservationHistoriesT; ///The number of joint actionObservation histories per time-step. std::vector _m_nrJointActionObservationHistoriesT; /**\brief The _m_firstAOHIforT[aI][t] contains the first actionObservation * history for time-step t of agent aI.*/ std::vector > _m_firstAOHIforT; /**\brief _m_firstJAOHIforT[t] contains the first joint actionObservation * history for time-step t.*/ std::vector _m_firstJAOHIforT; //Storage of the actual histories: /** \brief A vector that stores pointers to the roots of the * observation history trees of each agent.*/ std::vector _m_observationHistoryTreeRootPointers; /**A vector which, for each agents, stores a vector with all * ObservationHistoryTree pointers. Used to give access to each * ObservationHistory(Tree) by index. */ std::vector > _m_observationHistoryTreeVectors; ///The root node of the joint observation histories tree JointObservationHistoryTree* _m_jointObservationHistoryTreeRoot; /** \brief A vector which stores a JointObservationHistoryTree pointer. * * Used to give access to the all JointObservationHistoryTree by * index.*/ std::vector _m_jointObservationHistoryTreeVector; /**\brief A vector that stores pointers to the roots of the action * history trees of each agent.*/ std::vector _m_actionHistoryTreeRootPointers; /**\brief A vector which, for each agents, stores a vector with all * ActionHistoryTree pointers. * * Used to give access to each ActionHistory(Tree) by index. */ std::vector > _m_actionHistoryTreeVectors; ///The root node of the joint action histories tree JointActionHistoryTree* _m_jointActionHistoryTreeRoot; /**\brief A vector which stores a JointActionHistoryTree pointer. * * Used to give access to the all JointActionHistoryTree by * index.*/ std::vector _m_jointActionHistoryTreeVector; /** \brief A vector that stores pointers to the roots of the * action-observation history trees of each agent.*/ std::vector< ActionObservationHistoryTree *> _m_actionObservationHistoryTreeRootPointers; /** \brief A vector which, for each agents, stores a vector with all * ActionObservationHistoryTree pointers. * * Used to give access to each ActionObservationHistory(Tree) by * index. */ std::vector > _m_actionObservationHistoryTreeVectors; ///The root node of the joint actionObservation histories tree JointActionObservationHistoryTree* _m_jointActionObservationHistoryTreeRoot; /** \brief A vector which stores JointActionObservationHistoryTree pointer. * * Used to give access to the all * JointActionObservationHistoryTree by index.*/ std::vector _m_jointActionObservationHistoryTreeVector; /**A map which is used instead of * _m_jointActionObservationHistoryTreeVector when we don't * cache all JointActionObservationHistoryTree's.*/ std::map< LIndex, JointActionObservationHistoryTree*> _m_jointActionObservationHistoryTreeMap; //Storage of joint beliefs: /**_m_jBeliefCache[i] stores a pointer to the joint belief * corresponding to the i-th JointActionObservationHistory (assuming * b^0 is as specified by the problem and that a pure joint policy * consistent with the i-th JointActionObservationHistory is followed) */ std::vector _m_jBeliefCache; /// Stores the _conditional_ probability of this joint belief. std::vector _m_jaohConditionalProbs; /**Caches the probabilities of JointActionObservationHistory's * (assuming b^0 is as specified by the problem and that a pure * joint policy consistent with the i-th * JointActionObservationHistory is followed). I.e., * _m_jaohProbsCache[k] = P( jaohI=k | prevJPol, b^0 ) */ std::vector _m_jaohProbs; public: // Constructor, destructor and copy assignment. /// Constructor with specified parameters. /** Allows for specification of the planning horizon and a pointer * to the problem instance. */ PlanningUnitMADPDiscrete( const PlanningUnitMADPDiscreteParameters ¶ms, size_t horizon=3, MultiAgentDecisionProcessDiscreteInterface* p=0 ); /// Constructor with default parameters. /** Allows for specification of the planning horizon and a pointer * to the problem instance. See * PlanningUnitMADPDiscreteParameters for the default settings. */ PlanningUnitMADPDiscrete( size_t horizon=3, MultiAgentDecisionProcessDiscreteInterface* p=0 ); /// Destructor. ~PlanningUnitMADPDiscrete(); //operators: MultiAgentDecisionProcessDiscreteInterface* GetMADPDI() { return _m_madp; } const MultiAgentDecisionProcessDiscreteInterface* GetMADPDI() const { return _m_madp; } //data manipulation (set) functions: ///Sets the problem for which to plan, using a pointer. /** Also reinitializes the planning unit. */ void SetProblem(MultiAgentDecisionProcessDiscreteInterface* madp); ///Sets the horizon for the planning problem. /** Also reinitializes the planning unit. */ void SetHorizon(size_t h); //get (data) functions: //general /// Gets the number of agents. size_t GetNrAgents() const { return(PlanningUnit::GetNrAgents()); } ///Returns a reference to the problem of the PlanningUnitMADPDiscrete const MultiAgentDecisionProcessDiscreteInterface* GetProblem() const {return(GetMADPDI());}; MultiAgentDecisionProcessDiscreteInterface* GetProblem() {return(GetMADPDI());}; /// Returns the number of states. size_t GetNrStates() const; /// Get a pointer to a State by index. const State* GetState(Index i) const { return(GetMADPDI()->GetState(i)); } /// Returns the probability of a state in the initial state distribution. double GetInitialStateProbability(Index sI) const {return(GetMADPDI()->GetInitialStateProbability(sI));}; /**\brief Returns a _new_ joint belief with the value of the * initial state distribution. */ JointBeliefInterface* GetNewJointBeliefFromISD() const; /// Get the parameters for this planning unit. const PlanningUnitMADPDiscreteParameters& GetParams() const { return(_m_params); } /// Sets the parameters for this planning unit. /** Also reinitializes the planning unit. */ void SetParams(const PlanningUnitMADPDiscreteParameters ¶ms); //related to getting (info of) actions /// Returns the number of actions vector. const std::vector& GetNrActions() const {return (GetMADPDI()->GetNrActions());} /// Returns the number of actions of agent agentI. size_t GetNrActions(Index agentI) const {return (GetMADPDI()->GetNrActions(agentI));} ///return the number of joint actions. size_t GetNrJointActions() const {return (GetMADPDI()->GetNrJointActions());} /// Returns a ref to the a-th action of agent agentI. const Action* GetAction(Index agentI, Index a) const {return(GetMADPDI()->GetAction(agentI, a));} /// Returns a ref to the i-th joint action. const JointAction* GetJointAction(Index jaI) const {return (GetMADPDI()->GetJointAction(jaI));} /**\brief Returns the joint action index that corresponds to the array of * specified individual action indices.*/ Index IndividualToJointActionIndices(const Index* indivActionIndices) const {return (GetMADPDI()->IndividualToJointActionIndices( indivActionIndices));} /**\brief Returns the joint action index that corresponds to the vector of * specified individual action indices.*/ Index IndividualToJointActionIndices(const std::vector& indivActionIndices) const {return (GetMADPDI()->IndividualToJointActionIndices( indivActionIndices));} /** \brief Returns a vector containing the indices of the * indiv. actions corresponding to the joint action jaI.*/ std::vector JointToIndividualActionIndices(Index jaI) const; //related to getting (info of) observations /// Returns the number of observations vector. const std::vector& GetNrObservations() const {return (GetMADPDI()->GetNrObservations());} /// Returns the number of observations of agent agentI. size_t GetNrObservations(Index agentI) const {return (GetMADPDI()->GetNrObservations(agentI));}; /// Returns the number of joint observations. size_t GetNrJointObservations() const {return (GetMADPDI()->GetNrJointObservations());}; /// Returns a ref to the o-th observation of agent agentI. const Observation* GetObservation(Index agentI, Index o) const {return(GetMADPDI()->GetObservation(agentI, o));} /// Returns a ref to the joI-th joint observation. const JointObservation* GetJointObservation(Index joI) const {return (GetMADPDI()->GetJointObservation(joI));} /** \brief Returns the joint observation index that corresponds to * the vector of specified individual observation indices.*/ Index IndividualToJointObservationIndices(const std::vector& inObs) const {return(GetMADPDI()->IndividualToJointObservationIndices(inObs));} /** \brief Returns a vector containing the indices of the * indiv. observations corresponding to the joint observation * joI.*/ std::vector JointToIndividualObservationIndices(Index joI) const {return(GetMADPDI()->JointToIndividualObservationIndices(joI));} //related to getting histories: /**This function computes the index of a history. * It can be a joint or individual history of actions, observations * or actions-observations. * * \li Index t - the stage * \li Index t_offset - for each stage t, there is an offset * \li const Index indices[] - array of size t containing the actual * indices of the (J)(A/O)s. * E.g., a vector with joint observation indices. * \li size_t indexDomainSize - the number of indices. I.e., the * indices range from 0...(indexDomainSize-1) */ Index ComputeHistoryIndex( Index t, Index t_offset, //const std::vector& indices, const Index indices [], size_t indexDomainSize ) const; /**This function computes the indices of the sequence corr. to a history. * I.e., it is the reverse of ComputeHistoryIndex. * * It can be a joint or individual history of actions, observations * or actions-observations. * * \li Index hI - index of the history * \li Index t - the stage * \li Index t_offset - for each stage t, there is an offset * \li const Index indices[] - array of size t. The function will write * the indices of the (J)(A/O)s corresponding to hI to this array. * \li size_t indexDomainSize - the number of indices. I.e., the * indices range from 0...(indexDomainSize-1) */ void ComputeHistoryArrays(Index hI, Index t, Index t_offset, Index Indices[], //output size_t indexDomainSize ) const; //related to getting (info of) observation histories /**Returns a vector containing the indices of the * indiv. obs.histories corresponding to the joint observation * hist. joI.*/ const std::vector& JointToIndividualObservationHistoryIndicesRef( Index johI) const; /**Returns a vector containing the indices of the indiv. obs. histories * corresponding to the joint observation hist. joI.*/ std::vector JointToIndividualObservationHistoryIndices(Index johI) const; ///converts individual history indices to a joint index /**This converts a vector of individual observation history indices to a * joint observation history index. * \li \a t - the stage of the individual histories * (must be the same, otherwise there is no corresponding * joint index!) * \li \a indivIs - the vector containing the individual indices. */ Index IndividualToJointObservationHistoryIndex(Index t, const std::vector& indivIs) const; /** Returns the number of observation histories for agentI. The * planning unit (specifically _m_nrObservationHistories) must be * initialized when calling this function. */ size_t GetNrObservationHistories(Index agentI) const; /** Returns a vector with the number of OHs for each agent. This * calls GetNrObservationHistories(Index agentI) */ const std::vector GetNrObservationHistoriesVector() const; /** Returns the number of observation histories for agentI for * time step ts. The planning unit (specifically * _m_nrObservationHistories) must be initialized when calling * this function. */ size_t GetNrObservationHistories(Index agentI, Index ts) const {return _m_nrObservationHistoriesT.at(agentI).at(ts);} /** Returns a vector with the number of OHs in stage ts for each agent. This * calls GetNrObservationHistories(Index agentI, Index ts) */ const std::vector GetNrObservationHistoriesVector(Index ts) const; ///Returns the number of joint observation histories. size_t GetNrJointObservationHistories() const {return _m_nrJointObservationHistories;} ///Returns the number of joint observation histories for time step ts. size_t GetNrJointObservationHistories(Index ts) const {return _m_nrJointObservationHistoriesT.at(ts);} ///Returns the index of the first ts observation history of agent agI. LIndex GetFirstObservationHistoryIndex(Index agI, Index ts) const {return _m_firstOHIforT.at(agI).at(ts);} /**Returns the index of the first joint observation history of time * step ts*/ LIndex GetFirstJointObservationHistoryIndex(Index ts) const {return _m_firstJOHIforT.at(ts);} ///Returns the time step of observation history ohI. Index GetTimeStepForOHI(Index agentI, Index ohI) const; ///Returns the time step of joint observation history johI. Index GetTimeStepForJOHI(Index johI) const; /**Returns the index of the successor of observation history johI via * joint observation joI. I.e., johIsuc = (johI, joI). */ Index GetSuccessorJOHI(Index johI, Index joI) const; /**Returns the index of the successor of observation history ohI * of agentI via observation joI. I.e., johIsuc = (johI, joI). */ Index GetSuccessorOHI(Index agentI, Index ohI, Index oI) const; ///Returns a pointer to observation history# ohI of agent# agentI. ObservationHistoryTree* GetObservationHistoryTree(Index agentI, Index ohI) const; ///Returns a pointer to joint observation history#. JointObservationHistoryTree* GetJointObservationHistoryTree( Index johI) const; /// Returns the index of a JointObservationHistoryTree pointer. Index GetJointObservationHistoryIndex(JointObservationHistoryTree* joh) const; /**\brief converts the vector observations of length t to a * (individual) ObservationHistory Index for agentI. * * observation needs to be a vector of length > t. The index of * the history formed by the first t observations is returned. */ Index GetObservationHistoryIndex(Index agentI, Index t, const std::vector& observations) const; /**\brief converts the vector joint observations of length t * to a JointObservationHistory Index. * * jointObservation needs to be a vector of length > t. The index * of the history formed by the first t joint observations is * returned. */ Index GetJointObservationHistoryIndex(Index t, const std::vector& jointObservations) const; /**\brief converts the vector joint observations of length t to a * JointObservationHistory Index. * * jointObservation needs to be a vector of length > t. The index * of the history formed by the first t joint observations is * returned. */ Index GetJointObservationHistoryIndex( Index t, const Index jointObservations[] ) const; /**\brief Computes the joint observations for johI. * * This function _computes_ (i.e., does no look up). * \li \a johI - the JointObservationHistory index * \li \a t - the stage of jaohI * \li \a joIs - an array of size t, which will be filled with * observ. o^1,...,o^t * * This function is called by JointToIndividualObservationHistoryIndices * (used when obs-histories are not cached). */ void GetJointObservationHistoryArrays (Index johI, Index t, Index joIs[]) const; /** * \brief Computes the observations for ohI. * * This function _computes_ (i.e., does no look up). * \li \a agentI - the index of the relevant agent * \li \a ohI - the ObservationHistory index * \li \a t - the stage of jaohI * \li \a oIs - an array of size t, which will be filled with * observations o^1,...,o^t * * This function is called by JointToIndividualObservationHistoryIndices * (used when obs-histories are not cached).*/ void GetObservationHistoryArrays (Index agentI, Index ohI, Index t, Index oIs[]) const; //related to getting (info of) action histories /**Returns a vector containing the indices of the individual * ObservationHistory s corresponding to the JointActionHistory * index JAHistI. This method does not depend on a cached vector. * (and thus also works if JointActionHistory s are not * generated.*/ std::vector JointToIndividualActionHistoryIndices(Index JAHistI) const; /**Returns a reference to a cached vector containing the indices of the * indiv. action histories corresponding to the joint action history * index JAHistI. NOTE: The cached vector (of which the reference is * returned) is stored in the generated JointActionHistory. If joint * action histories are not generated (see PlanningUnitMADPDiscrete * constructor), this method will fail. */ const std::vector& JointToIndividualActionHistoryIndicesRef(Index JAHistI) const; ///converts individual history indices to a joint index /**This converts a vector of individual observation history indices to a * joint observation history index. * \li \a t - the stage of the individual histories * (must be the same, otherwise there is no corresponding * joint index!) * \li \a indivIs - the vector containing the individual indices. */ Index IndividualToJointActionHistoryIndex(Index t, const std::vector& indivIs) const; /**\brief Computes the joint actions for jahI. * * This function _computes_ (i.e., does no look up). * \li \a jahI - the JointActionHistory index * \li \a t - the stage of jaohI * \li \a jaIs - an array of size t, which will be filled with * actions a^1,...,a^t */ void GetActionHistoryArrays (Index agentI, Index ahI, Index t, Index aIs[]) const; /**\brief converts the vector joint observations of length t * to a JointObservationHistory Index. * * jointObservation needs to be a vector of length > t. The index * of the history formed by the first t joint observations is * returned. */ Index GetJointActionHistoryIndex(Index t, const std::vector& jointActions) const; /**\brief converts the vector joint observations of length t to a * JointObservationHistory Index. * * jointObservation needs to be a vector of length > t. The index * of the history formed by the first t joint observations is * returned. */ Index GetJointActionHistoryIndex( Index t, const Index jointActions[] ) const; /** Returns the number of action histories for agentI. The * planning unit (specifically _m_nrActionHistories) must be * initialized when calling this function. */ size_t GetNrActionHistories(Index agentI) const; /** Returns the number of action histories for agentI for * time step ts. The planning unit (specifically * _m_nrActionHistories) must be initialized when calling * this function. */ size_t GetNrActionHistories(Index agentI, Index ts) const {return _m_nrActionHistoriesT.at(agentI).at(ts);} ///Returns a pointer to action history# ohI of agent# agentI. ActionHistoryTree* GetActionHistoryTree(Index agentI, Index ohI) const; ///Returns a pointer to joint action history#. JointActionHistoryTree* GetJointActionHistoryTree( Index jahI) const; /// Returns the index of a JointActionHistoryTree pointer. Index GetJointActionHistoryIndex(JointActionHistoryTree* joh) const; ///Returns the number of joint action histories. size_t GetNrJointActionHistories() const; /**Returns the index of the first joint action observation * history of time step ts*/ LIndex GetFirstJointActionObservationHistoryIndex(Index ts) const {return _m_firstJAOHIforT.at(ts);} ///Returns the time step of observation history ohI. Index GetTimeStepForAHI(Index agentI, Index ohI) const; ///Returns the time step of joint observation history johI. Index GetTimeStepForJAHI(Index johI) const; Index GetSuccessorJAHI(Index johI, Index joI) const; Index GetSuccessorAHI(Index agentI, Index ohI, Index oI) const; //related to getting (info of) action-observation histories /**Returns a vector containing the indices of the indiv. * act.-obs.histories corresponding to the joint observation hist. * joI.*/ const std::vector& JointToIndividualActionObservationHistoryIndicesRef(LIndex jaohI) const; /**Returns a vector containing the indices of the indiv. * act.-obs.history indices corresponding to the joint observation hist. * joI.*/ std::vector JointToIndividualActionObservationHistoryIndices( LIndex jaohI) const; /**\brief computes the vectors of actions and obs. corresponding to jaohI * indivO_vec[agentI][t] = oI */ void JointAOHIndexToIndividualActionObservationVectors( LIndex jaohI, std::vector< std::vector >& indivO_vec, std::vector< std::vector >& indivA_vec ) const; /**\brief computes the vector of action-observations corresponding to jaohI * indivAO_vec[agentI][t] = aoI */ void JointAOHIndexToIndividualActionObservationVectors( LIndex jaohI, std::vector< std::vector >& indivAO_vec ) const; ///converts individual history indices to a joint index /**This converts a vector of individual observation history indices to a * joint observation history index. * \li \a t - the stage of the individual histories * (must be the same, otherwise there is no corresponding * joint index!) * \li \a indivIs - the vector containing the individual indices. */ LIndex IndividualToJointActionObservationHistoryIndex(Index t, const std::vector& indivIs) const; /** Returns the number of action observation histories for agentI. * The planning unit (specifically _m_nrObservationHistories) must be * initialized and action-observation histories must have been created * when calling this function. */ size_t GetNrActionObservationHistories(Index agentI) const {return _m_nrActionObservationHistories.at(agentI);} ///Returns a pointer to observation history# ohI of agent# agentI. ActionObservationHistoryTree* GetActionObservationHistoryTree( Index agentI, Index aohI) const {return _m_actionObservationHistoryTreeVectors.at(agentI).at(aohI);} ///Returns the number of jointActionObservation histories. size_t GetNrJointActionObservationHistories() const {return _m_nrJointActionObservationHistories;} ///Returns a pointer to JointActionObservation history#. JointActionObservationHistoryTree* GetJointActionObservationHistoryTree(LIndex jaohI) const; /**\brief converts the vectors of actions and observations of length t * to a (individual) ObservationHistory Index for agentI. */ Index GetActionObservationHistoryIndex( Index agentI, Index t, const std::vector& actions, const std::vector& observations ) const; ///Returns the time step of joint action-observation history\a aohI. Index GetTimeStepForAOHI(Index agentI, Index aohI) const; ///Returns the time step of joint action-observation history\a jaohI. Index GetTimeStepForJAOHI(LIndex jaohI) const; /**Returns the index of the successor of joint * action-observation history \a jaohI via joint action \a jaI * and joint observation \a joI. */ Index GetSuccessorAOHI(Index agI, Index aohI, Index aI, Index oI) const; /**Returns the index of the successor of agent agI's * action-observation history \a aohI via action \a aI * and observation \a oI. */ LIndex GetSuccessorJAOHI(LIndex jaohI, Index jaI, Index joI) const; /// Register a new \a jaoht in the vector of indices. void RegisterJointActionObservationHistoryTree( JointActionObservationHistoryTree* jaoht); /**\brief Computes the joint actions and observations for aohI. * * This function _computes_ (i.e., does no look up). * \li \a agentI - the agent index * \li \a aohI - the JointActionObservationHistory index * \li \a t - the stage of jaohI * \li \a aIs - an array of size t, which will be filled with * actions a^0,...,a^(t-1) * \li \a oIs - an array of size t, which will be filled with * observ. o^1,...,o^t * */ void GetActionObservationHistoryArrays (Index agentI, Index aohI, Index t, Index aIs[], Index oIs[]) const; /// Returns the index of a JointActionObservationHistoryTree pointer. LIndex GetJointActionObservationHistoryIndex( JointActionObservationHistoryTree* jaoh) const; /**\brief converts the vectors of actions and observations of length t to a * joint ActionObservationHistory Index. * * Jactions and Jobservation needs to be a vector of length > t. */ Index GetJointActionObservationHistoryIndex( Index t, const std::vector& Jactions, const std::vector& Jobservations ) const; /**\brief like GetJointActionObservationHistoryIndex, but works on a subset * of agents. */ Index GetJointActionObservationHistoryIndex( Index t, const std::vector& Jactions, const std::vector& Jobservations, const Scope& agentSope ) const; /**\brief Computes the joint actions and observations for jaohI. * * This function _computes_ (i.e., does no look up). * \li \a jaohI - the JointActionObservationHistory index * \li \a t - the stage of jaohI * \li \a jaIs - an array of size t, which will be filled with * joint actions a^0,...,a^(t-1) * \li \a joIs - an array of size t, which will be filled with * joint observ. o^1,...,o^t * * This function is called by GetJAOHProbs() and * JointToIndividualActionObservationHistoryIndices() * (when the aoh's are not cached). */ void GetJointActionObservationHistoryArrays (LIndex jaohI, Index t, Index jaIs[], Index joIs[]) const; /**\brief returns the vectors with joint actions and observations * for JointActionObservationHistory jaohi. * * This function first tries to find jaohI in the cache. If it doesn't * find it there, it computes the desired result using * GetJointActionObservationHistoryArrays. */ void GetJointActionObservationHistoryVectors (LIndex jaohI, std::vector &jaIs, std::vector &joIs) const; //related to joint beliefs // /**\brief a function that forces derives classes to specify which * types of joint beliefs are used. * * * The function returns a pointer to a joint belief that is allocated with * *new*. Therefore it should also be *delete*d. * * The function is virtual, so it can be overriden in derived classes. * The behavior implemented here is as follows: * * When _m_params._m_useSparseBeliefs * -> return a JointBeliefSparse * otherwise return a JointBelief. */ virtual JointBeliefInterface * GetNewJointBeliefInterface() const; virtual JointBeliefInterface * GetNewJointBeliefInterface(size_t size) const; /**brief Returns a pointer to a _new_ joint belief. * * When joint beliefs are cached, this function returns a new joint * belief, which is a copy of the one stored in the joint belief cache. * * When joint beliefs are not cached, this function simple calculates * and returns a new belief. * * In all cases, the programming is responsible to clean up! (i.e., * 'delete' the ptr). * * */ JointBeliefInterface* GetJointBeliefInterface(LIndex jaohI) const; /**Gives the _conditional_ probability of the realization of the joint * action-observation history jaohI (and thus of the joint belief * corresponding to JointActionObservationHistory jaohI). This * probability is conditional GIVEN the previous joint * action-observation history (joint belief) AND joint action. I.e. * P(h'|h,a) = P(h,a,h') / P(h,a) */ double GetJAOHProbGivenPred(LIndex jaohI) const; /**\brief returns the probability of jaohI. * * */ double GetJAOHProb( LIndex jaohI, // the jaohI for which we want to know the probs Index p_jaohI = 0, // the GIVEN predecessor const JointBeliefInterface* p_jb = NULL,// the corresponding GIVEN // jb of p const JointPolicyDiscrete * jpol = NULL // the policy followed in ) const; /**\brief returns the probability of jaohI AND the corresponding joint * belief given the predecessor p_jaohI (and its corresponding belief) * * -output args: * JointBeliefInterface jb -the joint belief at jaohI * -input args: * Index jaohI -the jaohI for which we want to know * the probs. * Index p_jaohI = 0 -the GIVEN predecessor, when none is * specified, the initial (empty) jaoh * is assumed. * JointBelief* p_jb = NULL-the corresponding GIVEN jb of p * JointPolicyDiscrete * jpol = NULL * -the policy followed starting from * p_jaohI. (see remark below) * -returns * the probability of jaohI, given p_jaohI. * * jpol is the joint policy that is followed for the stages between * p_jaohI and jaohI. It doesn't matter if given jpol, the prob. * of p_jaohI is 0; this function returns P(jaohI) GIVEN p_jaohI and * following jpol consequently. * * \sa the manual documentation. * */ double GetJAOHProbs( //output args: JointBeliefInterface* jb, //input args: LIndex jaohI, // the jaohI for which we want to know the probs LIndex p_jaohI = 0, // the GIVEN predecessor const JointBeliefInterface* p_jb = NULL,// the corresponding GIVEN // jb of p const JointPolicyDiscrete * jpol = NULL // the policy followed in ) const; /**the function that perfoms most of the work, called by GetJAOHProbs. * * given the joint belief jb, held for joint action observation history * p_joahI, this function performs the joint belief updates * corresponding to the sequence * * jaIs[t_p], joIs[t_p], ..., jaIs[t], joIs[t] * * the returned value is the probability of this sequence, given * the start p_jaohI, and given the policy followed jpol. * * The joint belief corresponding to this sequence is returned through * jb (the belief jb is simply updated.) * */ double GetJAOHProbsRecursively( //input/output args: JointBeliefInterface* jb, //input args: const Index jaIs[], const Index joIs[], Index t_p, Index t, // const Index jaohI, //the jaohI for which we want to know the probs LIndex p_jaohI = 0, // the GIVEN predecessor // const JointBelief* p_jb = NULL, // the corresponding GIVEN jb of p const JointPolicyDiscrete * jpol = NULL // the policy followed in ) const; //related to policies /// Returns the number of policies for agentI. LIndex GetNrPolicies(Index agentI) const; /// Returns the number of joint policies. LIndex GetNrJointPolicies() const; //Getting probabilities and rewards /// Returns the trans. prob for state, joint action, suc state indices double GetTransitionProbability(Index sI, Index jaI, Index sucSI) const { return(GetMADPDI()->GetTransitionProbability(sI, jaI, sucSI));}; /// Returns P(joI | jaI, sucSI ). Arguments are time-ordered. double GetObservationProbability(Index jaI, Index sucSI, Index joI) const { return(GetMADPDI()->GetObservationProbability(jaI, sucSI, joI));}; //other /// Prints the action histories for all agents void PrintActionHistories(); /// Prints the observation histories for all agents void PrintObservationHistories(); /// Prints the actionObservation histories for all agents void PrintActionObservationHistories(); /// Prints info regarding the planning unit. void Print(); const TransitionModelDiscrete* GetTransitionModelDiscretePtr() const { #if 0 std::cerr << "GetTransitionModelDiscretePtr deprecated, use GetProblem->GetTGet()" <GetTransitionModelDiscretePtr()); } const ObservationModelDiscrete* GetObservationModelDiscretePtr() const { return(GetMADPDI()->GetObservationModelDiscretePtr()); } //Interface_ProblemToPolicyDiscrete no longer implemented! //functions for Interface_ProblemToPolicyDiscrete /// soft prints ObservationHistory ohIndex of agent agentI. std::string SoftPrintObservationHistory(Index agentI, Index ohIndex) const; /// soft prints action actionI of agent agentI. std::string SoftPrintAction(Index agentI, Index actionI) const; virtual bool AreCachedJointToIndivIndices( PolicyGlobals::PolicyDomainCategory pdc) const; std::vector JointToIndividualPolicyDomainIndices(Index jdI, PolicyGlobals::PolicyDomainCategory cat) const; const std::vector& JointToIndividualPolicyDomainIndicesRef( Index jdI, PolicyGlobals::PolicyDomainCategory cat) const; std::string SoftPrintPolicyDomainElement(Index agentI, Index dI, PolicyGlobals::PolicyDomainCategory cat ) const; size_t GetNrPolicyDomainElements(Index agentI, PolicyGlobals::PolicyDomainCategory cat, size_t depth=MAXHORIZON) const; /*\brief the default PolicyDomainCategory for the planning unit. * * as specified by Interface_ProblemToPolicyDiscrete. This can be * overriden in derived classes. */ virtual PolicyGlobals::PolicyDomainCategory GetDefaultIndexDomCat() const; /// Export a policy in dot format (from the GraphViz tools). void ExportDotGraph(const std::string &filename, const PolicyDiscretePure &policy, Index agentI, bool labelEdges=true) const; /// Convert a policy to dot format (from the GraphViz tools). std::string PolicyToDotGraph(const PolicyDiscretePure &policy, Index agentI, bool labelEdges=true) const; }; #endif /* !_PLANNINGUNITMADPDISCRETE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/ActionObservationHistoryTree.cpp0000644000000000000000000000013212717644275022631 xustar0030 mtime=1463765181.477709169 30 atime=1463765181.477709169 30 ctime=1463765201.725547454 madp-0.4/src/support/ActionObservationHistoryTree.cpp0000664000372100037210000001106012717644275023463 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "ActionObservationHistoryTree.h" #define DEBUG_AOHT 0 using namespace std; /// Create a joint observation history tree for joh ActionObservationHistoryTree::ActionObservationHistoryTree( ActionObservationHistory * const oh, aoh_t nt) : TreeNode (oh) { _m_nodeType = nt; } //Copy constructor. ActionObservationHistoryTree:: ActionObservationHistoryTree(const ActionObservationHistoryTree& o) : TreeNode(o) { } void ActionObservationHistoryTree::SetIndex(Index i) { if (_m_nodeType == O_SUC) throw E("Trying ActionObservationHistoryTree::SetIndex on O_SUC node"); this->TreeNode::SetIndex(i); }; void ActionObservationHistoryTree::SetSuccessor(Index aI, Index oI, ActionObservationHistoryTree* suc) { if (_m_nodeType == O_SUC) throw E("Trying ActionObservationHistoryTree::SetSuccessor(Index aI, Index oI, ActionObservationHistoryTree* suc) on O_SUC node"); //first see if necessary to create a new intermediate node ActionObservationHistoryTree* oNode; if(this->TreeNode::ExistsSuccessor(aI)) oNode = (ActionObservationHistoryTree*) this->TreeNode::GetSuccessor(aI); else //we need to create an intermediate node { oNode = new ActionObservationHistoryTree(O_SUC); //which is the aI'th successor of this node this->TreeNode::SetSuccessor(aI, oNode); } //let oNode point to the actual successor. //Note: SetSuccessor with 1 index should give no problem for O_SUC nodes oNode->TreeNode::SetSuccessor(oI, suc); } ActionObservationHistoryTree* ActionObservationHistoryTree::GetSuccessor(Index aI, Index oI) { if (_m_nodeType == O_SUC) throw E("Trying ActionObservationHistoryTree::SetSuccessor(Index aI, Index oI, ActionObservationHistoryTree* suc) on O_SUC node"); ActionObservationHistoryTree* suc; try { suc = (ActionObservationHistoryTree*) //we only put ActionObservationHistoryTree*'s in here so this cast //should be allowed. this->TreeNode::GetSuccessor(aI) //the oNode ->TreeNode::GetSuccessor(oI); } catch(EInvalidIndex& e) { // successor does not exist, so we should create it, see // JointActionObservationHistoryTree::GetSuccessor for // inspiration throw(E("ActionObservationHistoryTree::GetSuccessor generation of successors on the fly not yet implemented")); } return(suc); } ActionObservationHistory* ActionObservationHistoryTree:: GetActionObservationHistory() const { if (_m_nodeType == O_SUC) throw E("Trying ActionObservationHistoryTree::GetActionObservationHistory() on O_SUC node"); return GetContainedElement(); } void ActionObservationHistoryTree::Print() const { if(_m_nodeType == A_SUC) { if(_m_containedElem == 0) return; cout << "index: "; if(_m_indexValid) cout<< _m_index; else cout << "INVALID"; cout << " - "; _m_containedElem->Print(); cout <*>::const_iterator it = _m_successor.begin(); while(it != _m_successor.end()) { pair< LIndex, TreeNode*> p = *it; TreeNode* suc_tn = p.second; //we only put ActionObservationHistoryTree's as successors, so //we can do this: ActionObservationHistoryTree* suc_aoht = static_cast(suc_tn); if(suc_aoht != 0) suc_aoht->Print(); else throw E("ActionObservationHistoryTree::Print() - encountered"\ "a successor of this ActionObservationHistoryTree that is 0 (NULL) "); it++; } } madp-0.4/src/support/PaxHeaders.5405/ProblemFireFightingGraph.cpp0000644000000000000000000000013212717644275021646 xustar0030 mtime=1463765181.309710511 30 atime=1463765181.305710543 30 ctime=1463765201.713547549 madp-0.4/src/support/ProblemFireFightingGraph.cpp0000664000372100037210000001223712717644275022507 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "ProblemFireFightingGraph.h" using namespace std; //Default constructor ProblemFireFightingGraph::ProblemFireFightingGraph(size_t nrAgents, size_t nrFireLevels, double multipleAgentExtinguishProb, bool initialize ) : // number of houses is one more than the number of agents ProblemFireFightingFactored(nrAgents,nrAgents+1,nrFireLevels, // no move cost for Graph version 0.0, // dont include positions of agents in state false, multipleAgentExtinguishProb, // don't initialize PFFF, need to do // that after PFFG has been // constructed false) { if(initialize) InitializePFFF(); } string ProblemFireFightingGraph::SoftPrintBriefDescription() const { stringstream ss; ss << "FireFightingGraph_" << _m_nrAgents << "_" << _m_nrHouses << "_" << _m_nrFireLevels << GetMultipleAgentExtinguishProbString(); return ss.str(); } string ProblemFireFightingGraph::SoftPrintDescription() const { stringstream ss; ss << "The factored graph FireFighting problem with " << _m_nrAgents << " Agents, " << _m_nrHouses << " houses and " << _m_nrFireLevels << " fire levels for each house.\n" << "Factored means that the state space is factored, and thus that the \ transition, observation and reward models are represented in a factored way \ (by a 2DBN and a collection of reward functions).\n\ Graph means that the actions of the agents are restricted (i.e., they \ can go to only two houses)"; return ss.str(); } void ProblemFireFightingGraph::ConstructActions() { //cout << "ProblemFireFightingGraph::ConstructActions()" << endl; for(Index agentIndex=0; agentIndex < GetNrAgents(); agentIndex++) { AddAction(agentIndex, "left", "Go and fight fire on the house on the left"); AddAction(agentIndex, "right", "Go and fight fire on the house on the right"); } } size_t ProblemFireFightingGraph::GetAgentLocation(Index action, Index agI) const { return(agI+action); } Scope ProblemFireFightingGraph::GetHousesAgentInfluences(Index agI) const { Scope houses; // agent's actions only influence two houses houses.Insert(agI); houses.Insert(agI+1); return(houses); } void ProblemFireFightingGraph::SetYScopes() { //specify connections for the 2DBN #if DEBUG_PFFF cout << "About to set the SoIs for all next-stage(NS) SFs Y..."< 0) { x.Insert(yI-1); a.Insert(yI-1); } x.Insert(yI); // firelevel of house yI influenced by its PS firelevel if(yI < (_m_nrHouses-1) ) { x.Insert(yI+1); a.Insert(yI); } SetSoI_Y( yI, //sfacI = 0 -> house 0 x, a, //allAgents, Scope("<>") // no interdependencies between next-stage FLs ); } } void ProblemFireFightingGraph::SetOScopes() { #if DEBUG_PFFF cout << "About to set the SoIs for all observations O..."< house 0 agSC, GetHousesAgentInfluences(oI), Scope("<>") // no interdependencies between next-stage Os ); } } size_t ProblemFireFightingGraph::GetNrAgentsAtHouse(const std::vector< Index>& As, Index hI) const { Index y = hI; const Scope& ASoI_y = GetASoI_Y(y); size_t nrAgentsAtLocation = 0; for(Index i=0; i < ASoI_y.size(); i++) { Index agI = ASoI_y.at(i); if(GetAgentLocation(As.at(i),agI) == hI) nrAgentsAtLocation++; } return(nrAgentsAtLocation); } madp-0.4/src/support/PaxHeaders.5405/IndividualBeliefJESP.h0000644000000000000000000000013212717644275020324 xustar0030 mtime=1463765181.533708721 30 atime=1463765181.533708721 30 ctime=1463765201.665547933 madp-0.4/src/support/IndividualBeliefJESP.h0000664000372100037210000000661012717644275021163 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _INDIVIDUALBELIEFJESP_H_ #define _INDIVIDUALBELIEFJESP_H_ 1 /* the include directives */ #include #include #include "Globals.h" #include "IndexTools.h" #include "Belief.h" class JointPolicyPureVector; class PlanningUnitMADPDiscrete; //forward declaration to avoid including each other /** * \brief IndividualBeliefJESP stores individual beliefs for the JESP * algorithm. */ class IndividualBeliefJESP : public Belief { private: ///pointer to PlanningUnitMADPDiscrete /**(might be 0 when this belief is not associated with a PUMADP) */ const PlanningUnitMADPDiscrete* _m_pumadp; ///The time step this belief belongs to. Index _m_stage; ///the number of agents size_t _m_nrAgents; ///The agent for which this belief is Index _m_agentI; ///The Scope of the others Scope _m_others; ///The number of observation histories of agents != _m_agentI std::vector _m_nrOH_others; ///a vector describing the size of the belief: _m_sizeVec= std::vector _m_sizeVec; ///the step-size cache for eIndex <-> conversion size_t * _m_stepsizeSJOH; ///the step-size cache for joHistJ <-> conversion size_t * _m_stepsizeJOHOH; protected: public: /**This constructor usess it arguments to set additional information */ IndividualBeliefJESP(Index agentI, Index stage, const PlanningUnitMADPDiscrete& pu); // Constructor which copies \a belief in this joint belief. // IndividualBeliefJESP(const IndividualBeliefJESPInterface &belief); /// Destructor ~IndividualBeliefJESP(); IndividualBeliefJESP& operator= (const IndividualBeliefJESP& o); // Constructor, destructor and copy assignment. ///The individual belief update /**This gets only an \em individual action \a lastAI and \em individual * observation \a newOI, as its arguments. */ double Update(const IndividualBeliefJESP& b_prev, Index lastAI, Index newOI, const JointPolicyPureVector* jpol); ///Get the state corresponding to augmented state index eI Index GetStateIndex(Index eI) const; ///Get the vector with others' observation history indices cor.to eI std::vector GetOthersObservationHistIndex(Index eI) const; // Index GetAugmentedStateIndex(Index sI, const std::vector& oHist_others) const; std::string SoftPrint() const; void Print() const { std::cout << SoftPrint();}; }; inline Index IndividualBeliefJESP::GetStateIndex(Index eI) const { std::vector v = IndexTools::JointToIndividualIndicesStepSize(eI, _m_stepsizeSJOH, 2); return v.at(0); } #endif /* !_INDIVIDUALBELIEFJESP_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/Interface_ProblemToPolicyDiscretePure.h0000644000000000000000000000013212717644275024025 xustar0030 mtime=1463765181.521708818 30 atime=1463765181.517708849 30 ctime=1463765201.625548252 madp-0.4/src/support/Interface_ProblemToPolicyDiscretePure.h0000664000372100037210000000636612717644275024674 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _INTERFACE_PROBLEMTOPOLICYDISCRETEPURE_H_ #define _INTERFACE_PROBLEMTOPOLICYDISCRETEPURE_H_ 1 /* the include directives */ #include #include #include #include "Globals.h" #include "Interface_ProblemToPolicyDiscrete.h" #include "EOverflow.h" class Interface_ProblemToPolicyDiscretePure; typedef boost::shared_ptr I_PtPDpure_sharedPtr; typedef boost::shared_ptr I_PtPDpure_constPtr; /** \brief Interface_ProblemToPolicyDiscretePure is an interface from * discrete problems to pure policies. * * I.e., it defines functions that must be implemented by a derived * (problem) class such that it can be used to construct a * JointPolicyPureVector / PolicyPureVector. * * (the class (Joint)PolicyPureVector refers to objects implementing * this interface. ) */ class Interface_ProblemToPolicyDiscretePure : public Interface_ProblemToPolicyDiscrete { private: protected: public: /// Destructor. virtual ~Interface_ProblemToPolicyDiscretePure() {} /// Get the number of policies for an agent, given the policy's domain. LIndex GetNrPolicies(Index ag, PolicyGlobals::PolicyDomainCategory cat, size_t depth=MAXHORIZON) const { #if 0 // don't use powl(), we want to detect overflow LIndex nr_pols = static_cast( powl( GetNrActions(ag), GetNrPolicyDomainElements(ag,cat,depth) )); #endif LIndex nrPols=1; for(size_t k=0;k!=GetNrPolicyDomainElements(ag,cat,depth);++k) { LIndex nrPolsOld=nrPols; nrPols*=GetNrActions(ag); if(nrPols #include "Globals.h" #include "PlanningUnitFactoredDecPOMDPDiscrete.h" /** \brief NullPlannerFactored represents a planner which does nothing, but * can be used to instantiate a PlanningUnitDecFactoredPOMDPDiscrete. */ class NullPlannerFactored : public PlanningUnitFactoredDecPOMDPDiscrete { private: protected: public: /// (default) Constructor NullPlannerFactored(FactoredDecPOMDPDiscreteInterface* p); NullPlannerFactored(size_t horizon, FactoredDecPOMDPDiscreteInterface* p); NullPlannerFactored(const PlanningUnitMADPDiscreteParameters ¶ms, size_t horizon, FactoredDecPOMDPDiscreteInterface* p); ~NullPlannerFactored(){}; /// Only present to satisfy the interface. void Plan(); /// Only present to satisfy the interface. double GetExpectedReward() const; /// Only present to satisfy the interface. boost::shared_ptr GetJointPolicy(); }; #endif /* !_NULLPLANNERFACTORED_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/JointObservationHistoryTree.h0000644000000000000000000000013112717644275022143 xustar0029 mtime=1463765181.57770837 30 atime=1463765181.573708403 30 ctime=1463765201.657547996 madp-0.4/src/support/JointObservationHistoryTree.h0000664000372100037210000000646312717644275023011 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _JOINTOBSERVATIONHISTORYTREE_H_ #define _JOINTOBSERVATIONHISTORYTREE_H_ 1 /* the include directives */ #include #include #include "Globals.h" #include "JointObservationHistory.h" #include "TreeNode.h" //#include "PlanningUnitMADPDiscrete.h" class PlanningUnitMADPDiscrete; //forward declaration to avoid including each other /** * \brief JointObservationHistoryTree is a class that represents a * wrapper for the JointObservationHistory class. * * An JointObservationHistoryTree actually represents a node in the * tree of observation histories. But each node also specifies a * (sub-)tree so there is no actual difference between a tree and a * node. This implementation assumes that ObservationHistories are * always contained in exactly 1 JointObservationHistoryTree: i.e., * deleting an object of JointObservationHistoryTree will free the * memory of the node and the subtree represented by it as well as the * memory of all the contained ObservationHistories. * */ class JointObservationHistoryTree : public TreeNode { private: protected: public: // Constructor, destructor and copy assignment. /// Create a joint observation history tree for joh JointObservationHistoryTree(JointObservationHistory *const joh) : TreeNode (joh) {} /// Copy constructor. JointObservationHistoryTree(const JointObservationHistoryTree& a): TreeNode (a) {} /// Destructor. //~JointObservationHistoryTree(); //operators: //data manipulation (set) functions: //get (data) functions: ///Returns the length of the contained ObservationHistory. size_t GetLength() const { return( (GetContainedElement()!=0)? GetContainedElement()->GetLength() : throw E("_m_jObsHist undefined!") ); }; JointObservationHistory* GetJointObservationHistory() const {return GetContainedElement();} JointObservationHistoryTree* GetPredecessor() const {return (JointObservationHistoryTree*) //we know we only put pointers //to JointObservationHistoryTree's in here. TreeNode::GetPredecessor();} JointObservationHistoryTree* GetSuccessor(Index jObsI) {return (JointObservationHistoryTree*) //we know we only put pointers //to JointObservationHistoryTree's in here. TreeNode::GetSuccessor(jObsI);} }; #endif /* !_JOINTOBSERVATIONHISTORYTREE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/FactoredStateAOHDistribution.cpp0000644000000000000000000000013212717644275022456 xustar0030 mtime=1463765181.561708498 30 atime=1463765181.561708498 30 ctime=1463765201.733547389 madp-0.4/src/support/FactoredStateAOHDistribution.cpp0000664000372100037210000000224412717644275023314 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "FactoredStateAOHDistribution.h" using namespace std; /* //Default constructor FactoredStateAOHDistribution::FactoredStateAOHDistribution() { } //Copy constructor. FactoredStateAOHDistribution::FactoredStateAOHDistribution(const FactoredStateAOHDistribution& o) { } //Destructor FactoredStateAOHDistribution::~FactoredStateAOHDistribution() { } //Copy assignment operator FactoredStateAOHDistribution& FactoredStateAOHDistribution::operator= (const FactoredStateAOHDistribution& o) { if (this == &o) return *this; // Gracefully handle self assignment // Put the normal assignment duties here... return *this; } */ madp-0.4/src/support/PaxHeaders.5405/JointActionHistoryTree.h0000644000000000000000000000013212717644275021066 xustar0030 mtime=1463765181.473709201 30 atime=1463765181.473709201 30 ctime=1463765201.653548029 madp-0.4/src/support/JointActionHistoryTree.h0000664000372100037210000000217612717644275021730 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _JOINTACTIONHISTORYTREE_H_ #define _JOINTACTIONHISTORYTREE_H_ 1 #include "TreeNode.h" /** \class JointActionHistoryTree * \brief JointActionHistoryTree is a wrapper for JointActionHistory. * * See JointObservationHistoryTree for documentation. */ class JointActionHistory; //redefine GetJointActionHistory to be the function GetContainedElement #define GetJointActionHistory GetContainedElement typedef TreeNode JointActionHistoryTree; #endif /* !_JOINTACTIONHISTORYTREE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/FactoredStateAOHDistribution.h0000644000000000000000000000013212717644275022123 xustar0030 mtime=1463765181.509708914 30 atime=1463765181.509708914 30 ctime=1463765201.665547933 madp-0.4/src/support/FactoredStateAOHDistribution.h0000664000372100037210000000561312717644275022764 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _FACTOREDSTATEAOHDISTRIBUTION_H_ #define _FACTOREDSTATEAOHDISTRIBUTION_H_ 1 /* the include directives */ #include "Globals.h" class Scope; class JointPolicyDiscretePure; class FactoredStateDistribution; /** \brief FactoredStateAOHDistribution is a class that represents * a factored probability distribution over both states and * action-observation histories. */ class FactoredStateAOHDistribution { private: protected: public: // Constructor, destructor and copy assignment. /// Destructor. virtual ~FactoredStateAOHDistribution(){}; /* /// (default) Constructor FactoredStateAOHDistribution(); /// Copy constructor. FactoredStateAOHDistribution(const FactoredStateAOHDistribution& a); /// Copy assignment operator FactoredStateAOHDistribution& operator= (const FactoredStateAOHDistribution& o); */ ///function that returns the prob. of the AOH of a subset of agents /**this function takes * \li \a agSC - the scope that specifies the subset of agents * \li \a aohI - a vector of indices of individual AOHs for each of the * specified agents. * * Note: relT indicates that the individual AOH indices are relative * within the stage for which this distribution is. */ virtual double GetAOHProb_relT( const Scope& agSc, const std::vector& aohI) const = 0; virtual double GetOHProb_relT( const Scope& agSc, const std::vector& ohI) const = 0; virtual double GetXOHProb_relT( const Scope& sfSc, const std::vector& sfacI, const Scope& agSc, const std::vector& ohI ) const = 0; virtual double GetXProb( const Scope& sfSc, const std::vector& sfValI) const=0; virtual void Update(const JointPolicyDiscretePure& pol)=0; virtual void InitializeFromISD( const FactoredStateDistribution * d)=0; virtual void SanityCheck()=0; virtual FactoredStateAOHDistribution *Clone() const = 0; }; #endif /* !_FACTOREDSTATEAOHDISTRIBUTION_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/ActionObservationHistoryTree.h0000644000000000000000000000013212717644275022276 xustar0030 mtime=1463765181.509708914 30 atime=1463765181.509708914 30 ctime=1463765201.649548061 madp-0.4/src/support/ActionObservationHistoryTree.h0000664000372100037210000000705112717644275023135 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _ACTIONOBSERVATIONHISTORYTREE_H_ #define _ACTIONOBSERVATIONHISTORYTREE_H_ 1 /* the include directives */ #include #include "Globals.h" #include "TreeNode.h" #include "ActionObservationHistory.h" /// ActionObservationHistoryTree is a wrapper for ActionObservationHistory. /** * A class derived from #TreeNode, and similar to #ObservationHistoryTree: * * ActionObservationHistoryTree is a class that represents a wrapper for the * ActionObservationHistory class. An ActionObservationHistoryTree actually * represents a node in the tree of observation histories. But each node also * specifies a (sub-)tree so there is no actual difference between a tree and * a node. * This implementation assumes that ActionObservationHistories are always * contained in exactly 1 ActionObservationHistoryTree: i.e., deleting an * object of ActionObservationHistoryTree will free the memory of the node and * the subtree represented by it as well as the memory of all the contained * ActionObservationHistories. * * A difference with #ObservationHistoryTree is that here a successor is * specified by 2 indices. One option would be to combine these into a joint * index, but this would add calculation every time we're traversing the tree. * Instead this class defines 2 types of nodes: ones that specify the * action successor (A_SUC) and ones that specify the observation successor * (O_SUC). * Only the A_SUC nodes contain actual ActionObservationHistories, O_SUC nodes * are 'intermediate nodes' and no operations should be performed on them. * */ class ActionObservationHistoryTree : public TreeNode { private: enum aoh_t {A_SUC, O_SUC}; aoh_t _m_nodeType; protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor ActionObservationHistoryTree(aoh_t nt = A_SUC) : TreeNode(), _m_nodeType(nt){}; /// Create a joint observation history tree for joh ActionObservationHistoryTree(ActionObservationHistory *const aoh, aoh_t nt = A_SUC); /// Copy constructor. ActionObservationHistoryTree(const ActionObservationHistoryTree& a); //operators: //data manipulation (set) functions: /// Sets the index to i. void SetIndex(Index i); /// Sets the sucI'th successor of this TreeNode to suc. /** (e.g. the successor for observation number sucI). */ void SetSuccessor(Index aI, Index oI,ActionObservationHistoryTree* suc); //get (data) functions: /// Get the successor node. ActionObservationHistoryTree* GetSuccessor(Index aI, Index oI); /// Get the history stored in this node. ActionObservationHistory* GetActionObservationHistory() const; void Print() const; }; #endif /* !_ACTIONOBSERVATIONHISTORYTREE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/Makefile.in0000644000000000000000000000013212717644311016326 xustar0030 mtime=1463765193.365614223 30 atime=1463765200.141560105 30 ctime=1463765201.609548379 madp-0.4/src/support/Makefile.in0000664000372100037210000030643312717644311017173 0ustar00fransfrans00000000000000# Makefile.in generated by automake 1.14.1 from Makefile.am. # @configure_input@ # Copyright (C) 1994-2013 Free Software Foundation, Inc. # This Makefile.in is free software; the Free Software Foundation # gives unlimited permission to copy and/or distribute it, # with or without modifications, as long as this notice is preserved. # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY, to the extent permitted by law; without # even the implied warranty of MERCHANTABILITY or FITNESS FOR A # PARTICULAR PURPOSE. @SET_MAKE@ # Contains several project-wide Makefile options ##################################################################### # Optional software packages to be used, check configuration.h to # enable them # For using arbitrary length integers # Should be set if USE_ARBITRARY_PRECISION_INDEX is set to 1 #GMP_LD=-lgmpxx -lgmp VPATH = @srcdir@ am__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)' am__make_running_with_option = \ case $${target_option-} in \ ?) ;; \ *) echo "am__make_running_with_option: internal error: invalid" \ "target option '$${target_option-}' specified" >&2; \ exit 1;; \ esac; \ has_opt=no; \ sane_makeflags=$$MAKEFLAGS; \ if $(am__is_gnu_make); then \ sane_makeflags=$$MFLAGS; \ else \ case $$MAKEFLAGS in \ *\\[\ \ ]*) \ bs=\\; \ sane_makeflags=`printf '%s\n' "$$MAKEFLAGS" \ | sed "s/$$bs$$bs[$$bs $$bs ]*//g"`;; \ esac; \ fi; \ skip_next=no; \ strip_trailopt () \ { \ flg=`printf '%s\n' "$$flg" | sed "s/$$1.*$$//"`; \ }; \ for flg in $$sane_makeflags; do \ test $$skip_next = yes && { skip_next=no; continue; }; \ case $$flg in \ *=*|--*) continue;; \ -*I) strip_trailopt 'I'; skip_next=yes;; \ -*I?*) strip_trailopt 'I';; \ -*O) strip_trailopt 'O'; skip_next=yes;; \ -*O?*) strip_trailopt 'O';; \ -*l) strip_trailopt 'l'; skip_next=yes;; \ -*l?*) strip_trailopt 'l';; \ -[dEDm]) skip_next=yes;; \ -[JT]) skip_next=yes;; \ esac; \ case $$flg in \ *$$target_option*) has_opt=yes; break;; \ esac; \ done; \ test $$has_opt = yes am__make_dryrun = (target_option=n; $(am__make_running_with_option)) am__make_keepgoing = (target_option=k; $(am__make_running_with_option)) pkgdatadir = $(datadir)/@PACKAGE@ pkgincludedir = $(includedir)/@PACKAGE@ pkglibdir = $(libdir)/@PACKAGE@ pkglibexecdir = $(libexecdir)/@PACKAGE@ am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd install_sh_DATA = $(install_sh) -c -m 644 install_sh_PROGRAM = $(install_sh) -c install_sh_SCRIPT = $(install_sh) -c INSTALL_HEADER = $(INSTALL_DATA) transform = $(program_transform_name) NORMAL_INSTALL = : PRE_INSTALL = : POST_INSTALL = : NORMAL_UNINSTALL = : PRE_UNINSTALL = : POST_UNINSTALL = : build_triplet = @build@ host_triplet = @host@ DIST_COMMON = $(top_srcdir)/src/Makefile.custom \ $(top_srcdir)/config/Make-rules $(srcdir)/Makefile.in \ $(srcdir)/Makefile.am $(top_srcdir)/depcomp \ $(libMADPSupport_la_HEADERS) @DARWIN_TRUE@am__append_1 = -DDARWIN subdir = src/support ACLOCAL_M4 = $(top_srcdir)/aclocal.m4 am__aclocal_m4_deps = $(top_srcdir)/m4/ac_cplex.m4 \ $(top_srcdir)/m4/libtool.m4 $(top_srcdir)/m4/ltoptions.m4 \ $(top_srcdir)/m4/ltsugar.m4 $(top_srcdir)/m4/ltversion.m4 \ $(top_srcdir)/m4/lt~obsolete.m4 $(top_srcdir)/configure.ac am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \ $(ACLOCAL_M4) mkinstalldirs = $(install_sh) -d CONFIG_HEADER = $(top_builddir)/config.h CONFIG_CLEAN_FILES = CONFIG_CLEAN_VPATH_FILES = am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; am__vpath_adj = case $$p in \ $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \ *) f=$$p;; \ esac; am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`; am__install_max = 40 am__nobase_strip_setup = \ srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'` am__nobase_strip = \ for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||" am__nobase_list = $(am__nobase_strip_setup); \ for p in $$list; do echo "$$p $$p"; done | \ sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \ $(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \ if (++n[$$2] == $(am__install_max)) \ { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \ END { for (dir in files) print dir, files[dir] }' am__base_list = \ sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \ sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g' am__uninstall_files_from_dir = { \ test -z "$$files" \ || { test ! -d "$$dir" && test ! -f "$$dir" && test ! -r "$$dir"; } \ || { echo " ( cd '$$dir' && rm -f" $$files ")"; \ $(am__cd) "$$dir" && rm -f $$files; }; \ } am__installdirs = "$(DESTDIR)$(libdir)" \ "$(DESTDIR)$(libMADPSupport_ladir)" LTLIBRARIES = $(lib_LTLIBRARIES) $(noinst_LTLIBRARIES) libMADPSupport_la_LIBADD = am__objects_1 = libMADPSupport_la-PolicyDiscrete.lo \ libMADPSupport_la-PolicyDiscretePure.lo \ libMADPSupport_la-PolicyPureVector.lo \ libMADPSupport_la-JointPolicyDiscrete.lo \ libMADPSupport_la-JointPolicyDiscretePure.lo \ libMADPSupport_la-PartialJointPolicy.lo \ libMADPSupport_la-PartialJointPolicyDiscretePure.lo \ libMADPSupport_la-PartialJointPolicyPureVector.lo \ libMADPSupport_la-JointPolicyPureVector.lo \ libMADPSupport_la-JPolComponent_VectorImplementation.lo am__objects_2 = am__objects_3 = $(am__objects_2) am__objects_4 = libMADPSupport_la-ProblemType.lo \ libMADPSupport_la-ProblemDecTiger.lo \ libMADPSupport_la-ProblemDecTigerWithCreaks.lo \ libMADPSupport_la-ProblemFireFighting.lo \ libMADPSupport_la-ProblemFireFightingFactored.lo \ libMADPSupport_la-ProblemFireFightingGraph.lo \ libMADPSupport_la-ProblemFOBSFireFightingFactored.lo \ libMADPSupport_la-ProblemFOBSFireFightingGraph.lo \ libMADPSupport_la-ProblemAloha.lo am__objects_5 = libMADPSupport_la-ObservationHistory.lo \ libMADPSupport_la-ObservationHistoryTree.lo \ libMADPSupport_la-JointObservationHistory.lo \ libMADPSupport_la-ActionHistory.lo \ libMADPSupport_la-JointActionHistory.lo \ libMADPSupport_la-JointActionObservationHistory.lo \ libMADPSupport_la-JointActionObservationHistoryTree.lo \ libMADPSupport_la-ActionObservationHistory.lo \ libMADPSupport_la-ActionObservationHistoryTree.lo am__objects_6 = libMADPSupport_la-Belief.lo \ libMADPSupport_la-JointBelief.lo \ libMADPSupport_la-JointBeliefEventDriven.lo \ libMADPSupport_la-BeliefSparse.lo \ libMADPSupport_la-JointBeliefSparse.lo \ libMADPSupport_la-FactoredStateAOHDistribution.lo \ libMADPSupport_la-IndividualBeliefJESP.lo \ libMADPSupport_la-FSAOHDist_NECOF.lo am__objects_7 = libMADPSupport_la-PlanningUnitMADPDiscrete.lo \ libMADPSupport_la-PlanningUnitDecPOMDPDiscrete.lo \ libMADPSupport_la-PlanningUnitMADPDiscreteParameters.lo \ libMADPSupport_la-PlanningUnitFactoredDecPOMDPDiscrete.lo \ libMADPSupport_la-PlanningUnitTOIDecPOMDPDiscrete.lo \ libMADPSupport_la-NullPlanner.lo \ libMADPSupport_la-NullPlannerTOI.lo \ libMADPSupport_la-NullPlannerFactored.lo am__objects_8 = libMADPSupport_la-Timing.lo \ libMADPSupport_la-TimedAlgorithm.lo \ libMADPSupport_la-FixedCapacityPriorityQueue.lo \ libMADPSupport_la-MADPDiscreteStatistics.lo \ libMADPSupport_la-QTable.lo am__objects_9 = $(am__objects_1) $(am__objects_3) $(am__objects_4) \ $(am__objects_3) $(am__objects_5) $(am__objects_3) \ $(am__objects_6) $(am__objects_3) $(am__objects_7) \ $(am__objects_3) $(am__objects_8) $(am__objects_3) am_libMADPSupport_la_OBJECTS = $(am__objects_9) libMADPSupport_la_OBJECTS = $(am_libMADPSupport_la_OBJECTS) AM_V_lt = $(am__v_lt_@AM_V@) am__v_lt_ = $(am__v_lt_@AM_DEFAULT_V@) am__v_lt_0 = --silent am__v_lt_1 = libMADPSupport_la_LINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX \ $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=link $(CXXLD) \ $(AM_CXXFLAGS) $(CXXFLAGS) $(libMADPSupport_la_LDFLAGS) \ $(LDFLAGS) -o $@ AM_V_P = $(am__v_P_@AM_V@) am__v_P_ = $(am__v_P_@AM_DEFAULT_V@) am__v_P_0 = false am__v_P_1 = : AM_V_GEN = $(am__v_GEN_@AM_V@) am__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@) am__v_GEN_0 = @echo " GEN " $@; am__v_GEN_1 = AM_V_at = $(am__v_at_@AM_V@) am__v_at_ = $(am__v_at_@AM_DEFAULT_V@) am__v_at_0 = @ am__v_at_1 = DEFAULT_INCLUDES = -I.@am__isrc@ -I$(top_builddir) depcomp = $(SHELL) $(top_srcdir)/depcomp am__depfiles_maybe = depfiles am__mv = mv -f CXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \ $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) LTCXXCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) \ $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \ $(AM_CXXFLAGS) $(CXXFLAGS) AM_V_CXX = $(am__v_CXX_@AM_V@) am__v_CXX_ = $(am__v_CXX_@AM_DEFAULT_V@) am__v_CXX_0 = @echo " CXX " $@; am__v_CXX_1 = CXXLD = $(CXX) CXXLINK = $(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CXXLD) $(AM_CXXFLAGS) \ $(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@ AM_V_CXXLD = $(am__v_CXXLD_@AM_V@) am__v_CXXLD_ = $(am__v_CXXLD_@AM_DEFAULT_V@) am__v_CXXLD_0 = @echo " CXXLD " $@; am__v_CXXLD_1 = COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \ $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) LTCOMPILE = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) \ $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \ $(AM_CFLAGS) $(CFLAGS) AM_V_CC = $(am__v_CC_@AM_V@) am__v_CC_ = $(am__v_CC_@AM_DEFAULT_V@) am__v_CC_0 = @echo " CC " $@; am__v_CC_1 = CCLD = $(CC) LINK = $(LIBTOOL) $(AM_V_lt) --tag=CC $(AM_LIBTOOLFLAGS) \ $(LIBTOOLFLAGS) --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \ $(AM_LDFLAGS) $(LDFLAGS) -o $@ AM_V_CCLD = $(am__v_CCLD_@AM_V@) am__v_CCLD_ = $(am__v_CCLD_@AM_DEFAULT_V@) am__v_CCLD_0 = @echo " CCLD " $@; am__v_CCLD_1 = SOURCES = $(libMADPSupport_la_SOURCES) DIST_SOURCES = $(libMADPSupport_la_SOURCES) am__can_run_installinfo = \ case $$AM_UPDATE_INFO_DIR in \ n|no|NO) false;; \ *) (install-info --version) >/dev/null 2>&1;; \ esac HEADERS = $(libMADPSupport_la_HEADERS) am__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP) # Read a list of newline-separated strings from the standard input, # and print each of them once, without duplicates. Input order is # *not* preserved. am__uniquify_input = $(AWK) '\ BEGIN { nonempty = 0; } \ { items[$$0] = 1; nonempty = 1; } \ END { if (nonempty) { for (i in items) print i; }; } \ ' # Make sure the list of sources is unique. This is necessary because, # e.g., the same source file might be shared among _SOURCES variables # for different programs/libraries. am__define_uniq_tagged_files = \ list='$(am__tagged_files)'; \ unique=`for i in $$list; do \ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \ done | $(am__uniquify_input)` ETAGS = etags CTAGS = ctags DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST) ACLOCAL = @ACLOCAL@ AMTAR = @AMTAR@ AM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@ AR = @AR@ AUTOCONF = @AUTOCONF@ AUTOHEADER = @AUTOHEADER@ AUTOMAKE = @AUTOMAKE@ AWK = @AWK@ CC = @CC@ CCDEPMODE = @CCDEPMODE@ CFLAGS = @CFLAGS@ CPLEX_INCLUDES = @CPLEX_INCLUDES@ CPLEX_LDFLAGS = @CPLEX_LDFLAGS@ CPLEX_LIBS = @CPLEX_LIBS@ CPP = @CPP@ CPPFLAGS = @CPPFLAGS@ CSTANDARD = @CSTANDARD@ CSTD = @CSTD@ CSTD11 = @CSTD11@ CSTDGNU = @CSTDGNU@ CSTDGNU11 = @CSTDGNU11@ CXX = @CXX@ CXXCPP = @CXXCPP@ CXXDEPMODE = @CXXDEPMODE@ CXXFLAGS = @CXXFLAGS@ CYGPATH_W = @CYGPATH_W@ DEFS = @DEFS@ DEPDIR = @DEPDIR@ DLLTOOL = @DLLTOOL@ DSYMUTIL = @DSYMUTIL@ DUMPBIN = @DUMPBIN@ ECHO_C = @ECHO_C@ ECHO_N = @ECHO_N@ ECHO_T = @ECHO_T@ EGREP = @EGREP@ EXEEXT = @EXEEXT@ FGREP = @FGREP@ GREP = @GREP@ INSTALL = @INSTALL@ INSTALL_DATA = @INSTALL_DATA@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_SCRIPT = @INSTALL_SCRIPT@ INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@ LD = @LD@ LDFLAGS = @LDFLAGS@ LIBOBJS = @LIBOBJS@ LIBS = @LIBS@ LIBTOOL = @LIBTOOL@ LIPO = @LIPO@ LN_S = @LN_S@ LTLIBOBJS = @LTLIBOBJS@ MAKEINFO = @MAKEINFO@ MANIFEST_TOOL = @MANIFEST_TOOL@ MKDIR_P = @MKDIR_P@ NM = @NM@ NMEDIT = @NMEDIT@ OBJDUMP = @OBJDUMP@ OBJEXT = @OBJEXT@ OTOOL = @OTOOL@ OTOOL64 = @OTOOL64@ PACKAGE = @PACKAGE@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_URL = @PACKAGE_URL@ PACKAGE_VERSION = @PACKAGE_VERSION@ PATH_SEPARATOR = @PATH_SEPARATOR@ POW_LIB = @POW_LIB@ RANLIB = @RANLIB@ SED = @SED@ SET_MAKE = @SET_MAKE@ SHELL = @SHELL@ STRIP = @STRIP@ VERSION = @VERSION@ abs_builddir = @abs_builddir@ abs_srcdir = @abs_srcdir@ abs_top_builddir = @abs_top_builddir@ abs_top_srcdir = @abs_top_srcdir@ ac_ct_AR = @ac_ct_AR@ ac_ct_CC = @ac_ct_CC@ ac_ct_CXX = @ac_ct_CXX@ ac_ct_DUMPBIN = @ac_ct_DUMPBIN@ am__include = @am__include@ am__leading_dot = @am__leading_dot@ am__quote = @am__quote@ am__tar = @am__tar@ am__untar = @am__untar@ bindir = @bindir@ build = @build@ build_alias = @build_alias@ build_cpu = @build_cpu@ build_os = @build_os@ build_vendor = @build_vendor@ builddir = @builddir@ datadir = @datadir@ datarootdir = @datarootdir@ docdir = @docdir@ dvidir = @dvidir@ exec_prefix = @exec_prefix@ host = @host@ host_alias = @host_alias@ host_cpu = @host_cpu@ host_os = @host_os@ host_vendor = @host_vendor@ htmldir = @htmldir@ includedir = @includedir@ infodir = @infodir@ install_sh = @install_sh@ libdir = @libdir@ libexecdir = @libexecdir@ localedir = @localedir@ localstatedir = @localstatedir@ mandir = @mandir@ mkdir_p = @mkdir_p@ oldincludedir = @oldincludedir@ pdfdir = @pdfdir@ prefix = @prefix@ program_transform_name = @program_transform_name@ psdir = @psdir@ sbindir = @sbindir@ sharedstatedir = @sharedstatedir@ srcdir = @srcdir@ sysconfdir = @sysconfdir@ target_alias = @target_alias@ top_build_prefix = @top_build_prefix@ top_builddir = @top_builddir@ top_srcdir = @top_srcdir@ LIBDAI_NORMAL = $(top_builddir)/src/libDAI/libDAI.la LIBDAI_INCLUDES = -I$(top_srcdir)/src/libDAI ##################################################################### # Compiler flags # the debug flags used - according to # http://sourceware.org/gdb/current/onlinedocs/gdb_13.html#SEC111 # dwarf-2 is best for c++ and gdb # -fno-inline should make things easier to debug DEBUG_FLAGS = -O0 -gdwarf-2 -fno-inline # Optimization flags used for building normal and profiling libraries. # -DNDEBUG speeds up the boost::numeric::ublas operations CPP_OPTIMIZATION_FLAGS = -O3 -DNDEBUG #machine architectecture specific flags #XXX: the following does not work on MacOS! (leave empty to resolve) # Matthijs: is it not just a problem with using a GCC version that is # too old to support this? MARCH_FLAGS = -march=native # automatically picks the correct settings for your system @FOUND_LIBXML2_TRUE@XML2_CXXFLAGS = `xml2-config --cflags` #default flags throughout all MADP: MADP_CXXFLAGS = -Wall -pipe $(MARCH_FLAGS) $(CSTANDARD) $(XML2_CXXFLAGS) MADP_CPPFLAGS = MADP_CFLAGS = ##################################################################### # The final include path MADP_INCLUDES = \ $(INCLUDE) \ $(LIBDAI_INCLUDES)\ -I$(top_srcdir)/src/boost MADP_LD = # $(LPSOLVE_LD) ##################################################################### # Lists of libs to be linked with binaries. # Note that the linking order matters, in order to correctly resolve symbols MADPLIBS_NORMAL_BASE = \ $(top_builddir)/src/base/libMADPBase.la MADPLIBS_NORMAL_BASE_SUPPORT = \ $(top_builddir)/src/support/libMADPSupport.la \ $(MADPLIBS_NORMAL_BASE) MADPLIBS_NORMAL_BASE_PARSER = \ $(top_builddir)/src/parser/libMADPParser.la \ $(MADPLIBS_NORMAL_BASE) \ $(LIBPOMDPSOLVE_NORMAL) $(LIBLPSOLVEOLD_NORMAL) $(LIBMDP_NORMAL) $(LIBLASPACK_NORMAL) MADPLIBS_NORMAL_BASE_PARSER_SUPPORT = \ $(top_builddir)/src/support/libMADPSupport.la \ $(MADPLIBS_NORMAL_BASE_PARSER) MADPLIBS_NORMAL = $(top_builddir)/src/madp/libMADP.la # $(top_builddir)/src/planning/libMADPPlanning.la \ # $(MADPLIBS_NORMAL_BASE_PARSER_SUPPORT) \ # $(LIBDAI_NORMAL) MADPLIBS_NORMAL_NOPARSER_NOPLANNING = $(MADPLIBS_NORMAL_BASE) MADPLIBS_NORMAL_NOPLANNING = $(MADPLIBS_NORMAL_BASE_PARSER_SUPPORT) MADPLIBS_NORMAL_NOPARSER = $(MADPLIBS_NORMAL) ############## # Includedirs, libdirs, libs and cflags for all programs INCLUDEPATH = -I$(top_srcdir)/src/base\ -I$(top_srcdir)/src/include -I$(top_srcdir)/src/support \ $(MADP_INCLUDES) AM_LDFLAGS = LDADD = AM_CPPFLAGS = -Wall -pipe $(MARCH_FLAGS) $(INCLUDEPATH) \ $(am__append_1) AM_CXXFLAGS = $(CSTANDARD) HISTORY_CPPFILES = ObservationHistory.cpp ObservationHistoryTree.cpp\ JointObservationHistory.cpp \ ActionHistory.cpp JointActionHistory.cpp\ JointActionObservationHistory.cpp JointActionObservationHistoryTree.cpp\ ActionObservationHistory.cpp ActionObservationHistoryTree.cpp HISTORY_HFILES = $(HISTORY_CPPFILES:.cpp=.h) TreeNode.h ActionHistoryTree.h\ JointActionHistoryTree.h History.h IndividualHistory.h JointHistory.h\ JointObservationHistoryTree.h POLICY_CPPFILES = \ PolicyDiscrete.cpp PolicyDiscretePure.cpp PolicyPureVector.cpp \ JointPolicyDiscrete.cpp JointPolicyDiscretePure.cpp\ PartialJointPolicy.cpp \ PartialJointPolicyDiscretePure.cpp \ PartialJointPolicyPureVector.cpp \ JointPolicyPureVector.cpp \ JPolComponent_VectorImplementation.cpp POLICY_HFILES = $(POLICY_CPPFILES:.cpp=.h) Interface_ProblemToPolicyDiscrete.h \ Interface_ProblemToPolicyDiscretePure.h Policy.h \ JointPolicy.h PolicyGlobals.h PROBLEM_CPPFILES = \ ProblemType.cpp\ ProblemDecTiger.cpp\ ProblemDecTigerWithCreaks.cpp\ ProblemFireFighting.cpp\ ProblemFireFightingFactored.cpp\ ProblemFireFightingGraph.cpp\ ProblemFOBSFireFightingFactored.cpp\ ProblemFOBSFireFightingGraph.cpp\ ProblemAloha.cpp PROBLEM_HFILES = $(PROBLEM_CPPFILES:.cpp=.h) BELIEF_CPPFILES = Belief.cpp JointBelief.cpp JointBeliefEventDriven.cpp\ BeliefSparse.cpp JointBeliefSparse.cpp \ FactoredStateAOHDistribution.cpp\ IndividualBeliefJESP.cpp\ FSAOHDist_NECOF.cpp BELIEF_HFILES = $(BELIEF_CPPFILES:.cpp=.h)\ JointBeliefInterface.h BeliefInterface.h BeliefIteratorInterface.h\ BeliefIterator.h BeliefIteratorSparse.h BeliefIteratorGeneric.h PLANNINGUNIT_CPPFILES = \ PlanningUnit.h \ PlanningUnitMADPDiscrete.cpp\ PlanningUnitDecPOMDPDiscrete.cpp PlanningUnitMADPDiscreteParameters.cpp\ PlanningUnitFactoredDecPOMDPDiscrete.cpp\ PlanningUnitTOIDecPOMDPDiscrete.cpp \ NullPlanner.cpp NullPlannerTOI.cpp NullPlannerFactored.cpp PLANNINGUNIT_HFILES = $(PLANNINGUNIT_CPPFILES:.cpp=.h) MISC_CPPFILES = Timing.cpp TimedAlgorithm.cpp \ FixedCapacityPriorityQueue.cpp \ MADPDiscreteStatistics.cpp\ QTable.cpp MISC_HFILES = $(MISC_CPPFILES:.cpp=.h) VectorSet.h SUPPORT_FILES = $(POLICY_CPPFILES) $(POLICY_HFILES) \ $(PROBLEM_CPPFILES) $(PROBLEM_HFILES)\ $(HISTORY_CPPFILES) $(HISTORY_HFILES) \ $(BELIEF_CPPFILES) $(BELIEF_HFILES)\ $(PLANNINGUNIT_CPPFILES) $(PLANNINGUNIT_HFILES)\ $(MISC_CPPFILES) $(MISC_HFILES) ############### # All DYNAMIC libraries # the LTLIBRARIES (LibTool-libraries) # the library to be build... lib_LTLIBRARIES = noinst_LTLIBRARIES = libMADPSupport.la # sources for the library: libMADPSupport_la_SOURCES = $(SUPPORT_FILES) libMADPSupport_la_CPPFLAGS = $(AM_CPPFLAGS) $(CPP_OPTIMIZATION_FLAGS) libMADPSupport_la_LDFLAGS = $(AM_LDFLAGS) # for installing the headers libMADPSupport_ladir = $(pkgincludedir)#/support libMADPSupport_la_HEADERS = $(POLICY_HFILES) $(PROBLEM_HFILES)\ $(HISTORY_HFILES) $(BELIEF_HFILES) $(PLANNINGUNIT_HFILES) $(MISC_HFILES) all: all-am .SUFFIXES: .SUFFIXES: .cpp .lo .o .obj $(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(top_srcdir)/src/Makefile.custom $(top_srcdir)/config/Make-rules $(am__configure_deps) @for dep in $?; do \ case '$(am__configure_deps)' in \ *$$dep*) \ ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \ && { if test -f $@; then exit 0; else break; fi; }; \ exit 1;; \ esac; \ done; \ echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu src/support/Makefile'; \ $(am__cd) $(top_srcdir) && \ $(AUTOMAKE) --gnu src/support/Makefile .PRECIOUS: Makefile Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status @case '$?' in \ *config.status*) \ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \ *) \ echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \ cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \ esac; $(top_srcdir)/src/Makefile.custom $(top_srcdir)/config/Make-rules: $(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(top_srcdir)/configure: $(am__configure_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(ACLOCAL_M4): $(am__aclocal_m4_deps) cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh $(am__aclocal_m4_deps): install-libLTLIBRARIES: $(lib_LTLIBRARIES) @$(NORMAL_INSTALL) @list='$(lib_LTLIBRARIES)'; test -n "$(libdir)" || list=; \ list2=; for p in $$list; do \ if test -f $$p; then \ list2="$$list2 $$p"; \ else :; fi; \ done; \ test -z "$$list2" || { \ echo " $(MKDIR_P) '$(DESTDIR)$(libdir)'"; \ $(MKDIR_P) "$(DESTDIR)$(libdir)" || exit 1; \ echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 '$(DESTDIR)$(libdir)'"; \ $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=install $(INSTALL) $(INSTALL_STRIP_FLAG) $$list2 "$(DESTDIR)$(libdir)"; \ } uninstall-libLTLIBRARIES: @$(NORMAL_UNINSTALL) @list='$(lib_LTLIBRARIES)'; test -n "$(libdir)" || list=; \ for p in $$list; do \ $(am__strip_dir) \ echo " $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f '$(DESTDIR)$(libdir)/$$f'"; \ $(LIBTOOL) $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=uninstall rm -f "$(DESTDIR)$(libdir)/$$f"; \ done clean-libLTLIBRARIES: -test -z "$(lib_LTLIBRARIES)" || rm -f $(lib_LTLIBRARIES) @list='$(lib_LTLIBRARIES)'; \ locs=`for p in $$list; do echo $$p; done | \ sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \ sort -u`; \ test -z "$$locs" || { \ echo rm -f $${locs}; \ rm -f $${locs}; \ } clean-noinstLTLIBRARIES: -test -z "$(noinst_LTLIBRARIES)" || rm -f $(noinst_LTLIBRARIES) @list='$(noinst_LTLIBRARIES)'; \ locs=`for p in $$list; do echo $$p; done | \ sed 's|^[^/]*$$|.|; s|/[^/]*$$||; s|$$|/so_locations|' | \ sort -u`; \ test -z "$$locs" || { \ echo rm -f $${locs}; \ rm -f $${locs}; \ } libMADPSupport.la: $(libMADPSupport_la_OBJECTS) $(libMADPSupport_la_DEPENDENCIES) $(EXTRA_libMADPSupport_la_DEPENDENCIES) $(AM_V_CXXLD)$(libMADPSupport_la_LINK) $(libMADPSupport_la_OBJECTS) $(libMADPSupport_la_LIBADD) $(LIBS) mostlyclean-compile: -rm -f *.$(OBJEXT) distclean-compile: -rm -f *.tab.c @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-ActionHistory.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-ActionObservationHistory.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-ActionObservationHistoryTree.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-Belief.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-BeliefSparse.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-FSAOHDist_NECOF.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-FactoredStateAOHDistribution.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-FixedCapacityPriorityQueue.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-IndividualBeliefJESP.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-JPolComponent_VectorImplementation.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-JointActionHistory.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-JointActionObservationHistory.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-JointActionObservationHistoryTree.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-JointBelief.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-JointBeliefEventDriven.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-JointBeliefSparse.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-JointObservationHistory.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-JointPolicyDiscrete.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-JointPolicyDiscretePure.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-JointPolicyPureVector.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-MADPDiscreteStatistics.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-NullPlanner.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-NullPlannerFactored.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-NullPlannerTOI.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-ObservationHistory.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-ObservationHistoryTree.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-PartialJointPolicy.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-PartialJointPolicyDiscretePure.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-PartialJointPolicyPureVector.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-PlanningUnitDecPOMDPDiscrete.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-PlanningUnitFactoredDecPOMDPDiscrete.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-PlanningUnitMADPDiscrete.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-PlanningUnitMADPDiscreteParameters.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-PlanningUnitTOIDecPOMDPDiscrete.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-PolicyDiscrete.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-PolicyDiscretePure.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-PolicyPureVector.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-ProblemAloha.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-ProblemDecTiger.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-ProblemDecTigerWithCreaks.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-ProblemFOBSFireFightingFactored.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-ProblemFOBSFireFightingGraph.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-ProblemFireFighting.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-ProblemFireFightingFactored.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-ProblemFireFightingGraph.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-ProblemType.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-QTable.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-TimedAlgorithm.Plo@am__quote@ @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/libMADPSupport_la-Timing.Plo@am__quote@ .cpp.o: @am__fastdepCXX_TRUE@ $(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.o$$||'`;\ @am__fastdepCXX_TRUE@ $(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\ @am__fastdepCXX_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.Po @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ $< .cpp.obj: @am__fastdepCXX_TRUE@ $(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.obj$$||'`;\ @am__fastdepCXX_TRUE@ $(CXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\ @am__fastdepCXX_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.Po @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'` .cpp.lo: @am__fastdepCXX_TRUE@ $(AM_V_CXX)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.lo$$||'`;\ @am__fastdepCXX_TRUE@ $(LTCXXCOMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\ @am__fastdepCXX_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LTCXXCOMPILE) -c -o $@ $< libMADPSupport_la-PolicyDiscrete.lo: PolicyDiscrete.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-PolicyDiscrete.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-PolicyDiscrete.Tpo -c -o libMADPSupport_la-PolicyDiscrete.lo `test -f 'PolicyDiscrete.cpp' || echo '$(srcdir)/'`PolicyDiscrete.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-PolicyDiscrete.Tpo $(DEPDIR)/libMADPSupport_la-PolicyDiscrete.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='PolicyDiscrete.cpp' object='libMADPSupport_la-PolicyDiscrete.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-PolicyDiscrete.lo `test -f 'PolicyDiscrete.cpp' || echo '$(srcdir)/'`PolicyDiscrete.cpp libMADPSupport_la-PolicyDiscretePure.lo: PolicyDiscretePure.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-PolicyDiscretePure.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-PolicyDiscretePure.Tpo -c -o libMADPSupport_la-PolicyDiscretePure.lo `test -f 'PolicyDiscretePure.cpp' || echo '$(srcdir)/'`PolicyDiscretePure.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-PolicyDiscretePure.Tpo $(DEPDIR)/libMADPSupport_la-PolicyDiscretePure.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='PolicyDiscretePure.cpp' object='libMADPSupport_la-PolicyDiscretePure.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-PolicyDiscretePure.lo `test -f 'PolicyDiscretePure.cpp' || echo '$(srcdir)/'`PolicyDiscretePure.cpp libMADPSupport_la-PolicyPureVector.lo: PolicyPureVector.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-PolicyPureVector.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-PolicyPureVector.Tpo -c -o libMADPSupport_la-PolicyPureVector.lo `test -f 'PolicyPureVector.cpp' || echo '$(srcdir)/'`PolicyPureVector.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-PolicyPureVector.Tpo $(DEPDIR)/libMADPSupport_la-PolicyPureVector.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='PolicyPureVector.cpp' object='libMADPSupport_la-PolicyPureVector.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-PolicyPureVector.lo `test -f 'PolicyPureVector.cpp' || echo '$(srcdir)/'`PolicyPureVector.cpp libMADPSupport_la-JointPolicyDiscrete.lo: JointPolicyDiscrete.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-JointPolicyDiscrete.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-JointPolicyDiscrete.Tpo -c -o libMADPSupport_la-JointPolicyDiscrete.lo `test -f 'JointPolicyDiscrete.cpp' || echo '$(srcdir)/'`JointPolicyDiscrete.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-JointPolicyDiscrete.Tpo $(DEPDIR)/libMADPSupport_la-JointPolicyDiscrete.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='JointPolicyDiscrete.cpp' object='libMADPSupport_la-JointPolicyDiscrete.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-JointPolicyDiscrete.lo `test -f 'JointPolicyDiscrete.cpp' || echo '$(srcdir)/'`JointPolicyDiscrete.cpp libMADPSupport_la-JointPolicyDiscretePure.lo: JointPolicyDiscretePure.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-JointPolicyDiscretePure.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-JointPolicyDiscretePure.Tpo -c -o libMADPSupport_la-JointPolicyDiscretePure.lo `test -f 'JointPolicyDiscretePure.cpp' || echo '$(srcdir)/'`JointPolicyDiscretePure.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-JointPolicyDiscretePure.Tpo $(DEPDIR)/libMADPSupport_la-JointPolicyDiscretePure.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='JointPolicyDiscretePure.cpp' object='libMADPSupport_la-JointPolicyDiscretePure.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-JointPolicyDiscretePure.lo `test -f 'JointPolicyDiscretePure.cpp' || echo '$(srcdir)/'`JointPolicyDiscretePure.cpp libMADPSupport_la-PartialJointPolicy.lo: PartialJointPolicy.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-PartialJointPolicy.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-PartialJointPolicy.Tpo -c -o libMADPSupport_la-PartialJointPolicy.lo `test -f 'PartialJointPolicy.cpp' || echo '$(srcdir)/'`PartialJointPolicy.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-PartialJointPolicy.Tpo $(DEPDIR)/libMADPSupport_la-PartialJointPolicy.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='PartialJointPolicy.cpp' object='libMADPSupport_la-PartialJointPolicy.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-PartialJointPolicy.lo `test -f 'PartialJointPolicy.cpp' || echo '$(srcdir)/'`PartialJointPolicy.cpp libMADPSupport_la-PartialJointPolicyDiscretePure.lo: PartialJointPolicyDiscretePure.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-PartialJointPolicyDiscretePure.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-PartialJointPolicyDiscretePure.Tpo -c -o libMADPSupport_la-PartialJointPolicyDiscretePure.lo `test -f 'PartialJointPolicyDiscretePure.cpp' || echo '$(srcdir)/'`PartialJointPolicyDiscretePure.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-PartialJointPolicyDiscretePure.Tpo $(DEPDIR)/libMADPSupport_la-PartialJointPolicyDiscretePure.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='PartialJointPolicyDiscretePure.cpp' object='libMADPSupport_la-PartialJointPolicyDiscretePure.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-PartialJointPolicyDiscretePure.lo `test -f 'PartialJointPolicyDiscretePure.cpp' || echo '$(srcdir)/'`PartialJointPolicyDiscretePure.cpp libMADPSupport_la-PartialJointPolicyPureVector.lo: PartialJointPolicyPureVector.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-PartialJointPolicyPureVector.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-PartialJointPolicyPureVector.Tpo -c -o libMADPSupport_la-PartialJointPolicyPureVector.lo `test -f 'PartialJointPolicyPureVector.cpp' || echo '$(srcdir)/'`PartialJointPolicyPureVector.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-PartialJointPolicyPureVector.Tpo $(DEPDIR)/libMADPSupport_la-PartialJointPolicyPureVector.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='PartialJointPolicyPureVector.cpp' object='libMADPSupport_la-PartialJointPolicyPureVector.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-PartialJointPolicyPureVector.lo `test -f 'PartialJointPolicyPureVector.cpp' || echo '$(srcdir)/'`PartialJointPolicyPureVector.cpp libMADPSupport_la-JointPolicyPureVector.lo: JointPolicyPureVector.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-JointPolicyPureVector.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-JointPolicyPureVector.Tpo -c -o libMADPSupport_la-JointPolicyPureVector.lo `test -f 'JointPolicyPureVector.cpp' || echo '$(srcdir)/'`JointPolicyPureVector.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-JointPolicyPureVector.Tpo $(DEPDIR)/libMADPSupport_la-JointPolicyPureVector.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='JointPolicyPureVector.cpp' object='libMADPSupport_la-JointPolicyPureVector.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-JointPolicyPureVector.lo `test -f 'JointPolicyPureVector.cpp' || echo '$(srcdir)/'`JointPolicyPureVector.cpp libMADPSupport_la-JPolComponent_VectorImplementation.lo: JPolComponent_VectorImplementation.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-JPolComponent_VectorImplementation.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-JPolComponent_VectorImplementation.Tpo -c -o libMADPSupport_la-JPolComponent_VectorImplementation.lo `test -f 'JPolComponent_VectorImplementation.cpp' || echo '$(srcdir)/'`JPolComponent_VectorImplementation.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-JPolComponent_VectorImplementation.Tpo $(DEPDIR)/libMADPSupport_la-JPolComponent_VectorImplementation.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='JPolComponent_VectorImplementation.cpp' object='libMADPSupport_la-JPolComponent_VectorImplementation.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-JPolComponent_VectorImplementation.lo `test -f 'JPolComponent_VectorImplementation.cpp' || echo '$(srcdir)/'`JPolComponent_VectorImplementation.cpp libMADPSupport_la-ProblemType.lo: ProblemType.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-ProblemType.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-ProblemType.Tpo -c -o libMADPSupport_la-ProblemType.lo `test -f 'ProblemType.cpp' || echo '$(srcdir)/'`ProblemType.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-ProblemType.Tpo $(DEPDIR)/libMADPSupport_la-ProblemType.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='ProblemType.cpp' object='libMADPSupport_la-ProblemType.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-ProblemType.lo `test -f 'ProblemType.cpp' || echo '$(srcdir)/'`ProblemType.cpp libMADPSupport_la-ProblemDecTiger.lo: ProblemDecTiger.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-ProblemDecTiger.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-ProblemDecTiger.Tpo -c -o libMADPSupport_la-ProblemDecTiger.lo `test -f 'ProblemDecTiger.cpp' || echo '$(srcdir)/'`ProblemDecTiger.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-ProblemDecTiger.Tpo $(DEPDIR)/libMADPSupport_la-ProblemDecTiger.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='ProblemDecTiger.cpp' object='libMADPSupport_la-ProblemDecTiger.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-ProblemDecTiger.lo `test -f 'ProblemDecTiger.cpp' || echo '$(srcdir)/'`ProblemDecTiger.cpp libMADPSupport_la-ProblemDecTigerWithCreaks.lo: ProblemDecTigerWithCreaks.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-ProblemDecTigerWithCreaks.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-ProblemDecTigerWithCreaks.Tpo -c -o libMADPSupport_la-ProblemDecTigerWithCreaks.lo `test -f 'ProblemDecTigerWithCreaks.cpp' || echo '$(srcdir)/'`ProblemDecTigerWithCreaks.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-ProblemDecTigerWithCreaks.Tpo $(DEPDIR)/libMADPSupport_la-ProblemDecTigerWithCreaks.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='ProblemDecTigerWithCreaks.cpp' object='libMADPSupport_la-ProblemDecTigerWithCreaks.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-ProblemDecTigerWithCreaks.lo `test -f 'ProblemDecTigerWithCreaks.cpp' || echo '$(srcdir)/'`ProblemDecTigerWithCreaks.cpp libMADPSupport_la-ProblemFireFighting.lo: ProblemFireFighting.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-ProblemFireFighting.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-ProblemFireFighting.Tpo -c -o libMADPSupport_la-ProblemFireFighting.lo `test -f 'ProblemFireFighting.cpp' || echo '$(srcdir)/'`ProblemFireFighting.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-ProblemFireFighting.Tpo $(DEPDIR)/libMADPSupport_la-ProblemFireFighting.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='ProblemFireFighting.cpp' object='libMADPSupport_la-ProblemFireFighting.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-ProblemFireFighting.lo `test -f 'ProblemFireFighting.cpp' || echo '$(srcdir)/'`ProblemFireFighting.cpp libMADPSupport_la-ProblemFireFightingFactored.lo: ProblemFireFightingFactored.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-ProblemFireFightingFactored.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-ProblemFireFightingFactored.Tpo -c -o libMADPSupport_la-ProblemFireFightingFactored.lo `test -f 'ProblemFireFightingFactored.cpp' || echo '$(srcdir)/'`ProblemFireFightingFactored.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-ProblemFireFightingFactored.Tpo $(DEPDIR)/libMADPSupport_la-ProblemFireFightingFactored.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='ProblemFireFightingFactored.cpp' object='libMADPSupport_la-ProblemFireFightingFactored.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-ProblemFireFightingFactored.lo `test -f 'ProblemFireFightingFactored.cpp' || echo '$(srcdir)/'`ProblemFireFightingFactored.cpp libMADPSupport_la-ProblemFireFightingGraph.lo: ProblemFireFightingGraph.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-ProblemFireFightingGraph.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-ProblemFireFightingGraph.Tpo -c -o libMADPSupport_la-ProblemFireFightingGraph.lo `test -f 'ProblemFireFightingGraph.cpp' || echo '$(srcdir)/'`ProblemFireFightingGraph.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-ProblemFireFightingGraph.Tpo $(DEPDIR)/libMADPSupport_la-ProblemFireFightingGraph.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='ProblemFireFightingGraph.cpp' object='libMADPSupport_la-ProblemFireFightingGraph.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-ProblemFireFightingGraph.lo `test -f 'ProblemFireFightingGraph.cpp' || echo '$(srcdir)/'`ProblemFireFightingGraph.cpp libMADPSupport_la-ProblemFOBSFireFightingFactored.lo: ProblemFOBSFireFightingFactored.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-ProblemFOBSFireFightingFactored.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-ProblemFOBSFireFightingFactored.Tpo -c -o libMADPSupport_la-ProblemFOBSFireFightingFactored.lo `test -f 'ProblemFOBSFireFightingFactored.cpp' || echo '$(srcdir)/'`ProblemFOBSFireFightingFactored.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-ProblemFOBSFireFightingFactored.Tpo $(DEPDIR)/libMADPSupport_la-ProblemFOBSFireFightingFactored.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='ProblemFOBSFireFightingFactored.cpp' object='libMADPSupport_la-ProblemFOBSFireFightingFactored.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-ProblemFOBSFireFightingFactored.lo `test -f 'ProblemFOBSFireFightingFactored.cpp' || echo '$(srcdir)/'`ProblemFOBSFireFightingFactored.cpp libMADPSupport_la-ProblemFOBSFireFightingGraph.lo: ProblemFOBSFireFightingGraph.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-ProblemFOBSFireFightingGraph.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-ProblemFOBSFireFightingGraph.Tpo -c -o libMADPSupport_la-ProblemFOBSFireFightingGraph.lo `test -f 'ProblemFOBSFireFightingGraph.cpp' || echo '$(srcdir)/'`ProblemFOBSFireFightingGraph.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-ProblemFOBSFireFightingGraph.Tpo $(DEPDIR)/libMADPSupport_la-ProblemFOBSFireFightingGraph.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='ProblemFOBSFireFightingGraph.cpp' object='libMADPSupport_la-ProblemFOBSFireFightingGraph.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-ProblemFOBSFireFightingGraph.lo `test -f 'ProblemFOBSFireFightingGraph.cpp' || echo '$(srcdir)/'`ProblemFOBSFireFightingGraph.cpp libMADPSupport_la-ProblemAloha.lo: ProblemAloha.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-ProblemAloha.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-ProblemAloha.Tpo -c -o libMADPSupport_la-ProblemAloha.lo `test -f 'ProblemAloha.cpp' || echo '$(srcdir)/'`ProblemAloha.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-ProblemAloha.Tpo $(DEPDIR)/libMADPSupport_la-ProblemAloha.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='ProblemAloha.cpp' object='libMADPSupport_la-ProblemAloha.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-ProblemAloha.lo `test -f 'ProblemAloha.cpp' || echo '$(srcdir)/'`ProblemAloha.cpp libMADPSupport_la-ObservationHistory.lo: ObservationHistory.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-ObservationHistory.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-ObservationHistory.Tpo -c -o libMADPSupport_la-ObservationHistory.lo `test -f 'ObservationHistory.cpp' || echo '$(srcdir)/'`ObservationHistory.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-ObservationHistory.Tpo $(DEPDIR)/libMADPSupport_la-ObservationHistory.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='ObservationHistory.cpp' object='libMADPSupport_la-ObservationHistory.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-ObservationHistory.lo `test -f 'ObservationHistory.cpp' || echo '$(srcdir)/'`ObservationHistory.cpp libMADPSupport_la-ObservationHistoryTree.lo: ObservationHistoryTree.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-ObservationHistoryTree.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-ObservationHistoryTree.Tpo -c -o libMADPSupport_la-ObservationHistoryTree.lo `test -f 'ObservationHistoryTree.cpp' || echo '$(srcdir)/'`ObservationHistoryTree.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-ObservationHistoryTree.Tpo $(DEPDIR)/libMADPSupport_la-ObservationHistoryTree.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='ObservationHistoryTree.cpp' object='libMADPSupport_la-ObservationHistoryTree.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-ObservationHistoryTree.lo `test -f 'ObservationHistoryTree.cpp' || echo '$(srcdir)/'`ObservationHistoryTree.cpp libMADPSupport_la-JointObservationHistory.lo: JointObservationHistory.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-JointObservationHistory.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-JointObservationHistory.Tpo -c -o libMADPSupport_la-JointObservationHistory.lo `test -f 'JointObservationHistory.cpp' || echo '$(srcdir)/'`JointObservationHistory.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-JointObservationHistory.Tpo $(DEPDIR)/libMADPSupport_la-JointObservationHistory.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='JointObservationHistory.cpp' object='libMADPSupport_la-JointObservationHistory.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-JointObservationHistory.lo `test -f 'JointObservationHistory.cpp' || echo '$(srcdir)/'`JointObservationHistory.cpp libMADPSupport_la-ActionHistory.lo: ActionHistory.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-ActionHistory.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-ActionHistory.Tpo -c -o libMADPSupport_la-ActionHistory.lo `test -f 'ActionHistory.cpp' || echo '$(srcdir)/'`ActionHistory.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-ActionHistory.Tpo $(DEPDIR)/libMADPSupport_la-ActionHistory.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='ActionHistory.cpp' object='libMADPSupport_la-ActionHistory.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-ActionHistory.lo `test -f 'ActionHistory.cpp' || echo '$(srcdir)/'`ActionHistory.cpp libMADPSupport_la-JointActionHistory.lo: JointActionHistory.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-JointActionHistory.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-JointActionHistory.Tpo -c -o libMADPSupport_la-JointActionHistory.lo `test -f 'JointActionHistory.cpp' || echo '$(srcdir)/'`JointActionHistory.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-JointActionHistory.Tpo $(DEPDIR)/libMADPSupport_la-JointActionHistory.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='JointActionHistory.cpp' object='libMADPSupport_la-JointActionHistory.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-JointActionHistory.lo `test -f 'JointActionHistory.cpp' || echo '$(srcdir)/'`JointActionHistory.cpp libMADPSupport_la-JointActionObservationHistory.lo: JointActionObservationHistory.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-JointActionObservationHistory.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-JointActionObservationHistory.Tpo -c -o libMADPSupport_la-JointActionObservationHistory.lo `test -f 'JointActionObservationHistory.cpp' || echo '$(srcdir)/'`JointActionObservationHistory.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-JointActionObservationHistory.Tpo $(DEPDIR)/libMADPSupport_la-JointActionObservationHistory.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='JointActionObservationHistory.cpp' object='libMADPSupport_la-JointActionObservationHistory.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-JointActionObservationHistory.lo `test -f 'JointActionObservationHistory.cpp' || echo '$(srcdir)/'`JointActionObservationHistory.cpp libMADPSupport_la-JointActionObservationHistoryTree.lo: JointActionObservationHistoryTree.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-JointActionObservationHistoryTree.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-JointActionObservationHistoryTree.Tpo -c -o libMADPSupport_la-JointActionObservationHistoryTree.lo `test -f 'JointActionObservationHistoryTree.cpp' || echo '$(srcdir)/'`JointActionObservationHistoryTree.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-JointActionObservationHistoryTree.Tpo $(DEPDIR)/libMADPSupport_la-JointActionObservationHistoryTree.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='JointActionObservationHistoryTree.cpp' object='libMADPSupport_la-JointActionObservationHistoryTree.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-JointActionObservationHistoryTree.lo `test -f 'JointActionObservationHistoryTree.cpp' || echo '$(srcdir)/'`JointActionObservationHistoryTree.cpp libMADPSupport_la-ActionObservationHistory.lo: ActionObservationHistory.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-ActionObservationHistory.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-ActionObservationHistory.Tpo -c -o libMADPSupport_la-ActionObservationHistory.lo `test -f 'ActionObservationHistory.cpp' || echo '$(srcdir)/'`ActionObservationHistory.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-ActionObservationHistory.Tpo $(DEPDIR)/libMADPSupport_la-ActionObservationHistory.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='ActionObservationHistory.cpp' object='libMADPSupport_la-ActionObservationHistory.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-ActionObservationHistory.lo `test -f 'ActionObservationHistory.cpp' || echo '$(srcdir)/'`ActionObservationHistory.cpp libMADPSupport_la-ActionObservationHistoryTree.lo: ActionObservationHistoryTree.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-ActionObservationHistoryTree.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-ActionObservationHistoryTree.Tpo -c -o libMADPSupport_la-ActionObservationHistoryTree.lo `test -f 'ActionObservationHistoryTree.cpp' || echo '$(srcdir)/'`ActionObservationHistoryTree.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-ActionObservationHistoryTree.Tpo $(DEPDIR)/libMADPSupport_la-ActionObservationHistoryTree.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='ActionObservationHistoryTree.cpp' object='libMADPSupport_la-ActionObservationHistoryTree.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-ActionObservationHistoryTree.lo `test -f 'ActionObservationHistoryTree.cpp' || echo '$(srcdir)/'`ActionObservationHistoryTree.cpp libMADPSupport_la-Belief.lo: Belief.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-Belief.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-Belief.Tpo -c -o libMADPSupport_la-Belief.lo `test -f 'Belief.cpp' || echo '$(srcdir)/'`Belief.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-Belief.Tpo $(DEPDIR)/libMADPSupport_la-Belief.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='Belief.cpp' object='libMADPSupport_la-Belief.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-Belief.lo `test -f 'Belief.cpp' || echo '$(srcdir)/'`Belief.cpp libMADPSupport_la-JointBelief.lo: JointBelief.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-JointBelief.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-JointBelief.Tpo -c -o libMADPSupport_la-JointBelief.lo `test -f 'JointBelief.cpp' || echo '$(srcdir)/'`JointBelief.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-JointBelief.Tpo $(DEPDIR)/libMADPSupport_la-JointBelief.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='JointBelief.cpp' object='libMADPSupport_la-JointBelief.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-JointBelief.lo `test -f 'JointBelief.cpp' || echo '$(srcdir)/'`JointBelief.cpp libMADPSupport_la-JointBeliefEventDriven.lo: JointBeliefEventDriven.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-JointBeliefEventDriven.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-JointBeliefEventDriven.Tpo -c -o libMADPSupport_la-JointBeliefEventDriven.lo `test -f 'JointBeliefEventDriven.cpp' || echo '$(srcdir)/'`JointBeliefEventDriven.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-JointBeliefEventDriven.Tpo $(DEPDIR)/libMADPSupport_la-JointBeliefEventDriven.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='JointBeliefEventDriven.cpp' object='libMADPSupport_la-JointBeliefEventDriven.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-JointBeliefEventDriven.lo `test -f 'JointBeliefEventDriven.cpp' || echo '$(srcdir)/'`JointBeliefEventDriven.cpp libMADPSupport_la-BeliefSparse.lo: BeliefSparse.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-BeliefSparse.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-BeliefSparse.Tpo -c -o libMADPSupport_la-BeliefSparse.lo `test -f 'BeliefSparse.cpp' || echo '$(srcdir)/'`BeliefSparse.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-BeliefSparse.Tpo $(DEPDIR)/libMADPSupport_la-BeliefSparse.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='BeliefSparse.cpp' object='libMADPSupport_la-BeliefSparse.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-BeliefSparse.lo `test -f 'BeliefSparse.cpp' || echo '$(srcdir)/'`BeliefSparse.cpp libMADPSupport_la-JointBeliefSparse.lo: JointBeliefSparse.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-JointBeliefSparse.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-JointBeliefSparse.Tpo -c -o libMADPSupport_la-JointBeliefSparse.lo `test -f 'JointBeliefSparse.cpp' || echo '$(srcdir)/'`JointBeliefSparse.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-JointBeliefSparse.Tpo $(DEPDIR)/libMADPSupport_la-JointBeliefSparse.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='JointBeliefSparse.cpp' object='libMADPSupport_la-JointBeliefSparse.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-JointBeliefSparse.lo `test -f 'JointBeliefSparse.cpp' || echo '$(srcdir)/'`JointBeliefSparse.cpp libMADPSupport_la-FactoredStateAOHDistribution.lo: FactoredStateAOHDistribution.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-FactoredStateAOHDistribution.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-FactoredStateAOHDistribution.Tpo -c -o libMADPSupport_la-FactoredStateAOHDistribution.lo `test -f 'FactoredStateAOHDistribution.cpp' || echo '$(srcdir)/'`FactoredStateAOHDistribution.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-FactoredStateAOHDistribution.Tpo $(DEPDIR)/libMADPSupport_la-FactoredStateAOHDistribution.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='FactoredStateAOHDistribution.cpp' object='libMADPSupport_la-FactoredStateAOHDistribution.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-FactoredStateAOHDistribution.lo `test -f 'FactoredStateAOHDistribution.cpp' || echo '$(srcdir)/'`FactoredStateAOHDistribution.cpp libMADPSupport_la-IndividualBeliefJESP.lo: IndividualBeliefJESP.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-IndividualBeliefJESP.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-IndividualBeliefJESP.Tpo -c -o libMADPSupport_la-IndividualBeliefJESP.lo `test -f 'IndividualBeliefJESP.cpp' || echo '$(srcdir)/'`IndividualBeliefJESP.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-IndividualBeliefJESP.Tpo $(DEPDIR)/libMADPSupport_la-IndividualBeliefJESP.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='IndividualBeliefJESP.cpp' object='libMADPSupport_la-IndividualBeliefJESP.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-IndividualBeliefJESP.lo `test -f 'IndividualBeliefJESP.cpp' || echo '$(srcdir)/'`IndividualBeliefJESP.cpp libMADPSupport_la-FSAOHDist_NECOF.lo: FSAOHDist_NECOF.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-FSAOHDist_NECOF.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-FSAOHDist_NECOF.Tpo -c -o libMADPSupport_la-FSAOHDist_NECOF.lo `test -f 'FSAOHDist_NECOF.cpp' || echo '$(srcdir)/'`FSAOHDist_NECOF.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-FSAOHDist_NECOF.Tpo $(DEPDIR)/libMADPSupport_la-FSAOHDist_NECOF.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='FSAOHDist_NECOF.cpp' object='libMADPSupport_la-FSAOHDist_NECOF.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-FSAOHDist_NECOF.lo `test -f 'FSAOHDist_NECOF.cpp' || echo '$(srcdir)/'`FSAOHDist_NECOF.cpp libMADPSupport_la-PlanningUnitMADPDiscrete.lo: PlanningUnitMADPDiscrete.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-PlanningUnitMADPDiscrete.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-PlanningUnitMADPDiscrete.Tpo -c -o libMADPSupport_la-PlanningUnitMADPDiscrete.lo `test -f 'PlanningUnitMADPDiscrete.cpp' || echo '$(srcdir)/'`PlanningUnitMADPDiscrete.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-PlanningUnitMADPDiscrete.Tpo $(DEPDIR)/libMADPSupport_la-PlanningUnitMADPDiscrete.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='PlanningUnitMADPDiscrete.cpp' object='libMADPSupport_la-PlanningUnitMADPDiscrete.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-PlanningUnitMADPDiscrete.lo `test -f 'PlanningUnitMADPDiscrete.cpp' || echo '$(srcdir)/'`PlanningUnitMADPDiscrete.cpp libMADPSupport_la-PlanningUnitDecPOMDPDiscrete.lo: PlanningUnitDecPOMDPDiscrete.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-PlanningUnitDecPOMDPDiscrete.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-PlanningUnitDecPOMDPDiscrete.Tpo -c -o libMADPSupport_la-PlanningUnitDecPOMDPDiscrete.lo `test -f 'PlanningUnitDecPOMDPDiscrete.cpp' || echo '$(srcdir)/'`PlanningUnitDecPOMDPDiscrete.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-PlanningUnitDecPOMDPDiscrete.Tpo $(DEPDIR)/libMADPSupport_la-PlanningUnitDecPOMDPDiscrete.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='PlanningUnitDecPOMDPDiscrete.cpp' object='libMADPSupport_la-PlanningUnitDecPOMDPDiscrete.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-PlanningUnitDecPOMDPDiscrete.lo `test -f 'PlanningUnitDecPOMDPDiscrete.cpp' || echo '$(srcdir)/'`PlanningUnitDecPOMDPDiscrete.cpp libMADPSupport_la-PlanningUnitMADPDiscreteParameters.lo: PlanningUnitMADPDiscreteParameters.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-PlanningUnitMADPDiscreteParameters.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-PlanningUnitMADPDiscreteParameters.Tpo -c -o libMADPSupport_la-PlanningUnitMADPDiscreteParameters.lo `test -f 'PlanningUnitMADPDiscreteParameters.cpp' || echo '$(srcdir)/'`PlanningUnitMADPDiscreteParameters.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-PlanningUnitMADPDiscreteParameters.Tpo $(DEPDIR)/libMADPSupport_la-PlanningUnitMADPDiscreteParameters.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='PlanningUnitMADPDiscreteParameters.cpp' object='libMADPSupport_la-PlanningUnitMADPDiscreteParameters.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-PlanningUnitMADPDiscreteParameters.lo `test -f 'PlanningUnitMADPDiscreteParameters.cpp' || echo '$(srcdir)/'`PlanningUnitMADPDiscreteParameters.cpp libMADPSupport_la-PlanningUnitFactoredDecPOMDPDiscrete.lo: PlanningUnitFactoredDecPOMDPDiscrete.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-PlanningUnitFactoredDecPOMDPDiscrete.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-PlanningUnitFactoredDecPOMDPDiscrete.Tpo -c -o libMADPSupport_la-PlanningUnitFactoredDecPOMDPDiscrete.lo `test -f 'PlanningUnitFactoredDecPOMDPDiscrete.cpp' || echo '$(srcdir)/'`PlanningUnitFactoredDecPOMDPDiscrete.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-PlanningUnitFactoredDecPOMDPDiscrete.Tpo $(DEPDIR)/libMADPSupport_la-PlanningUnitFactoredDecPOMDPDiscrete.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='PlanningUnitFactoredDecPOMDPDiscrete.cpp' object='libMADPSupport_la-PlanningUnitFactoredDecPOMDPDiscrete.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-PlanningUnitFactoredDecPOMDPDiscrete.lo `test -f 'PlanningUnitFactoredDecPOMDPDiscrete.cpp' || echo '$(srcdir)/'`PlanningUnitFactoredDecPOMDPDiscrete.cpp libMADPSupport_la-PlanningUnitTOIDecPOMDPDiscrete.lo: PlanningUnitTOIDecPOMDPDiscrete.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-PlanningUnitTOIDecPOMDPDiscrete.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-PlanningUnitTOIDecPOMDPDiscrete.Tpo -c -o libMADPSupport_la-PlanningUnitTOIDecPOMDPDiscrete.lo `test -f 'PlanningUnitTOIDecPOMDPDiscrete.cpp' || echo '$(srcdir)/'`PlanningUnitTOIDecPOMDPDiscrete.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-PlanningUnitTOIDecPOMDPDiscrete.Tpo $(DEPDIR)/libMADPSupport_la-PlanningUnitTOIDecPOMDPDiscrete.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='PlanningUnitTOIDecPOMDPDiscrete.cpp' object='libMADPSupport_la-PlanningUnitTOIDecPOMDPDiscrete.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-PlanningUnitTOIDecPOMDPDiscrete.lo `test -f 'PlanningUnitTOIDecPOMDPDiscrete.cpp' || echo '$(srcdir)/'`PlanningUnitTOIDecPOMDPDiscrete.cpp libMADPSupport_la-NullPlanner.lo: NullPlanner.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-NullPlanner.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-NullPlanner.Tpo -c -o libMADPSupport_la-NullPlanner.lo `test -f 'NullPlanner.cpp' || echo '$(srcdir)/'`NullPlanner.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-NullPlanner.Tpo $(DEPDIR)/libMADPSupport_la-NullPlanner.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='NullPlanner.cpp' object='libMADPSupport_la-NullPlanner.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-NullPlanner.lo `test -f 'NullPlanner.cpp' || echo '$(srcdir)/'`NullPlanner.cpp libMADPSupport_la-NullPlannerTOI.lo: NullPlannerTOI.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-NullPlannerTOI.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-NullPlannerTOI.Tpo -c -o libMADPSupport_la-NullPlannerTOI.lo `test -f 'NullPlannerTOI.cpp' || echo '$(srcdir)/'`NullPlannerTOI.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-NullPlannerTOI.Tpo $(DEPDIR)/libMADPSupport_la-NullPlannerTOI.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='NullPlannerTOI.cpp' object='libMADPSupport_la-NullPlannerTOI.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-NullPlannerTOI.lo `test -f 'NullPlannerTOI.cpp' || echo '$(srcdir)/'`NullPlannerTOI.cpp libMADPSupport_la-NullPlannerFactored.lo: NullPlannerFactored.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-NullPlannerFactored.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-NullPlannerFactored.Tpo -c -o libMADPSupport_la-NullPlannerFactored.lo `test -f 'NullPlannerFactored.cpp' || echo '$(srcdir)/'`NullPlannerFactored.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-NullPlannerFactored.Tpo $(DEPDIR)/libMADPSupport_la-NullPlannerFactored.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='NullPlannerFactored.cpp' object='libMADPSupport_la-NullPlannerFactored.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-NullPlannerFactored.lo `test -f 'NullPlannerFactored.cpp' || echo '$(srcdir)/'`NullPlannerFactored.cpp libMADPSupport_la-Timing.lo: Timing.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-Timing.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-Timing.Tpo -c -o libMADPSupport_la-Timing.lo `test -f 'Timing.cpp' || echo '$(srcdir)/'`Timing.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-Timing.Tpo $(DEPDIR)/libMADPSupport_la-Timing.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='Timing.cpp' object='libMADPSupport_la-Timing.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-Timing.lo `test -f 'Timing.cpp' || echo '$(srcdir)/'`Timing.cpp libMADPSupport_la-TimedAlgorithm.lo: TimedAlgorithm.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-TimedAlgorithm.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-TimedAlgorithm.Tpo -c -o libMADPSupport_la-TimedAlgorithm.lo `test -f 'TimedAlgorithm.cpp' || echo '$(srcdir)/'`TimedAlgorithm.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-TimedAlgorithm.Tpo $(DEPDIR)/libMADPSupport_la-TimedAlgorithm.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='TimedAlgorithm.cpp' object='libMADPSupport_la-TimedAlgorithm.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-TimedAlgorithm.lo `test -f 'TimedAlgorithm.cpp' || echo '$(srcdir)/'`TimedAlgorithm.cpp libMADPSupport_la-FixedCapacityPriorityQueue.lo: FixedCapacityPriorityQueue.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-FixedCapacityPriorityQueue.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-FixedCapacityPriorityQueue.Tpo -c -o libMADPSupport_la-FixedCapacityPriorityQueue.lo `test -f 'FixedCapacityPriorityQueue.cpp' || echo '$(srcdir)/'`FixedCapacityPriorityQueue.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-FixedCapacityPriorityQueue.Tpo $(DEPDIR)/libMADPSupport_la-FixedCapacityPriorityQueue.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='FixedCapacityPriorityQueue.cpp' object='libMADPSupport_la-FixedCapacityPriorityQueue.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-FixedCapacityPriorityQueue.lo `test -f 'FixedCapacityPriorityQueue.cpp' || echo '$(srcdir)/'`FixedCapacityPriorityQueue.cpp libMADPSupport_la-MADPDiscreteStatistics.lo: MADPDiscreteStatistics.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-MADPDiscreteStatistics.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-MADPDiscreteStatistics.Tpo -c -o libMADPSupport_la-MADPDiscreteStatistics.lo `test -f 'MADPDiscreteStatistics.cpp' || echo '$(srcdir)/'`MADPDiscreteStatistics.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-MADPDiscreteStatistics.Tpo $(DEPDIR)/libMADPSupport_la-MADPDiscreteStatistics.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='MADPDiscreteStatistics.cpp' object='libMADPSupport_la-MADPDiscreteStatistics.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-MADPDiscreteStatistics.lo `test -f 'MADPDiscreteStatistics.cpp' || echo '$(srcdir)/'`MADPDiscreteStatistics.cpp libMADPSupport_la-QTable.lo: QTable.cpp @am__fastdepCXX_TRUE@ $(AM_V_CXX)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -MT libMADPSupport_la-QTable.lo -MD -MP -MF $(DEPDIR)/libMADPSupport_la-QTable.Tpo -c -o libMADPSupport_la-QTable.lo `test -f 'QTable.cpp' || echo '$(srcdir)/'`QTable.cpp @am__fastdepCXX_TRUE@ $(AM_V_at)$(am__mv) $(DEPDIR)/libMADPSupport_la-QTable.Tpo $(DEPDIR)/libMADPSupport_la-QTable.Plo @AMDEP_TRUE@@am__fastdepCXX_FALSE@ $(AM_V_CXX)source='QTable.cpp' object='libMADPSupport_la-QTable.lo' libtool=yes @AMDEPBACKSLASH@ @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ @am__fastdepCXX_FALSE@ $(AM_V_CXX@am__nodep@)$(LIBTOOL) $(AM_V_lt) --tag=CXX $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(libMADPSupport_la_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS) -c -o libMADPSupport_la-QTable.lo `test -f 'QTable.cpp' || echo '$(srcdir)/'`QTable.cpp mostlyclean-libtool: -rm -f *.lo clean-libtool: -rm -rf .libs _libs install-libMADPSupport_laHEADERS: $(libMADPSupport_la_HEADERS) @$(NORMAL_INSTALL) @list='$(libMADPSupport_la_HEADERS)'; test -n "$(libMADPSupport_ladir)" || list=; \ if test -n "$$list"; then \ echo " $(MKDIR_P) '$(DESTDIR)$(libMADPSupport_ladir)'"; \ $(MKDIR_P) "$(DESTDIR)$(libMADPSupport_ladir)" || exit 1; \ fi; \ for p in $$list; do \ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \ echo "$$d$$p"; \ done | $(am__base_list) | \ while read files; do \ echo " $(INSTALL_HEADER) $$files '$(DESTDIR)$(libMADPSupport_ladir)'"; \ $(INSTALL_HEADER) $$files "$(DESTDIR)$(libMADPSupport_ladir)" || exit $$?; \ done uninstall-libMADPSupport_laHEADERS: @$(NORMAL_UNINSTALL) @list='$(libMADPSupport_la_HEADERS)'; test -n "$(libMADPSupport_ladir)" || list=; \ files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \ dir='$(DESTDIR)$(libMADPSupport_ladir)'; $(am__uninstall_files_from_dir) ID: $(am__tagged_files) $(am__define_uniq_tagged_files); mkid -fID $$unique tags: tags-am TAGS: tags tags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files) set x; \ here=`pwd`; \ $(am__define_uniq_tagged_files); \ shift; \ if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \ test -n "$$unique" || unique=$$empty_fix; \ if test $$# -gt 0; then \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ "$$@" $$unique; \ else \ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \ $$unique; \ fi; \ fi ctags: ctags-am CTAGS: ctags ctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files) $(am__define_uniq_tagged_files); \ test -z "$(CTAGS_ARGS)$$unique" \ || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \ $$unique GTAGS: here=`$(am__cd) $(top_builddir) && pwd` \ && $(am__cd) $(top_srcdir) \ && gtags -i $(GTAGS_ARGS) "$$here" cscopelist: cscopelist-am cscopelist-am: $(am__tagged_files) list='$(am__tagged_files)'; \ case "$(srcdir)" in \ [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \ *) sdir=$(subdir)/$(srcdir) ;; \ esac; \ for i in $$list; do \ if test -f "$$i"; then \ echo "$(subdir)/$$i"; \ else \ echo "$$sdir/$$i"; \ fi; \ done >> $(top_builddir)/cscope.files distclean-tags: -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags distdir: $(DISTFILES) @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \ list='$(DISTFILES)'; \ dist_files=`for file in $$list; do echo $$file; done | \ sed -e "s|^$$srcdirstrip/||;t" \ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \ case $$dist_files in \ */*) $(MKDIR_P) `echo "$$dist_files" | \ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \ sort -u` ;; \ esac; \ for file in $$dist_files; do \ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \ if test -d $$d/$$file; then \ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \ if test -d "$(distdir)/$$file"; then \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \ fi; \ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \ else \ test -f "$(distdir)/$$file" \ || cp -p $$d/$$file "$(distdir)/$$file" \ || exit 1; \ fi; \ done check-am: all-am check: check-am all-am: Makefile $(LTLIBRARIES) $(HEADERS) installdirs: for dir in "$(DESTDIR)$(libdir)" "$(DESTDIR)$(libMADPSupport_ladir)"; do \ test -z "$$dir" || $(MKDIR_P) "$$dir"; \ done install: install-am install-exec: install-exec-am install-data: install-data-am uninstall: uninstall-am install-am: all-am @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am installcheck: installcheck-am install-strip: if test -z '$(STRIP)'; then \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ install; \ else \ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \ "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \ fi mostlyclean-generic: clean-generic: distclean-generic: -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES) -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES) maintainer-clean-generic: @echo "This command is intended for maintainers to use" @echo "it deletes files that may require special tools to rebuild." clean: clean-am clean-am: clean-generic clean-libLTLIBRARIES clean-libtool \ clean-noinstLTLIBRARIES mostlyclean-am distclean: distclean-am -rm -rf ./$(DEPDIR) -rm -f Makefile distclean-am: clean-am distclean-compile distclean-generic \ distclean-tags dvi: dvi-am dvi-am: html: html-am html-am: info: info-am info-am: install-data-am: install-libMADPSupport_laHEADERS install-dvi: install-dvi-am install-dvi-am: install-exec-am: install-libLTLIBRARIES install-html: install-html-am install-html-am: install-info: install-info-am install-info-am: install-man: install-pdf: install-pdf-am install-pdf-am: install-ps: install-ps-am install-ps-am: installcheck-am: maintainer-clean: maintainer-clean-am -rm -rf ./$(DEPDIR) -rm -f Makefile maintainer-clean-am: distclean-am maintainer-clean-generic mostlyclean: mostlyclean-am mostlyclean-am: mostlyclean-compile mostlyclean-generic \ mostlyclean-libtool pdf: pdf-am pdf-am: ps: ps-am ps-am: uninstall-am: uninstall-libLTLIBRARIES \ uninstall-libMADPSupport_laHEADERS .MAKE: install-am install-strip .PHONY: CTAGS GTAGS TAGS all all-am check check-am clean clean-generic \ clean-libLTLIBRARIES clean-libtool clean-noinstLTLIBRARIES \ cscopelist-am ctags ctags-am distclean distclean-compile \ distclean-generic distclean-libtool distclean-tags distdir dvi \ dvi-am html html-am info info-am install install-am \ install-data install-data-am install-dvi install-dvi-am \ install-exec install-exec-am install-html install-html-am \ install-info install-info-am install-libLTLIBRARIES \ install-libMADPSupport_laHEADERS install-man install-pdf \ install-pdf-am install-ps install-ps-am install-strip \ installcheck installcheck-am installdirs maintainer-clean \ maintainer-clean-generic mostlyclean mostlyclean-compile \ mostlyclean-generic mostlyclean-libtool pdf pdf-am ps ps-am \ tags tags-am uninstall uninstall-am uninstall-libLTLIBRARIES \ uninstall-libMADPSupport_laHEADERS # Tell versions [3.59,3.63) of GNU make to not export all variables. # Otherwise a system limit (for SysV at least) may be exceeded. .NOEXPORT: madp-0.4/src/support/PaxHeaders.5405/PlanningUnitDecPOMDPDiscrete.h0000644000000000000000000000013212717644275021750 xustar0030 mtime=1463765181.481709137 30 atime=1463765181.481709137 30 ctime=1463765201.677547837 madp-0.4/src/support/PlanningUnitDecPOMDPDiscrete.h0000664000372100037210000001031512717644275022604 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _PLANNINGUNITDECPOMDPDISCRETE_H_ #define _PLANNINGUNITDECPOMDPDISCRETE_H_ 1 /* the include directives */ #include #include "Globals.h" #include "PlanningUnitMADPDiscrete.h" #include "DecPOMDPDiscreteInterface.h" #include "boost/shared_ptr.hpp" class JointPolicyPureVector; /** \brief PlanningUnitDecPOMDPDiscrete represents a planning unit for * discrete Dec-POMDPs. */ class PlanningUnitDecPOMDPDiscrete : //public Referrer, public PlanningUnitMADPDiscrete { private: DecPOMDPDiscreteInterface* _m_DecPOMDP; protected: /// Runs some consistency tests. bool SanityCheck() const; public: // Constructor, destructor and copy assignment. ///the (default) Constructor. PlanningUnitDecPOMDPDiscrete( const PlanningUnitMADPDiscreteParameters ¶ms, size_t horizon=3, DecPOMDPDiscreteInterface* p=0 ); PlanningUnitDecPOMDPDiscrete( size_t horizon=3, DecPOMDPDiscreteInterface* p=0 ); //operators: //data manipulation (set) functions: /// Tell which SetReferred to use by default. //void SetReferred(DecPOMDPDiscreteInterface* p) //{Referrer::SetReferred(p);} ///Set the problem (DecPOMDPDiscreteInterface) using a pointer. void SetProblem(DecPOMDPDiscreteInterface* p); //get (data) functions: /// Returns the DecPOMDPDiscreteInterface pointer. /** Tell which GetReferred to use by default... (nl. the * Referrer::GetReferred(), not the * PlanningUnitMADPDiscrete::GetReferred(). * DecPOMDPDiscreteInterface* GetReferred() const { //std::cerr << "Warning PlanningUnitDecPOMDPDiscrete::GetReferred is deprecated, use GetDPOMDP instead"<GetReward(sI, jaI)); } ///Returns the discount parameter. double GetDiscount() const {return GetDPOMDPD()->GetDiscount();} /// Returns the expected reward of the best found joint policy. virtual double GetExpectedReward() const = 0; /* Frans 20110908 - not sure if we need this here? * Well removing it, also give all kinds of problems... */ /// Returns the found joint policy. virtual boost::shared_ptr GetJointPolicyPureVector() {throw E("PlanningUnitDecPOMDPDiscrete::GetJointPolicyPureVector - Error this function should be overriden by the derived PU! Check if the used planning unit actually uses JointPolicyPureVector !");} /// Returns the found joint policy. virtual boost::shared_ptr GetJointPolicy() {throw E("PlanningUnitDecPOMDPDiscrete::GetJointPolicy - Error this function should be overriden by the derived PU!");} /// Exports the Dec-POMDP represented by \a pu to file named \a filename. static void ExportDecPOMDPFile(const std::string & filename, const DecPOMDPDiscreteInterface *decpomdp); /// Exports the Dec-POMDP to file named \a filename. void ExportDecPOMDPFile(const std::string & filename) const; }; #endif /* !_PLANNINGUNITDECPOMDPDISCRETE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/IndividualHistory.h0000644000000000000000000000013212717644275020115 xustar0030 mtime=1463765181.457709328 30 atime=1463765181.457709328 30 ctime=1463765201.657547996 madp-0.4/src/support/IndividualHistory.h0000664000372100037210000000234412717644275020754 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _INDIVIDUALHISTORY_H_ #define _INDIVIDUALHISTORY_H_ 1 /* the include directives */ #include #include "Globals.h" #include "History.h" ///IndividualHistory represents a history for a single agent. class IndividualHistory : public History { private: protected: ///The agent this history belongs to. Index _m_agentI; public: // Constructor, destructor and copy assignment. /// (default) Constructor IndividualHistory(Index agentI) : _m_agentI(agentI){}; /// Destructor. virtual ~IndividualHistory(){}; }; #endif /* !_INDIVIDUALHISTORY_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/FixedCapacityPriorityQueue.cpp0000644000000000000000000000013212717644275022262 xustar0030 mtime=1463765181.485709106 30 atime=1463765181.485709106 30 ctime=1463765201.745547293 madp-0.4/src/support/FixedCapacityPriorityQueue.cpp0000664000372100037210000000221512717644275023116 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "FixedCapacityPriorityQueue.h" using namespace std; /* //Default constructor FixedCapacityPriorityQueue::FixedCapacityPriorityQueue() { } //Copy constructor. FixedCapacityPriorityQueue::FixedCapacityPriorityQueue(const FixedCapacityPriorityQueue& o) { } //Destructor FixedCapacityPriorityQueue::~FixedCapacityPriorityQueue() { } //Copy assignment operator FixedCapacityPriorityQueue& FixedCapacityPriorityQueue::operator= (const FixedCapacityPriorityQueue& o) { if (this == &o) return *this; // Gracefully handle self assignment // Put the normal assignment duties here... return *this; } */ madp-0.4/src/support/PaxHeaders.5405/PartialJointPolicyDiscretePure.h0000644000000000000000000000013212717644275022542 xustar0030 mtime=1463765181.585708307 30 atime=1463765181.581708338 30 ctime=1463765201.621548283 madp-0.4/src/support/PartialJointPolicyDiscretePure.h0000664000372100037210000000537312717644275023406 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _PARTIALJOINTPOLICYDISCRETEPURE_H_ #define _PARTIALJOINTPOLICYDISCRETEPURE_H_ 1 /* the include directives */ #include "Globals.h" #include "JointPolicyDiscretePure.h" #include "PartialJointPolicy.h" #include "boost/shared_ptr.hpp" class PartialJointPolicyDiscretePure; typedef boost::shared_ptr PJPDP_sharedPtr; /** \brief PartialJointPolicyDiscretePure is a discrete and pure * PartialJointPolicy. */ class PartialJointPolicyDiscretePure : //virtual <- this leads to pain in the ass... public JointPolicyDiscretePure , public PartialJointPolicy { private: protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor PartialJointPolicyDiscretePure() {}; PartialJointPolicyDiscretePure( const Interface_ProblemToPolicyDiscretePure* pu, PolicyGlobals::PolicyDomainCategory idc, double pastReward = 0.0 ) : JointPolicyDiscretePure(pu, idc) ,PartialJointPolicy(pastReward) {}; PartialJointPolicyDiscretePure( const I_PtPDpure_constPtr &pu, PolicyGlobals::PolicyDomainCategory idc, double pastReward = 0.0 ) : JointPolicyDiscretePure(pu, idc) ,PartialJointPolicy(pastReward) {}; /// Copy constructor. PartialJointPolicyDiscretePure(const PartialJointPolicyDiscretePure& a) : JointPolicyDiscretePure(a) , PartialJointPolicy(a) {}; /// Destructor. virtual ~PartialJointPolicyDiscretePure(){}; /// Copy assignment operator virtual PartialJointPolicyDiscretePure& operator= (const PartialJointPolicyDiscretePure& o); /// Returns a pointer to a copy of this class. virtual PartialJointPolicyDiscretePure* Clone() const = 0; //operators: //data manipulation (set) functions: //get (data) functions: }; #endif /* !_PARTIALJOINTPOLICYDISCRETEPURE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/ProblemFireFightingFactored.h0000644000000000000000000000013212717644275022001 xustar0030 mtime=1463765181.473709201 30 atime=1463765181.473709201 30 ctime=1463765201.633548187 madp-0.4/src/support/ProblemFireFightingFactored.h0000664000372100037210000000745112717644275022644 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _PROBLEMFIREFIGHTINGFACTORED_H_ #define _PROBLEMFIREFIGHTINGFACTORED_H_ 1 /* the include directives */ #include #include "Globals.h" #include "FactoredDecPOMDPDiscrete.h" class DecPOMDPDiscrete; /**ProblemFireFightingFactored is a factored implementation of the * FireFighting problem introduced in (Oliehoek, Spaan, Vlassis, JAIR * 32, 2008). */ class ProblemFireFightingFactored : public FactoredDecPOMDPDiscrete { private: protected: enum observation_t { FLAMES, NOFLAMES }; size_t _m_nrAgents; size_t _m_nrHouses; size_t _m_nrFireLevels; double _m_costOfMove; bool _m_forcePositionRepres; // this the probability agents receive for reducing the firelevel // to 1 if >1 agents are present, otherwise it reduces just by 1 // level. double _m_multipleAgentExtinguishProb; bool _m_includePositions; size_t _m_nrStateFeatures; //vector that stores the number of values per state feature. std::vector _m_nrPerStateFeatureVec; size_t _m_nrJointFirelevels; //vector that stores the number of values per state feature. std::vector _m_nrFLs_vec; ///Construct all the observations and observation sets. virtual void ConstructObservations(); std::vector< Index> GetStateVector(Index sI) const { return IndexTools::JointToIndividualIndices (sI, _m_nrPerStateFeatureVec ); } ///Compute the probability of value yVal of state variable y, given ii= virtual double ComputeTransitionProb( Index y, Index yVal, const std::vector< Index>& Xs, const std::vector< Index>& As, const std::vector< Index>& Ys ) const; virtual double ComputeObservationProb( Index o, Index oVal, const std::vector< Index>& As, const std::vector< Index>& Ys, const std::vector< Index>& Os ) const; virtual size_t GetNrAgentsAtHouse(const std::vector< Index>& As, Index hI) const; virtual size_t GetAgentLocation(Index action, Index agI) const; virtual std::string SoftPrintBriefDescription() const; virtual std::string SoftPrintDescription() const; ///Construct all the Actions and actionSets (the vector _m_actionVecs). virtual void ConstructActions(); virtual Scope GetHousesAgentInfluences(Index agI) const; void InitializePFFF(); virtual void SetYScopes(); virtual void SetOScopes(); double GetMultipleAgentExtinguishProb() const; std::string GetMultipleAgentExtinguishProbString() const; public: ///Constructor ProblemFireFightingFactored( size_t nrAgents, size_t nrHouses, size_t nrFireLevels, double costOfMove=0.0, bool forcePositionRepres = false, double multipleAgentExtinguishProb = 1.0, bool initialize=true); /// Destructor. virtual ~ProblemFireFightingFactored(){}; /// Returns a pointer to a copy of this class. virtual ProblemFireFightingFactored* Clone() const { return new ProblemFireFightingFactored(*this); } }; #endif /* !_PROBLEMFIREFIGHTINGFACTORED_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/PolicyDiscrete.cpp0000644000000000000000000000013212717644275017720 xustar0030 mtime=1463765181.553708562 30 atime=1463765181.553708562 30 ctime=1463765201.693547709 madp-0.4/src/support/PolicyDiscrete.cpp0000664000372100037210000000175712717644275020566 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "PolicyDiscrete.h" #include Index PolicyDiscrete::SampleAction( Index i ) const { size_t nrA = GetInterfacePTPDiscrete()->GetNrActions(_m_agentI); double randNr= ((double)rand()) / (RAND_MAX + 1.0); double sum=0; Index selected_a=0; for(Index a=0; a _m_oHistConditional; ///marginals of observation history probs for each agent /**used for updating the belief and by the GetOH... functions * _m_oHistMarginals[agI][ohI] contains the probability of observation * history ohI for agent agI. */ std::vector< std::vector > _m_oHistMarginals; ///the state factors in the scope of influence for each agent('s obs.) std::vector< Scope > _m_sfacSoI; ///the number of influence instantiations for those scopes /**(i.e., the number of local states that influence o_i) */ std::vector< size_t > _m_sfacSoI_ii_size; ///the stepsize array (used to convert indiv<->joint indicies) is cached /**I.e., this is used to quickly convert from/to individiual state * indices of the state factors in the scope for this agent */ std::vector< size_t *> _m_stepsize; protected: public: // Constructor, destructor and copy assignment. /// Constructor without arguments, needed for serialization. FSAOHDist_NECOF(); /// (default) Constructor FSAOHDist_NECOF(const PlanningUnitFactoredDecPOMDPDiscrete* p); /// Copy constructor. FSAOHDist_NECOF(const FSAOHDist_NECOF& a); /// Destructor. virtual ~FSAOHDist_NECOF(); /// Copy assignment operator FSAOHDist_NECOF& operator= (const FSAOHDist_NECOF& o); //operators: //data manipulation (set) functions: //get (data) functions: virtual double GetAOHProb_relT( const Scope& agSc, const std::vector& aohI) const { throw E("GetAOHProb_relT nyi..."); }; virtual double GetOHProb_relT( const Scope& agSc, const std::vector& ohI) const; ///returns P(sfacI, ohI) virtual double GetXOHProb_relT( const Scope& sfSc, const std::vector& sfacI, const Scope& agSc, const std::vector& ohI ) const; ///returns P(sfacI, ohI) like GetXOHProb_relT. /**This version requires that sfSc is a superset of the scope of * influence for all observations (of agents in agSc). * I.e., this function will not perform any marginalization. */ virtual double GetXOHProb_relT_SufficientSFscope( const Scope& sfSc, const std::vector& sfacI, const Scope& agSc, const std::vector& ohI ) const; virtual double GetXProb( const Scope& sfSc, const std::vector& sfValI) const; /**\brief Performs an update of the distribution to the next stage. * In particular this function computes the new * * \li state factor marginals * \li OH conditionals * \li OH marginals * * from the previous stage marginals. */ virtual void Update(const JointPolicyDiscretePure& pol); virtual void InitializeFromISD( const FactoredStateDistribution * d); virtual std::string SoftPrint() const; virtual void SanityCheck(); virtual FactoredStateAOHDistribution *Clone() const { return(new FSAOHDist_NECOF(*this)); } }; #endif /* !_FSAOHDIST_NECOF_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/TimedAlgorithm.h0000644000000000000000000000013212717644275017354 xustar0030 mtime=1463765181.297710607 30 atime=1463765181.297710607 30 ctime=1463765201.689547741 madp-0.4/src/support/TimedAlgorithm.h0000664000372100037210000000426412717644275020216 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _TIMEDALGORITHM_H_ #define _TIMEDALGORITHM_H_ 1 /* the include directives */ #include #include "Globals.h" #include "Timing.h" /**\brief TimedAlgorithm allows for easy timekeeping of parts of an * algorithm.*/ class TimedAlgorithm { private: /// Stores the timing info. // This is a pointer, so that timing information can be stored in // const functions. Timing *_m_timer; protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor TimedAlgorithm(); /// Destructor. virtual ~TimedAlgorithm(); /// Start to time an event identified by \a id. void StartTimer(const std::string & id) const; /// Stop to time an event identified by \a id. void StopTimer(const std::string & id) const; /// Print stored timing info. void PrintTimers() const; /// Sums data and prints out a summary. void PrintTimersSummary() const; /// Save collected timing info to file \a filename. void SaveTimers(const std::string & filename) const; /// Save collected timing info to ofstream \a of. void SaveTimers(std::ofstream &of) const; /// Load timing info from file \a filename. void LoadTimers(const std::string & filename); /// Adds event of certain duration, e.g., an external program call. void AddTimedEvent(const std::string & id, clock_t duration); /// Returns all stored durations (in s) for a particular event. std::vector GetTimedEventDurations(const std::string & id); }; #endif /* !_TIMEDALGORITHM_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/PartialJointPolicyPureVector.cpp0000644000000000000000000000013212717644275022575 xustar0030 mtime=1463765181.585708307 30 atime=1463765181.585708307 30 ctime=1463765201.701547645 madp-0.4/src/support/PartialJointPolicyPureVector.cpp0000664000372100037210000000575212717644275023442 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "PartialJointPolicyPureVector.h" #include "JointPolicyPureVector.h" #include "boost/make_shared.hpp" using namespace std; PartialJointPolicyPureVector::PartialJointPolicyPureVector( const Interface_ProblemToPolicyDiscretePure* pu, PolicyGlobals::PolicyDomainCategory idc, double pastReward, size_t depth) : PartialJointPolicyDiscretePure(pu, idc, pastReward), JPolComponent_VectorImplementation(pu, idc, depth) { SetDepth(depth); } PartialJointPolicyPureVector::PartialJointPolicyPureVector( const I_PtPDpure_constPtr &pu, PolicyGlobals::PolicyDomainCategory idc, double pastReward, size_t depth) : PartialJointPolicyDiscretePure(pu, idc, pastReward), JPolComponent_VectorImplementation(pu, idc, depth) { SetDepth(depth); } //Copy assignment operator PartialJointPolicyPureVector& PartialJointPolicyPureVector::operator= (const PartialJointPolicyPureVector& o) { #if DEBUG_JPOLASSIGN cerr << "PartialJointPolicyPureVector& PartialJointPolicyPureVector::operator= (const PartialJointPolicyPureVector& o) called"<( o ); return operator=(p); } string PartialJointPolicyPureVector::SoftPrint() const { stringstream ss; ss << "PartialJointPolicyPureVector, past reward="< #include "Globals.h" ///History is a general class for histories. class History { private: protected: /// How long (how many time-steps) is this history? /** For example, history at... * ts 0 - length 0 (received no action yet... ) * ts 1 - length 1 (hist= (a0) ) * ts 2 - length 2 (hist= (a0,a1) ) */ size_t _m_length; public: // Constructor, destructor and copy assignment. /// (default) Constructor History(){}; /// Destructor. virtual ~History(){}; /// Returns the length of the history, i.e., the number of time steps. size_t GetLength() const { return(_m_length); } ///Set the length of the history, i.e., the number of time steps. void SetLength(size_t length) { _m_length=length; } /// Returns a pointer to a copy of this class. virtual History* Clone() const = 0; virtual void Print() const = 0; }; #endif /* !_HISTORY_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/ProblemFOBSFireFightingFactored.cpp0000644000000000000000000000013112717644275023005 xustar0030 mtime=1463765181.505708945 29 atime=1463765181.49770901 30 ctime=1463765201.713547549 madp-0.4/src/support/ProblemFOBSFireFightingFactored.cpp0000664000372100037210000003533312717644275023651 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Philipp Robbel * * For contact information please see the included AUTHORS file. */ #include "StringTools.h" #include "ProblemFOBSFireFightingFactored.h" #include "RewardModelMapping.h" using namespace std; #define DEBUG_PFFF 0 #define DEBUG_CTM 0 //Create Trans Model ProblemFOBSFireFightingFactored::ProblemFOBSFireFightingFactored( size_t nrAgents, size_t nrHouses, size_t nrFLs, double costOfMove, bool forcePositionRepres, bool initialize) : FactoredMMDPDiscrete( SoftPrintBriefDescription(nrAgents, nrHouses, nrFLs), SoftPrintDescription(nrAgents, nrHouses, nrFLs), "none"), _m_nrAgents(nrAgents), _m_nrHouses(nrHouses), _m_nrFireLevels(nrFLs), _m_costOfMove(costOfMove), _m_forcePositionRepres(forcePositionRepres) { if(initialize) InitializePFFF(); } void ProblemFOBSFireFightingFactored::InitializePFFF() { SetName(SoftPrintBriefDescription(_m_nrAgents, _m_nrHouses, _m_nrFireLevels)); SetDescription(SoftPrintDescription(_m_nrAgents, _m_nrHouses, _m_nrFireLevels)); SetUnixName(SoftPrintBriefDescription(_m_nrAgents, _m_nrHouses, _m_nrFireLevels)); SetSparse(true); SetNrAgents(_m_nrAgents); double S = pow((double)_m_nrFireLevels, (double)_m_nrHouses); _m_nrJointFirelevels = (size_t) S; _m_nrFLs_vec = vector(_m_nrHouses, _m_nrFireLevels); //Create states, and ISD // //first add the state features describing the (firelevels of) the houses) for(Index hI = 0; hI < _m_nrHouses; hI++) { Index sfI = AddStateFactor( StringTools::Append("FL",hI) , StringTools::Append("The fire level of house ",hI)); for(Index flI=0; flI < _m_nrFireLevels; flI++) AddStateFactorValue(sfI, StringTools::Append("fl",flI)); } if(_m_costOfMove > 0.0 || _m_forcePositionRepres) { #if DEBUG_PFFF cout << "Including position"< _m_nrStateFeatures = _m_nrHouses+_m_nrAgents; size_t nrPos = _m_nrHouses+1; //include the 'start' position. _m_nrFLs_vec = vector(_m_nrHouses, _m_nrFireLevels); vector< size_t > nrPos_vec = vector(_m_nrAgents, nrPos); _m_nrPerStateFeatureVec = _m_nrFLs_vec; _m_nrPerStateFeatureVec.insert( _m_nrPerStateFeatureVec.end(), //insert position nrPos_vec.begin(), //the stuff that is nrPos_vec.end() //appended... ); if(DEBUG_PFFF) cout << "_m_nrPerStateFeatureVec=" << SoftPrintVector(_m_nrPerStateFeatureVec) << endl; } else { cout << "Not including positions" << endl; _m_includePositions = false; //the s_vec has the form _m_nrStateFeatures = _m_nrHouses; _m_nrPerStateFeatureVec = _m_nrFLs_vec; if(DEBUG_PFFF) cout << "_m_nrPerStateFeatureVec=" << SoftPrintVector(_m_nrPerStateFeatureVec) << endl; } SetStatesInitialized(true); //size_t nrS = GetNrStates(); //after initialization we can add the ISD: if(_m_includePositions) { /* vector isd(nrS, 0.0); double nrStartStates = pow((double)_m_nrFireLevels, (double)_m_nrHouses); double ssprob = 1.0 / nrStartStates; for(Index sI = 0; sI < nrS; sI++) { vector< Index> s_vec = GetStateVector(sI); Index t1 = _m_nrHouses; //we start with the first position feature bool isStartState = true; for(; t1 < _m_nrStateFeatures; t1++) { Index hI = s_vec.at(t1); if(hI == _m_nrHouses) //start position ; else isStartState = false; } if(isStartState) isd.at(sI) = ssprob; } this->SetISD(isd); */ this->SetUniformISD(); throw E("ProblemFOBSFireFightingFactored - initialization of ISD with positions not implemented yet"); } else this->SetUniformISD(); #if DEBUG_PFFF cout << "states initialized: " << endl ; cout << MADPComponentFactoredStates::SoftPrint() << endl; #endif SetDiscount(1); #if DEBUG_PFFF cout << _m_2dbn.SoftPrint(); #endif // add actions: ConstructActions(); #if 0 // for factored models we typically don't want to use joint indices ConstructJointActions(); #endif SetActionsInitialized(true); // Initialize the 2DBN in FactoredMMDPDiscrete Initialize2DBN(); #if DEBUG_PFFF cout << ">>>Trans model created"< emptyVec; vector yVals(1, flI);// vector containing onyl flI SetRewardForLRF( e, emptySc, emptyVec, //X scope + value emptySc, emptyVec, //A scope + value ySc, yVals, emptySc, emptyVec, //O scope + value -(double)flI //the reward ); } } #if DEBUG_PFFF cout << "Model created..."<() ); for(Index actionI=0; actionI < nrActionsThisAgent; actionI++) { stringstream ss; //ss << "Ag" <& As, Index hI) const { size_t nrAgentsAtLocation = 0; for(Index aI=0; aI < As.size(); aI++) if(GetAgentLocation(As.at(aI),aI) == hI) nrAgentsAtLocation++; return(nrAgentsAtLocation); } double ProblemFOBSFireFightingFactored::ComputeTransitionProb( Index y, Index yVal, const std::vector< Index>& Xs, const std::vector< Index>& As, const std::vector< Index>& Ys ) const { if(y >= _m_nrHouses) throw E("position sfac transition probs NYI"); //this computes the probability P( nextLevel | ...) for hI Index hI = y; const Scope& XSoI = GetXSoI_Y(y); Index Index_of_hI_within_scope = 0; while(XSoI[Index_of_hI_within_scope] != hI && Index_of_hI_within_scope < XSoI.size() ) Index_of_hI_within_scope++; if(Index_of_hI_within_scope == XSoI.size()) throw E( StringTools::Append("did not find this house (hI=",hI) + " in its own scope of influence XSoI)" ); Index curLevel = Xs.at(Index_of_hI_within_scope); Index nextLevel = yVal; size_t nrAgentsAtLocation=GetNrAgentsAtHouse(As,hI); #if 0 && DEBUG_CTM cout << "hI="< 0) neighborIsBurning = true; } //bool neighborIsBurning = isNeighborBurning(s1, hI); Index sameLevel = curLevel; Index higherLevel = min((size_t)sameLevel+1, _m_nrFireLevels-1); Index lowerLevel = (curLevel==0) ? 0 : (curLevel-1); double p2=0.0;// the prob. factor of ThisHouseFirelevel; switch(nrAgentsAtLocation) { case(0): { //this is kind of strange: when a house is not burning, but //its neigbhor is, it will increase its FL with p=0.8 //but when it is already burning (and its neighbor is not), it //increase with p=0.4... //fire is likely to increase if(neighborIsBurning) { if(nextLevel == sameLevel) p2+=0.2; if(nextLevel == higherLevel) p2+=0.8; } else if (curLevel == 0) //fire won't get ignited { if(0 == nextLevel) p2=1.0; else //not possible so we can quit... p2=0.0; } else //normal burning house { if(nextLevel == sameLevel) p2+=0.6; if(nextLevel == higherLevel) p2+=0.4; } break; } case(1): { //fire is likely to decrease if(neighborIsBurning) { if(nextLevel == sameLevel) p2+=0.4; if(nextLevel == lowerLevel) p2+=0.6; //.6 prob of extuinguishing 1 fl } else if (curLevel == 0) //fire won't get ignited { if(0 == nextLevel) p2=1.0; else //not possible so we can quit... p2=0.0; } else //normal burning house { if(nextLevel == sameLevel) p2+=0.0; if(nextLevel == lowerLevel) p2+=1.0; } break; } default: { //more than 1 agent: fire is extinguished if(0 == nextLevel) p2=1.0; else //not possible so we can quit... p2=0.0; } } return(p2); } size_t ProblemFOBSFireFightingFactored::GetAgentLocation(Index action, Index agI) const { return(action); } Scope ProblemFOBSFireFightingFactored::GetHousesAgentInfluences(Index agI) const { Scope allHouses; for(Index hI=0; hI < _m_nrHouses; hI++) allHouses.Insert(hI); return(allHouses); } void ProblemFOBSFireFightingFactored::SetYScopes() { //specify connections for the 2DBN #if DEBUG_PFFF cout << "About to set the SoIs for all next-stage(NS) SFs Y..."< 0) x.Insert(yI-1); x.Insert(yI); // firelevel of house yI influenced by its PS firelevel if(yI < (_m_nrHouses-1) ) x.Insert(yI+1); SetSoI_Y( yI, //sfacI = 0 -> house 0 x, allAgents, Scope("<>") // no interdependencies between next-stage FLs ); } } madp-0.4/src/support/PaxHeaders.5405/JPolComponent_VectorImplementation.h0000644000000000000000000000013212717644275023422 xustar0030 mtime=1463765181.441709457 30 atime=1463765181.437709489 30 ctime=1463765201.621548283 madp-0.4/src/support/JPolComponent_VectorImplementation.h0000664000372100037210000001373412717644275024266 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _JPOLCOMPONENT_VECTORIMPLEMENTATION_H_ #define _JPOLCOMPONENT_VECTORIMPLEMENTATION_H_ 1 /* the include directives */ #include "Globals.h" #include "PolicyPureVector.h" class Interface_ProblemToPolicyDiscretePure; /** \brief JPolComponent_VectorImplementation implements functionality * common to several joint policy implementations. */ class JPolComponent_VectorImplementation { private: /** \brief Private function that deletes all the individual * policies pointed to.*/ void ClearIndividualPolicies(); /// vector for temporarily storing indiv. actions /**(used by GetJointActionIndex) */ Index * _m_indivActionIndices; ///Aux. function used by copy constructors void PrivClone(const JPolComponent_VectorImplementation& o); // why should this class have its own pointer? That way we can never change it! const Interface_ProblemToPolicyDiscretePure* _m_PTPDP; I_PtPDpure_constPtr _m_PTPDPshared; PolicyDomainCategory _m_idc; const Interface_ProblemToPolicyDiscretePure* GetInterfacePTPDiscretePure() const { if(_m_PTPDP) return(_m_PTPDP); else return(_m_PTPDPshared.get()); } void Construct( const Interface_ProblemToPolicyDiscretePure* pu, PolicyGlobals::PolicyDomainCategory idc, size_t depth); void Construct( const I_PtPDpure_constPtr &pu, PolicyGlobals::PolicyDomainCategory idc, size_t depth); protected: std::vector _m_indivPols_PolicyPureVector; public: // Constructor, destructor and copy assignment. /// (default) Constructor JPolComponent_VectorImplementation( const Interface_ProblemToPolicyDiscretePure* pu, size_t depth=MAXHORIZON); JPolComponent_VectorImplementation( const Interface_ProblemToPolicyDiscretePure* pu, PolicyGlobals::PolicyDomainCategory idc, size_t depth=MAXHORIZON); JPolComponent_VectorImplementation( const I_PtPDpure_constPtr &pu, size_t depth=MAXHORIZON); JPolComponent_VectorImplementation( const I_PtPDpure_constPtr &pu, PolicyGlobals::PolicyDomainCategory idc, size_t depth=MAXHORIZON); /// Copy constructor. JPolComponent_VectorImplementation( const JPolComponent_VectorImplementation& a); /// Destructor. ~JPolComponent_VectorImplementation(); /// Copy assignment operator JPolComponent_VectorImplementation& operator= (const JPolComponent_VectorImplementation& o); ///Performs increment. See Increment(). bool operator++ () { return( this->Increment() ); }; /// Get the index of this joint policy. LIndex GetIndex() const; /// Returns a reference to the vector of pointers to individual policies /** This function should be used to manipulate individual policies. */ std::vector& GetIndividualPolicies() {return _m_indivPols_PolicyPureVector;}; virtual PolicyDiscrete* GetIndividualPolicyDiscrete(Index agI) const { return _m_indivPols_PolicyPureVector.at(agI); } /// Sets the index of this joint policy.Updates the policies represented void SetIndex(LIndex i); //data manipulation (set) functions: ///Randomly initialize the joint policy. void RandomInitialization(); ///Randomly initialize the policy for agentI. void RandomInitialization(Index agentI); /// Initialize the joint policy to the first joint policy. /** This is the joint policy that specifies action 0 --the * first action-- for all observation histories.*/ void ZeroInitialization(); /// Initialize the policy of agentI to the first policy. /** This is the policy that specifies action 0 --the first * action-- for all observation histories.*/ void ZeroInitialization(Index agentI); ///Increments the individual policy of agentI. bool Increment(Index agentI) {return( ++(*_m_indivPols_PolicyPureVector[agentI])) ;}; ///Increments the joint policy, used to iterate over joint policies. bool Increment(); void SetDepthForIndivPols(size_t d); ///Sets the policy for agentI to domainI->aI. void SetAction(Index agentI, Index domainI, Index aI) {_m_indivPols_PolicyPureVector[agentI]->SetAction(domainI, aI);} /// Prints a description of this to a string. std::string SoftPrint() const; std::string SoftPrintBrief() const; ///Returns the jaI taken by this policy for joint domain index johI. Index GetJointActionIndex(Index i) const; ///Returns the jaI taken by this policy for joint domain index johI. Index GetJointActionIndex(LIndex i) const; ///Returns the action index for domainI for agent aI. Index GetActionIndex(Index aI, Index domainI) const {return _m_indivPols_PolicyPureVector[aI]->GetActionIndex(domainI);} }; #endif /* !_JPOLCOMPONENT_VECTORIMPLEMENTATION_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/MADPDiscreteStatistics.cpp0000644000000000000000000000013112717644275021254 xustar0029 mtime=1463765181.43370952 30 atime=1463765181.429709553 30 ctime=1463765201.749547262 madp-0.4/src/support/MADPDiscreteStatistics.cpp0000664000372100037210000000544412717644275022120 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "MADPDiscreteStatistics.h" #include "VectorTools.h" #include using namespace std; //Default constructor MADPDiscreteStatistics::MADPDiscreteStatistics(MultiAgentDecisionProcessDiscreteInterface* madp, size_t h) : _m_madp(madp), _m_h(h) { } //Copy constructor. MADPDiscreteStatistics::MADPDiscreteStatistics(const MADPDiscreteStatistics& o) : _m_madp(o._m_madp) ,_m_h(o._m_h) { } //Destructor MADPDiscreteStatistics::~MADPDiscreteStatistics() { ; } //Copy assignment operator MADPDiscreteStatistics& MADPDiscreteStatistics::operator= (const MADPDiscreteStatistics& o) { if (this == &o) return *this; // Gracefully handle self assignment // Put the normal assignment duties here... _m_madp = o._m_madp; _m_h = o._m_h; return *this; } size_t MADPDiscreteStatistics::ComputeNrJointActionObservationHistories() { size_t nrAgents = _m_madp->GetNrAgents(); const vector& nrAcs = _m_madp->GetNrActions(); const vector& nrObs = _m_madp->GetNrObservations(); vector nrAOs(nrAgents, 0); for(Index agI=0; agI < nrAgents; agI++) nrAOs.at(agI) = nrAcs.at(agI) * nrObs.at(agI); vector nrAOH(nrAgents,0); vector nrAOH_prevStage(nrAgents,0); size_t nrJAOH=1; for(Index t=0; t < _m_h; t++) { for(Index agI=0; agI < nrAgents; agI++) { if(t==0) nrAOH.at(agI) = 1; else nrAOH.at(agI) = nrAOH_prevStage.at(agI) * nrAOs.at(agI); } size_t nrJAOH_t=VectorTools::VectorProduct(nrAOH); nrJAOH += nrJAOH_t; nrAOH_prevStage = nrAOH; } return nrJAOH; } size_t MADPDiscreteStatistics::ComputeEstimatedSizeForCachingJointBeliefs() { size_t doubleSizeInChars = sizeof(double); size_t doubleSizeInBits = doubleSizeInChars * CHAR_BIT; //the number of joint beliefs that would have to be cached size_t nrJBs = ComputeNrJointActionObservationHistories(); //the size of those joint beliefs: size_t JBSize = _m_madp->GetNrStates(); size_t JBCacheSizeInBits = nrJBs* JBSize * doubleSizeInBits; size_t JBCacheSizeInMB = (double) JBCacheSizeInBits / (8 * 1024 * 1024); return JBCacheSizeInMB; } madp-0.4/src/support/PaxHeaders.5405/PolicyGlobals.h0000644000000000000000000000012712717644275017212 xustar0029 mtime=1463765181.49770901 29 atime=1463765181.49770901 29 ctime=1463765201.62954822 madp-0.4/src/support/PolicyGlobals.h0000664000372100037210000000232712717644275020046 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _POLICYGLOBALS_H_ #define _POLICYGLOBALS_H_ 1 /* the include directives */ namespace PolicyGlobals{ /** \brief The definition of the 'PolicyDomainCategory' type. * * There are different (currently 4) PolicyDomainCategory's for * JointPolicyDiscrete's: A JointPolicyDiscrete is a mapping from * domain indices to (prob.distr over) joint actions. The * PolicyDomainCategory's are the possible domains for the domain * indices. */ enum PolicyDomainCategory {TYPE_INDEX, OHIST_INDEX, AOHIST_INDEX, STATE_INDEX}; } #endif /* !_POLICYGLOBALS_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/BeliefInterface.h0000644000000000000000000000013212717644275017452 xustar0030 mtime=1463765181.517708849 30 atime=1463765181.513708882 30 ctime=1463765201.669547901 madp-0.4/src/support/BeliefInterface.h0000664000372100037210000000775712717644275020326 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _BELIEFINTERFACE_H_ #define _BELIEFINTERFACE_H_ 1 /* the include directives */ #include #include "Globals.h" #include "VectorSet.h" class BeliefIteratorGeneric; class StateDistribution; /** \brief BeliefInterface is an interface for beliefs, i.e., * probability distributions over the state space. */ class BeliefInterface { private: protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor BeliefInterface(){}; /// Destructor. virtual ~BeliefInterface(){}; /**\brief Copy assignment operator. * * This must be implemented by the derived class (with this prototype). * For an example, see PolicyPoolJPolValPair. * * For now, this function is purely abstract. Might there be some * members added to this (base) class, then an implementation could * be made. This should then be called using * PolicyPoolInterface::operator=(o) * from the copy assignment operator of the derived class. See also * http://www.icu-project.org/docs/papers/cpp_report/the_assignment_operator_revisited.html. */ virtual BeliefInterface& operator= (const BeliefInterface& o)=0; // operators: /// Gets the probability of the i'th state. virtual double& operator[] (Index& i) = 0; /// Gets the probability of the i'th state. virtual double& operator[] (int& i) = 0; //data manipulation (set) functions: /// Copy the \a belief into this object. virtual void Set(const StateDistribution& belief) = 0; /// Copy the \a belief into this object. virtual void Set(const std::vector &belief) = 0; /// Copy the \a belief into this object. virtual void Set(const BeliefInterface &belief) = 0; /// Sets probability of the \a sI'th state to \a prob . virtual void Set(Index sI, double prob) = 0; //get (data) functions: /// Gets the probability of the sI'th state. virtual double Get(Index sI) const = 0; /// Gets a vector of probabilities representing the belief. virtual std::vector Get() const=0; /// Clears the belief. virtual void Clear() = 0; /// Prints the belief. virtual std::string SoftPrint() const = 0; /// Prints the belief. virtual void Print() const = 0; /// Returns the size of this belief. virtual unsigned int Size() const = 0; /// Checks whether the belief is a valid probability distribution. virtual bool SanityCheck() const = 0; /// Computes the inner product of a belief with the vector \a values. virtual double InnerProduct(const std::vector &values) const = 0; /// Computes the inner product of a belief with the VectorSet \a v. /** Returns the inner product with each vector in \a v. */ virtual std::vector InnerProduct(const VectorSet &v) const = 0; /// Computes the inner product of a belief with the VectorSet \a v. /** Returns the inner product with each vector in \a v, but only * for vectors whose \a mask is set to true. */ virtual std::vector InnerProduct(const VectorSet &v, const std::vector &mask) const = 0; virtual BeliefIteratorGeneric GetIterator() const = 0; /// Returns a pointer to a copy of this class. virtual BeliefInterface* Clone() const = 0; }; #endif /* !_BELIEFINTERFACE_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/BeliefIteratorGeneric.h0000644000000000000000000000013212717644275020640 xustar0030 mtime=1463765181.321710415 30 atime=1463765181.317710447 30 ctime=1463765201.673547868 madp-0.4/src/support/BeliefIteratorGeneric.h0000664000372100037210000000275412717644275021504 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _BELIEFITERATORGENERIC_H_ #define _BELIEFITERATORGENERIC_H_ 1 /* the include directives */ #include "Globals.h" #include "BeliefIteratorInterface.h" #define USE_BeliefIteratorGeneric 1 /** \brief BeliefIteratorGeneric is an iterator for beliefs. */ class BeliefIteratorGeneric { private: BeliefIteratorInterface* _m_it; protected: public: // Constructor, destructor and copy assignment. /// (default) Constructor BeliefIteratorGeneric(BeliefIteratorInterface *it) : _m_it(it) {} /// Destructor. virtual ~BeliefIteratorGeneric() { delete(_m_it); } double GetProbability() const { return(_m_it->GetProbability()); } Index GetStateIndex() const { return(_m_it->GetStateIndex()); } bool Next() const { return(_m_it->Next()); } }; #endif /* !_BELIEFITERATORGENERIC_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/PlanningUnitMADPDiscreteParameters.cpp0000644000000000000000000000013212717644275023555 xustar0030 mtime=1463765181.329710351 30 atime=1463765181.325710382 30 ctime=1463765201.737547358 madp-0.4/src/support/PlanningUnitMADPDiscreteParameters.cpp0000664000372100037210000000626312717644275024420 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "PlanningUnitMADPDiscreteParameters.h" using namespace std; //Default constructor PlanningUnitMADPDiscreteParameters::PlanningUnitMADPDiscreteParameters() { _m_individualObservationHistories=true; _m_individualActionHistories=true; _m_individualActionObservationHistories=true; _m_jointObservationHistories=true; _m_jointActionHistories=true; _m_jointActionObservationHistories=true; _m_JointBeliefs=true; _m_useSparseBeliefs=false; _m_eventObservability=false; } //Destructor PlanningUnitMADPDiscreteParameters::~PlanningUnitMADPDiscreteParameters() { } void PlanningUnitMADPDiscreteParameters::SetComputeAllJointHistories(bool val) { SetComputeJointObservationHistories(val); SetComputeJointActionHistories(val); SetComputeJointActionObservationHistories(val); } void PlanningUnitMADPDiscreteParameters::SetComputeAllIndividualHistories(bool val) { SetComputeIndividualObservationHistories(val); SetComputeIndividualActionHistories(val); SetComputeIndividualActionObservationHistories(val); } void PlanningUnitMADPDiscreteParameters::SetComputeAll(bool val) { SetComputeAllIndividualHistories(val); // order is important because of the sanity check if(val) { SetComputeAllJointHistories(val); SetComputeJointBeliefs(val); } else { SetComputeJointBeliefs(val); SetComputeAllJointHistories(val); } } void PlanningUnitMADPDiscreteParameters::Print() const { cout << "ComputeIndividualObservationHistories: " << GetComputeIndividualObservationHistories() << endl; cout << "ComputeIndividualActionHistories: " << GetComputeIndividualActionHistories() << endl; cout << "ComputeIndividualActionObservationHistories: " << GetComputeIndividualActionObservationHistories() << endl; cout << "ComputeJointObservationHistories: " << GetComputeJointObservationHistories() << endl; cout << "ComputeJointActionHistories: " << GetComputeJointActionHistories() << endl; cout << "ComputeJointActionObservationHistories: " << GetComputeJointActionObservationHistories() << endl; cout << "ComputeJointBeliefs: " << GetComputeJointBeliefs() << endl; cout << "UseSparseJointBeliefs: " << GetUseSparseJointBeliefs() << endl; } void PlanningUnitMADPDiscreteParameters::SanityCheck() const { if(GetComputeJointBeliefs() && !GetComputeJointActionObservationHistories()) { Print(); throw(E("PlanningUnitMADPDiscreteParameters::SanityCheck error, in order to compute joint beliefs all joint action observation histories also need to be generated")); } } madp-0.4/src/support/PaxHeaders.5405/NullPlanner.h0000644000000000000000000000013212717644275016675 xustar0030 mtime=1463765181.557708529 30 atime=1463765181.553708562 30 ctime=1463765201.685547772 madp-0.4/src/support/NullPlanner.h0000664000372100037210000000312112717644275017526 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _NULLPLANNER_H_ #define _NULLPLANNER_H_ 1 /* the include directives */ #include #include "Globals.h" #include "PlanningUnitDecPOMDPDiscrete.h" /** \brief NullPlanner represents a planner which does nothing, but * can be used to instantiate a PlanningUnitDecPOMDPDiscrete. */ class NullPlanner : public PlanningUnitDecPOMDPDiscrete { private: protected: public: /// (default) Constructor NullPlanner(DecPOMDPDiscreteInterface* p); NullPlanner(size_t horizon, DecPOMDPDiscreteInterface* p); NullPlanner(const PlanningUnitMADPDiscreteParameters ¶ms, size_t horizon, DecPOMDPDiscreteInterface* p); ~NullPlanner(){}; /// Only present to satisfy the interface. void Plan(); /// Only present to satisfy the interface. double GetExpectedReward() const; /// Only present to satisfy the interface. boost::shared_ptr GetJointPolicy(); }; #endif /* !_NULLPLANNER_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/ProblemFireFighting.cpp0000644000000000000000000000013112717644275020663 xustar0030 mtime=1463765181.317710447 30 atime=1463765181.313710478 29 ctime=1463765201.70954758 madp-0.4/src/support/ProblemFireFighting.cpp0000664000372100037210000004424512717644275021531 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include #include "ProblemFireFighting.h" #include "IndexTools.h" #define DEBUG_PFF 0 #define DEBUG_CTM 0 //Create Trans Model #define DEBUG_COM 0 //Create Obs Model #define DEBUG_CJA 0 #define DEBUG_CJO 0 #define DEBUG_CA 0 #define DEBUG_CO 0 using namespace std; //Default constructor ProblemFireFighting::ProblemFireFighting( size_t nrAgents, size_t nrHouses, size_t nrFLs, double costOfMove, bool forcePositionRepres) : DecPOMDPDiscrete( SoftPrintBriefDescription(nrAgents, nrHouses, nrFLs), SoftPrintDescription(nrAgents, nrHouses, nrFLs), SoftPrintBriefDescription(nrAgents, nrHouses, nrFLs) ) ,_m_nrAgents(nrAgents) ,_m_nrHouses(nrHouses) ,_m_nrFireLevels(nrFLs) { SetSparse(true); SetNrAgents(nrAgents); double S = pow((double)nrFLs, (double)nrHouses); _m_nrJointFirelevels = (size_t) S; _m_nrFLs_vec = vector(nrHouses, nrFLs); //Create states, and ISD if(costOfMove > 0.0 || forcePositionRepres) { cout << "Including position"< _m_nrStateFeatures = nrHouses+nrAgents; size_t nrPos = nrHouses+1; //include the 'start' position. _m_nrFLs_vec = vector(nrHouses, nrFLs); vector< size_t > nrPos_vec = vector(nrAgents, nrPos); _m_nrPerStateFeatureVec = _m_nrFLs_vec; _m_nrPerStateFeatureVec.insert( _m_nrPerStateFeatureVec.end(), //insert position nrPos_vec.begin(), //the stuff that is nrPos_vec.end() //appended... ); if(DEBUG_PFF) cout << "_m_nrPerStateFeatureVec=" << SoftPrintVector(_m_nrPerStateFeatureVec) << endl; size_t nrS=1; for(vector::const_iterator it = _m_nrPerStateFeatureVec.begin(); it < _m_nrPerStateFeatureVec.end(); it++) nrS *= *it; vector isd(nrS, 0.0); double nrStartStates = pow((double)nrFLs, (double)nrHouses); double ssprob = 1.0 / nrStartStates; for(Index sI = 0; sI < nrS; sI++) { vector< Index> s_vec = GetStateVector(sI); stringstream ss; ss << "S_"; Index t1; for(t1 = 0; t1 < nrHouses; t1++) ss << "f" << s_vec.at(t1); bool isStartState = true; for(; t1 < _m_nrStateFeatures; t1++) { Index hI = s_vec.at(t1); ss << "h"; if(hI == nrHouses) //start position ss << "S"; else { ss << hI; isStartState = false; } } this->AddState(ss.str()); if(isStartState) isd.at(sI) = ssprob; if(DEBUG_PFF) { cout << "added " << this->GetState(sI)->SoftPrintBrief()<SetISD(isdv); } else { cout << "Not including positions" << endl; _m_includePositions = false; //the s_vec has the form _m_nrStateFeatures = nrHouses; _m_nrPerStateFeatureVec = _m_nrFLs_vec; if(DEBUG_PFF) cout << "_m_nrPerStateFeatureVec=" << SoftPrintVector(_m_nrPerStateFeatureVec) << endl; size_t nrS = _m_nrJointFirelevels; if(DEBUG_PFF) cout << "nrStates="< s_vec = GetStateVector(sI); stringstream ss; ss << "S_" << SoftPrintVector(s_vec); this->AddState(ss.str()); if(DEBUG_PFF) { cout << "added " << this->GetState(sI)->SoftPrintBrief()<>>Creating joint actions and set..."<>>Adding Transition model..."<>>Adding Observation model..."<() ); for(Index actionI=0; actionI < nrActionsThisAgent; actionI++) { stringstream ss; //ss << "Ag" <() ); for(Index obsI=0; obsI < nrObservationsThisAgent; obsI++) { string whatObs; switch(obsI){ case(FLAMES): whatObs = "Flames__"; break; case(NOFLAMES): whatObs = "NoFlames"; break; } stringstream ss; //ss << "Ag" <& state) const { if(!_m_includePositions) return(0); size_t nrSPs = 0; //loop over the position features: for(Index i = _m_nrHouses; i < _m_nrStateFeatures; i++) if(state.at(i) == _m_nrHouses) //the 'start' postion index = nrHouses nrSPs++; return nrSPs; } void ProblemFireFighting::FillTransitionModel() { // add transitions: for(Index ja=0; ja ActionIVec; typedef std::vector ObservationIVec; /* constants */ const size_t NUMBER_OF_STATES; const size_t NUMBER_OF_AGENTS; const size_t NUMBER_OF_OBSERVATIONS; const size_t NUMBER_OF_ACTIONS; enum state_enum{ SLEFT, SRIGHT }; enum action_enum{ LISTEN, OPENLEFT, OPENRIGHT }; enum jointAction_enum{ LISTEN_LISTEN, LISTEN_OPENLEFT, LISTEN_OPENRIGHT, OPENLEFT_LISTEN, OPENLEFT_OPENLEFT, OPENLEFT_OPENRIGHT, OPENRIGHT_LISTEN, OPENRIGHT_OPENLEFT, OPENRIGHT_OPENRIGHT }; enum observation_enum{ HEARLEFT, HEARRIGHT }; enum jointObservation_enum{ HEARLEFT_HEARLEFT, HEARLEFT_HEARRIGHT, HEARRIGHT_HEARLEFT, HEARRIGHT_HEARRIGHT }; ///Construct all the Actions and actionSets (the vector _m_actionVecs). void ConstructActions(); ///Construct all the observations and observation sets. void ConstructObservations(); ///Fills the transition model with the tiger problem transitions. void FillTransitionModel(); ///Fills the observation model with the tiger problem obs. probs. void FillObservationModel(); ///Fills the reward model with the tiger problem rewards. void FillRewardModel(); protected: public: // constructors etc. /// Default constructor. ProblemDecTiger(); /// Destructor. - let compiler generate destructor //virtual ~ProblemDecTiger(); }; #endif //! _PROBLEMDECTIGER_H_ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/PlanningUnitDecPOMDPDiscrete.cpp0000644000000000000000000000013112717644275022302 xustar0029 mtime=1463765181.53770869 30 atime=1463765181.533708721 30 ctime=1463765201.737547358 madp-0.4/src/support/PlanningUnitDecPOMDPDiscrete.cpp0000664000372100037210000001302512717644275023140 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "PlanningUnitDecPOMDPDiscrete.h" #include "State.h" #include "Action.h" #include "Observation.h" #include "StateDistribution.h" #include using namespace std; //Default constructor PlanningUnitDecPOMDPDiscrete::PlanningUnitDecPOMDPDiscrete( const PlanningUnitMADPDiscreteParameters ¶ms, size_t horizon, DecPOMDPDiscreteInterface* p ) : //Referrer(p), PlanningUnitMADPDiscrete(params,horizon,p) ,_m_DecPOMDP(p) { if(DEBUG_PU_CONSTRUCTORS) cout << "PlanningUnitDecPOMDPDiscrete(PlanningUnitMADPDiscreteParameters params, size_t horizon, DecPOMDPDiscreteInterface* p) called" << endl; if(p!=0) SanityCheck(); } PlanningUnitDecPOMDPDiscrete::PlanningUnitDecPOMDPDiscrete( size_t horizon, DecPOMDPDiscreteInterface* p ) : //Referrer(p), PlanningUnitMADPDiscrete(horizon,p) ,_m_DecPOMDP(p) { if(DEBUG_PU_CONSTRUCTORS) cout << "PlanningUnitDecPOMDPDiscrete(size_t horizon, DecPOMDPDiscreteInterface* p) called" << endl; if(p!=0) SanityCheck(); } void PlanningUnitDecPOMDPDiscrete::SetProblem(DecPOMDPDiscreteInterface* p) { if(p == _m_DecPOMDP ) return; _m_DecPOMDP = p; //set (and initialize) the problem at PlanningUnitMADPDiscrete level: MultiAgentDecisionProcessDiscreteInterface* p2 = static_cast(p); PlanningUnitMADPDiscrete::SetProblem(p2); SanityCheck(); } bool PlanningUnitDecPOMDPDiscrete::SanityCheck() const { bool sane=PlanningUnitMADPDiscrete::SanityCheck(); // we cannot check anything check if(_m_DecPOMDP==0) return(sane); if(GetDiscount() < 0 || GetDiscount() > 1) { sane=false; throw(E("PlanningUnitDecPOMDPDiscrete::SanityCheck() failed, discount should be between 0 and 1")); } if(GetHorizon() == MAXHORIZON && abs(GetDiscount()-1) < PROB_PRECISION) { sane=false; throw(E("PlanningUnitDecPOMDPDiscrete::SanityCheck() failed, in the infinite-horizon case the discount should be less than one")); } return(sane); } void PlanningUnitDecPOMDPDiscrete::ExportDecPOMDPFile(const string & filename) const { ExportDecPOMDPFile(filename,GetDPOMDPD()); } /// Export is in the dpomdp file format. void PlanningUnitDecPOMDPDiscrete::ExportDecPOMDPFile( const string & filename, const DecPOMDPDiscreteInterface *decpomdp) { int nrAg=decpomdp->GetNrAgents(), nrS=decpomdp->GetNrStates(); ofstream fp(filename.c_str()); if(!fp) { stringstream ss; ss << "PlanningUnitDecPOMDPDiscrete::ExportDecPOMDPFile: failed to open file " << filename; throw(E(ss.str())); } fp << "agents: " << nrAg << endl; fp << "discount: " << decpomdp->GetDiscount() << endl; switch(decpomdp->GetRewardType()) { case REWARD: fp << "values: reward" << endl; break; case COST: fp << "values: cost" << endl; } fp << "states:"; for(int s=0;sGetState(s)->SoftPrintBrief(); fp << endl; StateDistribution* isd = decpomdp->GetISD(); fp << "start: "; for(int s0=0;s0GetProbability(s0); fp << bs << " "; } fp << endl; delete isd; fp << "actions:" << endl; for(int i=0;i!=nrAg;++i) { for(int a=0;aGetNrActions(i);a++) fp << " " << decpomdp->GetAction(i,a)->SoftPrintBrief(); fp << endl; } fp << "observations:"; for(int i=0;i!=nrAg;++i) { for(int o=0;oGetNrObservations(i);o++) fp << " " << decpomdp->GetObservation(i,o)-> SoftPrintBrief(); fp << endl; } double p; for(int a=0;aGetNrJointActions();a++) for(int s0=0;s0GetTransitionProbability(s0,a,s1); if(p!=0) { const vector &aIs=decpomdp->JointToIndividualActionIndices(a); fp << "T:"; for(int i=0;i!=nrAg;++i) fp << " " << aIs.at(i); fp << " : " << s0 << " : " << s1 << " " << p << endl; } } for(int a=0;aGetNrJointActions();a++) for(int o=0;oGetNrJointObservations();o++) for(int s1=0;s1GetObservationProbability(a,s1,o); if(p!=0) fp << "O: " << a << " : " << s1 << " : " << o << " " << p << endl; } for(int a=0;aGetNrJointActions();a++) for(int s0=0;s0GetReward(s0,a); if(p!=0) fp << "R: " << a << " : " << s0 << " : * : * " << p << endl; } } madp-0.4/src/support/PaxHeaders.5405/PlanningUnitTOIDecPOMDPDiscrete.cpp0000644000000000000000000000013212717644275022657 xustar0030 mtime=1463765181.505708945 30 atime=1463765181.505708945 30 ctime=1463765201.741547326 madp-0.4/src/support/PlanningUnitTOIDecPOMDPDiscrete.cpp0000664000372100037210000000375712717644275023527 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "PlanningUnitTOIDecPOMDPDiscrete.h" using namespace std; //Default constructor PlanningUnitTOIDecPOMDPDiscrete::PlanningUnitTOIDecPOMDPDiscrete( const PlanningUnitMADPDiscreteParameters ¶ms, size_t horizon, TOIDecPOMDPDiscrete* p ) : PlanningUnitDecPOMDPDiscrete(params,horizon,p), _m_TOIDecPOMDPDiscrete(p) { if(DEBUG_PU_CONSTRUCTORS) cout << "PlanningUnitTOIDecPOMDPDiscrete(PlanningUnitMADPDiscreteParameters params, size_t horizon, DecPOMDPDiscreteInterface* p) called" << endl; if(p!=0) SanityCheck(); } PlanningUnitTOIDecPOMDPDiscrete::PlanningUnitTOIDecPOMDPDiscrete( size_t horizon, TOIDecPOMDPDiscrete* p ) : PlanningUnitDecPOMDPDiscrete(horizon,p), _m_TOIDecPOMDPDiscrete(p) { if(DEBUG_PU_CONSTRUCTORS) cout << "PlanningUnitTOIDecPOMDPDiscrete(size_t horizon, DecPOMDPDiscreteInterface* p) called" << endl; if(p!=0) SanityCheck(); } void PlanningUnitTOIDecPOMDPDiscrete::SetProblem(TOIDecPOMDPDiscrete* p) { if(p == _m_TOIDecPOMDPDiscrete) return; _m_TOIDecPOMDPDiscrete=p; #if 0 //set (and initialize) the problem at PlanningUnitDecPOMDPDiscrete level: DecPOMDPDiscreteInterface* p2 = static_cast(p); #endif PlanningUnitDecPOMDPDiscrete::SetProblem(p); SanityCheck(); } bool PlanningUnitTOIDecPOMDPDiscrete::SanityCheck() const { bool sane=PlanningUnitDecPOMDPDiscrete::SanityCheck(); return(sane); } madp-0.4/src/support/PaxHeaders.5405/ProblemDecTiger.cpp0000644000000000000000000000013112717644275020004 xustar0030 mtime=1463765181.485709106 30 atime=1463765181.481709137 29 ctime=1463765201.70954758 madp-0.4/src/support/ProblemDecTiger.cpp0000664000372100037210000002203712717644275020645 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "ProblemDecTiger.h" using namespace std; #define DEBUG_PDT 0 #define DEBUG_TM 0 #define DEBUG_CJA 0 #define DEBUG_CJO 0 #define DEBUG_CA 0 #define DEBUG_CO 0 #define DEBUG_GETJA 0 ProblemDecTiger::ProblemDecTiger() : DecPOMDPDiscrete( "The Dec-Tiger Problem", "A toy problem, 2-agent Dec-POMDP. 2 agents have to select 1 out of 2 doors, behind one is a tiger, behind the other treasure.", "DecTiger"), NUMBER_OF_STATES(2), NUMBER_OF_AGENTS(2), NUMBER_OF_OBSERVATIONS(2), NUMBER_OF_ACTIONS(3) { SetNrAgents(NUMBER_OF_AGENTS); SetNrStates(NUMBER_OF_STATES); SetUniformISD(); SetDiscount(1); // add actions: ConstructActions(); if(DEBUG_CJA) cout << "\n>>>Creating joint actions and set...\n"<>>Adding Transition model...\n"<>>Adding Observation model...\n"< av_temp; //is copied into back of _m_actionVecs, so no need for new... // _m_actionVecs.push_back( av_temp ); if(DEBUG_CA) cout << "inserted the new(=empty) actionSet"<> strAgentI; name += strAgentI; ss.clear(); ss << actionI; ss >> strActionI; name += strActionI; string whatAction; switch(actionI){ case(LISTEN): whatAction = "Listen"; break; case(OPENLEFT): whatAction = "OpenLeft"; break; case(OPENRIGHT):whatAction = "OpenRight"; break; } name += ":" + whatAction; string descr("Action "); descr += whatAction+" - #"; descr += strActionI + " of agent " + strAgentI; // ActionDiscrete ad_temp = ActionDiscrete(actionI,name,descr); // _m_actionVecs[agentIndex].push_back( ad_temp ); AddAction(agentIndex, name, descr); name.clear(); strActionI.clear(); strAgentI.clear(); whatAction.clear(); descr.clear(); } } } void ProblemDecTiger::ConstructObservations() { /// add observations: size_t nrJointObservations = 1; for(Index agentIndex=0; agentIndex < _m_nrAgents; agentIndex++) { size_t nrObservationsThisAgent = NUMBER_OF_OBSERVATIONS; nrJointObservations *= nrObservationsThisAgent; // _m_nrObservations.push_back(nrObservationsThisAgent); // vector ov_temp; //Again, this is copied into _m_observationVecs, so no 'new' needed // _m_observationVecs.push_back( ov_temp ); for(Index obsI=0; obsI < nrObservationsThisAgent; obsI++) { string name("o"); stringstream ss; string strObsI, strAgentI; ss << agentIndex; ss >> strAgentI; name += strAgentI; ss.clear(); ss << obsI; ss >> strObsI; name += strObsI; string whatObs; switch(obsI){ case(HEARLEFT): whatObs = "HearLeft"; break; case(HEARRIGHT):whatObs = "HearRight"; break; } name += ":" + whatObs; string descr("Observation "); descr += whatObs + " - #"; descr += strObsI + " of agent " + strAgentI; // ObservationDiscrete od_temp = ObservationDiscrete(obsI,name,descr); // _m_observationVecs[agentIndex].push_back( od_temp ); AddObservation(agentIndex,name,descr); name.clear(); strObsI.clear(); strAgentI.clear(); whatObs.clear(); descr.clear(); } } } void ProblemDecTiger::FillTransitionModel() { // add transitions: for(Index s1=0; s1 #include "Globals.h" /** \brief PlanningUnitMADPDiscreteParameters stores parameters of * PlanningUnitMADPDiscrete. * * It controls which types of histories are generated when * initializing the PlanningUnitMADPDiscrete. What to generate depends * on the particular planning algorithm derived from it, for instance, * some algorithms use joint beliefs, others don't (in which case * there is no point in generating and storing them). This class also * indicates whether joint beliefs should represented sparsely or not. **/ class PlanningUnitMADPDiscreteParameters { private: /// Generate individual observation histories or not. bool _m_individualObservationHistories; /// Generate individual action histories or not. bool _m_individualActionHistories; /// Generate individual action-observation histories or not. bool _m_individualActionObservationHistories; /// Generate joint observation histories or not. bool _m_jointObservationHistories; /// Generate joint action histories or not. bool _m_jointActionHistories; /** \brief Whether or not joint action observation histories are * generated and stored. * * If they are stored, also their (conditional) probabilities are * cached.*/ bool _m_jointActionObservationHistories; /** \brief Whether joint beliefs are cached. * * Only applicable when jointActionObservationHistories are * generated.).*/ bool _m_JointBeliefs; /// Use sparse beliefs or the full representation. bool _m_useSparseBeliefs; /**\brief Indicate whether the observation model * is defined over (s',a,s) (an event-driven model) * or the standard (s',a)*/ bool _m_eventObservability; protected: public: /// Ensures no illegal combination of parameters has been set. /**Sanity check is called by the constructor of PlanningUnitMADPDiscrete. * * The old procedure "Is called after each call to a Set function." * made no sense, as it was not possible to do * params.SetComputeJointActionHistories(false); * params.SetComputeJointBeliefs(false); * as it started complaining at the first call... * */ void SanityCheck() const; // Constructor, destructor and copy assignment. /// Default constructor. /** By default, all histories are generated, joint beliefs are * cached and not represented sparsely. */ PlanningUnitMADPDiscreteParameters(); /// Destructor. ~PlanningUnitMADPDiscreteParameters(); /// Switch on or off the generation of all joint histories. void SetComputeAllJointHistories(bool val); /// Switch on or off the generation of all individual histories. void SetComputeAllIndividualHistories(bool val); /// Switch on or off the generation of all histories. void SetComputeAll(bool val); /// Switch on or off the generation of individual observation histories. void SetComputeIndividualObservationHistories(bool val){ _m_individualObservationHistories = val; } /// Switch on or off the generation of individual action histories. void SetComputeIndividualActionHistories(bool val){ _m_individualActionHistories = val; } /// Switch on or off the generation of individual action-observation histories. void SetComputeIndividualActionObservationHistories(bool val){ _m_individualActionObservationHistories = val; } /// Switch on or off the generation of joint observation histories. void SetComputeJointObservationHistories(bool val){ _m_jointObservationHistories = val; } /// Switch on or off the generation of joint action histories. void SetComputeJointActionHistories(bool val){ _m_jointActionHistories = val; } /// Switch on or off the generation of joint action-observation histories. void SetComputeJointActionObservationHistories(bool val){ _m_jointActionObservationHistories = val; } /// Switch on or off storing the joint beliefs. void SetComputeJointBeliefs(bool val){ _m_JointBeliefs = val; } /// Switch on or off whether joint beliefs should be represented sparsely. void SetUseSparseJointBeliefs(bool val){ _m_useSparseBeliefs = val; } /// Switch on or off the use of PS-dependent observation models. void SetEventObservability(bool val){ _m_eventObservability = val; } /// Are individual observation histories generated or not. bool GetComputeIndividualObservationHistories() const{ return(_m_individualObservationHistories); } /// Are individual action histories generated or not. bool GetComputeIndividualActionHistories() const{ return(_m_individualActionHistories); } /// Are individual action-observation histories generated or not. bool GetComputeIndividualActionObservationHistories() const{ return(_m_individualActionObservationHistories); } /// Are joint observation histories generated or not. bool GetComputeJointObservationHistories() const{ return(_m_jointObservationHistories); } /// Are joint action histories generated or not. bool GetComputeJointActionHistories() const{ return(_m_jointActionHistories); } /// Are joint action-observation histories generated or not. bool GetComputeJointActionObservationHistories() const{ return(_m_jointActionObservationHistories); } /// Are the joint beliefs cached or not. bool GetComputeJointBeliefs() const{ return(_m_JointBeliefs); } /// Are sparse beliefs used or not. bool GetUseSparseJointBeliefs() const{ return(_m_useSparseBeliefs); } /// Observable states or observable transitions. bool GetEventObservability() const{ return(_m_eventObservability); } /// Print out the parameters to cout. void Print() const; }; #endif /* !_PLANNINGUNITMADPDISCRETEPARAMETERS_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/FixedCapacityPriorityQueue.h0000644000000000000000000000013212717644275021727 xustar0030 mtime=1463765181.409709712 30 atime=1463765181.409709712 30 ctime=1463765201.689547741 madp-0.4/src/support/FixedCapacityPriorityQueue.h0000664000372100037210000001171112717644275022564 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _FIXEDCAPACITYPRIORITYQUEUE_H_ #define _FIXEDCAPACITYPRIORITYQUEUE_H_ 1 /* the include directives */ #include "Globals.h" #include /** \brief FixedCapacityPriorityQueue is a class that represents * a priority queue with a fixed size. * * -all overflowed items (i.e., items that do not fit) * are returned, such that the user can delete them * * */ template > class FixedCapacityPriorityQueue { private: std::list _m_l; size_t _m_capacity; protected: public: // Constructor, destructor and copy assignment. // /// (default) Constructor FixedCapacityPriorityQueue(size_t capacity) : _m_capacity(capacity) { }; //operators: //data manipulation (set) functions: /**\brief inserts a in the priority q. * * returns true if the capacity overflows * in this case, overflown_T is set to the overflown value * (which can then be recovered or deleted by the user). */ bool insert( T& a, T& overflown_T ); //get (data) functions: bool empty() const {return _m_l.empty();} const T& top() const { return _m_l.front(); } //highest priority (value) at the front void pop() { _m_l.pop_front(); } const T& back() const {return _m_l.back(); } size_t size() const {return _m_l.size();} std::string SoftPrint() const { std::stringstream ss; size_t i=0; typename std::list::const_iterator it = _m_l.begin(); while(it!=_m_l.end()) { ss << "FixedCapacityPriorityQueue item number " << i << std::endl; ss << (*it)->SoftPrint() << std::endl; it++; i++; } return(ss.str()); } }; #define DEBUG_FCPQ 0 //template template bool FixedCapacityPriorityQueue::insert( T& a, T& overflown_T ) { bool overflow = ( _m_l.size() == _m_capacity); bool skip_insert = false; if(overflow) //check if we need to make space at the end { // overflown_Tp is the T* to which overflown_Tpp points // we set the former to point to the overflown element. //T* & overflown_Tp = *overflown_Tpp; T& last_in_queue = _m_l.back(); //std::less< T > theLessOp; _Compare theLessOp; if( theLessOp( last_in_queue, a) ) //if( last_in_queue < a ) //doesn't work automatically... { //This does not work with (or need) pointers, //this simply points to last position in queue !!! //overflown_Tp = &last_in_queue; //rather copy the value of the stuff we will throw out! overflown_T = last_in_queue; _m_l.pop_back(); } else { overflown_T = a; skip_insert = true; } } if(!skip_insert) { //insert a at the appropriate place typename std::list::iterator it = _m_l.begin(); typename std::list::iterator last = _m_l.end(); bool not_positioned = true; //so long as it does not point to the correct pos. //std::less< T > theLessOp; _Compare theLessOp; while(it != last && not_positioned) { if( theLessOp( *it, a ) ) not_positioned = false; else it++; } _m_l.insert( it, a); } #if 0 && DEBUG_FCPQ std::cout << "----AFTER POP AND INSERT\nthe overflown_Tp=" < #include "Globals.h" #include "E.h" #include "IndividualHistory.h" class PlanningUnitMADPDiscrete; //forward declaration to avoid including each other /// ObservationHistory represents an action history of a single agent. /** * It does so by storing an index and a pointer to a preceeding * observation history. */ class ObservationHistory : public IndividualHistory { private: ///The last observation (index). Index _m_observationI; /**True if the last observation (index) is empty (i.e., there is * no last observation.) This is particularly true for a * observation history at time step t=0 in a MADP that does not issue * an initial observation. (this behavior is defined in * MADPComponentDiscreteObservations)*/ bool _m_containsEmptyOI; /**The predecessor observation hist. Together with the last joint * observation(_m_observationI) this gives a full description of * this observation history.*/ ObservationHistory* _m_pred; ///ref to the pu PlanningUnitMADPDiscrete* _m_PlanningUnitMADPDiscrete; protected: public: // Constructor, destructor and copy assignment. /**(default) Constructor - creates a new initial (=empty) * ObservationHistory for agent agentI*/ ObservationHistory(PlanningUnitMADPDiscrete& pu, Index agentI); /**Creates a initial observation history specifying obsI as the * observation at time step t=0 (o^t=0) */ ObservationHistory(PlanningUnitMADPDiscrete& pu, Index agentI, Index obsI); /**Creates a observation history specifying obsI for the last * observation and pred as the preceeding ObservationHistory.*/ ObservationHistory(Index obsI, ObservationHistory* pred); /// Copy constructor. //ObservationHistory(const ObservationHistory& a); /// Destructor. ~ObservationHistory(); //operators: //data manipulation (set) functions: //get (data) functions: /// Check whether this history contains an empty observation. bool ContainsEmptyOI() const {return _m_containsEmptyOI;} ///Return a reference to the Observation history that precedes this. const ObservationHistory* GetPredecessor() const {return _m_pred;} ///Returns the index of the last observation. Index GetLastObservationIndex() const { return _m_observationI; } //other /// Returns a pointer to a copy of this class. virtual ObservationHistory* Clone() const { return new ObservationHistory(*this); } /// Prints a description of *this* to a string. std::string SoftPrint() const; ///Print *this* to cout. void Print() const { std::cout << SoftPrint();} }; #endif /* !_OBSERVATIONHISTORY_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/support/PaxHeaders.5405/JointPolicyDiscrete.cpp0000644000000000000000000000013212717644275020724 xustar0030 mtime=1463765181.305710543 30 atime=1463765181.305710543 30 ctime=1463765201.697547676 madp-0.4/src/support/JointPolicyDiscrete.cpp0000664000372100037210000000745712717644275021575 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "JointPolicyDiscrete.h" #include "PolicyDiscrete.h" using namespace std; //Default constructor JointPolicyDiscrete::JointPolicyDiscrete(const Interface_ProblemToPolicyDiscrete* iptpd, PolicyGlobals::PolicyDomainCategory idc ) : JointPolicy(iptpd->GetNrAgents()) ,_m_indexDomCat( idc ) ,_m_PTPD(iptpd), _m_PTPDshared() { } //Default constructor JointPolicyDiscrete::JointPolicyDiscrete(const I_PtPD_constPtr &iptpd, PolicyGlobals::PolicyDomainCategory idc ) : JointPolicy(iptpd->GetNrAgents()) ,_m_indexDomCat( idc ) ,_m_PTPD(0) ,_m_PTPDshared(iptpd) { } //Copy constructor. JointPolicyDiscrete::JointPolicyDiscrete(const JointPolicyDiscrete& o) : JointPolicy(o) ,_m_indexDomCat(o._m_indexDomCat) ,_m_PTPD(o._m_PTPD) ,_m_PTPDshared(o._m_PTPDshared) { } JointPolicyDiscrete& JointPolicyDiscrete::operator= (const JointPolicyDiscrete& o) { #if DEBUG_JPOLASSIGN cerr << "JointPolicyDiscrete::operator= (const JointPolicyDiscrete& o) called"<& indivDomIndices , vector& sampled_aIs ) const { sampled_aIs.resize(_m_nrAgents); for(Index agI=0; agI < _m_nrAgents; agI++) { PolicyDiscrete* p = GetIndividualPolicyDiscrete(agI); Index agI_domI = indivDomIndices.at(agI); sampled_aIs.at(agI) = p->SampleAction(agI_domI); } return; } Index JointPolicyDiscrete::SampleJointAction( const vector& indivDomIndices ) const { vector sampled_aIs; SampleJointActionVector(indivDomIndices, sampled_aIs); Index ja = GetInterfacePTPDiscrete()->IndividualToJointActionIndices(sampled_aIs); return ja; } void JointPolicyDiscrete::SampleJointActionVector( Index i, vector& sampled_aIs ) const { if( GetInterfacePTPDiscrete()->AreCachedJointToIndivIndices(_m_indexDomCat) ) { const vector& indivDomIndices = GetInterfacePTPDiscrete()-> JointToIndividualPolicyDomainIndicesRef (i, _m_indexDomCat); return( SampleJointActionVector( indivDomIndices, sampled_aIs) ); } else { vector indivDomIndices = GetInterfacePTPDiscrete()-> JointToIndividualPolicyDomainIndices(i, _m_indexDomCat); return( SampleJointActionVector( indivDomIndices, sampled_aIs) ); } } Index JointPolicyDiscrete::SampleJointAction( Index i ) const { if( GetInterfacePTPDiscrete()->AreCachedJointToIndivIndices(_m_indexDomCat) ) { const vector& indivDomIndices = GetInterfacePTPDiscrete()-> JointToIndividualPolicyDomainIndicesRef (i, _m_indexDomCat); return( SampleJointAction( indivDomIndices) ); } else { vector indivDomIndices = GetInterfacePTPDiscrete()-> JointToIndividualPolicyDomainIndices(i, _m_indexDomCat); return( SampleJointAction( indivDomIndices) ); } } madp-0.4/src/support/PaxHeaders.5405/QTable.cpp0000644000000000000000000000013212717644275016146 xustar0030 mtime=1463765181.553708562 30 atime=1463765181.549708594 30 ctime=1463765201.749547262 madp-0.4/src/support/QTable.cpp0000664000372100037210000000744212717644275017011 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "QTable.h" #include using namespace std; void QTable::Load(const std::string &filename, size_t nrRows, size_t nrColumns, QTable &Q) { ifstream fp(filename.c_str()); if(!fp) { cerr << "QTable::Load: failed to " << "open file " << filename << endl; } size_t a,s; double q; // QTable Q(nrRows,nrColumns); try { Q.resize(nrRows,nrColumns); } catch(std::bad_alloc &e) { cout << "QTable::Load ran out of memory resizing QTable" << endl; throw(e); } s=0; string buffer; while(!getline(fp,buffer).eof()) { istringstream is(buffer); a=0; while(is >> q) Q(s,a++)=q; if(a!=nrColumns) throw(E("QTable::Load wrong number of columns")); s++; } if(s!=nrRows) throw(E("QTable::Load wrong number of rows")); } void QTable::Load(const std::string &filename, size_t nrRows, size_t nrColumns, size_t nrTables, QTables &Qs) { ifstream fp(filename.c_str()); if(!fp) { cerr << "QTable::Load: failed to " << "open file " << filename << endl; } size_t a,s,i; double q; QTable Q(nrRows,nrColumns); // QTables Qs; Qs.clear(); for(i=0;i!=nrTables;i++) Qs.push_back(Q); s=0; i=0; string buffer; while(!getline(fp,buffer).eof()) { istringstream is(buffer); a=0; while(is >> q) Qs[i](s,a++)=q; if(a!=nrColumns) throw(E("QTable::Load wrong number of columns")); s++; if(s==nrRows) { i++; s=0; } } if(i!=nrTables) throw(E("QTable::Load wrong number of tables")); } void QTable::Save(const QTable &Q, const std::string &filename) { ofstream fp(filename.c_str()); if(!fp) { stringstream ss; ss << "QTable::Save: failed to open file " << filename << endl; throw E(ss.str()); } fp.precision(16); size_t nrRows=Q.size1(), nrColumns=Q.size2(); for(size_t s=0;s!=nrRows;++s) { for(size_t a=0;a!=nrColumns;++a) { fp << Q(s,a); if(a!=nrColumns-1) fp << " "; } fp << endl; } } void QTable::Save(const QTables &Qs, const std::string &filename) { ofstream fp(filename.c_str()); if(!fp) { stringstream ss; ss << "QTable::Save: failed to open file " << filename << endl; throw E(ss); } fp.precision(16); size_t nrRows=Qs[0].size1(), nrColumns=Qs[0].size2(), h=Qs.size(); for(size_t k=0;k!=h;++k) for(size_t s=0;s!=nrRows;++s) { for(size_t a=0;a!=nrColumns;++a) { fp << Qs[k](s,a); if(a!=nrColumns-1) fp << " "; } fp << endl; } } void QTable::SetToZero() { size_t nrRows=this->size1(), nrColumns=this->size2(); for(size_t s=0;s!=nrRows;++s) for(size_t a=0;a!=nrColumns;++a) Set(s,a,0.0); } madp-0.4/src/support/PaxHeaders.5405/JointBelief.cpp0000644000000000000000000000013112717644275017167 xustar0029 mtime=1463765181.49770901 30 atime=1463765181.493709041 30 ctime=1463765201.729547421 madp-0.4/src/support/JointBelief.cpp0000664000372100037210000001402612717644275020027 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ #include "JointBelief.h" #include //Necessary as header file contains a forward declaration: #include "MultiAgentDecisionProcessDiscreteInterface.h" #include #include "TGet.h" using namespace std; #define JointBelief_doSanityCheckAfterEveryUpdate 0 JointBelief::JointBelief(size_t size) : Belief(size) { } JointBelief::JointBelief(const vector &belief) : Belief(belief) { } JointBelief::JointBelief(const JointBeliefInterface &belief) : Belief(belief) { } JointBelief::JointBelief(const StateDistribution& belief): Belief(belief) {} //Destructor JointBelief::~JointBelief() { } JointBelief& JointBelief::operator= (const JointBelief& o) { if (this == &o) return *this; // Gracefully handle self assignment Belief::operator=(o); return(*this); } JointBeliefInterface& JointBelief::operator= (const JointBeliefInterface& o) { //this code is called when we perform // jb1 = jb2 // and jb1 is a JointBelief (I.e., this is the operator= function of jb1 // and *this* is a JointBelief, since we got here) // // Therefore this code assumes that jb2 (I.e., 'o') is also a JointBelief // (and not a JointBeliefSparse or something like that). // // If it is something else, we get in trouble here! if (this == &o) return *this; // Gracefully handle self assignment try{ const JointBelief& casted_o = dynamic_cast(o); return(operator=(casted_o));// call the operator= for JointBelief }catch(std::bad_cast bc){ throw E("JointBelief::operator= bad_cast exception. Are you trying to assign me (a JointBelief) with some other JointBeliefInterface (e.g. JointBeliefSparse) ??"); } } double JointBelief::Update(const MultiAgentDecisionProcessDiscreteInterface &pu, Index lastJAI, Index newJOI) { double Po_ba = 0.0; // P(o|b,a) with o=newJO vector newJB_unnorm; size_t nrS = pu.GetNrStates(); TGet* T = 0; T = pu.GetTGet(); if(T != 0) { for(Index sI=0; sI < nrS; sI++) { double Pso_ba = 0.0; if(!pu.GetEventObservability()) { //P(newJOI | lastJAI, sI) : double Po_as = pu.GetObservationProbability(lastJAI, sI, newJOI); //P(sI | b, a) = sum_(prec_s) P(sI | prec_s, a)*JB(prec_s) double Ps_ba = 0.0; //for(BScit it=_m_b.begin(); it!=_m_b.end(); ++it) //Ps_ba += T->Get(it.index(), lastJAI, sI) * *it; for(Index prec_sI=0; prec_sI < nrS; prec_sI++) Ps_ba += T->Get(prec_sI, lastJAI, sI) * _m_b[prec_sI]; //Ps_ba += pu.GetTransitionProbability(prec_sI, lastJAI, sI) * //_m_b[prec_sI]; //the new (unormalized) belief P(s,o|b,a) Pso_ba = Po_as * Ps_ba; } else { for(Index prec_sI=0; prec_sI < nrS; prec_sI++) { //P(newJOI | prec_sI, lastJAI, sI) : double Po_sas = pu.GetObservationProbability(prec_sI, lastJAI, sI, newJOI); //P(sI, newJOI | b, a) = sum_(prec_s) P(newJOI | prec_sI, lastJAI, sI)*P(sI | prec_s, a)* JB(prec_s) Pso_ba += Po_sas * T->Get(prec_sI, lastJAI, sI) * _m_b[prec_sI]; } } newJB_unnorm.push_back(Pso_ba); //unormalized new belief Po_ba += Pso_ba; //running sum of P(o|b,a) } } else { for(Index sI=0; sI < nrS; sI++) { double Pso_ba = 0.0; if(!pu.GetEventObservability()) { //P(newJOI | lastJAI, sI) : double Po_as = pu.GetObservationProbability(lastJAI, sI, newJOI); //P(sI | b, a) = sum_(prec_s) P(sI | prec_s, a)*JB(prec_s) double Ps_ba = 0.0; //for(BScit it=_m_b.begin(); it!=_m_b.end(); ++it) //Ps_ba += T->Get(it.index(), lastJAI, sI) * *it; for(Index prec_sI=0; prec_sI < nrS; prec_sI++) Ps_ba += pu.GetTransitionProbability(prec_sI, lastJAI, sI) * _m_b[prec_sI]; //the new (unormalized) belief P(s,o|b,a) Pso_ba = Po_as * Ps_ba; } else { for(Index prec_sI=0; prec_sI < nrS; prec_sI++) { //P(newJOI | prec_sI, lastJAI, sI) : double Po_sas = pu.GetObservationProbability(prec_sI, lastJAI, sI, newJOI); //P(sI, newJOI | b, a) = sum_(prec_s) P(newJOI | prec_sI, lastJAI, sI)*P(sI | prec_s, a)* JB(prec_s) Pso_ba += Po_sas * pu.GetTransitionProbability(prec_sI, lastJAI, sI) * _m_b[prec_sI]; } } newJB_unnorm.push_back(Pso_ba); //unormalized new belief Po_ba += Pso_ba; //running sum of P(o|b,a) } //throw E("JointBelief::Update tried to obtain a TGet, but apparently the transition model is not cached? (it should be, since this belief update loops over all states it should be possible to cache the transition model)"); } //normalize: if(Po_ba>0) for(Index sI=0; sI < nrS; sI++) _m_b[sI]=newJB_unnorm[sI]/Po_ba; delete T; #if JointBelief_doSanityCheckAfterEveryUpdate if(!SanityCheck()) throw(E("JointBelief::Update SanityCheck failed")); #endif return(Po_ba); } madp-0.4/src/support/PaxHeaders.5405/ProblemAloha.h0000644000000000000000000000013212717644275017010 xustar0030 mtime=1463765181.421709616 30 atime=1463765181.417709648 30 ctime=1463765201.641548124 madp-0.4/src/support/ProblemAloha.h0000664000372100037210000000757312717644275017660 0ustar00fransfrans00000000000000/* This file is part of the Multiagent Decision Process (MADP) Toolbox. * * The majority of MADP is free software released under GNUP GPL v.3. However, * some of the included libraries are released under a different license. For * more information, see the included COPYING file. For other information, * please refer to the included README file. * * This file has been written and/or modified by the following people: * * Frans Oliehoek * Matthijs Spaan * * For contact information please see the included AUTHORS file. */ /* Only include this header file once. */ #ifndef _PROBLEMALOHA_H_ #define _PROBLEMALOHA_H_ 1 /* the include directives */ #include "Globals.h" #include "FactoredDecPOMDPDiscrete.h" class ProblemAloha : public FactoredDecPOMDPDiscrete { public: enum IslandConfiguration { TwoIslands, OneIsland, TwoIndependentIslands, ThreeIslandsInLine, ThreeIslandsClustered, SmallBigSmallInLine, FiveIslandsInLine, FourIslandsInLine, FourIslandsInSquare, SixIslandsInLine, SevenIslandsInLine, InLine}; enum AlohaVariation { NoNewPacket, NewPacket, NewPacketSendAll, NewPacketProgressivePenalty }; private: IslandConfiguration _m_islandConf; AlohaVariation _m_variation; size_t _m_maxBacklog; size_t _m_nrIslands; size_t _m_nrAgentsPassedOnCommandline; void ConstructActions(); void ConstructObservations(); bool areNeighbors(Index x1, Index x2) const; double GetNewPacketProb(Index y) const; double backlogToReward(Index backlog) const; std::string transmissionStatusToString(Index status) const; size_t *_m_stepSizeState; size_t *_m_stepSizeObservations; void splitState(Index sI, Index &backlog, Index &newPacket) const; Index composeState(Index backlog, Index newPacket) const; void splitObservation(Index oI, Index &status, Index &newPacket) const; Index composeObservation(Index status, Index newPacket) const; protected: enum { SEND, IDLEa }; enum { SUCCESS, IDLEo, COLLISION }; void InitializeAloha(); virtual std::string SoftPrintBriefDescription() const; virtual std::string SoftPrintDescription() const; virtual std::string SoftPrintVariation(AlohaVariation variation) const; virtual bool successFullySendPackage(Index y, const std::vector< Index>& Xs, const std::vector< Index>& As) const; //overide scope functions virtual void SetYScopes(); virtual void SetOScopes(); double ComputeTransitionProb( Index y, Index yVal, const std::vector< Index>& Xs, const std::vector< Index>& As, const std::vector< Index>& Ys ) const; double ComputeObservationProb( Index o, Index oVal, const std::vector< Index>& As, const std::vector< Index>& Ys, const std::vector< Index>& Os ) const; public: // Constructor, destructor and copy assignment. /// (default) Constructor ProblemAloha(IslandConfiguration islands, AlohaVariation variation, size_t maxBacklog=2, size_t nrAgents=2, bool initialize=true); /// Destructor. virtual ~ProblemAloha(){}; static std::string IslandConfigToString(IslandConfiguration conf); /// Returns a pointer to a copy of this class. virtual ProblemAloha* Clone() const { return new ProblemAloha(*this); } AlohaVariation GetVariation() const { return(_m_variation); } size_t GetMaxBacklog() const { return(_m_maxBacklog); } IslandConfiguration GetIslandConfiguration() const { return(_m_islandConf); } }; #endif /* !_PROBLEMALOHA_H_ */ // Local Variables: *** // mode:c++ *** // End: *** madp-0.4/src/PaxHeaders.5405/boost0000644000000000000000000000007412717644140013623 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.189551735 madp-0.4/src/boost/0000775000372100037210000000000012717644140014527 5ustar00fransfrans00000000000000madp-0.4/src/boost/PaxHeaders.5405/README0000644000000000000000000000007312717644140014557 xustar0030 atime=1463765180.093720222 29 ctime=1463765201.03355298 madp-0.4/src/boost/README0000664000372100037210000000015412717644140015407 0ustar00fransfrans00000000000000This are the pieces of the Boost C++ libraries that are used in the MADP Toolbox. Copied from Boost 1.55.0. madp-0.4/src/boost/PaxHeaders.5405/boost0000644000000000000000000000007412717644140014751 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.189551735 madp-0.4/src/boost/boost/0000775000372100037210000000000012717644140015655 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/PaxHeaders.5405/mem_fn.hpp0000644000000000000000000000007412717644140017000 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/mem_fn.hpp0000664000372100037210000000112412717644140017625 0ustar00fransfrans00000000000000#ifndef BOOST_MEM_FN_HPP_INCLUDED #define BOOST_MEM_FN_HPP_INCLUDED // MS compatible compilers support #pragma once #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once #endif // // mem_fn.hpp - a generalization of std::mem_fun[_ref] // // Copyright (c) 2009 Peter Dimov // // Distributed under the Boost Software License, Version 1.0. // See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt // // See http://www.boost.org/libs/bind/mem_fn.html for documentation. // #include #endif // #ifndef BOOST_MEM_FN_HPP_INCLUDED madp-0.4/src/boost/boost/PaxHeaders.5405/shared_ptr.hpp0000644000000000000000000000007412717644140017672 xustar0030 atime=1463765180.165719647 30 ctime=1463765201.157551989 madp-0.4/src/boost/boost/shared_ptr.hpp0000664000372100037210000000103312717644140020516 0ustar00fransfrans00000000000000#ifndef BOOST_SHARED_PTR_HPP_INCLUDED #define BOOST_SHARED_PTR_HPP_INCLUDED // // shared_ptr.hpp // // (C) Copyright Greg Colvin and Beman Dawes 1998, 1999. // Copyright (c) 2001-2008 Peter Dimov // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/smart_ptr/shared_ptr.htm for documentation. // #include #endif // #ifndef BOOST_SHARED_PTR_HPP_INCLUDED madp-0.4/src/boost/boost/PaxHeaders.5405/version.hpp0000644000000000000000000000007412717644140017224 xustar0030 atime=1463765180.189719456 30 ctime=1463765201.189551735 madp-0.4/src/boost/boost/version.hpp0000664000372100037210000000214112717644140020051 0ustar00fransfrans00000000000000// Boost version.hpp configuration header file ------------------------------// // (C) Copyright John maddock 1999. Distributed under the Boost // Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // See http://www.boost.org/libs/config for documentation #ifndef BOOST_VERSION_HPP #define BOOST_VERSION_HPP // // Caution, this is the only boost header that is guarenteed // to change with every boost release, including this header // will cause a recompile every time a new boost version is // released. // // BOOST_VERSION % 100 is the patch level // BOOST_VERSION / 100 % 1000 is the minor version // BOOST_VERSION / 100000 is the major version #define BOOST_VERSION 105500 // // BOOST_LIB_VERSION must be defined to be the same as BOOST_VERSION // but as a *string* in the form "x_y[_z]" where x is the major version // number, y is the minor version number, and z is the patch level if not 0. // This is used by to select which library version to link to. #define BOOST_LIB_VERSION "1_55" #endif madp-0.4/src/boost/boost/PaxHeaders.5405/ref.hpp0000644000000000000000000000007412717644140016313 xustar0030 atime=1463765180.165719647 30 ctime=1463765201.153552022 madp-0.4/src/boost/boost/ref.hpp0000664000372100037210000000752612717644140017154 0ustar00fransfrans00000000000000#ifndef BOOST_REF_HPP_INCLUDED #define BOOST_REF_HPP_INCLUDED // MS compatible compilers support #pragma once #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once #endif #include #include #include #include // // ref.hpp - ref/cref, useful helper functions // // Copyright (C) 1999, 2000 Jaakko Jarvi (jaakko.jarvi@cs.utu.fi) // Copyright (C) 2001, 2002 Peter Dimov // Copyright (C) 2002 David Abrahams // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/bind/ref.html for documentation. // namespace boost { template class reference_wrapper { public: typedef T type; #if defined( BOOST_MSVC ) && BOOST_WORKAROUND( BOOST_MSVC, < 1300 ) explicit reference_wrapper(T& t): t_(&t) {} #else explicit reference_wrapper(T& t): t_(boost::addressof(t)) {} #endif operator T& () const { return *t_; } T& get() const { return *t_; } T* get_pointer() const { return t_; } private: T* t_; }; # if defined( __BORLANDC__ ) && BOOST_WORKAROUND( __BORLANDC__, BOOST_TESTED_AT(0x581) ) # define BOOST_REF_CONST # else # define BOOST_REF_CONST const # endif template inline reference_wrapper BOOST_REF_CONST ref(T & t) { return reference_wrapper(t); } template inline reference_wrapper BOOST_REF_CONST cref(T const & t) { return reference_wrapper(t); } # undef BOOST_REF_CONST # ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION template class is_reference_wrapper : public mpl::false_ { }; template class unwrap_reference { public: typedef T type; }; # define AUX_REFERENCE_WRAPPER_METAFUNCTIONS_DEF(X) \ template \ class is_reference_wrapper< X > \ : public mpl::true_ \ { \ }; \ \ template \ class unwrap_reference< X > \ { \ public: \ typedef T type; \ }; \ /**/ AUX_REFERENCE_WRAPPER_METAFUNCTIONS_DEF(reference_wrapper) #if !defined(BOOST_NO_CV_SPECIALIZATIONS) AUX_REFERENCE_WRAPPER_METAFUNCTIONS_DEF(reference_wrapper const) AUX_REFERENCE_WRAPPER_METAFUNCTIONS_DEF(reference_wrapper volatile) AUX_REFERENCE_WRAPPER_METAFUNCTIONS_DEF(reference_wrapper const volatile) #endif # undef AUX_REFERENCE_WRAPPER_METAFUNCTIONS_DEF # else // no partial specialization } // namespace boost #include namespace boost { namespace detail { typedef char (&yes_reference_wrapper_t)[1]; typedef char (&no_reference_wrapper_t)[2]; no_reference_wrapper_t is_reference_wrapper_test(...); template yes_reference_wrapper_t is_reference_wrapper_test(type< reference_wrapper >); template struct reference_unwrapper { template struct apply { typedef T type; }; }; template<> struct reference_unwrapper { template struct apply { typedef typename T::type type; }; }; } template class is_reference_wrapper { public: BOOST_STATIC_CONSTANT( bool, value = ( sizeof(detail::is_reference_wrapper_test(type())) == sizeof(detail::yes_reference_wrapper_t))); typedef ::boost::mpl::bool_ type; }; template class unwrap_reference : public detail::reference_unwrapper< is_reference_wrapper::value >::template apply {}; # endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION template inline typename unwrap_reference::type& unwrap_ref(T& t) { return t; } template inline T* get_pointer( reference_wrapper const & r ) { return r.get_pointer(); } } // namespace boost #endif // #ifndef BOOST_REF_HPP_INCLUDED madp-0.4/src/boost/boost/PaxHeaders.5405/shared_array.hpp0000644000000000000000000000007412717644140020203 xustar0030 atime=1463765180.165719647 30 ctime=1463765201.157551989 madp-0.4/src/boost/boost/shared_array.hpp0000664000372100037210000000105012717644140021026 0ustar00fransfrans00000000000000#ifndef BOOST_SHARED_ARRAY_HPP_INCLUDED #define BOOST_SHARED_ARRAY_HPP_INCLUDED // // shared_array.hpp // // (C) Copyright Greg Colvin and Beman Dawes 1998, 1999. // Copyright (c) 2001, 2002 Peter Dimov // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/smart_ptr/shared_array.htm for documentation. // #include #endif // #ifndef BOOST_SHARED_ARRAY_HPP_INCLUDED madp-0.4/src/boost/boost/PaxHeaders.5405/multi_index_container.hpp0000644000000000000000000000007412717644140022122 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index_container.hpp0000664000372100037210000012142512717644140022756 0ustar00fransfrans00000000000000/* Multiply indexed container. * * Copyright 2003-2013 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_HPP #define BOOST_MULTI_INDEX_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) #include #endif #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) #include #include #include #include #include #include #include #endif #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING) #include #define BOOST_MULTI_INDEX_CHECK_INVARIANT_OF(x) \ detail::scope_guard BOOST_JOIN(check_invariant_,__LINE__)= \ detail::make_obj_guard(x,&multi_index_container::check_invariant_); \ BOOST_JOIN(check_invariant_,__LINE__).touch(); #define BOOST_MULTI_INDEX_CHECK_INVARIANT \ BOOST_MULTI_INDEX_CHECK_INVARIANT_OF(*this) #else #define BOOST_MULTI_INDEX_CHECK_INVARIANT_OF(x) #define BOOST_MULTI_INDEX_CHECK_INVARIANT #endif namespace boost{ namespace multi_index{ #if BOOST_WORKAROUND(BOOST_MSVC,BOOST_TESTED_AT(1500)) #pragma warning(push) #pragma warning(disable:4522) /* spurious warning on multiple operator=()'s */ #endif template class multi_index_container: private ::boost::base_from_member< typename boost::detail::allocator::rebind_to< Allocator, typename detail::multi_index_node_type< Value,IndexSpecifierList,Allocator>::type >::type>, BOOST_MULTI_INDEX_PRIVATE_IF_MEMBER_TEMPLATE_FRIENDS detail::header_holder< typename detail::prevent_eti< Allocator, typename boost::detail::allocator::rebind_to< Allocator, typename detail::multi_index_node_type< Value,IndexSpecifierList,Allocator>::type >::type >::type::pointer, multi_index_container >, public detail::multi_index_base_type< Value,IndexSpecifierList,Allocator>::type { #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING)&&\ BOOST_WORKAROUND(__MWERKS__,<=0x3003) /* The "ISO C++ Template Parser" option in CW8.3 has a problem with the * lifetime of const references bound to temporaries --precisely what * scopeguards are. */ #pragma parse_mfunc_templ off #endif private: BOOST_COPYABLE_AND_MOVABLE(multi_index_container) #if !defined(BOOST_NO_MEMBER_TEMPLATE_FRIENDS) template friend class detail::index_base; template friend struct detail::header_holder; template friend struct detail::converter; #endif typedef typename detail::multi_index_base_type< Value,IndexSpecifierList,Allocator>::type super; typedef typename boost::detail::allocator::rebind_to< Allocator, typename super::node_type >::type node_allocator; typedef ::boost::base_from_member< node_allocator> bfm_allocator; typedef detail::header_holder< typename detail::prevent_eti< Allocator, node_allocator >::type::pointer, multi_index_container> bfm_header; #if BOOST_WORKAROUND(BOOST_MSVC,<1300) /* see definition of index_type_list below */ typedef typename super::index_type_list super_index_type_list; #endif public: /* All types are inherited from super, a few are explicitly * brought forward here to save us some typename's. */ typedef typename super::ctor_args_list ctor_args_list; typedef IndexSpecifierList index_specifier_type_list; #if BOOST_WORKAROUND(BOOST_MSVC,<1300) /* MSVC++ 6.0 chokes on moderately long index lists (around 6 indices * or more), with errors ranging from corrupt exes to duplicate * comdats. The following type hiding hack alleviates this condition; * best results combined with type hiding of the indexed_by construct * itself, as explained in the "Compiler specifics" section of * the documentation. */ struct index_type_list:super_index_type_list { typedef index_type_list type; typedef typename super_index_type_list::back back; typedef mpl::v_iter begin; typedef mpl::v_iter< type, mpl::size::value> end; }; #else typedef typename super::index_type_list index_type_list; #endif typedef typename super::iterator_type_list iterator_type_list; typedef typename super::const_iterator_type_list const_iterator_type_list; typedef typename super::value_type value_type; typedef typename super::final_allocator_type allocator_type; typedef typename super::iterator iterator; typedef typename super::const_iterator const_iterator; BOOST_STATIC_ASSERT( detail::no_duplicate_tags_in_index_list::value); /* global project() needs to see this publicly */ typedef typename super::node_type node_type; /* construct/copy/destroy */ explicit multi_index_container( #if BOOST_WORKAROUND(__IBMCPP__,<=600) /* VisualAge seems to have an ETI issue with the default values * for arguments args_list and al. */ const ctor_args_list& args_list= typename mpl::identity::type:: ctor_args_list(), const allocator_type& al= typename mpl::identity::type:: allocator_type()): #else const ctor_args_list& args_list=ctor_args_list(), const allocator_type& al=allocator_type()): #endif bfm_allocator(al), super(args_list,bfm_allocator::member), node_count(0) { BOOST_MULTI_INDEX_CHECK_INVARIANT; } explicit multi_index_container(const allocator_type& al): bfm_allocator(al), super(ctor_args_list(),bfm_allocator::member), node_count(0) { BOOST_MULTI_INDEX_CHECK_INVARIANT; } template multi_index_container( InputIterator first,InputIterator last, #if BOOST_WORKAROUND(__IBMCPP__,<=600) /* VisualAge seems to have an ETI issue with the default values * for arguments args_list and al. */ const ctor_args_list& args_list= typename mpl::identity::type:: ctor_args_list(), const allocator_type& al= typename mpl::identity::type:: allocator_type()): #else const ctor_args_list& args_list=ctor_args_list(), const allocator_type& al=allocator_type()): #endif bfm_allocator(al), super(args_list,bfm_allocator::member), node_count(0) { BOOST_MULTI_INDEX_CHECK_INVARIANT; BOOST_TRY{ iterator hint=super::end(); for(;first!=last;++first){ hint=super::make_iterator( insert_ref_(*first,hint.get_node()).first); ++hint; } } BOOST_CATCH(...){ clear_(); BOOST_RETHROW; } BOOST_CATCH_END } #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) multi_index_container( std::initializer_list list, const ctor_args_list& args_list=ctor_args_list(), const allocator_type& al=allocator_type()): bfm_allocator(al), super(args_list,bfm_allocator::member), node_count(0) { BOOST_MULTI_INDEX_CHECK_INVARIANT; BOOST_TRY{ typedef typename std::initializer_list::iterator init_iterator; iterator hint=super::end(); for(init_iterator first=list.begin(),last=list.end(); first!=last;++first){ hint=super::make_iterator(insert_(*first,hint.get_node()).first); ++hint; } } BOOST_CATCH(...){ clear_(); BOOST_RETHROW; } BOOST_CATCH_END } #endif multi_index_container( const multi_index_container& x): bfm_allocator(x.bfm_allocator::member), bfm_header(), super(x), node_count(0) { copy_map_type map(bfm_allocator::member,x.size(),x.header(),header()); for(const_iterator it=x.begin(),it_end=x.end();it!=it_end;++it){ map.clone(it.get_node()); } super::copy_(x,map); map.release(); node_count=x.size(); /* Not until this point are the indices required to be consistent, * hence the position of the invariant checker. */ BOOST_MULTI_INDEX_CHECK_INVARIANT; } multi_index_container(BOOST_RV_REF(multi_index_container) x): bfm_allocator(x.bfm_allocator::member), bfm_header(), super(x,detail::do_not_copy_elements_tag()), node_count(0) { BOOST_MULTI_INDEX_CHECK_INVARIANT; BOOST_MULTI_INDEX_CHECK_INVARIANT_OF(x); swap_elements_(x); } ~multi_index_container() { delete_all_nodes_(); } #if defined(BOOST_NO_CXX11_RVALUE_REFERENCES) /* As per http://www.boost.org/doc/html/move/emulation_limitations.html * #move.emulation_limitations.assignment_operator */ multi_index_container& operator=( const multi_index_container& x) { multi_index_container y(x); this->swap(y); return *this; } #endif multi_index_container& operator=( BOOST_COPY_ASSIGN_REF(multi_index_container) x) { multi_index_container y(x); this->swap(y); return *this; } multi_index_container& operator=( BOOST_RV_REF(multi_index_container) x) { this->swap(x); return *this; } #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) multi_index_container& operator=( std::initializer_list list) { BOOST_MULTI_INDEX_CHECK_INVARIANT; typedef typename std::initializer_list::iterator init_iterator; multi_index_container x(*this,detail::do_not_copy_elements_tag()); iterator hint=x.end(); for(init_iterator first=list.begin(),last=list.end(); first!=last;++first){ hint=x.make_iterator(x.insert_(*first,hint.get_node()).first); ++hint; } x.swap_elements_(*this); return*this; } #endif allocator_type get_allocator()const { return allocator_type(bfm_allocator::member); } /* retrieval of indices by number */ #if !defined(BOOST_NO_MEMBER_TEMPLATES) template struct nth_index { BOOST_STATIC_ASSERT(N>=0&&N::type::value); typedef typename mpl::at_c::type type; }; template typename nth_index::type& get(BOOST_EXPLICIT_TEMPLATE_NON_TYPE(int,N)) { BOOST_STATIC_ASSERT(N>=0&&N::type::value); return *this; } template const typename nth_index::type& get( BOOST_EXPLICIT_TEMPLATE_NON_TYPE(int,N))const { BOOST_STATIC_ASSERT(N>=0&&N::type::value); return *this; } #endif /* retrieval of indices by tag */ #if !defined(BOOST_NO_MEMBER_TEMPLATES) template struct index { typedef typename mpl::find_if< index_type_list, detail::has_tag >::type iter; BOOST_STATIC_CONSTANT( bool,index_found=!(is_same::type >::value)); BOOST_STATIC_ASSERT(index_found); typedef typename mpl::deref::type type; }; template typename index::type& get(BOOST_EXPLICIT_TEMPLATE_TYPE(Tag)) { return *this; } template const typename index::type& get( BOOST_EXPLICIT_TEMPLATE_TYPE(Tag))const { return *this; } #endif /* projection of iterators by number */ #if !defined(BOOST_NO_MEMBER_TEMPLATES) template struct nth_index_iterator { typedef typename nth_index::type::iterator type; }; template struct nth_index_const_iterator { typedef typename nth_index::type::const_iterator type; }; template typename nth_index_iterator::type project( IteratorType it BOOST_APPEND_EXPLICIT_TEMPLATE_NON_TYPE(int,N)) { typedef typename nth_index::type index; #if !defined(__SUNPRO_CC)||!(__SUNPRO_CC<0x580) /* fails in Sun C++ 5.7 */ BOOST_STATIC_ASSERT( (mpl::contains::value)); #endif BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(it); BOOST_MULTI_INDEX_CHECK_IS_OWNER( it,static_cast(*this)); return index::make_iterator(static_cast(it.get_node())); } template typename nth_index_const_iterator::type project( IteratorType it BOOST_APPEND_EXPLICIT_TEMPLATE_NON_TYPE(int,N))const { typedef typename nth_index::type index; #if !defined(__SUNPRO_CC)||!(__SUNPRO_CC<0x580) /* fails in Sun C++ 5.7 */ BOOST_STATIC_ASSERT(( mpl::contains::value|| mpl::contains::value)); #endif BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(it); BOOST_MULTI_INDEX_CHECK_IS_OWNER( it,static_cast(*this)); return index::make_iterator(static_cast(it.get_node())); } #endif /* projection of iterators by tag */ #if !defined(BOOST_NO_MEMBER_TEMPLATES) template struct index_iterator { typedef typename index::type::iterator type; }; template struct index_const_iterator { typedef typename index::type::const_iterator type; }; template typename index_iterator::type project( IteratorType it BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(Tag)) { typedef typename index::type index; #if !defined(__SUNPRO_CC)||!(__SUNPRO_CC<0x580) /* fails in Sun C++ 5.7 */ BOOST_STATIC_ASSERT( (mpl::contains::value)); #endif BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(it); BOOST_MULTI_INDEX_CHECK_IS_OWNER( it,static_cast(*this)); return index::make_iterator(static_cast(it.get_node())); } template typename index_const_iterator::type project( IteratorType it BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(Tag))const { typedef typename index::type index; #if !defined(__SUNPRO_CC)||!(__SUNPRO_CC<0x580) /* fails in Sun C++ 5.7 */ BOOST_STATIC_ASSERT(( mpl::contains::value|| mpl::contains::value)); #endif BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(it); BOOST_MULTI_INDEX_CHECK_IS_OWNER( it,static_cast(*this)); return index::make_iterator(static_cast(it.get_node())); } #endif BOOST_MULTI_INDEX_PROTECTED_IF_MEMBER_TEMPLATE_FRIENDS: typedef typename super::copy_map_type copy_map_type; #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) multi_index_container( const multi_index_container& x, detail::do_not_copy_elements_tag): bfm_allocator(x.bfm_allocator::member), bfm_header(), super(x,detail::do_not_copy_elements_tag()), node_count(0) { BOOST_MULTI_INDEX_CHECK_INVARIANT; } #endif node_type* header()const { return &*bfm_header::member; } node_type* allocate_node() { return &*bfm_allocator::member.allocate(1); } void deallocate_node(node_type* x) { typedef typename node_allocator::pointer node_pointer; bfm_allocator::member.deallocate(static_cast(x),1); } bool empty_()const { return node_count==0; } std::size_t size_()const { return node_count; } std::size_t max_size_()const { return static_cast(-1); } template std::pair insert_(const Value& v,Variant variant) { node_type* x=allocate_node(); BOOST_TRY{ node_type* res=super::insert_(v,x,variant); if(res==x){ ++node_count; return std::pair(res,true); } else{ deallocate_node(x); return std::pair(res,false); } } BOOST_CATCH(...){ deallocate_node(x); BOOST_RETHROW; } BOOST_CATCH_END } std::pair insert_(const Value& v) { return insert_(v,detail::lvalue_tag()); } std::pair insert_rv_(const Value& v) { return insert_(v,detail::rvalue_tag()); } template std::pair insert_ref_(T& t) { node_type* x=allocate_node(); BOOST_TRY{ new(&x->value()) value_type(t); BOOST_TRY{ node_type* res=super::insert_(x->value(),x,detail::emplaced_tag()); if(res==x){ ++node_count; return std::pair(res,true); } else{ boost::detail::allocator::destroy(&x->value()); deallocate_node(x); return std::pair(res,false); } } BOOST_CATCH(...){ boost::detail::allocator::destroy(&x->value()); BOOST_RETHROW; } BOOST_CATCH_END } BOOST_CATCH(...){ deallocate_node(x); BOOST_RETHROW; } BOOST_CATCH_END } std::pair insert_ref_(const value_type& x) { return insert_(x); } std::pair insert_ref_(value_type& x) { return insert_(x); } template std::pair emplace_( BOOST_MULTI_INDEX_FUNCTION_PARAM_PACK) { node_type* x=allocate_node(); BOOST_TRY{ detail::vartempl_placement_new( &x->value(),BOOST_MULTI_INDEX_FORWARD_PARAM_PACK); BOOST_TRY{ node_type* res=super::insert_(x->value(),x,detail::emplaced_tag()); if(res==x){ ++node_count; return std::pair(res,true); } else{ boost::detail::allocator::destroy(&x->value()); deallocate_node(x); return std::pair(res,false); } } BOOST_CATCH(...){ boost::detail::allocator::destroy(&x->value()); BOOST_RETHROW; } BOOST_CATCH_END } BOOST_CATCH(...){ deallocate_node(x); BOOST_RETHROW; } BOOST_CATCH_END } template std::pair insert_( const Value& v,node_type* position,Variant variant) { node_type* x=allocate_node(); BOOST_TRY{ node_type* res=super::insert_(v,position,x,variant); if(res==x){ ++node_count; return std::pair(res,true); } else{ deallocate_node(x); return std::pair(res,false); } } BOOST_CATCH(...){ deallocate_node(x); BOOST_RETHROW; } BOOST_CATCH_END } std::pair insert_(const Value& v,node_type* position) { return insert_(v,position,detail::lvalue_tag()); } std::pair insert_rv_(const Value& v,node_type* position) { return insert_(v,position,detail::rvalue_tag()); } template std::pair insert_ref_( T& t,node_type* position) { node_type* x=allocate_node(); BOOST_TRY{ new(&x->value()) value_type(t); BOOST_TRY{ node_type* res=super::insert_( x->value(),position,x,detail::emplaced_tag()); if(res==x){ ++node_count; return std::pair(res,true); } else{ boost::detail::allocator::destroy(&x->value()); deallocate_node(x); return std::pair(res,false); } } BOOST_CATCH(...){ boost::detail::allocator::destroy(&x->value()); BOOST_RETHROW; } BOOST_CATCH_END } BOOST_CATCH(...){ deallocate_node(x); BOOST_RETHROW; } BOOST_CATCH_END } std::pair insert_ref_( const value_type& x,node_type* position) { return insert_(x,position); } std::pair insert_ref_( value_type& x,node_type* position) { return insert_(x,position); } template std::pair emplace_hint_( node_type* position, BOOST_MULTI_INDEX_FUNCTION_PARAM_PACK) { node_type* x=allocate_node(); BOOST_TRY{ detail::vartempl_placement_new( &x->value(),BOOST_MULTI_INDEX_FORWARD_PARAM_PACK); BOOST_TRY{ node_type* res=super::insert_( x->value(),position,x,detail::emplaced_tag()); if(res==x){ ++node_count; return std::pair(res,true); } else{ boost::detail::allocator::destroy(&x->value()); deallocate_node(x); return std::pair(res,false); } } BOOST_CATCH(...){ boost::detail::allocator::destroy(&x->value()); BOOST_RETHROW; } BOOST_CATCH_END } BOOST_CATCH(...){ deallocate_node(x); BOOST_RETHROW; } BOOST_CATCH_END } void erase_(node_type* x) { --node_count; super::erase_(x); deallocate_node(x); } void delete_node_(node_type* x) { super::delete_node_(x); deallocate_node(x); } void delete_all_nodes_() { super::delete_all_nodes_(); } void clear_() { delete_all_nodes_(); super::clear_(); node_count=0; } void swap_(multi_index_container& x) { if(bfm_allocator::member!=x.bfm_allocator::member){ detail::adl_swap(bfm_allocator::member,x.bfm_allocator::member); } std::swap(bfm_header::member,x.bfm_header::member); super::swap_(x); std::swap(node_count,x.node_count); } void swap_elements_( multi_index_container& x) { std::swap(bfm_header::member,x.bfm_header::member); super::swap_elements_(x); std::swap(node_count,x.node_count); } bool replace_(const Value& k,node_type* x) { return super::replace_(k,x,detail::lvalue_tag()); } bool replace_rv_(const Value& k,node_type* x) { return super::replace_(k,x,detail::rvalue_tag()); } template bool modify_(Modifier& mod,node_type* x) { mod(const_cast(x->value())); BOOST_TRY{ if(!super::modify_(x)){ deallocate_node(x); --node_count; return false; } else return true; } BOOST_CATCH(...){ deallocate_node(x); --node_count; BOOST_RETHROW; } BOOST_CATCH_END } template bool modify_(Modifier& mod,Rollback& back,node_type* x) { mod(const_cast(x->value())); bool b; BOOST_TRY{ b=super::modify_rollback_(x); } BOOST_CATCH(...){ BOOST_TRY{ back(const_cast(x->value())); BOOST_RETHROW; } BOOST_CATCH(...){ this->erase_(x); BOOST_RETHROW; } BOOST_CATCH_END } BOOST_CATCH_END BOOST_TRY{ if(!b){ back(const_cast(x->value())); return false; } else return true; } BOOST_CATCH(...){ this->erase_(x); BOOST_RETHROW; } BOOST_CATCH_END } #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) /* serialization */ friend class boost::serialization::access; BOOST_SERIALIZATION_SPLIT_MEMBER() typedef typename super::index_saver_type index_saver_type; typedef typename super::index_loader_type index_loader_type; template void save(Archive& ar,const unsigned int version)const { #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) const serialization::collection_size_type s(size_()); const detail::serialization_version value_version; ar< void load(Archive& ar,const unsigned int version) { BOOST_MULTI_INDEX_CHECK_INVARIANT; clear_(); #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) serialization::collection_size_type s; detail::serialization_version value_version; if(version<1){ std::size_t sz; ar>>serialization::make_nvp("count",sz); s=static_cast(sz); } else{ ar>>serialization::make_nvp("count",s); } if(version<2){ value_version=0; } else{ ar>>serialization::make_nvp("value_version",value_version); } #else std::size_t s; unsigned int value_version=0; ar>>serialization::make_nvp("count",s); #endif index_loader_type lm(bfm_allocator::member,s); for(std::size_t n=0;n value("item",ar,value_version); std::pair p=insert_( value.get(),super::end().get_node()); if(!p.second)throw_exception( archive::archive_exception( archive::archive_exception::other_exception)); ar.reset_object_address(&p.first->value(),&value.get()); lm.add(p.first,ar,version); } lm.add_track(header(),ar,version); super::load_(ar,version,lm); } #endif #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING) /* invariant stuff */ bool invariant_()const { return super::invariant_(); } void check_invariant_()const { BOOST_MULTI_INDEX_INVARIANT_ASSERT(invariant_()); } #endif private: std::size_t node_count; #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING)&&\ BOOST_WORKAROUND(__MWERKS__,<=0x3003) #pragma parse_mfunc_templ reset #endif }; #if BOOST_WORKAROUND(BOOST_MSVC,BOOST_TESTED_AT(1500)) #pragma warning(pop) /* C4522 */ #endif /* retrieval of indices by number */ template struct nth_index { BOOST_STATIC_CONSTANT( int, M=mpl::size::type::value); BOOST_STATIC_ASSERT(N>=0&&N::type type; }; template typename nth_index< multi_index_container,N>::type& get( multi_index_container& m BOOST_APPEND_EXPLICIT_TEMPLATE_NON_TYPE(int,N)) { typedef multi_index_container< Value,IndexSpecifierList,Allocator> multi_index_type; typedef typename nth_index< multi_index_container< Value,IndexSpecifierList,Allocator>, N >::type index; BOOST_STATIC_ASSERT(N>=0&& N< mpl::size< BOOST_DEDUCED_TYPENAME multi_index_type::index_type_list >::type::value); return detail::converter::index(m); } template const typename nth_index< multi_index_container,N>::type& get( const multi_index_container& m BOOST_APPEND_EXPLICIT_TEMPLATE_NON_TYPE(int,N)) { typedef multi_index_container< Value,IndexSpecifierList,Allocator> multi_index_type; typedef typename nth_index< multi_index_container< Value,IndexSpecifierList,Allocator>, N >::type index; BOOST_STATIC_ASSERT(N>=0&& N< mpl::size< BOOST_DEDUCED_TYPENAME multi_index_type::index_type_list >::type::value); return detail::converter::index(m); } /* retrieval of indices by tag */ template struct index { typedef typename MultiIndexContainer::index_type_list index_type_list; typedef typename mpl::find_if< index_type_list, detail::has_tag >::type iter; BOOST_STATIC_CONSTANT( bool,index_found=!(is_same::type >::value)); BOOST_STATIC_ASSERT(index_found); typedef typename mpl::deref::type type; }; template< typename Tag,typename Value,typename IndexSpecifierList,typename Allocator > typename ::boost::multi_index::index< multi_index_container,Tag>::type& get( multi_index_container& m BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(Tag)) { typedef multi_index_container< Value,IndexSpecifierList,Allocator> multi_index_type; typedef typename ::boost::multi_index::index< multi_index_container< Value,IndexSpecifierList,Allocator>, Tag >::type index; return detail::converter::index(m); } template< typename Tag,typename Value,typename IndexSpecifierList,typename Allocator > const typename ::boost::multi_index::index< multi_index_container,Tag>::type& get( const multi_index_container& m BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(Tag)) { typedef multi_index_container< Value,IndexSpecifierList,Allocator> multi_index_type; typedef typename ::boost::multi_index::index< multi_index_container< Value,IndexSpecifierList,Allocator>, Tag >::type index; return detail::converter::index(m); } /* projection of iterators by number */ template struct nth_index_iterator { typedef typename detail::prevent_eti< nth_index, typename nth_index::type>::type::iterator type; }; template struct nth_index_const_iterator { typedef typename detail::prevent_eti< nth_index, typename nth_index::type >::type::const_iterator type; }; template< int N,typename IteratorType, typename Value,typename IndexSpecifierList,typename Allocator> typename nth_index_iterator< multi_index_container,N>::type project( multi_index_container& m, IteratorType it BOOST_APPEND_EXPLICIT_TEMPLATE_NON_TYPE(int,N)) { typedef multi_index_container< Value,IndexSpecifierList,Allocator> multi_index_type; typedef typename nth_index::type index; #if (!defined(BOOST_MSVC)||!(BOOST_MSVC<1310))&& /* MSVC++ 6.0/7.0 fails */\ (!defined(__SUNPRO_CC)||!(__SUNPRO_CC<0x580)) /* as does Sun C++ 5.7 */ BOOST_STATIC_ASSERT(( mpl::contains< BOOST_DEDUCED_TYPENAME multi_index_type::iterator_type_list, IteratorType>::value)); #endif BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(it); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) typedef detail::converter< multi_index_type, BOOST_DEDUCED_TYPENAME IteratorType::container_type> converter; BOOST_MULTI_INDEX_CHECK_IS_OWNER(it,converter::index(m)); #endif return detail::converter::iterator( m,static_cast(it.get_node())); } template< int N,typename IteratorType, typename Value,typename IndexSpecifierList,typename Allocator> typename nth_index_const_iterator< multi_index_container,N>::type project( const multi_index_container& m, IteratorType it BOOST_APPEND_EXPLICIT_TEMPLATE_NON_TYPE(int,N)) { typedef multi_index_container< Value,IndexSpecifierList,Allocator> multi_index_type; typedef typename nth_index::type index; #if (!defined(BOOST_MSVC)||!(BOOST_MSVC<1310))&& /* MSVC++ 6.0/7.0 fails */\ (!defined(__SUNPRO_CC)||!(__SUNPRO_CC<0x580)) /* as does Sun C++ 5.7 */ BOOST_STATIC_ASSERT(( mpl::contains< BOOST_DEDUCED_TYPENAME multi_index_type::iterator_type_list, IteratorType>::value|| mpl::contains< BOOST_DEDUCED_TYPENAME multi_index_type::const_iterator_type_list, IteratorType>::value)); #endif BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(it); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) typedef detail::converter< multi_index_type, BOOST_DEDUCED_TYPENAME IteratorType::container_type> converter; BOOST_MULTI_INDEX_CHECK_IS_OWNER(it,converter::index(m)); #endif return detail::converter::const_iterator( m,static_cast(it.get_node())); } /* projection of iterators by tag */ template struct index_iterator { typedef typename ::boost::multi_index::index< MultiIndexContainer,Tag>::type::iterator type; }; template struct index_const_iterator { typedef typename ::boost::multi_index::index< MultiIndexContainer,Tag>::type::const_iterator type; }; template< typename Tag,typename IteratorType, typename Value,typename IndexSpecifierList,typename Allocator> typename index_iterator< multi_index_container,Tag>::type project( multi_index_container& m, IteratorType it BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(Tag)) { typedef multi_index_container< Value,IndexSpecifierList,Allocator> multi_index_type; typedef typename ::boost::multi_index::index< multi_index_type,Tag>::type index; #if (!defined(BOOST_MSVC)||!(BOOST_MSVC<1310))&& /* MSVC++ 6.0/7.0 fails */\ (!defined(__SUNPRO_CC)||!(__SUNPRO_CC<0x580)) /* as does Sun C++ 5.7 */ BOOST_STATIC_ASSERT(( mpl::contains< BOOST_DEDUCED_TYPENAME multi_index_type::iterator_type_list, IteratorType>::value)); #endif BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(it); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) typedef detail::converter< multi_index_type, BOOST_DEDUCED_TYPENAME IteratorType::container_type> converter; BOOST_MULTI_INDEX_CHECK_IS_OWNER(it,converter::index(m)); #endif return detail::converter::iterator( m,static_cast(it.get_node())); } template< typename Tag,typename IteratorType, typename Value,typename IndexSpecifierList,typename Allocator> typename index_const_iterator< multi_index_container,Tag>::type project( const multi_index_container& m, IteratorType it BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(Tag)) { typedef multi_index_container< Value,IndexSpecifierList,Allocator> multi_index_type; typedef typename ::boost::multi_index::index< multi_index_type,Tag>::type index; #if (!defined(BOOST_MSVC)||!(BOOST_MSVC<1310))&& /* MSVC++ 6.0/7.0 fails */\ (!defined(__SUNPRO_CC)||!(__SUNPRO_CC<0x580)) /* as does Sun C++ 5.7 */ BOOST_STATIC_ASSERT(( mpl::contains< BOOST_DEDUCED_TYPENAME multi_index_type::iterator_type_list, IteratorType>::value|| mpl::contains< BOOST_DEDUCED_TYPENAME multi_index_type::const_iterator_type_list, IteratorType>::value)); #endif BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(it); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) typedef detail::converter< multi_index_type, BOOST_DEDUCED_TYPENAME IteratorType::container_type> converter; BOOST_MULTI_INDEX_CHECK_IS_OWNER(it,converter::index(m)); #endif return detail::converter::const_iterator( m,static_cast(it.get_node())); } /* Comparison. Simple forward to first index. */ template< typename Value1,typename IndexSpecifierList1,typename Allocator1, typename Value2,typename IndexSpecifierList2,typename Allocator2 > bool operator==( const multi_index_container& x, const multi_index_container& y) { return get<0>(x)==get<0>(y); } template< typename Value1,typename IndexSpecifierList1,typename Allocator1, typename Value2,typename IndexSpecifierList2,typename Allocator2 > bool operator<( const multi_index_container& x, const multi_index_container& y) { return get<0>(x)(y); } template< typename Value1,typename IndexSpecifierList1,typename Allocator1, typename Value2,typename IndexSpecifierList2,typename Allocator2 > bool operator!=( const multi_index_container& x, const multi_index_container& y) { return get<0>(x)!=get<0>(y); } template< typename Value1,typename IndexSpecifierList1,typename Allocator1, typename Value2,typename IndexSpecifierList2,typename Allocator2 > bool operator>( const multi_index_container& x, const multi_index_container& y) { return get<0>(x)>get<0>(y); } template< typename Value1,typename IndexSpecifierList1,typename Allocator1, typename Value2,typename IndexSpecifierList2,typename Allocator2 > bool operator>=( const multi_index_container& x, const multi_index_container& y) { return get<0>(x)>=get<0>(y); } template< typename Value1,typename IndexSpecifierList1,typename Allocator1, typename Value2,typename IndexSpecifierList2,typename Allocator2 > bool operator<=( const multi_index_container& x, const multi_index_container& y) { return get<0>(x)<=get<0>(y); } /* specialized algorithms */ template void swap( multi_index_container& x, multi_index_container& y) { x.swap(y); } } /* namespace multi_index */ #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION)&&\ !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) /* class version = 1 : we now serialize the size through * boost::serialization::collection_size_type. * class version = 2 : proper use of {save|load}_construct_data. */ namespace serialization { template struct version< boost::multi_index_container > { BOOST_STATIC_CONSTANT(int,value=2); }; } /* namespace serialization */ #endif /* Associated global functions are promoted to namespace boost, except * comparison operators and swap, which are meant to be Koenig looked-up. */ using multi_index::get; using multi_index::project; } /* namespace boost */ #undef BOOST_MULTI_INDEX_CHECK_INVARIANT #undef BOOST_MULTI_INDEX_CHECK_INVARIANT_OF #endif madp-0.4/src/boost/boost/PaxHeaders.5405/integer0000644000000000000000000000007412717644140016406 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.053552821 madp-0.4/src/boost/boost/integer/0000775000372100037210000000000012717644140017312 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/integer/PaxHeaders.5405/integer_mask.hpp0000644000000000000000000000007412717644140021644 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.053552821 madp-0.4/src/boost/boost/integer/integer_mask.hpp0000664000372100037210000000774112717644140022504 0ustar00fransfrans00000000000000// Boost integer/integer_mask.hpp header file ------------------------------// // (C) Copyright Daryle Walker 2001. // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // See http://www.boost.org for updates, documentation, and revision history. #ifndef BOOST_INTEGER_INTEGER_MASK_HPP #define BOOST_INTEGER_INTEGER_MASK_HPP #include // self include #include // for BOOST_STATIC_CONSTANT #include // for boost::uint_t #include // for UCHAR_MAX, etc. #include // for std::size_t #include // for std::numeric_limits // // We simply cannot include this header on gcc without getting copious warnings of the kind: // // boost/integer/integer_mask.hpp:93:35: warning: use of C99 long long integer constant // // And yet there is no other reasonable implementation, so we declare this a system header // to suppress these warnings. // #if defined(__GNUC__) && (__GNUC__ >= 4) #pragma GCC system_header #endif namespace boost { // Specified single-bit mask class declaration -----------------------------// // (Lowest bit starts counting at 0.) template < std::size_t Bit > struct high_bit_mask_t { typedef typename uint_t<(Bit + 1)>::least least; typedef typename uint_t<(Bit + 1)>::fast fast; BOOST_STATIC_CONSTANT( least, high_bit = (least( 1u ) << Bit) ); BOOST_STATIC_CONSTANT( fast, high_bit_fast = (fast( 1u ) << Bit) ); BOOST_STATIC_CONSTANT( std::size_t, bit_position = Bit ); }; // boost::high_bit_mask_t // Specified bit-block mask class declaration ------------------------------// // Makes masks for the lowest N bits // (Specializations are needed when N fills up a type.) template < std::size_t Bits > struct low_bits_mask_t { typedef typename uint_t::least least; typedef typename uint_t::fast fast; BOOST_STATIC_CONSTANT( least, sig_bits = (~( ~(least( 0u )) << Bits )) ); BOOST_STATIC_CONSTANT( fast, sig_bits_fast = fast(sig_bits) ); BOOST_STATIC_CONSTANT( std::size_t, bit_count = Bits ); }; // boost::low_bits_mask_t #define BOOST_LOW_BITS_MASK_SPECIALIZE( Type ) \ template < > struct low_bits_mask_t< std::numeric_limits::digits > { \ typedef std::numeric_limits limits_type; \ typedef uint_t::least least; \ typedef uint_t::fast fast; \ BOOST_STATIC_CONSTANT( least, sig_bits = (~( least(0u) )) ); \ BOOST_STATIC_CONSTANT( fast, sig_bits_fast = fast(sig_bits) ); \ BOOST_STATIC_CONSTANT( std::size_t, bit_count = limits_type::digits ); \ } #ifdef BOOST_MSVC #pragma warning(push) #pragma warning(disable:4245) // 'initializing' : conversion from 'int' to 'const boost::low_bits_mask_t<8>::least', signed/unsigned mismatch #endif BOOST_LOW_BITS_MASK_SPECIALIZE( unsigned char ); #if USHRT_MAX > UCHAR_MAX BOOST_LOW_BITS_MASK_SPECIALIZE( unsigned short ); #endif #if UINT_MAX > USHRT_MAX BOOST_LOW_BITS_MASK_SPECIALIZE( unsigned int ); #endif #if ULONG_MAX > UINT_MAX BOOST_LOW_BITS_MASK_SPECIALIZE( unsigned long ); #endif #if defined(BOOST_HAS_LONG_LONG) #if ((defined(ULLONG_MAX) && (ULLONG_MAX > ULONG_MAX)) ||\ (defined(ULONG_LONG_MAX) && (ULONG_LONG_MAX > ULONG_MAX)) ||\ (defined(ULONGLONG_MAX) && (ULONGLONG_MAX > ULONG_MAX)) ||\ (defined(_ULLONG_MAX) && (_ULLONG_MAX > ULONG_MAX))) BOOST_LOW_BITS_MASK_SPECIALIZE( boost::ulong_long_type ); #endif #elif defined(BOOST_HAS_MS_INT64) #if 18446744073709551615ui64 > ULONG_MAX BOOST_LOW_BITS_MASK_SPECIALIZE( unsigned __int64 ); #endif #endif #ifdef BOOST_MSVC #pragma warning(pop) #endif #undef BOOST_LOW_BITS_MASK_SPECIALIZE } // namespace boost #endif // BOOST_INTEGER_INTEGER_MASK_HPP madp-0.4/src/boost/boost/integer/PaxHeaders.5405/static_log2.hpp0000644000000000000000000000007412717644140021406 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.053552821 madp-0.4/src/boost/boost/integer/static_log2.hpp0000664000372100037210000000672412717644140022246 0ustar00fransfrans00000000000000// -------------- Boost static_log2.hpp header file ----------------------- // // // Copyright (C) 2001 Daryle Walker. // Copyright (C) 2003 Vesa Karvonen. // Copyright (C) 2003 Gennaro Prota. // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // --------------------------------------------------- // See http://www.boost.org/libs/integer for documentation. // ------------------------------------------------------------------------- // #ifndef BOOST_INTEGER_STATIC_LOG2_HPP #define BOOST_INTEGER_STATIC_LOG2_HPP #include "boost/integer_fwd.hpp" // for boost::intmax_t namespace boost { namespace detail { namespace static_log2_impl { // choose_initial_n<> // // Recursively doubles its integer argument, until it // becomes >= of the "width" (C99, 6.2.6.2p4) of // static_log2_argument_type. // // Used to get the maximum power of two less then the width. // // Example: if on your platform argument_type has 48 value // bits it yields n=32. // // It's easy to prove that, starting from such a value // of n, the core algorithm works correctly for any width // of static_log2_argument_type and that recursion always // terminates with x = 1 and n = 0 (see the algorithm's // invariant). typedef boost::static_log2_argument_type argument_type; typedef boost::static_log2_result_type result_type; template struct choose_initial_n { BOOST_STATIC_CONSTANT(bool, c = (argument_type(1) << n << n) != 0); BOOST_STATIC_CONSTANT( result_type, value = !c*n + choose_initial_n<2*c*n>::value ); }; template <> struct choose_initial_n<0> { BOOST_STATIC_CONSTANT(result_type, value = 0); }; // start computing from n_zero - must be a power of two const result_type n_zero = 16; const result_type initial_n = choose_initial_n::value; // static_log2_impl<> // // * Invariant: // 2n // 1 <= x && x < 2 at the start of each recursion // (see also choose_initial_n<>) // // * Type requirements: // // argument_type maybe any unsigned type with at least n_zero + 1 // value bits. (Note: If larger types will be standardized -e.g. // unsigned long long- then the argument_type typedef can be // changed without affecting the rest of the code.) // template struct static_log2_impl { BOOST_STATIC_CONSTANT(bool, c = (x >> n) > 0); // x >= 2**n ? BOOST_STATIC_CONSTANT( result_type, value = c*n + (static_log2_impl< (x>>c*n), n/2 >::value) ); }; template <> struct static_log2_impl<1, 0> { BOOST_STATIC_CONSTANT(result_type, value = 0); }; } } // detail // -------------------------------------- // static_log2 // ---------------------------------------- template struct static_log2 { BOOST_STATIC_CONSTANT( static_log2_result_type, value = detail::static_log2_impl::static_log2_impl::value ); }; template <> struct static_log2<0> { }; } #endif // include guard madp-0.4/src/boost/boost/PaxHeaders.5405/preprocessor.hpp0000644000000000000000000000007412717644140020265 xustar0030 atime=1463765180.137719871 30 ctime=1463765201.109552373 madp-0.4/src/boost/boost/preprocessor.hpp0000664000372100037210000000074612717644140021123 0ustar00fransfrans00000000000000# /* Copyright (C) 2001 # * Housemarque Oy # * http://www.housemarque.com # * # * Distributed under the Boost Software License, Version 1.0. (See # * accompanying file LICENSE_1_0.txt or copy at # * http://www.boost.org/LICENSE_1_0.txt) # */ # # /* Revised by Paul Mensonides (2002) */ # # /* See http://www.boost.org/libs/preprocessor for documentation. */ # # ifndef BOOST_PREPROCESSOR_HPP # define BOOST_PREPROCESSOR_HPP # # include # # endif madp-0.4/src/boost/boost/PaxHeaders.5405/weak_ptr.hpp0000644000000000000000000000007412717644140017353 xustar0030 atime=1463765180.189719456 30 ctime=1463765201.189551735 madp-0.4/src/boost/boost/weak_ptr.hpp0000664000372100037210000000073212717644140020204 0ustar00fransfrans00000000000000#ifndef BOOST_WEAK_PTR_HPP_INCLUDED #define BOOST_WEAK_PTR_HPP_INCLUDED // // weak_ptr.hpp // // Copyright (c) 2001, 2002, 2003 Peter Dimov // // Distributed under the Boost Software License, Version 1.0. // See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt // // See http://www.boost.org/libs/smart_ptr/weak_ptr.htm for documentation. // #include #endif // #ifndef BOOST_WEAK_PTR_HPP_INCLUDED madp-0.4/src/boost/boost/PaxHeaders.5405/function_equal.hpp0000644000000000000000000000007412717644140020553 xustar0030 atime=1463765180.101720159 30 ctime=1463765201.049552852 madp-0.4/src/boost/boost/function_equal.hpp0000664000372100037210000000142712717644140021406 0ustar00fransfrans00000000000000// Copyright Douglas Gregor 2004. // Copyright 2005 Peter Dimov // Use, modification and distribution is subject to // the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // For more information, see http://www.boost.org #ifndef BOOST_FUNCTION_EQUAL_HPP #define BOOST_FUNCTION_EQUAL_HPP namespace boost { template bool function_equal_impl(const F& f, const G& g, long) { return f == g; } // function_equal_impl needs to be unqualified to pick // user overloads on two-phase compilers template bool function_equal(const F& f, const G& g) { return function_equal_impl(f, g, 0); } } // end namespace boost #endif // BOOST_FUNCTION_EQUAL_HPP madp-0.4/src/boost/boost/PaxHeaders.5405/make_shared.hpp0000644000000000000000000000007412717644140020002 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/make_shared.hpp0000664000372100037210000000074412717644140020636 0ustar00fransfrans00000000000000#ifndef BOOST_MAKE_SHARED_HPP_INCLUDED #define BOOST_MAKE_SHARED_HPP_INCLUDED // make_shared.hpp // // Copyright (c) 2007, 2008 Peter Dimov // // Distributed under the Boost Software License, Version 1.0. // See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt // // See http://www.boost.org/libs/smart_ptr/make_shared.html // for documentation. #include #endif // #ifndef BOOST_MAKE_SHARED_HPP_INCLUDED madp-0.4/src/boost/boost/PaxHeaders.5405/swap.hpp0000644000000000000000000000007412717644140016511 xustar0030 atime=1463765180.173719584 30 ctime=1463765201.173551863 madp-0.4/src/boost/boost/swap.hpp0000664000372100037210000000043712717644140017344 0ustar00fransfrans00000000000000// Copyright (C) 2007 Joseph Gauterin // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_SWAP_HPP #define BOOST_SWAP_HPP #include "boost/utility/swap.hpp" #endif madp-0.4/src/boost/boost/PaxHeaders.5405/integer_traits.hpp0000644000000000000000000000007412717644140020562 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.053552821 madp-0.4/src/boost/boost/integer_traits.hpp0000664000372100037210000002101212717644140021405 0ustar00fransfrans00000000000000/* boost integer_traits.hpp header file * * Copyright Jens Maurer 2000 * Distributed under the Boost Software License, Version 1.0. (See * accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * $Id: integer_traits.hpp 85813 2013-09-21 20:17:00Z jewillco $ * * Idea by Beman Dawes, Ed Brey, Steve Cleary, and Nathan Myers */ // See http://www.boost.org/libs/integer for documentation. #ifndef BOOST_INTEGER_TRAITS_HPP #define BOOST_INTEGER_TRAITS_HPP #include #include // These are an implementation detail and not part of the interface #include // we need wchar.h for WCHAR_MAX/MIN but not all platforms provide it, // and some may have but not ... #if !defined(BOOST_NO_INTRINSIC_WCHAR_T) && (!defined(BOOST_NO_CWCHAR) || defined(sun) || defined(__sun) || defined(__QNX__)) #include #endif // // We simply cannot include this header on gcc without getting copious warnings of the kind: // // ../../../boost/integer_traits.hpp:164:66: warning: use of C99 long long integer constant // // And yet there is no other reasonable implementation, so we declare this a system header // to suppress these warnings. // #if defined(__GNUC__) && (__GNUC__ >= 4) #pragma GCC system_header #endif namespace boost { template class integer_traits : public std::numeric_limits { public: BOOST_STATIC_CONSTANT(bool, is_integral = false); }; namespace detail { template class integer_traits_base { public: BOOST_STATIC_CONSTANT(bool, is_integral = true); BOOST_STATIC_CONSTANT(T, const_min = min_val); BOOST_STATIC_CONSTANT(T, const_max = max_val); }; #ifndef BOOST_NO_INCLASS_MEMBER_INITIALIZATION // A definition is required even for integral static constants template const bool integer_traits_base::is_integral; template const T integer_traits_base::const_min; template const T integer_traits_base::const_max; #endif } // namespace detail template<> class integer_traits : public std::numeric_limits, public detail::integer_traits_base { }; template<> class integer_traits : public std::numeric_limits, public detail::integer_traits_base { }; template<> class integer_traits : public std::numeric_limits, public detail::integer_traits_base { }; template<> class integer_traits : public std::numeric_limits, public detail::integer_traits_base { }; #ifndef BOOST_NO_INTRINSIC_WCHAR_T template<> class integer_traits : public std::numeric_limits, // Don't trust WCHAR_MIN and WCHAR_MAX with Mac OS X's native // library: they are wrong! #if defined(WCHAR_MIN) && defined(WCHAR_MAX) && !defined(__APPLE__) public detail::integer_traits_base #elif defined(__BORLANDC__) || defined(__CYGWIN__) || defined(__MINGW32__) || (defined(__BEOS__) && defined(__GNUC__)) // No WCHAR_MIN and WCHAR_MAX, whar_t is short and unsigned: public detail::integer_traits_base #elif (defined(__sgi) && (!defined(__SGI_STL_PORT) || __SGI_STL_PORT < 0x400))\ || (defined __APPLE__)\ || (defined(__OpenBSD__) && defined(__GNUC__))\ || (defined(__NetBSD__) && defined(__GNUC__))\ || (defined(__FreeBSD__) && defined(__GNUC__))\ || (defined(__DragonFly__) && defined(__GNUC__))\ || (defined(__hpux) && defined(__GNUC__) && (__GNUC__ == 3) && !defined(__SGI_STL_PORT)) // No WCHAR_MIN and WCHAR_MAX, wchar_t has the same range as int. // - SGI MIPSpro with native library // - gcc 3.x on HP-UX // - Mac OS X with native library // - gcc on FreeBSD, OpenBSD and NetBSD public detail::integer_traits_base #elif defined(__hpux) && defined(__GNUC__) && (__GNUC__ == 2) && !defined(__SGI_STL_PORT) // No WCHAR_MIN and WCHAR_MAX, wchar_t has the same range as unsigned int. // - gcc 2.95.x on HP-UX // (also, std::numeric_limits appears to return the wrong values). public detail::integer_traits_base #else #error No WCHAR_MIN and WCHAR_MAX present, please adjust integer_traits<> for your compiler. #endif { }; #endif // BOOST_NO_INTRINSIC_WCHAR_T template<> class integer_traits : public std::numeric_limits, public detail::integer_traits_base { }; template<> class integer_traits : public std::numeric_limits, public detail::integer_traits_base { }; template<> class integer_traits : public std::numeric_limits, public detail::integer_traits_base { }; template<> class integer_traits : public std::numeric_limits, public detail::integer_traits_base { }; template<> class integer_traits : public std::numeric_limits, public detail::integer_traits_base { }; template<> class integer_traits : public std::numeric_limits, public detail::integer_traits_base { }; #if !defined(BOOST_NO_INTEGRAL_INT64_T) && !defined(BOOST_NO_INT64_T) #if defined(ULLONG_MAX) && defined(BOOST_HAS_LONG_LONG) template<> class integer_traits< ::boost::long_long_type> : public std::numeric_limits< ::boost::long_long_type>, public detail::integer_traits_base< ::boost::long_long_type, LLONG_MIN, LLONG_MAX> { }; template<> class integer_traits< ::boost::ulong_long_type> : public std::numeric_limits< ::boost::ulong_long_type>, public detail::integer_traits_base< ::boost::ulong_long_type, 0, ULLONG_MAX> { }; #elif defined(ULONG_LONG_MAX) && defined(BOOST_HAS_LONG_LONG) template<> class integer_traits< ::boost::long_long_type> : public std::numeric_limits< ::boost::long_long_type>, public detail::integer_traits_base< ::boost::long_long_type, LONG_LONG_MIN, LONG_LONG_MAX>{ }; template<> class integer_traits< ::boost::ulong_long_type> : public std::numeric_limits< ::boost::ulong_long_type>, public detail::integer_traits_base< ::boost::ulong_long_type, 0, ULONG_LONG_MAX> { }; #elif defined(ULONGLONG_MAX) && defined(BOOST_HAS_LONG_LONG) template<> class integer_traits< ::boost::long_long_type> : public std::numeric_limits< ::boost::long_long_type>, public detail::integer_traits_base< ::boost::long_long_type, LONGLONG_MIN, LONGLONG_MAX> { }; template<> class integer_traits< ::boost::ulong_long_type> : public std::numeric_limits< ::boost::ulong_long_type>, public detail::integer_traits_base< ::boost::ulong_long_type, 0, ULONGLONG_MAX> { }; #elif defined(_LLONG_MAX) && defined(_C2) && defined(BOOST_HAS_LONG_LONG) template<> class integer_traits< ::boost::long_long_type> : public std::numeric_limits< ::boost::long_long_type>, public detail::integer_traits_base< ::boost::long_long_type, -_LLONG_MAX - _C2, _LLONG_MAX> { }; template<> class integer_traits< ::boost::ulong_long_type> : public std::numeric_limits< ::boost::ulong_long_type>, public detail::integer_traits_base< ::boost::ulong_long_type, 0, _ULLONG_MAX> { }; #elif defined(BOOST_HAS_LONG_LONG) // // we have long long but no constants, this happens for example with gcc in -ansi mode, // we'll just have to work out the values for ourselves (assumes 2's compliment representation): // template<> class integer_traits< ::boost::long_long_type> : public std::numeric_limits< ::boost::long_long_type>, public detail::integer_traits_base< ::boost::long_long_type, (1LL << (sizeof(::boost::long_long_type) * CHAR_BIT - 1)), ~(1LL << (sizeof(::boost::long_long_type) * CHAR_BIT - 1))> { }; template<> class integer_traits< ::boost::ulong_long_type> : public std::numeric_limits< ::boost::ulong_long_type>, public detail::integer_traits_base< ::boost::ulong_long_type, 0, ~0uLL> { }; #elif defined(BOOST_HAS_MS_INT64) template<> class integer_traits< __int64> : public std::numeric_limits< __int64>, public detail::integer_traits_base< __int64, _I64_MIN, _I64_MAX> { }; template<> class integer_traits< unsigned __int64> : public std::numeric_limits< unsigned __int64>, public detail::integer_traits_base< unsigned __int64, 0, _UI64_MAX> { }; #endif #endif } // namespace boost #endif /* BOOST_INTEGER_TRAITS_HPP */ madp-0.4/src/boost/boost/PaxHeaders.5405/enable_shared_from_this.hpp0000644000000000000000000000007312717644140022364 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.049552852 madp-0.4/src/boost/boost/enable_shared_from_this.hpp0000664000372100037210000000102212717644140023207 0ustar00fransfrans00000000000000#ifndef BOOST_ENABLE_SHARED_FROM_THIS_HPP_INCLUDED #define BOOST_ENABLE_SHARED_FROM_THIS_HPP_INCLUDED // // enable_shared_from_this.hpp // // Copyright (c) 2002 Peter Dimov // // Distributed under the Boost Software License, Version 1.0. // See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt // // http://www.boost.org/libs/smart_ptr/enable_shared_from_this.html // #include #endif // #ifndef BOOST_ENABLE_SHARED_FROM_THIS_HPP_INCLUDED madp-0.4/src/boost/boost/PaxHeaders.5405/call_traits.hpp0000644000000000000000000000007312717644140020037 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.041552917 madp-0.4/src/boost/boost/call_traits.hpp0000664000372100037210000000140512717644140020667 0ustar00fransfrans00000000000000// (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/utility for most recent version including documentation. // See boost/detail/call_traits.hpp and boost/detail/ob_call_traits.hpp // for full copyright notices. #ifndef BOOST_CALL_TRAITS_HPP #define BOOST_CALL_TRAITS_HPP #ifndef BOOST_CONFIG_HPP #include #endif #ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION #include #else #include #endif #endif // BOOST_CALL_TRAITS_HPP madp-0.4/src/boost/boost/PaxHeaders.5405/scoped_ptr.hpp0000644000000000000000000000007412717644140017701 xustar0030 atime=1463765180.165719647 30 ctime=1463765201.153552022 madp-0.4/src/boost/boost/scoped_ptr.hpp0000664000372100037210000000075312717644140020535 0ustar00fransfrans00000000000000#ifndef BOOST_SCOPED_PTR_HPP_INCLUDED #define BOOST_SCOPED_PTR_HPP_INCLUDED // (C) Copyright Greg Colvin and Beman Dawes 1998, 1999. // Copyright (c) 2001, 2002 Peter Dimov // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // http://www.boost.org/libs/smart_ptr/scoped_ptr.htm // #include #endif // #ifndef BOOST_SCOPED_PTR_HPP_INCLUDED madp-0.4/src/boost/boost/PaxHeaders.5405/type_traits0000644000000000000000000000007412717644140017320 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/0000775000372100037210000000000012717644140020224 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_abstract.hpp0000644000000000000000000000007412717644140022404 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/is_abstract.hpp0000664000372100037210000001073212717644140023236 0ustar00fransfrans00000000000000#ifndef BOOST_TT_IS_ABSTRACT_CLASS_HPP #define BOOST_TT_IS_ABSTRACT_CLASS_HPP #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once #endif /////////1/////////2/////////3/////////4/////////5/////////6/////////7/////////8 // is_abstract_class.hpp: // // (C) Copyright 2002 Rani Sharoni (rani_sharoni@hotmail.com) and Robert Ramey // Use, modification and distribution is subject to the Boost Software // License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org for updates, documentation, and revision history. // // Compile type discovery whether given type is abstract class or not. // // Requires DR 337 to be supported by compiler // (http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/cwg_active.html#337). // // // Believed (Jan 2004) to work on: // - GCC 3.4 // - VC++ 7.1 // - compilers with new EDG frontend (Intel C++ 7, Comeau 4.3.2) // // Doesn't work on: // - VC++6, VC++7.0 and less // - GCC 3.3.X and less // - Borland C++ 6 and less // // // History: // - Originally written by Rani Sharoni, see // http://groups.google.com/groups?selm=df893da6.0207110613.75b2fe90%40posting.google.com // At this time supported by EDG (Intel C++ 7, Comeau 4.3.2) and VC7.1. // - Adapted and added into Boost.Serialization library by Robert Ramey // (starting with submission #10). // - Jan 2004: GCC 3.4 fixed to support DR337 (Giovanni Bajo). // - Jan 2004: modified to be part of Boost.TypeTraits (Pavel Vozenilek). // - Nov 2004: Christoph Ludwig found that the implementation did not work with // template types and gcc-3.4 or VC7.1, fix due to Christoph Ludwig // and John Maddock. // - Dec 2004: Added new config macro BOOST_NO_IS_ABSTRACT which causes the template // to degrade gracefully, rather than trash the compiler (John Maddock). // #include #ifndef BOOST_IS_ABSTRACT #include #include #include #include #ifdef BOOST_NO_IS_ABSTRACT #include #endif #endif // should be the last #include #include namespace boost { namespace detail{ #ifdef BOOST_IS_ABSTRACT template struct is_abstract_imp { BOOST_STATIC_CONSTANT(bool, value = BOOST_IS_ABSTRACT(T)); }; #elif !defined(BOOST_NO_IS_ABSTRACT) template struct is_abstract_imp2 { // Deduction fails if T is void, function type, // reference type (14.8.2/2)or an abstract class type // according to review status issue #337 // template static type_traits::no_type check_sig(U (*)[1]); template static type_traits::yes_type check_sig(...); // // T must be a complete type, further if T is a template then // it must be instantiated in order for us to get the right answer: // BOOST_STATIC_ASSERT(sizeof(T) != 0); // GCC2 won't even parse this template if we embed the computation // of s1 in the computation of value. #ifdef __GNUC__ BOOST_STATIC_CONSTANT(std::size_t, s1 = sizeof(is_abstract_imp2::template check_sig(0))); #else #if BOOST_WORKAROUND(BOOST_MSVC_FULL_VER, >= 140050000) #pragma warning(push) #pragma warning(disable:6334) #endif BOOST_STATIC_CONSTANT(std::size_t, s1 = sizeof(check_sig(0))); #if BOOST_WORKAROUND(BOOST_MSVC_FULL_VER, >= 140050000) #pragma warning(pop) #endif #endif BOOST_STATIC_CONSTANT(bool, value = (s1 == sizeof(type_traits::yes_type))); }; template struct is_abstract_select { template struct rebind { typedef is_abstract_imp2 type; }; }; template <> struct is_abstract_select { template struct rebind { typedef false_type type; }; }; template struct is_abstract_imp { typedef is_abstract_select< ::boost::is_class::value> selector; typedef typename selector::template rebind binder; typedef typename binder::type type; BOOST_STATIC_CONSTANT(bool, value = type::value); }; #endif } #ifndef BOOST_NO_IS_ABSTRACT BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_abstract,T,::boost::detail::is_abstract_imp::value) #else BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_abstract,T,::boost::detail::is_polymorphic_imp::value) #endif } // namespace boost #include #endif //BOOST_TT_IS_ABSTRACT_CLASS_HPP madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_less_equal.hpp0000644000000000000000000000007312717644140023075 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/has_less_equal.hpp0000664000372100037210000000346112717644140023731 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_LESS_EQUAL_HPP_INCLUDED #define BOOST_TT_HAS_LESS_EQUAL_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_less_equal #define BOOST_TT_TRAIT_OP <= #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* Lhs==pointer and Rhs==fundamental */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_fundamental< Rhs_nocv >::value\ >::value,\ /* Rhs==pointer and Lhs==fundamental */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::is_fundamental< Lhs_nocv >::value\ >::value,\ /* Lhs==pointer and Rhs==pointer and Lhs!=base(Rhs) and Rhs!=base(Lhs) and Lhs!=void* and Rhs!=void* */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::type_traits::ice_not<\ ::boost::type_traits::ice_or<\ ::boost::is_base_of< Lhs_noptr, Rhs_noptr >::value,\ ::boost::is_base_of< Rhs_noptr, Lhs_noptr >::value,\ ::boost::is_same< Lhs_noptr, Rhs_noptr >::value,\ ::boost::is_void< Lhs_noptr >::value,\ ::boost::is_void< Rhs_noptr >::value\ >::value\ >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/common_type.hpp0000644000000000000000000000007412717644140022437 xustar0030 atime=1463765180.177719552 30 ctime=1463765201.173551863 madp-0.4/src/boost/boost/type_traits/common_type.hpp0000664000372100037210000001257112717644140023274 0ustar00fransfrans00000000000000// common_type.hpp ---------------------------------------------------------// // Copyright 2008 Howard Hinnant // Copyright 2008 Beman Dawes // Distributed under the Boost Software License, Version 1.0. // See http://www.boost.org/LICENSE_1_0.txt #ifndef BOOST_TYPE_TRAITS_COMMON_TYPE_HPP #define BOOST_TYPE_TRAITS_COMMON_TYPE_HPP #include #if defined(__SUNPRO_CC) && !defined(BOOST_COMMON_TYPE_DONT_USE_TYPEOF) # define BOOST_COMMON_TYPE_DONT_USE_TYPEOF #endif #if defined(__IBMCPP__) && !defined(BOOST_COMMON_TYPE_DONT_USE_TYPEOF) # define BOOST_COMMON_TYPE_DONT_USE_TYPEOF #endif //----------------------------------------------------------------------------// #if defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) && !defined(BOOST_COMMON_TYPE_ARITY) #define BOOST_COMMON_TYPE_ARITY 3 #endif //----------------------------------------------------------------------------// #if defined(BOOST_NO_CXX11_DECLTYPE) && !defined(BOOST_COMMON_TYPE_DONT_USE_TYPEOF) #include // boost wonders never cease! #endif //----------------------------------------------------------------------------// #ifndef BOOST_NO_CXX11_STATIC_ASSERT #define BOOST_COMMON_TYPE_STATIC_ASSERT(CND, MSG, TYPES) static_assert(CND,MSG) #elif defined(BOOST_COMMON_TYPE_USES_MPL_ASSERT) #include #include #define BOOST_COMMON_TYPE_STATIC_ASSERT(CND, MSG, TYPES) \ BOOST_MPL_ASSERT_MSG(boost::mpl::bool_< (CND) >::type::value, MSG, TYPES) #else #include #define BOOST_COMMON_TYPE_STATIC_ASSERT(CND, MSG, TYPES) BOOST_STATIC_ASSERT(CND) #endif #if !defined(BOOST_NO_CXX11_STATIC_ASSERT) || !defined(BOOST_COMMON_TYPE_USES_MPL_ASSERT) #define BOOST_COMMON_TYPE_MUST_BE_A_COMPLE_TYPE "must be complete type" #endif #if defined(BOOST_NO_CXX11_DECLTYPE) && defined(BOOST_COMMON_TYPE_DONT_USE_TYPEOF) #include #include #endif #include #include #include //----------------------------------------------------------------------------// // // // C++03 implementation of // // 20.9.7.6 Other transformations [meta.trans.other] // // Written by Howard Hinnant // // Adapted for Boost by Beman Dawes, Vicente Botet and Jeffrey Hellrung // // // //----------------------------------------------------------------------------// namespace boost { // prototype #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) template struct common_type; #else // or no specialization template struct common_type { public: typedef typename common_type::type, V>::type type; }; #endif // 1 arg template #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) struct common_type #else struct common_type #endif { BOOST_COMMON_TYPE_STATIC_ASSERT(sizeof(T) > 0, BOOST_COMMON_TYPE_MUST_BE_A_COMPLE_TYPE, (T)); public: typedef T type; }; // 2 args namespace type_traits_detail { template struct common_type_2 { private: BOOST_COMMON_TYPE_STATIC_ASSERT(sizeof(T) > 0, BOOST_COMMON_TYPE_MUST_BE_A_COMPLE_TYPE, (T)); BOOST_COMMON_TYPE_STATIC_ASSERT(sizeof(U) > 0, BOOST_COMMON_TYPE_MUST_BE_A_COMPLE_TYPE, (U)); static bool declval_bool(); // workaround gcc bug; not required by std static typename add_rvalue_reference::type declval_T(); // workaround gcc bug; not required by std static typename add_rvalue_reference::type declval_U(); // workaround gcc bug; not required by std static typename add_rvalue_reference::type declval_b(); #if !defined(BOOST_NO_CXX11_DECLTYPE) public: typedef decltype(declval() ? declval() : declval()) type; #elif defined(BOOST_COMMON_TYPE_DONT_USE_TYPEOF) public: typedef typename detail_type_traits_common_type::common_type_impl< typename remove_cv::type, typename remove_cv::type >::type type; #else public: typedef BOOST_TYPEOF_TPL(declval_b() ? declval_T() : declval_U()) type; #endif #if defined(__GNUC__) && __GNUC__ == 3 && (__GNUC_MINOR__ == 2 || __GNUC_MINOR__ == 3) public: void public_dummy_function_just_to_silence_warning(); #endif }; template struct common_type_2 { typedef T type; }; } #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) template struct common_type #else template struct common_type #endif : public type_traits_detail::common_type_2 { }; // 3 or more args #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) template struct common_type { public: typedef typename common_type::type, V...>::type type; }; #endif } // namespace boost #endif // BOOST_TYPE_TRAITS_COMMON_TYPE_HPP madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_volatile.hpp0000644000000000000000000000007412717644140022420 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/is_volatile.hpp0000664000372100037210000001136412717644140023254 0ustar00fransfrans00000000000000 // (C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes, // Howard Hinnant and John Maddock 2000. // (C) Copyright Mat Marcus, Jesse Jones and Adobe Systems Inc 2001 // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. // Fixed is_pointer, is_reference, is_const, is_volatile, is_same, // is_member_pointer based on the Simulated Partial Specialization work // of Mat Marcus and Jesse Jones. See http://opensource.adobe.com or // http://groups.yahoo.com/group/boost/message/5441 // Some workarounds in here use ideas suggested from "Generic: // Mappings between Types and Values" // by Andrei Alexandrescu (see http://www.cuj.com/experts/1810/alexandr.html). #ifndef BOOST_TT_IS_VOLATILE_HPP_INCLUDED #define BOOST_TT_IS_VOLATILE_HPP_INCLUDED #include #include #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION # include # if BOOST_WORKAROUND(BOOST_MSVC, < 1400) # include # endif #else # include # include # include # include #endif // should be the last #include #include namespace boost { namespace detail{ template struct is_volatile_rval_filter { #if BOOST_WORKAROUND(BOOST_MSVC, < 1400) BOOST_STATIC_CONSTANT(bool, value = ::boost::detail::cv_traits_imp::type*>::is_volatile); #else BOOST_STATIC_CONSTANT(bool, value = ::boost::detail::cv_traits_imp::is_volatile); #endif }; #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES // // We can't filter out rvalue_references at the same level as // references or we get ambiguities from msvc: // template struct is_volatile_rval_filter { BOOST_STATIC_CONSTANT(bool, value = false); }; #endif } #if defined( __CODEGEARC__ ) BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_volatile,T,__is_volatile(T)) #elif !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) //* is a type T declared volatile - is_volatile BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_volatile,T,::boost::detail::is_volatile_rval_filter::value) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_volatile,T&,false) #if defined(BOOST_ILLEGAL_CV_REFERENCES) // these are illegal specialisations; cv-qualifies applied to // references have no effect according to [8.3.2p1], // C++ Builder requires them though as it treats cv-qualified // references as distinct types... BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_volatile,T& const,false) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_volatile,T& volatile,false) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_volatile,T& const volatile,false) #endif #else namespace detail { using ::boost::type_traits::yes_type; using ::boost::type_traits::no_type; yes_type is_volatile_tester(void const volatile*); no_type is_volatile_tester(void const*); template struct is_volatile_helper : public ::boost::type_traits::false_result { }; template <> struct is_volatile_helper { template struct result_ { static T* t; BOOST_STATIC_CONSTANT(bool, value = ( sizeof(boost::detail::yes_type) == sizeof(boost::detail::is_volatile_tester(t)) )); }; }; template <> struct is_volatile_helper { template struct result_ { static T t; BOOST_STATIC_CONSTANT(bool, value = ( sizeof(boost::detail::yes_type) == sizeof(boost::detail::is_volatile_tester(&t)) )); }; }; template struct is_volatile_impl : public is_volatile_helper< is_reference::value , is_array::value >::template result_ { }; BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_volatile,void,false) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_volatile,void const,false) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_volatile,void volatile,true) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_volatile,void const volatile,true) #endif } // namespace detail //* is a type T declared volatile - is_volatile BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_volatile,T,::boost::detail::is_volatile_impl::value) #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION } // namespace boost #include #endif // BOOST_TT_IS_VOLATILE_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/cv_traits.hpp0000644000000000000000000000007312717644140022103 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/cv_traits.hpp0000664000372100037210000000174212717644140022737 0ustar00fransfrans00000000000000// (C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes, Howard // Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. // // defines traits classes for cv-qualified types: // is_const, is_volatile, remove_const, remove_volatile, remove_cv. #ifndef BOOST_TT_CV_TRAITS_HPP_INCLUDED #define BOOST_TT_CV_TRAITS_HPP_INCLUDED #include #include #include #include #include #include #include #include #endif // BOOST_TT_CV_TRAITS_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_convertible.hpp0000644000000000000000000000007412717644140023115 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/is_convertible.hpp0000664000372100037210000004020412717644140023744 0ustar00fransfrans00000000000000 // Copyright 2000 John Maddock (john@johnmaddock.co.uk) // Copyright 2000 Jeremy Siek (jsiek@lsc.nd.edu) // Copyright 1999, 2000 Jaakko Jarvi (jaakko.jarvi@cs.utu.fi) // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_CONVERTIBLE_HPP_INCLUDED #define BOOST_TT_IS_CONVERTIBLE_HPP_INCLUDED #include #ifndef BOOST_IS_CONVERTIBLE #include #include #include #include #include #include #ifndef BOOST_NO_IS_ABSTRACT #include #endif #include #include #include #if defined(__MWERKS__) #include #endif #endif // BOOST_IS_CONVERTIBLE // should be always the last #include directive #include namespace boost { #ifndef BOOST_IS_CONVERTIBLE // is one type convertible to another? // // there are multiple versions of the is_convertible // template, almost every compiler seems to require its // own version. // // Thanks to Andrei Alexandrescu for the original version of the // conversion detection technique! // namespace detail { // MS specific version: #if defined(BOOST_MSVC) && (BOOST_MSVC <= 1300) // This workaround is necessary to handle when From is void // which is normally taken care of by the partial specialization // of the is_convertible typename. using ::boost::type_traits::yes_type; using ::boost::type_traits::no_type; template< typename From > struct does_conversion_exist { template< typename To > struct result_ { static no_type BOOST_TT_DECL _m_check(...); static yes_type BOOST_TT_DECL _m_check(To); static typename add_lvalue_reference::type _m_from; enum { value = sizeof( _m_check(_m_from) ) == sizeof(yes_type) }; }; }; template<> struct does_conversion_exist { template< typename To > struct result_ { enum { value = ::boost::is_void::value }; }; }; template struct is_convertible_basic_impl : public does_conversion_exist::template result_ { }; #elif defined(__BORLANDC__) && (__BORLANDC__ < 0x560) // // special version for Borland compilers // this version breaks when used for some // UDT conversions: // template struct is_convertible_impl { #pragma option push -w-8074 // This workaround for Borland breaks the EDG C++ frontend, // so we only use it for Borland. template struct checker { static ::boost::type_traits::no_type BOOST_TT_DECL _m_check(...); static ::boost::type_traits::yes_type BOOST_TT_DECL _m_check(T); }; static typename add_lvalue_reference::type _m_from; static bool const value = sizeof( checker::_m_check(_m_from) ) == sizeof(::boost::type_traits::yes_type); #pragma option pop }; #elif defined(__GNUC__) || defined(__BORLANDC__) && (__BORLANDC__ < 0x600) // special version for gcc compiler + recent Borland versions // note that this does not pass UDT's through (...) struct any_conversion { template any_conversion(const volatile T&); template any_conversion(const T&); template any_conversion(volatile T&); template any_conversion(T&); }; template struct checker { static boost::type_traits::no_type _m_check(any_conversion ...); static boost::type_traits::yes_type _m_check(T, int); }; template struct is_convertible_basic_impl { typedef typename add_lvalue_reference::type lvalue_type; typedef typename add_rvalue_reference::type rvalue_type; static lvalue_type _m_from; #if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES) && ((__GNUC__ > 4) || ((__GNUC__ == 4) && (__GNUC_MINOR__ > 6))) static bool const value = sizeof( boost::detail::checker::_m_check(static_cast(_m_from), 0) ) == sizeof(::boost::type_traits::yes_type); #else static bool const value = sizeof( boost::detail::checker::_m_check(_m_from, 0) ) == sizeof(::boost::type_traits::yes_type); #endif }; #elif (defined(__EDG_VERSION__) && (__EDG_VERSION__ >= 245) && !defined(__ICL)) \ || defined(__IBMCPP__) || defined(__HP_aCC) // // This is *almost* an ideal world implementation as it doesn't rely // on undefined behaviour by passing UDT's through (...). // Unfortunately it doesn't quite pass all the tests for most compilers (sigh...) // Enable this for your compiler if is_convertible_test.cpp will compile it... // // Note we do not enable this for VC7.1, because even though it passes all the // type_traits tests it is known to cause problems when instantiation occurs // deep within the instantiation tree :-( // struct any_conversion { template any_conversion(const volatile T&); template any_conversion(const T&); template any_conversion(volatile T&); // we need this constructor to catch references to functions // (which can not be cv-qualified): template any_conversion(T&); }; template struct is_convertible_basic_impl { static ::boost::type_traits::no_type BOOST_TT_DECL _m_check(any_conversion ...); static ::boost::type_traits::yes_type BOOST_TT_DECL _m_check(To, int); typedef typename add_lvalue_reference::type lvalue_type; typedef typename add_rvalue_reference::type rvalue_type; static lvalue_type _m_from; #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES BOOST_STATIC_CONSTANT(bool, value = sizeof( _m_check(static_cast(_m_from), 0) ) == sizeof(::boost::type_traits::yes_type) ); #else BOOST_STATIC_CONSTANT(bool, value = sizeof( _m_check(_m_from, 0) ) == sizeof(::boost::type_traits::yes_type) ); #endif }; #elif defined(__DMC__) struct any_conversion { template any_conversion(const volatile T&); template any_conversion(const T&); template any_conversion(volatile T&); // we need this constructor to catch references to functions // (which can not be cv-qualified): template any_conversion(T&); }; template struct is_convertible_basic_impl { // Using '...' doesn't always work on Digital Mars. This version seems to. template static ::boost::type_traits::no_type BOOST_TT_DECL _m_check(any_conversion, float, T); static ::boost::type_traits::yes_type BOOST_TT_DECL _m_check(To, int, int); typedef typename add_lvalue_reference::type lvalue_type; typedef typename add_rvalue_reference::type rvalue_type; static lvalue_type _m_from; // Static constants sometime cause the conversion of _m_from to To to be // called. This doesn't happen with an enum. #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES enum { value = sizeof( _m_check(static_cast(_m_from), 0, 0) ) == sizeof(::boost::type_traits::yes_type) }; #else enum { value = sizeof( _m_check(_m_from, 0, 0) ) == sizeof(::boost::type_traits::yes_type) }; #endif }; #elif defined(__MWERKS__) // // CW works with the technique implemented above for EDG, except when From // is a function type (or a reference to such a type), in which case // any_conversion won't be accepted as a valid conversion. We detect this // exceptional situation and channel it through an alternative algorithm. // template struct is_convertible_basic_impl_aux; struct any_conversion { template any_conversion(const volatile T&); template any_conversion(const T&); template any_conversion(volatile T&); template any_conversion(T&); }; template struct is_convertible_basic_impl_aux { static ::boost::type_traits::no_type BOOST_TT_DECL _m_check(any_conversion ...); static ::boost::type_traits::yes_type BOOST_TT_DECL _m_check(To, int); typedef typename add_lvalue_reference::type lvalue_type; typedef typename add_rvalue_reference::type rvalue_type; static lvalue_type _m_from; #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES BOOST_STATIC_CONSTANT(bool, value = sizeof( _m_check(static_cast(_m_from), 0) ) == sizeof(::boost::type_traits::yes_type) ); #else BOOST_STATIC_CONSTANT(bool, value = sizeof( _m_check(_m_from, 0) ) == sizeof(::boost::type_traits::yes_type) ); #endif }; template struct is_convertible_basic_impl_aux { static ::boost::type_traits::no_type BOOST_TT_DECL _m_check(...); static ::boost::type_traits::yes_type BOOST_TT_DECL _m_check(To); typedef typename add_lvalue_reference::type lvalue_type; typedef typename add_rvalue_reference::type rvalue_type; static lvalue_type _m_from; #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES BOOST_STATIC_CONSTANT(bool, value = sizeof( _m_check(static_cast(_m_from)) ) == sizeof(::boost::type_traits::yes_type) ); #else BOOST_STATIC_CONSTANT(bool, value = sizeof( _m_check(_m_from) ) == sizeof(::boost::type_traits::yes_type) ); #endif }; template struct is_convertible_basic_impl: is_convertible_basic_impl_aux< From,To, ::boost::is_function::type>::value > {}; #else // // This version seems to work pretty well for a wide spectrum of compilers, // however it does rely on undefined behaviour by passing UDT's through (...). // template struct is_convertible_basic_impl { static ::boost::type_traits::no_type BOOST_TT_DECL _m_check(...); static ::boost::type_traits::yes_type BOOST_TT_DECL _m_check(To); typedef typename add_lvalue_reference::type lvalue_type; typedef typename add_rvalue_reference::type rvalue_type; static lvalue_type _m_from; #ifdef BOOST_MSVC #pragma warning(push) #pragma warning(disable:4244) #if BOOST_WORKAROUND(BOOST_MSVC_FULL_VER, >= 140050000) #pragma warning(disable:6334) #endif #endif #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES BOOST_STATIC_CONSTANT(bool, value = sizeof( _m_check(static_cast(_m_from)) ) == sizeof(::boost::type_traits::yes_type) ); #else BOOST_STATIC_CONSTANT(bool, value = sizeof( _m_check(_m_from) ) == sizeof(::boost::type_traits::yes_type) ); #endif #ifdef BOOST_MSVC #pragma warning(pop) #endif }; #endif // is_convertible_impl #if defined(__DMC__) // As before, a static constant sometimes causes errors on Digital Mars. template struct is_convertible_impl { enum { value = (::boost::type_traits::ice_and< ::boost::type_traits::ice_or< ::boost::detail::is_convertible_basic_impl::value, ::boost::is_void::value >::value, ::boost::type_traits::ice_not< ::boost::is_array::value >::value, ::boost::type_traits::ice_not< ::boost::is_function::value >::value >::value) }; }; #elif !defined(__BORLANDC__) || __BORLANDC__ > 0x551 template struct is_convertible_impl { BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_and< ::boost::type_traits::ice_or< ::boost::detail::is_convertible_basic_impl::value, ::boost::is_void::value >::value, ::boost::type_traits::ice_not< ::boost::is_array::value >::value, ::boost::type_traits::ice_not< ::boost::is_function::value >::value >::value) ); }; #endif template struct is_convertible_impl_select { template struct rebind { typedef is_convertible_impl type; }; }; template <> struct is_convertible_impl_select { template struct rebind { typedef true_type type; }; }; template <> struct is_convertible_impl_select { template struct rebind { typedef false_type type; }; }; template <> struct is_convertible_impl_select { template struct rebind { typedef false_type type; }; }; template struct is_convertible_impl_dispatch_base { #if !BOOST_WORKAROUND(__HP_aCC, < 60700) typedef is_convertible_impl_select< ::boost::is_arithmetic::value, ::boost::is_arithmetic::value, #ifndef BOOST_NO_IS_ABSTRACT ::boost::is_abstract::value #else false #endif > selector; #else typedef is_convertible_impl_select selector; #endif typedef typename selector::template rebind isc_binder; typedef typename isc_binder::type type; }; template struct is_convertible_impl_dispatch : public is_convertible_impl_dispatch_base::type {}; // // Now add the full and partial specialisations // for void types, these are common to all the // implementation above: // #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS # define TT_AUX_BOOL_CV_VOID_TRAIT_SPEC2_PART1(trait,spec1,spec2,value) \ BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC2(trait,spec1,spec2,value) \ BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC2(trait,spec1,spec2 const,value) \ BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC2(trait,spec1,spec2 volatile,value) \ BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC2(trait,spec1,spec2 const volatile,value) \ /**/ # define TT_AUX_BOOL_CV_VOID_TRAIT_SPEC2(trait,spec1,spec2,value) \ TT_AUX_BOOL_CV_VOID_TRAIT_SPEC2_PART1(trait,spec1,spec2,value) \ TT_AUX_BOOL_CV_VOID_TRAIT_SPEC2_PART1(trait,spec1 const,spec2,value) \ TT_AUX_BOOL_CV_VOID_TRAIT_SPEC2_PART1(trait,spec1 volatile,spec2,value) \ TT_AUX_BOOL_CV_VOID_TRAIT_SPEC2_PART1(trait,spec1 const volatile,spec2,value) \ /**/ TT_AUX_BOOL_CV_VOID_TRAIT_SPEC2(is_convertible,void,void,true) # undef TT_AUX_BOOL_CV_VOID_TRAIT_SPEC2 # undef TT_AUX_BOOL_CV_VOID_TRAIT_SPEC2_PART1 #else BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC2(is_convertible,void,void,true) #endif // BOOST_NO_CV_VOID_SPECIALIZATIONS #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION BOOST_TT_AUX_BOOL_TRAIT_IMPL_PARTIAL_SPEC2_1(typename To,is_convertible,void,To,false) BOOST_TT_AUX_BOOL_TRAIT_IMPL_PARTIAL_SPEC2_1(typename From,is_convertible,From,void,false) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_IMPL_PARTIAL_SPEC2_1(typename To,is_convertible,void const,To,false) BOOST_TT_AUX_BOOL_TRAIT_IMPL_PARTIAL_SPEC2_1(typename To,is_convertible,void volatile,To,false) BOOST_TT_AUX_BOOL_TRAIT_IMPL_PARTIAL_SPEC2_1(typename To,is_convertible,void const volatile,To,false) BOOST_TT_AUX_BOOL_TRAIT_IMPL_PARTIAL_SPEC2_1(typename From,is_convertible,From,void const,false) BOOST_TT_AUX_BOOL_TRAIT_IMPL_PARTIAL_SPEC2_1(typename From,is_convertible,From,void volatile,false) BOOST_TT_AUX_BOOL_TRAIT_IMPL_PARTIAL_SPEC2_1(typename From,is_convertible,From,void const volatile,false) #endif #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF2(is_convertible,From,To,(::boost::detail::is_convertible_impl_dispatch::value)) #else BOOST_TT_AUX_BOOL_TRAIT_DEF2(is_convertible,From,To,BOOST_IS_CONVERTIBLE(From,To)) #endif } // namespace boost #include #endif // BOOST_TT_IS_CONVERTIBLE_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/make_signed.hpp0000644000000000000000000000007412717644140022354 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/make_signed.hpp0000664000372100037210000001204112717644140023201 0ustar00fransfrans00000000000000 // (C) Copyright John Maddock 2007. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_MAKE_SIGNED_HPP_INCLUDED #define BOOST_TT_MAKE_SIGNED_HPP_INCLUDED #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include // should be the last #include #include namespace boost { namespace detail { template struct make_signed_imp { BOOST_STATIC_ASSERT( (::boost::type_traits::ice_or< ::boost::is_integral::value, ::boost::is_enum::value>::value)); #if !BOOST_WORKAROUND(BOOST_MSVC, <=1300) BOOST_STATIC_ASSERT( (::boost::type_traits::ice_not< ::boost::is_same< typename remove_cv::type, bool>::value>::value)); #endif typedef typename remove_cv::type t_no_cv; typedef typename mpl::if_c< (::boost::type_traits::ice_and< ::boost::is_signed::value, ::boost::is_integral::value, ::boost::type_traits::ice_not< ::boost::is_same::value>::value, ::boost::type_traits::ice_not< ::boost::is_same::value>::value, ::boost::type_traits::ice_not< ::boost::is_same::value>::value >::value), T, typename mpl::if_c< (::boost::type_traits::ice_and< ::boost::is_integral::value, ::boost::type_traits::ice_not< ::boost::is_same::value>::value, ::boost::type_traits::ice_not< ::boost::is_same::value>::value, ::boost::type_traits::ice_not< ::boost::is_same::value>::value> ::value), typename mpl::if_< is_same, signed char, typename mpl::if_< is_same, signed short, typename mpl::if_< is_same, int, typename mpl::if_< is_same, long, #if defined(BOOST_HAS_LONG_LONG) #ifdef BOOST_HAS_INT128 typename mpl::if_c< sizeof(t_no_cv) == sizeof(boost::long_long_type), boost::long_long_type, boost::int128_type >::type #else boost::long_long_type #endif #elif defined(BOOST_HAS_MS_INT64) __int64 #else long #endif >::type >::type >::type >::type, // Not a regular integer type: typename mpl::if_c< sizeof(t_no_cv) == sizeof(unsigned char), signed char, typename mpl::if_c< sizeof(t_no_cv) == sizeof(unsigned short), signed short, typename mpl::if_c< sizeof(t_no_cv) == sizeof(unsigned int), int, typename mpl::if_c< sizeof(t_no_cv) == sizeof(unsigned long), long, #if defined(BOOST_HAS_LONG_LONG) #ifdef BOOST_HAS_INT128 typename mpl::if_c< sizeof(t_no_cv) == sizeof(boost::long_long_type), boost::long_long_type, boost::int128_type >::type #else boost::long_long_type #endif #elif defined(BOOST_HAS_MS_INT64) __int64 #else long #endif >::type >::type >::type >::type >::type >::type base_integer_type; // Add back any const qualifier: typedef typename mpl::if_< is_const, typename add_const::type, base_integer_type >::type const_base_integer_type; // Add back any volatile qualifier: typedef typename mpl::if_< is_volatile, typename add_volatile::type, const_base_integer_type >::type type; }; } // namespace detail BOOST_TT_AUX_TYPE_TRAIT_DEF1(make_signed,T,typename boost::detail::make_signed_imp::type) } // namespace boost #include #endif // BOOST_TT_ADD_REFERENCE_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/remove_volatile.hpp0000644000000000000000000000007412717644140023302 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/remove_volatile.hpp0000664000372100037210000000473612717644140024143 0ustar00fransfrans00000000000000 // (C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes, Howard // Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_REMOVE_VOLATILE_HPP_INCLUDED #define BOOST_TT_REMOVE_VOLATILE_HPP_INCLUDED #include #include #include #include #include #include #if BOOST_WORKAROUND(BOOST_MSVC,<=1300) #include #endif // should be the last #include #include namespace boost { #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION namespace detail { template struct remove_volatile_helper { typedef T type; }; template struct remove_volatile_helper { typedef T const type; }; template struct remove_volatile_impl { typedef typename remove_volatile_helper< typename cv_traits_imp::unqualified_type , ::boost::is_const::value >::type type; }; // // We can't filter out rvalue_references at the same level as // references or we get ambiguities from msvc: // #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES template struct remove_volatile_impl { typedef T&& type; }; #endif } // namespace detail // * convert a type T to a non-volatile type - remove_volatile BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_volatile,T,typename boost::detail::remove_volatile_impl::type) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,remove_volatile,T&,T&) #if !defined(BOOST_NO_ARRAY_TYPE_SPECIALIZATIONS) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_2(typename T,std::size_t N,remove_volatile,T volatile[N],T type[N]) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_2(typename T,std::size_t N,remove_volatile,T const volatile[N],T const type[N]) #endif #elif !BOOST_WORKAROUND(BOOST_MSVC,<=1300) BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_volatile,T,typename boost::detail::remove_volatile_impl::type) #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION } // namespace boost #include #endif // BOOST_TT_REMOVE_VOLATILE_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/conversion_traits.hpp0000644000000000000000000000007312717644140023660 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/conversion_traits.hpp0000664000372100037210000000122212717644140024505 0ustar00fransfrans00000000000000 // Copyright 2000 John Maddock (john@johnmaddock.co.uk) // Copyright 2000 Jeremy Siek (jsiek@lsc.nd.edu) // Copyright 1999, 2000 Jaakko Jarvi (jaakko.jarvi@cs.utu.fi) // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_CONVERSION_TRAITS_HPP_INCLUDED #define BOOST_TT_CONVERSION_TRAITS_HPP_INCLUDED #include #endif // BOOST_TT_CONVERSION_TRAITS_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/remove_cv.hpp0000644000000000000000000000007412717644140022073 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/remove_cv.hpp0000664000372100037210000000455412717644140022732 0ustar00fransfrans00000000000000 // (C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes, Howard // Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_REMOVE_CV_HPP_INCLUDED #define BOOST_TT_REMOVE_CV_HPP_INCLUDED #include #include #include #include #include #if BOOST_WORKAROUND(BOOST_MSVC,<=1300) #include #endif // should be the last #include #include namespace boost { #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION namespace detail{ template struct rvalue_ref_filter_rem_cv { typedef typename boost::detail::cv_traits_imp::unqualified_type type; }; #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES // // We can't filter out rvalue_references at the same level as // references or we get ambiguities from msvc: // template struct rvalue_ref_filter_rem_cv { typedef T&& type; }; #endif } // convert a type T to a non-cv-qualified type - remove_cv BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_cv,T,typename boost::detail::rvalue_ref_filter_rem_cv::type) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,remove_cv,T&,T&) #if !defined(BOOST_NO_ARRAY_TYPE_SPECIALIZATIONS) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_2(typename T,std::size_t N,remove_cv,T const[N],T type[N]) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_2(typename T,std::size_t N,remove_cv,T volatile[N],T type[N]) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_2(typename T,std::size_t N,remove_cv,T const volatile[N],T type[N]) #endif #elif !BOOST_WORKAROUND(BOOST_MSVC,<=1300) namespace detail { template struct remove_cv_impl { typedef typename remove_volatile_impl< typename remove_const_impl::type >::type type; }; } BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_cv,T,typename boost::detail::remove_cv_impl::type) #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION } // namespace boost #include #endif // BOOST_TT_REMOVE_CV_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/add_cv.hpp0000644000000000000000000000007412717644140021326 xustar0030 atime=1463765180.177719552 30 ctime=1463765201.173551863 madp-0.4/src/boost/boost/type_traits/add_cv.hpp0000664000372100037210000000270212717644140022156 0ustar00fransfrans00000000000000 // (C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes, Howard // Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_ADD_CV_HPP_INCLUDED #define BOOST_TT_ADD_CV_HPP_INCLUDED #include // should be the last #include #include namespace boost { // * convert a type T to a const volatile type - add_cv // this is not required since the result is always // the same as "T const volatile", but it does suppress warnings // from some compilers: #if defined(BOOST_MSVC) // This bogus warning will appear when add_volatile is applied to a // const volatile reference because we can't detect const volatile // references with MSVC6. # pragma warning(push) # pragma warning(disable:4181) // warning C4181: qualifier applied to reference type ignored #endif BOOST_TT_AUX_TYPE_TRAIT_DEF1(add_cv,T,T const volatile) #if defined(BOOST_MSVC) # pragma warning(pop) #endif #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,add_cv,T&,T&) #endif } // namespace boost #include #endif // BOOST_TT_ADD_CV_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_unary_plus.hpp0000644000000000000000000000007412717644140023142 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_unary_plus.hpp0000664000372100037210000000126212717644140023772 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_UNARY_PLUS_HPP_INCLUDED #define BOOST_TT_HAS_UNARY_PLUS_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_unary_plus #define BOOST_TT_TRAIT_OP + #define BOOST_TT_FORBIDDEN_IF\ false #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_negate.hpp0000644000000000000000000000007412717644140022204 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_negate.hpp0000664000372100037210000000133312717644140023033 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_NEGATE_HPP_INCLUDED #define BOOST_TT_HAS_NEGATE_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_negate #define BOOST_TT_TRAIT_OP - #define BOOST_TT_FORBIDDEN_IF\ /* pointer */\ ::boost::is_pointer< Rhs_noref >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/integral_promotion.hpp0000644000000000000000000000007412717644140024021 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/integral_promotion.hpp0000664000372100037210000001430712717644140024655 0ustar00fransfrans00000000000000// Copyright 2005 Alexander Nasonov. // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef FILE_boost_type_traits_integral_promotion_hpp_INCLUDED #define FILE_boost_type_traits_integral_promotion_hpp_INCLUDED #include #include #include #include #include #include #include #include // Should be the last #include #include namespace boost { namespace type_traits { namespace detail { // 4.5/2 template struct need_promotion : public boost::is_enum {}; // 4.5/1 template<> struct need_promotion : public true_type {}; template<> struct need_promotion : public true_type {}; template<> struct need_promotion : public true_type {}; template<> struct need_promotion : public true_type {}; template<> struct need_promotion : public true_type {}; // Specializations for non-standard types. // Type is promoted if it's smaller then int. #define BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE(T) \ template<> struct need_promotion \ : public integral_constant {}; // Same set of integral types as in boost/type_traits/is_integral.hpp. // Please, keep in sync. #if (defined(BOOST_MSVC) && (BOOST_MSVC < 1300)) \ || (defined(BOOST_INTEL_CXX_VERSION) && defined(_MSC_VER) && (BOOST_INTEL_CXX_VERSION <= 600)) \ || (defined(__BORLANDC__) && (__BORLANDC__ == 0x600) && (_MSC_VER < 1300)) // TODO: common macro for this #if. Or better yet, PP SEQ of non-standard types. BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE(__int8 ) BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE(unsigned __int8 ) BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE(__int16 ) BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE(unsigned __int16) BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE(__int32 ) BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE(unsigned __int32) #ifdef __BORLANDC__ BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE(unsigned __int64) BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE( __int64) #endif #endif #if defined(BOOST_HAS_LONG_LONG) BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE(boost::ulong_long_type) BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE(boost::long_long_type ) #elif defined(BOOST_HAS_MS_INT64) BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE(unsigned __int64) BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE( __int64) #endif #undef BOOST_TT_AUX_PROMOTE_NONSTANDARD_TYPE #ifndef BOOST_NO_INTRINSIC_WCHAR_T // 4.5/2 template<> struct need_promotion : public true_type {}; #endif // 4.5/3 (integral bit-field) is not supported. // 4.5/4 template<> struct need_promotion : public true_type {}; // Get promoted type by index and cv qualifiers. template struct promote_from_index; #define BOOST_TT_AUX_PROMOTE_FROM_INDEX(N,T) \ template<> struct promote_from_index { typedef T type; }; \ template<> struct promote_from_index { typedef T volatile type; }; \ template<> struct promote_from_index { typedef T const type; }; \ template<> struct promote_from_index { typedef T const volatile type; }; BOOST_TT_AUX_PROMOTE_FROM_INDEX(1, int ) BOOST_TT_AUX_PROMOTE_FROM_INDEX(2, unsigned int ) BOOST_TT_AUX_PROMOTE_FROM_INDEX(3, long ) BOOST_TT_AUX_PROMOTE_FROM_INDEX(4, unsigned long) // WARNING: integral promotions to non-standard types // long long and __int64 are not defined by the standard. // Additional specialisations and overloads shouldn't // introduce ambiguity, though. #if defined(BOOST_HAS_LONG_LONG) BOOST_TT_AUX_PROMOTE_FROM_INDEX(5, boost::long_long_type ) BOOST_TT_AUX_PROMOTE_FROM_INDEX(6, boost::ulong_long_type) #elif defined(BOOST_HAS_MS_INT64) BOOST_TT_AUX_PROMOTE_FROM_INDEX(7, __int64 ) BOOST_TT_AUX_PROMOTE_FROM_INDEX(8, unsigned __int64) #endif #undef BOOST_TT_AUX_PROMOTE_FROM_INDEX // Define BOOST_TT_AUX_PROMOTED_INDEX_TESTER: #if !defined(BOOST_MSVC) template struct sized_type_for_promotion { typedef char (&type)[N]; }; #define BOOST_TT_AUX_PROMOTED_INDEX_TESTER(I,T) \ sized_type_for_promotion::type promoted_index_tester(T); #else #define BOOST_TT_AUX_PROMOTED_INDEX_TESTER(I,T) \ char (&promoted_index_tester(T))[I]; #endif BOOST_TT_AUX_PROMOTED_INDEX_TESTER(1, int ) BOOST_TT_AUX_PROMOTED_INDEX_TESTER(2, unsigned int ) BOOST_TT_AUX_PROMOTED_INDEX_TESTER(3, long ) BOOST_TT_AUX_PROMOTED_INDEX_TESTER(4, unsigned long) #if defined(BOOST_HAS_LONG_LONG) BOOST_TT_AUX_PROMOTED_INDEX_TESTER(5, boost::long_long_type ) BOOST_TT_AUX_PROMOTED_INDEX_TESTER(6, boost::ulong_long_type) #elif defined(BOOST_HAS_MS_INT64) BOOST_TT_AUX_PROMOTED_INDEX_TESTER(7, __int64 ) BOOST_TT_AUX_PROMOTED_INDEX_TESTER(8, unsigned __int64) #endif #undef BOOST_TT_AUX_PROMOTED_INDEX_TESTER // Get an index of promoted type for type T. // Precondition: need_promotion template struct promoted_index { static T testee; // undefined BOOST_STATIC_CONSTANT(int, value = sizeof(promoted_index_tester(+testee)) ); // Unary plus promotes testee LOOK HERE ---> ^ }; template struct integral_promotion_impl { typedef BOOST_DEDUCED_TYPENAME promote_from_index< (boost::type_traits::detail::promoted_index::value) , (boost::is_const::value) , (boost::is_volatile::value) >::type type; }; template struct integral_promotion : public boost::mpl::eval_if< need_promotion::type> , integral_promotion_impl , boost::mpl::identity > { }; } } BOOST_TT_AUX_TYPE_TRAIT_DEF1( integral_promotion , T , BOOST_DEDUCED_TYPENAME boost::type_traits::detail::integral_promotion::type ) } #include #endif // #ifndef FILE_boost_type_traits_integral_promotion_hpp_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_const.hpp0000644000000000000000000000007412717644140021727 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/is_const.hpp0000664000372100037210000001214712717644140022563 0ustar00fransfrans00000000000000 // (C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes, // Howard Hinnant and John Maddock 2000. // (C) Copyright Mat Marcus, Jesse Jones and Adobe Systems Inc 2001 // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. // Fixed is_pointer, is_reference, is_const, is_volatile, is_same, // is_member_pointer based on the Simulated Partial Specialization work // of Mat Marcus and Jesse Jones. See http://opensource.adobe.com or // http://groups.yahoo.com/group/boost/message/5441 // Some workarounds in here use ideas suggested from "Generic: // Mappings between Types and Values" // by Andrei Alexandrescu (see http://www.cuj.com/experts/1810/alexandr.html). #ifndef BOOST_TT_IS_CONST_HPP_INCLUDED #define BOOST_TT_IS_CONST_HPP_INCLUDED #include #include #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION # include # ifdef __GNUC__ # include # endif # if BOOST_WORKAROUND(BOOST_MSVC, < 1400) # include # endif #else # include # include # include # include #endif // should be the last #include #include namespace boost { #if defined( __CODEGEARC__ ) BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_const,T,__is_const(T)) #elif !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) namespace detail{ // // We can't filter out rvalue_references at the same level as // references or we get ambiguities from msvc: // template struct is_const_rvalue_filter { #if BOOST_WORKAROUND(BOOST_MSVC, < 1400) BOOST_STATIC_CONSTANT(bool, value = ::boost::detail::cv_traits_imp::type*>::is_const); #else BOOST_STATIC_CONSTANT(bool, value = ::boost::detail::cv_traits_imp::is_const); #endif }; #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES template struct is_const_rvalue_filter { BOOST_STATIC_CONSTANT(bool, value = false); }; #endif } //* is a type T declared const - is_const BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_const,T,::boost::detail::is_const_rvalue_filter::value) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_const,T&,false) #if defined(BOOST_ILLEGAL_CV_REFERENCES) // these are illegal specialisations; cv-qualifies applied to // references have no effect according to [8.3.2p1], // C++ Builder requires them though as it treats cv-qualified // references as distinct types... BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_const,T& const,false) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_const,T& volatile,false) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_const,T& const volatile,false) #endif #if defined(__GNUC__) && (__GNUC__ < 3) // special case for gcc where illegally cv-qualified reference types can be // generated in some corner cases: BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_const,T const,!(::boost::is_reference::value)) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_const,T volatile const,!(::boost::is_reference::value)) #endif #else namespace detail { using ::boost::type_traits::yes_type; using ::boost::type_traits::no_type; yes_type is_const_tester(const volatile void*); no_type is_const_tester(volatile void *); template struct is_const_helper : public ::boost::type_traits::false_result { }; template <> struct is_const_helper { template struct result_ { static T* t; BOOST_STATIC_CONSTANT(bool, value = ( sizeof(boost::detail::yes_type) == sizeof(boost::detail::is_const_tester(t)) )); }; }; template <> struct is_const_helper { template struct result_ { static T t; BOOST_STATIC_CONSTANT(bool, value = ( sizeof(boost::detail::yes_type) == sizeof(boost::detail::is_const_tester(&t)) )); }; }; template struct is_const_impl : public is_const_helper< is_reference::value , is_array::value >::template result_ { }; BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_const,void,false) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_const,void const,true) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_const,void volatile,false) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_const,void const volatile,true) #endif } // namespace detail //* is a type T declared const - is_const BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_const,T,::boost::detail::is_const_impl::value) #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION } // namespace boost #include #endif // BOOST_TT_IS_CONST_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/intrinsics.hpp0000644000000000000000000000007412717644140022273 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/intrinsics.hpp0000664000372100037210000003641112717644140023127 0ustar00fransfrans00000000000000// (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_INTRINSICS_HPP_INCLUDED #define BOOST_TT_INTRINSICS_HPP_INCLUDED #ifndef BOOST_TT_CONFIG_HPP_INCLUDED #include #endif // // Helper macros for builtin compiler support. // If your compiler has builtin support for any of the following // traits concepts, then redefine the appropriate macros to pick // up on the compiler support: // // (these should largely ignore cv-qualifiers) // BOOST_IS_UNION(T) should evaluate to true if T is a union type // BOOST_IS_POD(T) should evaluate to true if T is a POD type // BOOST_IS_EMPTY(T) should evaluate to true if T is an empty class type (and not a union) // BOOST_HAS_TRIVIAL_CONSTRUCTOR(T) should evaluate to true if "T x;" has no effect // BOOST_HAS_TRIVIAL_COPY(T) should evaluate to true if T(t) <==> memcpy // BOOST_HAS_TRIVIAL_MOVE_CONSTRUCTOR(T) should evaluate to true if T(boost::move(t)) <==> memcpy // BOOST_HAS_TRIVIAL_ASSIGN(T) should evaluate to true if t = u <==> memcpy // BOOST_HAS_TRIVIAL_MOVE_ASSIGN(T) should evaluate to true if t = boost::move(u) <==> memcpy // BOOST_HAS_TRIVIAL_DESTRUCTOR(T) should evaluate to true if ~T() has no effect // BOOST_HAS_NOTHROW_CONSTRUCTOR(T) should evaluate to true if "T x;" can not throw // BOOST_HAS_NOTHROW_COPY(T) should evaluate to true if T(t) can not throw // BOOST_HAS_NOTHROW_ASSIGN(T) should evaluate to true if t = u can not throw // BOOST_HAS_VIRTUAL_DESTRUCTOR(T) should evaluate to true T has a virtual destructor // // The following can also be defined: when detected our implementation is greatly simplified. // // BOOST_IS_ABSTRACT(T) true if T is an abstract type // BOOST_IS_BASE_OF(T,U) true if T is a base class of U // BOOST_IS_CLASS(T) true if T is a class type (and not a union) // BOOST_IS_CONVERTIBLE(T,U) true if T is convertible to U // BOOST_IS_ENUM(T) true is T is an enum // BOOST_IS_POLYMORPHIC(T) true if T is a polymorphic type // BOOST_ALIGNMENT_OF(T) should evaluate to the alignment requirements of type T. #ifdef BOOST_HAS_SGI_TYPE_TRAITS // Hook into SGI's __type_traits class, this will pick up user supplied // specializations as well as SGI - compiler supplied specializations. # include # ifdef __NetBSD__ // There are two different versions of type_traits.h on NetBSD on Spark // use an implicit include via algorithm instead, to make sure we get // the same version as the std lib: # include # else # include # endif # define BOOST_IS_POD(T) ::boost::is_same< typename ::__type_traits::is_POD_type, ::__true_type>::value # define BOOST_HAS_TRIVIAL_CONSTRUCTOR(T) ::boost::is_same< typename ::__type_traits::has_trivial_default_constructor, ::__true_type>::value # define BOOST_HAS_TRIVIAL_COPY(T) ::boost::is_same< typename ::__type_traits::has_trivial_copy_constructor, ::__true_type>::value # define BOOST_HAS_TRIVIAL_ASSIGN(T) ::boost::is_same< typename ::__type_traits::has_trivial_assignment_operator, ::__true_type>::value # define BOOST_HAS_TRIVIAL_DESTRUCTOR(T) ::boost::is_same< typename ::__type_traits::has_trivial_destructor, ::__true_type>::value # ifdef __sgi # define BOOST_HAS_TYPE_TRAITS_INTRINSICS # endif #endif #if defined(__MSL_CPP__) && (__MSL_CPP__ >= 0x8000) // Metrowerks compiler is acquiring intrinsic type traits support // post version 8. We hook into the published interface to pick up // user defined specializations as well as compiler intrinsics as // and when they become available: # include # define BOOST_IS_UNION(T) BOOST_STD_EXTENSION_NAMESPACE::is_union::value # define BOOST_IS_POD(T) BOOST_STD_EXTENSION_NAMESPACE::is_POD::value # define BOOST_HAS_TRIVIAL_CONSTRUCTOR(T) BOOST_STD_EXTENSION_NAMESPACE::has_trivial_default_ctor::value # define BOOST_HAS_TRIVIAL_COPY(T) BOOST_STD_EXTENSION_NAMESPACE::has_trivial_copy_ctor::value # define BOOST_HAS_TRIVIAL_ASSIGN(T) BOOST_STD_EXTENSION_NAMESPACE::has_trivial_assignment::value # define BOOST_HAS_TRIVIAL_DESTRUCTOR(T) BOOST_STD_EXTENSION_NAMESPACE::has_trivial_dtor::value # define BOOST_HAS_TYPE_TRAITS_INTRINSICS #endif #if (defined(BOOST_MSVC) && defined(BOOST_MSVC_FULL_VER) && (BOOST_MSVC_FULL_VER >=140050215))\ || (defined(BOOST_INTEL) && defined(_MSC_VER) && (_MSC_VER >= 1500)) # include # include # define BOOST_IS_UNION(T) __is_union(T) # define BOOST_IS_POD(T) (__is_pod(T) && __has_trivial_constructor(T)) # define BOOST_IS_EMPTY(T) __is_empty(T) # define BOOST_HAS_TRIVIAL_CONSTRUCTOR(T) __has_trivial_constructor(T) # define BOOST_HAS_TRIVIAL_COPY(T) (__has_trivial_copy(T)|| ( ::boost::is_pod::value && !::boost::is_volatile::value)) # define BOOST_HAS_TRIVIAL_ASSIGN(T) (__has_trivial_assign(T) || ( ::boost::is_pod::value && ! ::boost::is_const::value && !::boost::is_volatile::value)) # define BOOST_HAS_TRIVIAL_DESTRUCTOR(T) (__has_trivial_destructor(T) || ::boost::is_pod::value) # define BOOST_HAS_NOTHROW_CONSTRUCTOR(T) (__has_nothrow_constructor(T) || ::boost::has_trivial_constructor::value) # define BOOST_HAS_NOTHROW_COPY(T) (__has_nothrow_copy(T) || ::boost::has_trivial_copy::value) # define BOOST_HAS_NOTHROW_ASSIGN(T) (__has_nothrow_assign(T) || ::boost::has_trivial_assign::value) # define BOOST_HAS_VIRTUAL_DESTRUCTOR(T) __has_virtual_destructor(T) # define BOOST_IS_ABSTRACT(T) __is_abstract(T) # define BOOST_IS_BASE_OF(T,U) (__is_base_of(T,U) && !is_same::value) # define BOOST_IS_CLASS(T) __is_class(T) # define BOOST_IS_CONVERTIBLE(T,U) ((__is_convertible_to(T,U) || (is_same::value && !is_function::value)) && !__is_abstract(U)) # define BOOST_IS_ENUM(T) __is_enum(T) // This one doesn't quite always do the right thing: // # define BOOST_IS_POLYMORPHIC(T) __is_polymorphic(T) // This one fails if the default alignment has been changed with /Zp: // # define BOOST_ALIGNMENT_OF(T) __alignof(T) # if defined(_MSC_VER) && (_MSC_VER >= 1700) # define BOOST_HAS_TRIVIAL_MOVE_CONSTRUCTOR(T) ((__has_trivial_move_constructor(T) || ::boost::is_pod::value) && !::boost::is_volatile::value) # define BOOST_HAS_TRIVIAL_MOVE_ASSIGN(T) ((__has_trivial_move_assign(T) || ::boost::is_pod::value) && ! ::boost::is_const::value && !::boost::is_volatile::value) # endif # define BOOST_HAS_TYPE_TRAITS_INTRINSICS #endif #if defined(__DMC__) && (__DMC__ >= 0x848) // For Digital Mars C++, www.digitalmars.com # define BOOST_IS_UNION(T) (__typeinfo(T) & 0x400) # define BOOST_IS_POD(T) (__typeinfo(T) & 0x800) # define BOOST_IS_EMPTY(T) (__typeinfo(T) & 0x1000) # define BOOST_HAS_TRIVIAL_CONSTRUCTOR(T) (__typeinfo(T) & 0x10) # define BOOST_HAS_TRIVIAL_COPY(T) (__typeinfo(T) & 0x20) # define BOOST_HAS_TRIVIAL_ASSIGN(T) (__typeinfo(T) & 0x40) # define BOOST_HAS_TRIVIAL_DESTRUCTOR(T) (__typeinfo(T) & 0x8) # define BOOST_HAS_NOTHROW_CONSTRUCTOR(T) (__typeinfo(T) & 0x80) # define BOOST_HAS_NOTHROW_COPY(T) (__typeinfo(T) & 0x100) # define BOOST_HAS_NOTHROW_ASSIGN(T) (__typeinfo(T) & 0x200) # define BOOST_HAS_VIRTUAL_DESTRUCTOR(T) (__typeinfo(T) & 0x4) # define BOOST_HAS_TYPE_TRAITS_INTRINSICS #endif #if defined(BOOST_CLANG) && defined(__has_feature) # include # include # include # include # if __has_feature(is_union) # define BOOST_IS_UNION(T) __is_union(T) # endif # if (!defined(__GLIBCXX__) || (__GLIBCXX__ >= 20080306 && __GLIBCXX__ != 20080519)) && __has_feature(is_pod) # define BOOST_IS_POD(T) __is_pod(T) # endif # if (!defined(__GLIBCXX__) || (__GLIBCXX__ >= 20080306 && __GLIBCXX__ != 20080519)) && __has_feature(is_empty) # define BOOST_IS_EMPTY(T) __is_empty(T) # endif # if __has_feature(has_trivial_constructor) # define BOOST_HAS_TRIVIAL_CONSTRUCTOR(T) __has_trivial_constructor(T) # endif # if __has_feature(has_trivial_copy) # define BOOST_HAS_TRIVIAL_COPY(T) (__has_trivial_copy(T) && !is_reference::value && !is_volatile::value) # endif # if __has_feature(has_trivial_assign) # define BOOST_HAS_TRIVIAL_ASSIGN(T) (__has_trivial_assign(T) && !is_volatile::value) # endif # if __has_feature(has_trivial_destructor) # define BOOST_HAS_TRIVIAL_DESTRUCTOR(T) __has_trivial_destructor(T) # endif # if __has_feature(has_nothrow_constructor) # define BOOST_HAS_NOTHROW_CONSTRUCTOR(T) __has_nothrow_constructor(T) # endif # if __has_feature(has_nothrow_copy) # define BOOST_HAS_NOTHROW_COPY(T) (__has_nothrow_copy(T) && !is_volatile::value && !is_reference::value) # endif # if __has_feature(has_nothrow_assign) # define BOOST_HAS_NOTHROW_ASSIGN(T) (__has_nothrow_assign(T) && !is_volatile::value) # endif # if __has_feature(has_virtual_destructor) # define BOOST_HAS_VIRTUAL_DESTRUCTOR(T) __has_virtual_destructor(T) # endif # if __has_feature(is_abstract) # define BOOST_IS_ABSTRACT(T) __is_abstract(T) # endif # if __has_feature(is_base_of) # define BOOST_IS_BASE_OF(T,U) (__is_base_of(T,U) && !is_same::value) # endif # if __has_feature(is_class) # define BOOST_IS_CLASS(T) __is_class(T) # endif # if __has_feature(is_convertible_to) # include # define BOOST_IS_CONVERTIBLE(T,U) (__is_convertible_to(T,U) && !::boost::is_abstract::value) # endif # if __has_feature(is_enum) # define BOOST_IS_ENUM(T) __is_enum(T) # endif # if __has_feature(is_polymorphic) # define BOOST_IS_POLYMORPHIC(T) __is_polymorphic(T) # endif # if __has_feature(has_trivial_move_constructor) # define BOOST_HAS_TRIVIAL_MOVE_CONSTRUCTOR(T) __has_trivial_move_constructor(T) # endif # if __has_feature(has_trivial_move_assign) # define BOOST_HAS_TRIVIAL_MOVE_ASSIGN(T) __has_trivial_move_assign(T) # endif # define BOOST_ALIGNMENT_OF(T) __alignof(T) # define BOOST_HAS_TYPE_TRAITS_INTRINSICS #endif #if defined(__GNUC__) && ((__GNUC__ > 4) || ((__GNUC__ == 4) && (__GNUC_MINOR__ >= 3) && !defined(__GCCXML__))) && !defined(BOOST_CLANG) # include # include # include #ifdef BOOST_INTEL # define BOOST_INTEL_TT_OPTS || is_pod::value #else # define BOOST_INTEL_TT_OPTS #endif # define BOOST_IS_UNION(T) __is_union(T) # define BOOST_IS_POD(T) __is_pod(T) # define BOOST_IS_EMPTY(T) __is_empty(T) # define BOOST_HAS_TRIVIAL_CONSTRUCTOR(T) ((__has_trivial_constructor(T) BOOST_INTEL_TT_OPTS) && ! ::boost::is_volatile::value) # define BOOST_HAS_TRIVIAL_COPY(T) ((__has_trivial_copy(T) BOOST_INTEL_TT_OPTS) && !is_reference::value && ! ::boost::is_volatile::value) # define BOOST_HAS_TRIVIAL_ASSIGN(T) ((__has_trivial_assign(T) BOOST_INTEL_TT_OPTS) && ! ::boost::is_volatile::value && ! ::boost::is_const::value) # define BOOST_HAS_TRIVIAL_DESTRUCTOR(T) (__has_trivial_destructor(T) BOOST_INTEL_TT_OPTS) # define BOOST_HAS_NOTHROW_CONSTRUCTOR(T) (__has_nothrow_constructor(T) BOOST_INTEL_TT_OPTS) # define BOOST_HAS_NOTHROW_COPY(T) ((__has_nothrow_copy(T) BOOST_INTEL_TT_OPTS) && !is_volatile::value && !is_reference::value) # define BOOST_HAS_NOTHROW_ASSIGN(T) ((__has_nothrow_assign(T) BOOST_INTEL_TT_OPTS) && !is_volatile::value && !is_const::value) # define BOOST_HAS_VIRTUAL_DESTRUCTOR(T) __has_virtual_destructor(T) # define BOOST_IS_ABSTRACT(T) __is_abstract(T) # define BOOST_IS_BASE_OF(T,U) (__is_base_of(T,U) && !is_same::value) # define BOOST_IS_CLASS(T) __is_class(T) # define BOOST_IS_ENUM(T) __is_enum(T) # define BOOST_IS_POLYMORPHIC(T) __is_polymorphic(T) # if (!defined(unix) && !defined(__unix__)) || defined(__LP64__) // GCC sometimes lies about alignment requirements // of type double on 32-bit unix platforms, use the // old implementation instead in that case: # define BOOST_ALIGNMENT_OF(T) __alignof__(T) # endif # define BOOST_HAS_TYPE_TRAITS_INTRINSICS #endif #if defined(__ghs__) && (__GHS_VERSION_NUMBER >= 600) # include # include # include # define BOOST_IS_UNION(T) __is_union(T) # define BOOST_IS_POD(T) __is_pod(T) # define BOOST_IS_EMPTY(T) __is_empty(T) # define BOOST_HAS_TRIVIAL_CONSTRUCTOR(T) __has_trivial_constructor(T) # define BOOST_HAS_TRIVIAL_COPY(T) (__has_trivial_copy(T) && !is_reference::value && !is_volatile::value) # define BOOST_HAS_TRIVIAL_ASSIGN(T) (__has_trivial_assign(T) && !is_volatile::value) # define BOOST_HAS_TRIVIAL_DESTRUCTOR(T) __has_trivial_destructor(T) # define BOOST_HAS_NOTHROW_CONSTRUCTOR(T) __has_nothrow_constructor(T) # define BOOST_HAS_NOTHROW_COPY(T) (__has_nothrow_copy(T) && !is_volatile::value && !is_reference::value) # define BOOST_HAS_NOTHROW_ASSIGN(T) (__has_nothrow_assign(T) && !is_volatile::value) # define BOOST_HAS_VIRTUAL_DESTRUCTOR(T) __has_virtual_destructor(T) # define BOOST_IS_ABSTRACT(T) __is_abstract(T) # define BOOST_IS_BASE_OF(T,U) (__is_base_of(T,U) && !is_same::value) # define BOOST_IS_CLASS(T) __is_class(T) # define BOOST_IS_ENUM(T) __is_enum(T) # define BOOST_IS_POLYMORPHIC(T) __is_polymorphic(T) # define BOOST_ALIGNMENT_OF(T) __alignof__(T) # define BOOST_HAS_TYPE_TRAITS_INTRINSICS #endif # if defined(__CODEGEARC__) # include # include # include # include # define BOOST_IS_UNION(T) __is_union(T) # define BOOST_IS_POD(T) __is_pod(T) # define BOOST_IS_EMPTY(T) __is_empty(T) # define BOOST_HAS_TRIVIAL_CONSTRUCTOR(T) (__has_trivial_default_constructor(T)) # define BOOST_HAS_TRIVIAL_COPY(T) (__has_trivial_copy_constructor(T) && !is_volatile::value && !is_reference::value) # define BOOST_HAS_TRIVIAL_ASSIGN(T) (__has_trivial_assign(T) && !is_volatile::value) # define BOOST_HAS_TRIVIAL_DESTRUCTOR(T) (__has_trivial_destructor(T)) # define BOOST_HAS_NOTHROW_CONSTRUCTOR(T) (__has_nothrow_default_constructor(T)) # define BOOST_HAS_NOTHROW_COPY(T) (__has_nothrow_copy_constructor(T) && !is_volatile::value && !is_reference::value) # define BOOST_HAS_NOTHROW_ASSIGN(T) (__has_nothrow_assign(T) && !is_volatile::value) # define BOOST_HAS_VIRTUAL_DESTRUCTOR(T) __has_virtual_destructor(T) # define BOOST_IS_ABSTRACT(T) __is_abstract(T) # define BOOST_IS_BASE_OF(T,U) (__is_base_of(T,U) && !is_void::value && !is_void::value) # define BOOST_IS_CLASS(T) __is_class(T) # define BOOST_IS_CONVERTIBLE(T,U) (__is_convertible(T,U) || is_void::value) # define BOOST_IS_ENUM(T) __is_enum(T) # define BOOST_IS_POLYMORPHIC(T) __is_polymorphic(T) # define BOOST_ALIGNMENT_OF(T) alignof(T) # define BOOST_HAS_TYPE_TRAITS_INTRINSICS #endif #endif // BOOST_TT_INTRINSICS_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/conditional.hpp0000644000000000000000000000007412717644140022411 xustar0030 atime=1463765180.177719552 30 ctime=1463765201.173551863 madp-0.4/src/boost/boost/type_traits/conditional.hpp0000664000372100037210000000115512717644140023242 0ustar00fransfrans00000000000000 // (C) Copyright John Maddock 2010. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_CONDITIONAL_HPP_INCLUDED #define BOOST_TT_CONDITIONAL_HPP_INCLUDED #include namespace boost { template struct conditional : public mpl::if_c { }; } // namespace boost #endif // BOOST_TT_CONDITIONAL_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_less.hpp0000644000000000000000000000007312717644140021706 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/has_less.hpp0000664000372100037210000000343612717644140022544 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_LESS_HPP_INCLUDED #define BOOST_TT_HAS_LESS_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_less #define BOOST_TT_TRAIT_OP < #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* Lhs==pointer and Rhs==fundamental */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_fundamental< Rhs_nocv >::value\ >::value,\ /* Rhs==pointer and Lhs==fundamental */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::is_fundamental< Lhs_nocv >::value\ >::value,\ /* Lhs==pointer and Rhs==pointer and Lhs!=base(Rhs) and Rhs!=base(Lhs) and Lhs!=void* and Rhs!=void* */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::type_traits::ice_not<\ ::boost::type_traits::ice_or<\ ::boost::is_base_of< Lhs_noptr, Rhs_noptr >::value,\ ::boost::is_base_of< Rhs_noptr, Lhs_noptr >::value,\ ::boost::is_same< Lhs_noptr, Rhs_noptr >::value,\ ::boost::is_void< Lhs_noptr >::value,\ ::boost::is_void< Rhs_noptr >::value\ >::value\ >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_same.hpp0000644000000000000000000000007412717644140021526 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/is_same.hpp0000664000372100037210000000623512717644140022363 0ustar00fransfrans00000000000000 // (C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes, // Howard Hinnant and John Maddock 2000. // (C) Copyright Mat Marcus, Jesse Jones and Adobe Systems Inc 2001 // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. // Fixed is_pointer, is_reference, is_const, is_volatile, is_same, // is_member_pointer based on the Simulated Partial Specialization work // of Mat Marcus and Jesse Jones. See http://opensource.adobe.com or // http://groups.yahoo.com/group/boost/message/5441 // Some workarounds in here use ideas suggested from "Generic: // Mappings between Types and Values" // by Andrei Alexandrescu (see http://www.cuj.com/experts/1810/alexandr.html). #ifndef BOOST_TT_IS_SAME_HPP_INCLUDED #define BOOST_TT_IS_SAME_HPP_INCLUDED #include #ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION #include #include #include #endif // should be the last #include #include namespace boost { #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION BOOST_TT_AUX_BOOL_TRAIT_DEF2(is_same,T,U,false) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC2_1(typename T,is_same,T,T,true) #if BOOST_WORKAROUND(__BORLANDC__, < 0x600) // without this, Borland's compiler gives the wrong answer for // references to arrays: BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC2_1(typename T,is_same,T&,T&,true) #endif #else // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION namespace detail { #ifdef BOOST_MSVC // the following VC6 specific implementation is *NOT* legal // C++, but has the advantage that it works for incomplete // types. template< typename T1 > struct is_same_part_1 { template struct part_2 { enum { value = false }; }; template<> struct part_2 { enum { value = true }; }; }; template< typename T1, typename T2 > struct is_same_impl { enum { value = boost::detail::is_same_part_1::template part_2::value }; }; #else // generic "no-partial-specialization" version template ::boost::type_traits::yes_type BOOST_TT_DECL is_same_tester(T*, T*); ::boost::type_traits::no_type BOOST_TT_DECL is_same_tester(...); template struct is_same_impl { static T t; static U u; BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_and< (sizeof(type_traits::yes_type) == sizeof(boost::detail::is_same_tester(&t,&u))), (::boost::is_reference::value == ::boost::is_reference::value), (sizeof(T) == sizeof(U)) >::value)); }; #endif // BOOST_MSVC } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF2(is_same,T,U,(::boost::detail::is_same_impl::value)) #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION } // namespace boost #include #endif // BOOST_TT_IS_SAME_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_right_shift.hpp0000644000000000000000000000007412717644140023253 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_right_shift.hpp0000664000372100037210000000346112717644140024106 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_RIGHT_SHIFT_HPP_INCLUDED #define BOOST_TT_HAS_RIGHT_SHIFT_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_right_shift #define BOOST_TT_TRAIT_OP >> #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* Lhs==fundamental and Rhs==fundamental and (Lhs!=integral or Rhs!=integral) */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::type_traits::ice_or<\ ::boost::type_traits::ice_not< ::boost::is_integral< Lhs_noref >::value >::value,\ ::boost::type_traits::ice_not< ::boost::is_integral< Rhs_noref >::value >::value\ >::value\ >::value,\ /* Lhs==fundamental and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ /* Rhs==fundamental and Lhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_pointer< Lhs_noref >::value\ >::value,\ /* Lhs==pointer and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_virtual_destructor.hpp0000644000000000000000000000007412717644140024705 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_virtual_destructor.hpp0000664000372100037210000000163612717644140025542 0ustar00fransfrans00000000000000 // (C) Copyright John Maddock 2005. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_VIRTUAL_DESTRUCTOR_HPP_INCLUDED #define BOOST_TT_HAS_VIRTUAL_DESTRUCTOR_HPP_INCLUDED #include // should be the last #include #include namespace boost { #ifdef BOOST_HAS_VIRTUAL_DESTRUCTOR BOOST_TT_AUX_BOOL_TRAIT_DEF1(has_virtual_destructor,T,BOOST_HAS_VIRTUAL_DESTRUCTOR(T)) #else BOOST_TT_AUX_BOOL_TRAIT_DEF1(has_virtual_destructor,T,false) #endif } // namespace boost #include #endif // BOOST_TT_IS_MEMBER_FUNCTION_POINTER_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/integral_constant.hpp0000644000000000000000000000007412717644140023624 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/integral_constant.hpp0000664000372100037210000000260312717644140024454 0ustar00fransfrans00000000000000// (C) Copyright John Maddock 2005. // Use, modification and distribution are subject to the // Boost Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_TYPE_TRAITS_INTEGRAL_CONSTANT_HPP #define BOOST_TYPE_TRAITS_INTEGRAL_CONSTANT_HPP #include #include #include namespace boost{ #if defined(BOOST_NO_DEPENDENT_TYPES_IN_TEMPLATE_VALUE_PARAMETERS) || defined(__BORLANDC__) template #else template #endif struct integral_constant : public mpl::integral_c { typedef integral_constant type; }; template<> struct integral_constant : public mpl::true_ { #if BOOST_WORKAROUND(BOOST_MSVC, < 1300) # pragma warning(push) # pragma warning(disable:4097) typedef mpl::true_ base_; using base_::value; # pragma warning(pop) #endif typedef integral_constant type; }; template<> struct integral_constant : public mpl::false_ { #if BOOST_WORKAROUND(BOOST_MSVC, < 1300) # pragma warning(push) # pragma warning(disable:4097) typedef mpl::false_ base_; using base_::value; # pragma warning(pop) #endif typedef integral_constant type; }; typedef integral_constant true_type; typedef integral_constant false_type; } #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_member_object_pointer.hpp0000644000000000000000000000007412717644140025136 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/is_member_object_pointer.hpp0000664000372100037210000000261212717644140025766 0ustar00fransfrans00000000000000 // (C) Copyright John Maddock 2005. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_MEMBER_OBJECT_POINTER_HPP_INCLUDED #define BOOST_TT_IS_MEMBER_OBJECT_POINTER_HPP_INCLUDED #include #include #include #include #include // should be the last #include #include namespace boost { namespace detail{ template struct is_member_object_pointer_impl { BOOST_STATIC_CONSTANT( bool, value = (::boost::type_traits::ice_and< ::boost::is_member_pointer::value, ::boost::type_traits::ice_not< ::boost::is_member_function_pointer::value >::value >::value )); }; } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_member_object_pointer,T,::boost::detail::is_member_object_pointer_impl::value) } // namespace boost #include #endif // BOOST_TT_IS_MEMBER_FUNCTION_POINTER_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_plus.hpp0000644000000000000000000000007412717644140021724 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_plus.hpp0000664000372100037210000000377412717644140022566 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_PLUS_HPP_INCLUDED #define BOOST_TT_HAS_PLUS_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_plus #define BOOST_TT_TRAIT_OP + #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* Lhs==pointer and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ /* Lhs==void* and Rhs==fundamental */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_void< Lhs_noptr >::value,\ ::boost::is_fundamental< Rhs_nocv >::value\ >::value,\ /* Rhs==void* and Lhs==fundamental */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::is_void< Rhs_noptr >::value,\ ::boost::is_fundamental< Lhs_nocv >::value\ >::value,\ /* Lhs==pointer and Rhs==fundamental and Rhs!=integral */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::type_traits::ice_not< ::boost::is_integral< Rhs_noref >::value >::value\ >::value,\ /* Rhs==pointer and Lhs==fundamental and Lhs!=integral */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::type_traits::ice_not< ::boost::is_integral< Lhs_noref >::value >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_copy_constructible.hpp0000644000000000000000000000007412717644140024513 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/is_copy_constructible.hpp0000664000372100037210000000764712717644140025360 0ustar00fransfrans00000000000000// (C) Copyright Antony Polukhin 2013. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_COPY_CONSTRUCTIBLE_HPP_INCLUDED #define BOOST_TT_IS_COPY_CONSTRUCTIBLE_HPP_INCLUDED #include #include #include #include #include #include #include // should be the last #include #include namespace boost { namespace detail{ template struct is_copy_constructible_impl2 { // Intel compiler has problems with SFINAE for copy constructors and deleted functions: // // error: function *function_name* cannot be referenced -- it is a deleted function // static boost::type_traits::yes_type test(T1&, decltype(T1(boost::declval()))* = 0); // ^ #if !defined(BOOST_NO_CXX11_DELETED_FUNCTIONS) && !defined(BOOST_INTEL_CXX_VERSION) #ifdef BOOST_NO_CXX11_DECLTYPE template static boost::type_traits::yes_type test(T1&, boost::mpl::int_()))>* = 0); #else template static boost::type_traits::yes_type test(T1&, decltype(T1(boost::declval()))* = 0); #endif static boost::type_traits::no_type test(...); #else template static boost::type_traits::no_type test(T1&, typename T1::boost_move_no_copy_constructor_or_assign* = 0); static boost::type_traits::yes_type test(...); #endif // If you see errors like this: // // `'T::T(const T&)' is private` // `boost/type_traits/is_copy_constructible.hpp:68:5: error: within this context` // // then you are trying to call that macro for a structure defined like that: // // struct T { // ... // private: // T(const T &); // ... // }; // // To fix that you must modify your structure: // // // C++03 and C++11 version // struct T: private boost::noncopyable { // ... // private: // T(const T &); // ... // }; // // // C++11 version // struct T { // ... // private: // T(const T &) = delete; // ... // }; BOOST_STATIC_CONSTANT(bool, value = ( sizeof(test( boost::declval::type>() )) == sizeof(boost::type_traits::yes_type) || boost::is_rvalue_reference::value )); }; template struct is_copy_constructible_impl2 { BOOST_STATIC_CONSTANT(bool, value = false); }; template struct is_copy_constructible_impl { BOOST_STATIC_CONSTANT(bool, value = ( boost::detail::is_copy_constructible_impl2< boost::is_base_and_derived::value, T >::value )); }; } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_copy_constructible,T,::boost::detail::is_copy_constructible_impl::value) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(is_copy_constructible,void,false) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_SPEC1(is_copy_constructible,void const,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(is_copy_constructible,void const volatile,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(is_copy_constructible,void volatile,false) #endif } // namespace boost #include #endif // BOOST_TT_IS_COPY_CONSTRUCTIBLE_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_multiplies_assign.hpp0000644000000000000000000000007412717644140024474 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_multiplies_assign.hpp0000664000372100037210000000325212717644140025325 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_MULTIPLIES_ASSIGN_HPP_INCLUDED #define BOOST_TT_HAS_MULTIPLIES_ASSIGN_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_multiplies_assign #define BOOST_TT_TRAIT_OP *= #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* Lhs==fundamental and Lhs==const and Rhs==fundamental */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_const< Lhs_noref >::value,\ ::boost::is_fundamental< Rhs_nocv >::value\ >::value,\ /* Lhs==pointer and (Rhs==fundamental or Rhs==pointer) */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::type_traits::ice_or<\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value\ >::value,\ /* Rhs==pointer and (Lhs==fundamental or Lhs==pointer) */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::type_traits::ice_or<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_pointer< Lhs_noref >::value\ >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_float.hpp0000644000000000000000000000007412717644140021706 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/is_float.hpp0000664000372100037210000000174512717644140022544 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TYPE_TRAITS_IS_FLOAT_HPP_INCLUDED #define BOOST_TYPE_TRAITS_IS_FLOAT_HPP_INCLUDED // should be the last #include #include namespace boost { //* is a type T a floating-point type described in the standard (3.9.1p8) BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_float,T,false) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_float,float,true) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_float,double,true) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_float,long double,true) } // namespace boost #include #endif // BOOST_TYPE_TRAITS_IS_FLOAT_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_member_function_pointer.hpp0000644000000000000000000000007412717644140025515 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/is_member_function_pointer.hpp0000664000372100037210000001002112717644140026336 0ustar00fransfrans00000000000000 // (C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes, Howard // Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_MEMBER_FUNCTION_POINTER_HPP_INCLUDED #define BOOST_TT_IS_MEMBER_FUNCTION_POINTER_HPP_INCLUDED #include #include #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \ && !BOOST_WORKAROUND(__BORLANDC__, < 0x600) && !defined(BOOST_TT_TEST_MS_FUNC_SIGS) // // Note: we use the "workaround" version for MSVC because it works for // __stdcall etc function types, where as the partial specialisation // version does not do so. // # include # include #else # include # include # include # include # include # include #endif // should be the last #include #include namespace boost { #if defined( __CODEGEARC__ ) BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_member_function_pointer,T,__is_member_function_pointer( T )) #elif !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) && !BOOST_WORKAROUND(__BORLANDC__, < 0x600) && !defined(BOOST_TT_TEST_MS_FUNC_SIGS) BOOST_TT_AUX_BOOL_TRAIT_DEF1( is_member_function_pointer , T , ::boost::type_traits::is_mem_fun_pointer_impl::type>::value ) #else namespace detail { #ifndef __BORLANDC__ template struct is_mem_fun_pointer_select : public ::boost::type_traits::false_result { }; template <> struct is_mem_fun_pointer_select { template struct result_ { #if BOOST_WORKAROUND(BOOST_MSVC_FULL_VER, >= 140050000) #pragma warning(push) #pragma warning(disable:6334) #endif static T* make_t; typedef result_ self_type; BOOST_STATIC_CONSTANT( bool, value = ( 1 == sizeof(::boost::type_traits::is_mem_fun_pointer_tester(self_type::make_t)) )); #if BOOST_WORKAROUND(BOOST_MSVC_FULL_VER, >= 140050000) #pragma warning(pop) #endif }; }; template struct is_member_function_pointer_impl : public is_mem_fun_pointer_select< ::boost::type_traits::ice_or< ::boost::is_reference::value , ::boost::is_array::value >::value >::template result_ { }; #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION template struct is_member_function_pointer_impl : public false_type{}; #endif #else // Borland C++ template struct is_member_function_pointer_impl { static T* m_t; BOOST_STATIC_CONSTANT( bool, value = (1 == sizeof(type_traits::is_mem_fun_pointer_tester(m_t))) ); }; template struct is_member_function_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = false); }; #endif BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_member_function_pointer,void,false) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_member_function_pointer,void const,false) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_member_function_pointer,void volatile,false) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_member_function_pointer,void const volatile,false) #endif } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_member_function_pointer,T,::boost::detail::is_member_function_pointer_impl::value) #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION } // namespace boost #include #endif // BOOST_TT_IS_MEMBER_FUNCTION_POINTER_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/add_rvalue_reference.hpp0000644000000000000000000000007412717644140024232 xustar0030 atime=1463765180.177719552 30 ctime=1463765201.173551863 madp-0.4/src/boost/boost/type_traits/add_rvalue_reference.hpp0000664000372100037210000000457512717644140025074 0ustar00fransfrans00000000000000// add_rvalue_reference.hpp ---------------------------------------------------------// // Copyright 2010 Vicente J. Botet Escriba // Distributed under the Boost Software License, Version 1.0. // See http://www.boost.org/LICENSE_1_0.txt #ifndef BOOST_TYPE_TRAITS_EXT_ADD_RVALUE_REFERENCE__HPP #define BOOST_TYPE_TRAITS_EXT_ADD_RVALUE_REFERENCE__HPP #include //----------------------------------------------------------------------------// #include #include // should be the last #include #include //----------------------------------------------------------------------------// // // // C++03 implementation of // // 20.9.7.2 Reference modifications [meta.trans.ref] // // Written by Vicente J. Botet Escriba // // // // If T names an object or function type then the member typedef type // shall name T&&; otherwise, type shall name T. [ Note: This rule reflects // the semantics of reference collapsing. For example, when a type T names // a type T1&, the type add_rvalue_reference::type is not an rvalue // reference. -end note ] //----------------------------------------------------------------------------// namespace boost { namespace type_traits_detail { template struct add_rvalue_reference_helper { typedef T type; }; #if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES) && !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template struct add_rvalue_reference_helper { typedef T&& type; }; #endif template struct add_rvalue_reference_imp { typedef typename boost::type_traits_detail::add_rvalue_reference_helper ::value == false && is_reference::value == false) >::type type; }; } BOOST_TT_AUX_TYPE_TRAIT_DEF1(add_rvalue_reference,T,typename boost::type_traits_detail::add_rvalue_reference_imp::type) } // namespace boost #include #endif // BOOST_TYPE_TRAITS_EXT_ADD_RVALUE_REFERENCE__HPP madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_bit_and_assign.hpp0000644000000000000000000000007312717644140023704 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/has_bit_and_assign.hpp0000664000372100037210000000411712717644140024537 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_BIT_AND_ASSIGN_HPP_INCLUDED #define BOOST_TT_HAS_BIT_AND_ASSIGN_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_bit_and_assign #define BOOST_TT_TRAIT_OP &= #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* Lhs==fundamental and Rhs==fundamental and (Lhs!=integral or Rhs!=integral) */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::type_traits::ice_or<\ ::boost::type_traits::ice_not< ::boost::is_integral< Lhs_noref >::value >::value,\ ::boost::type_traits::ice_not< ::boost::is_integral< Rhs_noref >::value >::value\ >::value\ >::value,\ /* Lhs==fundamental and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ /* Rhs==fundamental and Lhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_pointer< Lhs_noref >::value\ >::value,\ /* Lhs==pointer and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ /* Lhs==fundamental and Rhs==fundamental and Lhs==const */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_const< Lhs_noref >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/config.hpp0000644000000000000000000000007412717644140021353 xustar0030 atime=1463765180.177719552 30 ctime=1463765201.173551863 madp-0.4/src/boost/boost/type_traits/config.hpp0000664000372100037210000000501312717644140022201 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_CONFIG_HPP_INCLUDED #define BOOST_TT_CONFIG_HPP_INCLUDED #ifndef BOOST_CONFIG_HPP #include #endif #include // // whenever we have a conversion function with ellipses // it needs to be declared __cdecl to suppress compiler // warnings from MS and Borland compilers (this *must* // appear before we include is_same.hpp below): #if defined(BOOST_MSVC) || (defined(__BORLANDC__) && !defined(BOOST_DISABLE_WIN32)) # define BOOST_TT_DECL __cdecl #else # define BOOST_TT_DECL /**/ #endif # if (BOOST_WORKAROUND(__MWERKS__, < 0x3000) \ || BOOST_WORKAROUND(BOOST_MSVC, <= 1301) \ || !defined(__EDG_VERSION__) && BOOST_WORKAROUND(__GNUC__, < 3) \ || BOOST_WORKAROUND(__IBMCPP__, < 600 ) \ || BOOST_WORKAROUND(__BORLANDC__, < 0x5A0) \ || defined(__ghs) \ || BOOST_WORKAROUND(__HP_aCC, < 60700) \ || BOOST_WORKAROUND(MPW_CPLUS, BOOST_TESTED_AT(0x890)) \ || BOOST_WORKAROUND(__SUNPRO_CC, BOOST_TESTED_AT(0x580))) \ && defined(BOOST_NO_IS_ABSTRACT) # define BOOST_TT_NO_CONFORMING_IS_CLASS_IMPLEMENTATION 1 #endif #ifndef BOOST_TT_NO_CONFORMING_IS_CLASS_IMPLEMENTATION # define BOOST_TT_HAS_CONFORMING_IS_CLASS_IMPLEMENTATION 1 #endif // // Define BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING // when we can't test for function types with elipsis: // #if BOOST_WORKAROUND(__GNUC__, < 3) # define BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING #endif // // define BOOST_TT_TEST_MS_FUNC_SIGS // when we want to test __stdcall etc function types with is_function etc // (Note, does not work with Borland, even though it does support __stdcall etc): // #if defined(_MSC_EXTENSIONS) && !defined(__BORLANDC__) # define BOOST_TT_TEST_MS_FUNC_SIGS #endif // // define BOOST_TT_NO_CV_FUNC_TEST // if tests for cv-qualified member functions don't // work in is_member_function_pointer // #if BOOST_WORKAROUND(__MWERKS__, < 0x3000) || BOOST_WORKAROUND(__IBMCPP__, <= 600) # define BOOST_TT_NO_CV_FUNC_TEST #endif #endif // BOOST_TT_CONFIG_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_dereference.hpp0000644000000000000000000000007312717644140023207 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/has_dereference.hpp0000664000372100037210000000170512717644140024042 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_DEREFERENCE_HPP_INCLUDED #define BOOST_TT_HAS_DEREFERENCE_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_dereference #define BOOST_TT_TRAIT_OP * #define BOOST_TT_FORBIDDEN_IF\ /* void* or fundamental */\ ::boost::type_traits::ice_or<\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::is_void< Rhs_noptr >::value\ >::value,\ ::boost::is_fundamental< Rhs_nocv >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_trivial_move_assign.hpp0000644000000000000000000000007412717644140025005 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_trivial_move_assign.hpp0000664000372100037210000000403112717644140025632 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // (C) Copyright Eric Friedman 2002-2003. // (C) Copyright Antony Polukhin 2013. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_TRIVIAL_MOVE_ASSIGN_HPP_INCLUDED #define BOOST_TT_HAS_TRIVIAL_MOVE_ASSIGN_HPP_INCLUDED #include #include #include #include #include #include // should be the last #include #include namespace boost { namespace detail { template struct has_trivial_move_assign_impl { #ifdef BOOST_HAS_TRIVIAL_MOVE_ASSIGN BOOST_STATIC_CONSTANT(bool, value = (BOOST_HAS_TRIVIAL_MOVE_ASSIGN(T))); #else BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_and< ::boost::is_pod::value, ::boost::type_traits::ice_not< ::boost::is_const::value >::value, ::boost::type_traits::ice_not< ::boost::is_volatile::value >::value >::value)); #endif }; } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF1(has_trivial_move_assign,T,::boost::detail::has_trivial_move_assign_impl::value) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_trivial_move_assign,void,false) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_trivial_move_assign,void const,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_trivial_move_assign,void const volatile,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_trivial_move_assign,void volatile,false) #endif } // namespace boost #include #endif // BOOST_TT_HAS_TRIVIAL_MOVE_ASSIGN_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_new_operator.hpp0000644000000000000000000000007412717644140023445 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_new_operator.hpp0000664000372100037210000001157312717644140024303 0ustar00fransfrans00000000000000 // (C) Copyright Runar Undheim, Robert Ramey & John Maddock 2008. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_NEW_OPERATOR_HPP_INCLUDED #define BOOST_TT_HAS_NEW_OPERATOR_HPP_INCLUDED #include // std::nothrow_t #include // std::size_t #include #include #include // should be the last #include #include namespace boost { namespace detail { template struct test; template struct has_new_operator_impl { template static type_traits::yes_type check_sig1( U*, test< void *(*)(std::size_t), &U::operator new >* = NULL ); template static type_traits::no_type check_sig1(...); template static type_traits::yes_type check_sig2( U*, test< void *(*)(std::size_t, const std::nothrow_t&), &U::operator new >* = NULL ); template static type_traits::no_type check_sig2(...); template static type_traits::yes_type check_sig3( U*, test< void *(*)(std::size_t, void*), &U::operator new >* = NULL ); template static type_traits::no_type check_sig3(...); template static type_traits::yes_type check_sig4( U*, test< void *(*)(std::size_t), &U::operator new[] >* = NULL ); template static type_traits::no_type check_sig4(...); template static type_traits::yes_type check_sig5( U*, test< void *(*)(std::size_t, const std::nothrow_t&), &U::operator new[] >* = NULL ); template static type_traits::no_type check_sig5(...); template static type_traits::yes_type check_sig6( U*, test< void *(*)(std::size_t, void*), &U::operator new[] >* = NULL ); template static type_traits::no_type check_sig6(...); // GCC2 won't even parse this template if we embed the computation // of s1 in the computation of value. #ifdef __GNUC__ BOOST_STATIC_CONSTANT(unsigned, s1 = sizeof(has_new_operator_impl::template check_sig1(0))); BOOST_STATIC_CONSTANT(unsigned, s2 = sizeof(has_new_operator_impl::template check_sig2(0))); BOOST_STATIC_CONSTANT(unsigned, s3 = sizeof(has_new_operator_impl::template check_sig3(0))); BOOST_STATIC_CONSTANT(unsigned, s4 = sizeof(has_new_operator_impl::template check_sig4(0))); BOOST_STATIC_CONSTANT(unsigned, s5 = sizeof(has_new_operator_impl::template check_sig5(0))); BOOST_STATIC_CONSTANT(unsigned, s6 = sizeof(has_new_operator_impl::template check_sig6(0))); #else #if BOOST_WORKAROUND(BOOST_MSVC_FULL_VER, >= 140050000) #pragma warning(push) #pragma warning(disable:6334) #endif BOOST_STATIC_CONSTANT(unsigned, s1 = sizeof(check_sig1(0))); BOOST_STATIC_CONSTANT(unsigned, s2 = sizeof(check_sig2(0))); BOOST_STATIC_CONSTANT(unsigned, s3 = sizeof(check_sig3(0))); BOOST_STATIC_CONSTANT(unsigned, s4 = sizeof(check_sig4(0))); BOOST_STATIC_CONSTANT(unsigned, s5 = sizeof(check_sig5(0))); BOOST_STATIC_CONSTANT(unsigned, s6 = sizeof(check_sig6(0))); #if BOOST_WORKAROUND(BOOST_MSVC_FULL_VER, >= 140050000) #pragma warning(pop) #endif #endif BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_or< (s1 == sizeof(type_traits::yes_type)), (s2 == sizeof(type_traits::yes_type)), (s3 == sizeof(type_traits::yes_type)), (s4 == sizeof(type_traits::yes_type)), (s5 == sizeof(type_traits::yes_type)), (s6 == sizeof(type_traits::yes_type)) >::value) ); }; } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF1(has_new_operator,T,::boost::detail::has_new_operator_impl::value) } // namespace boost #include #endif // BOOST_TT_HAS_NEW_OPERATOR_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_right_shift_assign.hpp0000644000000000000000000000007412717644140024617 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_right_shift_assign.hpp0000664000372100037210000000413412717644140025450 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_RIGHT_SHIFT_ASSIGN_HPP_INCLUDED #define BOOST_TT_HAS_RIGHT_SHIFT_ASSIGN_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_right_shift_assign #define BOOST_TT_TRAIT_OP >>= #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* Lhs==fundamental and Rhs==fundamental and (Lhs!=integral or Rhs!=integral) */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::type_traits::ice_or<\ ::boost::type_traits::ice_not< ::boost::is_integral< Lhs_noref >::value >::value,\ ::boost::type_traits::ice_not< ::boost::is_integral< Rhs_noref >::value >::value\ >::value\ >::value,\ /* Lhs==fundamental and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ /* Rhs==fundamental and Lhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_pointer< Lhs_noref >::value\ >::value,\ /* Lhs==pointer and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ /* Lhs==fundamental and Rhs==fundamental and Lhs==const */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_const< Lhs_noref >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_logical_not.hpp0000644000000000000000000000007312717644140023232 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/has_logical_not.hpp0000664000372100037210000000126512717644140024066 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_LOGICAL_NOT_HPP_INCLUDED #define BOOST_TT_HAS_LOGICAL_NOT_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_logical_not #define BOOST_TT_TRAIT_OP ! #define BOOST_TT_FORBIDDEN_IF\ false #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/aligned_storage.hpp0000644000000000000000000000007412717644140023235 xustar0030 atime=1463765180.177719552 30 ctime=1463765201.173551863 madp-0.4/src/boost/boost/type_traits/aligned_storage.hpp0000664000372100037210000000077712717644140024077 0ustar00fransfrans00000000000000 // Copyright (C) John Maddock 2005. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_ALIGNED_STORAGE_HPP_INCLUDED # define BOOST_TT_ALIGNED_STORAGE_HPP_INCLUDED # include #endif // BOOST_TT_ALIGNED_STORAGE_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_nothrow_copy.hpp0000644000000000000000000000007412717644140023473 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_nothrow_copy.hpp0000664000372100037210000000355412717644140024331 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_NOTHROW_COPY_HPP_INCLUDED #define BOOST_TT_HAS_NOTHROW_COPY_HPP_INCLUDED #include // should be the last #include #include namespace boost { namespace detail{ template struct has_nothrow_copy_imp{ #ifdef BOOST_HAS_NOTHROW_COPY BOOST_STATIC_CONSTANT(bool, value = BOOST_HAS_NOTHROW_COPY(T)); #else BOOST_STATIC_CONSTANT(bool, value = ::boost::has_trivial_copy::value); #endif }; } BOOST_TT_AUX_BOOL_TRAIT_DEF1(has_nothrow_copy,T,::boost::detail::has_nothrow_copy_imp::value) BOOST_TT_AUX_BOOL_TRAIT_DEF1(has_nothrow_copy_constructor,T,::boost::detail::has_nothrow_copy_imp::value) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_nothrow_copy,void,false) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_nothrow_copy,void const,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_nothrow_copy,void const volatile,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_nothrow_copy,void volatile,false) #endif BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_nothrow_copy_constructor,void,false) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_nothrow_copy_constructor,void const,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_nothrow_copy_constructor,void const volatile,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_nothrow_copy_constructor,void volatile,false) #endif } // namespace boost #include #endif // BOOST_TT_HAS_NOTHROW_COPY_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/composite_traits.hpp0000644000000000000000000000007412717644140023476 xustar0030 atime=1463765180.177719552 30 ctime=1463765201.173551863 madp-0.4/src/boost/boost/type_traits/composite_traits.hpp0000664000372100037210000000175112717644140024331 0ustar00fransfrans00000000000000// (C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes, Howard // Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. // // defines traits classes for composite types: // is_array, is_pointer, is_reference, is_member_pointer, is_enum, is_union. // #ifndef BOOST_TT_COMPOSITE_TRAITS_HPP_INCLUDED #define BOOST_TT_COMPOSITE_TRAITS_HPP_INCLUDED #include #include #include #include #include #include #include #endif // BOOST_TT_COMPOSITE_TRAITS_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_nothrow_assign.hpp0000644000000000000000000000007412717644140024005 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_nothrow_assign.hpp0000664000372100037210000000266012717644140024640 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_NOTHROW_ASSIGN_HPP_INCLUDED #define BOOST_TT_HAS_NOTHROW_ASSIGN_HPP_INCLUDED #include // should be the last #include #include namespace boost { namespace detail{ template struct has_nothrow_assign_imp{ #ifndef BOOST_HAS_NOTHROW_ASSIGN BOOST_STATIC_CONSTANT(bool, value = ::boost::has_trivial_assign::value); #else BOOST_STATIC_CONSTANT(bool, value = BOOST_HAS_NOTHROW_ASSIGN(T)); #endif }; } BOOST_TT_AUX_BOOL_TRAIT_DEF1(has_nothrow_assign,T,::boost::detail::has_nothrow_assign_imp::value) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_nothrow_assign,void,false) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_nothrow_assign,void const,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_nothrow_assign,void const volatile,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_nothrow_assign,void volatile,false) #endif } // namespace boost #include #endif // BOOST_TT_HAS_NOTHROW_ASSIGN_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_left_shift.hpp0000644000000000000000000000007312717644140023067 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/has_left_shift.hpp0000664000372100037210000000345612717644140023727 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_LEFT_SHIFT_HPP_INCLUDED #define BOOST_TT_HAS_LEFT_SHIFT_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_left_shift #define BOOST_TT_TRAIT_OP << #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* Lhs==fundamental and Rhs==fundamental and (Lhs!=integral or Rhs!=integral) */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::type_traits::ice_or<\ ::boost::type_traits::ice_not< ::boost::is_integral< Lhs_noref >::value >::value,\ ::boost::type_traits::ice_not< ::boost::is_integral< Rhs_noref >::value >::value\ >::value\ >::value,\ /* Lhs==fundamental and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ /* Rhs==fundamental and Lhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_pointer< Lhs_noref >::value\ >::value,\ /* Lhs==pointer and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_arithmetic.hpp0000644000000000000000000000007412717644140022732 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/is_arithmetic.hpp0000664000372100037210000000271312717644140023564 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_ARITHMETIC_HPP_INCLUDED #define BOOST_TT_IS_ARITHMETIC_HPP_INCLUDED #if !defined( __CODEGEARC__ ) #include #include #include #include #endif // should be the last #include #include namespace boost { #if !defined(__CODEGEARC__) namespace detail { template< typename T > struct is_arithmetic_impl { BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_or< ::boost::is_integral::value, ::boost::is_float::value >::value)); }; } // namespace detail #endif //* is a type T an arithmetic type described in the standard (3.9.1p8) #if defined(__CODEGEARC__) BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_arithmetic,T,__is_arithmetic(T)) #else BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_arithmetic,T,::boost::detail::is_arithmetic_impl::value) #endif } // namespace boost #include #endif // BOOST_TT_IS_ARITHMETIC_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_function.hpp0000644000000000000000000000007412717644140022426 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/is_function.hpp0000664000372100037210000000601612717644140023260 0ustar00fransfrans00000000000000 // Copyright 2000 John Maddock (john@johnmaddock.co.uk) // Copyright 2002 Aleksey Gurtovoy (agurtovoy@meta-comm.com) // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_FUNCTION_HPP_INCLUDED #define BOOST_TT_IS_FUNCTION_HPP_INCLUDED #include #include #include #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) && !defined(BOOST_TT_TEST_MS_FUNC_SIGS) # include #else # include # include #endif // should be the last #include #include // is a type a function? // Please note that this implementation is unnecessarily complex: // we could just use !is_convertible::value, // except that some compilers erroneously allow conversions from // function pointers to void*. namespace boost { #if !defined( __CODEGEARC__ ) namespace detail { #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) && !defined(BOOST_TT_TEST_MS_FUNC_SIGS) template struct is_function_chooser : public ::boost::type_traits::false_result { }; template <> struct is_function_chooser { template< typename T > struct result_ : public ::boost::type_traits::is_function_ptr_helper { }; }; template struct is_function_impl : public is_function_chooser< ::boost::is_reference::value > ::BOOST_NESTED_TEMPLATE result_ { }; #else template struct is_function_impl { #if BOOST_WORKAROUND(BOOST_MSVC_FULL_VER, >= 140050000) #pragma warning(push) #pragma warning(disable:6334) #endif static T* t; BOOST_STATIC_CONSTANT( bool, value = sizeof(::boost::type_traits::is_function_ptr_tester(t)) == sizeof(::boost::type_traits::yes_type) ); #if BOOST_WORKAROUND(BOOST_MSVC_FULL_VER, >= 140050000) #pragma warning(pop) #endif }; #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template struct is_function_impl : public false_type {}; #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES template struct is_function_impl : public false_type {}; #endif #endif #endif } // namespace detail #endif // !defined( __CODEGEARC__ ) #if defined( __CODEGEARC__ ) BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_function,T,__is_function(T)) #else BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_function,T,::boost::detail::is_function_impl::value) #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_function,T&&,false) #endif #endif } // namespace boost #include #endif // BOOST_TT_IS_FUNCTION_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/add_pointer.hpp0000644000000000000000000000007412717644140022376 xustar0030 atime=1463765180.177719552 30 ctime=1463765201.173551863 madp-0.4/src/boost/boost/type_traits/add_pointer.hpp0000664000372100037210000000322312717644140023225 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_ADD_POINTER_HPP_INCLUDED #define BOOST_TT_ADD_POINTER_HPP_INCLUDED #include // should be the last #include #include namespace boost { namespace detail { #if defined(__BORLANDC__) && (__BORLANDC__ < 0x5A0) // // For some reason this implementation stops Borlands compiler // from dropping cv-qualifiers, it still fails with references // to arrays for some reason though (shrug...) (JM 20021104) // template struct add_pointer_impl { typedef T* type; }; template struct add_pointer_impl { typedef T* type; }; template struct add_pointer_impl { typedef T* type; }; template struct add_pointer_impl { typedef T* type; }; template struct add_pointer_impl { typedef T* type; }; #else template struct add_pointer_impl { typedef typename remove_reference::type no_ref_type; typedef no_ref_type* type; }; #endif } // namespace detail BOOST_TT_AUX_TYPE_TRAIT_DEF1(add_pointer,T,typename boost::detail::add_pointer_impl::type) } // namespace boost #include #endif // BOOST_TT_ADD_POINTER_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/remove_reference.hpp0000644000000000000000000000007412717644140023421 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/remove_reference.hpp0000664000372100037210000000424512717644140024255 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_REMOVE_REFERENCE_HPP_INCLUDED #define BOOST_TT_REMOVE_REFERENCE_HPP_INCLUDED #include #include #include #if BOOST_WORKAROUND(BOOST_MSVC,<=1300) #include #endif // should be the last #include #include namespace boost { #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION namespace detail{ // // We can't filter out rvalue_references at the same level as // references or we get ambiguities from msvc: // template struct remove_rvalue_ref { typedef T type; }; #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES template struct remove_rvalue_ref { typedef T type; }; #endif } // namespace detail BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_reference,T,typename boost::detail::remove_rvalue_ref::type) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,remove_reference,T&,T) #if defined(BOOST_ILLEGAL_CV_REFERENCES) // these are illegal specialisations; cv-qualifies applied to // references have no effect according to [8.3.2p1], // C++ Builder requires them though as it treats cv-qualified // references as distinct types... BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,remove_reference,T& const,T) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,remove_reference,T& volatile,T) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,remove_reference,T& const volatile,T) #endif #elif !BOOST_WORKAROUND(BOOST_MSVC,<=1300) BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_reference,T,typename boost::detail::remove_reference_impl::type) #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION } // namespace boost #include #endif // BOOST_TT_REMOVE_REFERENCE_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_trivial_assign.hpp0000644000000000000000000000007412717644140023757 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_trivial_assign.hpp0000664000372100037210000000370512717644140024613 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_TRIVIAL_ASSIGN_HPP_INCLUDED #define BOOST_TT_HAS_TRIVIAL_ASSIGN_HPP_INCLUDED #include #include #include #include #include #include #include #include // should be the last #include #include namespace boost { namespace detail { template struct has_trivial_assign_impl { #ifdef BOOST_HAS_TRIVIAL_ASSIGN BOOST_STATIC_CONSTANT(bool, value = BOOST_HAS_TRIVIAL_ASSIGN(T)); #else BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_and< ::boost::is_pod::value, ::boost::type_traits::ice_not< ::boost::is_const::value >::value, ::boost::type_traits::ice_not< ::boost::is_volatile::value >::value >::value)); #endif }; } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF1(has_trivial_assign,T,::boost::detail::has_trivial_assign_impl::value) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_trivial_assign,void,false) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_trivial_assign,void const,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_trivial_assign,void const volatile,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_trivial_assign,void volatile,false) #endif } // namespace boost #include #endif // BOOST_TT_HAS_TRIVIAL_ASSIGN_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_unsigned.hpp0000644000000000000000000000007412717644140022415 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/is_unsigned.hpp0000664000372100037210000001152012717644140023243 0ustar00fransfrans00000000000000 // (C) Copyright John Maddock 2005. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_UNSIGNED_HPP_INCLUDED #define BOOST_TT_IS_UNSIGNED_HPP_INCLUDED #include #include #include #include // should be the last #include #include namespace boost { #if !defined( __CODEGEARC__ ) namespace detail{ #if !(defined(__EDG_VERSION__) && __EDG_VERSION__ <= 238) && !defined(BOOST_NO_INCLASS_MEMBER_INITIALIZATION) template struct is_unsigned_values { // // Note that we cannot use BOOST_STATIC_CONSTANT here, using enum's // rather than "real" static constants simply doesn't work or give // the correct answer. // typedef typename remove_cv::type no_cv_t; static const no_cv_t minus_one = (static_cast(-1)); static const no_cv_t zero = (static_cast(0)); }; template struct is_ununsigned_helper { BOOST_STATIC_CONSTANT(bool, value = (::boost::detail::is_unsigned_values::minus_one > ::boost::detail::is_unsigned_values::zero)); }; template struct is_ununsigned_select_helper { template struct rebind { typedef is_ununsigned_helper type; }; }; template <> struct is_ununsigned_select_helper { template struct rebind { typedef false_type type; }; }; template struct is_unsigned_imp { typedef is_ununsigned_select_helper< ::boost::type_traits::ice_or< ::boost::is_integral::value, ::boost::is_enum::value>::value > selector; typedef typename selector::template rebind binder; typedef typename binder::type type; BOOST_STATIC_CONSTANT(bool, value = type::value); }; #else template struct is_unsigned_imp : public false_type{}; template <> struct is_unsigned_imp : public true_type{}; template <> struct is_unsigned_imp : public true_type{}; template <> struct is_unsigned_imp : public true_type{}; template <> struct is_unsigned_imp : public true_type{}; template <> struct is_unsigned_imp : public true_type{}; template <> struct is_unsigned_imp : public true_type{}; template <> struct is_unsigned_imp : public true_type{}; template <> struct is_unsigned_imp : public true_type{}; template <> struct is_unsigned_imp : public true_type{}; template <> struct is_unsigned_imp : public true_type{}; template <> struct is_unsigned_imp : public true_type{}; template <> struct is_unsigned_imp : public true_type{}; template <> struct is_unsigned_imp : public true_type{}; template <> struct is_unsigned_imp : public true_type{}; template <> struct is_unsigned_imp : public true_type{}; template <> struct is_unsigned_imp : public true_type{}; #ifdef BOOST_HAS_LONG_LONG template <> struct is_unsigned_imp : public true_type{}; template <> struct is_unsigned_imp : public true_type{}; template <> struct is_unsigned_imp : public true_type{}; template <> struct is_unsigned_imp : public true_type{}; #endif #if defined(CHAR_MIN) && (CHAR_MIN == 0) template <> struct is_unsigned_imp : public true_type{}; template <> struct is_unsigned_imp : public true_type{}; template <> struct is_unsigned_imp : public true_type{}; template <> struct is_unsigned_imp : public true_type{}; #endif #if defined(WCHAR_MIN) && (WCHAR_MIN == 0) && !defined(BOOST_NO_INTRINSIC_WCHAR_T) template <> struct is_unsigned_imp : public true_type{}; template <> struct is_unsigned_imp : public true_type{}; template <> struct is_unsigned_imp : public true_type{}; template <> struct is_unsigned_imp : public true_type{}; #endif #endif } #endif // !defined( __CODEGEARC__ ) #if defined( __CODEGEARC__ ) BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_unsigned,T,__is_unsigned(T)) #else BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_unsigned,T,::boost::detail::is_unsigned_imp::value) #endif } // namespace boost #include #endif // BOOST_TT_IS_MEMBER_FUNCTION_POINTER_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/remove_all_extents.hpp0000644000000000000000000000007412717644140024005 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/remove_all_extents.hpp0000664000372100037210000000447612717644140024647 0ustar00fransfrans00000000000000 // (C) Copyright John Maddock 2005. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_REMOVE_ALL_EXTENTS_HPP_INCLUDED #define BOOST_TT_REMOVE_ALL_EXTENTS_HPP_INCLUDED #include #include #include #if BOOST_WORKAROUND(BOOST_MSVC,<=1300) #include #endif // should be the last #include #include #if !BOOST_WORKAROUND(BOOST_MSVC,<=1300) namespace boost { BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_all_extents,T,T) #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) && !defined(BOOST_NO_ARRAY_TYPE_SPECIALIZATIONS) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_2(typename T,std::size_t N,remove_all_extents,T[N],typename boost::remove_all_extents::type type) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_2(typename T,std::size_t N,remove_all_extents,T const[N],typename boost::remove_all_extents::type type) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_2(typename T,std::size_t N,remove_all_extents,T volatile[N],typename boost::remove_all_extents::type type) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_2(typename T,std::size_t N,remove_all_extents,T const volatile[N],typename boost::remove_all_extents::type type) #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x610)) && !defined(__IBMCPP__) && !BOOST_WORKAROUND(__DMC__, BOOST_TESTED_AT(0x840)) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,remove_all_extents,T[],typename boost::remove_all_extents::type) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,remove_all_extents,T const[],typename boost::remove_all_extents::type) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,remove_all_extents,T volatile[],typename boost::remove_all_extents::type) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,remove_all_extents,T const volatile[],typename boost::remove_all_extents::type) #endif #endif } // namespace boost #endif #include #endif // BOOST_TT_REMOVE_BOUNDS_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/add_const.hpp0000644000000000000000000000007412717644140022044 xustar0030 atime=1463765180.177719552 30 ctime=1463765201.173551863 madp-0.4/src/boost/boost/type_traits/add_const.hpp0000664000372100037210000000266112717644140022700 0ustar00fransfrans00000000000000 // (C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes, Howard // Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_ADD_CONST_HPP_INCLUDED #define BOOST_TT_ADD_CONST_HPP_INCLUDED #include // should be the last #include #include namespace boost { // * convert a type T to const type - add_const // this is not required since the result is always // the same as "T const", but it does suppress warnings // from some compilers: #if defined(BOOST_MSVC) // This bogus warning will appear when add_const is applied to a // const volatile reference because we can't detect const volatile // references with MSVC6. # pragma warning(push) # pragma warning(disable:4181) // warning C4181: qualifier applied to reference type ignored #endif BOOST_TT_AUX_TYPE_TRAIT_DEF1(add_const,T,T const) #if defined(BOOST_MSVC) # pragma warning(pop) #endif #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,add_const,T&,T&) #endif } // namespace boost #include #endif // BOOST_TT_ADD_CONST_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_base_of.hpp0000644000000000000000000000007412717644140022177 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/is_base_of.hpp0000664000372100037210000000354212717644140023032 0ustar00fransfrans00000000000000 // (C) Copyright Rani Sharoni 2003-2005. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_BASE_OF_HPP_INCLUDED #define BOOST_TT_IS_BASE_OF_HPP_INCLUDED #include #include #include #include #include // should be the last #include #include namespace boost { namespace detail{ template struct is_base_of_imp { typedef typename remove_cv::type ncvB; typedef typename remove_cv::type ncvD; BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_or< (::boost::detail::is_base_and_derived_impl::value), (::boost::type_traits::ice_and< ::boost::is_same::value, ::boost::is_class::value>::value)>::value)); }; } BOOST_TT_AUX_BOOL_TRAIT_DEF2( is_base_of , Base , Derived , (::boost::detail::is_base_of_imp::value)) #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC2_2(typename Base,typename Derived,is_base_of,Base&,Derived,false) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC2_2(typename Base,typename Derived,is_base_of,Base,Derived&,false) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC2_2(typename Base,typename Derived,is_base_of,Base&,Derived&,false) #endif } // namespace boost #include #endif // BOOST_TT_IS_BASE_AND_DERIVED_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_virtual_base_of.hpp0000644000000000000000000000007412717644140023745 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/is_virtual_base_of.hpp0000664000372100037210000000735012717644140024601 0ustar00fransfrans00000000000000// (C) Copyright Daniel Frey and Robert Ramey 2009. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_VIRTUAL_BASE_OF_HPP_INCLUDED #define BOOST_TT_IS_VIRTUAL_BASE_OF_HPP_INCLUDED #include #include #include #include // should be the last #include #include namespace boost { namespace detail { #ifdef BOOST_MSVC #pragma warning( push ) #pragma warning( disable : 4584 4250) #elif defined(__GNUC__) && (__GNUC__ >= 4) #pragma GCC system_header #endif template struct is_virtual_base_of_impl { BOOST_STATIC_CONSTANT(bool, value = false); }; template struct is_virtual_base_of_impl { #ifdef __BORLANDC__ struct boost_type_traits_internal_struct_X : public virtual Derived, public virtual Base { boost_type_traits_internal_struct_X(); boost_type_traits_internal_struct_X(const boost_type_traits_internal_struct_X&); boost_type_traits_internal_struct_X& operator=(const boost_type_traits_internal_struct_X&); ~boost_type_traits_internal_struct_X()throw(); }; struct boost_type_traits_internal_struct_Y : public virtual Derived { boost_type_traits_internal_struct_Y(); boost_type_traits_internal_struct_Y(const boost_type_traits_internal_struct_Y&); boost_type_traits_internal_struct_Y& operator=(const boost_type_traits_internal_struct_Y&); ~boost_type_traits_internal_struct_Y()throw(); }; #else struct boost_type_traits_internal_struct_X : public Derived, virtual Base { boost_type_traits_internal_struct_X(); boost_type_traits_internal_struct_X(const boost_type_traits_internal_struct_X&); boost_type_traits_internal_struct_X& operator=(const boost_type_traits_internal_struct_X&); ~boost_type_traits_internal_struct_X()throw(); }; struct boost_type_traits_internal_struct_Y : public Derived { boost_type_traits_internal_struct_Y(); boost_type_traits_internal_struct_Y(const boost_type_traits_internal_struct_Y&); boost_type_traits_internal_struct_Y& operator=(const boost_type_traits_internal_struct_Y&); ~boost_type_traits_internal_struct_Y()throw(); }; #endif BOOST_STATIC_CONSTANT(bool, value = (sizeof(boost_type_traits_internal_struct_X)==sizeof(boost_type_traits_internal_struct_Y))); }; template struct is_virtual_base_of_impl2 { typedef typename mpl::and_, mpl::not_ > >::type tag_type; typedef is_virtual_base_of_impl imp; BOOST_STATIC_CONSTANT(bool, value = imp::value); }; #ifdef BOOST_MSVC #pragma warning( pop ) #endif } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF2( is_virtual_base_of , Base , Derived , (::boost::detail::is_virtual_base_of_impl2::value) ) #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC2_2(typename Base,typename Derived,is_virtual_base_of,Base&,Derived,false) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC2_2(typename Base,typename Derived,is_virtual_base_of,Base,Derived&,false) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC2_2(typename Base,typename Derived,is_virtual_base_of,Base&,Derived&,false) #endif } // namespace boost #include #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_bit_xor_assign.hpp0000644000000000000000000000007312717644140023752 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/has_bit_xor_assign.hpp0000664000372100037210000000411712717644140024605 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_BIT_XOR_ASSIGN_HPP_INCLUDED #define BOOST_TT_HAS_BIT_XOR_ASSIGN_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_bit_xor_assign #define BOOST_TT_TRAIT_OP ^= #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* Lhs==fundamental and Rhs==fundamental and (Lhs!=integral or Rhs!=integral) */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::type_traits::ice_or<\ ::boost::type_traits::ice_not< ::boost::is_integral< Lhs_noref >::value >::value,\ ::boost::type_traits::ice_not< ::boost::is_integral< Rhs_noref >::value >::value\ >::value\ >::value,\ /* Lhs==fundamental and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ /* Rhs==fundamental and Lhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_pointer< Lhs_noref >::value\ >::value,\ /* Lhs==pointer and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ /* Lhs==fundamental and Rhs==fundamental and Lhs==const */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_const< Lhs_noref >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_pod.hpp0000644000000000000000000000007412717644140021363 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/is_pod.hpp0000664000372100037210000000727012717644140022220 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_POD_HPP_INCLUDED #define BOOST_TT_IS_POD_HPP_INCLUDED #include #include #include #include #include #include // should be the last #include #include #ifndef BOOST_IS_POD #define BOOST_INTERNAL_IS_POD(T) false #else #define BOOST_INTERNAL_IS_POD(T) BOOST_IS_POD(T) #endif namespace boost { // forward declaration, needed by 'is_pod_array_helper' template below template< typename T > struct is_POD; namespace detail { #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION template struct is_pod_impl { BOOST_STATIC_CONSTANT( bool, value = (::boost::type_traits::ice_or< ::boost::is_scalar::value, ::boost::is_void::value, BOOST_INTERNAL_IS_POD(T) >::value)); }; #if !defined(BOOST_NO_ARRAY_TYPE_SPECIALIZATIONS) template struct is_pod_impl : public is_pod_impl { }; #endif #else template struct is_pod_helper { template struct result_ { BOOST_STATIC_CONSTANT( bool, value = (::boost::type_traits::ice_or< ::boost::is_scalar::value, ::boost::is_void::value, BOOST_INTERNAL_IS_POD(T) >::value)); }; }; template struct bool_to_yes_no_type { typedef ::boost::type_traits::no_type type; }; template <> struct bool_to_yes_no_type { typedef ::boost::type_traits::yes_type type; }; template struct is_pod_array_helper { enum { is_pod = ::boost::is_POD::value }; // MSVC workaround typedef typename bool_to_yes_no_type::type type; type instance() const; }; template is_pod_array_helper is_POD_array(T*); template <> struct is_pod_helper { template struct result_ { static T& help(); BOOST_STATIC_CONSTANT(bool, value = sizeof(is_POD_array(help()).instance()) == sizeof(::boost::type_traits::yes_type) ); }; }; template struct is_pod_impl { BOOST_STATIC_CONSTANT( bool, value = ( ::boost::detail::is_pod_helper< ::boost::is_array::value >::template result_::value ) ); }; #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION // the following help compilers without partial specialization support: BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,void,true) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,void const,true) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,void volatile,true) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,void const volatile,true) #endif } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_pod,T,::boost::detail::is_pod_impl::value) // is_POD is the old depricated name for this trait, do not use this as it may // be removed in future without warning!! BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_POD,T,::boost::is_pod::value) } // namespace boost #include #undef BOOST_INTERNAL_IS_POD #endif // BOOST_TT_IS_POD_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/extent.hpp0000644000000000000000000000007312717644140021414 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/extent.hpp0000664000372100037210000000772112717644140022253 0ustar00fransfrans00000000000000 // (C) Copyright John Maddock 2005. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_EXTENT_HPP_INCLUDED #define BOOST_TT_EXTENT_HPP_INCLUDED // should be the last #include #include namespace boost { namespace detail{ #if defined( __CODEGEARC__ ) // wrap the impl as main trait provides additional MPL lambda support template < typename T, std::size_t N > struct extent_imp { static const std::size_t value = __array_extent(T, N); }; #else template struct extent_imp { BOOST_STATIC_CONSTANT(std::size_t, value = 0); }; #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) && !defined(BOOST_NO_ARRAY_TYPE_SPECIALIZATIONS) template struct extent_imp { BOOST_STATIC_CONSTANT(std::size_t, value = (::boost::detail::extent_imp::value)); }; template struct extent_imp { BOOST_STATIC_CONSTANT(std::size_t, value = (::boost::detail::extent_imp::value)); }; template struct extent_imp { BOOST_STATIC_CONSTANT(std::size_t, value = (::boost::detail::extent_imp::value)); }; template struct extent_imp { BOOST_STATIC_CONSTANT(std::size_t, value = (::boost::detail::extent_imp::value)); }; template struct extent_imp { BOOST_STATIC_CONSTANT(std::size_t, value = R); }; template struct extent_imp { BOOST_STATIC_CONSTANT(std::size_t, value = R); }; template struct extent_imp { BOOST_STATIC_CONSTANT(std::size_t, value = R); }; template struct extent_imp { BOOST_STATIC_CONSTANT(std::size_t, value = R); }; #if !BOOST_WORKAROUND(__BORLANDC__, < 0x600) && !defined(__IBMCPP__) && !BOOST_WORKAROUND(__DMC__, BOOST_TESTED_AT(0x840)) && !defined(__MWERKS__) template struct extent_imp { BOOST_STATIC_CONSTANT(std::size_t, value = (::boost::detail::extent_imp::value)); }; template struct extent_imp { BOOST_STATIC_CONSTANT(std::size_t, value = (::boost::detail::extent_imp::value)); }; template struct extent_imp { BOOST_STATIC_CONSTANT(std::size_t, value = (::boost::detail::extent_imp::value)); }; template struct extent_imp { BOOST_STATIC_CONSTANT(std::size_t, value = (::boost::detail::extent_imp::value)); }; template struct extent_imp { BOOST_STATIC_CONSTANT(std::size_t, value = 0); }; template struct extent_imp { BOOST_STATIC_CONSTANT(std::size_t, value = 0); }; template struct extent_imp { BOOST_STATIC_CONSTANT(std::size_t, value = 0); }; template struct extent_imp { BOOST_STATIC_CONSTANT(std::size_t, value = 0); }; #endif #endif #endif // non-CodeGear implementation } // ::boost::detail template struct extent : public ::boost::integral_constant::value> { #if BOOST_WORKAROUND(BOOST_MSVC, < 1300) typedef ::boost::integral_constant::value> base_; using base_::value; #endif BOOST_MPL_AUX_LAMBDA_SUPPORT(1,extent,(T)) }; } // namespace boost #include #endif // BOOST_TT_IS_MEMBER_FUNCTION_POINTER_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_unary_minus.hpp0000644000000000000000000000007412717644140023312 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_unary_minus.hpp0000664000372100037210000000135212717644140024142 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_UNARY_MINUS_HPP_INCLUDED #define BOOST_TT_HAS_UNARY_MINUS_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_unary_minus #define BOOST_TT_TRAIT_OP - #define BOOST_TT_FORBIDDEN_IF\ /* pointer */\ ::boost::is_pointer< Rhs_noref >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_integral.hpp0000644000000000000000000000007412717644140022406 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/is_integral.hpp0000664000372100037210000000712112717644140023236 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_INTEGRAL_HPP_INCLUDED #define BOOST_TT_IS_INTEGRAL_HPP_INCLUDED #include // should be the last #include #include namespace boost { //* is a type T an [cv-qualified-] integral type described in the standard (3.9.1p3) // as an extension we include long long, as this is likely to be added to the // standard at a later date #if defined( __CODEGEARC__ ) BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_integral,T,__is_integral(T)) #else BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_integral,T,false) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,unsigned char,true) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,unsigned short,true) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,unsigned int,true) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,unsigned long,true) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,signed char,true) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,signed short,true) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,signed int,true) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,signed long,true) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,bool,true) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,char,true) #ifndef BOOST_NO_INTRINSIC_WCHAR_T // If the following line fails to compile and you're using the Intel // compiler, see http://lists.boost.org/MailArchives/boost-users/msg06567.php, // and define BOOST_NO_INTRINSIC_WCHAR_T on the command line. BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,wchar_t,true) #endif // Same set of integral types as in boost/type_traits/integral_promotion.hpp. // Please, keep in sync. -- Alexander Nasonov #if (defined(BOOST_MSVC) && (BOOST_MSVC < 1300)) \ || (defined(BOOST_INTEL_CXX_VERSION) && defined(_MSC_VER) && (BOOST_INTEL_CXX_VERSION <= 600)) \ || (defined(__BORLANDC__) && (__BORLANDC__ == 0x600) && (_MSC_VER < 1300)) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,unsigned __int8,true) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,__int8,true) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,unsigned __int16,true) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,__int16,true) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,unsigned __int32,true) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,__int32,true) #ifdef __BORLANDC__ BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,unsigned __int64,true) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,__int64,true) #endif #endif # if defined(BOOST_HAS_LONG_LONG) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral, ::boost::ulong_long_type,true) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral, ::boost::long_long_type,true) #elif defined(BOOST_HAS_MS_INT64) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,unsigned __int64,true) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,__int64,true) #endif #ifdef BOOST_HAS_INT128 BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,boost::int128_type,true) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,boost::uint128_type,true) #endif #ifndef BOOST_NO_CXX11_CHAR16_T BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,char16_t,true) #endif #ifndef BOOST_NO_CXX11_CHAR32_T BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_integral,char32_t,true) #endif #endif // non-CodeGear implementation } // namespace boost #include #endif // BOOST_TT_IS_INTEGRAL_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_scalar.hpp0000644000000000000000000000007412717644140022046 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/is_scalar.hpp0000664000372100037210000000360112717644140022675 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_SCALAR_HPP_INCLUDED #define BOOST_TT_IS_SCALAR_HPP_INCLUDED #include #include #include #include #include #include // should be the last #include #include namespace boost { namespace detail { template struct is_scalar_impl { BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_or< ::boost::is_arithmetic::value, ::boost::is_enum::value, ::boost::is_pointer::value, ::boost::is_member_pointer::value >::value)); }; // these specializations are only really needed for compilers // without partial specialization support: template <> struct is_scalar_impl{ BOOST_STATIC_CONSTANT(bool, value = false ); }; #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS template <> struct is_scalar_impl{ BOOST_STATIC_CONSTANT(bool, value = false ); }; template <> struct is_scalar_impl{ BOOST_STATIC_CONSTANT(bool, value = false ); }; template <> struct is_scalar_impl{ BOOST_STATIC_CONSTANT(bool, value = false ); }; #endif } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_scalar,T,::boost::detail::is_scalar_impl::value) } // namespace boost #include #endif // BOOST_TT_IS_SCALAR_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_compound.hpp0000644000000000000000000000007412717644140022425 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/is_compound.hpp0000664000372100037210000000243112717644140023254 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_COMPOUND_HPP_INCLUDED #define BOOST_TT_IS_COMPOUND_HPP_INCLUDED #include #include #include // should be the last #include #include namespace boost { #if !defined( __CODEGEARC__ ) namespace detail { template struct is_compound_impl { BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_not< ::boost::is_fundamental::value >::value)); }; } // namespace detail #endif // !defined( __CODEGEARC__ ) #if defined( __CODEGEARC__ ) BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_compound,T,__is_compound(T)) #else BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_compound,T,::boost::detail::is_compound_impl::value) #endif } // namespace boost #include #endif // BOOST_TT_IS_COMPOUND_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_signed.hpp0000644000000000000000000000007412717644140022052 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/is_signed.hpp0000664000372100037210000001134312717644140022703 0ustar00fransfrans00000000000000 // (C) Copyright John Maddock 2005. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_SIGNED_HPP_INCLUDED #define BOOST_TT_IS_SIGNED_HPP_INCLUDED #include #include #include #include // should be the last #include #include namespace boost { #if !defined( __CODEGEARC__ ) namespace detail{ #if !(defined(__EDG_VERSION__) && __EDG_VERSION__ <= 238) && !defined(BOOST_NO_INCLASS_MEMBER_INITIALIZATION) template struct is_signed_values { // // Note that we cannot use BOOST_STATIC_CONSTANT here, using enum's // rather than "real" static constants simply doesn't work or give // the correct answer. // typedef typename remove_cv::type no_cv_t; static const no_cv_t minus_one = (static_cast(-1)); static const no_cv_t zero = (static_cast(0)); }; template struct is_signed_helper { typedef typename remove_cv::type no_cv_t; BOOST_STATIC_CONSTANT(bool, value = (!(::boost::detail::is_signed_values::minus_one > boost::detail::is_signed_values::zero))); }; template struct is_signed_select_helper { template struct rebind { typedef is_signed_helper type; }; }; template <> struct is_signed_select_helper { template struct rebind { typedef false_type type; }; }; template struct is_signed_imp { typedef is_signed_select_helper< ::boost::type_traits::ice_or< ::boost::is_integral::value, ::boost::is_enum::value>::value > selector; typedef typename selector::template rebind binder; typedef typename binder::type type; #if defined(BOOST_MSVC) && (BOOST_MSVC < 1300) BOOST_STATIC_CONSTANT(bool, value = is_signed_imp::type::value); #else BOOST_STATIC_CONSTANT(bool, value = type::value); #endif }; #else template struct is_signed_imp : public false_type{}; template <> struct is_signed_imp : public true_type{}; template <> struct is_signed_imp : public true_type{}; template <> struct is_signed_imp : public true_type{}; template <> struct is_signed_imp : public true_type{}; template <> struct is_signed_imp : public true_type{}; template <> struct is_signed_imp : public true_type{}; template <> struct is_signed_imp : public true_type{}; template <> struct is_signed_imp : public true_type{}; template <> struct is_signed_imp : public true_type{}; template <> struct is_signed_imp : public true_type{}; template <> struct is_signed_imp : public true_type{}; template <> struct is_signed_imp : public true_type{}; template <> struct is_signed_imp : public true_type{}; template <> struct is_signed_imp : public true_type{}; template <> struct is_signed_imp : public true_type{}; template <> struct is_signed_imp : public true_type{}; #ifdef BOOST_HAS_LONG_LONG template <> struct is_signed_imp : public true_type{}; template <> struct is_signed_imp : public true_type{}; template <> struct is_signed_imp : public true_type{}; template <> struct is_signed_imp : public true_type{}; #endif #if defined(CHAR_MIN) && (CHAR_MIN != 0) template <> struct is_signed_imp : public true_type{}; template <> struct is_signed_imp : public true_type{}; template <> struct is_signed_imp : public true_type{}; template <> struct is_signed_imp : public true_type{}; #endif #if defined(WCHAR_MIN) && (WCHAR_MIN != 0) template <> struct is_signed_imp : public true_type{}; template <> struct is_signed_imp : public true_type{}; template <> struct is_signed_imp : public true_type{}; template <> struct is_signed_imp : public true_type{}; #endif #endif } #endif // !defined( __CODEGEARC__ ) #if defined( __CODEGEARC__ ) BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_signed,T,__is_signed(T)) #else BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_signed,T,::boost::detail::is_signed_imp::value) #endif } // namespace boost #include #endif // BOOST_TT_IS_MEMBER_FUNCTION_POINTER_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_bit_or_assign.hpp0000644000000000000000000000007312717644140023562 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/has_bit_or_assign.hpp0000664000372100037210000000411412717644140024412 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_BIT_OR_ASSIGN_HPP_INCLUDED #define BOOST_TT_HAS_BIT_OR_ASSIGN_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_bit_or_assign #define BOOST_TT_TRAIT_OP |= #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* Lhs==fundamental and Rhs==fundamental and (Lhs!=integral or Rhs!=integral) */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::type_traits::ice_or<\ ::boost::type_traits::ice_not< ::boost::is_integral< Lhs_noref >::value >::value,\ ::boost::type_traits::ice_not< ::boost::is_integral< Rhs_noref >::value >::value\ >::value\ >::value,\ /* Lhs==fundamental and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ /* Rhs==fundamental and Lhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_pointer< Lhs_noref >::value\ >::value,\ /* Lhs==pointer and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ /* Lhs==fundamental and Rhs==fundamental and Lhs==const */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_const< Lhs_noref >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_divides_assign.hpp0000644000000000000000000000007312717644140023733 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/has_divides_assign.hpp0000664000372100037210000000324112717644140024563 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_DIVIDES_ASSIGN_HPP_INCLUDED #define BOOST_TT_HAS_DIVIDES_ASSIGN_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_divides_assign #define BOOST_TT_TRAIT_OP /= #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* Lhs==fundamental and Lhs==const and Rhs==fundamental */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_const< Lhs_noref >::value,\ ::boost::is_fundamental< Rhs_nocv >::value\ >::value,\ /* Lhs==pointer and (Rhs==fundamental or Rhs==pointer) */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::type_traits::ice_or<\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value\ >::value,\ /* Rhs==pointer and (Lhs==fundamental or Lhs==pointer) */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::type_traits::ice_or<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_pointer< Lhs_noref >::value\ >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_greater_equal.hpp0000644000000000000000000000007312717644140023560 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/has_greater_equal.hpp0000664000372100037210000000347212717644140024416 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_GREATER_EQUAL_HPP_INCLUDED #define BOOST_TT_HAS_GREATER_EQUAL_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_greater_equal #define BOOST_TT_TRAIT_OP >= #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* Lhs==pointer and Rhs==fundamental */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_fundamental< Rhs_nocv >::value\ >::value,\ /* Rhs==pointer and Lhs==fundamental */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::is_fundamental< Lhs_nocv >::value\ >::value,\ /* Lhs==pointer and Rhs==pointer and Lhs!=base(Rhs) and Rhs!=base(Lhs) and Lhs!=void* and Rhs!=void* */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::type_traits::ice_not<\ ::boost::type_traits::ice_or<\ ::boost::is_base_of< Lhs_noptr, Rhs_noptr >::value,\ ::boost::is_base_of< Rhs_noptr, Lhs_noptr >::value,\ ::boost::is_same< Lhs_noptr, Rhs_noptr >::value,\ ::boost::is_void< Lhs_noptr >::value,\ ::boost::is_void< Rhs_noptr >::value\ >::value\ >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/rank.hpp0000644000000000000000000000007412717644140021041 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/rank.hpp0000664000372100037210000000510212717644140021666 0ustar00fransfrans00000000000000 // (C) Copyright John Maddock 2005. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_RANK_HPP_INCLUDED #define BOOST_TT_RANK_HPP_INCLUDED // should be the last #include #include namespace boost { #if !defined( __CODEGEARC__ ) namespace detail{ template struct rank_imp { BOOST_STATIC_CONSTANT(std::size_t, value = N); }; #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) && !defined(BOOST_NO_ARRAY_TYPE_SPECIALIZATIONS) template struct rank_imp { BOOST_STATIC_CONSTANT(std::size_t, value = (::boost::detail::rank_imp::value)); }; template struct rank_imp { BOOST_STATIC_CONSTANT(std::size_t, value = (::boost::detail::rank_imp::value)); }; template struct rank_imp { BOOST_STATIC_CONSTANT(std::size_t, value = (::boost::detail::rank_imp::value)); }; template struct rank_imp { BOOST_STATIC_CONSTANT(std::size_t, value = (::boost::detail::rank_imp::value)); }; #if !BOOST_WORKAROUND(__BORLANDC__, < 0x600) && !defined(__IBMCPP__) && !BOOST_WORKAROUND(__DMC__, BOOST_TESTED_AT(0x840)) template struct rank_imp { BOOST_STATIC_CONSTANT(std::size_t, value = (::boost::detail::rank_imp::value)); }; template struct rank_imp { BOOST_STATIC_CONSTANT(std::size_t, value = (::boost::detail::rank_imp::value)); }; template struct rank_imp { BOOST_STATIC_CONSTANT(std::size_t, value = (::boost::detail::rank_imp::value)); }; template struct rank_imp { BOOST_STATIC_CONSTANT(std::size_t, value = (::boost::detail::rank_imp::value)); }; #endif #endif } #endif // !defined( __CODEGEARC__ ) #if defined( __CODEGEARC__ ) BOOST_TT_AUX_SIZE_T_TRAIT_DEF1(rank,T,__array_rank(T)) #else BOOST_TT_AUX_SIZE_T_TRAIT_DEF1(rank,T,(::boost::detail::rank_imp::value)) #endif } // namespace boost #include #endif // BOOST_TT_IS_MEMBER_FUNCTION_POINTER_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_operator.hpp0000644000000000000000000000007412717644140022574 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_operator.hpp0000664000372100037210000000435212717644140023427 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_OPERATOR_HPP_INCLUDED #define BOOST_TT_HAS_OPERATOR_HPP_INCLUDED #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_empty.hpp0000644000000000000000000000007412717644140021737 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/is_empty.hpp0000664000372100037210000001400412717644140022565 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_EMPTY_HPP_INCLUDED #define BOOST_TT_IS_EMPTY_HPP_INCLUDED #include #include #include #include #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION # include # include # include #else # include # include # include # include # include # include # include #endif // should be always the last #include directive #include #ifndef BOOST_INTERNAL_IS_EMPTY #define BOOST_INTERNAL_IS_EMPTY(T) false #else #define BOOST_INTERNAL_IS_EMPTY(T) BOOST_IS_EMPTY(T) #endif namespace boost { namespace detail { #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION #ifdef BOOST_MSVC #pragma warning(push) #pragma warning(disable:4624) // destructor could not be generated #endif template struct empty_helper_t1 : public T { empty_helper_t1(); // hh compiler bug workaround int i[256]; private: // suppress compiler warnings: empty_helper_t1(const empty_helper_t1&); empty_helper_t1& operator=(const empty_helper_t1&); }; #ifdef BOOST_MSVC #pragma warning(pop) #endif struct empty_helper_t2 { int i[256]; }; #if !BOOST_WORKAROUND(__BORLANDC__, < 0x600) template struct empty_helper { BOOST_STATIC_CONSTANT(bool, value = false); }; template struct empty_helper { BOOST_STATIC_CONSTANT( bool, value = (sizeof(empty_helper_t1) == sizeof(empty_helper_t2)) ); }; template struct is_empty_impl { typedef typename remove_cv::type cvt; BOOST_STATIC_CONSTANT( bool, value = ( ::boost::type_traits::ice_or< ::boost::detail::empty_helper::value>::value , BOOST_INTERNAL_IS_EMPTY(cvt) >::value )); }; #else // __BORLANDC__ template struct empty_helper { BOOST_STATIC_CONSTANT(bool, value = false); }; template struct empty_helper { BOOST_STATIC_CONSTANT(bool, value = ( sizeof(empty_helper_t1) == sizeof(empty_helper_t2) )); }; template struct is_empty_impl { typedef typename remove_cv::type cvt; typedef typename add_reference::type r_type; BOOST_STATIC_CONSTANT( bool, value = ( ::boost::type_traits::ice_or< ::boost::detail::empty_helper< cvt , ::boost::is_class::value , ::boost::is_convertible< r_type,int>::value >::value , BOOST_INTERNAL_IS_EMPTY(cvt) >::value)); }; #endif // __BORLANDC__ #else // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION #ifdef BOOST_MSVC6_MEMBER_TEMPLATES template struct empty_helper_t1 : public T { empty_helper_t1(); int i[256]; }; struct empty_helper_t2 { int i[256]; }; template struct empty_helper_base { enum { value = (sizeof(empty_helper_t1) == sizeof(empty_helper_t2)) }; }; template struct empty_helper_nonbase { enum { value = false }; }; template struct empty_helper_chooser { template struct result_ { typedef empty_helper_nonbase type; }; }; template <> struct empty_helper_chooser { template struct result_ { typedef empty_helper_base type; }; }; template struct is_empty_impl { typedef ::boost::detail::empty_helper_chooser< ::boost::type_traits::ice_and< ::boost::type_traits::ice_not< ::boost::is_reference::value >::value, ::boost::type_traits::ice_not< ::boost::is_convertible::value >::value, ::boost::type_traits::ice_not< ::boost::is_pointer::value >::value, ::boost::type_traits::ice_not< ::boost::is_member_pointer::value >::value, ::boost::type_traits::ice_not< ::boost::is_array::value >::value, ::boost::type_traits::ice_not< ::boost::is_void::value >::value, ::boost::type_traits::ice_not< ::boost::is_convertible::value >::value >::value > chooser; typedef typename chooser::template result_ result; typedef typename result::type eh_type; BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_or::value)); }; #else template struct is_empty_impl { BOOST_STATIC_CONSTANT(bool, value = BOOST_INTERNAL_IS_EMPTY(T)); }; #endif // BOOST_MSVC6_MEMBER_TEMPLATES #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION // these help when the compiler has no partial specialization support: BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_empty,void,false) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_empty,void const,false) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_empty,void volatile,false) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_empty,void const volatile,false) #endif } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_empty,T,::boost::detail::is_empty_impl::value) } // namespace boost #include #undef BOOST_INTERNAL_IS_EMPTY #endif // BOOST_TT_IS_EMPTY_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_rvalue_reference.hpp0000644000000000000000000000007412717644140024115 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/is_rvalue_reference.hpp0000664000372100037210000000156212717644140024750 0ustar00fransfrans00000000000000 // (C) John Maddock 2010. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_RVALUE_REFERENCE_HPP_INCLUDED #define BOOST_TT_IS_RVALUE_REFERENCE_HPP_INCLUDED #include // should be the last #include #include namespace boost { BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_rvalue_reference,T,false) #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_rvalue_reference,T&&,true) #endif } // namespace boost #include #endif // BOOST_TT_IS_REFERENCE_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_trivial_constructor.hpp0000644000000000000000000000007412717644140025060 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_trivial_constructor.hpp0000664000372100037210000000305612717644140025713 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_TRIVIAL_CONSTRUCTOR_HPP_INCLUDED #define BOOST_TT_HAS_TRIVIAL_CONSTRUCTOR_HPP_INCLUDED #include #include #include #include // should be the last #include #include namespace boost { namespace detail { template struct has_trivial_ctor_impl { #ifdef BOOST_HAS_TRIVIAL_CONSTRUCTOR BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_or< ::boost::is_pod::value, BOOST_HAS_TRIVIAL_CONSTRUCTOR(T) >::value)); #else BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_or< ::boost::is_pod::value, false >::value)); #endif }; } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF1(has_trivial_constructor,T,::boost::detail::has_trivial_ctor_impl::value) BOOST_TT_AUX_BOOL_TRAIT_DEF1(has_trivial_default_constructor,T,::boost::detail::has_trivial_ctor_impl::value) } // namespace boost #include #endif // BOOST_TT_HAS_TRIVIAL_CONSTRUCTOR_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_bit_xor.hpp0000644000000000000000000000007312717644140022406 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/has_bit_xor.hpp0000664000372100037210000000344412717644140023243 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_BIT_XOR_HPP_INCLUDED #define BOOST_TT_HAS_BIT_XOR_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_bit_xor #define BOOST_TT_TRAIT_OP ^ #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* Lhs==fundamental and Rhs==fundamental and (Lhs!=integral or Rhs!=integral) */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::type_traits::ice_or<\ ::boost::type_traits::ice_not< ::boost::is_integral< Lhs_noref >::value >::value,\ ::boost::type_traits::ice_not< ::boost::is_integral< Rhs_noref >::value >::value\ >::value\ >::value,\ /* Lhs==fundamental and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ /* Rhs==fundamental and Lhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_pointer< Lhs_noref >::value\ >::value,\ /* Lhs==pointer and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_class.hpp0000644000000000000000000000007412717644140021706 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/is_class.hpp0000664000372100037210000001117612717644140022543 0ustar00fransfrans00000000000000// (C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes, Howard // Hinnant & John Maddock 2000-2003. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_CLASS_HPP_INCLUDED #define BOOST_TT_IS_CLASS_HPP_INCLUDED #include #include #ifndef BOOST_IS_CLASS # include # include # include #ifdef BOOST_TT_HAS_CONFORMING_IS_CLASS_IMPLEMENTATION # include #else # include # include # include # include # include #endif #endif // BOOST_IS_CLASS #ifdef __EDG_VERSION__ # include #endif // should be the last #include #include namespace boost { namespace detail { #ifndef BOOST_IS_CLASS #ifdef BOOST_TT_HAS_CONFORMING_IS_CLASS_IMPLEMENTATION // This is actually the conforming implementation which works with // abstract classes. However, enough compilers have trouble with // it that most will use the one in // boost/type_traits/object_traits.hpp. This implementation // actually works with VC7.0, but other interactions seem to fail // when we use it. // is_class<> metafunction due to Paul Mensonides // (leavings@attbi.com). For more details: // http://groups.google.com/groups?hl=en&selm=000001c1cc83%24e154d5e0%247772e50c%40c161550a&rnum=1 #if defined(__GNUC__) && !defined(__EDG_VERSION__) template ::boost::type_traits::yes_type is_class_tester(void(U::*)(void)); template ::boost::type_traits::no_type is_class_tester(...); template struct is_class_impl { BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_and< sizeof(is_class_tester(0)) == sizeof(::boost::type_traits::yes_type), ::boost::type_traits::ice_not< ::boost::is_union::value >::value >::value) ); }; #else template struct is_class_impl { template static ::boost::type_traits::yes_type is_class_tester(void(U::*)(void)); template static ::boost::type_traits::no_type is_class_tester(...); BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_and< sizeof(is_class_tester(0)) == sizeof(::boost::type_traits::yes_type), ::boost::type_traits::ice_not< ::boost::is_union::value >::value >::value) ); }; #endif #else template struct is_class_impl { # ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_and< ::boost::type_traits::ice_not< ::boost::is_union::value >::value, ::boost::type_traits::ice_not< ::boost::is_scalar::value >::value, ::boost::type_traits::ice_not< ::boost::is_array::value >::value, ::boost::type_traits::ice_not< ::boost::is_reference::value>::value, ::boost::type_traits::ice_not< ::boost::is_void::value >::value, ::boost::type_traits::ice_not< ::boost::is_function::value >::value >::value)); # else BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_and< ::boost::type_traits::ice_not< ::boost::is_union::value >::value, ::boost::type_traits::ice_not< ::boost::is_scalar::value >::value, ::boost::type_traits::ice_not< ::boost::is_array::value >::value, ::boost::type_traits::ice_not< ::boost::is_reference::value>::value, ::boost::type_traits::ice_not< ::boost::is_void::value >::value >::value)); # endif }; # endif // BOOST_TT_HAS_CONFORMING_IS_CLASS_IMPLEMENTATION # else // BOOST_IS_CLASS template struct is_class_impl { BOOST_STATIC_CONSTANT(bool, value = BOOST_IS_CLASS(T)); }; # endif // BOOST_IS_CLASS } // namespace detail # ifdef __EDG_VERSION__ BOOST_TT_AUX_BOOL_TRAIT_DEF1( is_class,T, boost::detail::is_class_impl::type>::value) # else BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_class,T,::boost::detail::is_class_impl::value) # endif } // namespace boost #include #endif // BOOST_TT_IS_CLASS_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_lvalue_reference.hpp0000644000000000000000000000007412717644140024107 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/is_lvalue_reference.hpp0000664000372100037210000001111112717644140024731 0ustar00fransfrans00000000000000 // (C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes, // Howard Hinnant and John Maddock 2000. // (C) Copyright Mat Marcus, Jesse Jones and Adobe Systems Inc 2001 // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. // Fixed is_pointer, is_lvalue_reference, is_const, is_volatile, is_same, // is_member_pointer based on the Simulated Partial Specialization work // of Mat Marcus and Jesse Jones. See http://opensource.adobe.com or // http://groups.yahoo.com/group/boost/message/5441 // Some workarounds in here use ideas suggested from "Generic: // Mappings between Types and Values" // by Andrei Alexandrescu (see http://www.cuj.com/experts/1810/alexandr.html). #ifndef BOOST_TT_IS_LVALUE_REFERENCE_HPP_INCLUDED #define BOOST_TT_IS_LVALUE_REFERENCE_HPP_INCLUDED #include #ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION # include # include #endif // should be the last #include #include namespace boost { #if defined( __CODEGEARC__ ) BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_lvalue_reference,T,__is_reference(T)) #elif !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_lvalue_reference,T,false) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_lvalue_reference,T&,true) #if defined(BOOST_ILLEGAL_CV_REFERENCES) // these are illegal specialisations; cv-qualifies applied to // references have no effect according to [8.3.2p1], // C++ Builder requires them though as it treats cv-qualified // references as distinct types... BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_lvalue_reference,T& const,true) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_lvalue_reference,T& volatile,true) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_lvalue_reference,T& const volatile,true) #endif #if defined(__GNUC__) && (__GNUC__ < 3) // these allow us to work around illegally cv-qualified reference // types. BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_lvalue_reference,T const ,::boost::is_lvalue_reference::value) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_lvalue_reference,T volatile ,::boost::is_lvalue_reference::value) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_lvalue_reference,T const volatile ,::boost::is_lvalue_reference::value) // However, the above specializations confuse gcc 2.96 unless we also // supply these specializations for array types BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_2(typename T,unsigned long N,is_lvalue_reference,T[N],false) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_2(typename T,unsigned long N,is_lvalue_reference,const T[N],false) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_2(typename T,unsigned long N,is_lvalue_reference,volatile T[N],false) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_2(typename T,unsigned long N,is_lvalue_reference,const volatile T[N],false) #endif #else #ifdef BOOST_MSVC # pragma warning(push) # pragma warning(disable: 4181 4097) #endif namespace detail { using ::boost::type_traits::yes_type; using ::boost::type_traits::no_type; using ::boost::type_traits::wrap; template T&(* is_lvalue_reference_helper1(wrap) )(wrap); char is_lvalue_reference_helper1(...); template no_type is_lvalue_reference_helper2(T&(*)(wrap)); yes_type is_lvalue_reference_helper2(...); template struct is_lvalue_reference_impl { BOOST_STATIC_CONSTANT( bool, value = sizeof( ::boost::detail::is_lvalue_reference_helper2( ::boost::detail::is_lvalue_reference_helper1(::boost::type_traits::wrap()))) == 1 ); }; BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_lvalue_reference,void,false) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_lvalue_reference,void const,false) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_lvalue_reference,void volatile,false) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_lvalue_reference,void const volatile,false) #endif } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_lvalue_reference,T,::boost::detail::is_lvalue_reference_impl::value) #ifdef BOOST_MSVC # pragma warning(pop) #endif #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION } // namespace boost #include #endif // BOOST_TT_IS_REFERENCE_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/remove_extent.hpp0000644000000000000000000000007412717644140022772 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/remove_extent.hpp0000664000372100037210000000374312717644140023630 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000-2005. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_REMOVE_EXTENT_HPP_INCLUDED #define BOOST_TT_REMOVE_EXTENT_HPP_INCLUDED #include #include #include #if BOOST_WORKAROUND(BOOST_MSVC,<=1300) #include #endif // should be the last #include #include #if !BOOST_WORKAROUND(BOOST_MSVC,<=1300) namespace boost { BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_extent,T,T) #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) && !defined(BOOST_NO_ARRAY_TYPE_SPECIALIZATIONS) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_2(typename T,std::size_t N,remove_extent,T[N],T type) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_2(typename T,std::size_t N,remove_extent,T const[N],T const type) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_2(typename T,std::size_t N,remove_extent,T volatile[N],T volatile type) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_2(typename T,std::size_t N,remove_extent,T const volatile[N],T const volatile type) #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x610)) && !defined(__IBMCPP__) && !BOOST_WORKAROUND(__DMC__, BOOST_TESTED_AT(0x840)) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,remove_extent,T[],T) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,remove_extent,T const[],T const) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,remove_extent,T volatile[],T volatile) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,remove_extent,T const volatile[],T const volatile) #endif #endif } // namespace boost #endif #include #endif // BOOST_TT_REMOVE_BOUNDS_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_minus.hpp0000644000000000000000000000007312717644140022073 xustar0030 atime=1463765180.181719519 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/has_minus.hpp0000664000372100037210000000436512717644140022733 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_MINUS_HPP_INCLUDED #define BOOST_TT_HAS_MINUS_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_minus #define BOOST_TT_TRAIT_OP - #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* Lhs==pointer and Rhs==fundamental and Rhs!=integral */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::type_traits::ice_not< ::boost::is_integral< Rhs_noref >::value >::value\ >::value,\ /* Lhs==void* and (Rhs==fundamental or Rhs==pointer) */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_void< Lhs_noptr >::value,\ ::boost::type_traits::ice_or<\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value\ >::value,\ /* Rhs==void* and (Lhs==fundamental or Lhs==pointer) */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::is_void< Rhs_noptr >::value,\ ::boost::type_traits::ice_or<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_pointer< Lhs_noref >::value\ >::value\ >::value,\ /* Lhs=fundamental and Rhs=pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ /* two different pointers */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::type_traits::ice_not< ::boost::is_same< Lhs_nocv, Rhs_nocv >::value >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_post_increment.hpp0000644000000000000000000000007412717644140023772 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_post_increment.hpp0000664000372100037210000000242612717644140024625 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_POST_INCREMENT_HPP_INCLUDED #define BOOST_TT_HAS_POST_INCREMENT_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_post_increment #define BOOST_TT_TRAIT_OP ++ #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* bool */\ ::boost::is_same< bool, Lhs_nocv >::value,\ /* void* */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_void< Lhs_noptr >::value\ >::value,\ /* (fundamental or pointer) and const */\ ::boost::type_traits::ice_and<\ ::boost::type_traits::ice_or<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_pointer< Lhs_noref >::value\ >::value,\ ::boost::is_const< Lhs_noref >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/function_traits.hpp0000644000000000000000000000007312717644140023320 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/function_traits.hpp0000664000372100037210000001564112717644140024157 0ustar00fransfrans00000000000000 // Copyright 2000 John Maddock (john@johnmaddock.co.uk) // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_FUNCTION_TRAITS_HPP_INCLUDED #define BOOST_TT_FUNCTION_TRAITS_HPP_INCLUDED #include #include #include namespace boost { #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION namespace detail { template struct function_traits_helper; template struct function_traits_helper { BOOST_STATIC_CONSTANT(unsigned, arity = 0); typedef R result_type; }; template struct function_traits_helper { BOOST_STATIC_CONSTANT(unsigned, arity = 1); typedef R result_type; typedef T1 arg1_type; typedef T1 argument_type; }; template struct function_traits_helper { BOOST_STATIC_CONSTANT(unsigned, arity = 2); typedef R result_type; typedef T1 arg1_type; typedef T2 arg2_type; typedef T1 first_argument_type; typedef T2 second_argument_type; }; template struct function_traits_helper { BOOST_STATIC_CONSTANT(unsigned, arity = 3); typedef R result_type; typedef T1 arg1_type; typedef T2 arg2_type; typedef T3 arg3_type; }; template struct function_traits_helper { BOOST_STATIC_CONSTANT(unsigned, arity = 4); typedef R result_type; typedef T1 arg1_type; typedef T2 arg2_type; typedef T3 arg3_type; typedef T4 arg4_type; }; template struct function_traits_helper { BOOST_STATIC_CONSTANT(unsigned, arity = 5); typedef R result_type; typedef T1 arg1_type; typedef T2 arg2_type; typedef T3 arg3_type; typedef T4 arg4_type; typedef T5 arg5_type; }; template struct function_traits_helper { BOOST_STATIC_CONSTANT(unsigned, arity = 6); typedef R result_type; typedef T1 arg1_type; typedef T2 arg2_type; typedef T3 arg3_type; typedef T4 arg4_type; typedef T5 arg5_type; typedef T6 arg6_type; }; template struct function_traits_helper { BOOST_STATIC_CONSTANT(unsigned, arity = 7); typedef R result_type; typedef T1 arg1_type; typedef T2 arg2_type; typedef T3 arg3_type; typedef T4 arg4_type; typedef T5 arg5_type; typedef T6 arg6_type; typedef T7 arg7_type; }; template struct function_traits_helper { BOOST_STATIC_CONSTANT(unsigned, arity = 8); typedef R result_type; typedef T1 arg1_type; typedef T2 arg2_type; typedef T3 arg3_type; typedef T4 arg4_type; typedef T5 arg5_type; typedef T6 arg6_type; typedef T7 arg7_type; typedef T8 arg8_type; }; template struct function_traits_helper { BOOST_STATIC_CONSTANT(unsigned, arity = 9); typedef R result_type; typedef T1 arg1_type; typedef T2 arg2_type; typedef T3 arg3_type; typedef T4 arg4_type; typedef T5 arg5_type; typedef T6 arg6_type; typedef T7 arg7_type; typedef T8 arg8_type; typedef T9 arg9_type; }; template struct function_traits_helper { BOOST_STATIC_CONSTANT(unsigned, arity = 10); typedef R result_type; typedef T1 arg1_type; typedef T2 arg2_type; typedef T3 arg3_type; typedef T4 arg4_type; typedef T5 arg5_type; typedef T6 arg6_type; typedef T7 arg7_type; typedef T8 arg8_type; typedef T9 arg9_type; typedef T10 arg10_type; }; } // end namespace detail template struct function_traits : public boost::detail::function_traits_helper::type> { }; #else namespace detail { template struct type_of_size { char elements[N]; }; template type_of_size<1> function_arity_helper(R (*f)()); template type_of_size<2> function_arity_helper(R (*f)(T1)); template type_of_size<3> function_arity_helper(R (*f)(T1, T2)); template type_of_size<4> function_arity_helper(R (*f)(T1, T2, T3)); template type_of_size<5> function_arity_helper(R (*f)(T1, T2, T3, T4)); template type_of_size<6> function_arity_helper(R (*f)(T1, T2, T3, T4, T5)); template type_of_size<7> function_arity_helper(R (*f)(T1, T2, T3, T4, T5, T6)); template type_of_size<8> function_arity_helper(R (*f)(T1, T2, T3, T4, T5, T6, T7)); template type_of_size<9> function_arity_helper(R (*f)(T1, T2, T3, T4, T5, T6, T7, T8)); template type_of_size<10> function_arity_helper(R (*f)(T1, T2, T3, T4, T5, T6, T7, T8, T9)); template type_of_size<11> function_arity_helper(R (*f)(T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)); } // end namespace detail // Won't work with references template struct function_traits { BOOST_STATIC_CONSTANT(unsigned, arity = (sizeof(boost::detail::function_arity_helper((Function*)0))-1)); }; #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION } #endif // BOOST_TT_FUNCTION_TRAITS_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/remove_pointer.hpp0000644000000000000000000000007412717644140023143 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/remove_pointer.hpp0000664000372100037210000000504312717644140023774 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_REMOVE_POINTER_HPP_INCLUDED #define BOOST_TT_REMOVE_POINTER_HPP_INCLUDED #include #include #ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION #include #endif #if BOOST_WORKAROUND(BOOST_MSVC,<=1300) #include #elif defined(BOOST_MSVC) #include #include #endif // should be the last #include #include namespace boost { #ifdef BOOST_MSVC namespace detail{ // // We need all this crazy indirection because a type such as: // // T (*const)(U) // // Does not bind to a or partial specialization with VC10 and earlier // template struct remove_pointer_imp { typedef T type; }; template struct remove_pointer_imp { typedef T type; }; template struct remove_pointer_imp3 { typedef typename remove_pointer_imp::type>::type type; }; template struct remove_pointer_imp3 { typedef T type; }; template struct remove_pointer_imp2 { typedef typename remove_pointer_imp3::value>::type type; }; } BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_pointer,T,typename boost::detail::remove_pointer_imp2::type) #elif !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_pointer,T,T) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,remove_pointer,T*,T) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,remove_pointer,T* const,T) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,remove_pointer,T* volatile,T) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,remove_pointer,T* const volatile,T) #elif !BOOST_WORKAROUND(BOOST_MSVC,<=1300) BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_pointer,T,typename boost::detail::remove_pointer_impl::type) #endif } // namespace boost #include #endif // BOOST_TT_REMOVE_POINTER_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_pre_increment.hpp0000644000000000000000000000007412717644140023573 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_pre_increment.hpp0000664000372100037210000000242212717644140024422 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_PRE_INCREMENT_HPP_INCLUDED #define BOOST_TT_HAS_PRE_INCREMENT_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_pre_increment #define BOOST_TT_TRAIT_OP ++ #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* bool */\ ::boost::is_same< bool, Rhs_nocv >::value,\ /* void* */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::is_void< Rhs_noptr >::value\ >::value,\ /* (fundamental or pointer) and const */\ ::boost::type_traits::ice_and<\ ::boost::type_traits::ice_or<\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ ::boost::is_const< Rhs_noref >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_trivial_copy.hpp0000644000000000000000000000007412717644140023445 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_trivial_copy.hpp0000664000372100037210000000442412717644140024300 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_TRIVIAL_COPY_HPP_INCLUDED #define BOOST_TT_HAS_TRIVIAL_COPY_HPP_INCLUDED #include #include #include #include #include #include #include // should be the last #include #include namespace boost { namespace detail { template struct has_trivial_copy_impl { #ifdef BOOST_HAS_TRIVIAL_COPY BOOST_STATIC_CONSTANT(bool, value = BOOST_HAS_TRIVIAL_COPY(T)); #else BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_and< ::boost::is_pod::value, ::boost::type_traits::ice_not< ::boost::is_volatile::value >::value >::value)); #endif }; } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF1(has_trivial_copy,T,::boost::detail::has_trivial_copy_impl::value) BOOST_TT_AUX_BOOL_TRAIT_DEF1(has_trivial_copy_constructor,T,::boost::detail::has_trivial_copy_impl::value) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_trivial_copy,void,false) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_trivial_copy,void const,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_trivial_copy,void const volatile,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_trivial_copy,void volatile,false) #endif BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_trivial_copy_constructor,void,false) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_trivial_copy_constructor,void const,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_trivial_copy_constructor,void const volatile,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_trivial_copy_constructor,void volatile,false) #endif } // namespace boost #include #endif // BOOST_TT_HAS_TRIVIAL_COPY_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_array.hpp0000644000000000000000000000007412717644140021717 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/is_array.hpp0000664000372100037210000000620112717644140022545 0ustar00fransfrans00000000000000 // (C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes, Howard // Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. // Some fixes for is_array are based on a newsgroup posting by Jonathan Lundquist. #ifndef BOOST_TT_IS_ARRAY_HPP_INCLUDED #define BOOST_TT_IS_ARRAY_HPP_INCLUDED #include #ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION # include # include #endif #include // should be the last #include #include namespace boost { #if defined( __CODEGEARC__ ) BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_array,T,__is_array(T)) #elif !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_array,T,false) #if !defined(BOOST_NO_ARRAY_TYPE_SPECIALIZATIONS) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_2(typename T,std::size_t N,is_array,T[N],true) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_2(typename T,std::size_t N,is_array,T const[N],true) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_2(typename T,std::size_t N,is_array,T volatile[N],true) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_2(typename T,std::size_t N,is_array,T const volatile[N],true) #if !BOOST_WORKAROUND(__BORLANDC__, < 0x600) && !defined(__IBMCPP__) && !BOOST_WORKAROUND(__DMC__, BOOST_TESTED_AT(0x840)) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_array,T[],true) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_array,T const[],true) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_array,T volatile[],true) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_array,T const volatile[],true) #endif #endif #else // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION namespace detail { using ::boost::type_traits::yes_type; using ::boost::type_traits::no_type; using ::boost::type_traits::wrap; template< typename T > T(* is_array_tester1(wrap) )(wrap); char BOOST_TT_DECL is_array_tester1(...); template< typename T> no_type is_array_tester2(T(*)(wrap)); yes_type BOOST_TT_DECL is_array_tester2(...); template< typename T > struct is_array_impl { BOOST_STATIC_CONSTANT(bool, value = sizeof(::boost::detail::is_array_tester2( ::boost::detail::is_array_tester1( ::boost::type_traits::wrap() ) )) == 1 ); }; #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_array,void,false) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_array,void const,false) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_array,void volatile,false) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_array,void const volatile,false) #endif } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_array,T,::boost::detail::is_array_impl::value) #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION } // namespace boost #include #endif // BOOST_TT_IS_ARRAY_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/decay.hpp0000644000000000000000000000007312717644140021172 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/decay.hpp0000664000372100037210000000246612717644140022032 0ustar00fransfrans00000000000000// (C) Copyright John Maddock & Thorsten Ottosen 2005. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_DECAY_HPP_INCLUDED #define BOOST_TT_DECAY_HPP_INCLUDED #include #include #include #include #include #include #include #include namespace boost { template< class T > struct decay { private: typedef BOOST_DEDUCED_TYPENAME remove_reference::type Ty; public: typedef BOOST_DEDUCED_TYPENAME mpl::eval_if< is_array, mpl::identity::type*>, BOOST_DEDUCED_TYPENAME mpl::eval_if< is_function, add_pointer, mpl::identity > >::type type; }; } // namespace boost #endif // BOOST_TT_DECAY_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/same_traits.hpp0000644000000000000000000000007412717644140022421 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/same_traits.hpp0000664000372100037210000000111212717644140023243 0ustar00fransfrans00000000000000// (C) Copyright Steve Cleary, Beman Dawes, Aleksey Gurtovoy, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. // // defines is_same: #ifndef BOOST_TT_SAME_TRAITS_HPP_INCLUDED #define BOOST_TT_SAME_TRAITS_HPP_INCLUDED #include #endif // BOOST_TT_SAME_TRAITS_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_nothrow_constructor.hpp0000644000000000000000000000007412717644140025106 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_nothrow_constructor.hpp0000664000372100037210000000374412717644140025745 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_NOTHROW_CONSTRUCTOR_HPP_INCLUDED #define BOOST_TT_HAS_NOTHROW_CONSTRUCTOR_HPP_INCLUDED #include // should be the last #include #include namespace boost { namespace detail{ template struct has_nothrow_constructor_imp{ #ifdef BOOST_HAS_NOTHROW_CONSTRUCTOR BOOST_STATIC_CONSTANT(bool, value = BOOST_HAS_NOTHROW_CONSTRUCTOR(T)); #else BOOST_STATIC_CONSTANT(bool, value = ::boost::has_trivial_constructor::value); #endif }; } BOOST_TT_AUX_BOOL_TRAIT_DEF1(has_nothrow_constructor,T,::boost::detail::has_nothrow_constructor_imp::value) BOOST_TT_AUX_BOOL_TRAIT_DEF1(has_nothrow_default_constructor,T,::boost::detail::has_nothrow_constructor_imp::value) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_nothrow_constructor,void,false) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_nothrow_constructor,void const,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_nothrow_constructor,void const volatile,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_nothrow_constructor,void volatile,false) #endif BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_nothrow_default_constructor,void,false) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_nothrow_default_constructor,void const,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_nothrow_default_constructor,void const volatile,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_nothrow_default_constructor,void volatile,false) #endif } // namespace boost #include #endif // BOOST_TT_HAS_NOTHROW_CONSTRUCTOR_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_pre_decrement.hpp0000644000000000000000000000007412717644140023555 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_pre_decrement.hpp0000664000372100037210000000242212717644140024404 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_PRE_DECREMENT_HPP_INCLUDED #define BOOST_TT_HAS_PRE_DECREMENT_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_pre_decrement #define BOOST_TT_TRAIT_OP -- #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* bool */\ ::boost::is_same< bool, Rhs_nocv >::value,\ /* void* */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::is_void< Rhs_noptr >::value\ >::value,\ /* (fundamental or pointer) and const */\ ::boost::type_traits::ice_and<\ ::boost::type_traits::ice_or<\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ ::boost::is_const< Rhs_noref >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_enum.hpp0000644000000000000000000000007412717644140021545 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/is_enum.hpp0000664000372100037210000001301112717644140022370 0ustar00fransfrans00000000000000 // (C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes, Howard // Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_ENUM_HPP_INCLUDED #define BOOST_TT_IS_ENUM_HPP_INCLUDED #include #ifndef BOOST_IS_ENUM #include #include #include #include #include #ifdef __GNUC__ #include #endif #include #if defined(BOOST_TT_HAS_CONFORMING_IS_CLASS_IMPLEMENTATION) # include # include #endif #endif // should be the last #include #include namespace boost { #ifndef BOOST_IS_ENUM #if !(defined(__BORLANDC__) && (__BORLANDC__ <= 0x551)) namespace detail { #if defined(BOOST_TT_HAS_CONFORMING_IS_CLASS_IMPLEMENTATION) template struct is_class_or_union { BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_or< ::boost::is_class::value , ::boost::is_union::value >::value)); }; #else template struct is_class_or_union { # if BOOST_WORKAROUND(BOOST_MSVC, < 1300) || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x581))// we simply can't detect it this way. BOOST_STATIC_CONSTANT(bool, value = false); # else template static ::boost::type_traits::yes_type is_class_or_union_tester(void(U::*)(void)); # if BOOST_WORKAROUND(BOOST_MSVC, == 1300) \ || BOOST_WORKAROUND(__MWERKS__, <= 0x3000) // no SFINAE static ::boost::type_traits::no_type is_class_or_union_tester(...); BOOST_STATIC_CONSTANT( bool, value = sizeof(is_class_or_union_tester(0)) == sizeof(::boost::type_traits::yes_type)); # else template static ::boost::type_traits::no_type is_class_or_union_tester(...); BOOST_STATIC_CONSTANT( bool, value = sizeof(is_class_or_union_tester(0)) == sizeof(::boost::type_traits::yes_type)); # endif # endif }; #endif struct int_convertible { int_convertible(int); }; // Don't evaluate convertibility to int_convertible unless the type // is non-arithmetic. This suppresses warnings with GCC. template struct is_enum_helper { template struct type { BOOST_STATIC_CONSTANT(bool, value = false); }; }; template <> struct is_enum_helper { template struct type : public ::boost::is_convertible::type,::boost::detail::int_convertible> { }; }; template struct is_enum_impl { //typedef ::boost::add_reference ar_t; //typedef typename ar_t::type r_type; #if defined(__GNUC__) #ifdef BOOST_TT_HAS_CONFORMING_IS_CLASS_IMPLEMENTATION // We MUST check for is_class_or_union on conforming compilers in // order to correctly deduce that noncopyable types are not enums // (dwa 2002/04/15)... BOOST_STATIC_CONSTANT(bool, selector = (::boost::type_traits::ice_or< ::boost::is_arithmetic::value , ::boost::is_reference::value , ::boost::is_function::value , is_class_or_union::value , is_array::value >::value)); #else // ...however, not checking is_class_or_union on non-conforming // compilers prevents a dependency recursion. BOOST_STATIC_CONSTANT(bool, selector = (::boost::type_traits::ice_or< ::boost::is_arithmetic::value , ::boost::is_reference::value , ::boost::is_function::value , is_array::value >::value)); #endif // BOOST_TT_HAS_CONFORMING_IS_CLASS_IMPLEMENTATION #else // !defined(__GNUC__): BOOST_STATIC_CONSTANT(bool, selector = (::boost::type_traits::ice_or< ::boost::is_arithmetic::value , ::boost::is_reference::value , is_class_or_union::value , is_array::value >::value)); #endif #if BOOST_WORKAROUND(__BORLANDC__, < 0x600) typedef ::boost::detail::is_enum_helper< ::boost::detail::is_enum_impl::selector > se_t; #else typedef ::boost::detail::is_enum_helper se_t; #endif typedef typename se_t::template type helper; BOOST_STATIC_CONSTANT(bool, value = helper::value); }; // these help on compilers with no partial specialization support: BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_enum,void,false) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_enum,void const,false) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_enum,void volatile,false) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_enum,void const volatile,false) #endif } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_enum,T,::boost::detail::is_enum_impl::value) #else // __BORLANDC__ // // buggy is_convertible prevents working // implementation of is_enum: BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_enum,T,false) #endif #else // BOOST_IS_ENUM BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_enum,T,BOOST_IS_ENUM(T)) #endif } // namespace boost #include #endif // BOOST_TT_IS_ENUM_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/detail0000644000000000000000000000007312717644140020561 xustar0030 atime=1463765202.457541607 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/detail/0000775000372100037210000000000012717644140021466 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/type_traits/detail/PaxHeaders.5405/bool_trait_def.hpp0000644000000000000000000000007312717644140024323 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/detail/bool_trait_def.hpp0000664000372100037210000001252212717644140025155 0ustar00fransfrans00000000000000 // NO INCLUDE GUARDS, THE HEADER IS INTENDED FOR MULTIPLE INCLUSION // Copyright Aleksey Gurtovoy 2002-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // $Source$ // $Date: 2011-10-09 15:28:33 -0700 (Sun, 09 Oct 2011) $ // $Revision: 74865 $ #include #include #include #include #include // // Unfortunately some libraries have started using this header without // cleaning up afterwards: so we'd better undef the macros just in case // they've been defined already.... // #ifdef BOOST_TT_AUX_BOOL_TRAIT_VALUE_DECL #undef BOOST_TT_AUX_BOOL_TRAIT_VALUE_DECL #undef BOOST_TT_AUX_BOOL_C_BASE #undef BOOST_TT_AUX_BOOL_TRAIT_DEF1 #undef BOOST_TT_AUX_BOOL_TRAIT_DEF2 #undef BOOST_TT_AUX_BOOL_TRAIT_SPEC1 #undef BOOST_TT_AUX_BOOL_TRAIT_SPEC2 #undef BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1 #undef BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC2 #undef BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1 #undef BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_2 #undef BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC2_1 #undef BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC2_2 #undef BOOST_TT_AUX_BOOL_TRAIT_IMPL_PARTIAL_SPEC2_1 #undef BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1 #endif #if defined(__SUNPRO_CC) && (__SUNPRO_CC < 0x570) # define BOOST_TT_AUX_BOOL_TRAIT_VALUE_DECL(C) \ typedef ::boost::integral_constant type; \ enum { value = type::value }; \ /**/ # define BOOST_TT_AUX_BOOL_C_BASE(C) #elif defined(BOOST_MSVC) && BOOST_MSVC < 1300 # define BOOST_TT_AUX_BOOL_TRAIT_VALUE_DECL(C) \ typedef ::boost::integral_constant base_; \ using base_::value; \ /**/ #endif #ifndef BOOST_TT_AUX_BOOL_TRAIT_VALUE_DECL # define BOOST_TT_AUX_BOOL_TRAIT_VALUE_DECL(C) /**/ #endif #ifndef BOOST_TT_AUX_BOOL_C_BASE # define BOOST_TT_AUX_BOOL_C_BASE(C) : public ::boost::integral_constant #endif #define BOOST_TT_AUX_BOOL_TRAIT_DEF1(trait,T,C) \ template< typename T > struct trait \ BOOST_TT_AUX_BOOL_C_BASE(C) \ { \ public:\ BOOST_TT_AUX_BOOL_TRAIT_VALUE_DECL(C) \ BOOST_MPL_AUX_LAMBDA_SUPPORT(1,trait,(T)) \ }; \ \ BOOST_TT_AUX_TEMPLATE_ARITY_SPEC(1,trait) \ /**/ #define BOOST_TT_AUX_BOOL_TRAIT_DEF2(trait,T1,T2,C) \ template< typename T1, typename T2 > struct trait \ BOOST_TT_AUX_BOOL_C_BASE(C) \ { \ public:\ BOOST_TT_AUX_BOOL_TRAIT_VALUE_DECL(C) \ BOOST_MPL_AUX_LAMBDA_SUPPORT(2,trait,(T1,T2)) \ }; \ \ BOOST_TT_AUX_TEMPLATE_ARITY_SPEC(2,trait) \ /**/ #define BOOST_TT_AUX_BOOL_TRAIT_DEF3(trait,T1,T2,T3,C) \ template< typename T1, typename T2, typename T3 > struct trait \ BOOST_TT_AUX_BOOL_C_BASE(C) \ { \ public:\ BOOST_TT_AUX_BOOL_TRAIT_VALUE_DECL(C) \ BOOST_MPL_AUX_LAMBDA_SUPPORT(3,trait,(T1,T2,T3)) \ }; \ \ BOOST_TT_AUX_TEMPLATE_ARITY_SPEC(3,trait) \ /**/ #define BOOST_TT_AUX_BOOL_TRAIT_SPEC1(trait,sp,C) \ template<> struct trait< sp > \ BOOST_TT_AUX_BOOL_C_BASE(C) \ { \ public:\ BOOST_TT_AUX_BOOL_TRAIT_VALUE_DECL(C) \ BOOST_MPL_AUX_LAMBDA_SUPPORT_SPEC(1,trait,(sp)) \ }; \ /**/ #define BOOST_TT_AUX_BOOL_TRAIT_SPEC2(trait,sp1,sp2,C) \ template<> struct trait< sp1,sp2 > \ BOOST_TT_AUX_BOOL_C_BASE(C) \ { \ public:\ BOOST_TT_AUX_BOOL_TRAIT_VALUE_DECL(C) \ BOOST_MPL_AUX_LAMBDA_SUPPORT_SPEC(2,trait,(sp1,sp2)) \ }; \ /**/ #define BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(trait,sp,C) \ template<> struct trait##_impl< sp > \ { \ public:\ BOOST_STATIC_CONSTANT(bool, value = (C)); \ }; \ /**/ #define BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC2(trait,sp1,sp2,C) \ template<> struct trait##_impl< sp1,sp2 > \ { \ public:\ BOOST_STATIC_CONSTANT(bool, value = (C)); \ }; \ /**/ #define BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(param,trait,sp,C) \ template< param > struct trait< sp > \ BOOST_TT_AUX_BOOL_C_BASE(C) \ { \ public:\ BOOST_TT_AUX_BOOL_TRAIT_VALUE_DECL(C) \ }; \ /**/ #define BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_2(param1,param2,trait,sp,C) \ template< param1, param2 > struct trait< sp > \ BOOST_TT_AUX_BOOL_C_BASE(C) \ { \ public:\ BOOST_TT_AUX_BOOL_TRAIT_VALUE_DECL(C) \ }; \ /**/ #define BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC2_1(param,trait,sp1,sp2,C) \ template< param > struct trait< sp1,sp2 > \ BOOST_TT_AUX_BOOL_C_BASE(C) \ { \ public:\ BOOST_TT_AUX_BOOL_TRAIT_VALUE_DECL(C) \ BOOST_MPL_AUX_LAMBDA_SUPPORT_SPEC(2,trait,(sp1,sp2)) \ }; \ /**/ #define BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC2_2(param1,param2,trait,sp1,sp2,C) \ template< param1, param2 > struct trait< sp1,sp2 > \ BOOST_TT_AUX_BOOL_C_BASE(C) \ { \ public:\ BOOST_TT_AUX_BOOL_TRAIT_VALUE_DECL(C) \ }; \ /**/ #define BOOST_TT_AUX_BOOL_TRAIT_IMPL_PARTIAL_SPEC2_1(param,trait,sp1,sp2,C) \ template< param > struct trait##_impl< sp1,sp2 > \ { \ public:\ BOOST_STATIC_CONSTANT(bool, value = (C)); \ }; \ /**/ #ifndef BOOST_NO_CV_SPECIALIZATIONS # define BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(trait,sp,value) \ BOOST_TT_AUX_BOOL_TRAIT_SPEC1(trait,sp,value) \ BOOST_TT_AUX_BOOL_TRAIT_SPEC1(trait,sp const,value) \ BOOST_TT_AUX_BOOL_TRAIT_SPEC1(trait,sp volatile,value) \ BOOST_TT_AUX_BOOL_TRAIT_SPEC1(trait,sp const volatile,value) \ /**/ #else # define BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(trait,sp,value) \ BOOST_TT_AUX_BOOL_TRAIT_SPEC1(trait,sp,value) \ /**/ #endif madp-0.4/src/boost/boost/type_traits/detail/PaxHeaders.5405/is_mem_fun_pointer_impl.hpp0000644000000000000000000000007312717644140026251 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/detail/is_mem_fun_pointer_impl.hpp0000664000372100037210000023010212717644140027077 0ustar00fransfrans00000000000000 // (C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes, // Aleksey Gurtovoy, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #if !defined(BOOST_PP_IS_ITERATING) ///// header body #ifndef BOOST_TT_DETAIL_IS_MEM_FUN_POINTER_IMPL_HPP_INCLUDED #define BOOST_TT_DETAIL_IS_MEM_FUN_POINTER_IMPL_HPP_INCLUDED #include #if defined(BOOST_TT_PREPROCESSING_MODE) # include # include # include #endif namespace boost { namespace type_traits { template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = false); }; #if !defined(BOOST_TT_PREPROCESSING_MODE) // pre-processed code, don't edit, try GNU cpp with // cpp -I../../../ -DBOOST_TT_PREPROCESSING_MODE -x c++ -P filename template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #endif #else #undef BOOST_STATIC_CONSTANT #define BOOST_PP_ITERATION_PARAMS_1 \ (3, (0, 25, "boost/type_traits/detail/is_mem_fun_pointer_impl.hpp")) #include BOOST_PP_ITERATE() #endif // BOOST_TT_PREPROCESSING_MODE } // namespace type_traits } // namespace boost #endif // BOOST_TT_DETAIL_IS_MEM_FUN_POINTER_IMPL_HPP_INCLUDED ///// iteration #else #define BOOST_PP_COUNTER BOOST_PP_FRAME_ITERATION(1) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; @#ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; @#endif @#if !defined(BOOST_TT_NO_CV_FUNC_TEST) template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; @#ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; template struct is_mem_fun_pointer_impl { BOOST_STATIC_CONSTANT(bool, value = true); }; @#endif @#endif #undef BOOST_PP_COUNTER #endif // BOOST_PP_IS_ITERATING madp-0.4/src/boost/boost/type_traits/detail/PaxHeaders.5405/type_trait_undef.hpp0000644000000000000000000000007312717644140024714 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/detail/type_trait_undef.hpp0000664000372100037210000000116112717644140025543 0ustar00fransfrans00000000000000 // NO INCLUDE GUARDS, THE HEADER IS INTENDED FOR MULTIPLE INCLUSION // Copyright Aleksey Gurtovoy 2002-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // $Source$ // $Date: 2004-09-02 11:41:37 -0400 (Thu, 02 Sep 2004) $ // $Revision: 24874 $ #undef BOOST_TT_AUX_TYPE_TRAIT_DEF1 #undef BOOST_TT_AUX_TYPE_TRAIT_SPEC1 #undef BOOST_TT_AUX_TYPE_TRAIT_IMPL_SPEC1 #undef BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1 #undef BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_2 #undef BOOST_TT_AUX_TYPE_TRAIT_IMPL_PARTIAL_SPEC1_1 madp-0.4/src/boost/boost/type_traits/detail/PaxHeaders.5405/has_postfix_operator.hpp0000644000000000000000000000007312717644140025611 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/detail/has_postfix_operator.hpp0000664000372100037210000001720212717644140026443 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron, Robert Stewart, Steven Watanabe & Roman Perepelitsa. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #include #include #include #include #include #include #include #include #include #include #include // should be the last #include #include // avoid warnings #if defined(__GNUC__) && ((__GNUC__==3 && __GNUC_MINOR__>=1) || (__GNUC__>3)) # pragma GCC system_header #elif defined(BOOST_MSVC) # pragma warning ( push ) # pragma warning ( disable : 4244 4913 ) #endif namespace boost { namespace detail { // This namespace ensures that argument-dependent name lookup does not mess things up. namespace BOOST_JOIN(BOOST_TT_TRAIT_NAME,_impl) { // 1. a function to have an instance of type T without requiring T to be default // constructible template T &make(); // 2. we provide our operator definition for types that do not have one already // a type returned from operator BOOST_TT_TRAIT_OP when no such operator is // found in the type's own namespace (our own operator is used) so that we have // a means to know that our operator was used struct no_operator { }; // this class allows implicit conversions and makes the following operator // definition less-preferred than any other such operators that might be found // via argument-dependent name lookup struct any { template any(T const&); }; // when operator BOOST_TT_TRAIT_OP is not available, this one is used no_operator operator BOOST_TT_TRAIT_OP (const any&, int); // 3. checks if the operator returns void or not // conditions: Lhs!=void // we first redefine "operator," so that we have no compilation error if // operator BOOST_TT_TRAIT_OP returns void and we can use the return type of // (lhs BOOST_TT_TRAIT_OP, returns_void_t()) to deduce if // operator BOOST_TT_TRAIT_OP returns void or not: // - operator BOOST_TT_TRAIT_OP returns void -> (lhs BOOST_TT_TRAIT_OP, returns_void_t()) returns returns_void_t // - operator BOOST_TT_TRAIT_OP returns !=void -> (lhs BOOST_TT_TRAIT_OP, returns_void_t()) returns int struct returns_void_t { }; template int operator,(const T&, returns_void_t); template int operator,(const volatile T&, returns_void_t); // this intermediate trait has member value of type bool: // - value==true -> operator BOOST_TT_TRAIT_OP returns void // - value==false -> operator BOOST_TT_TRAIT_OP does not return void template < typename Lhs > struct operator_returns_void { // overloads of function returns_void make the difference // yes_type and no_type have different size by construction static ::boost::type_traits::yes_type returns_void(returns_void_t); static ::boost::type_traits::no_type returns_void(int); BOOST_STATIC_CONSTANT(bool, value = (sizeof(::boost::type_traits::yes_type)==sizeof(returns_void((make() BOOST_TT_TRAIT_OP,returns_void_t()))))); }; // 4. checks if the return type is Ret or Ret==dont_care // conditions: Lhs!=void struct dont_care { }; template < typename Lhs, typename Ret, bool Returns_void > struct operator_returns_Ret; template < typename Lhs > struct operator_returns_Ret < Lhs, dont_care, true > { BOOST_STATIC_CONSTANT(bool, value = true); }; template < typename Lhs > struct operator_returns_Ret < Lhs, dont_care, false > { BOOST_STATIC_CONSTANT(bool, value = true); }; template < typename Lhs > struct operator_returns_Ret < Lhs, void, true > { BOOST_STATIC_CONSTANT(bool, value = true); }; template < typename Lhs > struct operator_returns_Ret < Lhs, void, false > { BOOST_STATIC_CONSTANT(bool, value = false); }; template < typename Lhs, typename Ret > struct operator_returns_Ret < Lhs, Ret, true > { BOOST_STATIC_CONSTANT(bool, value = false); }; // otherwise checks if it is convertible to Ret using the sizeof trick // based on overload resolution // condition: Ret!=void and Ret!=dont_care and the operator does not return void template < typename Lhs, typename Ret > struct operator_returns_Ret < Lhs, Ret, false > { static ::boost::type_traits::yes_type is_convertible_to_Ret(Ret); // this version is preferred for types convertible to Ret static ::boost::type_traits::no_type is_convertible_to_Ret(...); // this version is used otherwise BOOST_STATIC_CONSTANT(bool, value = (sizeof(is_convertible_to_Ret(make() BOOST_TT_TRAIT_OP))==sizeof(::boost::type_traits::yes_type))); }; // 5. checks for operator existence // condition: Lhs!=void // checks if our definition of operator BOOST_TT_TRAIT_OP is used or an other // existing one; // this is done with redefinition of "operator," that returns no_operator or has_operator struct has_operator { }; no_operator operator,(no_operator, has_operator); template < typename Lhs > struct operator_exists { static ::boost::type_traits::yes_type check(has_operator); // this version is preferred when operator exists static ::boost::type_traits::no_type check(no_operator); // this version is used otherwise BOOST_STATIC_CONSTANT(bool, value = (sizeof(check(((make() BOOST_TT_TRAIT_OP),make())))==sizeof(::boost::type_traits::yes_type))); }; // 6. main trait: to avoid any compilation error, this class behaves // differently when operator BOOST_TT_TRAIT_OP(Lhs) is forbidden by the // standard. // Forbidden_if is a bool that is: // - true when the operator BOOST_TT_TRAIT_OP(Lhs) is forbidden by the standard // (would yield compilation error if used) // - false otherwise template < typename Lhs, typename Ret, bool Forbidden_if > struct trait_impl1; template < typename Lhs, typename Ret > struct trait_impl1 < Lhs, Ret, true > { BOOST_STATIC_CONSTANT(bool, value = false); }; template < typename Lhs, typename Ret > struct trait_impl1 < Lhs, Ret, false > { BOOST_STATIC_CONSTANT(bool, value = ( ::boost::type_traits::ice_and< operator_exists < Lhs >::value, operator_returns_Ret < Lhs, Ret, operator_returns_void < Lhs >::value >::value >::value ) ); }; // specialization needs to be declared for the special void case template < typename Ret > struct trait_impl1 < void, Ret, false > { BOOST_STATIC_CONSTANT(bool, value = false); }; // defines some typedef for convenience template < typename Lhs, typename Ret > struct trait_impl { typedef typename ::boost::remove_reference::type Lhs_noref; typedef typename ::boost::remove_cv::type Lhs_nocv; typedef typename ::boost::remove_cv< typename ::boost::remove_reference< typename ::boost::remove_pointer::type >::type >::type Lhs_noptr; BOOST_STATIC_CONSTANT(bool, value = (trait_impl1 < Lhs_noref, Ret, BOOST_TT_FORBIDDEN_IF >::value)); }; } // namespace impl } // namespace detail // this is the accessible definition of the trait to end user BOOST_TT_AUX_BOOL_TRAIT_DEF2(BOOST_TT_TRAIT_NAME, Lhs, Ret=::boost::detail::BOOST_JOIN(BOOST_TT_TRAIT_NAME,_impl)::dont_care, (::boost::detail::BOOST_JOIN(BOOST_TT_TRAIT_NAME,_impl)::trait_impl< Lhs, Ret >::value)) } // namespace boost #if defined(BOOST_MSVC) # pragma warning ( pop ) #endif #include madp-0.4/src/boost/boost/type_traits/detail/PaxHeaders.5405/size_t_trait_undef.hpp0000644000000000000000000000007312717644140025230 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/detail/size_t_trait_undef.hpp0000664000372100037210000000075212717644140026064 0ustar00fransfrans00000000000000 // NO INCLUDE GUARDS, THE HEADER IS INTENDED FOR MULTIPLE INCLUSION // Copyright Aleksey Gurtovoy 2002-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // $Source$ // $Date: 2004-09-02 11:41:37 -0400 (Thu, 02 Sep 2004) $ // $Revision: 24874 $ #undef BOOST_TT_AUX_SIZE_T_TRAIT_DEF1 #undef BOOST_TT_AUX_SIZE_T_TRAIT_SPEC1 #undef BOOST_TT_AUX_SIZE_T_TRAIT_PARTIAL_SPEC1_1 madp-0.4/src/boost/boost/type_traits/detail/PaxHeaders.5405/has_binary_operator.hpp0000644000000000000000000000007312717644140025401 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/detail/has_binary_operator.hpp0000664000372100037210000002271012717644140026233 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron, Robert Stewart, Steven Watanabe & Roman Perepelitsa. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #include #include #include #include #include #include #include #include #include #include #include #include #include #include // should be the last #include #include // cannot include this header without getting warnings of the kind: // gcc: // warning: value computed is not used // warning: comparison between signed and unsigned integer expressions // msvc: // warning C4018: '<' : signed/unsigned mismatch // warning C4244: '+=' : conversion from 'double' to 'char', possible loss of data // warning C4547: '*' : operator before comma has no effect; expected operator with side-effect // warning C4800: 'int' : forcing value to bool 'true' or 'false' (performance warning) // warning C4804: '<' : unsafe use of type 'bool' in operation // warning C4805: '==' : unsafe mix of type 'bool' and type 'char' in operation // cannot find another implementation -> declared as system header to suppress these warnings. #if defined(__GNUC__) && ((__GNUC__==3 && __GNUC_MINOR__>=1) || (__GNUC__>3)) # pragma GCC system_header #elif defined(BOOST_MSVC) # pragma warning ( push ) # pragma warning ( disable : 4018 4244 4547 4800 4804 4805 4913 ) #endif namespace boost { namespace detail { // This namespace ensures that argument-dependent name lookup does not mess things up. namespace BOOST_JOIN(BOOST_TT_TRAIT_NAME,_impl) { // 1. a function to have an instance of type T without requiring T to be default // constructible template T &make(); // 2. we provide our operator definition for types that do not have one already // a type returned from operator BOOST_TT_TRAIT_OP when no such operator is // found in the type's own namespace (our own operator is used) so that we have // a means to know that our operator was used struct no_operator { }; // this class allows implicit conversions and makes the following operator // definition less-preferred than any other such operators that might be found // via argument-dependent name lookup struct any { template any(T const&); }; // when operator BOOST_TT_TRAIT_OP is not available, this one is used no_operator operator BOOST_TT_TRAIT_OP (const any&, const any&); // 3. checks if the operator returns void or not // conditions: Lhs!=void and Rhs!=void // we first redefine "operator," so that we have no compilation error if // operator BOOST_TT_TRAIT_OP returns void and we can use the return type of // (lhs BOOST_TT_TRAIT_OP rhs, returns_void_t()) to deduce if // operator BOOST_TT_TRAIT_OP returns void or not: // - operator BOOST_TT_TRAIT_OP returns void -> (lhs BOOST_TT_TRAIT_OP rhs, returns_void_t()) returns returns_void_t // - operator BOOST_TT_TRAIT_OP returns !=void -> (lhs BOOST_TT_TRAIT_OP rhs, returns_void_t()) returns int struct returns_void_t { }; template int operator,(const T&, returns_void_t); template int operator,(const volatile T&, returns_void_t); // this intermediate trait has member value of type bool: // - value==true -> operator BOOST_TT_TRAIT_OP returns void // - value==false -> operator BOOST_TT_TRAIT_OP does not return void template < typename Lhs, typename Rhs > struct operator_returns_void { // overloads of function returns_void make the difference // yes_type and no_type have different size by construction static ::boost::type_traits::yes_type returns_void(returns_void_t); static ::boost::type_traits::no_type returns_void(int); BOOST_STATIC_CONSTANT(bool, value = (sizeof(::boost::type_traits::yes_type)==sizeof(returns_void((make() BOOST_TT_TRAIT_OP make(),returns_void_t()))))); }; // 4. checks if the return type is Ret or Ret==dont_care // conditions: Lhs!=void and Rhs!=void struct dont_care { }; template < typename Lhs, typename Rhs, typename Ret, bool Returns_void > struct operator_returns_Ret; template < typename Lhs, typename Rhs > struct operator_returns_Ret < Lhs, Rhs, dont_care, true > { BOOST_STATIC_CONSTANT(bool, value = true); }; template < typename Lhs, typename Rhs > struct operator_returns_Ret < Lhs, Rhs, dont_care, false > { BOOST_STATIC_CONSTANT(bool, value = true); }; template < typename Lhs, typename Rhs > struct operator_returns_Ret < Lhs, Rhs, void, true > { BOOST_STATIC_CONSTANT(bool, value = true); }; template < typename Lhs, typename Rhs > struct operator_returns_Ret < Lhs, Rhs, void, false > { BOOST_STATIC_CONSTANT(bool, value = false); }; template < typename Lhs, typename Rhs, typename Ret > struct operator_returns_Ret < Lhs, Rhs, Ret, true > { BOOST_STATIC_CONSTANT(bool, value = false); }; // otherwise checks if it is convertible to Ret using the sizeof trick // based on overload resolution // condition: Ret!=void and Ret!=dont_care and the operator does not return void template < typename Lhs, typename Rhs, typename Ret > struct operator_returns_Ret < Lhs, Rhs, Ret, false > { static ::boost::type_traits::yes_type is_convertible_to_Ret(Ret); // this version is preferred for types convertible to Ret static ::boost::type_traits::no_type is_convertible_to_Ret(...); // this version is used otherwise BOOST_STATIC_CONSTANT(bool, value = (sizeof(is_convertible_to_Ret(make() BOOST_TT_TRAIT_OP make()))==sizeof(::boost::type_traits::yes_type))); }; // 5. checks for operator existence // condition: Lhs!=void and Rhs!=void // checks if our definition of operator BOOST_TT_TRAIT_OP is used or an other // existing one; // this is done with redefinition of "operator," that returns no_operator or has_operator struct has_operator { }; no_operator operator,(no_operator, has_operator); template < typename Lhs, typename Rhs > struct operator_exists { static ::boost::type_traits::yes_type check(has_operator); // this version is preferred when operator exists static ::boost::type_traits::no_type check(no_operator); // this version is used otherwise BOOST_STATIC_CONSTANT(bool, value = (sizeof(check(((make() BOOST_TT_TRAIT_OP make()),make())))==sizeof(::boost::type_traits::yes_type))); }; // 6. main trait: to avoid any compilation error, this class behaves // differently when operator BOOST_TT_TRAIT_OP(Lhs, Rhs) is forbidden by the // standard. // Forbidden_if is a bool that is: // - true when the operator BOOST_TT_TRAIT_OP(Lhs, Rhs) is forbidden by the standard // (would yield compilation error if used) // - false otherwise template < typename Lhs, typename Rhs, typename Ret, bool Forbidden_if > struct trait_impl1; template < typename Lhs, typename Rhs, typename Ret > struct trait_impl1 < Lhs, Rhs, Ret, true > { BOOST_STATIC_CONSTANT(bool, value = false); }; template < typename Lhs, typename Rhs, typename Ret > struct trait_impl1 < Lhs, Rhs, Ret, false > { BOOST_STATIC_CONSTANT(bool, value = ( ::boost::type_traits::ice_and< operator_exists < Lhs, Rhs >::value, operator_returns_Ret < Lhs, Rhs, Ret, operator_returns_void < Lhs, Rhs >::value >::value >::value ) ); }; // some specializations needs to be declared for the special void case template < typename Rhs, typename Ret > struct trait_impl1 < void, Rhs, Ret, false > { BOOST_STATIC_CONSTANT(bool, value = false); }; template < typename Lhs, typename Ret > struct trait_impl1 < Lhs, void, Ret, false > { BOOST_STATIC_CONSTANT(bool, value = false); }; template < typename Ret > struct trait_impl1 < void, void, Ret, false > { BOOST_STATIC_CONSTANT(bool, value = false); }; // defines some typedef for convenience template < typename Lhs, typename Rhs, typename Ret > struct trait_impl { typedef typename ::boost::remove_reference::type Lhs_noref; typedef typename ::boost::remove_reference::type Rhs_noref; typedef typename ::boost::remove_cv::type Lhs_nocv; typedef typename ::boost::remove_cv::type Rhs_nocv; typedef typename ::boost::remove_cv< typename ::boost::remove_reference< typename ::boost::remove_pointer::type >::type >::type Lhs_noptr; typedef typename ::boost::remove_cv< typename ::boost::remove_reference< typename ::boost::remove_pointer::type >::type >::type Rhs_noptr; BOOST_STATIC_CONSTANT(bool, value = (trait_impl1 < Lhs_noref, Rhs_noref, Ret, BOOST_TT_FORBIDDEN_IF >::value)); }; } // namespace impl } // namespace detail // this is the accessible definition of the trait to end user BOOST_TT_AUX_BOOL_TRAIT_DEF3(BOOST_TT_TRAIT_NAME, Lhs, Rhs=Lhs, Ret=::boost::detail::BOOST_JOIN(BOOST_TT_TRAIT_NAME,_impl)::dont_care, (::boost::detail::BOOST_JOIN(BOOST_TT_TRAIT_NAME,_impl)::trait_impl < Lhs, Rhs, Ret >::value)) } // namespace boost #if defined(BOOST_MSVC) # pragma warning ( pop ) #endif #include madp-0.4/src/boost/boost/type_traits/detail/PaxHeaders.5405/cv_traits_impl.hpp0000644000000000000000000000007312717644140024366 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/detail/cv_traits_impl.hpp0000664000372100037210000000522412717644140025221 0ustar00fransfrans00000000000000 // (C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes, Howard // Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_DETAIL_CV_TRAITS_IMPL_HPP_INCLUDED #define BOOST_TT_DETAIL_CV_TRAITS_IMPL_HPP_INCLUDED #include #include #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION // implementation helper: #if !(BOOST_WORKAROUND(__GNUC__,== 3) && BOOST_WORKAROUND(__GNUC_MINOR__, <= 2)) namespace boost { namespace detail { #else #include namespace boost { namespace type_traits { namespace gcc8503 { #endif template struct cv_traits_imp {}; template struct cv_traits_imp { BOOST_STATIC_CONSTANT(bool, is_const = false); BOOST_STATIC_CONSTANT(bool, is_volatile = false); typedef T unqualified_type; }; template struct cv_traits_imp { BOOST_STATIC_CONSTANT(bool, is_const = true); BOOST_STATIC_CONSTANT(bool, is_volatile = false); typedef T unqualified_type; }; template struct cv_traits_imp { BOOST_STATIC_CONSTANT(bool, is_const = false); BOOST_STATIC_CONSTANT(bool, is_volatile = true); typedef T unqualified_type; }; template struct cv_traits_imp { BOOST_STATIC_CONSTANT(bool, is_const = true); BOOST_STATIC_CONSTANT(bool, is_volatile = true); typedef T unqualified_type; }; #if BOOST_WORKAROUND(__GNUC__,== 3) && BOOST_WORKAROUND(__GNUC_MINOR__, <= 2) // We have to exclude function pointers // (see http://gcc.gnu.org/bugzilla/show_bug.cgi?8503) yes_type mini_funcptr_tester(...); no_type mini_funcptr_tester(const volatile void*); } // namespace gcc8503 } // namespace type_traits namespace detail { // Use the implementation above for non function pointers template struct cv_traits_imp : public ::boost::type_traits::gcc8503::cv_traits_imp { }; // Functions are never cv-qualified template struct cv_traits_imp { BOOST_STATIC_CONSTANT(bool, is_const = false); BOOST_STATIC_CONSTANT(bool, is_volatile = false); typedef T unqualified_type; }; #endif } // namespace detail } // namespace boost #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION #endif // BOOST_TT_DETAIL_CV_TRAITS_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/detail/PaxHeaders.5405/has_prefix_operator.hpp0000644000000000000000000000007312717644140025412 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/detail/has_prefix_operator.hpp0000664000372100037210000002014712717644140026246 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron, Robert Stewart, Steven Watanabe & Roman Perepelitsa. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #include #include #include #include #include #include #include #include #include #include #include #include // should be the last #include #include // cannot include this header without getting warnings of the kind: // gcc: // warning: value computed is not used // warning: comparison between signed and unsigned integer expressions // msvc: // warning C4146: unary minus operator applied to unsigned type, result still unsigned // warning C4804: '-' : unsafe use of type 'bool' in operation // cannot find another implementation -> declared as system header to suppress these warnings. #if defined(__GNUC__) && ((__GNUC__==3 && __GNUC_MINOR__>=1) || (__GNUC__>3)) # pragma GCC system_header #elif defined(BOOST_MSVC) # pragma warning ( push ) # pragma warning ( disable : 4146 4804 4913 4244 ) #endif namespace boost { namespace detail { // This namespace ensures that argument-dependent name lookup does not mess things up. namespace BOOST_JOIN(BOOST_TT_TRAIT_NAME,_impl) { // 1. a function to have an instance of type T without requiring T to be default // constructible template T &make(); // 2. we provide our operator definition for types that do not have one already // a type returned from operator BOOST_TT_TRAIT_OP when no such operator is // found in the type's own namespace (our own operator is used) so that we have // a means to know that our operator was used struct no_operator { }; // this class allows implicit conversions and makes the following operator // definition less-preferred than any other such operators that might be found // via argument-dependent name lookup struct any { template any(T const&); }; // when operator BOOST_TT_TRAIT_OP is not available, this one is used no_operator operator BOOST_TT_TRAIT_OP (const any&); // 3. checks if the operator returns void or not // conditions: Rhs!=void // we first redefine "operator," so that we have no compilation error if // operator BOOST_TT_TRAIT_OP returns void and we can use the return type of // (BOOST_TT_TRAIT_OP rhs, returns_void_t()) to deduce if // operator BOOST_TT_TRAIT_OP returns void or not: // - operator BOOST_TT_TRAIT_OP returns void -> (BOOST_TT_TRAIT_OP rhs, returns_void_t()) returns returns_void_t // - operator BOOST_TT_TRAIT_OP returns !=void -> (BOOST_TT_TRAIT_OP rhs, returns_void_t()) returns int struct returns_void_t { }; template int operator,(const T&, returns_void_t); template int operator,(const volatile T&, returns_void_t); // this intermediate trait has member value of type bool: // - value==true -> operator BOOST_TT_TRAIT_OP returns void // - value==false -> operator BOOST_TT_TRAIT_OP does not return void template < typename Rhs > struct operator_returns_void { // overloads of function returns_void make the difference // yes_type and no_type have different size by construction static ::boost::type_traits::yes_type returns_void(returns_void_t); static ::boost::type_traits::no_type returns_void(int); BOOST_STATIC_CONSTANT(bool, value = (sizeof(::boost::type_traits::yes_type)==sizeof(returns_void((BOOST_TT_TRAIT_OP make(),returns_void_t()))))); }; // 4. checks if the return type is Ret or Ret==dont_care // conditions: Rhs!=void struct dont_care { }; template < typename Rhs, typename Ret, bool Returns_void > struct operator_returns_Ret; template < typename Rhs > struct operator_returns_Ret < Rhs, dont_care, true > { BOOST_STATIC_CONSTANT(bool, value = true); }; template < typename Rhs > struct operator_returns_Ret < Rhs, dont_care, false > { BOOST_STATIC_CONSTANT(bool, value = true); }; template < typename Rhs > struct operator_returns_Ret < Rhs, void, true > { BOOST_STATIC_CONSTANT(bool, value = true); }; template < typename Rhs > struct operator_returns_Ret < Rhs, void, false > { BOOST_STATIC_CONSTANT(bool, value = false); }; template < typename Rhs, typename Ret > struct operator_returns_Ret < Rhs, Ret, true > { BOOST_STATIC_CONSTANT(bool, value = false); }; // otherwise checks if it is convertible to Ret using the sizeof trick // based on overload resolution // condition: Ret!=void and Ret!=dont_care and the operator does not return void template < typename Rhs, typename Ret > struct operator_returns_Ret < Rhs, Ret, false > { static ::boost::type_traits::yes_type is_convertible_to_Ret(Ret); // this version is preferred for types convertible to Ret static ::boost::type_traits::no_type is_convertible_to_Ret(...); // this version is used otherwise BOOST_STATIC_CONSTANT(bool, value = (sizeof(is_convertible_to_Ret(BOOST_TT_TRAIT_OP make()))==sizeof(::boost::type_traits::yes_type))); }; // 5. checks for operator existence // condition: Rhs!=void // checks if our definition of operator BOOST_TT_TRAIT_OP is used or an other // existing one; // this is done with redefinition of "operator," that returns no_operator or has_operator struct has_operator { }; no_operator operator,(no_operator, has_operator); template < typename Rhs > struct operator_exists { static ::boost::type_traits::yes_type check(has_operator); // this version is preferred when operator exists static ::boost::type_traits::no_type check(no_operator); // this version is used otherwise BOOST_STATIC_CONSTANT(bool, value = (sizeof(check(((BOOST_TT_TRAIT_OP make()),make())))==sizeof(::boost::type_traits::yes_type))); }; // 6. main trait: to avoid any compilation error, this class behaves // differently when operator BOOST_TT_TRAIT_OP(Rhs) is forbidden by the // standard. // Forbidden_if is a bool that is: // - true when the operator BOOST_TT_TRAIT_OP(Rhs) is forbidden by the standard // (would yield compilation error if used) // - false otherwise template < typename Rhs, typename Ret, bool Forbidden_if > struct trait_impl1; template < typename Rhs, typename Ret > struct trait_impl1 < Rhs, Ret, true > { BOOST_STATIC_CONSTANT(bool, value = false); }; template < typename Rhs, typename Ret > struct trait_impl1 < Rhs, Ret, false > { BOOST_STATIC_CONSTANT(bool, value = ( ::boost::type_traits::ice_and< operator_exists < Rhs >::value, operator_returns_Ret < Rhs, Ret, operator_returns_void < Rhs >::value >::value >::value ) ); }; // specialization needs to be declared for the special void case template < typename Ret > struct trait_impl1 < void, Ret, false > { BOOST_STATIC_CONSTANT(bool, value = false); }; // defines some typedef for convenience template < typename Rhs, typename Ret > struct trait_impl { typedef typename ::boost::remove_reference::type Rhs_noref; typedef typename ::boost::remove_cv::type Rhs_nocv; typedef typename ::boost::remove_cv< typename ::boost::remove_reference< typename ::boost::remove_pointer::type >::type >::type Rhs_noptr; BOOST_STATIC_CONSTANT(bool, value = (trait_impl1 < Rhs_noref, Ret, BOOST_TT_FORBIDDEN_IF >::value)); }; } // namespace impl } // namespace detail // this is the accessible definition of the trait to end user BOOST_TT_AUX_BOOL_TRAIT_DEF2(BOOST_TT_TRAIT_NAME, Rhs, Ret=::boost::detail::BOOST_JOIN(BOOST_TT_TRAIT_NAME,_impl)::dont_care, (::boost::detail::BOOST_JOIN(BOOST_TT_TRAIT_NAME,_impl)::trait_impl < Rhs, Ret >::value)) } // namespace boost #if defined(BOOST_MSVC) # pragma warning ( pop ) #endif #include madp-0.4/src/boost/boost/type_traits/detail/PaxHeaders.5405/type_trait_def.hpp0000644000000000000000000000007312717644140024351 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/detail/type_trait_def.hpp0000664000372100037210000000305212717644140025201 0ustar00fransfrans00000000000000 // NO INCLUDE GUARDS, THE HEADER IS INTENDED FOR MULTIPLE INCLUSION // Copyright Aleksey Gurtovoy 2002-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // $Source$ // $Date: 2011-04-25 05:26:48 -0700 (Mon, 25 Apr 2011) $ // $Revision: 71481 $ #include #include #define BOOST_TT_AUX_TYPE_TRAIT_DEF1(trait,T,result) \ template< typename T > struct trait \ { \ public:\ typedef result type; \ BOOST_MPL_AUX_LAMBDA_SUPPORT(1,trait,(T)) \ }; \ \ BOOST_TT_AUX_TEMPLATE_ARITY_SPEC(1,trait) \ /**/ #define BOOST_TT_AUX_TYPE_TRAIT_SPEC1(trait,spec,result) \ template<> struct trait \ { \ public:\ typedef result type; \ BOOST_MPL_AUX_LAMBDA_SUPPORT_SPEC(1,trait,(spec)) \ }; \ /**/ #define BOOST_TT_AUX_TYPE_TRAIT_IMPL_SPEC1(trait,spec,result) \ template<> struct trait##_impl \ { \ public:\ typedef result type; \ }; \ /**/ #define BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(param,trait,spec,result) \ template< param > struct trait \ { \ public:\ typedef result type; \ }; \ /**/ #define BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_2(param1,param2,trait,spec,result) \ template< param1, param2 > struct trait \ { \ public:\ typedef result; \ }; \ /**/ #define BOOST_TT_AUX_TYPE_TRAIT_IMPL_PARTIAL_SPEC1_1(param,trait,spec,result) \ template< param > struct trait##_impl \ { \ public:\ typedef result type; \ }; \ /**/ madp-0.4/src/boost/boost/type_traits/detail/PaxHeaders.5405/ice_and.hpp0000644000000000000000000000007312717644140022731 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/detail/ice_and.hpp0000664000372100037210000000174412717644140023567 0ustar00fransfrans00000000000000// (C) Copyright John Maddock and Steve Cleary 2000. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_DETAIL_ICE_AND_HPP_INCLUDED #define BOOST_TT_DETAIL_ICE_AND_HPP_INCLUDED #include namespace boost { namespace type_traits { template struct ice_and; template struct ice_and { BOOST_STATIC_CONSTANT(bool, value = false); }; template <> struct ice_and { BOOST_STATIC_CONSTANT(bool, value = true); }; } // namespace type_traits } // namespace boost #endif // BOOST_TT_DETAIL_ICE_AND_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/detail/PaxHeaders.5405/size_t_trait_def.hpp0000644000000000000000000000007312717644140024665 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/detail/size_t_trait_def.hpp0000664000372100037210000000322312717644140025515 0ustar00fransfrans00000000000000 // NO INCLUDE GUARDS, THE HEADER IS INTENDED FOR MULTIPLE INCLUSION // Copyright Aleksey Gurtovoy 2002-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // $Source$ // $Date: 2011-04-25 05:26:48 -0700 (Mon, 25 Apr 2011) $ // $Revision: 71481 $ #include #include #include #include #include #if !defined(BOOST_MSVC) || BOOST_MSVC >= 1300 # define BOOST_TT_AUX_SIZE_T_BASE(C) public ::boost::integral_constant # define BOOST_TT_AUX_SIZE_T_TRAIT_VALUE_DECL(C) /**/ #else # define BOOST_TT_AUX_SIZE_T_BASE(C) public ::boost::mpl::size_t # define BOOST_TT_AUX_SIZE_T_TRAIT_VALUE_DECL(C) \ typedef ::boost::mpl::size_t base_; \ using base_::value; \ /**/ #endif #define BOOST_TT_AUX_SIZE_T_TRAIT_DEF1(trait,T,C) \ template< typename T > struct trait \ : BOOST_TT_AUX_SIZE_T_BASE(C) \ { \ public:\ BOOST_TT_AUX_SIZE_T_TRAIT_VALUE_DECL(C) \ BOOST_MPL_AUX_LAMBDA_SUPPORT(1,trait,(T)) \ }; \ \ BOOST_TT_AUX_TEMPLATE_ARITY_SPEC(1,trait) \ /**/ #define BOOST_TT_AUX_SIZE_T_TRAIT_SPEC1(trait,spec,C) \ template<> struct trait \ : BOOST_TT_AUX_SIZE_T_BASE(C) \ { \ public:\ BOOST_TT_AUX_SIZE_T_TRAIT_VALUE_DECL(C) \ BOOST_MPL_AUX_LAMBDA_SUPPORT_SPEC(1,trait,(spec)) \ }; \ /**/ #define BOOST_TT_AUX_SIZE_T_TRAIT_PARTIAL_SPEC1_1(param,trait,spec,C) \ template< param > struct trait \ : BOOST_TT_AUX_SIZE_T_BASE(C) \ { \ }; \ /**/ madp-0.4/src/boost/boost/type_traits/detail/PaxHeaders.5405/bool_trait_undef.hpp0000644000000000000000000000007312717644140024666 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/detail/bool_trait_undef.hpp0000664000372100037210000000173012717644140025517 0ustar00fransfrans00000000000000 // NO INCLUDE GUARDS, THE HEADER IS INTENDED FOR MULTIPLE INCLUSION // Copyright Aleksey Gurtovoy 2002-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // $Source$ // $Date: 2011-10-09 15:28:33 -0700 (Sun, 09 Oct 2011) $ // $Revision: 74865 $ #undef BOOST_TT_AUX_BOOL_TRAIT_VALUE_DECL #undef BOOST_TT_AUX_BOOL_C_BASE #undef BOOST_TT_AUX_BOOL_TRAIT_DEF1 #undef BOOST_TT_AUX_BOOL_TRAIT_DEF2 #undef BOOST_TT_AUX_BOOL_TRAIT_DEF3 #undef BOOST_TT_AUX_BOOL_TRAIT_SPEC1 #undef BOOST_TT_AUX_BOOL_TRAIT_SPEC2 #undef BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1 #undef BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC2 #undef BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1 #undef BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_2 #undef BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC2_1 #undef BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC2_2 #undef BOOST_TT_AUX_BOOL_TRAIT_IMPL_PARTIAL_SPEC2_1 #undef BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1 madp-0.4/src/boost/boost/type_traits/detail/PaxHeaders.5405/is_function_ptr_helper.hpp0000644000000000000000000000007312717644140026113 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/detail/is_function_ptr_helper.hpp0000664000372100037210000004651312717644140026754 0ustar00fransfrans00000000000000 // Copyright 2000 John Maddock (john@johnmaddock.co.uk) // Copyright 2002 Aleksey Gurtovoy (agurtovoy@meta-comm.com) // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #if !defined(BOOST_PP_IS_ITERATING) ///// header body #ifndef BOOST_TT_DETAIL_IS_FUNCTION_PTR_HELPER_HPP_INCLUDED #define BOOST_TT_DETAIL_IS_FUNCTION_PTR_HELPER_HPP_INCLUDED #include #if defined(BOOST_TT_PREPROCESSING_MODE) # include # include # include #endif namespace boost { namespace type_traits { template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = false); }; #if !defined(BOOST_TT_PREPROCESSING_MODE) // preprocessor-generated part, don't edit by hand! template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif #else #undef BOOST_STATIC_CONSTANT #define BOOST_PP_ITERATION_PARAMS_1 \ (3, (0, 25, "boost/type_traits/detail/is_function_ptr_helper.hpp")) #include BOOST_PP_ITERATE() #endif // BOOST_TT_PREPROCESSING_MODE } // namespace type_traits } // namespace boost #endif // BOOST_TT_DETAIL_IS_FUNCTION_PTR_HELPER_HPP_INCLUDED ///// iteration #else #define BOOST_PP_COUNTER BOOST_PP_FRAME_ITERATION(1) template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; @#ifndef BOOST_TT_NO_ELLIPSIS_IN_FUNC_TESTING template struct is_function_ptr_helper { BOOST_STATIC_CONSTANT(bool, value = true); }; @#endif #undef BOOST_PP_COUNTER #endif // BOOST_PP_IS_ITERATING madp-0.4/src/boost/boost/type_traits/detail/PaxHeaders.5405/ice_eq.hpp0000644000000000000000000000007312717644140022574 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/detail/ice_eq.hpp0000664000372100037210000000171412717644140023427 0ustar00fransfrans00000000000000// (C) Copyright John Maddock and Steve Cleary 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_DETAIL_ICE_EQ_HPP_INCLUDED #define BOOST_TT_DETAIL_ICE_EQ_HPP_INCLUDED #include namespace boost { namespace type_traits { template struct ice_eq { BOOST_STATIC_CONSTANT(bool, value = (b1 == b2)); }; template struct ice_ne { BOOST_STATIC_CONSTANT(bool, value = (b1 != b2)); }; #ifndef BOOST_NO_INCLASS_MEMBER_INITIALIZATION template bool const ice_eq::value; template bool const ice_ne::value; #endif } // namespace type_traits } // namespace boost #endif // BOOST_TT_DETAIL_ICE_EQ_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/detail/PaxHeaders.5405/ice_not.hpp0000644000000000000000000000007312717644140022767 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/detail/ice_not.hpp0000664000372100037210000000141112717644140023614 0ustar00fransfrans00000000000000// (C) Copyright John Maddock and Steve Cleary 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_DETAIL_ICE_NOT_HPP_INCLUDED #define BOOST_TT_DETAIL_ICE_NOT_HPP_INCLUDED #include namespace boost { namespace type_traits { template struct ice_not { BOOST_STATIC_CONSTANT(bool, value = true); }; template <> struct ice_not { BOOST_STATIC_CONSTANT(bool, value = false); }; } // namespace type_traits } // namespace boost #endif // BOOST_TT_DETAIL_ICE_NOT_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/detail/PaxHeaders.5405/ice_or.hpp0000644000000000000000000000007312717644140022607 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/detail/ice_or.hpp0000664000372100037210000000174712717644140023450 0ustar00fransfrans00000000000000// (C) Copyright John Maddock and Steve Cleary 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_DETAIL_ICE_OR_HPP_INCLUDED #define BOOST_TT_DETAIL_ICE_OR_HPP_INCLUDED #include namespace boost { namespace type_traits { template struct ice_or; template struct ice_or { BOOST_STATIC_CONSTANT(bool, value = true); }; template <> struct ice_or { BOOST_STATIC_CONSTANT(bool, value = false); }; } // namespace type_traits } // namespace boost #endif // BOOST_TT_DETAIL_ICE_OR_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/detail/PaxHeaders.5405/false_result.hpp0000644000000000000000000000007312717644140024037 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/detail/false_result.hpp0000664000372100037210000000137712717644140024677 0ustar00fransfrans00000000000000// Copyright David Abrahams 2002. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_DETAIL_FALSE_RESULT_HPP_INCLUDED #define BOOST_TT_DETAIL_FALSE_RESULT_HPP_INCLUDED #include namespace boost { namespace type_traits { // Utility class which always "returns" false struct false_result { template struct result_ { BOOST_STATIC_CONSTANT(bool, value = false); }; }; }} // namespace boost::type_traits #endif // BOOST_TT_DETAIL_FALSE_RESULT_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/detail/PaxHeaders.5405/yes_no_type.hpp0000644000000000000000000000007312717644140023704 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/detail/yes_no_type.hpp0000664000372100037210000000132612717644140024536 0ustar00fransfrans00000000000000 // (C) Copyright John Maddock and Steve Cleary 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. // // macros and helpers for working with integral-constant-expressions. #ifndef BOOST_TT_DETAIL_YES_NO_TYPE_HPP_INCLUDED #define BOOST_TT_DETAIL_YES_NO_TYPE_HPP_INCLUDED namespace boost { namespace type_traits { typedef char yes_type; struct no_type { char padding[8]; }; } // namespace type_traits } // namespace boost #endif // BOOST_TT_DETAIL_YES_NO_TYPE_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/detail/PaxHeaders.5405/template_arity_spec.hpp0000644000000000000000000000007312717644140025404 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/detail/template_arity_spec.hpp0000664000372100037210000000165212717644140026240 0ustar00fransfrans00000000000000 // NO INCLUDE GUARDS, THE HEADER IS INTENDED FOR MULTIPLE INCLUSION // Copyright Aleksey Gurtovoy 2002-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #include #include #include #include #include #if defined(BOOST_MPL_CFG_NO_FULL_LAMBDA_SUPPORT) \ && defined(BOOST_MPL_CFG_BROKEN_OVERLOAD_RESOLUTION) # define BOOST_TT_AUX_TEMPLATE_ARITY_SPEC(i, name) \ namespace mpl { namespace aux { \ template< BOOST_MPL_PP_PARAMS(i, typename T) > \ struct template_arity< \ name< BOOST_MPL_PP_PARAMS(i, T) > \ > \ : int_ \ { \ }; \ }} \ /**/ #else # define BOOST_TT_AUX_TEMPLATE_ARITY_SPEC(i, name) /**/ #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_logical_or.hpp0000644000000000000000000000007312717644140023052 xustar0030 atime=1463765180.181719519 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/has_logical_or.hpp0000664000372100037210000000263512717644140023710 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_LOGICAL_OR_HPP_INCLUDED #define BOOST_TT_HAS_LOGICAL_OR_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_logical_or #define BOOST_TT_TRAIT_OP || #define BOOST_TT_FORBIDDEN_IF\ /* pointer with fundamental non convertible to bool */\ ::boost::type_traits::ice_or<\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::type_traits::ice_not< ::boost::is_convertible< Rhs_nocv, bool >::value >::value\ >::value\ >::value,\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::type_traits::ice_not< ::boost::is_convertible< Lhs_nocv, bool >::value >::value\ >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_not_equal_to.hpp0000644000000000000000000000007412717644140023432 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_not_equal_to.hpp0000664000372100037210000000346712717644140024273 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_NOT_EQUAL_TO_HPP_INCLUDED #define BOOST_TT_HAS_NOT_EQUAL_TO_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_not_equal_to #define BOOST_TT_TRAIT_OP != #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* Lhs==pointer and Rhs==fundamental */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_fundamental< Rhs_nocv >::value\ >::value,\ /* Rhs==pointer and Lhs==fundamental */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::is_fundamental< Lhs_nocv >::value\ >::value,\ /* Lhs==pointer and Rhs==pointer and Lhs!=base(Rhs) and Rhs!=base(Lhs) and Lhs!=void* and Rhs!=void* */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::type_traits::ice_not<\ ::boost::type_traits::ice_or<\ ::boost::is_base_of< Lhs_noptr, Rhs_noptr >::value,\ ::boost::is_base_of< Rhs_noptr, Lhs_noptr >::value,\ ::boost::is_same< Lhs_noptr, Rhs_noptr >::value,\ ::boost::is_void< Lhs_noptr >::value,\ ::boost::is_void< Rhs_noptr >::value\ >::value\ >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_left_shift_assign.hpp0000644000000000000000000000007312717644140024433 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/has_left_shift_assign.hpp0000664000372100037210000000413112717644140025262 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_LEFT_SHIFT_ASSIGN_HPP_INCLUDED #define BOOST_TT_HAS_LEFT_SHIFT_ASSIGN_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_left_shift_assign #define BOOST_TT_TRAIT_OP <<= #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* Lhs==fundamental and Rhs==fundamental and (Lhs!=integral or Rhs!=integral) */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::type_traits::ice_or<\ ::boost::type_traits::ice_not< ::boost::is_integral< Lhs_noref >::value >::value,\ ::boost::type_traits::ice_not< ::boost::is_integral< Rhs_noref >::value >::value\ >::value\ >::value,\ /* Lhs==fundamental and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ /* Rhs==fundamental and Lhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_pointer< Lhs_noref >::value\ >::value,\ /* Lhs==pointer and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ /* Lhs==fundamental and Rhs==fundamental and Lhs==const */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_const< Lhs_noref >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_equal_to.hpp0000644000000000000000000000007312717644140022551 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/has_equal_to.hpp0000664000372100037210000000345312717644140023406 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_EQUAL_TO_HPP_INCLUDED #define BOOST_TT_HAS_EQUAL_TO_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_equal_to #define BOOST_TT_TRAIT_OP == #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* Lhs==pointer and Rhs==fundamental */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_fundamental< Rhs_nocv >::value\ >::value,\ /* Rhs==pointer and Lhs==fundamental */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::is_fundamental< Lhs_nocv >::value\ >::value,\ /* Lhs==pointer and Rhs==pointer and Lhs!=base(Rhs) and Rhs!=base(Lhs) and Lhs!=void* and Rhs!=void* */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::type_traits::ice_not<\ ::boost::type_traits::ice_or<\ ::boost::is_base_of< Lhs_noptr, Rhs_noptr >::value,\ ::boost::is_base_of< Rhs_noptr, Lhs_noptr >::value,\ ::boost::is_same< Lhs_noptr, Rhs_noptr >::value,\ ::boost::is_void< Lhs_noptr >::value,\ ::boost::is_void< Rhs_noptr >::value\ >::value\ >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_divides.hpp0000644000000000000000000000007312717644140022367 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/has_divides.hpp0000664000372100037210000000244212717644140023221 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_DIVIDES_HPP_INCLUDED #define BOOST_TT_HAS_DIVIDES_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_divides #define BOOST_TT_TRAIT_OP / #define BOOST_TT_FORBIDDEN_IF\ /* pointer with pointer or fundamental */\ ::boost::type_traits::ice_or<\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::type_traits::ice_or<\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value\ >::value,\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::type_traits::ice_or<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_pointer< Lhs_noref >::value\ >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/add_volatile.hpp0000644000000000000000000000007412717644140022535 xustar0030 atime=1463765180.177719552 30 ctime=1463765201.173551863 madp-0.4/src/boost/boost/type_traits/add_volatile.hpp0000664000372100037210000000271712717644140023373 0ustar00fransfrans00000000000000 // (C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes, Howard // Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_ADD_VOLATILE_HPP_INCLUDED #define BOOST_TT_ADD_VOLATILE_HPP_INCLUDED #include // should be the last #include #include namespace boost { // * convert a type T to volatile type - add_volatile // this is not required since the result is always // the same as "T volatile", but it does suppress warnings // from some compilers: #if defined(BOOST_MSVC) // This bogus warning will appear when add_volatile is applied to a // const volatile reference because we can't detect const volatile // references with MSVC6. # pragma warning(push) # pragma warning(disable:4181) // warning C4181: qualifier applied to reference type ignored #endif BOOST_TT_AUX_TYPE_TRAIT_DEF1(add_volatile,T,T volatile) #if defined(BOOST_MSVC) # pragma warning(pop) #endif #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,add_volatile,T&,T&) #endif } // namespace boost #include #endif // BOOST_TT_ADD_VOLATILE_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_trivial_destructor.hpp0000644000000000000000000000007412717644140024671 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_trivial_destructor.hpp0000664000372100037210000000313212717644140025517 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_TRIVIAL_DESTRUCTOR_HPP_INCLUDED #define BOOST_TT_HAS_TRIVIAL_DESTRUCTOR_HPP_INCLUDED #include #include #include #include // should be the last #include #include namespace boost { namespace detail { template struct has_trivial_dtor_impl { #ifdef BOOST_HAS_TRIVIAL_DESTRUCTOR BOOST_STATIC_CONSTANT(bool, value = BOOST_HAS_TRIVIAL_DESTRUCTOR(T)); #else BOOST_STATIC_CONSTANT(bool, value = ::boost::is_pod::value); #endif }; } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF1(has_trivial_destructor,T,::boost::detail::has_trivial_dtor_impl::value) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_trivial_destructor,void,false) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_trivial_destructor,void const,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_trivial_destructor,void const volatile,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_trivial_destructor,void volatile,false) #endif } // namespace boost #include #endif // BOOST_TT_HAS_TRIVIAL_DESTRUCTOR_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_bit_or.hpp0000644000000000000000000000007312717644140022216 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/has_bit_or.hpp0000664000372100037210000000344112717644140023050 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_BIT_OR_HPP_INCLUDED #define BOOST_TT_HAS_BIT_OR_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_bit_or #define BOOST_TT_TRAIT_OP | #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* Lhs==fundamental and Rhs==fundamental and (Lhs!=integral or Rhs!=integral) */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::type_traits::ice_or<\ ::boost::type_traits::ice_not< ::boost::is_integral< Lhs_noref >::value >::value,\ ::boost::type_traits::ice_not< ::boost::is_integral< Rhs_noref >::value >::value\ >::value\ >::value,\ /* Lhs==fundamental and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ /* Rhs==fundamental and Lhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_pointer< Lhs_noref >::value\ >::value,\ /* Lhs==pointer and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/promote.hpp0000644000000000000000000000007412717644140021573 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/promote.hpp0000664000372100037210000000170312717644140022423 0ustar00fransfrans00000000000000// Copyright 2005 Alexander Nasonov. // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef FILE_boost_type_traits_promote_hpp_INCLUDED #define FILE_boost_type_traits_promote_hpp_INCLUDED #include #include #include // Should be the last #include #include namespace boost { namespace detail { template struct promote_impl : public integral_promotion< BOOST_DEDUCED_TYPENAME floating_point_promotion::type > { }; } BOOST_TT_AUX_TYPE_TRAIT_DEF1( promote , T , BOOST_DEDUCED_TYPENAME boost::detail::promote_impl::type ) } #include #endif // #ifndef FILE_boost_type_traits_promote_hpp_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_void.hpp0000644000000000000000000000007412717644140021542 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/is_void.hpp0000664000372100037210000000224512717644140022374 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_VOID_HPP_INCLUDED #define BOOST_TT_IS_VOID_HPP_INCLUDED #include // should be the last #include #include namespace boost { //* is a type T void - is_void #if defined( __CODEGEARC__ ) BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_void,T,__is_void(T)) #else BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_void,T,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(is_void,void,true) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_SPEC1(is_void,void const,true) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(is_void,void volatile,true) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(is_void,void const volatile,true) #endif #endif // non-CodeGear implementation } // namespace boost #include #endif // BOOST_TT_IS_VOID_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_fundamental.hpp0000644000000000000000000000007412717644140023077 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/is_fundamental.hpp0000664000372100037210000000247412717644140023735 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_FUNDAMENTAL_HPP_INCLUDED #define BOOST_TT_IS_FUNDAMENTAL_HPP_INCLUDED #include #include #include // should be the last #include #include namespace boost { namespace detail { template struct is_fundamental_impl : public ::boost::type_traits::ice_or< ::boost::is_arithmetic::value , ::boost::is_void::value > { }; } // namespace detail //* is a type T a fundamental type described in the standard (3.9.1) #if defined( __CODEGEARC__ ) BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_fundamental,T,__is_fundamental(T)) #else BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_fundamental,T,::boost::detail::is_fundamental_impl::value) #endif } // namespace boost #include #endif // BOOST_TT_IS_FUNDAMENTAL_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_post_decrement.hpp0000644000000000000000000000007412717644140023754 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_post_decrement.hpp0000664000372100037210000000242612717644140024607 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_POST_DECREMENT_HPP_INCLUDED #define BOOST_TT_HAS_POST_DECREMENT_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_post_decrement #define BOOST_TT_TRAIT_OP -- #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* bool */\ ::boost::is_same< bool, Lhs_nocv >::value,\ /* void* */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_void< Lhs_noptr >::value\ >::value,\ /* (fundamental or pointer) and const */\ ::boost::type_traits::ice_and<\ ::boost::type_traits::ice_or<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_pointer< Lhs_noref >::value\ >::value,\ ::boost::is_const< Lhs_noref >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_trivial_move_constructor.hpp0000644000000000000000000000007412717644140026106 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_trivial_move_constructor.hpp0000664000372100037210000000376712717644140026752 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // (C) Copyright Eric Friedman 2002-2003. // (C) Copyright Antony Polukhin 2013. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_TRIVIAL_MOVE_CONSTRUCTOR_HPP_INCLUDED #define BOOST_TT_HAS_TRIVIAL_MOVE_CONSTRUCTOR_HPP_INCLUDED #include #include #include #include #include #include // should be the last #include #include namespace boost { namespace detail { template struct has_trivial_move_ctor_impl { #ifdef BOOST_HAS_TRIVIAL_MOVE_CONSTRUCTOR BOOST_STATIC_CONSTANT(bool, value = (BOOST_HAS_TRIVIAL_MOVE_CONSTRUCTOR(T))); #else BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_and< ::boost::is_pod::value, ::boost::type_traits::ice_not< ::boost::is_volatile::value >::value >::value)); #endif }; } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF1(has_trivial_move_constructor,T,::boost::detail::has_trivial_move_ctor_impl::value) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_trivial_move_constructor,void,false) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_trivial_move_constructor,void const,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_trivial_move_constructor,void const volatile,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(has_trivial_move_constructor,void volatile,false) #endif } // namespace boost #include #endif // BOOST_TT_HAS_TRIVIAL_MOVE_CONSTRUCTOR_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_stateless.hpp0000644000000000000000000000007412717644140022610 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/is_stateless.hpp0000664000372100037210000000274612717644140023450 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_STATELESS_HPP_INCLUDED #define BOOST_TT_IS_STATELESS_HPP_INCLUDED #include #include #include #include #include #include #include // should be the last #include #include namespace boost { namespace detail { template struct is_stateless_impl { BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_and< ::boost::has_trivial_constructor::value, ::boost::has_trivial_copy::value, ::boost::has_trivial_destructor::value, ::boost::is_class::value, ::boost::is_empty::value >::value)); }; } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_stateless,T,::boost::detail::is_stateless_impl::value) } // namespace boost #include #endif // BOOST_TT_IS_STATELESS_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_multiplies.hpp0000644000000000000000000000007412717644140023130 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_multiplies.hpp0000664000372100037210000000245312717644140023763 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_MULTIPLIES_HPP_INCLUDED #define BOOST_TT_HAS_MULTIPLIES_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_multiplies #define BOOST_TT_TRAIT_OP * #define BOOST_TT_FORBIDDEN_IF\ /* pointer with pointer or fundamental */\ ::boost::type_traits::ice_or<\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::type_traits::ice_or<\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value\ >::value,\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::type_traits::ice_or<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_pointer< Lhs_noref >::value\ >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_member_pointer.hpp0000644000000000000000000000007412717644140023610 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/is_member_pointer.hpp0000664000372100037210000001041312717644140024436 0ustar00fransfrans00000000000000 // (C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes, // Howard Hinnant and John Maddock 2000. // (C) Copyright Mat Marcus, Jesse Jones and Adobe Systems Inc 2001 // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. // Fixed is_pointer, is_reference, is_const, is_volatile, is_same, // is_member_pointer based on the Simulated Partial Specialization work // of Mat Marcus and Jesse Jones. See http://opensource.adobe.com or // http://groups.yahoo.com/group/boost/message/5441 // Some workarounds in here use ideas suggested from "Generic: // Mappings between Types and Values" // by Andrei Alexandrescu (see http://www.cuj.com/experts/1810/alexandr.html). #ifndef BOOST_TT_IS_MEMBER_POINTER_HPP_INCLUDED #define BOOST_TT_IS_MEMBER_POINTER_HPP_INCLUDED #include #include #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) && !BOOST_WORKAROUND(__BORLANDC__, < 0x600) # include #else # include # include # include # include # include # include #endif // should be the last #include #include namespace boost { #if defined( __CODEGEARC__ ) BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_member_pointer,T,__is_member_pointer(T)) #elif BOOST_WORKAROUND(__BORLANDC__, < 0x600) BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_member_pointer,T,false) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_2(typename T,typename U,is_member_pointer,U T::*,true) #elif !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_member_pointer,T,::boost::is_member_function_pointer::value) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_2(typename T,typename U,is_member_pointer,U T::*,true) #if !BOOST_WORKAROUND(__MWERKS__,<=0x3003) && !BOOST_WORKAROUND(__IBMCPP__, <=600) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_2(typename T,typename U,is_member_pointer,U T::*const,true) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_2(typename T,typename U,is_member_pointer,U T::*volatile,true) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_2(typename T,typename U,is_member_pointer,U T::*const volatile,true) #endif #else // no partial template specialization namespace detail { template ::boost::type_traits::yes_type BOOST_TT_DECL is_member_pointer_tester(R T::*const volatile*); ::boost::type_traits::no_type BOOST_TT_DECL is_member_pointer_tester(...); template struct is_member_pointer_select : public ::boost::type_traits::false_result { }; template <> struct is_member_pointer_select { template struct result_ { static T* make_t(); BOOST_STATIC_CONSTANT( bool, value = (::boost::type_traits::ice_or< (1 == sizeof(::boost::type_traits::is_mem_fun_pointer_tester(make_t()))), (1 == sizeof(is_member_pointer_tester(make_t()))) >::value) ); }; }; template struct is_member_pointer_impl : public is_member_pointer_select< ::boost::type_traits::ice_or< ::boost::is_reference::value , ::boost::is_array::value >::value >::template result_ { }; BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_member_pointer,void,false) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_member_pointer,void const,false) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_member_pointer,void volatile,false) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_member_pointer,void const volatile,false) #endif } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_member_pointer,T,::boost::detail::is_member_pointer_impl::value) #endif // __BORLANDC__ } // namespace boost #include #endif // BOOST_TT_IS_MEMBER_POINTER_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_greater.hpp0000644000000000000000000000007312717644140022371 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/has_greater.hpp0000664000372100037210000000344712717644140023231 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_GREATER_HPP_INCLUDED #define BOOST_TT_HAS_GREATER_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_greater #define BOOST_TT_TRAIT_OP > #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* Lhs==pointer and Rhs==fundamental */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_fundamental< Rhs_nocv >::value\ >::value,\ /* Rhs==pointer and Lhs==fundamental */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::is_fundamental< Lhs_nocv >::value\ >::value,\ /* Lhs==pointer and Rhs==pointer and Lhs!=base(Rhs) and Rhs!=base(Lhs) and Lhs!=void* and Rhs!=void* */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::type_traits::ice_not<\ ::boost::type_traits::ice_or<\ ::boost::is_base_of< Lhs_noptr, Rhs_noptr >::value,\ ::boost::is_base_of< Rhs_noptr, Lhs_noptr >::value,\ ::boost::is_same< Lhs_noptr, Rhs_noptr >::value,\ ::boost::is_void< Lhs_noptr >::value,\ ::boost::is_void< Rhs_noptr >::value\ >::value\ >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/add_lvalue_reference.hpp0000644000000000000000000000007412717644140024224 xustar0030 atime=1463765180.177719552 30 ctime=1463765201.173551863 madp-0.4/src/boost/boost/type_traits/add_lvalue_reference.hpp0000664000372100037210000000135612717644140025060 0ustar00fransfrans00000000000000// Copyright 2010 John Maddock // Distributed under the Boost Software License, Version 1.0. // See http://www.boost.org/LICENSE_1_0.txt #ifndef BOOST_TYPE_TRAITS_EXT_ADD_LVALUE_REFERENCE__HPP #define BOOST_TYPE_TRAITS_EXT_ADD_LVALUE_REFERENCE__HPP #include // should be the last #include #include namespace boost{ BOOST_TT_AUX_TYPE_TRAIT_DEF1(add_lvalue_reference,T,typename boost::add_reference::type) #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,add_lvalue_reference,T&&,T&) #endif } #include #endif // BOOST_TYPE_TRAITS_EXT_ADD_LVALUE_REFERENCE__HPP madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_union.hpp0000644000000000000000000000007412717644140021731 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/is_union.hpp0000664000372100037210000000306312717644140022562 0ustar00fransfrans00000000000000 // (C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes, Howard // Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_UNION_HPP_INCLUDED #define BOOST_TT_IS_UNION_HPP_INCLUDED #include #include #include // should be the last #include #include namespace boost { namespace detail { #ifndef __GNUC__ template struct is_union_impl { typedef typename remove_cv::type cvt; #ifdef BOOST_IS_UNION BOOST_STATIC_CONSTANT(bool, value = BOOST_IS_UNION(cvt)); #else BOOST_STATIC_CONSTANT(bool, value = false); #endif }; #else // // using remove_cv here generates a whole load of needless // warnings with gcc, since it doesn't do any good with gcc // in any case (at least at present), just remove it: // template struct is_union_impl { #ifdef BOOST_IS_UNION BOOST_STATIC_CONSTANT(bool, value = BOOST_IS_UNION(T)); #else BOOST_STATIC_CONSTANT(bool, value = false); #endif }; #endif } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_union,T,::boost::detail::is_union_impl::value) } // namespace boost #include #endif // BOOST_TT_IS_UNION_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/make_unsigned.hpp0000644000000000000000000000007412717644140022717 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/make_unsigned.hpp0000664000372100037210000001215012717644140023545 0ustar00fransfrans00000000000000 // (C) Copyright John Maddock 2007. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_MAKE_UNSIGNED_HPP_INCLUDED #define BOOST_TT_MAKE_UNSIGNED_HPP_INCLUDED #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include // should be the last #include #include namespace boost { namespace detail { template struct make_unsigned_imp { BOOST_STATIC_ASSERT( (::boost::type_traits::ice_or< ::boost::is_integral::value, ::boost::is_enum::value>::value)); #if !BOOST_WORKAROUND(BOOST_MSVC, <=1300) BOOST_STATIC_ASSERT( (::boost::type_traits::ice_not< ::boost::is_same< typename remove_cv::type, bool>::value>::value)); #endif typedef typename remove_cv::type t_no_cv; typedef typename mpl::if_c< (::boost::type_traits::ice_and< ::boost::is_unsigned::value, ::boost::is_integral::value, ::boost::type_traits::ice_not< ::boost::is_same::value>::value, ::boost::type_traits::ice_not< ::boost::is_same::value>::value, ::boost::type_traits::ice_not< ::boost::is_same::value>::value >::value), T, typename mpl::if_c< (::boost::type_traits::ice_and< ::boost::is_integral::value, ::boost::type_traits::ice_not< ::boost::is_same::value>::value, ::boost::type_traits::ice_not< ::boost::is_same::value>::value, ::boost::type_traits::ice_not< ::boost::is_same::value>::value> ::value), typename mpl::if_< is_same, unsigned char, typename mpl::if_< is_same, unsigned short, typename mpl::if_< is_same, unsigned int, typename mpl::if_< is_same, unsigned long, #if defined(BOOST_HAS_LONG_LONG) #ifdef BOOST_HAS_INT128 typename mpl::if_c< sizeof(t_no_cv) == sizeof(boost::ulong_long_type), boost::ulong_long_type, boost::uint128_type >::type #else boost::ulong_long_type #endif #elif defined(BOOST_HAS_MS_INT64) unsigned __int64 #else unsigned long #endif >::type >::type >::type >::type, // Not a regular integer type: typename mpl::if_c< sizeof(t_no_cv) == sizeof(unsigned char), unsigned char, typename mpl::if_c< sizeof(t_no_cv) == sizeof(unsigned short), unsigned short, typename mpl::if_c< sizeof(t_no_cv) == sizeof(unsigned int), unsigned int, typename mpl::if_c< sizeof(t_no_cv) == sizeof(unsigned long), unsigned long, #if defined(BOOST_HAS_LONG_LONG) #ifdef BOOST_HAS_INT128 typename mpl::if_c< sizeof(t_no_cv) == sizeof(boost::ulong_long_type), boost::ulong_long_type, boost::uint128_type >::type #else boost::ulong_long_type #endif #elif defined(BOOST_HAS_MS_INT64) unsigned __int64 #else unsigned long #endif >::type >::type >::type >::type >::type >::type base_integer_type; // Add back any const qualifier: typedef typename mpl::if_< is_const, typename add_const::type, base_integer_type >::type const_base_integer_type; // Add back any volatile qualifier: typedef typename mpl::if_< is_volatile, typename add_volatile::type, const_base_integer_type >::type type; }; } // namespace detail BOOST_TT_AUX_TYPE_TRAIT_DEF1(make_unsigned,T,typename boost::detail::make_unsigned_imp::type) } // namespace boost #include #endif // BOOST_TT_ADD_REFERENCE_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_nothrow_destructor.hpp0000644000000000000000000000007412717644140024717 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_nothrow_destructor.hpp0000664000372100037210000000155412717644140025553 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_NOTHROW_DESTRUCTOR_HPP_INCLUDED #define BOOST_TT_HAS_NOTHROW_DESTRUCTOR_HPP_INCLUDED #include // should be the last #include #include namespace boost { BOOST_TT_AUX_BOOL_TRAIT_DEF1(has_nothrow_destructor,T,::boost::has_trivial_destructor::value) } // namespace boost #include #endif // BOOST_TT_HAS_NOTHROW_DESTRUCTOR_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/remove_bounds.hpp0000644000000000000000000000007412717644140022755 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/remove_bounds.hpp0000664000372100037210000000373612717644140023615 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_REMOVE_BOUNDS_HPP_INCLUDED #define BOOST_TT_REMOVE_BOUNDS_HPP_INCLUDED #include #include #include #if BOOST_WORKAROUND(BOOST_MSVC,<=1300) #include #endif // should be the last #include #include #if !BOOST_WORKAROUND(BOOST_MSVC,<=1300) namespace boost { BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_bounds,T,T) #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) && !defined(BOOST_NO_ARRAY_TYPE_SPECIALIZATIONS) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_2(typename T,std::size_t N,remove_bounds,T[N],T type) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_2(typename T,std::size_t N,remove_bounds,T const[N],T const type) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_2(typename T,std::size_t N,remove_bounds,T volatile[N],T volatile type) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_2(typename T,std::size_t N,remove_bounds,T const volatile[N],T const volatile type) #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x610)) && !defined(__IBMCPP__) && !BOOST_WORKAROUND(__DMC__, BOOST_TESTED_AT(0x840)) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,remove_bounds,T[],T) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,remove_bounds,T const[],T const) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,remove_bounds,T volatile[],T volatile) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,remove_bounds,T const volatile[],T const volatile) #endif #endif } // namespace boost #endif #include #endif // BOOST_TT_REMOVE_BOUNDS_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_floating_point.hpp0000644000000000000000000000007412717644140023615 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/is_floating_point.hpp0000664000372100037210000000202412717644140024442 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000-2005. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TYPE_TRAITS_IS_FLOATING_HPP_INCLUDED #define BOOST_TYPE_TRAITS_IS_FLOATING_HPP_INCLUDED // should be the last #include #include namespace boost { //* is a type T a floating-point type described in the standard (3.9.1p8) BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_floating_point,T,false) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_floating_point,float,true) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_floating_point,double,true) BOOST_TT_AUX_BOOL_TRAIT_CV_SPEC1(is_floating_point,long double,true) } // namespace boost #include #endif // BOOST_TYPE_TRAITS_IS_FLOAT_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/remove_const.hpp0000644000000000000000000000007412717644140022611 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/remove_const.hpp0000664000372100037210000000466012717644140023446 0ustar00fransfrans00000000000000 // (C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes, Howard // Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_REMOVE_CONST_HPP_INCLUDED #define BOOST_TT_REMOVE_CONST_HPP_INCLUDED #include #include #include #include #include #include #if BOOST_WORKAROUND(BOOST_MSVC,<=1300) #include #endif // should be the last #include #include namespace boost { #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION namespace detail { template struct remove_const_helper { typedef T type; }; template struct remove_const_helper { typedef T volatile type; }; template struct remove_const_impl { typedef typename remove_const_helper< typename cv_traits_imp::unqualified_type , ::boost::is_volatile::value >::type type; }; #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES // // We can't filter out rvalue_references at the same level as // references or we get ambiguities from msvc: // template struct remove_const_impl { typedef T&& type; }; #endif } // namespace detail // * convert a type T to non-const type - remove_const BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_const,T,typename boost::detail::remove_const_impl::type) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,remove_const,T&,T&) #if !defined(BOOST_NO_ARRAY_TYPE_SPECIALIZATIONS) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_2(typename T,std::size_t N,remove_const,T const[N],T type[N]) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_2(typename T,std::size_t N,remove_const,T const volatile[N],T volatile type[N]) #endif #elif !BOOST_WORKAROUND(BOOST_MSVC,<=1300) BOOST_TT_AUX_TYPE_TRAIT_DEF1(remove_const,T,typename boost::detail::remove_const_impl::type) #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION } // namespace boost #include #endif // BOOST_TT_REMOVE_CONST_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_base_and_derived.hpp0000644000000000000000000000007412717644140024037 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/is_base_and_derived.hpp0000664000372100037210000001775412717644140024704 0ustar00fransfrans00000000000000 // (C) Copyright Rani Sharoni 2003. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_BASE_AND_DERIVED_HPP_INCLUDED #define BOOST_TT_IS_BASE_AND_DERIVED_HPP_INCLUDED #include #ifndef BOOST_IS_BASE_OF #include #include #include #include #include #include #endif #include // should be the last #include #include namespace boost { namespace detail { #ifndef BOOST_IS_BASE_OF #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x581)) \ && !BOOST_WORKAROUND(__SUNPRO_CC , <= 0x540) \ && !BOOST_WORKAROUND(__EDG_VERSION__, <= 243) \ && !BOOST_WORKAROUND(__DMC__, BOOST_TESTED_AT(0x840)) // The EDG version number is a lower estimate. // It is not currently known which EDG version // exactly fixes the problem. /************************************************************************* This version detects ambiguous base classes and private base classes correctly, and was devised by Rani Sharoni. Explanation by Terje Slettebo and Rani Sharoni. Let's take the multiple base class below as an example, and the following will also show why there's not a problem with private or ambiguous base class: struct B {}; struct B1 : B {}; struct B2 : B {}; struct D : private B1, private B2 {}; is_base_and_derived::value; First, some terminology: SC - Standard conversion UDC - User-defined conversion A user-defined conversion sequence consists of an SC, followed by an UDC, followed by another SC. Either SC may be the identity conversion. When passing the default-constructed Host object to the overloaded check_sig() functions (initialization 8.5/14/4/3), we have several viable implicit conversion sequences: For "static no_type check_sig(B const volatile *, int)" we have the conversion sequences: C -> C const (SC - Qualification Adjustment) -> B const volatile* (UDC) C -> D const volatile* (UDC) -> B1 const volatile* / B2 const volatile* -> B const volatile* (SC - Conversion) For "static yes_type check_sig(D const volatile *, T)" we have the conversion sequence: C -> D const volatile* (UDC) According to 13.3.3.1/4, in context of user-defined conversion only the standard conversion sequence is considered when selecting the best viable function, so it only considers up to the user-defined conversion. For the first function this means choosing between C -> C const and C -> C, and it chooses the latter, because it's a proper subset (13.3.3.2/3/2) of the former. Therefore, we have: C -> D const volatile* (UDC) -> B1 const volatile* / B2 const volatile* -> B const volatile* (SC - Conversion) C -> D const volatile* (UDC) Here, the principle of the "shortest subsequence" applies again, and it chooses C -> D const volatile*. This shows that it doesn't even need to consider the multiple paths to B, or accessibility, as that possibility is eliminated before it could possibly cause ambiguity or access violation. If D is not derived from B, it has to choose between C -> C const -> B const volatile* for the first function, and C -> D const volatile* for the second function, which are just as good (both requires a UDC, 13.3.3.2), had it not been for the fact that "static no_type check_sig(B const volatile *, int)" is not templated, which makes C -> C const -> B const volatile* the best choice (13.3.3/1/4), resulting in "no". Also, if Host::operator B const volatile* hadn't been const, the two conversion sequences for "static no_type check_sig(B const volatile *, int)", in the case where D is derived from B, would have been ambiguous. See also http://groups.google.com/groups?selm=df893da6.0301280859.522081f7%40posting. google.com and links therein. *************************************************************************/ template struct bd_helper { // // This VC7.1 specific workaround stops the compiler from generating // an internal compiler error when compiling with /vmg (thanks to // Aleksey Gurtovoy for figuring out the workaround). // #if !BOOST_WORKAROUND(BOOST_MSVC, == 1310) template static type_traits::yes_type check_sig(D const volatile *, T); static type_traits::no_type check_sig(B const volatile *, int); #else static type_traits::yes_type check_sig(D const volatile *, long); static type_traits::no_type check_sig(B const volatile * const&, int); #endif }; template struct is_base_and_derived_impl2 { #if BOOST_WORKAROUND(BOOST_MSVC_FULL_VER, >= 140050000) #pragma warning(push) #pragma warning(disable:6334) #endif // // May silently do the wrong thing with incomplete types // unless we trap them here: // BOOST_STATIC_ASSERT(sizeof(B) != 0); BOOST_STATIC_ASSERT(sizeof(D) != 0); struct Host { #if !BOOST_WORKAROUND(BOOST_MSVC, == 1310) operator B const volatile *() const; #else operator B const volatile * const&() const; #endif operator D const volatile *(); }; BOOST_STATIC_CONSTANT(bool, value = sizeof(bd_helper::check_sig(Host(), 0)) == sizeof(type_traits::yes_type)); #if BOOST_WORKAROUND(BOOST_MSVC_FULL_VER, >= 140050000) #pragma warning(pop) #endif }; #else // // broken version: // template struct is_base_and_derived_impl2 { BOOST_STATIC_CONSTANT(bool, value = (::boost::is_convertible::value)); }; #define BOOST_BROKEN_IS_BASE_AND_DERIVED #endif template struct is_base_and_derived_impl3 { BOOST_STATIC_CONSTANT(bool, value = false); }; template struct is_base_and_derived_select { template struct rebind { typedef is_base_and_derived_impl3 type; }; }; template <> struct is_base_and_derived_select { template struct rebind { typedef is_base_and_derived_impl2 type; }; }; template struct is_base_and_derived_impl { typedef typename remove_cv::type ncvB; typedef typename remove_cv::type ncvD; typedef is_base_and_derived_select< ::boost::is_class::value, ::boost::is_class::value, ::boost::is_same::value> selector; typedef typename selector::template rebind binder; typedef typename binder::type bound_type; BOOST_STATIC_CONSTANT(bool, value = bound_type::value); }; #else template struct is_base_and_derived_impl { typedef typename remove_cv::type ncvB; typedef typename remove_cv::type ncvD; BOOST_STATIC_CONSTANT(bool, value = (BOOST_IS_BASE_OF(B,D) && ! ::boost::is_same::value)); }; #endif } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF2( is_base_and_derived , Base , Derived , (::boost::detail::is_base_and_derived_impl::value) ) #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC2_2(typename Base,typename Derived,is_base_and_derived,Base&,Derived,false) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC2_2(typename Base,typename Derived,is_base_and_derived,Base,Derived&,false) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC2_2(typename Base,typename Derived,is_base_and_derived,Base&,Derived&,false) #endif #if BOOST_WORKAROUND(__CODEGEARC__, BOOST_TESTED_AT(0x610)) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC2_1(typename Base,is_base_and_derived,Base,Base,false) #endif } // namespace boost #include #endif // BOOST_TT_IS_BASE_AND_DERIVED_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_complex.hpp0000644000000000000000000000007412717644140022250 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/is_complex.hpp0000664000372100037210000000165612717644140023107 0ustar00fransfrans00000000000000// (C) Copyright John Maddock 2007. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_COMPLEX_HPP #define BOOST_TT_IS_COMPLEX_HPP #include #include // should be the last #include #include namespace boost { namespace detail{ struct is_convertible_from_tester { template is_convertible_from_tester(const std::complex&); }; } BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_complex,T,(::boost::is_convertible::value)) } // namespace boost #include #endif //BOOST_TT_IS_COMPLEX_HPP madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_bit_and.hpp0000644000000000000000000000007312717644140022340 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/has_bit_and.hpp0000664000372100037210000000344412717644140023175 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_BIT_AND_HPP_INCLUDED #define BOOST_TT_HAS_BIT_AND_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_bit_and #define BOOST_TT_TRAIT_OP & #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* Lhs==fundamental and Rhs==fundamental and (Lhs!=integral or Rhs!=integral) */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::type_traits::ice_or<\ ::boost::type_traits::ice_not< ::boost::is_integral< Lhs_noref >::value >::value,\ ::boost::type_traits::ice_not< ::boost::is_integral< Rhs_noref >::value >::value\ >::value\ >::value,\ /* Lhs==fundamental and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ /* Rhs==fundamental and Lhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_pointer< Lhs_noref >::value\ >::value,\ /* Lhs==pointer and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/alignment_of.hpp0000644000000000000000000000007412717644140022550 xustar0030 atime=1463765180.177719552 30 ctime=1463765201.173551863 madp-0.4/src/boost/boost/type_traits/alignment_of.hpp0000664000372100037210000000701612717644140023403 0ustar00fransfrans00000000000000 // (C) Copyright John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_ALIGNMENT_OF_HPP_INCLUDED #define BOOST_TT_ALIGNMENT_OF_HPP_INCLUDED #include #include #include // should be the last #include #include #ifdef BOOST_MSVC # pragma warning(push) # pragma warning(disable: 4121 4512) // alignment is sensitive to packing #endif #if defined(__BORLANDC__) && (__BORLANDC__ < 0x600) #pragma option push -Vx- -Ve- #endif namespace boost { template struct alignment_of; // get the alignment of some arbitrary type: namespace detail { #ifdef BOOST_MSVC #pragma warning(push) #pragma warning(disable:4324) // structure was padded due to __declspec(align()) #endif template struct alignment_of_hack { char c; T t; alignment_of_hack(); }; #ifdef BOOST_MSVC #pragma warning(pop) #endif template struct alignment_logic { BOOST_STATIC_CONSTANT(std::size_t, value = A < S ? A : S); }; template< typename T > struct alignment_of_impl { #if defined(BOOST_MSVC) && (BOOST_MSVC >= 1400) // // With MSVC both the native __alignof operator // and our own logic gets things wrong from time to time :-( // Using a combination of the two seems to make the most of a bad job: // BOOST_STATIC_CONSTANT(std::size_t, value = (::boost::detail::alignment_logic< sizeof(::boost::detail::alignment_of_hack) - sizeof(T), __alignof(T) >::value)); #elif !defined(BOOST_ALIGNMENT_OF) BOOST_STATIC_CONSTANT(std::size_t, value = (::boost::detail::alignment_logic< sizeof(::boost::detail::alignment_of_hack) - sizeof(T), sizeof(T) >::value)); #else // // We put this here, rather than in the definition of // alignment_of below, because MSVC's __alignof doesn't // always work in that context for some unexplained reason. // (See type_with_alignment tests for test cases). // BOOST_STATIC_CONSTANT(std::size_t, value = BOOST_ALIGNMENT_OF(T)); #endif }; } // namespace detail BOOST_TT_AUX_SIZE_T_TRAIT_DEF1(alignment_of,T,::boost::detail::alignment_of_impl::value) // references have to be treated specially, assume // that a reference is just a special pointer: #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION template struct alignment_of : public alignment_of { }; #endif #ifdef __BORLANDC__ // long double gives an incorrect value of 10 (!) // unless we do this... struct long_double_wrapper{ long double ld; }; template<> struct alignment_of : public alignment_of{}; #endif // void has to be treated specially: BOOST_TT_AUX_SIZE_T_TRAIT_SPEC1(alignment_of,void,0) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_SIZE_T_TRAIT_SPEC1(alignment_of,void const,0) BOOST_TT_AUX_SIZE_T_TRAIT_SPEC1(alignment_of,void volatile,0) BOOST_TT_AUX_SIZE_T_TRAIT_SPEC1(alignment_of,void const volatile,0) #endif } // namespace boost #if defined(__BORLANDC__) && (__BORLANDC__ < 0x600) #pragma option pop #endif #ifdef BOOST_MSVC # pragma warning(pop) #endif #include #endif // BOOST_TT_ALIGNMENT_OF_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_plus_assign.hpp0000644000000000000000000000007412717644140023270 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_plus_assign.hpp0000664000372100037210000000506212717644140024122 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_PLUS_ASSIGN_HPP_INCLUDED #define BOOST_TT_HAS_PLUS_ASSIGN_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_plus_assign #define BOOST_TT_TRAIT_OP += #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* Lhs==pointer and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ /* Lhs==void* and Rhs==fundamental */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_void< Lhs_noptr >::value,\ ::boost::is_fundamental< Rhs_nocv >::value\ >::value,\ /* Rhs==void* and Lhs==fundamental */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::is_void< Rhs_noptr >::value,\ ::boost::is_fundamental< Lhs_nocv >::value\ >::value,\ /* Lhs==pointer and Rhs==fundamental and Rhs!=integral */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::type_traits::ice_not< ::boost::is_integral< Rhs_noref >::value >::value\ >::value,\ /* Rhs==pointer and Lhs==fundamental and Lhs!=bool */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::type_traits::ice_not< ::boost::is_same< Lhs_nocv, bool >::value >::value\ >::value,\ /* (Lhs==fundamental or Lhs==pointer) and (Rhs==fundamental or Rhs==pointer) and (Lhs==const) */\ ::boost::type_traits::ice_and<\ ::boost::type_traits::ice_or<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_pointer< Lhs_noref >::value\ >::value,\ ::boost::type_traits::ice_or<\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ ::boost::is_const< Lhs_noref >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_complement.hpp0000644000000000000000000000007312717644140023103 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/has_complement.hpp0000664000372100037210000000201312717644140023727 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_COMPLEMENT_HPP_INCLUDED #define BOOST_TT_HAS_COMPLEMENT_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_complement #define BOOST_TT_TRAIT_OP ~ #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* pointer */\ ::boost::is_pointer< Rhs_noref >::value,\ /* fundamental non integral */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Rhs_noref >::value,\ ::boost::type_traits::ice_not< ::boost::is_integral< Rhs_noref >::value >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/broken_compiler_spec.hpp0000644000000000000000000000007412717644140024272 xustar0030 atime=1463765180.177719552 30 ctime=1463765201.173551863 madp-0.4/src/boost/boost/type_traits/broken_compiler_spec.hpp0000664000372100037210000001266112717644140025127 0ustar00fransfrans00000000000000 // Copyright 2001-2003 Aleksey Gurtovoy. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_BROKEN_COMPILER_SPEC_HPP_INCLUDED #define BOOST_TT_BROKEN_COMPILER_SPEC_HPP_INCLUDED #include #include // these are needed regardless of BOOST_TT_NO_BROKEN_COMPILER_SPEC #if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) namespace boost { namespace detail { template< typename T > struct remove_const_impl { typedef T type; }; template< typename T > struct remove_volatile_impl { typedef T type; }; template< typename T > struct remove_pointer_impl { typedef T type; }; template< typename T > struct remove_reference_impl { typedef T type; }; typedef int invoke_BOOST_TT_BROKEN_COMPILER_SPEC_outside_all_namespaces; }} #endif // agurt, 27/jun/03: disable the workaround if user defined // BOOST_TT_NO_BROKEN_COMPILER_SPEC #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \ || defined(BOOST_TT_NO_BROKEN_COMPILER_SPEC) # define BOOST_TT_BROKEN_COMPILER_SPEC(T) /**/ #else // same as BOOST_TT_AUX_TYPE_TRAIT_IMPL_SPEC1 macro, except that it // never gets #undef-ined # define BOOST_TT_AUX_BROKEN_TYPE_TRAIT_SPEC1(trait,spec,result) \ template<> struct trait##_impl \ { \ typedef result type; \ }; \ /**/ # define BOOST_TT_AUX_REMOVE_CONST_VOLATILE_RANK1_SPEC(T) \ BOOST_TT_AUX_BROKEN_TYPE_TRAIT_SPEC1(remove_const,T const,T) \ BOOST_TT_AUX_BROKEN_TYPE_TRAIT_SPEC1(remove_const,T const volatile,T volatile) \ BOOST_TT_AUX_BROKEN_TYPE_TRAIT_SPEC1(remove_volatile,T volatile,T) \ BOOST_TT_AUX_BROKEN_TYPE_TRAIT_SPEC1(remove_volatile,T const volatile,T const) \ /**/ # define BOOST_TT_AUX_REMOVE_PTR_REF_RANK_1_SPEC(T) \ BOOST_TT_AUX_BROKEN_TYPE_TRAIT_SPEC1(remove_pointer,T*,T) \ BOOST_TT_AUX_BROKEN_TYPE_TRAIT_SPEC1(remove_pointer,T*const,T) \ BOOST_TT_AUX_BROKEN_TYPE_TRAIT_SPEC1(remove_pointer,T*volatile,T) \ BOOST_TT_AUX_BROKEN_TYPE_TRAIT_SPEC1(remove_pointer,T*const volatile,T) \ BOOST_TT_AUX_BROKEN_TYPE_TRAIT_SPEC1(remove_reference,T&,T) \ /**/ # define BOOST_TT_AUX_REMOVE_PTR_REF_RANK_2_SPEC(T) \ BOOST_TT_AUX_REMOVE_PTR_REF_RANK_1_SPEC(T) \ BOOST_TT_AUX_REMOVE_PTR_REF_RANK_1_SPEC(T const) \ BOOST_TT_AUX_REMOVE_PTR_REF_RANK_1_SPEC(T volatile) \ BOOST_TT_AUX_REMOVE_PTR_REF_RANK_1_SPEC(T const volatile) \ /**/ # define BOOST_TT_AUX_REMOVE_ALL_RANK_1_SPEC(T) \ BOOST_TT_AUX_REMOVE_PTR_REF_RANK_2_SPEC(T) \ BOOST_TT_AUX_REMOVE_CONST_VOLATILE_RANK1_SPEC(T) \ /**/ # define BOOST_TT_AUX_REMOVE_ALL_RANK_2_SPEC(T) \ BOOST_TT_AUX_REMOVE_ALL_RANK_1_SPEC(T*) \ BOOST_TT_AUX_REMOVE_ALL_RANK_1_SPEC(T const*) \ BOOST_TT_AUX_REMOVE_ALL_RANK_1_SPEC(T volatile*) \ BOOST_TT_AUX_REMOVE_ALL_RANK_1_SPEC(T const volatile*) \ /**/ # define BOOST_TT_BROKEN_COMPILER_SPEC(T) \ namespace boost { namespace detail { \ typedef invoke_BOOST_TT_BROKEN_COMPILER_SPEC_outside_all_namespaces \ please_invoke_BOOST_TT_BROKEN_COMPILER_SPEC_outside_all_namespaces; \ BOOST_TT_AUX_REMOVE_ALL_RANK_1_SPEC(T) \ BOOST_TT_AUX_REMOVE_ALL_RANK_2_SPEC(T) \ BOOST_TT_AUX_REMOVE_ALL_RANK_2_SPEC(T*) \ BOOST_TT_AUX_REMOVE_ALL_RANK_2_SPEC(T const*) \ BOOST_TT_AUX_REMOVE_ALL_RANK_2_SPEC(T volatile*) \ BOOST_TT_AUX_REMOVE_ALL_RANK_2_SPEC(T const volatile*) \ }} \ /**/ # include #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION BOOST_TT_BROKEN_COMPILER_SPEC(bool) BOOST_TT_BROKEN_COMPILER_SPEC(char) #ifndef BOOST_NO_INTRINSIC_WCHAR_T BOOST_TT_BROKEN_COMPILER_SPEC(wchar_t) #endif BOOST_TT_BROKEN_COMPILER_SPEC(signed char) BOOST_TT_BROKEN_COMPILER_SPEC(unsigned char) BOOST_TT_BROKEN_COMPILER_SPEC(signed short) BOOST_TT_BROKEN_COMPILER_SPEC(unsigned short) BOOST_TT_BROKEN_COMPILER_SPEC(signed int) BOOST_TT_BROKEN_COMPILER_SPEC(unsigned int) BOOST_TT_BROKEN_COMPILER_SPEC(signed long) BOOST_TT_BROKEN_COMPILER_SPEC(unsigned long) BOOST_TT_BROKEN_COMPILER_SPEC(float) BOOST_TT_BROKEN_COMPILER_SPEC(double) //BOOST_TT_BROKEN_COMPILER_SPEC(long double) // for backward compatibility #define BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(T) \ BOOST_TT_BROKEN_COMPILER_SPEC(T) \ /**/ #endif // BOOST_TT_BROKEN_COMPILER_SPEC_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_modulus_assign.hpp0000644000000000000000000000007412717644140023775 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/has_modulus_assign.hpp0000664000372100037210000000411712717644140024627 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_MODULUS_ASSIGN_HPP_INCLUDED #define BOOST_TT_HAS_MODULUS_ASSIGN_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_modulus_assign #define BOOST_TT_TRAIT_OP %= #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* Lhs==fundamental and Rhs==fundamental and (Lhs!=integral or Rhs!=integral) */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::type_traits::ice_or<\ ::boost::type_traits::ice_not< ::boost::is_integral< Lhs_noref >::value >::value,\ ::boost::type_traits::ice_not< ::boost::is_integral< Rhs_noref >::value >::value\ >::value\ >::value,\ /* Lhs==fundamental and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ /* Rhs==fundamental and Lhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_pointer< Lhs_noref >::value\ >::value,\ /* Lhs==pointer and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ /* Lhs==fundamental and Rhs==fundamental and Lhs==const */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_const< Lhs_noref >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/ice.hpp0000644000000000000000000000007412717644140020646 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.181551798 madp-0.4/src/boost/boost/type_traits/ice.hpp0000664000372100037210000000140012717644140021470 0ustar00fransfrans00000000000000 // (C) Copyright John Maddock and Steve Cleary 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. // // macros and helpers for working with integral-constant-expressions. #ifndef BOOST_TT_ICE_HPP_INCLUDED #define BOOST_TT_ICE_HPP_INCLUDED #include #include #include #include #include #endif // BOOST_TT_ICE_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_nothrow_move_assignable.hpp0000644000000000000000000000007412717644140025517 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/is_nothrow_move_assignable.hpp0000664000372100037210000000601212717644140026345 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // (C) Copyright Eric Friedman 2002-2003. // (C) Copyright Antony Polukhin 2013. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_NOTHROW_MOVE_ASSIGNABLE_HPP_INCLUDED #define BOOST_TT_IS_NOTHROW_MOVE_ASSIGNABLE_HPP_INCLUDED #include #include #include #include #include #include #include #include #include #include // should be the last #include #include namespace boost { namespace detail{ #ifndef BOOST_NO_CXX11_NOEXCEPT template struct false_or_cpp11_noexcept_move_assignable: public ::boost::false_type {}; template struct false_or_cpp11_noexcept_move_assignable < T, typename ::boost::enable_if_c() = ::boost::declval())>::type > : public ::boost::integral_constant() = ::boost::declval())> {}; template struct is_nothrow_move_assignable_imp{ BOOST_STATIC_CONSTANT(bool, value = ( ::boost::type_traits::ice_and< ::boost::type_traits::ice_not< ::boost::is_volatile::value >::value, ::boost::type_traits::ice_not< ::boost::is_reference::value >::value, ::boost::detail::false_or_cpp11_noexcept_move_assignable::value >::value)); }; #else template struct is_nothrow_move_assignable_imp{ BOOST_STATIC_CONSTANT(bool, value = ( ::boost::type_traits::ice_and< ::boost::type_traits::ice_or< ::boost::has_trivial_move_assign::value, ::boost::has_nothrow_assign::value >::value, ::boost::type_traits::ice_not< ::boost::is_array::value >::value >::value)); }; #endif } BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_nothrow_move_assignable,T,::boost::detail::is_nothrow_move_assignable_imp::value) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(is_nothrow_move_assignable,void,false) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_SPEC1(is_nothrow_move_assignable,void const,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(is_nothrow_move_assignable,void const volatile,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(is_nothrow_move_assignable,void volatile,false) #endif } // namespace boost #include #endif // BOOST_TT_IS_NOTHROW_MOVE_ASSIGNABLE_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_logical_and.hpp0000644000000000000000000000007312717644140023174 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/has_logical_and.hpp0000664000372100037210000000264012717644140024026 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_LOGICAL_AND_HPP_INCLUDED #define BOOST_TT_HAS_LOGICAL_AND_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_logical_and #define BOOST_TT_TRAIT_OP && #define BOOST_TT_FORBIDDEN_IF\ /* pointer with fundamental non convertible to bool */\ ::boost::type_traits::ice_or<\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::type_traits::ice_not< ::boost::is_convertible< Rhs_nocv, bool >::value >::value\ >::value\ >::value,\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::type_traits::ice_not< ::boost::is_convertible< Lhs_nocv, bool >::value >::value\ >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_polymorphic.hpp0000644000000000000000000000007412717644140023146 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/is_polymorphic.hpp0000664000372100037210000000543212717644140024001 0ustar00fransfrans00000000000000// (C) Copyright John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_POLYMORPHIC_HPP #define BOOST_TT_IS_POLYMORPHIC_HPP #include #ifndef BOOST_IS_POLYMORPHIC #include #include #endif // should be the last #include #include #include namespace boost{ #ifndef BOOST_IS_POLYMORPHIC namespace detail{ template struct is_polymorphic_imp1 { # if BOOST_WORKAROUND(__MWERKS__, <= 0x2407) // CWPro7 should return false always. typedef char d1, (&d2)[2]; # else typedef typename remove_cv::type ncvT; struct d1 : public ncvT { d1(); # if !defined(__GNUC__) // this raises warnings with some classes, and buys nothing with GCC ~d1()throw(); # endif char padding[256]; private: // keep some picky compilers happy: d1(const d1&); d1& operator=(const d1&); }; struct d2 : public ncvT { d2(); virtual ~d2()throw(); # if !defined(BOOST_MSVC) && !defined(__ICL) // for some reason this messes up VC++ when T has virtual bases, // probably likewise for compilers that use the same ABI: struct unique{}; virtual void unique_name_to_boost5487629(unique*); # endif char padding[256]; private: // keep some picky compilers happy: d2(const d2&); d2& operator=(const d2&); }; # endif BOOST_STATIC_CONSTANT(bool, value = (sizeof(d2) == sizeof(d1))); }; template struct is_polymorphic_imp2 { BOOST_STATIC_CONSTANT(bool, value = false); }; template struct is_polymorphic_selector { template struct rebind { typedef is_polymorphic_imp2 type; }; }; template <> struct is_polymorphic_selector { template struct rebind { typedef is_polymorphic_imp1 type; }; }; template struct is_polymorphic_imp { typedef is_polymorphic_selector< ::boost::is_class::value> selector; typedef typename selector::template rebind binder; typedef typename binder::type imp_type; BOOST_STATIC_CONSTANT(bool, value = imp_type::value); }; } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_polymorphic,T,::boost::detail::is_polymorphic_imp::value) #else // BOOST_IS_POLYMORPHIC BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_polymorphic,T,BOOST_IS_POLYMORPHIC(T)) #endif } // namespace boost #include #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_object.hpp0000644000000000000000000000007412717644140022047 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/is_object.hpp0000664000372100037210000000334112717644140022677 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_OBJECT_HPP_INCLUDED #define BOOST_TT_IS_OBJECT_HPP_INCLUDED #include #include #include #include #include #include // should be the last #include #include namespace boost { namespace detail { template struct is_object_impl { #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_and< ::boost::type_traits::ice_not< ::boost::is_reference::value>::value, ::boost::type_traits::ice_not< ::boost::is_void::value>::value, ::boost::type_traits::ice_not< ::boost::is_function::value>::value >::value)); #else BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_and< ::boost::type_traits::ice_not< ::boost::is_reference::value>::value, ::boost::type_traits::ice_not< ::boost::is_void::value>::value >::value)); #endif }; } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_object,T,::boost::detail::is_object_impl::value) } // namespace boost #include #endif // BOOST_TT_IS_OBJECT_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/add_reference.hpp0000644000000000000000000000007412717644140022654 xustar0030 atime=1463765180.177719552 30 ctime=1463765201.173551863 madp-0.4/src/boost/boost/type_traits/add_reference.hpp0000664000372100037210000000527412717644140023513 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_ADD_REFERENCE_HPP_INCLUDED #define BOOST_TT_ADD_REFERENCE_HPP_INCLUDED #include #include #include // should be the last #include #include namespace boost { namespace detail { #if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) && defined(BOOST_MSVC6_MEMBER_TEMPLATES) template struct reference_adder { template struct result_ { typedef T& type; }; }; template <> struct reference_adder { template struct result_ { typedef T type; }; }; template struct add_reference_impl { typedef typename reference_adder< ::boost::is_reference::value >::template result_ result; typedef typename result::type type; }; #else // // We can't filter out rvalue_references at the same level as // references or we get ambiguities from msvc: // template struct add_reference_rvalue_layer { typedef T& type; }; #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES template struct add_reference_rvalue_layer { typedef T&& type; }; #endif template struct add_reference_impl { typedef typename add_reference_rvalue_layer::type type; }; #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION BOOST_TT_AUX_TYPE_TRAIT_IMPL_PARTIAL_SPEC1_1(typename T,add_reference,T&,T&) #endif #endif // these full specialisations are always required: BOOST_TT_AUX_TYPE_TRAIT_IMPL_SPEC1(add_reference,void,void) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_TYPE_TRAIT_IMPL_SPEC1(add_reference,void const,void const) BOOST_TT_AUX_TYPE_TRAIT_IMPL_SPEC1(add_reference,void volatile,void volatile) BOOST_TT_AUX_TYPE_TRAIT_IMPL_SPEC1(add_reference,void const volatile,void const volatile) #endif } // namespace detail BOOST_TT_AUX_TYPE_TRAIT_DEF1(add_reference,T,typename boost::detail::add_reference_impl::type) // agurt, 07/mar/03: workaround Borland's ill-formed sensitivity to an additional // level of indirection, here #if BOOST_WORKAROUND(__BORLANDC__, < 0x600) BOOST_TT_AUX_TYPE_TRAIT_PARTIAL_SPEC1_1(typename T,add_reference,T&,T&) #endif } // namespace boost #include #endif // BOOST_TT_ADD_REFERENCE_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_reference.hpp0000644000000000000000000000007412717644140022537 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/is_reference.hpp0000664000372100037210000000250512717644140023370 0ustar00fransfrans00000000000000 // (C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes, // Howard Hinnant and John Maddock 2000, 2010. // (C) Copyright Mat Marcus, Jesse Jones and Adobe Systems Inc 2001 // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_REFERENCE_HPP_INCLUDED #define BOOST_TT_IS_REFERENCE_HPP_INCLUDED #include #include #include #include // should be the last #include #include namespace boost { namespace detail { template struct is_reference_impl { BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_or< ::boost::is_lvalue_reference::value, ::boost::is_rvalue_reference::value >::value)); }; } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_reference,T,::boost::detail::is_reference_impl::value) } // namespace boost #include #endif // BOOST_TT_IS_REFERENCE_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/type_with_alignment.hpp0000644000000000000000000000007412717644140024160 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/type_with_alignment.hpp0000664000372100037210000003114112717644140025007 0ustar00fransfrans00000000000000// (C) Copyright John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_TYPE_WITH_ALIGNMENT_INCLUDED #define BOOST_TT_TYPE_WITH_ALIGNMENT_INCLUDED #include #include #include #include #include #include #include #include #include #include // should be the last #include #include #include #ifdef BOOST_MSVC # pragma warning(push) # pragma warning(disable: 4121) // alignment is sensitive to packing #endif namespace boost { #ifndef __BORLANDC__ namespace detail { class alignment_dummy; typedef void (*function_ptr)(); typedef int (alignment_dummy::*member_ptr); typedef int (alignment_dummy::*member_function_ptr)(); #ifdef BOOST_HAS_LONG_LONG #define BOOST_TT_ALIGNMENT_BASE_TYPES BOOST_PP_TUPLE_TO_LIST( \ 12, ( \ char, short, int, long, ::boost::long_long_type, float, double, long double \ , void*, function_ptr, member_ptr, member_function_ptr)) #else #define BOOST_TT_ALIGNMENT_BASE_TYPES BOOST_PP_TUPLE_TO_LIST( \ 11, ( \ char, short, int, long, float, double, long double \ , void*, function_ptr, member_ptr, member_function_ptr)) #endif #define BOOST_TT_HAS_ONE_T(D,Data,T) boost::detail::has_one_T< T > #define BOOST_TT_ALIGNMENT_STRUCT_TYPES \ BOOST_PP_LIST_TRANSFORM(BOOST_TT_HAS_ONE_T, \ X, \ BOOST_TT_ALIGNMENT_BASE_TYPES) #define BOOST_TT_ALIGNMENT_TYPES \ BOOST_PP_LIST_APPEND(BOOST_TT_ALIGNMENT_BASE_TYPES, \ BOOST_TT_ALIGNMENT_STRUCT_TYPES) // // lower_alignment_helper -- // // This template gets instantiated a lot, so use partial // specialization when available to reduce the compiler burden. // #ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION template struct lower_alignment_helper_impl { template struct apply { typedef char type; enum { value = true }; }; }; template <> struct lower_alignment_helper_impl { template struct apply : public mpl::if_c<(alignment_of::value == target), TestType, char> { enum { value = (alignment_of::value == target) }; }; }; template struct lower_alignment_helper : public lower_alignment_helper_impl::template apply { }; #else template struct lower_alignment_helper { typedef char type; enum { value = true }; }; template struct lower_alignment_helper { enum { value = (alignment_of::value == target) }; typedef typename mpl::if_c::type type; }; #endif #define BOOST_TT_CHOOSE_MIN_ALIGNMENT(R,P,I,T) \ typename lower_alignment_helper< \ BOOST_PP_CAT(found,I),target,T \ >::type BOOST_PP_CAT(t,I); \ enum { \ BOOST_PP_CAT(found,BOOST_PP_INC(I)) \ = lower_alignment_helper::value \ }; #define BOOST_TT_CHOOSE_T(R,P,I,T) T BOOST_PP_CAT(t,I); template struct has_one_T { T data; }; template union lower_alignment { enum { found0 = false }; BOOST_PP_LIST_FOR_EACH_I( BOOST_TT_CHOOSE_MIN_ALIGNMENT , ignored , BOOST_TT_ALIGNMENT_TYPES ) }; union max_align { BOOST_PP_LIST_FOR_EACH_I( BOOST_TT_CHOOSE_T , ignored , BOOST_TT_ALIGNMENT_TYPES ) }; #undef BOOST_TT_ALIGNMENT_BASE_TYPES #undef BOOST_TT_HAS_ONE_T #undef BOOST_TT_ALIGNMENT_STRUCT_TYPES #undef BOOST_TT_ALIGNMENT_TYPES #undef BOOST_TT_CHOOSE_MIN_ALIGNMENT #undef BOOST_TT_CHOOSE_T template struct is_aligned { BOOST_STATIC_CONSTANT(bool, value = (TAlign >= Align) & (TAlign % Align == 0) ); }; #ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,::boost::detail::max_align,true) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,::boost::detail::lower_alignment<1> ,true) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,::boost::detail::lower_alignment<2> ,true) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,::boost::detail::lower_alignment<4> ,true) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,::boost::detail::lower_alignment<8> ,true) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,::boost::detail::lower_alignment<10> ,true) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,::boost::detail::lower_alignment<16> ,true) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,::boost::detail::lower_alignment<32> ,true) #endif } // namespace detail #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION template struct is_pod< ::boost::detail::lower_alignment > { BOOST_STATIC_CONSTANT(std::size_t, value = true); }; #endif // This alignment method originally due to Brian Parker, implemented by David // Abrahams, and then ported here by Doug Gregor. namespace detail{ template class type_with_alignment_imp { typedef ::boost::detail::lower_alignment t1; typedef typename mpl::if_c< ::boost::detail::is_aligned< ::boost::alignment_of::value,Align >::value , t1 , ::boost::detail::max_align >::type align_t; BOOST_STATIC_CONSTANT(std::size_t, found = alignment_of::value); BOOST_STATIC_ASSERT(found >= Align); BOOST_STATIC_ASSERT(found % Align == 0); public: typedef align_t type; }; } template class type_with_alignment : public ::boost::detail::type_with_alignment_imp { }; #if defined(__GNUC__) namespace align { struct __attribute__((__aligned__(2))) a2 {}; struct __attribute__((__aligned__(4))) a4 {}; struct __attribute__((__aligned__(8))) a8 {}; struct __attribute__((__aligned__(16))) a16 {}; struct __attribute__((__aligned__(32))) a32 {}; struct __attribute__((__aligned__(64))) a64 {}; struct __attribute__((__aligned__(128))) a128 {}; } template<> class type_with_alignment<1> { public: typedef char type; }; template<> class type_with_alignment<2> { public: typedef align::a2 type; }; template<> class type_with_alignment<4> { public: typedef align::a4 type; }; template<> class type_with_alignment<8> { public: typedef align::a8 type; }; template<> class type_with_alignment<16> { public: typedef align::a16 type; }; template<> class type_with_alignment<32> { public: typedef align::a32 type; }; template<> class type_with_alignment<64> { public: typedef align::a64 type; }; template<> class type_with_alignment<128> { public: typedef align::a128 type; }; namespace detail { BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,::boost::align::a2,true) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,::boost::align::a4,true) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,::boost::align::a8,true) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,::boost::align::a16,true) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,::boost::align::a32,true) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,::boost::align::a64,true) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,::boost::align::a128,true) } #endif #if (defined(BOOST_MSVC) || (defined(BOOST_INTEL) && defined(_MSC_VER))) && _MSC_VER >= 1300 // // MSVC supports types which have alignments greater than the normal // maximum: these are used for example in the types __m64 and __m128 // to provide types with alignment requirements which match the SSE // registers. Therefore we extend type_with_alignment<> to support // such types, however, we have to be careful to use a builtin type // whenever possible otherwise we break previously working code: // see http://article.gmane.org/gmane.comp.lib.boost.devel/173011 // for an example and test case. Thus types like a8 below will // be used *only* if the existing implementation can't provide a type // with suitable alignment. This does mean however, that type_with_alignment<> // may return a type which cannot be passed through a function call // by value (and neither can any type containing such a type like // Boost.Optional). However, this only happens when we have no choice // in the matter because no other "ordinary" type is available. // namespace align { struct __declspec(align(8)) a8 { char m[8]; typedef a8 type; }; struct __declspec(align(16)) a16 { char m[16]; typedef a16 type; }; struct __declspec(align(32)) a32 { char m[32]; typedef a32 type; }; struct __declspec(align(64)) a64 { char m[64]; typedef a64 type; }; struct __declspec(align(128)) a128 { char m[128]; typedef a128 type; }; } template<> class type_with_alignment<8> { typedef mpl::if_c< ::boost::alignment_of::value < 8, align::a8, boost::detail::type_with_alignment_imp<8> >::type t1; public: typedef t1::type type; }; template<> class type_with_alignment<16> { typedef mpl::if_c< ::boost::alignment_of::value < 16, align::a16, boost::detail::type_with_alignment_imp<16> >::type t1; public: typedef t1::type type; }; template<> class type_with_alignment<32> { typedef mpl::if_c< ::boost::alignment_of::value < 32, align::a32, boost::detail::type_with_alignment_imp<32> >::type t1; public: typedef t1::type type; }; template<> class type_with_alignment<64> { typedef mpl::if_c< ::boost::alignment_of::value < 64, align::a64, boost::detail::type_with_alignment_imp<64> >::type t1; public: typedef t1::type type; }; template<> class type_with_alignment<128> { typedef mpl::if_c< ::boost::alignment_of::value < 128, align::a128, boost::detail::type_with_alignment_imp<128> >::type t1; public: typedef t1::type type; }; namespace detail { BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,::boost::align::a8,true) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,::boost::align::a16,true) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,::boost::align::a32,true) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,::boost::align::a64,true) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,::boost::align::a128,true) } #endif #else // // Borland specific version, we have this for two reasons: // 1) The version above doesn't always compile (with the new test cases for example) // 2) Because of Borlands #pragma option we can create types with alignments that are // greater that the largest aligned builtin type. namespace align{ #pragma option push -a16 struct a2{ short s; }; struct a4{ int s; }; struct a8{ double s; }; struct a16{ long double s; }; #pragma option pop } namespace detail { typedef ::boost::align::a16 max_align; //#if ! BOOST_WORKAROUND(__CODEGEARC__, BOOST_TESTED_AT(0x610)) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,::boost::align::a2,true) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,::boost::align::a4,true) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,::boost::align::a8,true) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pod,::boost::align::a16,true) //#endif } template struct type_with_alignment { // We should never get to here, but if we do use the maximally // aligned type: // BOOST_STATIC_ASSERT(0); typedef align::a16 type; }; template <> struct type_with_alignment<1>{ typedef char type; }; template <> struct type_with_alignment<2>{ typedef align::a2 type; }; template <> struct type_with_alignment<4>{ typedef align::a4 type; }; template <> struct type_with_alignment<8>{ typedef align::a8 type; }; template <> struct type_with_alignment<16>{ typedef align::a16 type; }; #endif } // namespace boost #ifdef BOOST_MSVC # pragma warning(pop) #endif #include #endif // BOOST_TT_TYPE_WITH_ALIGNMENT_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_modulus.hpp0000644000000000000000000000007312717644140022430 xustar0030 atime=1463765180.181719519 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/has_modulus.hpp0000664000372100037210000000344412717644140023265 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_MODULUS_HPP_INCLUDED #define BOOST_TT_HAS_MODULUS_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_modulus #define BOOST_TT_TRAIT_OP % #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* Lhs==fundamental and Rhs==fundamental and (Lhs!=integral or Rhs!=integral) */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::type_traits::ice_or<\ ::boost::type_traits::ice_not< ::boost::is_integral< Lhs_noref >::value >::value,\ ::boost::type_traits::ice_not< ::boost::is_integral< Rhs_noref >::value >::value\ >::value\ >::value,\ /* Lhs==fundamental and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ /* Rhs==fundamental and Lhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_pointer< Lhs_noref >::value\ >::value,\ /* Lhs==pointer and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/floating_point_promotion.hpp0000644000000000000000000000007312717644140025227 xustar0030 atime=1463765180.177719552 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/floating_point_promotion.hpp0000664000372100037210000000401712717644140026061 0ustar00fransfrans00000000000000// Copyright 2005 Alexander Nasonov. // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef FILE_boost_type_traits_floating_point_promotion_hpp_INCLUDED #define FILE_boost_type_traits_floating_point_promotion_hpp_INCLUDED #include #ifdef BOOST_NO_CV_SPECIALIZATIONS #include #include #include #include #include #include #endif // Should be the last #include #include namespace boost { namespace type_traits { namespace detail { #ifndef BOOST_NO_CV_SPECIALIZATIONS template struct floating_point_promotion { typedef T type; }; template<> struct floating_point_promotion { typedef double type; }; template<> struct floating_point_promotion { typedef double const type; }; template<> struct floating_point_promotion { typedef double volatile type; }; template<> struct floating_point_promotion { typedef double const volatile type; }; #else template struct floating_point_promotion : mpl::at< mpl::vector< T, double, double const, double volatile, double const volatile > , mpl::plus< is_same , mpl::multiplies< is_same , mpl::int_<2> > , mpl::multiplies< is_same , mpl::int_<3> > , mpl::multiplies< is_same, mpl::int_<4> > > > { }; #endif } } BOOST_TT_AUX_TYPE_TRAIT_DEF1( floating_point_promotion , T , BOOST_DEDUCED_TYPENAME boost::type_traits::detail::floating_point_promotion::type ) } #include #endif // #ifndef FILE_boost_type_traits_floating_point_promotion_hpp_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/has_minus_assign.hpp0000644000000000000000000000007312717644140023437 xustar0030 atime=1463765180.181719519 29 ctime=1463765201.17755183 madp-0.4/src/boost/boost/type_traits/has_minus_assign.hpp0000664000372100037210000000471012717644140024271 0ustar00fransfrans00000000000000// (C) Copyright 2009-2011 Frederic Bron. // // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_HAS_MINUS_ASSIGN_HPP_INCLUDED #define BOOST_TT_HAS_MINUS_ASSIGN_HPP_INCLUDED #define BOOST_TT_TRAIT_NAME has_minus_assign #define BOOST_TT_TRAIT_OP -= #define BOOST_TT_FORBIDDEN_IF\ ::boost::type_traits::ice_or<\ /* Lhs==pointer and Rhs==fundamental and Rhs!=integral */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::type_traits::ice_not< ::boost::is_integral< Rhs_noref >::value >::value\ >::value,\ /* Lhs==void* and Rhs==fundamental */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_void< Lhs_noptr >::value,\ ::boost::is_fundamental< Rhs_nocv >::value\ >::value,\ /* Rhs==void* and Lhs==fundamental */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Rhs_noref >::value,\ ::boost::is_void< Rhs_noptr >::value,\ ::boost::is_fundamental< Lhs_nocv >::value\ >::value,\ /* Lhs=fundamental and Rhs=pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ /* Lhs==pointer and Rhs==pointer */\ ::boost::type_traits::ice_and<\ ::boost::is_pointer< Lhs_noref >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ /* (Lhs==fundamental or Lhs==pointer) and (Rhs==fundamental or Rhs==pointer) and (Lhs==const) */\ ::boost::type_traits::ice_and<\ ::boost::type_traits::ice_or<\ ::boost::is_fundamental< Lhs_nocv >::value,\ ::boost::is_pointer< Lhs_noref >::value\ >::value,\ ::boost::type_traits::ice_or<\ ::boost::is_fundamental< Rhs_nocv >::value,\ ::boost::is_pointer< Rhs_noref >::value\ >::value,\ ::boost::is_const< Lhs_noref >::value\ >::value\ >::value #include #undef BOOST_TT_TRAIT_NAME #undef BOOST_TT_TRAIT_OP #undef BOOST_TT_FORBIDDEN_IF #endif madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_pointer.hpp0000644000000000000000000000007412717644140022261 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/is_pointer.hpp0000664000372100037210000001177712717644140023125 0ustar00fransfrans00000000000000 // (C) Copyright Dave Abrahams, Steve Cleary, Beman Dawes, // Howard Hinnant and John Maddock 2000. // (C) Copyright Mat Marcus, Jesse Jones and Adobe Systems Inc 2001 // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. // Fixed is_pointer, is_reference, is_const, is_volatile, is_same, // is_member_pointer based on the Simulated Partial Specialization work // of Mat Marcus and Jesse Jones. See http://opensource.adobe.com or // http://groups.yahoo.com/group/boost/message/5441 // Some workarounds in here use ideas suggested from "Generic: // Mappings between Types and Values" // by Andrei Alexandrescu (see http://www.cuj.com/experts/1810/alexandr.html). #ifndef BOOST_TT_IS_POINTER_HPP_INCLUDED #define BOOST_TT_IS_POINTER_HPP_INCLUDED #include #include #include #include #if !BOOST_WORKAROUND(BOOST_MSVC,<=1300) #include #endif #ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION # include # include # include # include # include #endif // should be the last #include #include namespace boost { #if defined( __CODEGEARC__ ) BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_pointer,T,__is_pointer(T)) #elif !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) namespace detail { template< typename T > struct is_pointer_helper { BOOST_STATIC_CONSTANT(bool, value = false); }; # define TT_AUX_BOOL_TRAIT_HELPER_PARTIAL_SPEC(helper,sp,result) \ template< typename T > struct helper \ { \ BOOST_STATIC_CONSTANT(bool, value = result); \ }; \ /**/ TT_AUX_BOOL_TRAIT_HELPER_PARTIAL_SPEC(is_pointer_helper,T*,true) # undef TT_AUX_BOOL_TRAIT_HELPER_PARTIAL_SPEC template< typename T > struct is_pointer_impl { #if BOOST_WORKAROUND(BOOST_MSVC,<=1300) BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_and< ::boost::detail::is_pointer_helper::value , ::boost::type_traits::ice_not< ::boost::is_member_pointer::value >::value >::value) ); #else BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_and< ::boost::detail::is_pointer_helper::type>::value , ::boost::type_traits::ice_not< ::boost::is_member_pointer::value >::value >::value) ); #endif }; } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_pointer,T,::boost::detail::is_pointer_impl::value) #if defined(__BORLANDC__) && !defined(__COMO__) && (__BORLANDC__ < 0x600) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_pointer,T&,false) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_pointer,T& const,false) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_pointer,T& volatile,false) BOOST_TT_AUX_BOOL_TRAIT_PARTIAL_SPEC1_1(typename T,is_pointer,T& const volatile,false) #endif #else // no partial template specialization namespace detail { struct pointer_helper { pointer_helper(const volatile void*); }; yes_type BOOST_TT_DECL is_pointer_tester(pointer_helper); no_type BOOST_TT_DECL is_pointer_tester(...); template struct is_pointer_select : public ::boost::type_traits::false_result { }; template <> struct is_pointer_select { template struct result_ { static T& make_t(); BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_or< (1 == sizeof(is_pointer_tester(make_t()))), (1 == sizeof(type_traits::is_function_ptr_tester(make_t()))) >::value)); }; }; template struct is_pointer_impl : public is_pointer_select< ::boost::type_traits::ice_or< ::boost::is_reference::value , ::boost::is_array::value >::value >::template result_ { }; BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pointer,void,false) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pointer,void const,false) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pointer,void volatile,false) BOOST_TT_AUX_BOOL_TRAIT_IMPL_SPEC1(is_pointer,void const volatile,false) #endif } // namespace detail BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_pointer,T,::boost::detail::is_pointer_impl::value) #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION } // namespace boost #include #endif // BOOST_TT_IS_POINTER_HPP_INCLUDED madp-0.4/src/boost/boost/type_traits/PaxHeaders.5405/is_nothrow_move_constructible.hpp0000644000000000000000000000007412717644140026267 xustar0030 atime=1463765180.181719519 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/type_traits/is_nothrow_move_constructible.hpp0000664000372100037210000000573512717644140027130 0ustar00fransfrans00000000000000 // (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // (C) Copyright Eric Friedman 2002-2003. // (C) Copyright Antony Polukhin 2013. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. #ifndef BOOST_TT_IS_NOTHROW_MOVE_CONSTRUCTIBLE_HPP_INCLUDED #define BOOST_TT_IS_NOTHROW_MOVE_CONSTRUCTIBLE_HPP_INCLUDED #include #include #include #include #include #include #include #include #include // should be the last #include #include namespace boost { namespace detail{ #ifndef BOOST_NO_CXX11_NOEXCEPT template struct false_or_cpp11_noexcept_move_constructible: public ::boost::false_type {}; template struct false_or_cpp11_noexcept_move_constructible < T, typename ::boost::enable_if_c()))>::type > : public ::boost::integral_constant()))> {}; template struct is_nothrow_move_constructible_imp{ BOOST_STATIC_CONSTANT(bool, value = (::boost::type_traits::ice_and< ::boost::type_traits::ice_not< ::boost::is_volatile::value >::value, ::boost::type_traits::ice_not< ::boost::is_reference::value >::value, ::boost::detail::false_or_cpp11_noexcept_move_constructible::value >::value)); }; #else template struct is_nothrow_move_constructible_imp{ BOOST_STATIC_CONSTANT(bool, value =( ::boost::type_traits::ice_and< ::boost::type_traits::ice_or< ::boost::has_trivial_move_constructor::value, ::boost::has_nothrow_copy::value >::value, ::boost::type_traits::ice_not< ::boost::is_array::value >::value >::value)); }; #endif } BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_nothrow_move_constructible,T,::boost::detail::is_nothrow_move_constructible_imp::value) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(is_nothrow_move_constructible,void,false) #ifndef BOOST_NO_CV_VOID_SPECIALIZATIONS BOOST_TT_AUX_BOOL_TRAIT_SPEC1(is_nothrow_move_constructible,void const,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(is_nothrow_move_constructible,void const volatile,false) BOOST_TT_AUX_BOOL_TRAIT_SPEC1(is_nothrow_move_constructible,void volatile,false) #endif } // namespace boost #include #endif // BOOST_TT_IS_NOTHROW_MOVE_CONSTRUCTIBLE_HPP_INCLUDED madp-0.4/src/boost/boost/PaxHeaders.5405/typeof0000644000000000000000000000007412717644140016257 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/typeof/0000775000372100037210000000000012717644140017163 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/typeof/PaxHeaders.5405/message.hpp0000644000000000000000000000007412717644140020471 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/typeof/message.hpp0000664000372100037210000000045512717644140021324 0ustar00fransfrans00000000000000// Copyright (C) 2005 Arkadiy Vertleyb // Use, modification and distribution is subject to the Boost Software // License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt) #if defined(_MSC_VER) && defined BOOST_TYPEOF_MESSAGES # pragma message(BOOST_TYPEOF_TEXT) #endif #undef BOOST_TYPEOF_TEXT madp-0.4/src/boost/boost/typeof/PaxHeaders.5405/native.hpp0000644000000000000000000000007412717644140020333 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/typeof/native.hpp0000664000372100037210000000256112717644140021166 0ustar00fransfrans00000000000000// Copyright (C) 2006 Arkadiy Vertleyb // Use, modification and distribution is subject to the Boost Software // License, Version 1.0. (http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_TYPEOF_NATIVE_HPP_INCLUDED #define BOOST_TYPEOF_NATIVE_HPP_INCLUDED #ifndef MSVC_TYPEOF_HACK #ifdef BOOST_NO_SFINAE namespace boost { namespace type_of { template T& ensure_obj(const T&); }} #else #include #include namespace boost { namespace type_of { # ifdef BOOST_NO_SFINAE template T& ensure_obj(const T&); # else template typename enable_if, T&>::type ensure_obj(T&); template typename disable_if, T&>::type ensure_obj(const T&); # endif }} #endif//BOOST_NO_SFINAE #define BOOST_TYPEOF(expr) BOOST_TYPEOF_KEYWORD(boost::type_of::ensure_obj(expr)) #define BOOST_TYPEOF_TPL BOOST_TYPEOF #define BOOST_TYPEOF_NESTED_TYPEDEF_TPL(name,expr) \ struct name {\ typedef BOOST_TYPEOF_TPL(expr) type;\ }; #define BOOST_TYPEOF_NESTED_TYPEDEF(name,expr) \ struct name {\ typedef BOOST_TYPEOF(expr) type;\ }; #endif//MSVC_TYPEOF_HACK #define BOOST_TYPEOF_REGISTER_TYPE(x) #define BOOST_TYPEOF_REGISTER_TEMPLATE(x, params) #endif//BOOST_TYPEOF_NATIVE_HPP_INCLUDED madp-0.4/src/boost/boost/typeof/PaxHeaders.5405/typeof.hpp0000644000000000000000000000007412717644140020353 xustar0030 atime=1463765180.185719488 30 ctime=1463765201.185551765 madp-0.4/src/boost/boost/typeof/typeof.hpp0000664000372100037210000001450612717644140021210 0ustar00fransfrans00000000000000// Copyright (C) 2004 Arkadiy Vertleyb // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_TYPEOF_TYPEOF_HPP_INCLUDED #define BOOST_TYPEOF_TYPEOF_HPP_INCLUDED #if defined(BOOST_TYPEOF_COMPLIANT) # define BOOST_TYPEOF_EMULATION #endif #if defined(BOOST_TYPEOF_EMULATION) && defined(BOOST_TYPEOF_NATIVE) # error both typeof emulation and native mode requested #endif #if defined(__COMO__) # ifdef __GNUG__ # ifndef BOOST_TYPEOF_EMULATION # ifndef BOOST_TYPEOF_NATIVE # define BOOST_TYPEOF_NATIVE # endif # define BOOST_TYPEOF_KEYWORD typeof # endif # else # ifndef BOOST_TYPEOF_NATIVE # ifndef BOOST_TYPEOF_EMULATION # define BOOST_TYPEOF_EMULATION # endif # else # error native typeof is not supported # endif # endif #elif defined(__INTEL_COMPILER) || defined(__ICL) || defined(__ICC) || defined(__ECC) # ifdef __GNUC__ # ifndef BOOST_TYPEOF_EMULATION # ifndef BOOST_TYPEOF_NATIVE # define BOOST_TYPEOF_NATIVE # endif # define BOOST_TYPEOF_KEYWORD __typeof__ # endif # else # ifndef BOOST_TYPEOF_NATIVE # ifndef BOOST_TYPEOF_EMULATION # define BOOST_TYPEOF_EMULATION # endif # else # error native typeof is not supported # endif # endif #elif defined(__GNUC__) # ifndef BOOST_TYPEOF_EMULATION # ifndef BOOST_TYPEOF_NATIVE # define BOOST_TYPEOF_NATIVE # endif # define BOOST_TYPEOF_KEYWORD __typeof__ # endif #elif defined(__MWERKS__) # if(__MWERKS__ <= 0x3003) // 8.x # ifndef BOOST_TYPEOF_EMULATION # ifndef BOOST_TYPEOF_NATIVE # define BOOST_TYPEOF_NATIVE # endif # define BOOST_TYPEOF_KEYWORD __typeof__ # else # define BOOST_TYPEOF_EMULATION_UNSUPPORTED # endif # else // 9.x # ifndef BOOST_TYPEOF_EMULATION # ifndef BOOST_TYPEOF_NATIVE # define BOOST_TYPEOF_NATIVE # endif # define BOOST_TYPEOF_KEYWORD __typeof__ # endif # endif #elif defined __CODEGEARC__ # ifndef BOOST_TYPEOF_EMULATION # ifndef BOOST_TYPEOF_NATIVE # define BOOST_TYPEOF_EMULATION_UNSUPPORTED # endif # else # define BOOST_TYPEOF_EMULATION_UNSUPPORTED # endif #elif defined __BORLANDC__ # ifndef BOOST_TYPEOF_EMULATION # ifndef BOOST_TYPEOF_NATIVE # define BOOST_TYPEOF_EMULATION_UNSUPPORTED # endif # else # define BOOST_TYPEOF_EMULATION_UNSUPPORTED # endif #elif defined __DMC__ # ifndef BOOST_TYPEOF_EMULATION # ifndef BOOST_TYPEOF_NATIVE # define BOOST_TYPEOF_NATIVE # endif # include # define MSVC_TYPEOF_HACK # endif #elif defined(_MSC_VER) # if (_MSC_VER <= 1300) // 6.5, 7.0 # ifndef BOOST_TYPEOF_EMULATION # ifndef BOOST_TYPEOF_NATIVE # define BOOST_TYPEOF_NATIVE # endif # include # define MSVC_TYPEOF_HACK # else # error typeof emulation is not supported # endif # elif (_MSC_VER >= 1310) // 7.1 -> # ifndef BOOST_TYPEOF_EMULATION # ifndef BOOST_TYPEOF_NATIVE # ifndef _MSC_EXTENSIONS # define BOOST_TYPEOF_EMULATION # else # define BOOST_TYPEOF_NATIVE # endif # endif # endif # ifdef BOOST_TYPEOF_NATIVE # include # define MSVC_TYPEOF_HACK # endif # endif #elif defined(__HP_aCC) # ifndef BOOST_TYPEOF_NATIVE # ifndef BOOST_TYPEOF_EMULATION # define BOOST_TYPEOF_EMULATION # endif # else # error native typeof is not supported # endif #elif defined(__DECCXX) # ifndef BOOST_TYPEOF_NATIVE # ifndef BOOST_TYPEOF_EMULATION # define BOOST_TYPEOF_EMULATION # endif # else # error native typeof is not supported # endif #elif defined(__BORLANDC__) # if (__BORLANDC__ < 0x590) # define BOOST_TYPEOF_NO_FUNCTION_TYPES # define BOOST_TYPEOF_NO_MEMBER_FUNCTION_TYPES # endif # ifndef BOOST_TYPEOF_NATIVE # ifndef BOOST_TYPEOF_EMULATION # define BOOST_TYPEOF_EMULATION # endif # else # error native typeof is not supported # endif #elif defined(__SUNPRO_CC) # if (__SUNPRO_CC < 0x590 ) # ifdef BOOST_TYPEOF_NATIVE # error native typeof is not supported # endif # ifndef BOOST_TYPEOF_EMULATION # define BOOST_TYPEOF_EMULATION # endif # else # ifndef BOOST_TYPEOF_EMULATION # ifndef BOOST_TYPEOF_NATIVE # define BOOST_TYPEOF_NATIVE # endif # define BOOST_TYPEOF_KEYWORD __typeof__ # endif # endif #else //unknown compiler # ifndef BOOST_TYPEOF_NATIVE # ifndef BOOST_TYPEOF_EMULATION # define BOOST_TYPEOF_EMULATION # endif # else # ifndef BOOST_TYPEOF_KEYWORD # define BOOST_TYPEOF_KEYWORD typeof # endif # endif #endif #define BOOST_TYPEOF_UNIQUE_ID()\ BOOST_TYPEOF_REGISTRATION_GROUP * 0x10000 + __LINE__ #define BOOST_TYPEOF_INCREMENT_REGISTRATION_GROUP()\ #ifdef BOOST_TYPEOF_EMULATION_UNSUPPORTED # include #elif defined BOOST_TYPEOF_EMULATION # define BOOST_TYPEOF_TEXT "using typeof emulation" # include # include # include # include # include # include # include # include #elif defined(BOOST_TYPEOF_NATIVE) # define BOOST_TYPEOF_TEXT "using native typeof" # include # include #else # error typeof configuration error #endif // auto #define BOOST_AUTO(Var, Expr) BOOST_TYPEOF(Expr) Var = Expr #define BOOST_AUTO_TPL(Var, Expr) BOOST_TYPEOF_TPL(Expr) Var = Expr #endif//BOOST_TYPEOF_TYPEOF_HPP_INCLUDED madp-0.4/src/boost/boost/PaxHeaders.5405/foreach_fwd.hpp0000644000000000000000000000007412717644140020006 xustar0030 atime=1463765180.101720159 30 ctime=1463765201.049552852 madp-0.4/src/boost/boost/foreach_fwd.hpp0000664000372100037210000000324612717644140020642 0ustar00fransfrans00000000000000/////////////////////////////////////////////////////////////////////////////// // foreach.hpp header file // // Copyright 2010 Eric Niebler. // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // See http://www.boost.org/libs/foreach for documentation // // Credits: // Kazutoshi Satoda: for suggesting the need for a _fwd header for foreach's // customization points. #ifndef BOOST_FOREACH_FWD_HPP #define BOOST_FOREACH_FWD_HPP // This must be at global scope, hence the uglified name enum boost_foreach_argument_dependent_lookup_hack { boost_foreach_argument_dependent_lookup_hack_value }; namespace boost { namespace foreach { /////////////////////////////////////////////////////////////////////////////// // boost::foreach::tag // typedef boost_foreach_argument_dependent_lookup_hack tag; /////////////////////////////////////////////////////////////////////////////// // boost::foreach::is_lightweight_proxy // Specialize this for user-defined collection types if they are inexpensive to copy. // This tells BOOST_FOREACH it can avoid the rvalue/lvalue detection stuff. template struct is_lightweight_proxy; /////////////////////////////////////////////////////////////////////////////// // boost::foreach::is_noncopyable // Specialize this for user-defined collection types if they cannot be copied. // This also tells BOOST_FOREACH to avoid the rvalue/lvalue detection stuff. template struct is_noncopyable; } // namespace foreach } // namespace boost #endif madp-0.4/src/boost/boost/PaxHeaders.5405/none.hpp0000644000000000000000000000007412717644140016476 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/none.hpp0000664000372100037210000000140512717644140017325 0ustar00fransfrans00000000000000// Copyright (C) 2003, Fernando Luis Cacciola Carballal. // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/optional for documentation. // // You are welcome to contact the author at: // fernando_cacciola@hotmail.com // #ifndef BOOST_NONE_17SEP2003_HPP #define BOOST_NONE_17SEP2003_HPP #include "boost/none_t.hpp" // NOTE: Borland users have to include this header outside any precompiled headers // (bcc<=5.64 cannot include instance data in a precompiled header) // -- * To be verified, now that there's no unnamed namespace namespace boost { none_t const none = (static_cast(0)) ; } // namespace boost #endif madp-0.4/src/boost/boost/PaxHeaders.5405/range0000644000000000000000000000007412717644140016045 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.153552022 madp-0.4/src/boost/boost/range/0000775000372100037210000000000012717644140016751 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/range/PaxHeaders.5405/config.hpp0000644000000000000000000000007312717644140020077 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/range/config.hpp0000664000372100037210000000246312717644140020734 0ustar00fransfrans00000000000000// Boost.Range library // // Copyright Thorsten Ottosen 2003-2004. Use, modification and // distribution is subject to the Boost Software License, Version // 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_CONFIG_HPP #define BOOST_RANGE_CONFIG_HPP #include #if defined(_MSC_VER) && (_MSC_VER >= 1200) # pragma once #endif #include #ifdef BOOST_RANGE_DEDUCED_TYPENAME #error "macro already defined!" #endif #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) # define BOOST_RANGE_DEDUCED_TYPENAME typename #else # if BOOST_WORKAROUND(BOOST_MSVC, == 1300) && !defined(_MSC_EXTENSIONS) # define BOOST_RANGE_DEDUCED_TYPENAME typename # else # define BOOST_RANGE_DEDUCED_TYPENAME BOOST_DEDUCED_TYPENAME # endif #endif #ifdef BOOST_RANGE_NO_ARRAY_SUPPORT #error "macro already defined!" #endif #if BOOST_WORKAROUND( BOOST_MSVC, < 1300 ) || BOOST_WORKAROUND( __MWERKS__, <= 0x3003 ) #define BOOST_RANGE_NO_ARRAY_SUPPORT 1 #endif #ifdef BOOST_RANGE_NO_ARRAY_SUPPORT #define BOOST_RANGE_ARRAY_REF() (boost_range_array) #define BOOST_RANGE_NO_STATIC_ASSERT #else #define BOOST_RANGE_ARRAY_REF() (&boost_range_array) #endif #endif madp-0.4/src/boost/boost/range/PaxHeaders.5405/const_iterator.hpp0000644000000000000000000000007312717644140021671 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/range/const_iterator.hpp0000664000372100037210000000350212717644140022521 0ustar00fransfrans00000000000000// Boost.Range library // // Copyright Thorsten Ottosen 2003-2004. Use, modification and // distribution is subject to the Boost Software License, Version // 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_CONST_ITERATOR_HPP #define BOOST_RANGE_CONST_ITERATOR_HPP #if defined(_MSC_VER) && (_MSC_VER >= 1200) # pragma once #endif #include #ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION #include #else #include #include #include #include namespace boost { ////////////////////////////////////////////////////////////////////////// // default ////////////////////////////////////////////////////////////////////////// namespace range_detail { BOOST_RANGE_EXTRACT_OPTIONAL_TYPE( const_iterator ) } template< typename C > struct range_const_iterator : range_detail::extract_const_iterator {}; ////////////////////////////////////////////////////////////////////////// // pair ////////////////////////////////////////////////////////////////////////// template< typename Iterator > struct range_const_iterator< std::pair > { typedef Iterator type; }; ////////////////////////////////////////////////////////////////////////// // array ////////////////////////////////////////////////////////////////////////// template< typename T, std::size_t sz > struct range_const_iterator< T[sz] > { typedef const T* type; }; } // namespace boost #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION #endif madp-0.4/src/boost/boost/range/PaxHeaders.5405/irange.hpp0000644000000000000000000000007312717644140020077 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/range/irange.hpp0000664000372100037210000001644312717644140020737 0ustar00fransfrans00000000000000// Boost.Range library // // Copyright Neil Groves 2010. Use, modification and // distribution is subject to the Boost Software License, Version // 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_IRANGE_HPP_INCLUDED #define BOOST_RANGE_IRANGE_HPP_INCLUDED #include #include #include namespace boost { namespace range_detail { // integer_iterator is an iterator over an integer sequence that // is bounded only by the limits of the underlying integer // representation. // // This is useful for implementing the irange(first, last) // function. // // Note: // This use of this iterator and irange is appreciably less // performant than the corresponding hand-written integer // loop on many compilers. template class integer_iterator : public boost::iterator_facade< integer_iterator, Integer, boost::random_access_traversal_tag, Integer, std::ptrdiff_t > { typedef boost::iterator_facade< integer_iterator, Integer, boost::random_access_traversal_tag, Integer, std::ptrdiff_t > base_t; public: typedef typename base_t::value_type value_type; typedef typename base_t::difference_type difference_type; typedef typename base_t::reference reference; integer_iterator() : m_value() {} explicit integer_iterator(value_type x) : m_value(x) {} private: void increment() { ++m_value; } void decrement() { --m_value; } void advance(difference_type offset) { m_value += offset; } difference_type distance_to(const integer_iterator& other) const { return other.m_value - m_value; } bool equal(const integer_iterator& other) const { return m_value == other.m_value; } reference dereference() const { return m_value; } friend class ::boost::iterator_core_access; value_type m_value; }; // integer_iterator_with_step is similar in nature to the // integer_iterator but provides the ability to 'move' in // a number of steps specified at construction time. // // The three variable implementation provides the best guarantees // of loop termination upon various combinations of input. // // While this design is less performant than some less // safe alternatives, the use of ranges and iterators to // perform counting will never be optimal anyhow, hence // if optimal performance is desired a hand-coded loop // is the solution. template class integer_iterator_with_step : public boost::iterator_facade< integer_iterator_with_step, Integer, boost::random_access_traversal_tag, Integer, std::ptrdiff_t > { typedef boost::iterator_facade< integer_iterator_with_step, Integer, boost::random_access_traversal_tag, Integer, std::ptrdiff_t > base_t; public: typedef typename base_t::value_type value_type; typedef typename base_t::difference_type difference_type; typedef typename base_t::reference reference; integer_iterator_with_step(value_type first, difference_type step, value_type step_size) : m_first(first) , m_step(step) , m_step_size(step_size) { } private: void increment() { ++m_step; } void decrement() { --m_step; } void advance(difference_type offset) { m_step += offset; } difference_type distance_to(const integer_iterator_with_step& other) const { return other.m_step - m_step; } bool equal(const integer_iterator_with_step& other) const { return m_step == other.m_step; } reference dereference() const { return m_first + (m_step * m_step_size); } friend class ::boost::iterator_core_access; value_type m_first; value_type m_step; difference_type m_step_size; }; } // namespace range_detail template class integer_range : public iterator_range< range_detail::integer_iterator > { typedef range_detail::integer_iterator iterator_t; typedef iterator_range base_t; public: integer_range(Integer first, Integer last) : base_t(iterator_t(first), iterator_t(last)) { } }; template class strided_integer_range : public iterator_range< range_detail::integer_iterator_with_step > { typedef range_detail::integer_iterator_with_step iterator_t; typedef iterator_range base_t; public: template strided_integer_range(Iterator first, Iterator last) : base_t(first, last) { } }; template integer_range irange(Integer first, Integer last) { BOOST_ASSERT( first <= last ); return integer_range(first, last); } template strided_integer_range irange(Integer first, Integer last, StepSize step_size) { BOOST_ASSERT( step_size != 0 ); BOOST_ASSERT( (step_size > 0) ? (last >= first) : (last <= first) ); typedef typename range_detail::integer_iterator_with_step iterator_t; const std::ptrdiff_t sz = static_cast(step_size >= 0 ? step_size : -step_size); const Integer l = step_size >= 0 ? last : first; const Integer f = step_size >= 0 ? first : last; const std::ptrdiff_t num_steps = (l - f) / sz + ((l - f) % sz ? 1 : 0); BOOST_ASSERT(num_steps >= 0); return strided_integer_range( iterator_t(first, 0, step_size), iterator_t(first, num_steps, step_size)); } } // namespace boost #endif // include guard madp-0.4/src/boost/boost/range/PaxHeaders.5405/iterator_range_io.hpp0000644000000000000000000000007412717644140022327 xustar0030 atime=1463765180.165719647 30 ctime=1463765201.153552022 madp-0.4/src/boost/boost/range/iterator_range_io.hpp0000664000372100037210000000514012717644140023156 0ustar00fransfrans00000000000000// Boost.Range library // // Copyright Neil Groves 2009. // Use, modification and distribution is subject to the Boost Software // License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_ITERATOR_RANGE_IO_HPP_INCLUDED #define BOOST_RANGE_ITERATOR_RANGE_IO_HPP_INCLUDED #include #include #if BOOST_WORKAROUND(BOOST_MSVC, BOOST_TESTED_AT(1500)) #pragma warning( push ) #pragma warning( disable : 4996 ) #endif // From boost/dynamic_bitset.hpp; thanks to Matthias Troyer for Cray X1 patch. #ifndef BOOST_OLD_IOSTREAMS # if defined(__STL_CONFIG_H) && \ !defined (__STL_USE_NEW_IOSTREAMS) && !defined(__crayx1) \ /**/ # define BOOST_OLD_IOSTREAMS # endif #endif // #ifndef BOOST_OLD_IOSTREAMS #ifndef _STLP_NO_IOSTREAMS # ifndef BOOST_OLD_IOSTREAMS # include # else # include # endif #endif // _STLP_NO_IOSTREAMS #include #include #include #include namespace boost { #ifndef _STLP_NO_IOSTREAMS # ifndef BOOST_OLD_IOSTREAMS //! iterator_range output operator /*! Output the range to an ostream. Elements are outputted in a sequence without separators. */ template< typename IteratorT, typename Elem, typename Traits > inline std::basic_ostream& operator<<( std::basic_ostream& Os, const iterator_range& r ) { std::copy( r.begin(), r.end(), std::ostream_iterator< BOOST_DEDUCED_TYPENAME iterator_value::type, Elem, Traits>(Os) ); return Os; } # else //! iterator_range output operator /*! Output the range to an ostream. Elements are outputted in a sequence without separators. */ template< typename IteratorT > inline std::ostream& operator<<( std::ostream& Os, const iterator_range& r ) { std::copy( r.begin(), r.end(), std::ostream_iterator(Os)); return Os; } # endif #endif // _STLP_NO_IOSTREAMS } // namespace boost #undef BOOST_OLD_IOSTREAMS #if BOOST_WORKAROUND(BOOST_MSVC, BOOST_TESTED_AT(1500)) #pragma warning(pop) #endif #endif // include guard madp-0.4/src/boost/boost/range/PaxHeaders.5405/detail0000644000000000000000000000007412717644140017307 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/range/detail/0000775000372100037210000000000012717644140020213 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/range/detail/PaxHeaders.5405/implementation_help.hpp0000644000000000000000000000007312717644140024131 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/range/detail/implementation_help.hpp0000664000372100037210000000541012717644140024761 0ustar00fransfrans00000000000000// Boost.Range library // // Copyright Thorsten Ottosen 2003-2004. Use, modification and // distribution is subject to the Boost Software License, Version // 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_DETAIL_IMPLEMENTATION_HELP_HPP #define BOOST_RANGE_DETAIL_IMPLEMENTATION_HELP_HPP #include #include #include #include #include #ifndef BOOST_NO_CWCHAR #include #endif namespace boost { namespace range_detail { template inline void boost_range_silence_warning( const T& ) { } ///////////////////////////////////////////////////////////////////// // end() help ///////////////////////////////////////////////////////////////////// inline const char* str_end( const char* s, const char* ) { return s + strlen( s ); } #ifndef BOOST_NO_CWCHAR inline const wchar_t* str_end( const wchar_t* s, const wchar_t* ) { return s + wcslen( s ); } #else inline const wchar_t* str_end( const wchar_t* s, const wchar_t* ) { if( s == 0 || s[0] == 0 ) return s; while( *++s != 0 ) ; return s; } #endif template< class Char > inline Char* str_end( Char* s ) { return const_cast( str_end( s, s ) ); } template< class T, std::size_t sz > inline T* array_end( T BOOST_RANGE_ARRAY_REF()[sz] ) { return boost_range_array + sz; } template< class T, std::size_t sz > inline const T* array_end( const T BOOST_RANGE_ARRAY_REF()[sz] ) { return boost_range_array + sz; } ///////////////////////////////////////////////////////////////////// // size() help ///////////////////////////////////////////////////////////////////// template< class Char > inline std::size_t str_size( const Char* const& s ) { return str_end( s ) - s; } template< class T, std::size_t sz > inline std::size_t array_size( T BOOST_RANGE_ARRAY_REF()[sz] ) { boost_range_silence_warning( boost_range_array ); return sz; } template< class T, std::size_t sz > inline std::size_t array_size( const T BOOST_RANGE_ARRAY_REF()[sz] ) { boost_range_silence_warning( boost_range_array ); return sz; } } // namespace 'range_detail' } // namespace 'boost' #endif madp-0.4/src/boost/boost/range/detail/PaxHeaders.5405/misc_concept.hpp0000644000000000000000000000007312717644140022542 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/range/detail/misc_concept.hpp0000664000372100037210000000146612717644140023401 0ustar00fransfrans00000000000000// Boost.Range library concept checks // // Copyright Neil Groves 2009. Use, modification and distribution // are subject to the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // #ifndef BOOST_RANGE_DETAIL_MISC_CONCEPT_HPP_INCLUDED #define BOOST_RANGE_DETAIL_MISC_CONCEPT_HPP_INCLUDED #include namespace boost { namespace range_detail { template class SameTypeConcept { public: BOOST_CONCEPT_USAGE(SameTypeConcept) { same_type(a,b); } private: template void same_type(T,T) {} T1 a; T2 b; }; } } #endif // include guard madp-0.4/src/boost/boost/range/detail/PaxHeaders.5405/safe_bool.hpp0000644000000000000000000000007312717644140022025 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/range/detail/safe_bool.hpp0000664000372100037210000000402312717644140022654 0ustar00fransfrans00000000000000// This header intentionally has no include guards. // // Copyright (c) 2010 Neil Groves // Distributed under the Boost Software License, Version 1.0. // See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt // // This code utilises the experience gained during the evolution of // #ifndef BOOST_RANGE_SAFE_BOOL_INCLUDED_HPP #define BOOST_RANGE_SAFE_BOOL_INCLUDED_HPP #include #include namespace boost { namespace range_detail { template class safe_bool { public: typedef safe_bool this_type; #if (defined(__SUNPRO_CC) && BOOST_WORKAROUND(__SUNPRO_CC, < 0x570)) || defined(__CINT_) typedef bool unspecified_bool_type; static unspecified_bool_type to_unspecified_bool(const bool x, DataMemberPtr) { return x; } #elif defined(_MANAGED) static void unspecified_bool(this_type***) { } typedef void(*unspecified_bool_type)(this_type***); static unspecified_bool_type to_unspecified_bool(const bool x, DataMemberPtr) { return x ? unspecified_bool : 0; } #elif \ ( defined(__MWERKS__) && BOOST_WORKAROUND(__MWERKS__, < 0x3200) ) || \ ( defined(__GNUC__) && (__GNUC__ * 100 + __GNUC_MINOR__ < 304) ) || \ ( defined(__SUNPRO_CC) && BOOST_WORKAROUND(__SUNPRO_CC, <= 0x590) ) typedef bool (this_type::*unspecified_bool_type)() const; static unspecified_bool_type to_unspecified_bool(const bool x, DataMemberPtr) { return x ? &this_type::detail_safe_bool_member_fn : 0; } private: bool detail_safe_bool_member_fn() const { return false; } #else typedef DataMemberPtr unspecified_bool_type; static unspecified_bool_type to_unspecified_bool(const bool x, DataMemberPtr p) { return x ? p : 0; } #endif private: safe_bool(); safe_bool(const safe_bool&); void operator=(const safe_bool&); ~safe_bool(); }; } // namespace range_detail } // namespace boost #endif // include guard madp-0.4/src/boost/boost/range/detail/PaxHeaders.5405/extract_optional_type.hpp0000644000000000000000000000007312717644140024514 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/range/detail/extract_optional_type.hpp0000664000372100037210000000411512717644140025345 0ustar00fransfrans00000000000000// Boost.Range library // // Copyright Arno Schoedl & Neil Groves 2009. // Use, modification and distribution is subject to the Boost Software // License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_DETAIL_EXTRACT_OPTIONAL_TYPE_HPP_INCLUDED #define BOOST_RANGE_DETAIL_EXTRACT_OPTIONAL_TYPE_HPP_INCLUDED #if defined(_MSC_VER) && (_MSC_VER >= 1200) # pragma once #endif #include #ifdef BOOST_NO_PARTIAL_SPECIALIZATION_IMPLICIT_DEFAULT_ARGS #define BOOST_RANGE_EXTRACT_OPTIONAL_TYPE( a_typedef ) \ template< typename C > \ struct extract_ ## a_typedef \ { \ typedef BOOST_DEDUCED_TYPENAME C::a_typedef type; \ }; #else namespace boost { namespace range_detail { template< typename T > struct exists { typedef void type; }; } } // Defines extract_some_typedef which exposes T::some_typedef as // extract_some_typedef::type if T::some_typedef exists. Otherwise // extract_some_typedef is empty. #define BOOST_RANGE_EXTRACT_OPTIONAL_TYPE( a_typedef ) \ template< typename C, typename Enable=void > \ struct extract_ ## a_typedef \ {}; \ template< typename C > \ struct extract_ ## a_typedef< C \ , BOOST_DEDUCED_TYPENAME boost::range_detail::exists< BOOST_DEDUCED_TYPENAME C::a_typedef >::type \ > { \ typedef BOOST_DEDUCED_TYPENAME C::a_typedef type; \ }; #endif #endif // include guard madp-0.4/src/boost/boost/range/detail/PaxHeaders.5405/common.hpp0000644000000000000000000000007312717644140021364 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/range/detail/common.hpp0000664000372100037210000001515312717644140022221 0ustar00fransfrans00000000000000// Boost.Range library // // Copyright Thorsten Ottosen 2003-2004. Use, modification and // distribution is subject to the Boost Software License, Version // 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_DETAIL_COMMON_HPP #define BOOST_RANGE_DETAIL_COMMON_HPP #if defined(_MSC_VER) && (_MSC_VER >= 1200) # pragma once #endif #include #include #include #include #include #include #include ////////////////////////////////////////////////////////////////////////////// // missing partial specialization workaround. ////////////////////////////////////////////////////////////////////////////// namespace boost { namespace range_detail { // 1 = std containers // 2 = std::pair // 3 = const std::pair // 4 = array // 5 = const array // 6 = char array // 7 = wchar_t array // 8 = char* // 9 = const char* // 10 = whar_t* // 11 = const wchar_t* // 12 = string typedef mpl::int_<1>::type std_container_; typedef mpl::int_<2>::type std_pair_; typedef mpl::int_<3>::type const_std_pair_; typedef mpl::int_<4>::type array_; typedef mpl::int_<5>::type const_array_; typedef mpl::int_<6>::type char_array_; typedef mpl::int_<7>::type wchar_t_array_; typedef mpl::int_<8>::type char_ptr_; typedef mpl::int_<9>::type const_char_ptr_; typedef mpl::int_<10>::type wchar_t_ptr_; typedef mpl::int_<11>::type const_wchar_t_ptr_; typedef mpl::int_<12>::type string_; template< typename C > struct range_helper { static C* c; static C ptr; BOOST_STATIC_CONSTANT( bool, is_pair_ = sizeof( boost::range_detail::is_pair_impl( c ) ) == sizeof( yes_type ) ); BOOST_STATIC_CONSTANT( bool, is_char_ptr_ = sizeof( boost::range_detail::is_char_ptr_impl( ptr ) ) == sizeof( yes_type ) ); BOOST_STATIC_CONSTANT( bool, is_const_char_ptr_ = sizeof( boost::range_detail::is_const_char_ptr_impl( ptr ) ) == sizeof( yes_type ) ); BOOST_STATIC_CONSTANT( bool, is_wchar_t_ptr_ = sizeof( boost::range_detail::is_wchar_t_ptr_impl( ptr ) ) == sizeof( yes_type ) ); BOOST_STATIC_CONSTANT( bool, is_const_wchar_t_ptr_ = sizeof( boost::range_detail::is_const_wchar_t_ptr_impl( ptr ) ) == sizeof( yes_type ) ); BOOST_STATIC_CONSTANT( bool, is_char_array_ = sizeof( boost::range_detail::is_char_array_impl( ptr ) ) == sizeof( yes_type ) ); BOOST_STATIC_CONSTANT( bool, is_wchar_t_array_ = sizeof( boost::range_detail::is_wchar_t_array_impl( ptr ) ) == sizeof( yes_type ) ); BOOST_STATIC_CONSTANT( bool, is_string_ = (boost::type_traits::ice_or::value )); BOOST_STATIC_CONSTANT( bool, is_array_ = boost::is_array::value ); }; template< typename C > class range { typedef BOOST_RANGE_DEDUCED_TYPENAME boost::mpl::if_c< ::boost::range_detail::range_helper::is_pair_, boost::range_detail::std_pair_, void >::type pair_t; typedef BOOST_RANGE_DEDUCED_TYPENAME boost::mpl::if_c< ::boost::range_detail::range_helper::is_array_, boost::range_detail::array_, pair_t >::type array_t; typedef BOOST_RANGE_DEDUCED_TYPENAME boost::mpl::if_c< ::boost::range_detail::range_helper::is_string_, boost::range_detail::string_, array_t >::type string_t; typedef BOOST_RANGE_DEDUCED_TYPENAME boost::mpl::if_c< ::boost::range_detail::range_helper::is_const_char_ptr_, boost::range_detail::const_char_ptr_, string_t >::type const_char_ptr_t; typedef BOOST_RANGE_DEDUCED_TYPENAME boost::mpl::if_c< ::boost::range_detail::range_helper::is_char_ptr_, boost::range_detail::char_ptr_, const_char_ptr_t >::type char_ptr_t; typedef BOOST_RANGE_DEDUCED_TYPENAME boost::mpl::if_c< ::boost::range_detail::range_helper::is_const_wchar_t_ptr_, boost::range_detail::const_wchar_t_ptr_, char_ptr_t >::type const_wchar_ptr_t; typedef BOOST_RANGE_DEDUCED_TYPENAME boost::mpl::if_c< ::boost::range_detail::range_helper::is_wchar_t_ptr_, boost::range_detail::wchar_t_ptr_, const_wchar_ptr_t >::type wchar_ptr_t; typedef BOOST_RANGE_DEDUCED_TYPENAME boost::mpl::if_c< ::boost::range_detail::range_helper::is_wchar_t_array_, boost::range_detail::wchar_t_array_, wchar_ptr_t >::type wchar_array_t; typedef BOOST_RANGE_DEDUCED_TYPENAME boost::mpl::if_c< ::boost::range_detail::range_helper::is_char_array_, boost::range_detail::char_array_, wchar_array_t >::type char_array_t; public: typedef BOOST_RANGE_DEDUCED_TYPENAME boost::mpl::if_c< ::boost::is_void::value, boost::range_detail::std_container_, char_array_t >::type type; }; // class 'range' } } #endif madp-0.4/src/boost/boost/range/detail/PaxHeaders.5405/sfinae.hpp0000644000000000000000000000007312717644140021341 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/range/detail/sfinae.hpp0000664000372100037210000000521312717644140022172 0ustar00fransfrans00000000000000// Boost.Range library // // Copyright Thorsten Ottosen 2003-2004. Use, modification and // distribution is subject to the Boost Software License, Version // 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_DETAIL_SFINAE_HPP #define BOOST_RANGE_DETAIL_SFINAE_HPP #include #include #include #include namespace boost { namespace range_detail { using type_traits::yes_type; using type_traits::no_type; ////////////////////////////////////////////////////////////////////// // string ////////////////////////////////////////////////////////////////////// yes_type is_string_impl( const char* const ); yes_type is_string_impl( const wchar_t* const ); no_type is_string_impl( ... ); template< std::size_t sz > yes_type is_char_array_impl( char BOOST_RANGE_ARRAY_REF()[sz] ); template< std::size_t sz > yes_type is_char_array_impl( const char BOOST_RANGE_ARRAY_REF()[sz] ); no_type is_char_array_impl( ... ); template< std::size_t sz > yes_type is_wchar_t_array_impl( wchar_t BOOST_RANGE_ARRAY_REF()[sz] ); template< std::size_t sz > yes_type is_wchar_t_array_impl( const wchar_t BOOST_RANGE_ARRAY_REF()[sz] ); no_type is_wchar_t_array_impl( ... ); yes_type is_char_ptr_impl( char* const ); no_type is_char_ptr_impl( ... ); yes_type is_const_char_ptr_impl( const char* const ); no_type is_const_char_ptr_impl( ... ); yes_type is_wchar_t_ptr_impl( wchar_t* const ); no_type is_wchar_t_ptr_impl( ... ); yes_type is_const_wchar_t_ptr_impl( const wchar_t* const ); no_type is_const_wchar_t_ptr_impl( ... ); ////////////////////////////////////////////////////////////////////// // pair ////////////////////////////////////////////////////////////////////// template< typename Iterator > yes_type is_pair_impl( const std::pair* ); no_type is_pair_impl( ... ); ////////////////////////////////////////////////////////////////////// // tags ////////////////////////////////////////////////////////////////////// struct char_or_wchar_t_array_tag {}; } // namespace 'range_detail' } // namespace 'boost' #endif madp-0.4/src/boost/boost/range/PaxHeaders.5405/rbegin.hpp0000644000000000000000000000007412717644140020101 xustar0030 atime=1463765180.165719647 30 ctime=1463765201.153552022 madp-0.4/src/boost/boost/range/rbegin.hpp0000664000372100037210000000273012717644140020732 0ustar00fransfrans00000000000000// Boost.Range library // // Copyright Thorsten Ottosen 2003-2004. Use, modification and // distribution is subject to the Boost Software License, Version // 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_RBEGIN_HPP #define BOOST_RANGE_RBEGIN_HPP #if defined(_MSC_VER) && (_MSC_VER >= 1200) # pragma once #endif #include #include namespace boost { #ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING template< class C > inline BOOST_DEDUCED_TYPENAME range_reverse_iterator::type rbegin( C& c ) { return BOOST_DEDUCED_TYPENAME range_reverse_iterator::type( boost::end( c ) ); } #else template< class C > inline BOOST_DEDUCED_TYPENAME range_reverse_iterator::type rbegin( C& c ) { typedef BOOST_DEDUCED_TYPENAME range_reverse_iterator::type iter_type; return iter_type( boost::end( c ) ); } template< class C > inline BOOST_DEDUCED_TYPENAME range_reverse_iterator::type rbegin( const C& c ) { typedef BOOST_DEDUCED_TYPENAME range_reverse_iterator::type iter_type; return iter_type( boost::end( c ) ); } #endif // BOOST_NO_FUNCTION_TEMPLATE_ORDERING template< class T > inline BOOST_DEDUCED_TYPENAME range_reverse_iterator::type const_rbegin( const T& r ) { return boost::rbegin( r ); } } // namespace 'boost' #endif madp-0.4/src/boost/boost/range/PaxHeaders.5405/iterator_range.hpp0000644000000000000000000000007412717644140021640 xustar0030 atime=1463765180.165719647 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/range/iterator_range.hpp0000664000372100037210000000102212717644140022462 0ustar00fransfrans00000000000000// Boost.Range library // // Copyright Neil Groves 2009. // Use, modification and distribution is subject to the Boost Software // License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_ITERATOR_RANGE_HPP_INCLUDED #define BOOST_RANGE_ITERATOR_RANGE_HPP_INCLUDED #include "boost/range/iterator_range_core.hpp" #include "boost/range/iterator_range_io.hpp" #endif // include guard madp-0.4/src/boost/boost/range/PaxHeaders.5405/concepts.hpp0000644000000000000000000000007312717644140020450 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/range/concepts.hpp0000664000372100037210000003145712717644140021312 0ustar00fransfrans00000000000000// Boost.Range library concept checks // // Copyright Neil Groves 2009. Use, modification and distribution // are subject to the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Copyright Daniel Walker 2006. Use, modification and distribution // are subject to the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_CONCEPTS_HPP #define BOOST_RANGE_CONCEPTS_HPP #include #include #include #include #include #include #include /*! * \file * \brief Concept checks for the Boost Range library. * * The structures in this file may be used in conjunction with the * Boost Concept Check library to insure that the type of a function * parameter is compatible with a range concept. If not, a meaningful * compile time error is generated. Checks are provided for the range * concepts related to iterator traversal categories. For example, the * following line checks that the type T models the ForwardRange * concept. * * \code * BOOST_CONCEPT_ASSERT((ForwardRangeConcept)); * \endcode * * A different concept check is required to ensure writeable value * access. For example to check for a ForwardRange that can be written * to, the following code is required. * * \code * BOOST_CONCEPT_ASSERT((WriteableForwardRangeConcept)); * \endcode * * \see http://www.boost.org/libs/range/doc/range.html for details * about range concepts. * \see http://www.boost.org/libs/iterator/doc/iterator_concepts.html * for details about iterator concepts. * \see http://www.boost.org/libs/concept_check/concept_check.htm for * details about concept checks. */ namespace boost { namespace range_detail { #ifndef BOOST_RANGE_ENABLE_CONCEPT_ASSERT // List broken compiler versions here: #ifdef __GNUC__ // GNUC 4.2 has strange issues correctly detecting compliance with the Concepts // hence the least disruptive approach is to turn-off the concept checking for // this version of the compiler. #if __GNUC__ == 4 && __GNUC_MINOR__ == 2 #define BOOST_RANGE_ENABLE_CONCEPT_ASSERT 0 #endif #endif #ifdef __BORLANDC__ #define BOOST_RANGE_ENABLE_CONCEPT_ASSERT 0 #endif #ifdef __PATHCC__ #define BOOST_RANGE_ENABLE_CONCEPT_ASSERT 0 #endif // Default to using the concept asserts unless we have defined it off // during the search for black listed compilers. #ifndef BOOST_RANGE_ENABLE_CONCEPT_ASSERT #define BOOST_RANGE_ENABLE_CONCEPT_ASSERT 1 #endif #endif #if BOOST_RANGE_ENABLE_CONCEPT_ASSERT #define BOOST_RANGE_CONCEPT_ASSERT( x ) BOOST_CONCEPT_ASSERT( x ) #else #define BOOST_RANGE_CONCEPT_ASSERT( x ) #endif // Rationale for the inclusion of redefined iterator concept // classes: // // The Range algorithms often do not require that the iterators are // Assignable or default constructable, but the correct standard // conformant iterators do require the iterators to be a model of the // Assignable concept. // Iterators that contains a functor that is not assignable therefore // are not correct models of the standard iterator concepts, // despite being adequate for most algorithms. An example of this // use case is the combination of the boost::adaptors::filtered // class with a boost::lambda::bind generated functor. // Ultimately modeling the range concepts using composition // with the Boost.Iterator concepts would render the library // incompatible with many common Boost.Lambda expressions. template struct IncrementableIteratorConcept : CopyConstructible { #if BOOST_RANGE_ENABLE_CONCEPT_ASSERT typedef BOOST_DEDUCED_TYPENAME iterator_traversal::type traversal_category; BOOST_RANGE_CONCEPT_ASSERT(( Convertible< traversal_category, incrementable_traversal_tag >)); BOOST_CONCEPT_USAGE(IncrementableIteratorConcept) { ++i; (void)i++; } private: Iterator i; #endif }; template struct SinglePassIteratorConcept : IncrementableIteratorConcept , EqualityComparable { #if BOOST_RANGE_ENABLE_CONCEPT_ASSERT BOOST_RANGE_CONCEPT_ASSERT(( Convertible< BOOST_DEDUCED_TYPENAME SinglePassIteratorConcept::traversal_category, single_pass_traversal_tag >)); BOOST_CONCEPT_USAGE(SinglePassIteratorConcept) { Iterator i2(++i); boost::ignore_unused_variable_warning(i2); // deliberately we are loose with the postfix version for the single pass // iterator due to the commonly poor adherence to the specification means that // many algorithms would be unusable, whereas actually without the check they // work (void)(i++); BOOST_DEDUCED_TYPENAME boost::detail::iterator_traits::reference r1(*i); boost::ignore_unused_variable_warning(r1); BOOST_DEDUCED_TYPENAME boost::detail::iterator_traits::reference r2(*(++i)); boost::ignore_unused_variable_warning(r2); } private: Iterator i; #endif }; template struct ForwardIteratorConcept : SinglePassIteratorConcept , DefaultConstructible { #if BOOST_RANGE_ENABLE_CONCEPT_ASSERT typedef BOOST_DEDUCED_TYPENAME boost::detail::iterator_traits::difference_type difference_type; BOOST_MPL_ASSERT((is_integral)); BOOST_MPL_ASSERT_RELATION(std::numeric_limits::is_signed, ==, true); BOOST_RANGE_CONCEPT_ASSERT(( Convertible< BOOST_DEDUCED_TYPENAME ForwardIteratorConcept::traversal_category, forward_traversal_tag >)); BOOST_CONCEPT_USAGE(ForwardIteratorConcept) { // See the above note in the SinglePassIteratorConcept about the handling of the // postfix increment. Since with forward and better iterators there is no need // for a proxy, we can sensibly require that the dereference result // is convertible to reference. Iterator i2(i++); boost::ignore_unused_variable_warning(i2); BOOST_DEDUCED_TYPENAME boost::detail::iterator_traits::reference r(*(i++)); boost::ignore_unused_variable_warning(r); } private: Iterator i; #endif }; template struct BidirectionalIteratorConcept : ForwardIteratorConcept { #if BOOST_RANGE_ENABLE_CONCEPT_ASSERT BOOST_RANGE_CONCEPT_ASSERT(( Convertible< BOOST_DEDUCED_TYPENAME BidirectionalIteratorConcept::traversal_category, bidirectional_traversal_tag >)); BOOST_CONCEPT_USAGE(BidirectionalIteratorConcept) { --i; (void)i--; } private: Iterator i; #endif }; template struct RandomAccessIteratorConcept : BidirectionalIteratorConcept { #if BOOST_RANGE_ENABLE_CONCEPT_ASSERT BOOST_RANGE_CONCEPT_ASSERT(( Convertible< BOOST_DEDUCED_TYPENAME RandomAccessIteratorConcept::traversal_category, random_access_traversal_tag >)); BOOST_CONCEPT_USAGE(RandomAccessIteratorConcept) { i += n; i = i + n; i = n + i; i -= n; i = i - n; n = i - j; } private: BOOST_DEDUCED_TYPENAME RandomAccessIteratorConcept::difference_type n; Iterator i; Iterator j; #endif }; } // namespace range_detail //! Check if a type T models the SinglePassRange range concept. template struct SinglePassRangeConcept { #if BOOST_RANGE_ENABLE_CONCEPT_ASSERT typedef BOOST_DEDUCED_TYPENAME range_iterator::type const_iterator; typedef BOOST_DEDUCED_TYPENAME range_iterator::type iterator; BOOST_RANGE_CONCEPT_ASSERT((range_detail::SinglePassIteratorConcept)); BOOST_RANGE_CONCEPT_ASSERT((range_detail::SinglePassIteratorConcept)); BOOST_CONCEPT_USAGE(SinglePassRangeConcept) { // This has been modified from assigning to this->i // (where i was a member variable) to improve // compatibility with Boost.Lambda iterator i1 = boost::begin(*m_range); iterator i2 = boost::end(*m_range); ignore_unused_variable_warning(i1); ignore_unused_variable_warning(i2); const_constraints(*m_range); } private: void const_constraints(const T& const_range) { const_iterator ci1 = boost::begin(const_range); const_iterator ci2 = boost::end(const_range); ignore_unused_variable_warning(ci1); ignore_unused_variable_warning(ci2); } // Rationale: // The type of m_range is T* rather than T because it allows // T to be an abstract class. The other obvious alternative of // T& produces a warning on some compilers. T* m_range; #endif }; //! Check if a type T models the ForwardRange range concept. template struct ForwardRangeConcept : SinglePassRangeConcept { #if BOOST_RANGE_ENABLE_CONCEPT_ASSERT BOOST_RANGE_CONCEPT_ASSERT((range_detail::ForwardIteratorConcept)); BOOST_RANGE_CONCEPT_ASSERT((range_detail::ForwardIteratorConcept)); #endif }; template struct WriteableRangeConcept { #if BOOST_RANGE_ENABLE_CONCEPT_ASSERT typedef BOOST_DEDUCED_TYPENAME range_iterator::type iterator; BOOST_CONCEPT_USAGE(WriteableRangeConcept) { *i = v; } private: iterator i; BOOST_DEDUCED_TYPENAME range_value::type v; #endif }; //! Check if a type T models the WriteableForwardRange range concept. template struct WriteableForwardRangeConcept : ForwardRangeConcept , WriteableRangeConcept { }; //! Check if a type T models the BidirectionalRange range concept. template struct BidirectionalRangeConcept : ForwardRangeConcept { #if BOOST_RANGE_ENABLE_CONCEPT_ASSERT BOOST_RANGE_CONCEPT_ASSERT((range_detail::BidirectionalIteratorConcept)); BOOST_RANGE_CONCEPT_ASSERT((range_detail::BidirectionalIteratorConcept)); #endif }; //! Check if a type T models the WriteableBidirectionalRange range concept. template struct WriteableBidirectionalRangeConcept : BidirectionalRangeConcept , WriteableRangeConcept { }; //! Check if a type T models the RandomAccessRange range concept. template struct RandomAccessRangeConcept : BidirectionalRangeConcept { #if BOOST_RANGE_ENABLE_CONCEPT_ASSERT BOOST_RANGE_CONCEPT_ASSERT((range_detail::RandomAccessIteratorConcept)); BOOST_RANGE_CONCEPT_ASSERT((range_detail::RandomAccessIteratorConcept)); #endif }; //! Check if a type T models the WriteableRandomAccessRange range concept. template struct WriteableRandomAccessRangeConcept : RandomAccessRangeConcept , WriteableRangeConcept { }; } // namespace boost #endif // BOOST_RANGE_CONCEPTS_HPP madp-0.4/src/boost/boost/range/PaxHeaders.5405/begin.hpp0000644000000000000000000000007312717644140017716 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/range/begin.hpp0000664000372100037210000000703312717644140020551 0ustar00fransfrans00000000000000// Boost.Range library // // Copyright Thorsten Ottosen 2003-2004. Use, modification and // distribution is subject to the Boost Software License, Version // 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_BEGIN_HPP #define BOOST_RANGE_BEGIN_HPP #if defined(_MSC_VER) && (_MSC_VER >= 1200) # pragma once #endif #include #ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING #include #else #include namespace boost { #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \ !BOOST_WORKAROUND(__GNUC__, < 3) \ /**/ namespace range_detail { #endif ////////////////////////////////////////////////////////////////////// // primary template ////////////////////////////////////////////////////////////////////// template< typename C > inline BOOST_DEDUCED_TYPENAME range_iterator::type range_begin( C& c ) { // // If you get a compile-error here, it is most likely because // you have not implemented range_begin() properly in // the namespace of C // return c.begin(); } ////////////////////////////////////////////////////////////////////// // pair ////////////////////////////////////////////////////////////////////// template< typename Iterator > inline Iterator range_begin( const std::pair& p ) { return p.first; } template< typename Iterator > inline Iterator range_begin( std::pair& p ) { return p.first; } ////////////////////////////////////////////////////////////////////// // array ////////////////////////////////////////////////////////////////////// // // May this be discarded? Or is it needed for bad compilers? // template< typename T, std::size_t sz > inline const T* range_begin( const T (&a)[sz] ) { return a; } template< typename T, std::size_t sz > inline T* range_begin( T (&a)[sz] ) { return a; } #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \ !BOOST_WORKAROUND(__GNUC__, < 3) \ /**/ } // namespace 'range_detail' #endif // Use a ADL namespace barrier to avoid ambiguity with other unqualified // calls. This is particularly important with C++0x encouraging // unqualified calls to begin/end. namespace range_adl_barrier { template< class T > inline BOOST_DEDUCED_TYPENAME range_iterator::type begin( T& r ) { #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \ !BOOST_WORKAROUND(__GNUC__, < 3) \ /**/ using namespace range_detail; #endif return range_begin( r ); } template< class T > inline BOOST_DEDUCED_TYPENAME range_iterator::type begin( const T& r ) { #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \ !BOOST_WORKAROUND(__GNUC__, < 3) \ /**/ using namespace range_detail; #endif return range_begin( r ); } } // namespace range_adl_barrier } // namespace boost #endif // BOOST_NO_FUNCTION_TEMPLATE_ORDERING namespace boost { namespace range_adl_barrier { template< class T > inline BOOST_DEDUCED_TYPENAME range_iterator::type const_begin( const T& r ) { return boost::range_adl_barrier::begin( r ); } } // namespace range_adl_barrier using namespace range_adl_barrier; } // namespace boost #endif madp-0.4/src/boost/boost/range/PaxHeaders.5405/iterator_range_core.hpp0000644000000000000000000000007412717644140022650 xustar0030 atime=1463765180.165719647 30 ctime=1463765201.153552022 madp-0.4/src/boost/boost/range/iterator_range_core.hpp0000664000372100037210000005450012717644140023503 0ustar00fransfrans00000000000000// Boost.Range library // // Copyright Neil Groves & Thorsten Ottosen & Pavol Droba 2003-2004. // Use, modification and distribution is subject to the Boost Software // License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_ITERATOR_RANGE_CORE_HPP_INCLUDED #define BOOST_RANGE_ITERATOR_RANGE_CORE_HPP_INCLUDED #include // Define __STL_CONFIG_H, if appropriate. #include #if BOOST_WORKAROUND(BOOST_MSVC, BOOST_TESTED_AT(1500)) #pragma warning( push ) #pragma warning( disable : 4996 ) #endif #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include /*! \file Defines the \c iterator_class and related functions. \c iterator_range is a simple wrapper of iterator pair idiom. It provides a rich subset of Container interface. */ namespace boost { namespace iterator_range_detail { // // The functions adl_begin and adl_end are implemented in a separate // class for gcc-2.9x // template struct iterator_range_impl { template< class ForwardRange > static IteratorT adl_begin( ForwardRange& r ) { return static_cast( boost::begin( r ) ); } template< class ForwardRange > static IteratorT adl_end( ForwardRange& r ) { return static_cast( boost::end( r ) ); } }; template< class Left, class Right > inline bool less_than( const Left& l, const Right& r ) { return std::lexicographical_compare( boost::begin(l), boost::end(l), boost::begin(r), boost::end(r) ); } template< class Left, class Right > inline bool greater_than( const Left& l, const Right& r ) { return less_than(r,l); } template< class Left, class Right > inline bool less_or_equal_than( const Left& l, const Right& r ) { return !iterator_range_detail::less_than(r,l); } template< class Left, class Right > inline bool greater_or_equal_than( const Left& l, const Right& r ) { return !iterator_range_detail::less_than(l,r); } // This version is maintained since it is used in other boost libraries // such as Boost.Assign template< class Left, class Right > inline bool equal(const Left& l, const Right& r) { return boost::equal(l, r); } struct range_tag { }; struct const_range_tag { }; } // iterator range template class -----------------------------------------// //! iterator_range class /*! An \c iterator_range delimits a range in a sequence by beginning and ending iterators. An iterator_range can be passed to an algorithm which requires a sequence as an input. For example, the \c toupper() function may be used most frequently on strings, but can also be used on iterator_ranges: \code boost::tolower( find( s, "UPPERCASE STRING" ) ); \endcode Many algorithms working with sequences take a pair of iterators, delimiting a working range, as an arguments. The \c iterator_range class is an encapsulation of a range identified by a pair of iterators. It provides a collection interface, so it is possible to pass an instance to an algorithm requiring a collection as an input. */ template class iterator_range { typedef range_detail::safe_bool< IteratorT iterator_range::* > safe_bool_t; protected: // Used by sub_range //! implementation class typedef iterator_range_detail::iterator_range_impl impl; public: //! this type typedef iterator_range type; typedef BOOST_DEDUCED_TYPENAME safe_bool_t::unspecified_bool_type unspecified_bool_type; //BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(value_type); //! Encapsulated value type typedef BOOST_DEDUCED_TYPENAME iterator_value::type value_type; //! Difference type typedef BOOST_DEDUCED_TYPENAME iterator_difference::type difference_type; //! Size type typedef std::size_t size_type; // note: must be unsigned //! This type typedef iterator_range this_type; //! Reference type // // Needed because value-type is the same for // const and non-const iterators // typedef BOOST_DEDUCED_TYPENAME iterator_reference::type reference; //! const_iterator type /*! There is no distinction between const_iterator and iterator. These typedefs are provides to fulfill container interface */ typedef IteratorT const_iterator; //! iterator type typedef IteratorT iterator; private: // for return value of operator()() typedef BOOST_DEDUCED_TYPENAME boost::mpl::if_< boost::mpl::or_< boost::is_abstract< value_type >, boost::is_array< value_type > >, reference, value_type >::type abstract_value_type; public: iterator_range() : m_Begin( iterator() ), m_End( iterator() ) { } //! Constructor from a pair of iterators template< class Iterator > iterator_range( Iterator Begin, Iterator End ) : m_Begin(Begin), m_End(End) {} //! Constructor from a Range template< class Range > iterator_range( const Range& r ) : m_Begin( impl::adl_begin( r ) ), m_End( impl::adl_end( r ) ) {} //! Constructor from a Range template< class Range > iterator_range( Range& r ) : m_Begin( impl::adl_begin( r ) ), m_End( impl::adl_end( r ) ) {} //! Constructor from a Range template< class Range > iterator_range( const Range& r, iterator_range_detail::const_range_tag ) : m_Begin( impl::adl_begin( r ) ), m_End( impl::adl_end( r ) ) {} //! Constructor from a Range template< class Range > iterator_range( Range& r, iterator_range_detail::range_tag ) : m_Begin( impl::adl_begin( r ) ), m_End( impl::adl_end( r ) ) {} #if !BOOST_WORKAROUND(BOOST_MSVC, < 1300) this_type& operator=( const this_type& r ) { m_Begin = r.begin(); m_End = r.end(); return *this; } #endif template< class Iterator > iterator_range& operator=( const iterator_range& r ) { m_Begin = r.begin(); m_End = r.end(); return *this; } template< class ForwardRange > iterator_range& operator=( ForwardRange& r ) { m_Begin = impl::adl_begin( r ); m_End = impl::adl_end( r ); return *this; } template< class ForwardRange > iterator_range& operator=( const ForwardRange& r ) { m_Begin = impl::adl_begin( r ); m_End = impl::adl_end( r ); return *this; } IteratorT begin() const { return m_Begin; } IteratorT end() const { return m_End; } difference_type size() const { return m_End - m_Begin; } bool empty() const { return m_Begin == m_End; } operator unspecified_bool_type() const { return safe_bool_t::to_unspecified_bool(m_Begin != m_End, &iterator_range::m_Begin); } bool operator!() const { return empty(); } bool equal( const iterator_range& r ) const { return m_Begin == r.m_Begin && m_End == r.m_End; } #ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING bool operator==( const iterator_range& r ) const { return boost::equal( *this, r ); } bool operator!=( const iterator_range& r ) const { return !operator==(r); } bool operator<( const iterator_range& r ) const { return iterator_range_detail::less_than( *this, r ); } bool operator>( const iterator_range& r ) const { return iterator_range_detail::greater_than( *this, r ); } bool operator<=( const iterator_range& r ) const { return iterator_range_detail::less_or_equal_than( *this, r ); } bool operator>=( const iterator_range& r ) const { return iterator_range_detail::greater_or_equal_than( *this, r ); } #endif public: // convenience reference front() const { BOOST_ASSERT( !empty() ); return *m_Begin; } reference back() const { BOOST_ASSERT( !empty() ); IteratorT last( m_End ); return *--last; } // pop_front() - added to model the SinglePassRangePrimitiveConcept void pop_front() { BOOST_ASSERT( !empty() ); ++m_Begin; } // pop_back() - added to model the BidirectionalRangePrimitiveConcept void pop_back() { BOOST_ASSERT( !empty() ); --m_End; } reference operator[]( difference_type at ) const { BOOST_ASSERT( at >= 0 && at < size() ); return m_Begin[at]; } // // When storing transform iterators, operator[]() // fails because it returns by reference. Therefore // operator()() is provided for these cases. // abstract_value_type operator()( difference_type at ) const { BOOST_ASSERT( at >= 0 && at < size() ); return m_Begin[at]; } iterator_range& advance_begin( difference_type n ) { std::advance( m_Begin, n ); return *this; } iterator_range& advance_end( difference_type n ) { std::advance( m_End, n ); return *this; } private: // begin and end iterators IteratorT m_Begin; IteratorT m_End; protected: // // Allow subclasses an easy way to access the // base type // typedef iterator_range iterator_range_; }; // iterator range free-standing operators ---------------------------// ///////////////////////////////////////////////////////////////////// // comparison operators ///////////////////////////////////////////////////////////////////// template< class IteratorT, class ForwardRange > inline bool operator==( const ForwardRange& l, const iterator_range& r ) { return boost::equal( l, r ); } template< class IteratorT, class ForwardRange > inline bool operator!=( const ForwardRange& l, const iterator_range& r ) { return !boost::equal( l, r ); } template< class IteratorT, class ForwardRange > inline bool operator<( const ForwardRange& l, const iterator_range& r ) { return iterator_range_detail::less_than( l, r ); } template< class IteratorT, class ForwardRange > inline bool operator<=( const ForwardRange& l, const iterator_range& r ) { return iterator_range_detail::less_or_equal_than( l, r ); } template< class IteratorT, class ForwardRange > inline bool operator>( const ForwardRange& l, const iterator_range& r ) { return iterator_range_detail::greater_than( l, r ); } template< class IteratorT, class ForwardRange > inline bool operator>=( const ForwardRange& l, const iterator_range& r ) { return iterator_range_detail::greater_or_equal_than( l, r ); } #ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING #else template< class Iterator1T, class Iterator2T > inline bool operator==( const iterator_range& l, const iterator_range& r ) { return boost::equal( l, r ); } template< class IteratorT, class ForwardRange > inline bool operator==( const iterator_range& l, const ForwardRange& r ) { return boost::equal( l, r ); } template< class Iterator1T, class Iterator2T > inline bool operator!=( const iterator_range& l, const iterator_range& r ) { return !boost::equal( l, r ); } template< class IteratorT, class ForwardRange > inline bool operator!=( const iterator_range& l, const ForwardRange& r ) { return !boost::equal( l, r ); } template< class Iterator1T, class Iterator2T > inline bool operator<( const iterator_range& l, const iterator_range& r ) { return iterator_range_detail::less_than( l, r ); } template< class IteratorT, class ForwardRange > inline bool operator<( const iterator_range& l, const ForwardRange& r ) { return iterator_range_detail::less_than( l, r ); } template< class Iterator1T, class Iterator2T > inline bool operator<=( const iterator_range& l, const iterator_range& r ) { return iterator_range_detail::less_or_equal_than( l, r ); } template< class IteratorT, class ForwardRange > inline bool operator<=( const iterator_range& l, const ForwardRange& r ) { return iterator_range_detail::less_or_equal_than( l, r ); } template< class Iterator1T, class Iterator2T > inline bool operator>( const iterator_range& l, const iterator_range& r ) { return iterator_range_detail::greater_than( l, r ); } template< class IteratorT, class ForwardRange > inline bool operator>( const iterator_range& l, const ForwardRange& r ) { return iterator_range_detail::greater_than( l, r ); } template< class Iterator1T, class Iterator2T > inline bool operator>=( const iterator_range& l, const iterator_range& r ) { return iterator_range_detail::greater_or_equal_than( l, r ); } template< class IteratorT, class ForwardRange > inline bool operator>=( const iterator_range& l, const ForwardRange& r ) { return iterator_range_detail::greater_or_equal_than( l, r ); } #endif // BOOST_NO_FUNCTION_TEMPLATE_ORDERING // iterator range utilities -----------------------------------------// //! iterator_range construct helper /*! Construct an \c iterator_range from a pair of iterators \param Begin A begin iterator \param End An end iterator \return iterator_range object */ template< typename IteratorT > inline iterator_range< IteratorT > make_iterator_range( IteratorT Begin, IteratorT End ) { return iterator_range( Begin, End ); } #ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING template< typename Range > inline iterator_range< BOOST_DEDUCED_TYPENAME range_iterator::type > make_iterator_range( Range& r ) { return iterator_range< BOOST_DEDUCED_TYPENAME range_iterator::type > ( boost::begin( r ), boost::end( r ) ); } #else //! iterator_range construct helper /*! Construct an \c iterator_range from a \c Range containing the begin and end iterators. */ template< class ForwardRange > inline iterator_range< BOOST_DEDUCED_TYPENAME range_iterator::type > make_iterator_range( ForwardRange& r ) { return iterator_range< BOOST_DEDUCED_TYPENAME range_iterator::type > ( r, iterator_range_detail::range_tag() ); } template< class ForwardRange > inline iterator_range< BOOST_DEDUCED_TYPENAME range_iterator::type > make_iterator_range( const ForwardRange& r ) { return iterator_range< BOOST_DEDUCED_TYPENAME range_iterator::type > ( r, iterator_range_detail::const_range_tag() ); } #endif // BOOST_NO_FUNCTION_TEMPLATE_ORDERING namespace iterator_range_detail { template< class Range > inline iterator_range< BOOST_DEDUCED_TYPENAME range_iterator::type > make_range_impl( Range& r, BOOST_DEDUCED_TYPENAME range_difference::type advance_begin, BOOST_DEDUCED_TYPENAME range_difference::type advance_end ) { // // Not worth the effort // //if( advance_begin == 0 && advance_end == 0 ) // return make_iterator_range( r ); // BOOST_DEDUCED_TYPENAME range_iterator::type new_begin = boost::begin( r ), new_end = boost::end( r ); std::advance( new_begin, advance_begin ); std::advance( new_end, advance_end ); return make_iterator_range( new_begin, new_end ); } } #ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING template< class Range > inline iterator_range< BOOST_DEDUCED_TYPENAME range_iterator::type > make_iterator_range( Range& r, BOOST_DEDUCED_TYPENAME range_difference::type advance_begin, BOOST_DEDUCED_TYPENAME range_difference::type advance_end ) { //BOOST_ASSERT( advance_begin - advance_end <= size(r) && "creating invalid range" ); return iterator_range_detail::make_range_impl( r, advance_begin, advance_end ); } #else template< class Range > inline iterator_range< BOOST_DEDUCED_TYPENAME range_iterator::type > make_iterator_range( Range& r, BOOST_DEDUCED_TYPENAME range_difference::type advance_begin, BOOST_DEDUCED_TYPENAME range_difference::type advance_end ) { //BOOST_ASSERT( advance_begin - advance_end <= size(r) && "creating invalid range" ); return iterator_range_detail::make_range_impl( r, advance_begin, advance_end ); } template< class Range > inline iterator_range< BOOST_DEDUCED_TYPENAME range_iterator::type > make_iterator_range( const Range& r, BOOST_DEDUCED_TYPENAME range_difference::type advance_begin, BOOST_DEDUCED_TYPENAME range_difference::type advance_end ) { //BOOST_ASSERT( advance_begin - advance_end <= size(r) && "creating invalid range" ); return iterator_range_detail::make_range_impl( r, advance_begin, advance_end ); } #endif // BOOST_NO_FUNCTION_TEMPLATE_ORDERING //! copy a range into a sequence /*! Construct a new sequence of the specified type from the elements in the given range \param Range An input range \return New sequence */ template< typename SeqT, typename Range > inline SeqT copy_range( const Range& r ) { return SeqT( boost::begin( r ), boost::end( r ) ); } } // namespace 'boost' #if BOOST_WORKAROUND(BOOST_MSVC, BOOST_TESTED_AT(1500)) #pragma warning( pop ) #endif #endif madp-0.4/src/boost/boost/range/PaxHeaders.5405/size.hpp0000644000000000000000000000007412717644140017605 xustar0030 atime=1463765180.165719647 30 ctime=1463765201.153552022 madp-0.4/src/boost/boost/range/size.hpp0000664000372100037210000000265212717644140020441 0ustar00fransfrans00000000000000// Boost.Range library // // Copyright Thorsten Ottosen 2003-2004. Use, modification and // distribution is subject to the Boost Software License, Version // 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_SIZE_HPP #define BOOST_RANGE_SIZE_HPP #if defined(_MSC_VER) && (_MSC_VER >= 1200) # pragma once #endif #include #include #include #include #include namespace boost { namespace range_detail { template inline BOOST_DEDUCED_TYPENAME range_size::type range_calculate_size(const SinglePassRange& rng) { BOOST_ASSERT( (boost::end(rng) - boost::begin(rng)) >= 0 && "reachability invariant broken!" ); return boost::end(rng) - boost::begin(rng); } } template inline BOOST_DEDUCED_TYPENAME range_size::type size(const SinglePassRange& rng) { #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \ !BOOST_WORKAROUND(__GNUC__, < 3) \ /**/ using namespace range_detail; #endif return range_calculate_size(rng); } } // namespace 'boost' #endif madp-0.4/src/boost/boost/range/PaxHeaders.5405/value_type.hpp0000644000000000000000000000007412717644140021010 xustar0030 atime=1463765180.165719647 30 ctime=1463765201.153552022 madp-0.4/src/boost/boost/range/value_type.hpp0000664000372100037210000000147112717644140021642 0ustar00fransfrans00000000000000// Boost.Range library // // Copyright Thorsten Ottosen 2003-2004. Use, modification and // distribution is subject to the Boost Software License, Version // 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_VALUE_TYPE_HPP #define BOOST_RANGE_VALUE_TYPE_HPP #if defined(_MSC_VER) && (_MSC_VER >= 1200) # pragma once #endif #include #include //#ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION //#include //#else #include namespace boost { template< class T > struct range_value : iterator_value< typename range_iterator::type > { }; } #endif madp-0.4/src/boost/boost/range/PaxHeaders.5405/rend.hpp0000644000000000000000000000007412717644140017563 xustar0030 atime=1463765180.165719647 30 ctime=1463765201.153552022 madp-0.4/src/boost/boost/range/rend.hpp0000664000372100037210000000266212717644140020420 0ustar00fransfrans00000000000000// Boost.Range library // // Copyright Thorsten Ottosen 2003-2004. Use, modification and // distribution is subject to the Boost Software License, Version // 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_REND_HPP #define BOOST_RANGE_REND_HPP #if defined(_MSC_VER) && (_MSC_VER >= 1200) # pragma once #endif #include #include namespace boost { #ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING template< class C > inline BOOST_DEDUCED_TYPENAME range_reverse_iterator::type rend( C& c ) { return BOOST_DEDUCED_TYPENAME range_reverse_iterator::type( boost::begin( c ) ); } #else template< class C > inline BOOST_DEDUCED_TYPENAME range_reverse_iterator::type rend( C& c ) { typedef BOOST_DEDUCED_TYPENAME range_reverse_iterator::type iter_type; return iter_type( boost::begin( c ) ); } template< class C > inline BOOST_DEDUCED_TYPENAME range_reverse_iterator::type rend( const C& c ) { typedef BOOST_DEDUCED_TYPENAME range_reverse_iterator::type iter_type; return iter_type( boost::begin( c ) ); } #endif template< class T > inline BOOST_DEDUCED_TYPENAME range_reverse_iterator::type const_rend( const T& r ) { return boost::rend( r ); } } // namespace 'boost' #endif madp-0.4/src/boost/boost/range/PaxHeaders.5405/functions.hpp0000644000000000000000000000007312717644140020642 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/range/functions.hpp0000664000372100037210000000127612717644140021500 0ustar00fransfrans00000000000000// Boost.Range library // // Copyright Thorsten Ottosen 2003-2006. Use, modification and // distribution is subject to the Boost Software License, Version // 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_FUNCTIONS_HPP #define BOOST_RANGE_FUNCTIONS_HPP #if defined(_MSC_VER) && (_MSC_VER >= 1200) # pragma once #endif #include #include #include #include #include #include #include #endif madp-0.4/src/boost/boost/range/PaxHeaders.5405/empty.hpp0000644000000000000000000000007312717644140017770 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/range/empty.hpp0000664000372100037210000000133412717644140020621 0ustar00fransfrans00000000000000// Boost.Range library // // Copyright Thorsten Ottosen 2003-2004. Use, modification and // distribution is subject to the Boost Software License, Version // 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_EMPTY_HPP #define BOOST_RANGE_EMPTY_HPP #if defined(_MSC_VER) && (_MSC_VER >= 1200) # pragma once #endif #include #include #include namespace boost { template< class T > inline bool empty( const T& r ) { return boost::begin( r ) == boost::end( r ); } } // namespace 'boost' #endif madp-0.4/src/boost/boost/range/PaxHeaders.5405/algorithm0000644000000000000000000000007412717644140020033 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/range/algorithm/0000775000372100037210000000000012717644140020737 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/range/algorithm/PaxHeaders.5405/equal.hpp0000644000000000000000000000007312717644140021727 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/range/algorithm/equal.hpp0000664000372100037210000002130012717644140022553 0ustar00fransfrans00000000000000// Boost.Range library // // Copyright Neil Groves 2009. // Use, modification and distribution is subject to the Boost Software // License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_ALGORITHM_EQUAL_HPP_INCLUDED #define BOOST_RANGE_ALGORITHM_EQUAL_HPP_INCLUDED #include #include #include namespace boost { namespace range_detail { // An implementation of equality comparison that is optimized for iterator // traversal categories less than RandomAccessTraversal. template< class SinglePassTraversalReadableIterator1, class SinglePassTraversalReadableIterator2, class IteratorCategoryTag1, class IteratorCategoryTag2 > inline bool equal_impl( SinglePassTraversalReadableIterator1 first1, SinglePassTraversalReadableIterator1 last1, SinglePassTraversalReadableIterator2 first2, SinglePassTraversalReadableIterator2 last2, IteratorCategoryTag1, IteratorCategoryTag2 ) { while (true) { // If we have reached the end of the left range then this is // the end of the loop. They are equal if and only if we have // simultaneously reached the end of the right range. if (first1 == last1) return first2 == last2; // If we have reached the end of the right range at this line // it indicates that the right range is shorter than the left // and hence the result is false. if (first2 == last2) return false; // continue looping if and only if the values are equal if (*first1 != *first2) break; ++first1; ++first2; } // Reaching this line in the algorithm indicates that a value // inequality has been detected. return false; } template< class SinglePassTraversalReadableIterator1, class SinglePassTraversalReadableIterator2, class IteratorCategoryTag1, class IteratorCategoryTag2, class BinaryPredicate > inline bool equal_impl( SinglePassTraversalReadableIterator1 first1, SinglePassTraversalReadableIterator1 last1, SinglePassTraversalReadableIterator2 first2, SinglePassTraversalReadableIterator2 last2, BinaryPredicate pred, IteratorCategoryTag1, IteratorCategoryTag2 ) { while (true) { // If we have reached the end of the left range then this is // the end of the loop. They are equal if and only if we have // simultaneously reached the end of the right range. if (first1 == last1) return first2 == last2; // If we have reached the end of the right range at this line // it indicates that the right range is shorter than the left // and hence the result is false. if (first2 == last2) return false; // continue looping if and only if the values are equal if (!pred(*first1, *first2)) break; ++first1; ++first2; } // Reaching this line in the algorithm indicates that a value // inequality has been detected. return false; } // An implementation of equality comparison that is optimized for // random access iterators. template< class RandomAccessTraversalReadableIterator1, class RandomAccessTraversalReadableIterator2 > inline bool equal_impl( RandomAccessTraversalReadableIterator1 first1, RandomAccessTraversalReadableIterator1 last1, RandomAccessTraversalReadableIterator2 first2, RandomAccessTraversalReadableIterator2 last2, std::random_access_iterator_tag, std::random_access_iterator_tag ) { return ((last1 - first1) == (last2 - first2)) && std::equal(first1, last1, first2); } template< class RandomAccessTraversalReadableIterator1, class RandomAccessTraversalReadableIterator2, class BinaryPredicate > inline bool equal_impl( RandomAccessTraversalReadableIterator1 first1, RandomAccessTraversalReadableIterator1 last1, RandomAccessTraversalReadableIterator2 first2, RandomAccessTraversalReadableIterator2 last2, BinaryPredicate pred ) { return ((last1 - first1) == (last2 - first2)) && std::equal(first1, last1, first2, pred); } template< class SinglePassTraversalReadableIterator1, class SinglePassTraversalReadableIterator2 > inline bool equal( SinglePassTraversalReadableIterator1 first1, SinglePassTraversalReadableIterator1 last1, SinglePassTraversalReadableIterator2 first2, SinglePassTraversalReadableIterator2 last2 ) { BOOST_DEDUCED_TYPENAME std::iterator_traits< SinglePassTraversalReadableIterator1 >::iterator_category tag1; BOOST_DEDUCED_TYPENAME std::iterator_traits< SinglePassTraversalReadableIterator2 >::iterator_category tag2; return equal_impl(first1, last1, first2, last2, tag1, tag2); } template< class SinglePassTraversalReadableIterator1, class SinglePassTraversalReadableIterator2, class BinaryPredicate > inline bool equal( SinglePassTraversalReadableIterator1 first1, SinglePassTraversalReadableIterator1 last1, SinglePassTraversalReadableIterator2 first2, SinglePassTraversalReadableIterator2 last2, BinaryPredicate pred ) { BOOST_DEDUCED_TYPENAME std::iterator_traits< SinglePassTraversalReadableIterator1 >::iterator_category tag1; BOOST_DEDUCED_TYPENAME std::iterator_traits< SinglePassTraversalReadableIterator2 >::iterator_category tag2; return equal_impl(first1, last1, first2, last2, pred, tag1, tag2); } } // namespace range_detail namespace range { /// \brief template function equal /// /// range-based version of the equal std algorithm /// /// \pre SinglePassRange1 is a model of the SinglePassRangeConcept /// \pre SinglePassRange2 is a model of the SinglePassRangeConcept /// \pre BinaryPredicate is a model of the BinaryPredicateConcept template< class SinglePassRange1, class SinglePassRange2 > inline bool equal( const SinglePassRange1& rng1, const SinglePassRange2& rng2 ) { BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); return ::boost::range_detail::equal( ::boost::begin(rng1), ::boost::end(rng1), ::boost::begin(rng2), ::boost::end(rng2) ); } /// \overload template< class SinglePassRange1, class SinglePassRange2, class BinaryPredicate > inline bool equal( const SinglePassRange1& rng1, const SinglePassRange2& rng2, BinaryPredicate pred ) { BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept )); return ::boost::range_detail::equal( ::boost::begin(rng1), ::boost::end(rng1), ::boost::begin(rng2), ::boost::end(rng2), pred); } } // namespace range using ::boost::range::equal; } // namespace boost #endif // include guard madp-0.4/src/boost/boost/range/PaxHeaders.5405/reverse_iterator.hpp0000644000000000000000000000007412717644140022217 xustar0030 atime=1463765180.165719647 30 ctime=1463765201.153552022 madp-0.4/src/boost/boost/range/reverse_iterator.hpp0000664000372100037210000000175312717644140023054 0ustar00fransfrans00000000000000// Boost.Range library // // Copyright Thorsten Ottosen 2003-2004. Use, modification and // distribution is subject to the Boost Software License, Version // 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_REVERSE_ITERATOR_HPP #define BOOST_RANGE_REVERSE_ITERATOR_HPP #if defined(_MSC_VER) && (_MSC_VER >= 1200) # pragma once #endif #include #include #include namespace boost { ////////////////////////////////////////////////////////////////////////// // default ////////////////////////////////////////////////////////////////////////// template< typename C > struct range_reverse_iterator { typedef reverse_iterator< BOOST_DEDUCED_TYPENAME range_iterator::type > type; }; } // namespace boost #endif madp-0.4/src/boost/boost/range/PaxHeaders.5405/mutable_iterator.hpp0000644000000000000000000000007412717644140022175 xustar0030 atime=1463765180.165719647 30 ctime=1463765201.153552022 madp-0.4/src/boost/boost/range/mutable_iterator.hpp0000664000372100037210000000346012717644140023027 0ustar00fransfrans00000000000000// Boost.Range library // // Copyright Thorsten Ottosen 2003-2004. Use, modification and // distribution is subject to the Boost Software License, Version // 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_MUTABLE_ITERATOR_HPP #define BOOST_RANGE_MUTABLE_ITERATOR_HPP #if defined(_MSC_VER) && (_MSC_VER >= 1200) # pragma once #endif #include #ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION #include #else #include #include #include #include namespace boost { ////////////////////////////////////////////////////////////////////////// // default ////////////////////////////////////////////////////////////////////////// namespace range_detail { BOOST_RANGE_EXTRACT_OPTIONAL_TYPE( iterator ) } template< typename C > struct range_mutable_iterator : range_detail::extract_iterator {}; ////////////////////////////////////////////////////////////////////////// // pair ////////////////////////////////////////////////////////////////////////// template< typename Iterator > struct range_mutable_iterator< std::pair > { typedef Iterator type; }; ////////////////////////////////////////////////////////////////////////// // array ////////////////////////////////////////////////////////////////////////// template< typename T, std::size_t sz > struct range_mutable_iterator< T[sz] > { typedef T* type; }; } // namespace boost #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION #endif madp-0.4/src/boost/boost/range/PaxHeaders.5405/size_type.hpp0000644000000000000000000000007412717644140020646 xustar0030 atime=1463765180.165719647 30 ctime=1463765201.153552022 madp-0.4/src/boost/boost/range/size_type.hpp0000664000372100037210000000432012717644140021474 0ustar00fransfrans00000000000000// Boost.Range library // // Copyright Thorsten Ottosen 2003-2004. Use, modification and // distribution is subject to the Boost Software License, Version // 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_SIZE_TYPE_HPP #define BOOST_RANGE_SIZE_TYPE_HPP #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once #endif #include #include #ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION #include #else #include #include #include #include #include namespace boost { namespace detail { ////////////////////////////////////////////////////////////////////////// // default ////////////////////////////////////////////////////////////////////////// template class has_size_type { typedef char no_type; struct yes_type { char dummy[2]; }; template static yes_type test(BOOST_DEDUCED_TYPENAME C::size_type x); template static no_type test(Arg x); public: static const bool value = sizeof(test(0)) == sizeof(yes_type); }; template struct range_size { typedef BOOST_DEDUCED_TYPENAME make_unsigned< BOOST_DEDUCED_TYPENAME range_difference::type >::type type; }; template struct range_size< C, BOOST_DEDUCED_TYPENAME enable_if, void>::type > { typedef BOOST_DEDUCED_TYPENAME C::size_type type; }; } template< class T > struct range_size : detail::range_size { }; template< class T > struct range_size : detail::range_size { }; } // namespace boost #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION #endif madp-0.4/src/boost/boost/range/PaxHeaders.5405/distance.hpp0000644000000000000000000000007312717644140020424 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/range/distance.hpp0000664000372100037210000000145412717644140021260 0ustar00fransfrans00000000000000// Boost.Range library // // Copyright Thorsten Ottosen 2003-2006. Use, modification and // distribution is subject to the Boost Software License, Version // 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_DISTANCE_HPP #define BOOST_RANGE_DISTANCE_HPP #if defined(_MSC_VER) && (_MSC_VER >= 1200) # pragma once #endif #include #include #include namespace boost { template< class T > inline BOOST_DEDUCED_TYPENAME range_difference::type distance( const T& r ) { return std::distance( boost::begin( r ), boost::end( r ) ); } } // namespace 'boost' #endif madp-0.4/src/boost/boost/range/PaxHeaders.5405/iterator.hpp0000644000000000000000000000007312717644140020463 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/range/iterator.hpp0000664000372100037210000000352412717644140021317 0ustar00fransfrans00000000000000// Boost.Range library // // Copyright Thorsten Ottosen 2003-2004. Use, modification and // distribution is subject to the Boost Software License, Version // 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_ITERATOR_HPP #define BOOST_RANGE_ITERATOR_HPP #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once #endif #include #include #include #include #include #include namespace boost { #if BOOST_WORKAROUND(BOOST_MSVC, == 1310) namespace range_detail_vc7_1 { template< typename C, typename Sig = void(C) > struct range_iterator { typedef BOOST_RANGE_DEDUCED_TYPENAME mpl::eval_if_c< is_const::value, range_const_iterator< typename remove_const::type >, range_mutable_iterator >::type type; }; template< typename C, typename T > struct range_iterator< C, void(T[]) > { typedef T* type; }; } #endif template< typename C > struct range_iterator { #if BOOST_WORKAROUND(BOOST_MSVC, == 1310) typedef BOOST_RANGE_DEDUCED_TYPENAME range_detail_vc7_1::range_iterator::type type; #else typedef BOOST_RANGE_DEDUCED_TYPENAME mpl::eval_if_c< is_const::value, range_const_iterator< typename remove_const::type >, range_mutable_iterator >::type type; #endif }; } // namespace boost //#endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION #endif madp-0.4/src/boost/boost/range/PaxHeaders.5405/end.hpp0000644000000000000000000000007312717644140017400 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/range/end.hpp0000664000372100037210000000710512717644140020233 0ustar00fransfrans00000000000000// Boost.Range library // // Copyright Thorsten Ottosen 2003-2004. Use, modification and // distribution is subject to the Boost Software License, Version // 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_END_HPP #define BOOST_RANGE_END_HPP #if defined(_MSC_VER) && (_MSC_VER >= 1200) # pragma once #endif #include #ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING #include #else #include #include #include namespace boost { #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \ !BOOST_WORKAROUND(__GNUC__, < 3) \ /**/ namespace range_detail { #endif ////////////////////////////////////////////////////////////////////// // primary template ////////////////////////////////////////////////////////////////////// template< typename C > inline BOOST_DEDUCED_TYPENAME range_iterator::type range_end( C& c ) { // // If you get a compile-error here, it is most likely because // you have not implemented range_begin() properly in // the namespace of C // return c.end(); } ////////////////////////////////////////////////////////////////////// // pair ////////////////////////////////////////////////////////////////////// template< typename Iterator > inline Iterator range_end( const std::pair& p ) { return p.second; } template< typename Iterator > inline Iterator range_end( std::pair& p ) { return p.second; } ////////////////////////////////////////////////////////////////////// // array ////////////////////////////////////////////////////////////////////// template< typename T, std::size_t sz > inline const T* range_end( const T (&a)[sz] ) { return range_detail::array_end( a ); } template< typename T, std::size_t sz > inline T* range_end( T (&a)[sz] ) { return range_detail::array_end( a ); } #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \ !BOOST_WORKAROUND(__GNUC__, < 3) \ /**/ } // namespace 'range_detail' #endif namespace range_adl_barrier { template< class T > inline BOOST_DEDUCED_TYPENAME range_iterator::type end( T& r ) { #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \ !BOOST_WORKAROUND(__GNUC__, < 3) \ /**/ using namespace range_detail; #endif return range_end( r ); } template< class T > inline BOOST_DEDUCED_TYPENAME range_iterator::type end( const T& r ) { #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) && \ !BOOST_WORKAROUND(__GNUC__, < 3) \ /**/ using namespace range_detail; #endif return range_end( r ); } } // namespace range_adl_barrier } // namespace 'boost' #endif // BOOST_NO_FUNCTION_TEMPLATE_ORDERING namespace boost { namespace range_adl_barrier { template< class T > inline BOOST_DEDUCED_TYPENAME range_iterator::type const_end( const T& r ) { return boost::range_adl_barrier::end( r ); } } // namespace range_adl_barrier using namespace range_adl_barrier; } // namespace boost #endif madp-0.4/src/boost/boost/range/PaxHeaders.5405/difference_type.hpp0000644000000000000000000000007312717644140021765 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/range/difference_type.hpp0000664000372100037210000000134212717644140022615 0ustar00fransfrans00000000000000// Boost.Range library // // Copyright Thorsten Ottosen 2003-2004. Use, modification and // distribution is subject to the Boost Software License, Version // 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_DIFFERENCE_TYPE_HPP #define BOOST_RANGE_DIFFERENCE_TYPE_HPP #if defined(_MSC_VER) && (_MSC_VER >= 1200) # pragma once #endif #include #include #include namespace boost { template< class T > struct range_difference : iterator_difference< typename range_iterator::type > { }; } #endif madp-0.4/src/boost/boost/PaxHeaders.5405/functional0000644000000000000000000000007412717644140017113 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.049552852 madp-0.4/src/boost/boost/functional/0000775000372100037210000000000012717644140020017 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/functional/PaxHeaders.5405/hash_fwd.hpp0000644000000000000000000000007412717644140021464 xustar0030 atime=1463765180.101720159 30 ctime=1463765201.049552852 madp-0.4/src/boost/boost/functional/hash_fwd.hpp0000664000372100037210000000035712717644140022320 0ustar00fransfrans00000000000000 // Copyright 2005-2009 Daniel James. // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) #include madp-0.4/src/boost/boost/functional/PaxHeaders.5405/hash0000644000000000000000000000007412717644140020036 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.049552852 madp-0.4/src/boost/boost/functional/hash/0000775000372100037210000000000012717644140020742 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/functional/hash/PaxHeaders.5405/hash_fwd.hpp0000644000000000000000000000007412717644140022407 xustar0030 atime=1463765180.101720159 30 ctime=1463765201.049552852 madp-0.4/src/boost/boost/functional/hash/hash_fwd.hpp0000664000372100037210000000215112717644140023235 0ustar00fransfrans00000000000000 // Copyright 2005-2009 Daniel James. // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // Based on Peter Dimov's proposal // http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1756.pdf // issue 6.18. #if !defined(BOOST_FUNCTIONAL_HASH_FWD_HPP) #define BOOST_FUNCTIONAL_HASH_FWD_HPP #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once #endif #include #include #include namespace boost { template struct hash; #if BOOST_WORKAROUND(BOOST_MSVC, < 1300) template void hash_combine(std::size_t& seed, T& v); #else template void hash_combine(std::size_t& seed, T const& v); #endif template std::size_t hash_range(It, It); template void hash_range(std::size_t&, It, It); #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x551)) template inline std::size_t hash_range(T*, T*); template inline void hash_range(std::size_t&, T*, T*); #endif } #endif madp-0.4/src/boost/boost/functional/hash/PaxHeaders.5405/detail0000644000000000000000000000007412717644140021300 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.049552852 madp-0.4/src/boost/boost/functional/hash/detail/0000775000372100037210000000000012717644140022204 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/functional/hash/detail/PaxHeaders.5405/hash_float.hpp0000644000000000000000000000007412717644140024176 xustar0030 atime=1463765180.101720159 30 ctime=1463765201.049552852 madp-0.4/src/boost/boost/functional/hash/detail/hash_float.hpp0000664000372100037210000001753312717644140025036 0ustar00fransfrans00000000000000 // Copyright 2005-2012 Daniel James. // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) #if !defined(BOOST_FUNCTIONAL_HASH_DETAIL_HASH_FLOAT_HEADER) #define BOOST_FUNCTIONAL_HASH_DETAIL_HASH_FLOAT_HEADER #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once #endif #include #include #include #include #include #include #include #include #include #if defined(BOOST_MSVC) #pragma warning(push) #if BOOST_MSVC >= 1400 #pragma warning(disable:6294) // Ill-defined for-loop: initial condition does // not satisfy test. Loop body not executed #endif #endif // Can we use fpclassify? // STLport #if defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION) #define BOOST_HASH_USE_FPCLASSIFY 0 // GNU libstdc++ 3 #elif defined(__GLIBCPP__) || defined(__GLIBCXX__) # if (defined(__USE_ISOC99) || defined(_GLIBCXX_USE_C99_MATH)) && \ !(defined(macintosh) || defined(__APPLE__) || defined(__APPLE_CC__)) # define BOOST_HASH_USE_FPCLASSIFY 1 # else # define BOOST_HASH_USE_FPCLASSIFY 0 # endif // Everything else #else # define BOOST_HASH_USE_FPCLASSIFY 0 #endif namespace boost { namespace hash_detail { inline void hash_float_combine(std::size_t& seed, std::size_t value) { seed ^= value + (seed<<6) + (seed>>2); } //////////////////////////////////////////////////////////////////////// // Binary hash function // // Only used for floats with known iec559 floats, and certain values in // numeric_limits inline std::size_t hash_binary(char* ptr, std::size_t length) { std::size_t seed = 0; if (length >= sizeof(std::size_t)) { seed = *(std::size_t*) ptr; length -= sizeof(std::size_t); ptr += sizeof(std::size_t); while(length >= sizeof(std::size_t)) { std::size_t buffer = 0; std::memcpy(&buffer, ptr, sizeof(std::size_t)); hash_float_combine(seed, buffer); length -= sizeof(std::size_t); ptr += sizeof(std::size_t); } } if (length > 0) { std::size_t buffer = 0; std::memcpy(&buffer, ptr, length); hash_float_combine(seed, buffer); } return seed; } template struct enable_binary_hash { BOOST_STATIC_CONSTANT(bool, value = std::numeric_limits::is_iec559 && std::numeric_limits::digits == digits && std::numeric_limits::radix == 2 && std::numeric_limits::max_exponent == max_exponent); }; template inline std::size_t float_hash_impl(Float v, BOOST_DEDUCED_TYPENAME boost::enable_if_c< enable_binary_hash::value, std::size_t>::type) { return hash_binary((char*) &v, 4); } template inline std::size_t float_hash_impl(Float v, BOOST_DEDUCED_TYPENAME boost::enable_if_c< enable_binary_hash::value, std::size_t>::type) { return hash_binary((char*) &v, 8); } template inline std::size_t float_hash_impl(Float v, BOOST_DEDUCED_TYPENAME boost::enable_if_c< enable_binary_hash::value, std::size_t>::type) { return hash_binary((char*) &v, 10); } template inline std::size_t float_hash_impl(Float v, BOOST_DEDUCED_TYPENAME boost::enable_if_c< enable_binary_hash::value, std::size_t>::type) { return hash_binary((char*) &v, 16); } //////////////////////////////////////////////////////////////////////// // Portable hash function // // Used as a fallback when the binary hash function isn't supported. template inline std::size_t float_hash_impl2(T v) { boost::hash_detail::call_frexp frexp; boost::hash_detail::call_ldexp ldexp; int exp = 0; v = frexp(v, &exp); // A postive value is easier to hash, so combine the // sign with the exponent and use the absolute value. if(v < 0) { v = -v; exp += limits::max_exponent - limits::min_exponent; } v = ldexp(v, limits::digits); std::size_t seed = static_cast(v); v -= static_cast(seed); // ceiling(digits(T) * log2(radix(T))/ digits(size_t)) - 1; std::size_t const length = (limits::digits * boost::static_log2::radix>::value + limits::digits - 1) / limits::digits; for(std::size_t i = 0; i != length; ++i) { v = ldexp(v, limits::digits); std::size_t part = static_cast(v); v -= static_cast(part); hash_float_combine(seed, part); } hash_float_combine(seed, exp); return seed; } #if !defined(BOOST_HASH_DETAIL_TEST_WITHOUT_GENERIC) template inline std::size_t float_hash_impl(T v, ...) { typedef BOOST_DEDUCED_TYPENAME select_hash_type::type type; return float_hash_impl2(static_cast(v)); } #endif } } #if BOOST_HASH_USE_FPCLASSIFY #include namespace boost { namespace hash_detail { template inline std::size_t float_hash_value(T v) { #if defined(fpclassify) switch (fpclassify(v)) #elif BOOST_HASH_CONFORMANT_FLOATS switch (std::fpclassify(v)) #else using namespace std; switch (fpclassify(v)) #endif { case FP_ZERO: return 0; case FP_INFINITE: return (std::size_t)(v > 0 ? -1 : -2); case FP_NAN: return (std::size_t)(-3); case FP_NORMAL: case FP_SUBNORMAL: return float_hash_impl(v, 0); default: BOOST_ASSERT(0); return 0; } } } } #else // !BOOST_HASH_USE_FPCLASSIFY namespace boost { namespace hash_detail { template inline bool is_zero(T v) { #if !defined(__GNUC__) return v == 0; #else // GCC's '-Wfloat-equal' will complain about comparing // v to 0, but because it disables warnings for system // headers it won't complain if you use std::equal_to to // compare with 0. Resulting in this silliness: return std::equal_to()(v, 0); #endif } template inline std::size_t float_hash_value(T v) { return boost::hash_detail::is_zero(v) ? 0 : float_hash_impl(v, 0); } } } #endif // BOOST_HASH_USE_FPCLASSIFY #undef BOOST_HASH_USE_FPCLASSIFY #if defined(BOOST_MSVC) #pragma warning(pop) #endif #endif madp-0.4/src/boost/boost/functional/hash/detail/PaxHeaders.5405/limits.hpp0000644000000000000000000000007412717644140023367 xustar0030 atime=1463765180.101720159 30 ctime=1463765201.049552852 madp-0.4/src/boost/boost/functional/hash/detail/limits.hpp0000664000372100037210000000321112717644140024213 0ustar00fransfrans00000000000000 // Copyright 2005-2009 Daniel James. // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // // On some platforms std::limits gives incorrect values for long double. // This tries to work around them. #if !defined(BOOST_FUNCTIONAL_HASH_DETAIL_LIMITS_HEADER) #define BOOST_FUNCTIONAL_HASH_DETAIL_LIMITS_HEADER #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once #endif #include // On OpenBSD, numeric_limits is not reliable for long doubles, but // the macros defined in are and support long double when STLport // doesn't. #if defined(__OpenBSD__) || defined(_STLP_NO_LONG_DOUBLE) #include #endif namespace boost { namespace hash_detail { template struct limits : std::numeric_limits {}; #if defined(__OpenBSD__) || defined(_STLP_NO_LONG_DOUBLE) template <> struct limits : std::numeric_limits { static long double epsilon() { return LDBL_EPSILON; } static long double (max)() { return LDBL_MAX; } static long double (min)() { return LDBL_MIN; } BOOST_STATIC_CONSTANT(int, digits = LDBL_MANT_DIG); BOOST_STATIC_CONSTANT(int, max_exponent = LDBL_MAX_EXP); BOOST_STATIC_CONSTANT(int, min_exponent = LDBL_MIN_EXP); #if defined(_STLP_NO_LONG_DOUBLE) BOOST_STATIC_CONSTANT(int, radix = FLT_RADIX); #endif }; #endif // __OpenBSD__ } } #endif madp-0.4/src/boost/boost/functional/hash/detail/PaxHeaders.5405/float_functions.hpp0000644000000000000000000000007412717644140025263 xustar0030 atime=1463765180.101720159 30 ctime=1463765201.049552852 madp-0.4/src/boost/boost/functional/hash/detail/float_functions.hpp0000664000372100037210000003257512717644140026126 0ustar00fransfrans00000000000000 // Copyright 2005-2009 Daniel James. // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) #if !defined(BOOST_FUNCTIONAL_HASH_DETAIL_FLOAT_FUNCTIONS_HPP) #define BOOST_FUNCTIONAL_HASH_DETAIL_FLOAT_FUNCTIONS_HPP #include #include #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once #endif // Set BOOST_HASH_CONFORMANT_FLOATS to 1 for libraries known to have // sufficiently good floating point support to not require any // workarounds. // // When set to 0, the library tries to automatically // use the best available implementation. This normally works well, but // breaks when ambiguities are created by odd namespacing of the functions. // // Note that if this is set to 0, the library should still take full // advantage of the platform's floating point support. #if defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION) # define BOOST_HASH_CONFORMANT_FLOATS 0 #elif defined(__LIBCOMO__) # define BOOST_HASH_CONFORMANT_FLOATS 0 #elif defined(__STD_RWCOMPILER_H__) || defined(_RWSTD_VER) // Rogue Wave library: # define BOOST_HASH_CONFORMANT_FLOATS 0 #elif defined(_LIBCPP_VERSION) // libc++ # define BOOST_HASH_CONFORMANT_FLOATS 1 #elif defined(__GLIBCPP__) || defined(__GLIBCXX__) // GNU libstdc++ 3 # if defined(__GNUC__) && __GNUC__ >= 4 # define BOOST_HASH_CONFORMANT_FLOATS 1 # else # define BOOST_HASH_CONFORMANT_FLOATS 0 # endif #elif defined(__STL_CONFIG_H) // generic SGI STL # define BOOST_HASH_CONFORMANT_FLOATS 0 #elif defined(__MSL_CPP__) // MSL standard lib: # define BOOST_HASH_CONFORMANT_FLOATS 0 #elif defined(__IBMCPP__) // VACPP std lib (probably conformant for much earlier version). # if __IBMCPP__ >= 1210 # define BOOST_HASH_CONFORMANT_FLOATS 1 # else # define BOOST_HASH_CONFORMANT_FLOATS 0 # endif #elif defined(MSIPL_COMPILE_H) // Modena C++ standard library # define BOOST_HASH_CONFORMANT_FLOATS 0 #elif (defined(_YVALS) && !defined(__IBMCPP__)) || defined(_CPPLIB_VER) // Dinkumware Library (this has to appear after any possible replacement libraries): # if _CPPLIB_VER >= 405 # define BOOST_HASH_CONFORMANT_FLOATS 1 # else # define BOOST_HASH_CONFORMANT_FLOATS 0 # endif #else # define BOOST_HASH_CONFORMANT_FLOATS 0 #endif #if BOOST_HASH_CONFORMANT_FLOATS // The standard library is known to be compliant, so don't use the // configuration mechanism. namespace boost { namespace hash_detail { template struct call_ldexp { typedef Float float_type; inline Float operator()(Float x, int y) const { return std::ldexp(x, y); } }; template struct call_frexp { typedef Float float_type; inline Float operator()(Float x, int* y) const { return std::frexp(x, y); } }; template struct select_hash_type { typedef Float type; }; } } #else // BOOST_HASH_CONFORMANT_FLOATS == 0 // The C++ standard requires that the C float functions are overloarded // for float, double and long double in the std namespace, but some of the older // library implementations don't support this. On some that don't, the C99 // float functions (frexpf, frexpl, etc.) are available. // // The following tries to automatically detect which are available. namespace boost { namespace hash_detail { // Returned by dummy versions of the float functions. struct not_found { // Implicitly convertible to float and long double in order to avoid // a compile error when the dummy float functions are used. inline operator float() const { return 0; } inline operator long double() const { return 0; } }; // A type for detecting the return type of functions. template struct is; template <> struct is { char x[10]; }; template <> struct is { char x[20]; }; template <> struct is { char x[30]; }; template <> struct is { char x[40]; }; // Used to convert the return type of a function to a type for sizeof. template is float_type(T); // call_ldexp // // This will get specialized for float and long double template struct call_ldexp { typedef double float_type; inline double operator()(double a, int b) const { using namespace std; return ldexp(a, b); } }; // call_frexp // // This will get specialized for float and long double template struct call_frexp { typedef double float_type; inline double operator()(double a, int* b) const { using namespace std; return frexp(a, b); } }; } } // A namespace for dummy functions to detect when the actual function we want // isn't available. ldexpl, ldexpf etc. might be added tby the macros below. // // AFAICT these have to be outside of the boost namespace, as if they're in // the boost namespace they'll always be preferable to any other function // (since the arguments are built in types, ADL can't be used). namespace boost_hash_detect_float_functions { template boost::hash_detail::not_found ldexp(Float, int); template boost::hash_detail::not_found frexp(Float, int*); } // Macros for generating specializations of call_ldexp and call_frexp. // // check_cpp and check_c99 check if the C++ or C99 functions are available. // // Then the call_* functions select an appropriate implementation. // // I used c99_func in a few places just to get a unique name. // // Important: when using 'using namespace' at namespace level, include as // little as possible in that namespace, as Visual C++ has an odd bug which // can cause the namespace to be imported at the global level. This seems to // happen mainly when there's a template in the same namesapce. #define BOOST_HASH_CALL_FLOAT_FUNC(cpp_func, c99_func, type1, type2) \ namespace boost_hash_detect_float_functions { \ template \ boost::hash_detail::not_found c99_func(Float, type2); \ } \ \ namespace boost { \ namespace hash_detail { \ namespace c99_func##_detect { \ using namespace std; \ using namespace boost_hash_detect_float_functions; \ \ struct check { \ static type1 x; \ static type2 y; \ BOOST_STATIC_CONSTANT(bool, cpp = \ sizeof(float_type(cpp_func(x,y))) \ == sizeof(is)); \ BOOST_STATIC_CONSTANT(bool, c99 = \ sizeof(float_type(c99_func(x,y))) \ == sizeof(is)); \ }; \ } \ \ template \ struct call_c99_##c99_func : \ boost::hash_detail::call_##cpp_func {}; \ \ template <> \ struct call_c99_##c99_func { \ typedef type1 float_type; \ \ template \ inline type1 operator()(type1 a, T b) const \ { \ using namespace std; \ return c99_func(a, b); \ } \ }; \ \ template \ struct call_cpp_##c99_func : \ call_c99_##c99_func< \ ::boost::hash_detail::c99_func##_detect::check::c99 \ > {}; \ \ template <> \ struct call_cpp_##c99_func { \ typedef type1 float_type; \ \ template \ inline type1 operator()(type1 a, T b) const \ { \ using namespace std; \ return cpp_func(a, b); \ } \ }; \ \ template <> \ struct call_##cpp_func : \ call_cpp_##c99_func< \ ::boost::hash_detail::c99_func##_detect::check::cpp \ > {}; \ } \ } #define BOOST_HASH_CALL_FLOAT_MACRO(cpp_func, c99_func, type1, type2) \ namespace boost { \ namespace hash_detail { \ \ template <> \ struct call_##cpp_func { \ typedef type1 float_type; \ inline type1 operator()(type1 x, type2 y) const { \ return c99_func(x, y); \ } \ }; \ } \ } #if defined(ldexpf) BOOST_HASH_CALL_FLOAT_MACRO(ldexp, ldexpf, float, int) #else BOOST_HASH_CALL_FLOAT_FUNC(ldexp, ldexpf, float, int) #endif #if defined(ldexpl) BOOST_HASH_CALL_FLOAT_MACRO(ldexp, ldexpl, long double, int) #else BOOST_HASH_CALL_FLOAT_FUNC(ldexp, ldexpl, long double, int) #endif #if defined(frexpf) BOOST_HASH_CALL_FLOAT_MACRO(frexp, frexpf, float, int*) #else BOOST_HASH_CALL_FLOAT_FUNC(frexp, frexpf, float, int*) #endif #if defined(frexpl) BOOST_HASH_CALL_FLOAT_MACRO(frexp, frexpl, long double, int*) #else BOOST_HASH_CALL_FLOAT_FUNC(frexp, frexpl, long double, int*) #endif #undef BOOST_HASH_CALL_FLOAT_MACRO #undef BOOST_HASH_CALL_FLOAT_FUNC namespace boost { namespace hash_detail { template struct select_hash_type_impl { typedef double type; }; template <> struct select_hash_type_impl { typedef float type; }; template <> struct select_hash_type_impl { typedef long double type; }; // select_hash_type // // If there is support for a particular floating point type, use that // otherwise use double (there's always support for double). template struct select_hash_type : select_hash_type_impl< BOOST_DEDUCED_TYPENAME call_ldexp::float_type, BOOST_DEDUCED_TYPENAME call_frexp::float_type > {}; } } #endif // BOOST_HASH_CONFORMANT_FLOATS #endif madp-0.4/src/boost/boost/functional/hash/PaxHeaders.5405/extensions.hpp0000644000000000000000000000007412717644140023023 xustar0030 atime=1463765180.101720159 30 ctime=1463765201.049552852 madp-0.4/src/boost/boost/functional/hash/extensions.hpp0000664000372100037210000002514312717644140023657 0ustar00fransfrans00000000000000 // Copyright 2005-2009 Daniel James. // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // Based on Peter Dimov's proposal // http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1756.pdf // issue 6.18. // This implements the extensions to the standard. // It's undocumented, so you shouldn't use it.... #if !defined(BOOST_FUNCTIONAL_HASH_EXTENSIONS_HPP) #define BOOST_FUNCTIONAL_HASH_EXTENSIONS_HPP #include #include #include #include #include #include #if !defined(BOOST_NO_CXX11_HDR_ARRAY) # include #endif #if !defined(BOOST_NO_CXX11_HDR_TUPLE) # include #endif #if !defined(BOOST_NO_CXX11_HDR_MEMORY) # include #endif #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once #endif #if defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) #include #endif #if BOOST_WORKAROUND(BOOST_MSVC, < 1300) #include #endif namespace boost { template std::size_t hash_value(std::pair const&); template std::size_t hash_value(std::vector const&); template std::size_t hash_value(std::list const& v); template std::size_t hash_value(std::deque const& v); template std::size_t hash_value(std::set const& v); template std::size_t hash_value(std::multiset const& v); template std::size_t hash_value(std::map const& v); template std::size_t hash_value(std::multimap const& v); template std::size_t hash_value(std::complex const&); template std::size_t hash_value(std::pair const& v) { std::size_t seed = 0; boost::hash_combine(seed, v.first); boost::hash_combine(seed, v.second); return seed; } template std::size_t hash_value(std::vector const& v) { return boost::hash_range(v.begin(), v.end()); } template std::size_t hash_value(std::list const& v) { return boost::hash_range(v.begin(), v.end()); } template std::size_t hash_value(std::deque const& v) { return boost::hash_range(v.begin(), v.end()); } template std::size_t hash_value(std::set const& v) { return boost::hash_range(v.begin(), v.end()); } template std::size_t hash_value(std::multiset const& v) { return boost::hash_range(v.begin(), v.end()); } template std::size_t hash_value(std::map const& v) { return boost::hash_range(v.begin(), v.end()); } template std::size_t hash_value(std::multimap const& v) { return boost::hash_range(v.begin(), v.end()); } template std::size_t hash_value(std::complex const& v) { boost::hash hasher; std::size_t seed = hasher(v.imag()); seed ^= hasher(v.real()) + (seed<<6) + (seed>>2); return seed; } #if !defined(BOOST_NO_CXX11_HDR_ARRAY) template std::size_t hash_value(std::array const& v) { return boost::hash_range(v.begin(), v.end()); } #endif #if !defined(BOOST_NO_CXX11_HDR_TUPLE) namespace hash_detail { template inline typename boost::enable_if_c<(I == std::tuple_size::value), void>::type hash_combine_tuple(std::size_t&, T const&) { } template inline typename boost::enable_if_c<(I < std::tuple_size::value), void>::type hash_combine_tuple(std::size_t& seed, T const& v) { boost::hash_combine(seed, std::get(v)); boost::hash_detail::hash_combine_tuple(seed, v); } template inline std::size_t hash_tuple(T const& v) { std::size_t seed = 0; boost::hash_detail::hash_combine_tuple<0>(seed, v); return seed; } } #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) template inline std::size_t hash_value(std::tuple const& v) { return boost::hash_detail::hash_tuple(v); } #else inline std::size_t hash_value(std::tuple<> const& v) { return boost::hash_detail::hash_tuple(v); } # define BOOST_HASH_TUPLE_F(z, n, _) \ template< \ BOOST_PP_ENUM_PARAMS_Z(z, n, typename A) \ > \ inline std::size_t hash_value(std::tuple< \ BOOST_PP_ENUM_PARAMS_Z(z, n, A) \ > const& v) \ { \ return boost::hash_detail::hash_tuple(v); \ } BOOST_PP_REPEAT_FROM_TO(1, 11, BOOST_HASH_TUPLE_F, _) # undef BOOST_HASH_TUPLE_F #endif #endif #if !defined(BOOST_NO_CXX11_SMART_PTR) template inline std::size_t hash_value(std::shared_ptr const& x) { return boost::hash_value(x.get()); } template inline std::size_t hash_value(std::unique_ptr const& x) { return boost::hash_value(x.get()); } #endif // // call_hash_impl // // On compilers without function template ordering, this deals with arrays. #if defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) namespace hash_detail { template struct call_hash_impl { template struct inner { static std::size_t call(T const& v) { using namespace boost; return hash_value(v); } }; }; template <> struct call_hash_impl { template struct inner { #if !BOOST_WORKAROUND(BOOST_MSVC, < 1300) static std::size_t call(Array const& v) #else static std::size_t call(Array& v) #endif { const int size = sizeof(v) / sizeof(*v); return boost::hash_range(v, v + size); } }; }; template struct call_hash : public call_hash_impl::value> ::BOOST_NESTED_TEMPLATE inner { }; } #endif // BOOST_NO_FUNCTION_TEMPLATE_ORDERING // // boost::hash // #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template struct hash : std::unary_function { #if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) std::size_t operator()(T const& val) const { return hash_value(val); } #else std::size_t operator()(T const& val) const { return hash_detail::call_hash::call(val); } #endif }; #if BOOST_WORKAROUND(__DMC__, <= 0x848) template struct hash : std::unary_function { std::size_t operator()(const T* val) const { return boost::hash_range(val, val+n); } }; #endif #else // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION // On compilers without partial specialization, boost::hash // has already been declared to deal with pointers, so just // need to supply the non-pointer version of hash_impl. namespace hash_detail { template struct hash_impl; #if !BOOST_WORKAROUND(BOOST_MSVC, < 1300) template <> struct hash_impl { template struct inner : std::unary_function { #if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) std::size_t operator()(T const& val) const { return hash_value(val); } #else std::size_t operator()(T const& val) const { return hash_detail::call_hash::call(val); } #endif }; }; #else // Visual C++ 6.5 // Visual C++ 6.5 has problems with nested member functions and // applying const to const types in templates. So we get this: template struct hash_impl_msvc { template struct inner : public std::unary_function { std::size_t operator()(T const& val) const { return hash_detail::call_hash::call(val); } std::size_t operator()(T& val) const { return hash_detail::call_hash::call(val); } }; }; template <> struct hash_impl_msvc { template struct inner : public std::unary_function { std::size_t operator()(T& val) const { return hash_detail::call_hash::call(val); } }; }; template struct hash_impl_msvc2 : public hash_impl_msvc::value> ::BOOST_NESTED_TEMPLATE inner {}; template <> struct hash_impl { template struct inner : public hash_impl_msvc2 {}; }; #endif // Visual C++ 6.5 } #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION } #endif madp-0.4/src/boost/boost/functional/hash/PaxHeaders.5405/hash.hpp0000644000000000000000000000007412717644140021547 xustar0030 atime=1463765180.101720159 30 ctime=1463765201.049552852 madp-0.4/src/boost/boost/functional/hash/hash.hpp0000664000372100037210000003743612717644140022413 0ustar00fransfrans00000000000000 // Copyright 2005-2009 Daniel James. // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // Based on Peter Dimov's proposal // http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1756.pdf // issue 6.18. #if !defined(BOOST_FUNCTIONAL_HASH_HASH_HPP) #define BOOST_FUNCTIONAL_HASH_HASH_HPP #include #include #include #include #include #include #include #include #if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) #include #endif #if !defined(BOOST_NO_CXX11_HDR_TYPEINDEX) #include #endif #if defined(BOOST_MSVC) #pragma warning(push) #pragma warning(disable:6295) // Ill-defined for-loop : 'unsigned int' values // are always of range '0' to '4294967295'. // Loop executes infinitely. #endif #if BOOST_WORKAROUND(__GNUC__, < 3) \ && !defined(__SGI_STL_PORT) && !defined(_STLPORT_VERSION) #define BOOST_HASH_CHAR_TRAITS string_char_traits #else #define BOOST_HASH_CHAR_TRAITS char_traits #endif namespace boost { namespace hash_detail { struct enable_hash_value { typedef std::size_t type; }; template struct basic_numbers {}; template struct long_numbers; template struct ulong_numbers; template struct float_numbers {}; template <> struct basic_numbers : boost::hash_detail::enable_hash_value {}; template <> struct basic_numbers : boost::hash_detail::enable_hash_value {}; template <> struct basic_numbers : boost::hash_detail::enable_hash_value {}; template <> struct basic_numbers : boost::hash_detail::enable_hash_value {}; template <> struct basic_numbers : boost::hash_detail::enable_hash_value {}; template <> struct basic_numbers : boost::hash_detail::enable_hash_value {}; template <> struct basic_numbers : boost::hash_detail::enable_hash_value {}; template <> struct basic_numbers : boost::hash_detail::enable_hash_value {}; template <> struct basic_numbers : boost::hash_detail::enable_hash_value {}; template <> struct basic_numbers : boost::hash_detail::enable_hash_value {}; #if !defined(BOOST_NO_INTRINSIC_WCHAR_T) template <> struct basic_numbers : boost::hash_detail::enable_hash_value {}; #endif // long_numbers is defined like this to allow for separate // specialization for long_long and int128_type, in case // they conflict. template struct long_numbers2 {}; template struct ulong_numbers2 {}; template struct long_numbers : long_numbers2 {}; template struct ulong_numbers : ulong_numbers2 {}; #if !defined(BOOST_NO_LONG_LONG) template <> struct long_numbers : boost::hash_detail::enable_hash_value {}; template <> struct ulong_numbers : boost::hash_detail::enable_hash_value {}; #endif #if defined(BOOST_HAS_INT128) template <> struct long_numbers2 : boost::hash_detail::enable_hash_value {}; template <> struct ulong_numbers2 : boost::hash_detail::enable_hash_value {}; #endif template <> struct float_numbers : boost::hash_detail::enable_hash_value {}; template <> struct float_numbers : boost::hash_detail::enable_hash_value {}; template <> struct float_numbers : boost::hash_detail::enable_hash_value {}; } template typename boost::hash_detail::basic_numbers::type hash_value(T); template typename boost::hash_detail::long_numbers::type hash_value(T); template typename boost::hash_detail::ulong_numbers::type hash_value(T); template typename boost::enable_if, std::size_t>::type hash_value(T); #if !BOOST_WORKAROUND(__DMC__, <= 0x848) template std::size_t hash_value(T* const&); #else template std::size_t hash_value(T*); #endif #if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) template< class T, unsigned N > std::size_t hash_value(const T (&x)[N]); template< class T, unsigned N > std::size_t hash_value(T (&x)[N]); #endif template std::size_t hash_value( std::basic_string, A> const&); template typename boost::hash_detail::float_numbers::type hash_value(T); #if !defined(BOOST_NO_CXX11_HDR_TYPEINDEX) std::size_t hash_value(std::type_index); #endif // Implementation namespace hash_detail { template inline std::size_t hash_value_signed(T val) { const int size_t_bits = std::numeric_limits::digits; // ceiling(std::numeric_limits::digits / size_t_bits) - 1 const int length = (std::numeric_limits::digits - 1) / size_t_bits; std::size_t seed = 0; T positive = val < 0 ? -1 - val : val; // Hopefully, this loop can be unrolled. for(unsigned int i = length * size_t_bits; i > 0; i -= size_t_bits) { seed ^= (std::size_t) (positive >> i) + (seed<<6) + (seed>>2); } seed ^= (std::size_t) val + (seed<<6) + (seed>>2); return seed; } template inline std::size_t hash_value_unsigned(T val) { const int size_t_bits = std::numeric_limits::digits; // ceiling(std::numeric_limits::digits / size_t_bits) - 1 const int length = (std::numeric_limits::digits - 1) / size_t_bits; std::size_t seed = 0; // Hopefully, this loop can be unrolled. for(unsigned int i = length * size_t_bits; i > 0; i -= size_t_bits) { seed ^= (std::size_t) (val >> i) + (seed<<6) + (seed>>2); } seed ^= (std::size_t) val + (seed<<6) + (seed>>2); return seed; } } template typename boost::hash_detail::basic_numbers::type hash_value(T v) { return static_cast(v); } template typename boost::hash_detail::long_numbers::type hash_value(T v) { return hash_detail::hash_value_signed(v); } template typename boost::hash_detail::ulong_numbers::type hash_value(T v) { return hash_detail::hash_value_unsigned(v); } template typename boost::enable_if, std::size_t>::type hash_value(T v) { return static_cast(v); } // Implementation by Alberto Barbati and Dave Harris. #if !BOOST_WORKAROUND(__DMC__, <= 0x848) template std::size_t hash_value(T* const& v) #else template std::size_t hash_value(T* v) #endif { #if defined(__VMS) && __INITIAL_POINTER_SIZE == 64 // for some reason ptrdiff_t on OpenVMS compiler with // 64 bit is not 64 bit !!! std::size_t x = static_cast( reinterpret_cast(v)); #else std::size_t x = static_cast( reinterpret_cast(v)); #endif return x + (x >> 3); } #if defined(BOOST_MSVC) #pragma warning(push) #if BOOST_MSVC <= 1400 #pragma warning(disable:4267) // 'argument' : conversion from 'size_t' to // 'unsigned int', possible loss of data // A misguided attempt to detect 64-bit // incompatability. #endif #endif #if BOOST_WORKAROUND(BOOST_MSVC, < 1300) template inline void hash_combine(std::size_t& seed, T& v) #else template inline void hash_combine(std::size_t& seed, T const& v) #endif { boost::hash hasher; seed ^= hasher(v) + 0x9e3779b9 + (seed<<6) + (seed>>2); } #if defined(BOOST_MSVC) #pragma warning(pop) #endif template inline std::size_t hash_range(It first, It last) { std::size_t seed = 0; for(; first != last; ++first) { hash_combine(seed, *first); } return seed; } template inline void hash_range(std::size_t& seed, It first, It last) { for(; first != last; ++first) { hash_combine(seed, *first); } } #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x551)) template inline std::size_t hash_range(T* first, T* last) { std::size_t seed = 0; for(; first != last; ++first) { boost::hash hasher; seed ^= hasher(*first) + 0x9e3779b9 + (seed<<6) + (seed>>2); } return seed; } template inline void hash_range(std::size_t& seed, T* first, T* last) { for(; first != last; ++first) { boost::hash hasher; seed ^= hasher(*first) + 0x9e3779b9 + (seed<<6) + (seed>>2); } } #endif #if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) template< class T, unsigned N > inline std::size_t hash_value(const T (&x)[N]) { return hash_range(x, x + N); } template< class T, unsigned N > inline std::size_t hash_value(T (&x)[N]) { return hash_range(x, x + N); } #endif template inline std::size_t hash_value( std::basic_string, A> const& v) { return hash_range(v.begin(), v.end()); } template typename boost::hash_detail::float_numbers::type hash_value(T v) { return boost::hash_detail::float_hash_value(v); } #if !defined(BOOST_NO_CXX11_HDR_TYPEINDEX) inline std::size_t hash_value(std::type_index v) { return v.hash_code(); } #endif // // boost::hash // // Define the specializations required by the standard. The general purpose // boost::hash is defined later in extensions.hpp if // BOOST_HASH_NO_EXTENSIONS is not defined. // BOOST_HASH_SPECIALIZE - define a specialization for a type which is // passed by copy. // // BOOST_HASH_SPECIALIZE_REF - define a specialization for a type which is // passed by copy. // // These are undefined later. #if !BOOST_WORKAROUND(BOOST_MSVC, < 1300) #define BOOST_HASH_SPECIALIZE(type) \ template <> struct hash \ : public std::unary_function \ { \ std::size_t operator()(type v) const \ { \ return boost::hash_value(v); \ } \ }; #define BOOST_HASH_SPECIALIZE_REF(type) \ template <> struct hash \ : public std::unary_function \ { \ std::size_t operator()(type const& v) const \ { \ return boost::hash_value(v); \ } \ }; #else #define BOOST_HASH_SPECIALIZE(type) \ template <> struct hash \ : public std::unary_function \ { \ std::size_t operator()(type v) const \ { \ return boost::hash_value(v); \ } \ }; \ \ template <> struct hash \ : public std::unary_function \ { \ std::size_t operator()(const type v) const \ { \ return boost::hash_value(v); \ } \ }; #define BOOST_HASH_SPECIALIZE_REF(type) \ template <> struct hash \ : public std::unary_function \ { \ std::size_t operator()(type const& v) const \ { \ return boost::hash_value(v); \ } \ }; \ \ template <> struct hash \ : public std::unary_function \ { \ std::size_t operator()(type const& v) const \ { \ return boost::hash_value(v); \ } \ }; #endif BOOST_HASH_SPECIALIZE(bool) BOOST_HASH_SPECIALIZE(char) BOOST_HASH_SPECIALIZE(signed char) BOOST_HASH_SPECIALIZE(unsigned char) #if !defined(BOOST_NO_INTRINSIC_WCHAR_T) BOOST_HASH_SPECIALIZE(wchar_t) #endif BOOST_HASH_SPECIALIZE(short) BOOST_HASH_SPECIALIZE(unsigned short) BOOST_HASH_SPECIALIZE(int) BOOST_HASH_SPECIALIZE(unsigned int) BOOST_HASH_SPECIALIZE(long) BOOST_HASH_SPECIALIZE(unsigned long) BOOST_HASH_SPECIALIZE(float) BOOST_HASH_SPECIALIZE(double) BOOST_HASH_SPECIALIZE(long double) BOOST_HASH_SPECIALIZE_REF(std::string) #if !defined(BOOST_NO_STD_WSTRING) BOOST_HASH_SPECIALIZE_REF(std::wstring) #endif #if !defined(BOOST_NO_LONG_LONG) BOOST_HASH_SPECIALIZE(boost::long_long_type) BOOST_HASH_SPECIALIZE(boost::ulong_long_type) #endif #if defined(BOOST_HAS_INT128) BOOST_HASH_SPECIALIZE(boost::int128_type) BOOST_HASH_SPECIALIZE(boost::uint128_type) #endif #if !defined(BOOST_NO_CXX11_HDR_TYPEINDEX) BOOST_HASH_SPECIALIZE(std::type_index) #endif #undef BOOST_HASH_SPECIALIZE #undef BOOST_HASH_SPECIALIZE_REF // Specializing boost::hash for pointers. #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template struct hash : public std::unary_function { std::size_t operator()(T* v) const { #if !BOOST_WORKAROUND(__SUNPRO_CC, <= 0x590) return boost::hash_value(v); #else std::size_t x = static_cast( reinterpret_cast(v)); return x + (x >> 3); #endif } }; #else // For compilers without partial specialization, we define a // boost::hash for all remaining types. But hash_impl is only defined // for pointers in 'extensions.hpp' - so when BOOST_HASH_NO_EXTENSIONS // is defined there will still be a compile error for types not supported // in the standard. namespace hash_detail { template struct hash_impl; template <> struct hash_impl { template struct inner : public std::unary_function { std::size_t operator()(T val) const { #if !BOOST_WORKAROUND(__SUNPRO_CC, <= 590) return boost::hash_value(val); #else std::size_t x = static_cast( reinterpret_cast(val)); return x + (x >> 3); #endif } }; }; } template struct hash : public boost::hash_detail::hash_impl::value> ::BOOST_NESTED_TEMPLATE inner { }; #endif } #undef BOOST_HASH_CHAR_TRAITS #if defined(BOOST_MSVC) #pragma warning(pop) #endif #endif // BOOST_FUNCTIONAL_HASH_HASH_HPP // Include this outside of the include guards in case the file is included // twice - once with BOOST_HASH_NO_EXTENSIONS defined, and then with it // undefined. #if !defined(BOOST_HASH_NO_EXTENSIONS) \ && !defined(BOOST_FUNCTIONAL_HASH_EXTENSIONS_HPP) #include #endif madp-0.4/src/boost/boost/functional/PaxHeaders.5405/hash.hpp0000644000000000000000000000007412717644140020624 xustar0030 atime=1463765180.101720159 30 ctime=1463765201.049552852 madp-0.4/src/boost/boost/functional/hash.hpp0000664000372100037210000000035312717644140021454 0ustar00fransfrans00000000000000 // Copyright 2005-2009 Daniel James. // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) #include madp-0.4/src/boost/boost/PaxHeaders.5405/mpl0000644000000000000000000000007412717644140015541 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.093552501 madp-0.4/src/boost/boost/mpl/0000775000372100037210000000000012717644140016445 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/comparison.hpp0000644000000000000000000000007412717644140020501 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/comparison.hpp0000664000372100037210000000135012717644140021327 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_COMPARISON_HPP_INCLUDED #define BOOST_MPL_COMPARISON_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: comparison.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #endif // BOOST_MPL_COMPARISON_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/iterator_category.hpp0000644000000000000000000000007412717644140022055 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/iterator_category.hpp0000664000372100037210000000165012717644140022706 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_ITERATOR_CATEGORY_HPP_INCLUDED #define BOOST_MPL_ITERATOR_CATEGORY_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: iterator_category.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include namespace boost { namespace mpl { template< typename BOOST_MPL_AUX_NA_PARAM(Iterator) > struct iterator_category { typedef typename Iterator::category type; BOOST_MPL_AUX_LAMBDA_SUPPORT(1,iterator_category,(Iterator)) }; BOOST_MPL_AUX_NA_SPEC(1, iterator_category) }} #endif // BOOST_MPL_ITERATOR_CATEGORY_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/value_type_fwd.hpp0000644000000000000000000000007412717644140021344 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/value_type_fwd.hpp0000664000372100037210000000135412717644140022176 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_VALUE_TYPE_FWD_HPP_INCLUDED #define BOOST_MPL_VALUE_TYPE_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // Copyright David Abrahams 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: value_type_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ namespace boost { namespace mpl { template< typename Tag > struct value_type_impl; template< typename AssociativeSequence, typename T > struct value_type; }} #endif // BOOST_MPL_VALUE_TYPE_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/size_t_fwd.hpp0000644000000000000000000000007412717644140020464 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/size_t_fwd.hpp0000664000372100037210000000150012717644140021307 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_SIZE_T_FWD_HPP_INCLUDED #define BOOST_MPL_SIZE_T_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: size_t_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include // make sure 'size_t' is placed into 'std' #include BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN template< std::size_t N > struct size_t; BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE BOOST_MPL_AUX_ADL_BARRIER_DECL(size_t) #endif // BOOST_MPL_SIZE_T_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/vector0000644000000000000000000000007412717644140017043 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.093552501 madp-0.4/src/boost/boost/mpl/vector/0000775000372100037210000000000012717644140017747 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/mpl/vector/PaxHeaders.5405/vector10.hpp0000644000000000000000000000007412717644140021274 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.093552501 madp-0.4/src/boost/boost/mpl/vector/vector10.hpp0000664000372100037210000000237012717644140022125 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_VECTOR_VECTOR10_HPP_INCLUDED #define BOOST_MPL_VECTOR_VECTOR10_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: vector10.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include #endif #include #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # define BOOST_MPL_PREPROCESSED_HEADER vector10.hpp # include #else # include # include # include namespace boost { namespace mpl { # define BOOST_PP_ITERATION_PARAMS_1 \ (3,(0, 10, )) # include BOOST_PP_ITERATE() }} #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #endif // BOOST_MPL_VECTOR_VECTOR10_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/vector/PaxHeaders.5405/vector0.hpp0000644000000000000000000000007412717644140021213 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.093552501 madp-0.4/src/boost/boost/mpl/vector/vector0.hpp0000664000372100037210000000234212717644140022043 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_VECTOR_VECTOR0_HPP_INCLUDED #define BOOST_MPL_VECTOR_VECTOR0_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: vector0.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #endif // BOOST_MPL_VECTOR_VECTOR0_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/vector/PaxHeaders.5405/aux_0000644000000000000000000000007412717644140017777 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.093552501 madp-0.4/src/boost/boost/mpl/vector/aux_/0000775000372100037210000000000012717644140020703 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/mpl/vector/aux_/PaxHeaders.5405/clear.hpp0000644000000000000000000000007412717644140021653 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/vector/aux_/clear.hpp0000664000372100037210000000243212717644140022503 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_VECTOR_AUX_CLEAR_HPP_INCLUDED #define BOOST_MPL_VECTOR_AUX_CLEAR_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: clear.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include namespace boost { namespace mpl { #if defined(BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES) template<> struct clear_impl< aux::vector_tag > { template< typename Vector > struct apply { typedef vector0<> type; }; }; #else #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template< long N > struct clear_impl< aux::vector_tag > { template< typename Vector > struct apply { typedef vector0<> type; }; }; #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION #endif // BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES }} #endif // BOOST_MPL_VECTOR_AUX_CLEAR_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/vector/aux_/PaxHeaders.5405/pop_back.hpp0000644000000000000000000000007412717644140022343 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/vector/aux_/pop_back.hpp0000664000372100037210000000177712717644140023206 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_VECTOR_AUX_POP_BACK_HPP_INCLUDED #define BOOST_MPL_VECTOR_AUX_POP_BACK_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: pop_back.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #if defined(BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES) # include # include namespace boost { namespace mpl { template<> struct pop_back_impl< aux::vector_tag > { template< typename Vector > struct apply { typedef v_mask type; }; }; }} #endif // BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES #endif // BOOST_MPL_VECTOR_AUX_POP_BACK_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/vector/aux_/PaxHeaders.5405/front.hpp0000644000000000000000000000007412717644140021715 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/vector/aux_/front.hpp0000664000372100037210000000253712717644140022553 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_VECTOR_AUX_FRONT_HPP_INCLUDED #define BOOST_MPL_VECTOR_AUX_FRONT_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2008 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: front.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include namespace boost { namespace mpl { #if defined(BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES) template<> struct front_impl< aux::vector_tag > { template< typename Vector > struct apply : v_at { }; }; #else #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template< BOOST_MPL_AUX_NTTP_DECL(long, n_) > struct front_impl< aux::vector_tag > { template< typename Vector > struct apply { typedef typename Vector::item0 type; }; }; #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION #endif // BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES }} #endif // BOOST_MPL_VECTOR_AUX_FRONT_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/vector/aux_/PaxHeaders.5405/back.hpp0000644000000000000000000000007412717644140021465 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/vector/aux_/back.hpp0000664000372100037210000000261312717644140022316 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_VECTOR_AUX_BACK_HPP_INCLUDED #define BOOST_MPL_VECTOR_AUX_BACK_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: back.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include namespace boost { namespace mpl { #if defined(BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES) template<> struct back_impl< aux::vector_tag > { template< typename Vector > struct apply : v_at< Vector , prior::type::value > { }; }; #else #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template< long n_ > struct back_impl< aux::vector_tag > { template< typename Vector > struct apply { typedef typename Vector::back type; }; }; #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION #endif // BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES }} #endif // BOOST_MPL_VECTOR_AUX_BACK_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/vector/aux_/PaxHeaders.5405/tag.hpp0000644000000000000000000000007412717644140021340 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.093552501 madp-0.4/src/boost/boost/mpl/vector/aux_/tag.hpp0000664000372100037210000000151612717644140022172 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_VECTOR_AUX_TAG_HPP_INCLUDED #define BOOST_MPL_VECTOR_AUX_TAG_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: tag.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include namespace boost { namespace mpl { namespace aux { struct v_iter_tag; #if defined(BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES) struct vector_tag; #else template< BOOST_MPL_AUX_NTTP_DECL(long, N) > struct vector_tag; #endif }}} #endif // BOOST_MPL_VECTOR_AUX_TAG_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/vector/aux_/PaxHeaders.5405/preprocessed0000644000000000000000000000007412717644140022475 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/vector/aux_/preprocessed/0000775000372100037210000000000012717644140023401 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/mpl/vector/aux_/preprocessed/PaxHeaders.5405/typeof_based0000644000000000000000000000007412717644140025141 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/vector/aux_/preprocessed/typeof_based/0000775000372100037210000000000012717644140026045 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/mpl/vector/aux_/preprocessed/typeof_based/PaxHeaders.5405/vector10.hpp0000644000000000000000000000007412717644140027372 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/vector/aux_/preprocessed/typeof_based/vector10.hpp0000664000372100037210000000465412717644140030232 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/vector/vector10.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { template< typename T0 > struct vector1 : v_item< T0 , vector0< > > { typedef vector1 type; }; template< typename T0, typename T1 > struct vector2 : v_item< T1 , vector1 > { typedef vector2 type; }; template< typename T0, typename T1, typename T2 > struct vector3 : v_item< T2 , vector2< T0,T1 > > { typedef vector3 type; }; template< typename T0, typename T1, typename T2, typename T3 > struct vector4 : v_item< T3 , vector3< T0,T1,T2 > > { typedef vector4 type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 > struct vector5 : v_item< T4 , vector4< T0,T1,T2,T3 > > { typedef vector5 type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5 > struct vector6 : v_item< T5 , vector5< T0,T1,T2,T3,T4 > > { typedef vector6 type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6 > struct vector7 : v_item< T6 , vector6< T0,T1,T2,T3,T4,T5 > > { typedef vector7 type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7 > struct vector8 : v_item< T7 , vector7< T0,T1,T2,T3,T4,T5,T6 > > { typedef vector8 type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7, typename T8 > struct vector9 : v_item< T8 , vector8< T0,T1,T2,T3,T4,T5,T6,T7 > > { typedef vector9 type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7, typename T8, typename T9 > struct vector10 : v_item< T9 , vector9< T0,T1,T2,T3,T4,T5,T6,T7,T8 > > { typedef vector10 type; }; }} madp-0.4/src/boost/boost/mpl/vector/aux_/preprocessed/typeof_based/PaxHeaders.5405/vector20.hpp0000644000000000000000000000007412717644140027373 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/vector/aux_/preprocessed/typeof_based/vector20.hpp0000664000372100037210000001033312717644140030222 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/vector/vector20.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7, typename T8, typename T9 , typename T10 > struct vector11 : v_item< T10 , vector10< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9 > > { typedef vector11 type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7, typename T8, typename T9 , typename T10, typename T11 > struct vector12 : v_item< T11 , vector11< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10 > > { typedef vector12 type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7, typename T8, typename T9 , typename T10, typename T11, typename T12 > struct vector13 : v_item< T12 , vector12< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11 > > { typedef vector13 type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7, typename T8, typename T9 , typename T10, typename T11, typename T12, typename T13 > struct vector14 : v_item< T13 , vector13< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12 > > { typedef vector14 type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7, typename T8, typename T9 , typename T10, typename T11, typename T12, typename T13, typename T14 > struct vector15 : v_item< T14 , vector14< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13 > > { typedef vector15 type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7, typename T8, typename T9 , typename T10, typename T11, typename T12, typename T13, typename T14 , typename T15 > struct vector16 : v_item< T15 , vector15< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14 > > { typedef vector16 type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7, typename T8, typename T9 , typename T10, typename T11, typename T12, typename T13, typename T14 , typename T15, typename T16 > struct vector17 : v_item< T16 , vector16< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14,T15 > > { typedef vector17 type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7, typename T8, typename T9 , typename T10, typename T11, typename T12, typename T13, typename T14 , typename T15, typename T16, typename T17 > struct vector18 : v_item< T17 , vector17< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14,T15,T16 > > { typedef vector18 type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7, typename T8, typename T9 , typename T10, typename T11, typename T12, typename T13, typename T14 , typename T15, typename T16, typename T17, typename T18 > struct vector19 : v_item< T18 , vector18< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14,T15,T16,T17 > > { typedef vector19 type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7, typename T8, typename T9 , typename T10, typename T11, typename T12, typename T13, typename T14 , typename T15, typename T16, typename T17, typename T18, typename T19 > struct vector20 : v_item< T19 , vector19< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14,T15,T16,T17,T18 > > { typedef vector20 type; }; }} madp-0.4/src/boost/boost/mpl/vector/aux_/PaxHeaders.5405/pop_front.hpp0000644000000000000000000000007412717644140022573 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/vector/aux_/pop_front.hpp0000664000372100037210000000200512717644140023417 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_VECTOR_AUX_POP_FRONT_HPP_INCLUDED #define BOOST_MPL_VECTOR_AUX_POP_FRONT_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: pop_front.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #if defined(BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES) # include # include namespace boost { namespace mpl { template<> struct pop_front_impl< aux::vector_tag > { template< typename Vector > struct apply { typedef v_mask type; }; }; }} #endif // BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES #endif // BOOST_MPL_VECTOR_AUX_POP_FRONT_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/vector/aux_/PaxHeaders.5405/O1_size.hpp0000644000000000000000000000007412717644140022076 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/vector/aux_/O1_size.hpp0000664000372100037210000000244712717644140022734 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_VECTOR_AUX_O1_SIZE_HPP_INCLUDED #define BOOST_MPL_VECTOR_AUX_O1_SIZE_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: O1_size.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include namespace boost { namespace mpl { #if defined(BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES) template<> struct O1_size_impl< aux::vector_tag > { template< typename Vector > struct apply : Vector::size { }; }; #else #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template< long N > struct O1_size_impl< aux::vector_tag > { template< typename Vector > struct apply : mpl::long_ { }; }; #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION #endif // BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES }} #endif // BOOST_MPL_VECTOR_AUX_O1_SIZE_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/vector/aux_/PaxHeaders.5405/iterator.hpp0000644000000000000000000000007412717644140022416 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/vector/aux_/iterator.hpp0000664000372100037210000000600612717644140023247 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_VECTOR_ITERATOR_HPP_INCLUDED #define BOOST_MPL_AUX_VECTOR_ITERATOR_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: iterator.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include #include #include #include #include #include namespace boost { namespace mpl { template< typename Vector , BOOST_MPL_AUX_NTTP_DECL(long, n_) > struct v_iter { typedef aux::v_iter_tag tag; typedef random_access_iterator_tag category; typedef typename v_at::type type; typedef Vector vector_; typedef mpl::long_ pos; #if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) enum { next_ = n_ + 1 , prior_ = n_ - 1 , pos_ = n_ }; typedef v_iter next; typedef v_iter prior; #endif }; #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template< typename Vector , BOOST_MPL_AUX_NTTP_DECL(long, n_) > struct next< v_iter > { typedef v_iter type; }; template< typename Vector , BOOST_MPL_AUX_NTTP_DECL(long, n_) > struct prior< v_iter > { typedef v_iter type; }; template< typename Vector , BOOST_MPL_AUX_NTTP_DECL(long, n_) , typename Distance > struct advance< v_iter,Distance> { typedef v_iter< Vector , (n_ + BOOST_MPL_AUX_NESTED_VALUE_WKND(long, Distance)) > type; }; template< typename Vector , BOOST_MPL_AUX_NTTP_DECL(long, n_) , BOOST_MPL_AUX_NTTP_DECL(long, m_) > struct distance< v_iter, v_iter > : mpl::long_<(m_ - n_)> { }; #else // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION template<> struct advance_impl { template< typename Iterator, typename N > struct apply { enum { pos_ = Iterator::pos_, n_ = N::value }; typedef v_iter< typename Iterator::vector_ , (pos_ + n_) > type; }; }; template<> struct distance_impl { template< typename Iter1, typename Iter2 > struct apply { enum { pos1_ = Iter1::pos_, pos2_ = Iter2::pos_ }; typedef long_<( pos2_ - pos1_ )> type; BOOST_STATIC_CONSTANT(long, value = ( pos2_ - pos1_ )); }; }; #endif }} #endif // BOOST_MPL_AUX_VECTOR_ITERATOR_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/vector/aux_/PaxHeaders.5405/push_back.hpp0000644000000000000000000000007412717644140022524 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/vector/aux_/push_back.hpp0000664000372100037210000000175412717644140023362 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_VECTOR_AUX_PUSH_BACK_HPP_INCLUDED #define BOOST_MPL_VECTOR_AUX_PUSH_BACK_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: push_back.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #if defined(BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES) # include # include namespace boost { namespace mpl { template<> struct push_back_impl< aux::vector_tag > { template< typename Vector, typename T > struct apply { typedef v_item type; }; }; }} #endif #endif // BOOST_MPL_VECTOR_AUX_PUSH_BACK_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/vector/aux_/PaxHeaders.5405/empty.hpp0000644000000000000000000000007412717644140021723 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/vector/aux_/empty.hpp0000664000372100037210000000300112717644140022544 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_VECTOR_AUX_EMPTY_HPP_INCLUDED #define BOOST_MPL_VECTOR_AUX_EMPTY_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: empty.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include namespace boost { namespace mpl { #if defined(BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES) template<> struct empty_impl< aux::vector_tag > { template< typename Vector > struct apply : is_same< typename Vector::lower_bound_ , typename Vector::upper_bound_ > { }; }; #else template<> struct empty_impl< aux::vector_tag<0> > { template< typename Vector > struct apply : true_ { }; }; #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template< long N > struct empty_impl< aux::vector_tag > { template< typename Vector > struct apply : false_ { }; }; #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION #endif // BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES }} #endif // BOOST_MPL_VECTOR_AUX_EMPTY_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/vector/aux_/PaxHeaders.5405/include_preprocessed.hpp0000644000000000000000000000007412717644140024766 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/vector/aux_/include_preprocessed.hpp0000664000372100037210000000335712717644140025625 0ustar00fransfrans00000000000000 // NO INCLUDE GUARDS, THE HEADER IS INTENDED FOR MULTIPLE INCLUSION // Copyright Aleksey Gurtovoy 2000-2006 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: include_preprocessed.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #if defined(BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES) # define AUX778076_INCLUDE_DIR typeof_based #elif defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \ || defined(BOOST_MPL_CFG_NO_NONTYPE_TEMPLATE_PARTIAL_SPEC) # define AUX778076_INCLUDE_DIR no_ctps #else # define AUX778076_INCLUDE_DIR plain #endif #if !defined(BOOST_NEEDS_TOKEN_PASTING_OP_FOR_TOKENS_JUXTAPOSING) # define AUX778076_HEADER \ AUX778076_INCLUDE_DIR/BOOST_MPL_PREPROCESSED_HEADER \ /**/ #else # define AUX778076_HEADER \ BOOST_PP_CAT(AUX778076_INCLUDE_DIR,/)##BOOST_MPL_PREPROCESSED_HEADER \ /**/ #endif #if BOOST_WORKAROUND(__IBMCPP__, BOOST_TESTED_AT(700)) # define AUX778076_INCLUDE_STRING BOOST_PP_STRINGIZE(boost/mpl/vector/aux_/preprocessed/AUX778076_HEADER) # include AUX778076_INCLUDE_STRING # undef AUX778076_INCLUDE_STRING #else # include BOOST_PP_STRINGIZE(boost/mpl/vector/aux_/preprocessed/AUX778076_HEADER) #endif # undef AUX778076_HEADER # undef AUX778076_INCLUDE_DIR #undef BOOST_MPL_PREPROCESSED_HEADER madp-0.4/src/boost/boost/mpl/vector/aux_/PaxHeaders.5405/push_front.hpp0000644000000000000000000000007412717644140022754 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/vector/aux_/push_front.hpp0000664000372100037210000000203112717644140023577 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_VECTOR_AUX_PUSH_FRONT_HPP_INCLUDED #define BOOST_MPL_VECTOR_AUX_PUSH_FRONT_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: push_front.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #if defined(BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES) # include # include namespace boost { namespace mpl { template<> struct push_front_impl< aux::vector_tag > { template< typename Vector, typename T > struct apply { typedef v_item type; }; }; }} #endif // BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES #endif // BOOST_MPL_VECTOR_AUX_PUSH_FRONT_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/vector/aux_/PaxHeaders.5405/size.hpp0000644000000000000000000000007412717644140021537 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.093552501 madp-0.4/src/boost/boost/mpl/vector/aux_/size.hpp0000664000372100037210000000225612717644140022373 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_VECTOR_AUX_SIZE_HPP_INCLUDED #define BOOST_MPL_VECTOR_AUX_SIZE_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: size.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include namespace boost { namespace mpl { #if defined(BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES) template<> struct size_impl< aux::vector_tag > : O1_size_impl< aux::vector_tag > { }; #else #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template< long N > struct size_impl< aux::vector_tag > : O1_size_impl< aux::vector_tag > { }; #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION #endif // BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES }} #endif // BOOST_MPL_VECTOR_AUX_SIZE_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/vector/aux_/PaxHeaders.5405/item.hpp0000644000000000000000000000007412717644140021523 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/vector/aux_/item.hpp0000664000372100037210000000500412717644140022351 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_VECTOR_AUX_ITEM_HPP_INCLUDED #define BOOST_MPL_VECTOR_AUX_ITEM_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: item.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include namespace boost { namespace mpl { #if defined(BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES) template< typename T , typename Base , int at_front = 0 > struct v_item : Base { typedef typename Base::upper_bound_ index_; typedef typename next::type upper_bound_; typedef typename next::type size; typedef Base base; typedef v_item type; // agurt 10/sep/04: MWCW <= 9.3 workaround here and below; the compiler // breaks if using declaration comes _before_ the new overload static aux::type_wrapper item_(index_); using Base::item_; }; template< typename T , typename Base > struct v_item : Base { typedef typename prior::type index_; typedef index_ lower_bound_; typedef typename next::type size; typedef Base base; typedef v_item type; static aux::type_wrapper item_(index_); using Base::item_; }; // "erasure" item template< typename Base , int at_front > struct v_mask : Base { typedef typename prior::type index_; typedef index_ upper_bound_; typedef typename prior::type size; typedef Base base; typedef v_mask type; static aux::type_wrapper item_(index_); using Base::item_; }; template< typename Base > struct v_mask : Base { typedef typename Base::lower_bound_ index_; typedef typename next::type lower_bound_; typedef typename prior::type size; typedef Base base; typedef v_mask type; static aux::type_wrapper item_(index_); using Base::item_; }; #endif // BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES }} #endif // BOOST_MPL_VECTOR_AUX_ITEM_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/vector/aux_/PaxHeaders.5405/at.hpp0000644000000000000000000000007412717644140021171 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/vector/aux_/at.hpp0000664000372100037210000000514712717644140022027 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_VECTOR_AUX_AT_HPP_INCLUDED #define BOOST_MPL_VECTOR_AUX_AT_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: at.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include #include #include namespace boost { namespace mpl { #if defined(BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES) template< typename Vector, long n_ > struct v_at_impl { typedef long_< (Vector::lower_bound_::value + n_) > index_; typedef __typeof__( Vector::item_(index_()) ) type; }; template< typename Vector, long n_ > struct v_at : aux::wrapped_type< typename v_at_impl::type > { }; template<> struct at_impl< aux::vector_tag > { template< typename Vector, typename N > struct apply : v_at< Vector , BOOST_MPL_AUX_VALUE_WKND(N)::value > { }; }; #else # if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \ && !defined(BOOST_MPL_CFG_NO_NONTYPE_TEMPLATE_PARTIAL_SPEC) template< typename Vector, BOOST_MPL_AUX_NTTP_DECL(long, n_) > struct v_at; template< BOOST_MPL_AUX_NTTP_DECL(long, n_) > struct at_impl< aux::vector_tag > { template< typename Vector, typename N > struct apply #if !defined(__BORLANDC__) : v_at< Vector , BOOST_MPL_AUX_VALUE_WKND(N)::value > { #else { typedef typename v_at< Vector , BOOST_MPL_AUX_VALUE_WKND(N)::value >::type type; #endif }; }; # else namespace aux { template< BOOST_MPL_AUX_NTTP_DECL(long, n_) > struct v_at_impl { template< typename V > struct result_; }; // to work around ETI, etc. template<> struct v_at_impl<-1> { template< typename V > struct result_ { typedef void_ type; }; }; } // namespace aux template< typename T, BOOST_MPL_AUX_NTTP_DECL(long, n_) > struct v_at : aux::v_at_impl::template result_ { }; # endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION #endif // BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES }} #endif // BOOST_MPL_VECTOR_AUX_AT_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/vector/aux_/PaxHeaders.5405/begin_end.hpp0000644000000000000000000000007412717644140022477 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/vector/aux_/begin_end.hpp0000664000372100037210000000225712717644140023334 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_VECTOR_AUX_BEGIN_END_HPP_INCLUDED #define BOOST_MPL_VECTOR_AUX_BEGIN_END_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: begin_end.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #if defined(BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES) # include # include # include namespace boost { namespace mpl { template<> struct begin_impl< aux::vector_tag > { template< typename Vector > struct apply { typedef v_iter type; }; }; template<> struct end_impl< aux::vector_tag > { template< typename Vector > struct apply { typedef v_iter type; }; }; }} #endif // BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES #endif // BOOST_MPL_VECTOR_AUX_BEGIN_END_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/vector/aux_/PaxHeaders.5405/vector0.hpp0000644000000000000000000000007412717644140022147 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.093552501 madp-0.4/src/boost/boost/mpl/vector/aux_/vector0.hpp0000664000372100037210000000260412717644140023000 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_VECTOR_AUX_VECTOR0_HPP_INCLUDED #define BOOST_MPL_VECTOR_AUX_VECTOR0_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: vector0.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include namespace boost { namespace mpl { template< typename Dummy = na > struct vector0; template<> struct vector0 { #if defined(BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES) typedef aux::vector_tag tag; typedef vector0 type; typedef long_<32768> lower_bound_; typedef lower_bound_ upper_bound_; typedef long_<0> size; static aux::type_wrapper item_(...); #else typedef aux::vector_tag<0> tag; typedef vector0 type; typedef void_ item0; typedef v_iter,0> begin; typedef v_iter,0> end; #endif }; }} #endif // BOOST_MPL_VECTOR_AUX_VECTOR0_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/vector/PaxHeaders.5405/vector20.hpp0000644000000000000000000000007412717644140021275 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.093552501 madp-0.4/src/boost/boost/mpl/vector/vector20.hpp0000664000372100037210000000237212717644140022130 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_VECTOR_VECTOR20_HPP_INCLUDED #define BOOST_MPL_VECTOR_VECTOR20_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: vector20.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include #endif #include #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # define BOOST_MPL_PREPROCESSED_HEADER vector20.hpp # include #else # include # include # include namespace boost { namespace mpl { # define BOOST_PP_ITERATION_PARAMS_1 \ (3,(11, 20, )) # include BOOST_PP_ITERATE() }} #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #endif // BOOST_MPL_VECTOR_VECTOR20_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/push_back.hpp0000644000000000000000000000007412717644140020266 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/push_back.hpp0000664000372100037210000000256512717644140021125 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_PUSH_BACK_HPP_INCLUDED #define BOOST_MPL_PUSH_BACK_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: push_back.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include namespace boost { namespace mpl { template< typename BOOST_MPL_AUX_NA_PARAM(Sequence) , typename BOOST_MPL_AUX_NA_PARAM(T) > struct push_back : push_back_impl< typename sequence_tag::type > ::template apply< Sequence,T > { BOOST_MPL_AUX_LAMBDA_SUPPORT(2,push_back,(Sequence,T)) }; template< typename BOOST_MPL_AUX_NA_PARAM(Sequence) > struct has_push_back : has_push_back_impl< typename sequence_tag::type > ::template apply< Sequence > { BOOST_MPL_AUX_LAMBDA_SUPPORT(1,has_push_back,(Sequence)) }; BOOST_MPL_AUX_NA_SPEC(2, push_back) BOOST_MPL_AUX_NA_SPEC(1, has_push_back) }} #endif // BOOST_MPL_PUSH_BACK_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/not_equal_to.hpp0000644000000000000000000000007412717644140021020 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/not_equal_to.hpp0000664000372100037210000000121712717644140021650 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_NOT_EQUAL_TO_HPP_INCLUDED #define BOOST_MPL_NOT_EQUAL_TO_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: not_equal_to.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #define AUX778076_OP_NAME not_equal_to #define AUX778076_OP_TOKEN != #include #endif // BOOST_MPL_NOT_EQUAL_TO_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/distance_fwd.hpp0000644000000000000000000000007412717644140020761 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/distance_fwd.hpp0000664000372100037210000000141112717644140021605 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_DISTANCE_FWD_HPP_INCLUDED #define BOOST_MPL_DISTANCE_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: distance_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include namespace boost { namespace mpl { BOOST_MPL_AUX_COMMON_NAME_WKND(distance) template< typename Tag > struct distance_impl; template< typename First, typename Last > struct distance; }} #endif // BOOST_MPL_DISTANCE_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/set0000644000000000000000000000007412717644140016334 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/set/0000775000372100037210000000000012717644140017240 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/mpl/set/PaxHeaders.5405/set0.hpp0000644000000000000000000000007412717644140017775 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/set/set0.hpp0000664000372100037210000000237112717644140020627 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_SET_SET0_HPP_INCLUDED #define BOOST_MPL_SET_SET0_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // Copyright David Abrahams 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: set0.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include //#include #include #include #include #include #include #include #include #include #include #include #include #include #include #endif // BOOST_MPL_SET_SET0_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/set/PaxHeaders.5405/aux_0000644000000000000000000000007412717644140017270 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/set/aux_/0000775000372100037210000000000012717644140020174 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/mpl/set/aux_/PaxHeaders.5405/set0.hpp0000644000000000000000000000007412717644140020731 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/set/aux_/set0.hpp0000664000372100037210000000370212717644140021562 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_SET_AUX_SET0_HPP_INCLUDED #define BOOST_MPL_SET_AUX_SET0_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // Copyright David Abrahams 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: set0.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include #include namespace boost { namespace mpl { #if defined(BOOST_MPL_CFG_USE_OPERATORS_OVERLOADING) # define BOOST_MPL_AUX_SET0_OVERLOAD(R, f, X, T) \ friend R BOOST_PP_CAT(BOOST_MPL_AUX_OVERLOAD_,f)(X const&, T) \ /**/ # define BOOST_MPL_AUX_SET_OVERLOAD(R, f, X, T) \ BOOST_MPL_AUX_SET0_OVERLOAD(R, f, X, T) \ /**/ #else # define BOOST_MPL_AUX_SET0_OVERLOAD(R, f, X, T) \ static R BOOST_PP_CAT(BOOST_MPL_AUX_OVERLOAD_,f)(X const&, T) \ /**/ # define BOOST_MPL_AUX_SET_OVERLOAD(R, f, X, T) \ BOOST_MPL_AUX_SET0_OVERLOAD(R, f, X, T); \ using Base::BOOST_PP_CAT(BOOST_MPL_AUX_OVERLOAD_,f) \ /**/ #endif template< typename Dummy = na > struct set0 { typedef set0<> item_; typedef item_ type; typedef aux::set_tag tag; typedef void_ last_masked_; typedef void_ item_type_; typedef long_<0> size; typedef long_<1> order; BOOST_MPL_AUX_SET0_OVERLOAD( aux::no_tag, ORDER_BY_KEY, set0<>, void const volatile* ); BOOST_MPL_AUX_SET0_OVERLOAD( aux::yes_tag, IS_MASKED, set0<>, void const volatile* ); }; }} #endif // BOOST_MPL_SET_AUX_SET0_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/set/aux_/PaxHeaders.5405/at_impl.hpp0000644000000000000000000000007412717644140021503 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/set/aux_/at_impl.hpp0000664000372100037210000000201312717644140022326 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_SET_AUX_AT_IMPL_HPP_INCLUDED #define BOOST_MPL_SET_AUX_AT_IMPL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: at_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include namespace boost { namespace mpl { template<> struct at_impl< aux::set_tag > { template< typename Set, typename T > struct apply { typedef typename if_< has_key_impl::apply , T , void_ >::type type; }; }; }} #endif // BOOST_MPL_SET_AUX_AT_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/set/aux_/PaxHeaders.5405/has_key_impl.hpp0000644000000000000000000000007412717644140022522 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/set/aux_/has_key_impl.hpp0000664000372100037210000000343012717644140023351 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_SET_AUX_HAS_KEY_IMPL_HPP_INCLUDED #define BOOST_MPL_SET_AUX_HAS_KEY_IMPL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // Copyright David Abrahams 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: has_key_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include #include #include namespace boost { namespace mpl { template<> struct has_key_impl< aux::set_tag > { template< typename Set, typename T > struct apply #if BOOST_WORKAROUND(BOOST_MSVC, BOOST_TESTED_AT(1400)) \ || BOOST_WORKAROUND(__EDG_VERSION__, <= 245) { BOOST_STATIC_CONSTANT(bool, value = ( sizeof( BOOST_MPL_AUX_OVERLOAD_CALL_IS_MASKED( Set , BOOST_MPL_AUX_STATIC_CAST(aux::type_wrapper*, 0) ) ) == sizeof(aux::no_tag) ) ); typedef bool_ type; #else // ISO98 C++ : bool_< ( sizeof( BOOST_MPL_AUX_OVERLOAD_CALL_IS_MASKED( Set , BOOST_MPL_AUX_STATIC_CAST(aux::type_wrapper*, 0) ) ) == sizeof(aux::no_tag) ) > { #endif }; }; }} #endif // BOOST_MPL_SET_AUX_HAS_KEY_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/set/aux_/PaxHeaders.5405/erase_key_impl.hpp0000644000000000000000000000007412717644140023046 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/set/aux_/erase_key_impl.hpp0000664000372100037210000000260412717644140023677 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_SET_AUX_ERASE_KEY_IMPL_HPP_INCLUDED #define BOOST_MPL_SET_AUX_ERASE_KEY_IMPL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2007 // Copyright David Abrahams 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: erase_key_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include #include namespace boost { namespace mpl { template<> struct erase_key_impl< aux::set_tag > { template< typename Set , typename T > struct apply : eval_if< has_key_impl::apply , eval_if< is_same< T,typename Set::item_type_ > , base , identity< s_mask > > , identity > { }; }; }} #endif // BOOST_MPL_SET_AUX_ERASE_KEY_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/set/aux_/PaxHeaders.5405/begin_end_impl.hpp0000644000000000000000000000007412717644140023011 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/set/aux_/begin_end_impl.hpp0000664000372100037210000000201012717644140023631 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_SET_AUX_BEGIN_END_IMPL_HPP_INCLUDED #define BOOST_MPL_SET_AUX_BEGIN_END_IMPL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2007 // Copyright David Abrahams 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: begin_end_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include namespace boost { namespace mpl { template<> struct begin_impl< aux::set_tag > { template< typename Set > struct apply : s_iter_get { }; }; template<> struct end_impl< aux::set_tag > { template< typename Set > struct apply { typedef s_iter< Set,set0<> > type; }; }; }} #endif // BOOST_MPL_SET_AUX_BEGIN_END_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/set/aux_/PaxHeaders.5405/clear_impl.hpp0000644000000000000000000000007412717644140022165 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/set/aux_/clear_impl.hpp0000664000372100037210000000156212717644140023020 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_SET_AUX_CLEAR_IMPL_HPP_INCLUDED #define BOOST_MPL_SET_AUX_CLEAR_IMPL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // Copyright David Abrahams 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: clear_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include namespace boost { namespace mpl { template<> struct clear_impl< aux::set_tag > { template< typename Set > struct apply { typedef set0<> type; }; }; }} #endif // BOOST_MPL_SET_AUX_CLEAR_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/set/aux_/PaxHeaders.5405/empty_impl.hpp0000644000000000000000000000007412717644140022235 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/set/aux_/empty_impl.hpp0000664000372100037210000000151212717644140023063 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_SET_AUX_EMPTY_IMPL_HPP_INCLUDED #define BOOST_MPL_SET_AUX_EMPTY_IMPL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: empty_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include namespace boost { namespace mpl { template<> struct empty_impl< aux::set_tag > { template< typename Set > struct apply : not_< typename Set::size > { }; }; }} #endif // BOOST_MPL_SET_AUX_EMPTY_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/set/aux_/PaxHeaders.5405/key_type_impl.hpp0000644000000000000000000000007412717644140022730 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/set/aux_/key_type_impl.hpp0000664000372100037210000000154412717644140023563 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_SET_AUX_KEY_TYPE_IMPL_HPP_INCLUDED #define BOOST_MPL_SET_AUX_KEY_TYPE_IMPL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // Copyright David Abrahams 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: key_type_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include namespace boost { namespace mpl { template<> struct key_type_impl< aux::set_tag > { template< typename Set, typename T > struct apply { typedef T type; }; }; }} #endif // BOOST_MPL_SET_AUX_KEY_TYPE_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/set/aux_/PaxHeaders.5405/size_impl.hpp0000644000000000000000000000007412717644140022051 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/set/aux_/size_impl.hpp0000664000372100037210000000142612717644140022703 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_SET_AUX_SIZE_IMPL_HPP_INCLUDED #define BOOST_MPL_SET_AUX_SIZE_IMPL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: size_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include namespace boost { namespace mpl { template<> struct size_impl< aux::set_tag > { template< typename Set > struct apply : Set::size { }; }; }} #endif // BOOST_MPL_SET_AUX_SIZE_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/set/aux_/PaxHeaders.5405/insert_impl.hpp0000644000000000000000000000007412717644140022403 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/set/aux_/insert_impl.hpp0000664000372100037210000000313512717644140023234 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_SET_AUX_INSERT_IMPL_HPP_INCLUDED #define BOOST_MPL_SET_AUX_INSERT_IMPL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2007 // Copyright David Abrahams 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: insert_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include #include #include namespace boost { namespace mpl { namespace aux { template< typename Set, typename T > struct set_insert_impl : eval_if< has_key_impl::apply , identity , eval_if< is_same< T,typename Set::last_masked_ > , base , identity< s_item > > > { }; } template<> struct insert_impl< aux::set_tag > { template< typename Set , typename PosOrKey , typename KeyOrNA > struct apply : aux::set_insert_impl< Set , typename if_na::type > { }; }; }} #endif // BOOST_MPL_SET_AUX_INSERT_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/set/aux_/PaxHeaders.5405/tag.hpp0000644000000000000000000000007412717644140020631 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/set/aux_/tag.hpp0000664000372100037210000000120012717644140021451 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_SET_AUX_TAG_HPP_INCLUDED #define BOOST_MPL_SET_AUX_TAG_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // Copyright David Abrahams 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: tag.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ namespace boost { namespace mpl { namespace aux { struct set_tag; }}} #endif // BOOST_MPL_SET_AUX_TAG_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/set/aux_/PaxHeaders.5405/item.hpp0000644000000000000000000000007412717644140021014 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/set/aux_/item.hpp0000664000372100037210000000442512717644140021650 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_SET_AUX_ITEM_HPP_INCLUDED #define BOOST_MPL_SET_AUX_ITEM_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2007 // Copyright David Abrahams 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: item.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include namespace boost { namespace mpl { template< typename T, typename Base > struct s_item : Base { typedef s_item item_; typedef void_ last_masked_; typedef T item_type_; typedef Base base; typedef typename next< typename Base::size >::type size; typedef typename next< typename Base::order >::type order; #if defined(BOOST_MPL_CFG_NO_DEPENDENT_ARRAY_TYPES) typedef typename aux::weighted_tag::type order_tag_; #else typedef char (&order_tag_)[BOOST_MPL_AUX_MSVC_VALUE_WKND(order)::value]; #endif BOOST_MPL_AUX_SET_OVERLOAD( order_tag_, ORDER_BY_KEY, s_item, aux::type_wrapper* ); BOOST_MPL_AUX_SET_OVERLOAD( aux::no_tag, IS_MASKED, s_item, aux::type_wrapper* ); }; template< typename T, typename Base > struct s_mask : Base { typedef s_mask item_; typedef T last_masked_; typedef void_ item_type_; typedef Base base; typedef typename prior< typename Base::size >::type size; BOOST_MPL_AUX_SET_OVERLOAD( aux::yes_tag, IS_MASKED, s_mask, aux::type_wrapper* ); }; template< typename T, typename Base > struct s_unmask : Base { typedef s_unmask item_; typedef void_ last_masked_; typedef T item_type_; typedef Base base; typedef typename next< typename Base::size >::type size; BOOST_MPL_AUX_SET_OVERLOAD( aux::no_tag, IS_MASKED, s_unmask, aux::type_wrapper* ); }; }} #endif // BOOST_MPL_SET_AUX_ITEM_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/set/aux_/PaxHeaders.5405/iterator.hpp0000644000000000000000000000007412717644140021707 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/set/aux_/iterator.hpp0000664000372100037210000000452612717644140022545 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_SET_AUX_ITERATOR_HPP_INCLUDED #define BOOST_MPL_SET_AUX_ITERATOR_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2007 // Copyright David Abrahams 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: iterator.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include #include namespace boost { namespace mpl { // used by 's_iter_get' template< typename Set, typename Tail > struct s_iter; template< typename Set, typename Tail > struct s_iter_get : eval_if< has_key< Set,typename Tail::item_type_ > , identity< s_iter > , next< s_iter > > { }; template< typename Set, typename Tail > struct s_iter_impl { typedef Tail tail_; typedef forward_iterator_tag category; typedef typename Tail::item_type_ type; #if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) typedef typename s_iter_get< Set,typename Tail::base >::type next; #endif }; #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template< typename Set, typename Tail > struct next< s_iter > : s_iter_get< Set,typename Tail::base > { }; template< typename Set > struct next< s_iter > > { typedef s_iter > type; }; template< typename Set, typename Tail > struct s_iter : s_iter_impl { }; template< typename Set > struct s_iter > { typedef forward_iterator_tag category; }; #else template< typename Set > struct s_end_iter { typedef forward_iterator_tag category; typedef s_iter > next; }; template< typename Set, typename Tail > struct s_iter : if_< is_same< Tail,set0<> > , s_end_iter , s_iter_impl >::type { }; #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION }} #endif // BOOST_MPL_SET_AUX_ITERATOR_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/set/aux_/PaxHeaders.5405/erase_impl.hpp0000644000000000000000000000007412717644140022176 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/set/aux_/erase_impl.hpp0000664000372100037210000000177412717644140023036 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_SET_AUX_ERASE_IMPL_HPP_INCLUDED #define BOOST_MPL_SET_AUX_ERASE_IMPL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // Copyright David Abrahams 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: erase_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include namespace boost { namespace mpl { template<> struct erase_impl< aux::set_tag > { template< typename Set , typename Pos , typename unused_ > struct apply : erase_key_impl ::apply { }; }; }} #endif // BOOST_MPL_SET_AUX_ERASE_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/set/aux_/PaxHeaders.5405/value_type_impl.hpp0000644000000000000000000000007412717644140023254 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/set/aux_/value_type_impl.hpp0000664000372100037210000000156012717644140024105 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_SET_AUX_VALUE_TYPE_IMPL_HPP_INCLUDED #define BOOST_MPL_SET_AUX_VALUE_TYPE_IMPL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // Copyright David Abrahams 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: value_type_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include namespace boost { namespace mpl { template<> struct value_type_impl< aux::set_tag > { template< typename Set, typename T > struct apply { typedef T type; }; }; }} #endif // BOOST_MPL_SET_AUX_VALUE_TYPE_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/bind_fwd.hpp0000644000000000000000000000007412717644140020103 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/bind_fwd.hpp0000664000372100037210000000505012717644140020732 0ustar00fransfrans00000000000000 #if !defined(BOOST_PP_IS_ITERATING) ///// header body #ifndef BOOST_MPL_BIND_FWD_HPP_INCLUDED #define BOOST_MPL_BIND_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: bind_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include #endif #include #include #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # define BOOST_MPL_PREPROCESSED_HEADER bind_fwd.hpp # include #else # include # include # include # include # include # include # include namespace boost { namespace mpl { // local macros, #undef-ined at the end of the header # if defined(BOOST_MPL_CFG_DMC_AMBIGUOUS_CTPS) # define AUX778076_DMC_PARAM() , int dummy_ = 0 # else # define AUX778076_DMC_PARAM() # endif # define AUX778076_BIND_DEFAULT_PARAMS(param, value) \ BOOST_MPL_PP_DEFAULT_PARAMS( \ BOOST_MPL_LIMIT_METAFUNCTION_ARITY \ , param \ , value \ ) \ AUX778076_DMC_PARAM() \ /**/ # define AUX778076_BIND_N_PARAMS(n, param) \ BOOST_PP_COMMA_IF(n) BOOST_MPL_PP_PARAMS(n, param) \ AUX778076_DMC_PARAM() \ /**/ #if !defined(BOOST_MPL_CFG_NO_BIND_TEMPLATE) template< typename F, AUX778076_BIND_DEFAULT_PARAMS(typename T, na) > struct bind; #endif #define BOOST_PP_ITERATION_PARAMS_1 \ (3,(0, BOOST_MPL_LIMIT_METAFUNCTION_ARITY, )) #include BOOST_PP_ITERATE() # undef AUX778076_BIND_N_PARAMS # undef AUX778076_BIND_DEFAULT_PARAMS # undef AUX778076_DMC_PARAM }} #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #endif // BOOST_MPL_BIND_FWD_HPP_INCLUDED ///// iteration #else #define i_ BOOST_PP_FRAME_ITERATION(1) template< typename F AUX778076_BIND_N_PARAMS(i_, typename T) > struct BOOST_PP_CAT(bind,i_); #undef i_ #endif // BOOST_PP_IS_ITERATING madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/equal_to.hpp0000644000000000000000000000007412717644140020140 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/equal_to.hpp0000664000372100037210000000117312717644140020771 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_EQUAL_TO_HPP_INCLUDED #define BOOST_MPL_EQUAL_TO_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: equal_to.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #define AUX778076_OP_NAME equal_to #define AUX778076_OP_TOKEN == #include #endif // BOOST_MPL_EQUAL_TO_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/lambda.hpp0000644000000000000000000000007412717644140017547 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/lambda.hpp0000664000372100037210000000156512717644140020405 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_LAMBDA_HPP_INCLUDED #define BOOST_MPL_LAMBDA_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: lambda.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #if !defined(BOOST_MPL_CFG_NO_FULL_LAMBDA_SUPPORT) # include #else # include # include # define BOOST_MPL_CFG_NO_IMPLICIT_METAFUNCTIONS #endif #endif // BOOST_MPL_LAMBDA_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/erase_key_fwd.hpp0000644000000000000000000000007412717644140021136 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/erase_key_fwd.hpp0000664000372100037210000000126712717644140021773 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_ERASE_KEY_FWD_HPP_INCLUDED #define BOOST_MPL_ERASE_KEY_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: erase_key_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ namespace boost { namespace mpl { template< typename Tag > struct erase_key_impl; template< typename Sequence, typename Key > struct erase_key; }} #endif // BOOST_MPL_ERASE_KEY_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/size.hpp0000644000000000000000000000007412717644140017301 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/size.hpp0000664000372100037210000000212712717644140020132 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_SIZE_HPP_INCLUDED #define BOOST_MPL_SIZE_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: size.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include namespace boost { namespace mpl { template< typename BOOST_MPL_AUX_NA_PARAM(Sequence) > struct size : aux::msvc_eti_base< typename size_impl< typename sequence_tag::type > ::template apply< Sequence >::type >::type { BOOST_MPL_AUX_LAMBDA_SUPPORT(1, size, (Sequence)) }; BOOST_MPL_AUX_NA_SPEC(1, size) }} #endif // BOOST_MPL_SIZE_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/push_front.hpp0000644000000000000000000000007412717644140020516 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/push_front.hpp0000664000372100037210000000260212717644140021345 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_PUSH_FRONT_HPP_INCLUDED #define BOOST_MPL_PUSH_FRONT_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: push_front.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include namespace boost { namespace mpl { template< typename BOOST_MPL_AUX_NA_PARAM(Sequence) , typename BOOST_MPL_AUX_NA_PARAM(T) > struct push_front : push_front_impl< typename sequence_tag::type > ::template apply< Sequence,T > { BOOST_MPL_AUX_LAMBDA_SUPPORT(2,push_front,(Sequence,T)) }; template< typename BOOST_MPL_AUX_NA_PARAM(Sequence) > struct has_push_front : has_push_front_impl< typename sequence_tag::type > ::template apply< Sequence > { BOOST_MPL_AUX_LAMBDA_SUPPORT(1,has_push_front,(Sequence)) }; BOOST_MPL_AUX_NA_SPEC(2, push_front) BOOST_MPL_AUX_NA_SPEC(1, has_push_front) }} #endif // BOOST_MPL_PUSH_FRONT_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/reverse_fold.hpp0000644000000000000000000000007412717644140021006 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/reverse_fold.hpp0000664000372100037210000000256112717644140021641 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_REVERSE_FOLD_HPP_INCLUDED #define BOOST_MPL_REVERSE_FOLD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // Copyright David Abrahams 2001-2002 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: reverse_fold.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include namespace boost { namespace mpl { template< typename BOOST_MPL_AUX_NA_PARAM(Sequence) , typename BOOST_MPL_AUX_NA_PARAM(State) , typename BOOST_MPL_AUX_NA_PARAM(BackwardOp) , typename ForwardOp = arg<1> > struct reverse_fold { typedef typename aux::reverse_fold_impl< ::boost::mpl::O1_size::value , typename begin::type , typename end::type , State , BackwardOp , ForwardOp >::state type; BOOST_MPL_AUX_LAMBDA_SUPPORT(3,reverse_fold,(Sequence,State,BackwardOp)) }; BOOST_MPL_AUX_NA_SPEC(3, reverse_fold) }} #endif // BOOST_MPL_REVERSE_FOLD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/distance.hpp0000644000000000000000000000007412717644140020121 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/distance.hpp0000664000372100037210000000412712717644140020754 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_DISTANCE_HPP_INCLUDED #define BOOST_MPL_DISTANCE_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: distance.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include #include #include #include #include #include namespace boost { namespace mpl { // default implementation for forward/bidirectional iterators template< typename Tag > struct distance_impl { template< typename First, typename Last > struct apply #if !defined(BOOST_MPL_CFG_NO_NESTED_FORWARDING) : aux::msvc_eti_base< typename iter_fold< iterator_range , mpl::long_<0> , next<> >::type > { #else { typedef typename iter_fold< iterator_range , mpl::long_<0> , next<> >::type type; BOOST_STATIC_CONSTANT(long, value = (iter_fold< iterator_range , mpl::long_<0> , next<> >::type::value) ); #endif }; }; template< typename BOOST_MPL_AUX_NA_PARAM(First) , typename BOOST_MPL_AUX_NA_PARAM(Last) > struct distance : distance_impl< typename tag::type > ::template apply { BOOST_MPL_AUX_LAMBDA_SUPPORT(2, distance, (First, Last)) }; BOOST_MPL_AUX_NA_SPEC(2, distance) }} #endif // BOOST_MPL_DISTANCE_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/int_fwd.hpp0000644000000000000000000000007412717644140017761 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/int_fwd.hpp0000664000372100037210000000142012717644140020605 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_INT_FWD_HPP_INCLUDED #define BOOST_MPL_INT_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: int_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN template< BOOST_MPL_AUX_NTTP_DECL(int, N) > struct int_; BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE BOOST_MPL_AUX_ADL_BARRIER_DECL(int_) #endif // BOOST_MPL_INT_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/advance.hpp0000644000000000000000000000007412717644140017730 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/advance.hpp0000664000372100037210000000401512717644140020557 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_ADVANCE_HPP_INCLUDED #define BOOST_MPL_ADVANCE_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: advance.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include #include #include #include #include #include namespace boost { namespace mpl { // default implementation for forward/bidirectional iterators template< typename Tag > struct advance_impl { template< typename Iterator, typename N > struct apply { typedef typename less< N,long_<0> >::type backward_; typedef typename if_< backward_, negate, N >::type offset_; typedef typename if_< backward_ , aux::advance_backward< BOOST_MPL_AUX_VALUE_WKND(offset_)::value > , aux::advance_forward< BOOST_MPL_AUX_VALUE_WKND(offset_)::value > >::type f_; typedef typename apply_wrap1::type type; }; }; template< typename BOOST_MPL_AUX_NA_PARAM(Iterator) , typename BOOST_MPL_AUX_NA_PARAM(N) > struct advance : advance_impl< typename tag::type > ::template apply { }; template< typename Iterator , BOOST_MPL_AUX_NTTP_DECL(long, N) > struct advance_c : advance_impl< typename tag::type > ::template apply > { }; BOOST_MPL_AUX_NA_SPEC(2, advance) }} #endif // BOOST_MPL_ADVANCE_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/integral_c_fwd.hpp0000644000000000000000000000007412717644140021276 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/integral_c_fwd.hpp0000664000372100037210000000175012717644140022130 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_INTEGRAL_C_FWD_HPP_INCLUDED #define BOOST_MPL_INTEGRAL_C_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2006 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: integral_c_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN #if BOOST_WORKAROUND(__HP_aCC, <= 53800) // the type of non-type template arguments may not depend on template arguments template< typename T, long N > struct integral_c; #else template< typename T, T N > struct integral_c; #endif BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE BOOST_MPL_AUX_ADL_BARRIER_DECL(integral_c) #endif // BOOST_MPL_INTEGRAL_C_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/plus.hpp0000644000000000000000000000007412717644140017312 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/plus.hpp0000664000372100037210000000114612717644140020143 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_PLUS_HPP_INCLUDED #define BOOST_MPL_PLUS_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: plus.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #define AUX778076_OP_NAME plus #define AUX778076_OP_TOKEN + #include #endif // BOOST_MPL_PLUS_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/prior.hpp0000644000000000000000000000007412717644140017462 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/prior.hpp0000664000372100037210000000104112717644140020305 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_PRIOR_HPP_INCLUDED #define BOOST_MPL_PRIOR_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: prior.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #endif // BOOST_MPL_PRIOR_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/less.hpp0000644000000000000000000000007412717644140017275 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/less.hpp0000664000372100037210000000114612717644140020126 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_LESS_HPP_INCLUDED #define BOOST_MPL_LESS_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: less.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #define AUX778076_OP_NAME less #define AUX778076_OP_TOKEN < #include #endif // BOOST_MPL_LESS_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/advance_fwd.hpp0000644000000000000000000000007412717644140020570 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/advance_fwd.hpp0000664000372100037210000000140212717644140021414 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_ADVANCE_FWD_HPP_INCLUDED #define BOOST_MPL_ADVANCE_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: advance_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include namespace boost { namespace mpl { BOOST_MPL_AUX_COMMON_NAME_WKND(advance) template< typename Tag > struct advance_impl; template< typename Iterator, typename N > struct advance; }} #endif // BOOST_MPL_ADVANCE_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/or.hpp0000644000000000000000000000007412717644140016747 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/or.hpp0000664000372100037210000000321712717644140017601 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_OR_HPP_INCLUDED #define BOOST_MPL_OR_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: or.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # include # include # include # include # include // agurt, 19/may/04: workaround a conflict with header's // 'or' and 'and' macros, see http://tinyurl.com/3et69; 'defined(or)' // has to be checked in a separate condition, otherwise GCC complains // about 'or' being an alternative token #if defined(_MSC_VER) #ifndef __GCCXML__ #if defined(or) # pragma push_macro("or") # undef or # define or(x) #endif #endif #endif # define BOOST_MPL_PREPROCESSED_HEADER or.hpp # include #if defined(_MSC_VER) #ifndef __GCCXML__ #if defined(or) # pragma pop_macro("or") #endif #endif #endif #else # define AUX778076_OP_NAME or_ # define AUX778076_OP_VALUE1 true # define AUX778076_OP_VALUE2 false # include #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #endif // BOOST_MPL_OR_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/erase_fwd.hpp0000644000000000000000000000007412717644140020266 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/erase_fwd.hpp0000664000372100037210000000126012717644140021114 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_ERASE_FWD_HPP_INCLUDED #define BOOST_MPL_ERASE_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: erase_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ namespace boost { namespace mpl { template< typename Tag > struct erase_impl; template< typename Sequence, typename First, typename Last > struct erase; }} #endif // BOOST_MPL_ERASE_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/clear.hpp0000644000000000000000000000007412717644140017415 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/clear.hpp0000664000372100037210000000176612717644140020256 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_CLEAR_HPP_INCLUDED #define BOOST_MPL_CLEAR_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: clear.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include namespace boost { namespace mpl { template< typename BOOST_MPL_AUX_NA_PARAM(Sequence) > struct clear : clear_impl< typename sequence_tag::type > ::template apply< Sequence > { BOOST_MPL_AUX_LAMBDA_SUPPORT(1,clear,(Sequence)) }; BOOST_MPL_AUX_NA_SPEC(1, clear) }} #endif // BOOST_MPL_CLEAR_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/apply_wrap.hpp0000644000000000000000000000007412717644140020505 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/apply_wrap.hpp0000664000372100037210000001421612717644140021340 0ustar00fransfrans00000000000000 #if !defined(BOOST_PP_IS_ITERATING) ///// header body #ifndef BOOST_MPL_APPLY_WRAP_HPP_INCLUDED #define BOOST_MPL_APPLY_WRAP_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2008 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: apply_wrap.hpp 49272 2008-10-11 06:50:46Z agurtovoy $ // $Date: 2008-10-10 23:50:46 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49272 $ #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include # include # include # include #endif #include #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # define BOOST_MPL_PREPROCESSED_HEADER apply_wrap.hpp # include #else # include # include # include # include # include # include # include # include # include # include # include # include # include # include namespace boost { namespace mpl { // local macros, #undef-ined at the end of the header # define AUX778076_APPLY_WRAP_PARAMS(n, param) \ BOOST_MPL_PP_PARAMS(n, param) \ /**/ # define AUX778076_APPLY_WRAP_SPEC_PARAMS(n, param) \ BOOST_MPL_PP_ENUM(BOOST_PP_INC(n), param) \ /**/ #define BOOST_PP_ITERATION_PARAMS_1 \ (3,(0, BOOST_MPL_LIMIT_METAFUNCTION_ARITY, )) #include BOOST_PP_ITERATE() # undef AUX778076_APPLY_WRAP_SPEC_PARAMS # undef AUX778076_APPLY_WRAP_PARAMS }} #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #endif // BOOST_MPL_APPLY_WRAP_HPP_INCLUDED ///// iteration, depth == 1 // For gcc 4.4 compatability, we must include the // BOOST_PP_ITERATION_DEPTH test inside an #else clause. #else // BOOST_PP_IS_ITERATING #if BOOST_PP_ITERATION_DEPTH() == 1 # define i_ BOOST_PP_FRAME_ITERATION(1) # if BOOST_WORKAROUND(BOOST_MSVC, < 1300) // MSVC version #define AUX778076_MSVC_DTW_NAME BOOST_PP_CAT(msvc_apply,i_) #define AUX778076_MSVC_DTW_ORIGINAL_NAME apply #define AUX778076_MSVC_DTW_ARITY i_ #include template< typename F BOOST_PP_COMMA_IF(i_) AUX778076_APPLY_WRAP_PARAMS(i_, typename T) > struct BOOST_PP_CAT(apply_wrap,i_) { // Metafunction forwarding confuses vc6 typedef typename BOOST_PP_CAT(msvc_apply,i_)::template result_< AUX778076_APPLY_WRAP_PARAMS(i_, T) >::type type; }; # elif defined(BOOST_MPL_CFG_BROKEN_DEFAULT_PARAMETERS_IN_NESTED_TEMPLATES) // MWCW/Borland version template< int N, typename F BOOST_PP_COMMA_IF(i_) AUX778076_APPLY_WRAP_PARAMS(i_, typename T) > struct BOOST_PP_CAT(apply_wrap_impl,i_); #define BOOST_PP_ITERATION_PARAMS_2 \ (3,(0, BOOST_MPL_LIMIT_METAFUNCTION_ARITY - i_, )) #include BOOST_PP_ITERATE() template< typename F BOOST_PP_COMMA_IF(i_) AUX778076_APPLY_WRAP_PARAMS(i_, typename T) > struct BOOST_PP_CAT(apply_wrap,i_) : BOOST_PP_CAT(apply_wrap_impl,i_)< ::boost::mpl::aux::arity::value , F BOOST_PP_COMMA_IF(i_) AUX778076_APPLY_WRAP_PARAMS(i_, T) >::type { }; # else // ISO98 C++, with minor concession to vc7 template< typename F BOOST_PP_COMMA_IF(i_) AUX778076_APPLY_WRAP_PARAMS(i_, typename T) #if i_ == 0 , typename has_apply_ = typename aux::has_apply::type #endif > struct BOOST_PP_CAT(apply_wrap,i_) // metafunction forwarding confuses MSVC 7.0 #if !BOOST_WORKAROUND(BOOST_MSVC, == 1300) : F::template apply< AUX778076_APPLY_WRAP_PARAMS(i_, T) > { #else { typedef typename F::template apply< AUX778076_APPLY_WRAP_PARAMS(i_, T) >::type type; #endif }; #if i_ == 0 && !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template< typename F > struct BOOST_PP_CAT(apply_wrap,i_) : F::apply { }; #endif # endif // workarounds #if defined(BOOST_MPL_CFG_MSVC_ETI_BUG) /// workaround for ETI bug template<> struct BOOST_PP_CAT(apply_wrap,i_) { typedef int type; }; #endif # undef i_ ///// iteration, depth == 2 #elif BOOST_PP_ITERATION_DEPTH() == 2 # define j_ BOOST_PP_FRAME_ITERATION(2) #if i_ == 0 && j_ == 0 \ && defined(BOOST_MPL_CFG_BCC590_WORKAROUNDS) \ && !defined(BOOST_MPL_CFG_NO_HAS_APPLY) template< typename F, bool F_has_apply > struct apply_wrap_impl0_bcb { typedef typename F::template apply< na > type; }; template< typename F > struct apply_wrap_impl0_bcb< F, true > { typedef typename F::apply type; }; template< typename F BOOST_PP_COMMA_IF(i_) AUX778076_APPLY_WRAP_PARAMS(i_, typename T) > struct BOOST_PP_CAT(apply_wrap_impl,i_)< BOOST_MPL_PP_ADD(i_, j_) , F BOOST_PP_COMMA_IF(i_) AUX778076_APPLY_WRAP_PARAMS(i_, T) > { typedef apply_wrap_impl0_bcb< F, aux::has_apply< F >::value >::type type; }; #else template< typename F BOOST_PP_COMMA_IF(i_) AUX778076_APPLY_WRAP_PARAMS(i_, typename T) > struct BOOST_PP_CAT(apply_wrap_impl,i_)< BOOST_MPL_PP_ADD(i_, j_) , F BOOST_PP_COMMA_IF(i_) AUX778076_APPLY_WRAP_PARAMS(i_, T) > { typedef typename F::template apply< AUX778076_APPLY_WRAP_PARAMS(i_, T) #if i_ == 0 && j_ == 0 /// since the defaults are "lost", we have to pass *something* even for nullary /// metafunction classes na #else BOOST_PP_COMMA_IF(BOOST_PP_AND(i_, j_)) BOOST_MPL_PP_ENUM(j_, na) #endif > type; }; #endif # undef j_ #endif // BOOST_PP_ITERATION_DEPTH() #endif // BOOST_PP_IS_ITERATING madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/find_if.hpp0000644000000000000000000000007412717644140017725 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/find_if.hpp0000664000372100037210000000242612717644140020560 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_FIND_IF_HPP_INCLUDED #define BOOST_MPL_FIND_IF_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: find_if.hpp 49274 2008-10-11 07:22:05Z agurtovoy $ // $Date: 2008-10-11 00:22:05 -0700 (Sat, 11 Oct 2008) $ // $Revision: 49274 $ #include #include #include #include #include #include namespace boost { namespace mpl { BOOST_MPL_AUX_COMMON_NAME_WKND(find_if) template< typename BOOST_MPL_AUX_NA_PARAM(Sequence) , typename BOOST_MPL_AUX_NA_PARAM(Predicate) > struct find_if { typedef typename iter_fold_if< Sequence , void , mpl::arg<1> // ignore , protect< aux::find_if_pred > >::type result_; typedef typename second::type type; BOOST_MPL_AUX_LAMBDA_SUPPORT(2,find_if,(Sequence,Predicate)) }; BOOST_MPL_AUX_NA_SPEC(2,find_if) }} #endif // BOOST_MPL_FIND_IF_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/fold.hpp0000644000000000000000000000007412717644140017253 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/fold.hpp0000664000372100037210000000240012717644140020076 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_FOLD_HPP_INCLUDED #define BOOST_MPL_FOLD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // Copyright David Abrahams 2001-2002 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: fold.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include namespace boost { namespace mpl { template< typename BOOST_MPL_AUX_NA_PARAM(Sequence) , typename BOOST_MPL_AUX_NA_PARAM(State) , typename BOOST_MPL_AUX_NA_PARAM(ForwardOp) > struct fold { typedef typename aux::fold_impl< ::boost::mpl::O1_size::value , typename begin::type , typename end::type , State , ForwardOp >::state type; BOOST_MPL_AUX_LAMBDA_SUPPORT(3,fold,(Sequence,State,ForwardOp)) }; BOOST_MPL_AUX_NA_SPEC(3, fold) }} #endif // BOOST_MPL_FOLD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/pair.hpp0000644000000000000000000000007412717644140017262 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/pair.hpp0000664000372100037210000000310412717644140020107 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_PAIR_HPP_INCLUDED #define BOOST_MPL_PAIR_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: pair.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include namespace boost { namespace mpl { template< typename BOOST_MPL_AUX_NA_PARAM(T1) , typename BOOST_MPL_AUX_NA_PARAM(T2) > struct pair { typedef pair type; typedef T1 first; typedef T2 second; BOOST_MPL_AUX_LAMBDA_SUPPORT(2,pair,(T1,T2)) }; template< typename BOOST_MPL_AUX_NA_PARAM(P) > struct first { #if !defined(BOOST_MPL_CFG_MSVC_70_ETI_BUG) typedef typename P::first type; #else typedef typename aux::msvc_eti_base

::first type; #endif BOOST_MPL_AUX_LAMBDA_SUPPORT(1,first,(P)) }; template< typename BOOST_MPL_AUX_NA_PARAM(P) > struct second { #if !defined(BOOST_MPL_CFG_MSVC_70_ETI_BUG) typedef typename P::second type; #else typedef typename aux::msvc_eti_base

::second type; #endif BOOST_MPL_AUX_LAMBDA_SUPPORT(1,second,(P)) }; BOOST_MPL_AUX_NA_SPEC_NO_ETI(2, pair) BOOST_MPL_AUX_NA_SPEC(1, first) BOOST_MPL_AUX_NA_SPEC(1, second) }} #endif // BOOST_MPL_PAIR_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/front_fwd.hpp0000644000000000000000000000007412717644140020317 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/front_fwd.hpp0000664000372100037210000000122112717644140021142 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_FRONT_FWD_HPP_INCLUDED #define BOOST_MPL_FRONT_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: front_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ namespace boost { namespace mpl { template< typename Tag > struct front_impl; template< typename Sequence > struct front; }} #endif // BOOST_MPL_FRONT_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/find.hpp0000644000000000000000000000007412717644140017247 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/find.hpp0000664000372100037210000000166012717644140020101 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_FIND_HPP_INCLUDED #define BOOST_MPL_FIND_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2002 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: find.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include namespace boost { namespace mpl { template< typename BOOST_MPL_AUX_NA_PARAM(Sequence) , typename BOOST_MPL_AUX_NA_PARAM(T) > struct find : find_if< Sequence,same_as > { BOOST_MPL_AUX_LAMBDA_SUPPORT(2,find,(Sequence,T)) }; BOOST_MPL_AUX_NA_SPEC(2, find) }} #endif // BOOST_MPL_FIND_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/O1_size_fwd.hpp0000644000000000000000000000007412717644140020500 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/O1_size_fwd.hpp0000664000372100037210000000123512717644140021330 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_O1_SIZE_FWD_HPP_INCLUDED #define BOOST_MPL_O1_SIZE_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: O1_size_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ namespace boost { namespace mpl { template< typename Tag > struct O1_size_impl; template< typename Sequence > struct O1_size; }} #endif // BOOST_MPL_O1_SIZE_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/identity.hpp0000644000000000000000000000007412717644140020160 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/identity.hpp0000664000372100037210000000204212717644140021005 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_IDENTITY_HPP_INCLUDED #define BOOST_MPL_IDENTITY_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: identity.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include namespace boost { namespace mpl { template< typename BOOST_MPL_AUX_NA_PARAM(T) > struct identity { typedef T type; BOOST_MPL_AUX_LAMBDA_SUPPORT(1, identity, (T)) }; template< typename BOOST_MPL_AUX_NA_PARAM(T) > struct make_identity { typedef identity type; BOOST_MPL_AUX_LAMBDA_SUPPORT(1, make_identity, (T)) }; BOOST_MPL_AUX_NA_SPEC_NO_ETI(1, identity) BOOST_MPL_AUX_NA_SPEC_NO_ETI(1, make_identity) }} #endif // BOOST_MPL_IDENTITY_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/apply.hpp0000644000000000000000000000007412717644140017454 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/apply.hpp0000664000372100037210000001405712717644140020312 0ustar00fransfrans00000000000000 #if !defined(BOOST_PP_IS_ITERATING) ///// header body #ifndef BOOST_MPL_APPLY_HPP_INCLUDED #define BOOST_MPL_APPLY_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: apply.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include # include # include # include # include # include #endif #include #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # define BOOST_MPL_PREPROCESSED_HEADER apply.hpp # include #else # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include namespace boost { namespace mpl { // local macros, #undef-ined at the end of the header # define AUX778076_APPLY_PARAMS(param) \ BOOST_MPL_PP_PARAMS( \ BOOST_MPL_LIMIT_METAFUNCTION_ARITY \ , param \ ) \ /**/ # define AUX778076_APPLY_DEF_PARAMS(param, value) \ BOOST_MPL_PP_DEFAULT_PARAMS( \ BOOST_MPL_LIMIT_METAFUNCTION_ARITY \ , param \ , value \ ) \ /**/ # define AUX778076_APPLY_N_PARAMS(n, param) \ BOOST_MPL_PP_PARAMS(n, param) \ /**/ # define AUX778076_APPLY_N_COMMA_PARAMS(n, param) \ BOOST_PP_COMMA_IF(n) \ BOOST_MPL_PP_PARAMS(n, param) \ /**/ # define AUX778076_APPLY_N_PARTIAL_SPEC_PARAMS(n, param, def) \ BOOST_PP_COMMA_IF(n) \ BOOST_MPL_PP_PARTIAL_SPEC_PARAMS(n, param, def) \ /**/ # define AUX778076_APPLY_N_SPEC_PARAMS(n, param) \ BOOST_MPL_PP_ENUM(BOOST_PP_INC(n), param) \ /**/ #define BOOST_PP_ITERATION_PARAMS_1 \ (3,(0, BOOST_MPL_LIMIT_METAFUNCTION_ARITY, )) #include BOOST_PP_ITERATE() # if !defined(BOOST_MPL_CFG_NO_APPLY_TEMPLATE) // real C++ version is already taken care of # if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) namespace aux { // apply_count_args #define AUX778076_COUNT_ARGS_PREFIX apply #define AUX778076_COUNT_ARGS_DEFAULT na #define AUX778076_COUNT_ARGS_ARITY BOOST_MPL_LIMIT_METAFUNCTION_ARITY #include } template< typename F, AUX778076_APPLY_DEF_PARAMS(typename T, na) > struct apply : aux::apply_chooser< aux::apply_count_args< AUX778076_APPLY_PARAMS(T) >::value >::template result_< F, AUX778076_APPLY_PARAMS(T) >::type { }; # endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION # endif // BOOST_MPL_CFG_NO_APPLY_TEMPLATE # undef AUX778076_APPLY_N_SPEC_PARAMS # undef AUX778076_APPLY_N_PARTIAL_SPEC_PARAMS # undef AUX778076_APPLY_N_COMMA_PARAMS # undef AUX778076_APPLY_N_PARAMS # undef AUX778076_APPLY_DEF_PARAMS # undef AUX778076_APPLY_PARAMS }} #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #endif // BOOST_MPL_APPLY_HPP_INCLUDED ///// iteration, depth == 1 // For gcc 4.4 compatability, we must include the // BOOST_PP_ITERATION_DEPTH test inside an #else clause. #else // BOOST_PP_IS_ITERATING #if BOOST_PP_ITERATION_DEPTH() == 1 # define i_ BOOST_PP_FRAME_ITERATION(1) template< typename F AUX778076_APPLY_N_COMMA_PARAMS(i_, typename T) > struct BOOST_PP_CAT(apply,i_) #if !BOOST_WORKAROUND(BOOST_MSVC, < 1300) : BOOST_PP_CAT(apply_wrap,i_)< typename lambda::type AUX778076_APPLY_N_COMMA_PARAMS(i_, T) > { #else { typedef typename BOOST_PP_CAT(apply_wrap,i_)< typename lambda::type AUX778076_APPLY_N_COMMA_PARAMS(i_, T) >::type type; #endif BOOST_MPL_AUX_LAMBDA_SUPPORT( BOOST_PP_INC(i_) , BOOST_PP_CAT(apply,i_) , (F AUX778076_APPLY_N_COMMA_PARAMS(i_,T)) ) }; #if defined(BOOST_MPL_CFG_MSVC_ETI_BUG) /// workaround for ETI bug template<> struct BOOST_PP_CAT(apply,i_) { typedef int type; }; #endif # if !defined(BOOST_MPL_CFG_NO_APPLY_TEMPLATE) # if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) #if i_ == BOOST_MPL_LIMIT_METAFUNCTION_ARITY /// primary template (not a specialization!) template< typename F AUX778076_APPLY_N_COMMA_PARAMS(i_, typename T) > struct apply : BOOST_PP_CAT(apply,i_)< F AUX778076_APPLY_N_COMMA_PARAMS(i_, T) > { }; #else template< typename F AUX778076_APPLY_N_COMMA_PARAMS(i_, typename T) > struct apply< F AUX778076_APPLY_N_PARTIAL_SPEC_PARAMS(i_, T, na) > : BOOST_PP_CAT(apply,i_)< F AUX778076_APPLY_N_COMMA_PARAMS(i_, T) > { }; #endif # else // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION #if !defined(BOOST_MPL_CFG_NO_APPLY_TEMPLATE) namespace aux { template<> struct apply_chooser { template< typename F, AUX778076_APPLY_PARAMS(typename T) > struct result_ { typedef BOOST_PP_CAT(apply,i_)< F AUX778076_APPLY_N_COMMA_PARAMS(i_, T) > type; }; }; } // namespace aux #endif # endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION # endif // BOOST_MPL_CFG_NO_APPLY_TEMPLATE # undef i_ #endif // BOOST_PP_ITERATION_DEPTH() #endif // BOOST_PP_IS_ITERATING madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/back_fwd.hpp0000644000000000000000000000007412717644140020067 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/back_fwd.hpp0000664000372100037210000000121312717644140020713 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_BACK_FWD_HPP_INCLUDED #define BOOST_MPL_BACK_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: back_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ namespace boost { namespace mpl { template< typename Tag > struct back_impl; template< typename Sequence > struct back; }} #endif // BOOST_MPL_BACK_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/quote.hpp0000644000000000000000000000007412717644140017464 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/quote.hpp0000664000372100037210000000723212717644140020317 0ustar00fransfrans00000000000000 #if !defined(BOOST_PP_IS_ITERATING) ///// header body #ifndef BOOST_MPL_QUOTE_HPP_INCLUDED #define BOOST_MPL_QUOTE_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2008 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: quote.hpp 49272 2008-10-11 06:50:46Z agurtovoy $ // $Date: 2008-10-10 23:50:46 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49272 $ #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include # include #endif #include #include #if defined(BOOST_MPL_CFG_NO_TEMPLATE_TEMPLATE_PARAMETERS) \ && !defined(BOOST_MPL_CFG_BCC590_WORKAROUNDS) # define BOOST_MPL_CFG_NO_QUOTE_TEMPLATE #endif #if !defined(BOOST_MPL_CFG_NO_IMPLICIT_METAFUNCTIONS) \ && defined(BOOST_MPL_CFG_NO_HAS_XXX) # define BOOST_MPL_CFG_NO_IMPLICIT_METAFUNCTIONS #endif #include #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # define BOOST_MPL_PREPROCESSED_HEADER quote.hpp # include #else # include # include # include # include # include # include #if !defined(BOOST_MPL_CFG_NO_QUOTE_TEMPLATE) namespace boost { namespace mpl { #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template< typename T, bool has_type_ > struct quote_impl // GCC has a problem with metafunction forwarding when T is a // specialization of a template called 'type'. # if BOOST_WORKAROUND(__GNUC__, BOOST_TESTED_AT(4)) \ && BOOST_WORKAROUND(__GNUC_MINOR__, BOOST_TESTED_AT(0)) \ && BOOST_WORKAROUND(__GNUC_PATCHLEVEL__, BOOST_TESTED_AT(2)) { typedef typename T::type type; }; # else : T { }; # endif template< typename T > struct quote_impl { typedef T type; }; #else // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION template< bool > struct quote_impl { template< typename T > struct result_ : T { }; }; template<> struct quote_impl { template< typename T > struct result_ { typedef T type; }; }; #endif #define BOOST_PP_ITERATION_PARAMS_1 \ (3,(1, BOOST_MPL_LIMIT_METAFUNCTION_ARITY, )) #include BOOST_PP_ITERATE() }} #endif // BOOST_MPL_CFG_NO_QUOTE_TEMPLATE #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #endif // BOOST_MPL_QUOTE_HPP_INCLUDED ///// iteration #else #define i_ BOOST_PP_FRAME_ITERATION(1) template< template< BOOST_MPL_PP_PARAMS(i_, typename P) > class F , typename Tag = void_ > struct BOOST_PP_CAT(quote,i_) { template< BOOST_MPL_PP_PARAMS(i_, typename U) > struct apply #if defined(BOOST_MPL_CFG_BCC590_WORKAROUNDS) { typedef typename quote_impl< F< BOOST_MPL_PP_PARAMS(i_, U) > , aux::has_type< F< BOOST_MPL_PP_PARAMS(i_, U) > >::value >::type type; }; #elif !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) : quote_impl< F< BOOST_MPL_PP_PARAMS(i_, U) > , aux::has_type< F< BOOST_MPL_PP_PARAMS(i_, U) > >::value > { }; #else : quote_impl< aux::has_type< F< BOOST_MPL_PP_PARAMS(i_, U) > >::value > ::template result_< F< BOOST_MPL_PP_PARAMS(i_, U) > > { }; #endif }; #undef i_ #endif // BOOST_PP_IS_ITERATING madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/eval_if.hpp0000644000000000000000000000007412717644140017734 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/eval_if.hpp0000664000372100037210000000351012717644140020562 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_EVAL_IF_HPP_INCLUDED #define BOOST_MPL_EVAL_IF_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: eval_if.hpp 61921 2010-05-11 21:33:24Z neilgroves $ // $Date: 2010-05-11 14:33:24 -0700 (Tue, 11 May 2010) $ // $Revision: 61921 $ #include #include #include #include #include #include namespace boost { namespace mpl { template< typename BOOST_MPL_AUX_NA_PARAM(C) , typename BOOST_MPL_AUX_NA_PARAM(F1) , typename BOOST_MPL_AUX_NA_PARAM(F2) > struct eval_if #if BOOST_WORKAROUND(BOOST_MSVC, <= 1300) \ || ( BOOST_WORKAROUND(BOOST_MPL_CFG_GCC, >= 0x0300) \ && BOOST_WORKAROUND(BOOST_MPL_CFG_GCC, BOOST_TESTED_AT(0x0304)) \ ) { typedef typename if_::type f_; typedef typename f_::type type; #else : if_::type { #endif BOOST_MPL_AUX_LAMBDA_SUPPORT(3,eval_if,(C,F1,F2)) }; // (almost) copy & paste in order to save one more // recursively nested template instantiation to user template< bool C , typename F1 , typename F2 > struct eval_if_c #if BOOST_WORKAROUND(BOOST_MSVC, <= 1300) \ || ( BOOST_WORKAROUND(BOOST_MPL_CFG_GCC, >= 0x0300) \ && BOOST_WORKAROUND(BOOST_MPL_CFG_GCC, BOOST_TESTED_AT(0x0304)) \ ) { typedef typename if_c::type f_; typedef typename f_::type type; #else : if_c::type { #endif }; BOOST_MPL_AUX_NA_SPEC(3, eval_if) }} #endif // BOOST_MPL_EVAL_IF_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/begin_end_fwd.hpp0000644000000000000000000000007412717644140021101 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/begin_end_fwd.hpp0000664000372100037210000000136612717644140021736 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_BEGIN_END_FWD_HPP_INCLUDED #define BOOST_MPL_BEGIN_END_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: begin_end_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ namespace boost { namespace mpl { template< typename Tag > struct begin_impl; template< typename Tag > struct end_impl; template< typename Sequence > struct begin; template< typename Sequence > struct end; }} #endif // BOOST_MPL_BEGIN_END_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/sequence_tag_fwd.hpp0000644000000000000000000000007412717644140021632 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/sequence_tag_fwd.hpp0000664000372100037210000000127712717644140022470 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_SEQUENCE_TAG_FWD_HPP_INCLUDED #define BOOST_MPL_SEQUENCE_TAG_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: sequence_tag_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ namespace boost { namespace mpl { struct nested_begin_end_tag; struct non_sequence_tag; template< typename Sequence > struct sequence_tag; }} #endif // BOOST_MPL_SEQUENCE_TAG_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/assert.hpp0000644000000000000000000000007412717644140017630 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/assert.hpp0000664000372100037210000003352612717644140020470 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_ASSERT_HPP_INCLUDED #define BOOST_MPL_ASSERT_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2006 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: assert.hpp 86514 2013-10-29 13:15:03Z bemandawes $ // $Date: 2013-10-29 06:15:03 -0700 (Tue, 29 Oct 2013) $ // $Revision: 86514 $ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include // make sure 'size_t' is placed into 'std' #include #if BOOST_WORKAROUND(BOOST_MSVC, == 1700) #include #endif #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x610)) \ || (BOOST_MPL_CFG_GCC != 0) \ || BOOST_WORKAROUND(__IBMCPP__, <= 600) # define BOOST_MPL_CFG_ASSERT_USE_RELATION_NAMES #endif #if BOOST_WORKAROUND(__MWERKS__, < 0x3202) \ || BOOST_WORKAROUND(__EDG_VERSION__, <= 238) \ || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x610)) \ || BOOST_WORKAROUND(__DMC__, BOOST_TESTED_AT(0x840)) # define BOOST_MPL_CFG_ASSERT_BROKEN_POINTER_TO_POINTER_TO_MEMBER #endif // agurt, 10/nov/06: use enums for Borland (which cannot cope with static constants) // and GCC (which issues "unused variable" warnings when static constants are used // at a function scope) #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x610)) \ || (BOOST_MPL_CFG_GCC != 0) # define BOOST_MPL_AUX_ASSERT_CONSTANT(T, expr) enum { expr } #else # define BOOST_MPL_AUX_ASSERT_CONSTANT(T, expr) BOOST_STATIC_CONSTANT(T, expr) #endif BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN struct failed {}; // agurt, 24/aug/04: MSVC 7.1 workaround here and below: return/accept // 'assert' by reference; can't apply it unconditionally -- apparently it // degrades the quality of GCC diagnostics #if BOOST_WORKAROUND(BOOST_MSVC, == 1310) # define AUX778076_ASSERT_ARG(x) x& #else # define AUX778076_ASSERT_ARG(x) x #endif template< bool C > struct assert { typedef void* type; }; template<> struct assert { typedef AUX778076_ASSERT_ARG(assert) type; }; template< bool C > int assertion_failed( typename assert::type ); template< bool C > struct assertion { static int failed( assert ); }; template<> struct assertion { static int failed( void* ); }; struct assert_ { #if !defined(BOOST_MPL_CFG_NO_DEFAULT_PARAMETERS_IN_NESTED_TEMPLATES) template< typename T1, typename T2 = na, typename T3 = na, typename T4 = na > struct types {}; #endif static assert_ const arg; enum relations { equal = 1, not_equal, greater, greater_equal, less, less_equal }; }; #if !defined(BOOST_MPL_CFG_ASSERT_USE_RELATION_NAMES) bool operator==( failed, failed ); bool operator!=( failed, failed ); bool operator>( failed, failed ); bool operator>=( failed, failed ); bool operator<( failed, failed ); bool operator<=( failed, failed ); #if defined(__EDG_VERSION__) template< bool (*)(failed, failed), long x, long y > struct assert_relation {}; # define BOOST_MPL_AUX_ASSERT_RELATION(x, y, r) assert_relation #else template< BOOST_MPL_AUX_NTTP_DECL(long, x), BOOST_MPL_AUX_NTTP_DECL(long, y), bool (*)(failed, failed) > struct assert_relation {}; # define BOOST_MPL_AUX_ASSERT_RELATION(x, y, r) assert_relation #endif #else // BOOST_MPL_CFG_ASSERT_USE_RELATION_NAMES boost::mpl::aux::weighted_tag<1>::type operator==( assert_, assert_ ); boost::mpl::aux::weighted_tag<2>::type operator!=( assert_, assert_ ); boost::mpl::aux::weighted_tag<3>::type operator>( assert_, assert_ ); boost::mpl::aux::weighted_tag<4>::type operator>=( assert_, assert_ ); boost::mpl::aux::weighted_tag<5>::type operator<( assert_, assert_ ); boost::mpl::aux::weighted_tag<6>::type operator<=( assert_, assert_ ); template< assert_::relations r, long x, long y > struct assert_relation {}; #endif #if BOOST_WORKAROUND(BOOST_MSVC, == 1700) template struct extract_assert_pred; template struct extract_assert_pred { typedef Pred type; }; template struct eval_assert { typedef typename extract_assert_pred::type P; typedef typename P::type p_type; typedef typename ::boost::mpl::if_c), failed ************ P::************ >::type type; }; template struct eval_assert_not { typedef typename extract_assert_pred::type P; typedef typename P::type p_type; typedef typename ::boost::mpl::if_c), failed ************ ::boost::mpl::not_

::************ >::type type; }; template< typename T > T make_assert_arg(); #elif !defined(BOOST_MPL_CFG_ASSERT_BROKEN_POINTER_TO_POINTER_TO_MEMBER) template< bool > struct assert_arg_pred_impl { typedef int type; }; template<> struct assert_arg_pred_impl { typedef void* type; }; template< typename P > struct assert_arg_pred { typedef typename P::type p_type; typedef typename assert_arg_pred_impl< p_type::value >::type type; }; template< typename P > struct assert_arg_pred_not { typedef typename P::type p_type; BOOST_MPL_AUX_ASSERT_CONSTANT( bool, p = !p_type::value ); typedef typename assert_arg_pred_impl

::type type; }; template< typename Pred > failed ************ (Pred::************ assert_arg( void (*)(Pred), typename assert_arg_pred::type ) ); template< typename Pred > failed ************ (boost::mpl::not_::************ assert_not_arg( void (*)(Pred), typename assert_arg_pred_not::type ) ); template< typename Pred > AUX778076_ASSERT_ARG(assert) assert_arg( void (*)(Pred), typename assert_arg_pred_not::type ); template< typename Pred > AUX778076_ASSERT_ARG(assert) assert_not_arg( void (*)(Pred), typename assert_arg_pred::type ); #else // BOOST_MPL_CFG_ASSERT_BROKEN_POINTER_TO_POINTER_TO_MEMBER template< bool c, typename Pred > struct assert_arg_type_impl { typedef failed ************ Pred::* mwcw83_wknd; typedef mwcw83_wknd ************* type; }; template< typename Pred > struct assert_arg_type_impl { typedef AUX778076_ASSERT_ARG(assert) type; }; template< typename Pred > struct assert_arg_type : assert_arg_type_impl< BOOST_MPL_AUX_VALUE_WKND(BOOST_MPL_AUX_NESTED_TYPE_WKND(Pred))::value, Pred > { }; template< typename Pred > typename assert_arg_type::type assert_arg(void (*)(Pred), int); template< typename Pred > typename assert_arg_type< boost::mpl::not_ >::type assert_not_arg(void (*)(Pred), int); # if !defined(BOOST_MPL_CFG_ASSERT_USE_RELATION_NAMES) template< long x, long y, bool (*r)(failed, failed) > typename assert_arg_type_impl< false,BOOST_MPL_AUX_ASSERT_RELATION(x,y,r) >::type assert_rel_arg( BOOST_MPL_AUX_ASSERT_RELATION(x,y,r) ); # else template< assert_::relations r, long x, long y > typename assert_arg_type_impl< false,assert_relation >::type assert_rel_arg( assert_relation ); # endif #endif // BOOST_MPL_CFG_ASSERT_BROKEN_POINTER_TO_POINTER_TO_MEMBER #undef AUX778076_ASSERT_ARG BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE #if BOOST_WORKAROUND(BOOST_MSVC, == 1700) // BOOST_MPL_ASSERT((pred)) #define BOOST_MPL_ASSERT(pred) \ BOOST_MPL_AUX_ASSERT_CONSTANT( \ std::size_t \ , BOOST_PP_CAT(mpl_assertion_in_line_,BOOST_MPL_AUX_PP_COUNTER()) = sizeof( \ boost::mpl::assertion_failed( \ boost::mpl::make_assert_arg< \ typename boost::mpl::eval_assert::type \ >() \ ) \ ) \ ) \ /**/ // BOOST_MPL_ASSERT_NOT((pred)) #define BOOST_MPL_ASSERT_NOT(pred) \ BOOST_MPL_AUX_ASSERT_CONSTANT( \ std::size_t \ , BOOST_PP_CAT(mpl_assertion_in_line_,BOOST_MPL_AUX_PP_COUNTER()) = sizeof( \ boost::mpl::assertion_failed( \ boost::mpl::make_assert_arg< \ typename boost::mpl::eval_assert_not::type \ >() \ ) \ ) \ ) \ /**/ #else // BOOST_MPL_ASSERT((pred)) #define BOOST_MPL_ASSERT(pred) \ BOOST_MPL_AUX_ASSERT_CONSTANT( \ std::size_t \ , BOOST_PP_CAT(mpl_assertion_in_line_,BOOST_MPL_AUX_PP_COUNTER()) = sizeof( \ boost::mpl::assertion_failed( \ boost::mpl::assert_arg( (void (*) pred)0, 1 ) \ ) \ ) \ ) \ /**/ // BOOST_MPL_ASSERT_NOT((pred)) #if BOOST_WORKAROUND(BOOST_MSVC, <= 1300) # define BOOST_MPL_ASSERT_NOT(pred) \ enum { \ BOOST_PP_CAT(mpl_assertion_in_line_,BOOST_MPL_AUX_PP_COUNTER()) = sizeof( \ boost::mpl::assertion::failed( \ boost::mpl::assert_not_arg( (void (*) pred)0, 1 ) \ ) \ ) \ }\ /**/ #else # define BOOST_MPL_ASSERT_NOT(pred) \ BOOST_MPL_AUX_ASSERT_CONSTANT( \ std::size_t \ , BOOST_PP_CAT(mpl_assertion_in_line_,BOOST_MPL_AUX_PP_COUNTER()) = sizeof( \ boost::mpl::assertion_failed( \ boost::mpl::assert_not_arg( (void (*) pred)0, 1 ) \ ) \ ) \ ) \ /**/ #endif #endif // BOOST_MPL_ASSERT_RELATION(x, ==|!=|<=|<|>=|>, y) #if defined(BOOST_MPL_CFG_ASSERT_USE_RELATION_NAMES) # if !defined(BOOST_MPL_CFG_ASSERT_BROKEN_POINTER_TO_POINTER_TO_MEMBER) // agurt, 9/nov/06: 'enum' below is a workaround for gcc 4.0.4/4.1.1 bugs #29522 and #29518 # define BOOST_MPL_ASSERT_RELATION_IMPL(counter, x, rel, y) \ enum { BOOST_PP_CAT(mpl_assert_rel_value,counter) = (x rel y) }; \ BOOST_MPL_AUX_ASSERT_CONSTANT( \ std::size_t \ , BOOST_PP_CAT(mpl_assertion_in_line_,counter) = sizeof( \ boost::mpl::assertion_failed( \ (boost::mpl::failed ************ ( boost::mpl::assert_relation< \ boost::mpl::assert_::relations( sizeof( \ boost::mpl::assert_::arg rel boost::mpl::assert_::arg \ ) ) \ , x \ , y \ >::************)) 0 ) \ ) \ ) \ /**/ # else # define BOOST_MPL_ASSERT_RELATION_IMPL(counter, x, rel, y) \ BOOST_MPL_AUX_ASSERT_CONSTANT( \ std::size_t \ , BOOST_PP_CAT(mpl_assert_rel,counter) = sizeof( \ boost::mpl::assert_::arg rel boost::mpl::assert_::arg \ ) \ ); \ BOOST_MPL_AUX_ASSERT_CONSTANT( bool, BOOST_PP_CAT(mpl_assert_rel_value,counter) = (x rel y) ); \ BOOST_MPL_AUX_ASSERT_CONSTANT( \ std::size_t \ , BOOST_PP_CAT(mpl_assertion_in_line_,counter) = sizeof( \ boost::mpl::assertion_failed( \ boost::mpl::assert_rel_arg( boost::mpl::assert_relation< \ boost::mpl::assert_::relations(BOOST_PP_CAT(mpl_assert_rel,counter)) \ , x \ , y \ >() ) \ ) \ ) \ ) \ /**/ # endif # define BOOST_MPL_ASSERT_RELATION(x, rel, y) \ BOOST_MPL_ASSERT_RELATION_IMPL(BOOST_MPL_AUX_PP_COUNTER(), x, rel, y) \ /**/ #else // !BOOST_MPL_CFG_ASSERT_USE_RELATION_NAMES # if defined(BOOST_MPL_CFG_ASSERT_BROKEN_POINTER_TO_POINTER_TO_MEMBER) # define BOOST_MPL_ASSERT_RELATION(x, rel, y) \ BOOST_MPL_AUX_ASSERT_CONSTANT( \ std::size_t \ , BOOST_PP_CAT(mpl_assertion_in_line_,BOOST_MPL_AUX_PP_COUNTER()) = sizeof( \ boost::mpl::assertion_failed<(x rel y)>( boost::mpl::assert_rel_arg( \ boost::mpl::BOOST_MPL_AUX_ASSERT_RELATION(x,y,(&boost::mpl::operator rel))() \ ) ) \ ) \ ) \ /**/ # else # define BOOST_MPL_ASSERT_RELATION(x, rel, y) \ BOOST_MPL_AUX_ASSERT_CONSTANT( \ std::size_t \ , BOOST_PP_CAT(mpl_assertion_in_line_,BOOST_MPL_AUX_PP_COUNTER()) = sizeof( \ boost::mpl::assertion_failed<(x rel y)>( (boost::mpl::failed ************ ( \ boost::mpl::BOOST_MPL_AUX_ASSERT_RELATION(x,y,(&boost::mpl::operator rel))::************))0 ) \ ) \ ) \ /**/ # endif #endif // BOOST_MPL_ASSERT_MSG( (pred::value), USER_PROVIDED_MESSAGE, (types) ) #if BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3202)) # define BOOST_MPL_ASSERT_MSG_IMPL( counter, c, msg, types_ ) \ struct msg; \ typedef struct BOOST_PP_CAT(msg,counter) : boost::mpl::assert_ \ { \ using boost::mpl::assert_::types; \ static boost::mpl::failed ************ (msg::************ assert_arg()) types_ \ { return 0; } \ } BOOST_PP_CAT(mpl_assert_arg,counter); \ BOOST_MPL_AUX_ASSERT_CONSTANT( \ std::size_t \ , BOOST_PP_CAT(mpl_assertion_in_line_,counter) = sizeof( \ boost::mpl::assertion<(c)>::failed( BOOST_PP_CAT(mpl_assert_arg,counter)::assert_arg() ) \ ) \ ) \ /**/ #else # define BOOST_MPL_ASSERT_MSG_IMPL( counter, c, msg, types_ ) \ struct msg; \ typedef struct BOOST_PP_CAT(msg,counter) : boost::mpl::assert_ \ { \ static boost::mpl::failed ************ (msg::************ assert_arg()) types_ \ { return 0; } \ } BOOST_PP_CAT(mpl_assert_arg,counter); \ BOOST_MPL_AUX_ASSERT_CONSTANT( \ std::size_t \ , BOOST_PP_CAT(mpl_assertion_in_line_,counter) = sizeof( \ boost::mpl::assertion_failed<(c)>( BOOST_PP_CAT(mpl_assert_arg,counter)::assert_arg() ) \ ) \ ) \ /**/ #endif #define BOOST_MPL_ASSERT_MSG( c, msg, types_ ) \ BOOST_MPL_ASSERT_MSG_IMPL( BOOST_MPL_AUX_PP_COUNTER(), c, msg, types_ ) \ /**/ #endif // BOOST_MPL_ASSERT_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/numeric_cast.hpp0000644000000000000000000000007412717644140021003 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/numeric_cast.hpp0000664000372100037210000000246212717644140021636 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_NUMERIC_CAST_HPP_INCLUDED #define BOOST_MPL_NUMERIC_CAST_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: numeric_cast.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include // agurt 21/sep/04: portability macro for the sake of MSVC 6.x-7.0; // resolves conflicts with 'boost::numeric_cast' function template. // use it in your own code _only_ if you care about compatibility with // these outdated compilers! #if BOOST_WORKAROUND(BOOST_MSVC, <= 1300) || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x570) ) # define BOOST_MPL_AUX_NUMERIC_CAST numeric_cast_ #else # define BOOST_MPL_AUX_NUMERIC_CAST numeric_cast #endif namespace boost { namespace mpl { // no default implementation; the definition is needed to make MSVC happy template< typename SourceTag, typename TargetTag > struct BOOST_MPL_AUX_NUMERIC_CAST { template< typename N > struct apply; }; }} #endif // BOOST_MPL_NUMERIC_CAST_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/contains_fwd.hpp0000644000000000000000000000007412717644140021005 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/contains_fwd.hpp0000664000372100037210000000131212717644140021631 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_CONTAINS_FWD_HPP_INCLUDED #define BOOST_MPL_CONTAINS_FWD_HPP_INCLUDED // Copyright Eric Friedman 2002 // Copyright Aleksey Gurtovoy 2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: contains_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ namespace boost { namespace mpl { template< typename Tag > struct contains_impl; template< typename Sequence, typename T > struct contains; }} #endif // BOOST_MPL_CONTAINS_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/insert_fwd.hpp0000644000000000000000000000007412717644140020473 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/insert_fwd.hpp0000664000372100037210000000126612717644140021327 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_INSERT_FWD_HPP_INCLUDED #define BOOST_MPL_INSERT_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: insert_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ namespace boost { namespace mpl { template< typename Tag > struct insert_impl; template< typename Sequence, typename Pos_or_T, typename T > struct insert; }} #endif // BOOST_MPL_INSERT_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/iterator_range.hpp0000644000000000000000000000007412717644140021334 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/iterator_range.hpp0000664000372100037210000000204012717644140022157 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_ITERATOR_RANGE_HPP_INCLUDED #define BOOST_MPL_ITERATOR_RANGE_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: iterator_range.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include namespace boost { namespace mpl { struct iterator_range_tag; template< typename BOOST_MPL_AUX_NA_PARAM(First) , typename BOOST_MPL_AUX_NA_PARAM(Last) > struct iterator_range { typedef iterator_range_tag tag; typedef iterator_range type; typedef First begin; typedef Last end; BOOST_MPL_AUX_LAMBDA_SUPPORT(2,iterator_range,(First,Last)) }; BOOST_MPL_AUX_NA_SPEC(2, iterator_range) }} #endif // BOOST_MPL_ITERATOR_RANGE_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/not.hpp0000644000000000000000000000007412717644140017127 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/not.hpp0000664000372100037210000000215312717644140017757 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_NOT_HPP_INCLUDED #define BOOST_MPL_NOT_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: not.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include namespace boost { namespace mpl { namespace aux { template< BOOST_MPL_AUX_NTTP_DECL(long, C_) > // 'long' is intentional here struct not_impl : bool_ { }; } // namespace aux template< typename BOOST_MPL_AUX_NA_PARAM(T) > struct not_ : aux::not_impl< BOOST_MPL_AUX_NESTED_TYPE_WKND(T)::value > { BOOST_MPL_AUX_LAMBDA_SUPPORT(1,not_,(T)) }; BOOST_MPL_AUX_NA_SPEC(1,not_) }} #endif // BOOST_MPL_NOT_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/at_fwd.hpp0000644000000000000000000000007412717644140017573 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/at_fwd.hpp0000664000372100037210000000121312717644140020417 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AT_FWD_HPP_INCLUDED #define BOOST_MPL_AT_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: at_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ namespace boost { namespace mpl { template< typename Tag > struct at_impl; template< typename Sequence, typename N > struct at; }} #endif // BOOST_MPL_AT_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/begin_end.hpp0000644000000000000000000000007412717644140020241 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/begin_end.hpp0000664000372100037210000000302012717644140021063 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_BEGIN_END_HPP_INCLUDED #define BOOST_MPL_BEGIN_END_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: begin_end.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include namespace boost { namespace mpl { // agurt, 13/sep/02: switched from inheritance to typedef; MSVC is more // happy this way (less ETI-related errors), and it doesn't affect // anything else template< typename BOOST_MPL_AUX_NA_PARAM(Sequence) > struct begin { typedef typename sequence_tag::type tag_; typedef typename begin_impl< tag_ > ::template apply< Sequence >::type type; BOOST_MPL_AUX_LAMBDA_SUPPORT(1,begin,(Sequence)) }; template< typename BOOST_MPL_AUX_NA_PARAM(Sequence) > struct end { typedef typename sequence_tag::type tag_; typedef typename end_impl< tag_ > ::template apply< Sequence >::type type; BOOST_MPL_AUX_LAMBDA_SUPPORT(1,end,(Sequence)) }; BOOST_MPL_AUX_NA_SPEC(1, begin) BOOST_MPL_AUX_NA_SPEC(1, end) }} #endif // BOOST_MPL_BEGIN_END_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/iter_fold_if.hpp0000644000000000000000000000007412717644140020754 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/iter_fold_if.hpp0000664000372100037210000000615712717644140021614 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_ITER_FOLD_IF_HPP_INCLUDED #define BOOST_MPL_ITER_FOLD_IF_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // Copyright Eric Friedman 2003 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: iter_fold_if.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include #include #include #include #include #include #include namespace boost { namespace mpl { namespace aux { template< typename Predicate, typename LastIterator > struct iter_fold_if_pred { template< typename State, typename Iterator > struct apply #if !defined(BOOST_MPL_CFG_NO_NESTED_FORWARDING) : and_< not_< is_same > , apply1 > { #else { typedef and_< not_< is_same > , apply1 > type; #endif }; }; } // namespace aux template< typename BOOST_MPL_AUX_NA_PARAM(Sequence) , typename BOOST_MPL_AUX_NA_PARAM(State) , typename BOOST_MPL_AUX_NA_PARAM(ForwardOp) , typename BOOST_MPL_AUX_NA_PARAM(ForwardPredicate) , typename BOOST_MPL_AUX_NA_PARAM(BackwardOp) , typename BOOST_MPL_AUX_NA_PARAM(BackwardPredicate) > struct iter_fold_if { typedef typename begin::type first_; typedef typename end::type last_; typedef typename eval_if< is_na , if_< is_na, always, always > , identity >::type backward_pred_; // cwpro8 doesn't like 'cut-off' type here (use typedef instead) #if !BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3003)) && !BOOST_WORKAROUND(__IBMCPP__, BOOST_TESTED_AT(600)) struct result_ : #else typedef #endif aux::iter_fold_if_impl< first_ , State , ForwardOp , protect< aux::iter_fold_if_pred< ForwardPredicate,last_ > > , BackwardOp , backward_pred_ > #if !BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3003)) && !BOOST_WORKAROUND(__IBMCPP__, BOOST_TESTED_AT(600)) { }; #else result_; #endif public: typedef pair< typename result_::state , typename result_::iterator > type; BOOST_MPL_AUX_LAMBDA_SUPPORT( 6 , iter_fold_if , (Sequence,State,ForwardOp,ForwardPredicate,BackwardOp,BackwardPredicate) ) }; BOOST_MPL_AUX_NA_SPEC(6, iter_fold_if) }} #endif // BOOST_MPL_ITER_FOLD_IF_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/iterator_tags.hpp0000644000000000000000000000007412717644140021176 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/iterator_tags.hpp0000664000372100037210000000155412717644140022032 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_ITERATOR_TAG_HPP_INCLUDED #define BOOST_MPL_ITERATOR_TAG_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: iterator_tags.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include namespace boost { namespace mpl { struct forward_iterator_tag : int_<0> { typedef forward_iterator_tag type; }; struct bidirectional_iterator_tag : int_<1> { typedef bidirectional_iterator_tag type; }; struct random_access_iterator_tag : int_<2> { typedef random_access_iterator_tag type; }; }} #endif // BOOST_MPL_ITERATOR_TAG_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/void_fwd.hpp0000644000000000000000000000007412717644140020130 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.093552501 madp-0.4/src/boost/boost/mpl/void_fwd.hpp0000664000372100037210000000130212717644140020753 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_VOID_FWD_HPP_INCLUDED #define BOOST_MPL_VOID_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: void_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN struct void_; BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE BOOST_MPL_AUX_ADL_BARRIER_DECL(void_) #endif // BOOST_MPL_VOID_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/arg_fwd.hpp0000644000000000000000000000007412717644140017740 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/arg_fwd.hpp0000664000372100037210000000146112717644140020571 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_ARG_FWD_HPP_INCLUDED #define BOOST_MPL_ARG_FWD_HPP_INCLUDED // Copyright Peter Dimov 2001-2002 // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: arg_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN template< BOOST_MPL_AUX_NTTP_DECL(int, N) > struct arg; BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE BOOST_MPL_AUX_ADL_BARRIER_DECL(arg) #endif // BOOST_MPL_ARG_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/pop_back_fwd.hpp0000644000000000000000000000007412717644140020745 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/pop_back_fwd.hpp0000664000372100037210000000124312717644140021574 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_POP_BACK_FWD_HPP_INCLUDED #define BOOST_MPL_POP_BACK_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: pop_back_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ namespace boost { namespace mpl { template< typename Tag > struct pop_back_impl; template< typename Sequence > struct pop_back; }} #endif // BOOST_MPL_POP_BACK_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/bool_fwd.hpp0000644000000000000000000000007412717644140020122 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/bool_fwd.hpp0000664000372100037210000000155112717644140020753 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_BOOL_FWD_HPP_INCLUDED #define BOOST_MPL_BOOL_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: bool_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN template< bool C_ > struct bool_; // shorcuts typedef bool_ true_; typedef bool_ false_; BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE BOOST_MPL_AUX_ADL_BARRIER_DECL(bool_) BOOST_MPL_AUX_ADL_BARRIER_DECL(true_) BOOST_MPL_AUX_ADL_BARRIER_DECL(false_) #endif // BOOST_MPL_BOOL_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/sequence_tag.hpp0000644000000000000000000000007412717644140020772 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/sequence_tag.hpp0000664000372100037210000000603412717644140021624 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_SEQUENCE_TAG_HPP_INCLUDED #define BOOST_MPL_SEQUENCE_TAG_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: sequence_tag.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include #include namespace boost { namespace mpl { // agurt, 27/nov/02: have to use a simplistic 'sequence_tag' implementation // on MSVC to avoid dreadful "internal structure overflow" error #if BOOST_WORKAROUND(BOOST_MSVC, < 1300) \ || defined(BOOST_MPL_CFG_NO_HAS_XXX) template< typename BOOST_MPL_AUX_NA_PARAM(Sequence) > struct sequence_tag { typedef typename Sequence::tag type; }; #elif BOOST_WORKAROUND(BOOST_MSVC, == 1300) // agurt, 07/feb/03: workaround for what seems to be MSVC 7.0-specific ETI issue namespace aux { template< bool > struct sequence_tag_impl { template< typename Sequence > struct result_ { typedef typename Sequence::tag type; }; }; template<> struct sequence_tag_impl { template< typename Sequence > struct result_ { typedef int type; }; }; } // namespace aux template< typename BOOST_MPL_AUX_NA_PARAM(Sequence) > struct sequence_tag : aux::sequence_tag_impl< !aux::is_msvc_eti_arg::value > ::template result_ { }; #else namespace aux { template< bool has_tag_, bool has_begin_ > struct sequence_tag_impl { // agurt 24/nov/02: MSVC 6.5 gets confused in 'sequence_tag_impl' // specialization below, if we name it 'result_' here template< typename Sequence > struct result2_; }; # define AUX_CLASS_SEQUENCE_TAG_SPEC(has_tag, has_begin, result_type) \ template<> struct sequence_tag_impl \ { \ template< typename Sequence > struct result2_ \ { \ typedef result_type type; \ }; \ }; \ /**/ AUX_CLASS_SEQUENCE_TAG_SPEC(true, true, typename Sequence::tag) AUX_CLASS_SEQUENCE_TAG_SPEC(true, false, typename Sequence::tag) AUX_CLASS_SEQUENCE_TAG_SPEC(false, true, nested_begin_end_tag) AUX_CLASS_SEQUENCE_TAG_SPEC(false, false, non_sequence_tag) # undef AUX_CLASS_SEQUENCE_TAG_SPEC } // namespace aux template< typename BOOST_MPL_AUX_NA_PARAM(Sequence) > struct sequence_tag : aux::sequence_tag_impl< ::boost::mpl::aux::has_tag::value , ::boost::mpl::aux::has_begin::value >::template result2_ { }; #endif // BOOST_MSVC BOOST_MPL_AUX_NA_SPEC(1, sequence_tag) }} #endif // BOOST_MPL_SEQUENCE_TAG_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/end.hpp0000644000000000000000000000007412717644140017075 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/end.hpp0000664000372100037210000000103012717644140017716 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_END_HPP_INCLUDED #define BOOST_MPL_END_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: end.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #endif // BOOST_MPL_END_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/arg.hpp0000644000000000000000000000007412717644140017100 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/arg.hpp0000664000372100037210000000636612717644140017742 0ustar00fransfrans00000000000000 #if !defined(BOOST_PP_IS_ITERATING) ///// header body #ifndef BOOST_MPL_ARG_HPP_INCLUDED #define BOOST_MPL_ARG_HPP_INCLUDED // Copyright Peter Dimov 2001-2002 // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: arg.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include # include # include # include # include #endif #include #include #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # define BOOST_MPL_PREPROCESSED_HEADER arg.hpp # include #else # include # include # include # include # include # include # include # include # include BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN // local macro, #undef-ined at the end of the header #if !defined(BOOST_MPL_CFG_NO_DEFAULT_PARAMETERS_IN_NESTED_TEMPLATES) # define AUX778076_ARG_N_DEFAULT_PARAMS(param,value) \ BOOST_MPL_PP_DEFAULT_PARAMS( \ BOOST_MPL_LIMIT_METAFUNCTION_ARITY \ , param \ , value \ ) \ /**/ #else # define AUX778076_ARG_N_DEFAULT_PARAMS(param,value) \ BOOST_MPL_PP_PARAMS( \ BOOST_MPL_LIMIT_METAFUNCTION_ARITY \ , param \ ) \ /**/ #endif #define BOOST_PP_ITERATION_PARAMS_1 \ (3,(0, BOOST_MPL_LIMIT_METAFUNCTION_ARITY, )) #include BOOST_PP_ITERATE() # undef AUX778076_ARG_N_DEFAULT_PARAMS BOOST_MPL_AUX_NONTYPE_ARITY_SPEC(1,int,arg) BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #endif // BOOST_MPL_ARG_HPP_INCLUDED ///// iteration #else #define i_ BOOST_PP_FRAME_ITERATION(1) #if i_ > 0 template<> struct arg { BOOST_STATIC_CONSTANT(int, value = i_); typedef arg next; BOOST_MPL_AUX_ARG_TYPEDEF(na, tag) BOOST_MPL_AUX_ARG_TYPEDEF(na, type) template< AUX778076_ARG_N_DEFAULT_PARAMS(typename U, na) > struct apply { typedef BOOST_PP_CAT(U,i_) type; BOOST_MPL_AUX_ASSERT_NOT_NA(type); }; }; #else template<> struct arg<-1> { BOOST_STATIC_CONSTANT(int, value = -1); BOOST_MPL_AUX_ARG_TYPEDEF(na, tag) BOOST_MPL_AUX_ARG_TYPEDEF(na, type) template< AUX778076_ARG_N_DEFAULT_PARAMS(typename U, na) > struct apply { typedef U1 type; BOOST_MPL_AUX_ASSERT_NOT_NA(type); }; }; #endif // i_ > 0 #undef i_ #endif // BOOST_PP_IS_ITERATING madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/bind.hpp0000644000000000000000000000007412717644140017243 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/bind.hpp0000664000372100037210000003531612717644140020102 0ustar00fransfrans00000000000000 #if !defined(BOOST_PP_IS_ITERATING) ///// header body #ifndef BOOST_MPL_BIND_HPP_INCLUDED #define BOOST_MPL_BIND_HPP_INCLUDED // Copyright Peter Dimov 2001 // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: bind.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include # include # include # include # include # include # include # include # include # include # if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) # include # endif #endif #include #include #include #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # if defined(BOOST_MPL_CFG_NO_UNNAMED_PLACEHOLDER_SUPPORT) # define BOOST_MPL_PREPROCESSED_HEADER basic_bind.hpp # else # define BOOST_MPL_PREPROCESSED_HEADER bind.hpp # endif # include #else # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include namespace boost { namespace mpl { // local macros, #undef-ined at the end of the header # define AUX778076_APPLY \ BOOST_PP_CAT(apply_wrap,BOOST_MPL_LIMIT_METAFUNCTION_ARITY) \ /**/ # if defined(BOOST_MPL_CFG_DMC_AMBIGUOUS_CTPS) # define AUX778076_DMC_PARAM() , int dummy_ # else # define AUX778076_DMC_PARAM() # endif # define AUX778076_BIND_PARAMS(param) \ BOOST_MPL_PP_PARAMS( \ BOOST_MPL_LIMIT_METAFUNCTION_ARITY \ , param \ ) \ /**/ # define AUX778076_BIND_DEFAULT_PARAMS(param, value) \ BOOST_MPL_PP_DEFAULT_PARAMS( \ BOOST_MPL_LIMIT_METAFUNCTION_ARITY \ , param \ , value \ ) \ /**/ # define AUX778076_BIND_N_PARAMS(n, param) \ BOOST_PP_COMMA_IF(n) BOOST_MPL_PP_PARAMS(n, param) \ /**/ # define AUX778076_BIND_N_SPEC_PARAMS(n, param, def) \ BOOST_PP_COMMA_IF(n) \ BOOST_MPL_PP_PARTIAL_SPEC_PARAMS(n, param, def) \ /**/ #if !defined(BOOST_MPL_CFG_NO_DEFAULT_PARAMETERS_IN_NESTED_TEMPLATES) # define AUX778076_BIND_NESTED_DEFAULT_PARAMS(param, value) \ AUX778076_BIND_DEFAULT_PARAMS(param, value) \ /**/ #else # define AUX778076_BIND_NESTED_DEFAULT_PARAMS(param, value) \ AUX778076_BIND_PARAMS(param) \ /**/ #endif namespace aux { #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template< typename T, AUX778076_BIND_PARAMS(typename U) > struct resolve_bind_arg { typedef T type; }; # if !defined(BOOST_MPL_CFG_NO_UNNAMED_PLACEHOLDER_SUPPORT) template< typename T , typename Arg > struct replace_unnamed_arg { typedef Arg next; typedef T type; }; template< typename Arg > struct replace_unnamed_arg< arg<-1>,Arg > { typedef typename Arg::next next; typedef Arg type; }; # endif // BOOST_MPL_CFG_NO_UNNAMED_PLACEHOLDER_SUPPORT template< BOOST_MPL_AUX_NTTP_DECL(int, N), AUX778076_BIND_PARAMS(typename U) > struct resolve_bind_arg< arg,AUX778076_BIND_PARAMS(U) > { typedef typename AUX778076_APPLY, AUX778076_BIND_PARAMS(U)>::type type; }; #if !defined(BOOST_MPL_CFG_NO_BIND_TEMPLATE) template< typename F, AUX778076_BIND_PARAMS(typename T), AUX778076_BIND_PARAMS(typename U) > struct resolve_bind_arg< bind,AUX778076_BIND_PARAMS(U) > { typedef bind f_; typedef typename AUX778076_APPLY::type type; }; #endif #else // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION // agurt, 15/jan/02: it's not a intended to be used as a function class, and // MSVC6.5 has problems with 'apply' name here (the code compiles, but doesn't // work), so I went with the 'result_' here, and in all other similar cases template< bool > struct resolve_arg_impl { template< typename T, AUX778076_BIND_PARAMS(typename U) > struct result_ { typedef T type; }; }; template<> struct resolve_arg_impl { template< typename T, AUX778076_BIND_PARAMS(typename U) > struct result_ { typedef typename AUX778076_APPLY< T , AUX778076_BIND_PARAMS(U) >::type type; }; }; // for 'resolve_bind_arg' template< typename T > struct is_bind_template; template< typename T, AUX778076_BIND_PARAMS(typename U) > struct resolve_bind_arg : resolve_arg_impl< is_bind_template::value > ::template result_< T,AUX778076_BIND_PARAMS(U) > { }; # if !defined(BOOST_MPL_CFG_NO_UNNAMED_PLACEHOLDER_SUPPORT) template< typename T > struct replace_unnamed_arg_impl { template< typename Arg > struct result_ { typedef Arg next; typedef T type; }; }; template<> struct replace_unnamed_arg_impl< arg<-1> > { template< typename Arg > struct result_ { typedef typename next::type next; typedef Arg type; }; }; template< typename T, typename Arg > struct replace_unnamed_arg : replace_unnamed_arg_impl::template result_ { }; # endif // BOOST_MPL_CFG_NO_UNNAMED_PLACEHOLDER_SUPPORT // agurt, 10/mar/02: the forward declaration has to appear before any of // 'is_bind_helper' overloads, otherwise MSVC6.5 issues an ICE on it template< BOOST_MPL_AUX_NTTP_DECL(int, arity_) > struct bind_chooser; aux::no_tag is_bind_helper(...); template< typename T > aux::no_tag is_bind_helper(protect*); // overload for "main" form // agurt, 15/mar/02: MSVC 6.5 fails to properly resolve the overload // in case if we use 'aux::type_wrapper< bind<...> >' here, and all // 'bind' instantiations form a complete type anyway #if !defined(BOOST_MPL_CFG_NO_BIND_TEMPLATE) template< typename F, AUX778076_BIND_PARAMS(typename T) > aux::yes_tag is_bind_helper(bind*); #endif template< BOOST_MPL_AUX_NTTP_DECL(int, N) > aux::yes_tag is_bind_helper(arg*); template< bool is_ref_ = true > struct is_bind_template_impl { template< typename T > struct result_ { BOOST_STATIC_CONSTANT(bool, value = false); }; }; template<> struct is_bind_template_impl { template< typename T > struct result_ { BOOST_STATIC_CONSTANT(bool, value = sizeof(aux::is_bind_helper(static_cast(0))) == sizeof(aux::yes_tag) ); }; }; template< typename T > struct is_bind_template : is_bind_template_impl< ::boost::detail::is_reference_impl::value > ::template result_ { }; #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION } // namespace aux #define BOOST_PP_ITERATION_PARAMS_1 \ (3,(0, BOOST_MPL_LIMIT_METAFUNCTION_ARITY, )) #include BOOST_PP_ITERATE() #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \ && !defined(BOOST_MPL_CFG_NO_TEMPLATE_TEMPLATE_PARAMETERS) /// if_/eval_if specializations # define AUX778076_SPEC_NAME if_ # define BOOST_PP_ITERATION_PARAMS_1 (3,(3, 3, )) # include BOOST_PP_ITERATE() #if !defined(BOOST_MPL_CFG_DMC_AMBIGUOUS_CTPS) # define AUX778076_SPEC_NAME eval_if # define BOOST_PP_ITERATION_PARAMS_1 (3,(3, 3, )) # include BOOST_PP_ITERATE() #endif #endif // real C++ version is already taken care of #if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \ && !defined(BOOST_MPL_CFG_NO_BIND_TEMPLATE) namespace aux { // apply_count_args #define AUX778076_COUNT_ARGS_PREFIX bind #define AUX778076_COUNT_ARGS_DEFAULT na #define AUX778076_COUNT_ARGS_ARITY BOOST_MPL_LIMIT_METAFUNCTION_ARITY #include } // bind template< typename F, AUX778076_BIND_PARAMS(typename T) AUX778076_DMC_PARAM() > struct bind : aux::bind_chooser< aux::bind_count_args::value >::template result_< F,AUX778076_BIND_PARAMS(T) >::type { }; BOOST_MPL_AUX_ARITY_SPEC( BOOST_PP_INC(BOOST_MPL_LIMIT_METAFUNCTION_ARITY) , bind ) BOOST_MPL_AUX_TEMPLATE_ARITY_SPEC( BOOST_PP_INC(BOOST_MPL_LIMIT_METAFUNCTION_ARITY) , bind ) #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION # undef AUX778076_BIND_NESTED_DEFAULT_PARAMS # undef AUX778076_BIND_N_SPEC_PARAMS # undef AUX778076_BIND_N_PARAMS # undef AUX778076_BIND_DEFAULT_PARAMS # undef AUX778076_BIND_PARAMS # undef AUX778076_DMC_PARAM # undef AUX778076_APPLY }} #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #endif // BOOST_MPL_BIND_HPP_INCLUDED ///// iteration, depth == 1 // For gcc 4.4 compatability, we must include the // BOOST_PP_ITERATION_DEPTH test inside an #else clause. #else // BOOST_PP_IS_ITERATING #if BOOST_PP_ITERATION_DEPTH() == 1 # define i_ BOOST_PP_FRAME_ITERATION(1) #if defined(AUX778076_SPEC_NAME) // lazy metafunction specialization template< template< BOOST_MPL_PP_PARAMS(i_, typename T) > class F, typename Tag > struct BOOST_PP_CAT(quote,i_); template< BOOST_MPL_PP_PARAMS(i_, typename T) > struct AUX778076_SPEC_NAME; template< typename Tag AUX778076_BIND_N_PARAMS(i_, typename T) > struct BOOST_PP_CAT(bind,i_)< BOOST_PP_CAT(quote,i_) AUX778076_BIND_N_PARAMS(i_,T) > { template< AUX778076_BIND_NESTED_DEFAULT_PARAMS(typename U, na) > struct apply { private: typedef mpl::arg<1> n1; # define BOOST_PP_ITERATION_PARAMS_2 (3,(1, i_, )) # include BOOST_PP_ITERATE() typedef typename AUX778076_SPEC_NAME< typename t1::type , BOOST_MPL_PP_EXT_PARAMS(2, BOOST_PP_INC(i_), t) >::type f_; public: typedef typename f_::type type; }; }; #undef AUX778076_SPEC_NAME #else // AUX778076_SPEC_NAME template< typename F AUX778076_BIND_N_PARAMS(i_, typename T) AUX778076_DMC_PARAM() > struct BOOST_PP_CAT(bind,i_) { template< AUX778076_BIND_NESTED_DEFAULT_PARAMS(typename U, na) > struct apply { private: # if !defined(BOOST_MPL_CFG_NO_UNNAMED_PLACEHOLDER_SUPPORT) typedef aux::replace_unnamed_arg< F,mpl::arg<1> > r0; typedef typename r0::type a0; typedef typename r0::next n1; typedef typename aux::resolve_bind_arg::type f_; /// # else typedef typename aux::resolve_bind_arg::type f_; # endif // BOOST_MPL_CFG_NO_UNNAMED_PLACEHOLDER_SUPPORT # if i_ > 0 # define BOOST_PP_ITERATION_PARAMS_2 (3,(1, i_, )) # include BOOST_PP_ITERATE() # endif public: # define AUX778076_ARG(unused, i_, t) \ BOOST_PP_COMMA_IF(i_) \ typename BOOST_PP_CAT(t,BOOST_PP_INC(i_))::type \ /**/ typedef typename BOOST_PP_CAT(apply_wrap,i_)< f_ BOOST_PP_COMMA_IF(i_) BOOST_MPL_PP_REPEAT(i_, AUX778076_ARG, t) >::type type; # undef AUX778076_ARG }; }; namespace aux { #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template< typename F AUX778076_BIND_N_PARAMS(i_, typename T), AUX778076_BIND_PARAMS(typename U) > struct resolve_bind_arg< BOOST_PP_CAT(bind,i_),AUX778076_BIND_PARAMS(U) > { typedef BOOST_PP_CAT(bind,i_) f_; typedef typename AUX778076_APPLY::type type; }; #else template< typename F AUX778076_BIND_N_PARAMS(i_, typename T) > aux::yes_tag is_bind_helper(BOOST_PP_CAT(bind,i_)*); #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION } // namespace aux BOOST_MPL_AUX_ARITY_SPEC(BOOST_PP_INC(i_), BOOST_PP_CAT(bind,i_)) BOOST_MPL_AUX_TEMPLATE_ARITY_SPEC(BOOST_PP_INC(i_), BOOST_PP_CAT(bind,i_)) # if !defined(BOOST_MPL_CFG_NO_BIND_TEMPLATE) # if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) #if i_ == BOOST_MPL_LIMIT_METAFUNCTION_ARITY /// primary template (not a specialization!) template< typename F AUX778076_BIND_N_PARAMS(i_, typename T) AUX778076_DMC_PARAM() > struct bind : BOOST_PP_CAT(bind,i_) { }; #else template< typename F AUX778076_BIND_N_PARAMS(i_, typename T) AUX778076_DMC_PARAM() > struct bind< F AUX778076_BIND_N_SPEC_PARAMS(i_, T, na) > : BOOST_PP_CAT(bind,i_) { }; #endif # else // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION namespace aux { template<> struct bind_chooser { template< typename F, AUX778076_BIND_PARAMS(typename T) > struct result_ { typedef BOOST_PP_CAT(bind,i_)< F AUX778076_BIND_N_PARAMS(i_,T) > type; }; }; } // namespace aux # endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION # endif // BOOST_MPL_CFG_NO_BIND_TEMPLATE #endif // AUX778076_SPEC_NAME # undef i_ ///// iteration, depth == 2 #elif BOOST_PP_ITERATION_DEPTH() == 2 # define j_ BOOST_PP_FRAME_ITERATION(2) # if !defined(BOOST_MPL_CFG_NO_UNNAMED_PLACEHOLDER_SUPPORT) typedef aux::replace_unnamed_arg< BOOST_PP_CAT(T,j_),BOOST_PP_CAT(n,j_) > BOOST_PP_CAT(r,j_); typedef typename BOOST_PP_CAT(r,j_)::type BOOST_PP_CAT(a,j_); typedef typename BOOST_PP_CAT(r,j_)::next BOOST_PP_CAT(n,BOOST_PP_INC(j_)); typedef aux::resolve_bind_arg BOOST_PP_CAT(t,j_); /// # else typedef aux::resolve_bind_arg< BOOST_PP_CAT(T,j_),AUX778076_BIND_PARAMS(U)> BOOST_PP_CAT(t,j_); # endif # undef j_ #endif // BOOST_PP_ITERATION_DEPTH() #endif // BOOST_PP_IS_ITERATING madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/push_back_fwd.hpp0000644000000000000000000000007412717644140021126 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/push_back_fwd.hpp0000664000372100037210000000126512717644140021761 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_PUSH_BACK_FWD_HPP_INCLUDED #define BOOST_MPL_PUSH_BACK_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: push_back_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ namespace boost { namespace mpl { template< typename Tag > struct push_back_impl; template< typename Sequence, typename T > struct push_back; }} #endif // BOOST_MPL_PUSH_BACK_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/begin.hpp0000644000000000000000000000007412717644140017413 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/begin.hpp0000664000372100037210000000104012717644140020235 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_BEGIN_HPP_INCLUDED #define BOOST_MPL_BEGIN_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: begin.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #endif // BOOST_MPL_BEGIN_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/has_key.hpp0000644000000000000000000000007412717644140017752 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/has_key.hpp0000664000372100037210000000221512717644140020601 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_HAS_KEY_HPP_INCLUDED #define BOOST_MPL_HAS_KEY_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // Copyright David Abrahams 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: has_key.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include namespace boost { namespace mpl { template< typename BOOST_MPL_AUX_NA_PARAM(AssociativeSequence) , typename BOOST_MPL_AUX_NA_PARAM(Key) > struct has_key : has_key_impl< typename sequence_tag::type > ::template apply { BOOST_MPL_AUX_LAMBDA_SUPPORT(2,has_key,(AssociativeSequence,Key)) }; BOOST_MPL_AUX_NA_SPEC(2, has_key) }} #endif // BOOST_MPL_HAS_KEY_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/next_prior.hpp0000644000000000000000000000007412717644140020520 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/next_prior.hpp0000664000372100037210000000220412717644140021345 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_NEXT_PRIOR_HPP_INCLUDED #define BOOST_MPL_NEXT_PRIOR_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: next_prior.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include namespace boost { namespace mpl { BOOST_MPL_AUX_COMMON_NAME_WKND(next) BOOST_MPL_AUX_COMMON_NAME_WKND(prior) template< typename BOOST_MPL_AUX_NA_PARAM(T) > struct next { typedef typename T::next type; BOOST_MPL_AUX_LAMBDA_SUPPORT(1,next,(T)) }; template< typename BOOST_MPL_AUX_NA_PARAM(T) > struct prior { typedef typename T::prior type; BOOST_MPL_AUX_LAMBDA_SUPPORT(1,prior,(T)) }; BOOST_MPL_AUX_NA_SPEC(1, next) BOOST_MPL_AUX_NA_SPEC(1, prior) }} #endif // BOOST_MPL_NEXT_PRIOR_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/next.hpp0000644000000000000000000000007412717644140017305 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/next.hpp0000664000372100037210000000103512717644140020133 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_NEXT_HPP_INCLUDED #define BOOST_MPL_NEXT_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: next.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #endif // BOOST_MPL_NEXT_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/bool.hpp0000644000000000000000000000007412717644140017262 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/bool.hpp0000664000372100037210000000203312717644140020107 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_BOOL_HPP_INCLUDED #define BOOST_MPL_BOOL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: bool.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN template< bool C_ > struct bool_ { BOOST_STATIC_CONSTANT(bool, value = C_); typedef integral_c_tag tag; typedef bool_ type; typedef bool value_type; operator bool() const { return this->value; } }; #if !defined(BOOST_NO_INCLASS_MEMBER_INITIALIZATION) template< bool C_ > bool const bool_::value; #endif BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE #endif // BOOST_MPL_BOOL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/at.hpp0000644000000000000000000000007412717644140016733 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/at.hpp0000664000372100037210000000242612717644140017566 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AT_HPP_INCLUDED #define BOOST_MPL_AT_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: at.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include namespace boost { namespace mpl { template< typename BOOST_MPL_AUX_NA_PARAM(Sequence) , typename BOOST_MPL_AUX_NA_PARAM(N) > struct at : at_impl< typename sequence_tag::type > ::template apply< Sequence,N > { BOOST_MPL_AUX_LAMBDA_SUPPORT(2,at,(Sequence,N)) }; template< typename Sequence , BOOST_MPL_AUX_NTTP_DECL(long, N) > struct at_c : at_impl< typename sequence_tag::type > ::template apply< Sequence,mpl::long_ > { }; BOOST_MPL_AUX_NA_SPEC(2, at) }} #endif // BOOST_MPL_AT_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/minus.hpp0000644000000000000000000000007412717644140017462 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/minus.hpp0000664000372100037210000000115312717644140020311 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_MINUS_HPP_INCLUDED #define BOOST_MPL_MINUS_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: minus.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #define AUX778076_OP_NAME minus #define AUX778076_OP_TOKEN - #include #endif // BOOST_MPL_MINUS_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/reverse_iter_fold.hpp0000644000000000000000000000007412717644140022031 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/reverse_iter_fold.hpp0000664000372100037210000000311512717644140022660 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_ITER_FOLD_BACKWARD_HPP_INCLUDED #define BOOST_MPL_ITER_FOLD_BACKWARD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // Copyright Dave Abrahams 2001-2002 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: reverse_iter_fold.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include namespace boost { namespace mpl { template< typename BOOST_MPL_AUX_NA_PARAM(Sequence) , typename BOOST_MPL_AUX_NA_PARAM(State) , typename BOOST_MPL_AUX_NA_PARAM(BackwardOp) , typename ForwardOp = arg<1> > struct reverse_iter_fold { typedef typename aux::reverse_iter_fold_impl< ::boost::mpl::O1_size::value , typename begin::type , typename end::type , State , typename lambda::type , typename lambda::type >::state type; BOOST_MPL_AUX_LAMBDA_SUPPORT( 4 , reverse_iter_fold , (Sequence,State,BackwardOp,ForwardOp) ) }; BOOST_MPL_AUX_NA_SPEC(3, reverse_iter_fold) }} #endif // BOOST_MPL_ITER_FOLD_BACKWARD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/logical.hpp0000644000000000000000000000007412717644140017741 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/logical.hpp0000664000372100037210000000114012717644140020564 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_LOGICAL_HPP_INCLUDED #define BOOST_MPL_LOGICAL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: logical.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #endif // BOOST_MPL_LOGICAL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/min_max.hpp0000644000000000000000000000007412717644140017757 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/min_max.hpp0000664000372100037210000000176612717644140020620 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_MIN_MAX_HPP_INCLUDED #define BOOST_MPL_MIN_MAX_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2008 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: min_max.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include namespace boost { namespace mpl { template< typename BOOST_MPL_AUX_NA_PARAM(N1) , typename BOOST_MPL_AUX_NA_PARAM(N2) > struct min : if_< less,N1,N2 > { }; template< typename BOOST_MPL_AUX_NA_PARAM(N1) , typename BOOST_MPL_AUX_NA_PARAM(N2) > struct max : if_< less,N2,N1 > { }; BOOST_MPL_AUX_NA_SPEC(2, min) BOOST_MPL_AUX_NA_SPEC(2, max) }} #endif // BOOST_MPL_MIN_MAX_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/contains.hpp0000644000000000000000000000007412717644140020145 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/contains.hpp0000664000372100037210000000213412717644140020774 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_CONTAINS_HPP_INCLUDED #define BOOST_MPL_CONTAINS_HPP_INCLUDED // Copyright Eric Friedman 2002 // Copyright Aleksey Gurtovoy 2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: contains.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include namespace boost { namespace mpl { template< typename BOOST_MPL_AUX_NA_PARAM(Sequence) , typename BOOST_MPL_AUX_NA_PARAM(T) > struct contains : contains_impl< typename sequence_tag::type > ::template apply< Sequence,T > { BOOST_MPL_AUX_LAMBDA_SUPPORT(2,contains,(Sequence,T)) }; BOOST_MPL_AUX_NA_SPEC(2, contains) }} #endif // BOOST_MPL_CONTAINS_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/integral_c_tag.hpp0000644000000000000000000000007412717644140021271 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/integral_c_tag.hpp0000664000372100037210000000150612717644140022122 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_INTEGRAL_C_TAG_HPP_INCLUDED #define BOOST_MPL_INTEGRAL_C_TAG_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: integral_c_tag.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN struct integral_c_tag { BOOST_STATIC_CONSTANT(int, value = 0); }; BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE BOOST_MPL_AUX_ADL_BARRIER_DECL(integral_c_tag) #endif // BOOST_MPL_INTEGRAL_C_TAG_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/greater_equal.hpp0000644000000000000000000000007412717644140021147 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/greater_equal.hpp0000664000372100037210000000122412717644140021775 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_GREATER_EQUAL_HPP_INCLUDED #define BOOST_MPL_GREATER_EQUAL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: greater_equal.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #define AUX778076_OP_NAME greater_equal #define AUX778076_OP_TOKEN >= #include #endif // BOOST_MPL_GREATER_EQUAL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/empty.hpp0000644000000000000000000000007412717644140017465 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/empty.hpp0000664000372100037210000000176612717644140020326 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_EMPTY_HPP_INCLUDED #define BOOST_MPL_EMPTY_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: empty.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include namespace boost { namespace mpl { template< typename BOOST_MPL_AUX_NA_PARAM(Sequence) > struct empty : empty_impl< typename sequence_tag::type > ::template apply< Sequence > { BOOST_MPL_AUX_LAMBDA_SUPPORT(1,empty,(Sequence)) }; BOOST_MPL_AUX_NA_SPEC(1, empty) }} #endif // BOOST_MPL_EMPTY_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/lambda_fwd.hpp0000644000000000000000000000007412717644140020407 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/lambda_fwd.hpp0000664000372100037210000000243612717644140021243 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_LAMBDA_FWD_HPP_INCLUDED #define BOOST_MPL_LAMBDA_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: lambda_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #if !defined(BOOST_MPL_CFG_NO_FULL_LAMBDA_SUPPORT) # include # include # include namespace boost { namespace mpl { template< typename T = na , typename Tag = void_ BOOST_MPL_AUX_LAMBDA_ARITY_PARAM( typename Arity = int_< aux::template_arity::value > ) > struct lambda; }} #else // BOOST_MPL_CFG_NO_FULL_LAMBDA_SUPPORT # include namespace boost { namespace mpl { template< typename T = na , typename Tag = void_ , typename Protect = true_ > struct lambda; }} #endif #endif // BOOST_MPL_LAMBDA_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/is_sequence.hpp0000644000000000000000000000007412717644140020632 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/is_sequence.hpp0000664000372100037210000000530212717644140021461 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_IS_SEQUENCE_HPP_INCLUDED #define BOOST_MPL_IS_SEQUENCE_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2002-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: is_sequence.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #if BOOST_WORKAROUND(BOOST_MSVC, < 1300) # include #elif BOOST_WORKAROUND(BOOST_MSVC, == 1300) # include #endif #include namespace boost { namespace mpl { #if BOOST_WORKAROUND(BOOST_MSVC, <= 1300) namespace aux { // agurt, 11/jun/03: // MSVC 6.5/7.0 fails if 'has_begin' is instantiated on a class type that has a // 'begin' member that doesn't name a type; e.g. 'has_begin< std::vector >' // would fail; requiring 'T' to have _both_ 'tag' and 'begin' members workarounds // the issue for most real-world cases template< typename T > struct is_sequence_impl : and_< identity< aux::has_tag > , identity< aux::has_begin > > { }; } // namespace aux template< typename BOOST_MPL_AUX_NA_PARAM(T) > struct is_sequence : if_< #if BOOST_WORKAROUND(BOOST_MSVC, < 1300) aux::msvc_is_class #else boost::is_class #endif , aux::is_sequence_impl , bool_ >::type { BOOST_MPL_AUX_LAMBDA_SUPPORT(1, is_sequence, (T)) }; #elif defined(BOOST_MPL_CFG_NO_HAS_XXX) template< typename BOOST_MPL_AUX_NA_PARAM(T) > struct is_sequence : bool_ { }; #else template< typename BOOST_MPL_AUX_NA_PARAM(T) > struct is_sequence : not_< is_same< typename begin::type, void_ > > { BOOST_MPL_AUX_LAMBDA_SUPPORT(1, is_sequence, (T)) }; #endif // BOOST_MSVC #if defined(BOOST_MPL_CFG_MSVC_60_ETI_BUG) template<> struct is_sequence : bool_ { }; #endif BOOST_MPL_AUX_NA_SPEC_NO_ETI(1, is_sequence) }} #endif // BOOST_MPL_IS_SEQUENCE_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/pop_front_fwd.hpp0000644000000000000000000000007412717644140021175 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/pop_front_fwd.hpp0000664000372100037210000000125112717644140022023 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_POP_FRONT_FWD_HPP_INCLUDED #define BOOST_MPL_POP_FRONT_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: pop_front_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ namespace boost { namespace mpl { template< typename Tag > struct pop_front_impl; template< typename Sequence > struct pop_front; }} #endif // BOOST_MPL_POP_FRONT_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/integral_c.hpp0000644000000000000000000000007412717644140020436 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/integral_c.hpp0000664000372100037210000000312012717644140021261 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_INTEGRAL_C_HPP_INCLUDED #define BOOST_MPL_INTEGRAL_C_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2006 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: integral_c.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #if BOOST_WORKAROUND(__HP_aCC, <= 53800) // the type of non-type template arguments may not depend on template arguments # define AUX_WRAPPER_PARAMS(N) typename T, long N #else # define AUX_WRAPPER_PARAMS(N) typename T, T N #endif #define AUX_WRAPPER_NAME integral_c #define AUX_WRAPPER_VALUE_TYPE T #define AUX_WRAPPER_INST(value) AUX_WRAPPER_NAME< T, value > #include #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \ && !BOOST_WORKAROUND(__BORLANDC__, <= 0x551) BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN // 'bool' constant doesn't have 'next'/'prior' members template< bool C > struct integral_c { BOOST_STATIC_CONSTANT(bool, value = C); typedef integral_c_tag tag; typedef integral_c type; typedef bool value_type; operator bool() const { return this->value; } }; BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE #endif #endif // BOOST_MPL_INTEGRAL_C_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/base.hpp0000644000000000000000000000007412717644140017241 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/base.hpp0000664000372100037210000000146312717644140020074 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_BASE_HPP_INCLUDED #define BOOST_MPL_BASE_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: base.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include namespace boost { namespace mpl { template< typename BOOST_MPL_AUX_NA_PARAM(T) > struct base { typedef typename T::base type; BOOST_MPL_AUX_LAMBDA_SUPPORT(1,base,(T)) }; BOOST_MPL_AUX_NA_SPEC(1, base) }} #endif // BOOST_MPL_BASE_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/push_front_fwd.hpp0000644000000000000000000000007412717644140021356 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/push_front_fwd.hpp0000664000372100037210000000127312717644140022210 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_PUSH_FRONT_FWD_HPP_INCLUDED #define BOOST_MPL_PUSH_FRONT_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: push_front_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ namespace boost { namespace mpl { template< typename Tag > struct push_front_impl; template< typename Sequence, typename T > struct push_front; }} #endif // BOOST_MPL_PUSH_FRONT_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/clear_fwd.hpp0000644000000000000000000000007412717644140020255 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/clear_fwd.hpp0000664000372100037210000000122112717644140021100 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_CLEAR_FWD_HPP_INCLUDED #define BOOST_MPL_CLEAR_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: clear_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ namespace boost { namespace mpl { template< typename Tag > struct clear_impl; template< typename Sequence > struct clear; }} #endif // BOOST_MPL_CLEAR_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/placeholders.hpp0000644000000000000000000000007412717644140020774 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/placeholders.hpp0000664000372100037210000000500112717644140021617 0ustar00fransfrans00000000000000 #if !defined(BOOST_PP_IS_ITERATING) ///// header body #ifndef BOOST_MPL_PLACEHOLDERS_HPP_INCLUDED #define BOOST_MPL_PLACEHOLDERS_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // Copyright Peter Dimov 2001-2003 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: placeholders.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include # include # if !defined(BOOST_MPL_CFG_NO_ADL_BARRIER_NAMESPACE) # define BOOST_MPL_AUX_ARG_ADL_BARRIER_DECL(type) \ using ::BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE::type; \ /**/ # else # define BOOST_MPL_AUX_ARG_ADL_BARRIER_DECL(type) /**/ # endif #endif #include #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # define BOOST_MPL_PREPROCESSED_HEADER placeholders.hpp # include #else # include # include # include # include // watch out for GNU gettext users, who #define _(x) #if !defined(_) || defined(BOOST_MPL_CFG_NO_UNNAMED_PLACEHOLDER_SUPPORT) BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN typedef arg<-1> _; BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE namespace boost { namespace mpl { BOOST_MPL_AUX_ARG_ADL_BARRIER_DECL(_) namespace placeholders { using BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE::_; } }} #endif /// agurt, 17/mar/02: one more placeholder for the last 'apply#' /// specialization #define BOOST_PP_ITERATION_PARAMS_1 \ (3,(1, BOOST_MPL_LIMIT_METAFUNCTION_ARITY + 1, )) #include BOOST_PP_ITERATE() #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #endif // BOOST_MPL_PLACEHOLDERS_HPP_INCLUDED ///// iteration #else #define i_ BOOST_PP_FRAME_ITERATION(1) BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN typedef arg BOOST_PP_CAT(_,i_); BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE namespace boost { namespace mpl { BOOST_MPL_AUX_ARG_ADL_BARRIER_DECL(BOOST_PP_CAT(_,i_)) namespace placeholders { using BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE::BOOST_PP_CAT(_,i_); } }} #undef i_ #endif // BOOST_PP_IS_ITERATING madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/long.hpp0000644000000000000000000000007412717644140017266 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/long.hpp0000664000372100037210000000116412717644140020117 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_LONG_HPP_INCLUDED #define BOOST_MPL_LONG_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: long.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #define AUX_WRAPPER_VALUE_TYPE long #include #endif // BOOST_MPL_LONG_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/limits0000644000000000000000000000007412717644140017042 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/limits/0000775000372100037210000000000012717644140017746 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/mpl/limits/PaxHeaders.5405/arity.hpp0000644000000000000000000000007412717644140020760 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/limits/arity.hpp0000664000372100037210000000117712717644140021615 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_LIMITS_ARITY_HPP_INCLUDED #define BOOST_MPL_LIMITS_ARITY_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: arity.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if !defined(BOOST_MPL_LIMIT_METAFUNCTION_ARITY) # define BOOST_MPL_LIMIT_METAFUNCTION_ARITY 5 #endif #endif // BOOST_MPL_LIMITS_ARITY_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/limits/PaxHeaders.5405/vector.hpp0000644000000000000000000000007412717644140021132 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/limits/vector.hpp0000664000372100037210000000116612717644140021765 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_LIMITS_VECTOR_HPP_INCLUDED #define BOOST_MPL_LIMITS_VECTOR_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: vector.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if !defined(BOOST_MPL_LIMIT_VECTOR_SIZE) # define BOOST_MPL_LIMIT_VECTOR_SIZE 20 #endif #endif // BOOST_MPL_LIMITS_VECTOR_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/vector.hpp0000644000000000000000000000007412717644140017631 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/vector.hpp0000664000372100037210000000332512717644140020463 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_VECTOR_HPP_INCLUDED #define BOOST_MPL_VECTOR_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: vector.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include # include # include # include # include # include #if !defined(BOOST_NEEDS_TOKEN_PASTING_OP_FOR_TOKENS_JUXTAPOSING) # define AUX778076_VECTOR_HEADER \ BOOST_PP_CAT(vector, BOOST_MPL_LIMIT_VECTOR_SIZE).hpp \ /**/ #else # define AUX778076_VECTOR_HEADER \ BOOST_PP_CAT(vector, BOOST_MPL_LIMIT_VECTOR_SIZE)##.hpp \ /**/ #endif # include BOOST_PP_STRINGIZE(boost/mpl/vector/AUX778076_VECTOR_HEADER) # undef AUX778076_VECTOR_HEADER #endif #include #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # define BOOST_MPL_PREPROCESSED_HEADER vector.hpp # include #else # include # define AUX778076_SEQUENCE_NAME vector # define AUX778076_SEQUENCE_LIMIT BOOST_MPL_LIMIT_VECTOR_SIZE # include #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #endif // BOOST_MPL_VECTOR_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/tag.hpp0000644000000000000000000000007412717644140017102 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/tag.hpp0000664000372100037210000000214512717644140017733 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_TAG_HPP_INCLUDED #define BOOST_MPL_TAG_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: tag.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include namespace boost { namespace mpl { namespace aux { template< typename T > struct tag_impl { typedef typename T::tag type; }; } template< typename T, typename Default = void_ > struct tag #if !defined(BOOST_MPL_CFG_MSVC_ETI_BUG) : if_< aux::has_tag , aux::tag_impl , Default >::type { #else { typedef typename eval_if< aux::has_tag , aux::tag_impl , Default >::type type; #endif }; }} #endif // BOOST_MPL_TAG_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/if.hpp0000644000000000000000000000007412717644140016725 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/if.hpp0000664000372100037210000000570512717644140017563 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_IF_HPP_INCLUDED #define BOOST_MPL_IF_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: if.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include namespace boost { namespace mpl { #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template< bool C , typename T1 , typename T2 > struct if_c { typedef T1 type; }; template< typename T1 , typename T2 > struct if_c { typedef T2 type; }; // agurt, 05/sep/04: nondescriptive parameter names for the sake of DigitalMars // (and possibly MWCW < 8.0); see http://article.gmane.org/gmane.comp.lib.boost.devel/108959 template< typename BOOST_MPL_AUX_NA_PARAM(T1) , typename BOOST_MPL_AUX_NA_PARAM(T2) , typename BOOST_MPL_AUX_NA_PARAM(T3) > struct if_ { private: // agurt, 02/jan/03: two-step 'type' definition for the sake of aCC typedef if_c< #if defined(BOOST_MPL_CFG_BCC_INTEGRAL_CONSTANTS) BOOST_MPL_AUX_VALUE_WKND(T1)::value #else BOOST_MPL_AUX_STATIC_CAST(bool, BOOST_MPL_AUX_VALUE_WKND(T1)::value) #endif , T2 , T3 > almost_type_; public: typedef typename almost_type_::type type; BOOST_MPL_AUX_LAMBDA_SUPPORT(3,if_,(T1,T2,T3)) }; #else // no partial class template specialization namespace aux { template< bool C > struct if_impl { template< typename T1, typename T2 > struct result_ { typedef T1 type; }; }; template<> struct if_impl { template< typename T1, typename T2 > struct result_ { typedef T2 type; }; }; } // namespace aux template< bool C_ , typename T1 , typename T2 > struct if_c { typedef typename aux::if_impl< C_ > ::template result_::type type; }; // (almost) copy & paste in order to save one more // recursively nested template instantiation to user template< typename BOOST_MPL_AUX_NA_PARAM(C_) , typename BOOST_MPL_AUX_NA_PARAM(T1) , typename BOOST_MPL_AUX_NA_PARAM(T2) > struct if_ { enum { msvc_wknd_ = BOOST_MPL_AUX_MSVC_VALUE_WKND(C_)::value }; typedef typename aux::if_impl< BOOST_MPL_AUX_STATIC_CAST(bool, msvc_wknd_) > ::template result_::type type; BOOST_MPL_AUX_LAMBDA_SUPPORT(3,if_,(C_,T1,T2)) }; #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION BOOST_MPL_AUX_NA_SPEC(3, if_) }} #endif // BOOST_MPL_IF_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/has_key_fwd.hpp0000644000000000000000000000007412717644140020612 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/has_key_fwd.hpp0000664000372100037210000000133412717644140021442 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_HAS_KEY_FWD_HPP_INCLUDED #define BOOST_MPL_HAS_KEY_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // Copyright David Abrahams 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: has_key_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ namespace boost { namespace mpl { template< typename Tag > struct has_key_impl; template< typename AssociativeSequence, typename Key > struct has_key; }} #endif // BOOST_MPL_HAS_KEY_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/greater.hpp0000644000000000000000000000007412717644140017760 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/greater.hpp0000664000372100037210000000116512717644140020612 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_GREATER_HPP_INCLUDED #define BOOST_MPL_GREATER_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: greater.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #define AUX778076_OP_NAME greater #define AUX778076_OP_TOKEN > #include #endif // BOOST_MPL_GREATER_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/always.hpp0000644000000000000000000000007412717644140017627 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/always.hpp0000664000372100037210000000165412717644140020464 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_ALWAYS_HPP_INCLUDED #define BOOST_MPL_ALWAYS_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: always.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include namespace boost { namespace mpl { template< typename Value > struct always { template< typename T BOOST_MPL_PP_NESTED_DEF_PARAMS_TAIL(1, typename T, na) > struct apply { typedef Value type; }; }; BOOST_MPL_AUX_ARITY_SPEC(1, always) }} #endif // BOOST_MPL_ALWAYS_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/pair_view.hpp0000644000000000000000000000007412717644140020314 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/pair_view.hpp0000664000372100037210000001055712717644140021153 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_PAIR_VIEW_HPP_INCLUDED #define BOOST_MPL_PAIR_VIEW_HPP_INCLUDED // Copyright David Abrahams 2003-2004 // Copyright Aleksey Gurtovoy 2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: pair_view.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include #include #include #include #include namespace boost { namespace mpl { namespace aux { struct pair_iter_tag; #if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template< typename Iter1, typename Iter2, typename Category > struct pair_iter; template< typename Category > struct prior_pair_iter { template< typename Iter1, typename Iter2 > struct apply { typedef typename mpl::prior::type i1_; typedef typename mpl::prior::type i2_; typedef pair_iter type; }; }; template<> struct prior_pair_iter { template< typename Iter1, typename Iter2 > struct apply { typedef pair_iter type; }; }; #endif } template< typename Iter1 , typename Iter2 , typename Category > struct pair_iter { typedef aux::pair_iter_tag tag; typedef Category category; typedef Iter1 first; typedef Iter2 second; #if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) typedef pair< typename deref::type , typename deref::type > type; typedef typename mpl::next::type i1_; typedef typename mpl::next::type i2_; typedef pair_iter next; typedef apply_wrap2< aux::prior_pair_iter,Iter1,Iter2 >::type prior; #endif }; #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template< typename Iter1, typename Iter2, typename C > struct deref< pair_iter > { typedef pair< typename deref::type , typename deref::type > type; }; template< typename Iter1, typename Iter2, typename C > struct next< pair_iter > { typedef typename mpl::next::type i1_; typedef typename mpl::next::type i2_; typedef pair_iter type; }; template< typename Iter1, typename Iter2, typename C > struct prior< pair_iter > { typedef typename mpl::prior::type i1_; typedef typename mpl::prior::type i2_; typedef pair_iter type; }; #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION template<> struct advance_impl { template< typename Iter, typename D > struct apply { typedef typename mpl::advance< typename Iter::first,D >::type i1_; typedef typename mpl::advance< typename Iter::second,D >::type i2_; typedef pair_iter type; }; }; template<> struct distance_impl { template< typename Iter1, typename Iter2 > struct apply { // agurt, 10/nov/04: MSVC 6.5 ICE-s on forwarding typedef typename mpl::distance< typename first::type , typename first::type >::type type; }; }; template< typename BOOST_MPL_AUX_NA_PARAM(Sequence1) , typename BOOST_MPL_AUX_NA_PARAM(Sequence2) > struct pair_view { typedef nested_begin_end_tag tag; typedef typename begin::type iter1_; typedef typename begin::type iter2_; typedef typename min< typename iterator_category::type , typename iterator_category::type >::type category_; typedef pair_iter begin; typedef pair_iter< typename end::type , typename end::type , category_ > end; }; BOOST_MPL_AUX_NA_SPEC(2, pair_view) }} #endif // BOOST_MPL_PAIR_VIEW_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/inserter.hpp0000644000000000000000000000007412717644140020162 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/inserter.hpp0000664000372100037210000000136312717644140021014 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_INSERTER_HPP_INCLUDED #define BOOST_MPL_INSERTER_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // Copyright David Abrahams 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: inserter.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ namespace boost { namespace mpl { template< typename Sequence , typename Operation > struct inserter { typedef Sequence state; typedef Operation operation; }; }} #endif // BOOST_MPL_INSERTER_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/int.hpp0000644000000000000000000000007412717644140017121 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/int.hpp0000664000372100037210000000115612717644140017753 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_INT_HPP_INCLUDED #define BOOST_MPL_INT_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: int.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #define AUX_WRAPPER_VALUE_TYPE int #include #endif // BOOST_MPL_INT_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/front_inserter.hpp0000644000000000000000000000007412717644140021372 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/front_inserter.hpp0000664000372100037210000000144512717644140022225 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_FRONT_INSERTER_HPP_INCLUDED #define BOOST_MPL_FRONT_INSERTER_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // Copyright David Abrahams 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: front_inserter.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include namespace boost { namespace mpl { template< typename Sequence > struct front_inserter : inserter< Sequence,push_front<> > { }; }} #endif // BOOST_MPL_FRONT_INSERTER_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/has_xxx.hpp0000644000000000000000000000007412717644140020011 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/has_xxx.hpp0000664000372100037210000005255612717644140020655 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_HAS_XXX_HPP_INCLUDED #define BOOST_MPL_HAS_XXX_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2002-2006 // Copyright David Abrahams 2002-2003 // Copyright Daniel Walker 2007 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: has_xxx.hpp 64146 2010-07-19 00:46:31Z djwalker $ // $Date: 2010-07-18 17:46:31 -0700 (Sun, 18 Jul 2010) $ // $Revision: 64146 $ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #if BOOST_WORKAROUND( __BORLANDC__, BOOST_TESTED_AT(0x590) ) # include #endif #if !defined(BOOST_MPL_CFG_NO_HAS_XXX) # if BOOST_WORKAROUND(BOOST_MSVC, <= 1300) // agurt, 11/sep/02: MSVC-specific version (< 7.1), based on a USENET // newsgroup's posting by John Madsen (comp.lang.c++.moderated, // 1999-11-12 19:17:06 GMT); the code is _not_ standard-conforming, but // it works way more reliably than the SFINAE-based implementation // Modified dwa 8/Oct/02 to handle reference types. # include # include namespace boost { namespace mpl { namespace aux { struct has_xxx_tag; #if BOOST_WORKAROUND(BOOST_MSVC, == 1300) template< typename U > struct msvc_incomplete_array { typedef char (&type)[sizeof(U) + 1]; }; #endif template< typename T > struct msvc_is_incomplete { // MSVC is capable of some kinds of SFINAE. If U is an incomplete // type, it won't pick the second overload static char tester(...); #if BOOST_WORKAROUND(BOOST_MSVC, == 1300) template< typename U > static typename msvc_incomplete_array::type tester(type_wrapper); #else template< typename U > static char (& tester(type_wrapper) )[sizeof(U)+1]; #endif BOOST_STATIC_CONSTANT(bool, value = sizeof(tester(type_wrapper())) == 1 ); }; template<> struct msvc_is_incomplete { BOOST_STATIC_CONSTANT(bool, value = false); }; }}} # define BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF_(trait, name, default_) \ template< typename T, typename name = ::boost::mpl::aux::has_xxx_tag > \ struct BOOST_PP_CAT(trait,_impl) : T \ { \ static boost::mpl::aux::no_tag \ test(void(*)(::boost::mpl::aux::has_xxx_tag)); \ \ static boost::mpl::aux::yes_tag test(...); \ \ BOOST_STATIC_CONSTANT(bool, value = \ sizeof(test(static_cast(0))) \ != sizeof(boost::mpl::aux::no_tag) \ ); \ typedef boost::mpl::bool_ type; \ }; \ \ template< typename T, typename fallback_ = boost::mpl::bool_ > \ struct trait \ : boost::mpl::if_c< \ boost::mpl::aux::msvc_is_incomplete::value \ , boost::mpl::bool_ \ , BOOST_PP_CAT(trait,_impl) \ >::type \ { \ }; \ \ BOOST_MPL_AUX_HAS_XXX_TRAIT_SPEC(trait, void) \ BOOST_MPL_AUX_HAS_XXX_TRAIT_SPEC(trait, bool) \ BOOST_MPL_AUX_HAS_XXX_TRAIT_SPEC(trait, char) \ BOOST_MPL_AUX_HAS_XXX_TRAIT_SPEC(trait, signed char) \ BOOST_MPL_AUX_HAS_XXX_TRAIT_SPEC(trait, unsigned char) \ BOOST_MPL_AUX_HAS_XXX_TRAIT_SPEC(trait, signed short) \ BOOST_MPL_AUX_HAS_XXX_TRAIT_SPEC(trait, unsigned short) \ BOOST_MPL_AUX_HAS_XXX_TRAIT_SPEC(trait, signed int) \ BOOST_MPL_AUX_HAS_XXX_TRAIT_SPEC(trait, unsigned int) \ BOOST_MPL_AUX_HAS_XXX_TRAIT_SPEC(trait, signed long) \ BOOST_MPL_AUX_HAS_XXX_TRAIT_SPEC(trait, unsigned long) \ BOOST_MPL_AUX_HAS_XXX_TRAIT_SPEC(trait, float) \ BOOST_MPL_AUX_HAS_XXX_TRAIT_SPEC(trait, double) \ BOOST_MPL_AUX_HAS_XXX_TRAIT_SPEC(trait, long double) \ /**/ # define BOOST_MPL_AUX_HAS_XXX_TRAIT_SPEC(trait, T) \ template<> struct trait \ { \ BOOST_STATIC_CONSTANT(bool, value = false); \ typedef boost::mpl::bool_ type; \ }; \ /**/ #if !defined(BOOST_NO_INTRINSIC_WCHAR_T) # define BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF(trait, name, unused) \ BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF_(trait, name, unused) \ BOOST_MPL_AUX_HAS_XXX_TRAIT_SPEC(trait, wchar_t) \ /**/ #else # define BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF(trait, name, unused) \ BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF_(trait, name, unused) \ /**/ #endif // SFINAE-based implementations below are derived from a USENET newsgroup's // posting by Rani Sharoni (comp.lang.c++.moderated, 2002-03-17 07:45:09 PST) # elif BOOST_WORKAROUND(BOOST_MSVC, BOOST_TESTED_AT(1400)) \ || BOOST_WORKAROUND(__IBMCPP__, <= 700) // MSVC 7.1+ & VACPP // agurt, 15/jun/05: replace overload-based SFINAE implementation with SFINAE // applied to partial specialization to fix some apparently random failures // (thanks to Daniel Wallin for researching this!) # define BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF(trait, name, default_) \ template< typename T > \ struct BOOST_PP_CAT(trait, _msvc_sfinae_helper) \ { \ typedef void type; \ };\ \ template< typename T, typename U = void > \ struct BOOST_PP_CAT(trait,_impl_) \ { \ BOOST_STATIC_CONSTANT(bool, value = false); \ typedef boost::mpl::bool_ type; \ }; \ \ template< typename T > \ struct BOOST_PP_CAT(trait,_impl_)< \ T \ , typename BOOST_PP_CAT(trait, _msvc_sfinae_helper)< typename T::name >::type \ > \ { \ BOOST_STATIC_CONSTANT(bool, value = true); \ typedef boost::mpl::bool_ type; \ }; \ \ template< typename T, typename fallback_ = boost::mpl::bool_ > \ struct trait \ : BOOST_PP_CAT(trait,_impl_) \ { \ }; \ /**/ # elif BOOST_WORKAROUND( __BORLANDC__, BOOST_TESTED_AT(0x590) ) # define BOOST_MPL_HAS_XXX_TRAIT_NAMED_BCB_DEF(trait, trait_tester, name, default_) \ template< typename T, bool IS_CLASS > \ struct trait_tester \ { \ BOOST_STATIC_CONSTANT( bool, value = false ); \ }; \ template< typename T > \ struct trait_tester< T, true > \ { \ struct trait_tester_impl \ { \ template < class U > \ static int resolve( boost::mpl::aux::type_wrapper const volatile * \ , boost::mpl::aux::type_wrapper* = 0 ); \ static char resolve( ... ); \ }; \ typedef boost::mpl::aux::type_wrapper t_; \ BOOST_STATIC_CONSTANT( bool, value = ( sizeof( trait_tester_impl::resolve( static_cast< t_ * >(0) ) ) == sizeof(int) ) ); \ }; \ template< typename T, typename fallback_ = boost::mpl::bool_ > \ struct trait \ { \ BOOST_STATIC_CONSTANT( bool, value = (trait_tester< T, boost::is_class< T >::value >::value) ); \ typedef boost::mpl::bool_< trait< T, fallback_ >::value > type; \ }; # define BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF(trait, name, default_) \ BOOST_MPL_HAS_XXX_TRAIT_NAMED_BCB_DEF( trait \ , BOOST_PP_CAT(trait,_tester) \ , name \ , default_ ) \ /**/ # else // other SFINAE-capable compilers # define BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF(trait, name, default_) \ template< typename T, typename fallback_ = boost::mpl::bool_ > \ struct trait \ { \ struct gcc_3_2_wknd \ { \ template< typename U > \ static boost::mpl::aux::yes_tag test( \ boost::mpl::aux::type_wrapper const volatile* \ , boost::mpl::aux::type_wrapper* = 0 \ ); \ \ static boost::mpl::aux::no_tag test(...); \ }; \ \ typedef boost::mpl::aux::type_wrapper t_; \ BOOST_STATIC_CONSTANT(bool, value = \ sizeof(gcc_3_2_wknd::test(static_cast(0))) \ == sizeof(boost::mpl::aux::yes_tag) \ ); \ typedef boost::mpl::bool_ type; \ }; \ /**/ # endif // BOOST_WORKAROUND(BOOST_MSVC, <= 1300) #else // BOOST_MPL_CFG_NO_HAS_XXX // placeholder implementation # define BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF(trait, name, default_) \ template< typename T, typename fallback_ = boost::mpl::bool_ > \ struct trait \ { \ BOOST_STATIC_CONSTANT(bool, value = fallback_::value); \ typedef fallback_ type; \ }; \ /**/ #endif #define BOOST_MPL_HAS_XXX_TRAIT_DEF(name) \ BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF(BOOST_PP_CAT(has_,name), name, false) \ /**/ #if !defined(BOOST_MPL_CFG_NO_HAS_XXX_TEMPLATE) // Create a boolean Metafunction to detect a nested template // member. This implementation is based on a USENET newsgroup's // posting by Aleksey Gurtovoy (comp.lang.c++.moderated, 2002-03-19), // Rani Sharoni's USENET posting cited above, the non-template has_xxx // implementations above, and discussion on the Boost mailing list. # if !defined(BOOST_MPL_HAS_XXX_NO_WRAPPED_TYPES) # if BOOST_WORKAROUND(BOOST_MSVC, <= 1400) # define BOOST_MPL_HAS_XXX_NO_WRAPPED_TYPES 1 # endif # endif # if !defined(BOOST_MPL_HAS_XXX_NO_EXPLICIT_TEST_FUNCTION) # if (defined(BOOST_NO_EXPLICIT_FUNCTION_TEMPLATE_ARGUMENTS)) # define BOOST_MPL_HAS_XXX_NO_EXPLICIT_TEST_FUNCTION 1 # endif # endif # if !defined(BOOST_MPL_HAS_XXX_NEEDS_TEMPLATE_SFINAE) # if BOOST_WORKAROUND(BOOST_MSVC, <= 1400) # define BOOST_MPL_HAS_XXX_NEEDS_TEMPLATE_SFINAE 1 # endif # endif // NOTE: Many internal implementation macros take a Boost.Preprocessor // array argument called args which is of the following form. // ( 4, ( trait, name, max_arity, default_ ) ) # define BOOST_MPL_HAS_MEMBER_INTROSPECTION_NAME(args) \ BOOST_PP_CAT(BOOST_PP_ARRAY_ELEM(0, args) , _introspect) \ /**/ # define BOOST_MPL_HAS_MEMBER_INTROSPECTION_SUBSTITUTE_NAME(args, n) \ BOOST_PP_CAT(BOOST_PP_CAT(BOOST_PP_ARRAY_ELEM(0, args) , _substitute), n) \ /**/ # define BOOST_MPL_HAS_MEMBER_INTROSPECTION_TEST_NAME(args) \ BOOST_PP_CAT(BOOST_PP_ARRAY_ELEM(0, args) , _test) \ /**/ // Thanks to Guillaume Melquiond for pointing out the need for the // "substitute" template as an argument to the overloaded test // functions to get SFINAE to work for member templates with the // correct name but different number of arguments. # define BOOST_MPL_HAS_MEMBER_MULTI_SUBSTITUTE(z, n, args) \ template< \ template< BOOST_PP_ENUM_PARAMS(BOOST_PP_INC(n), typename V) > class V \ > \ struct BOOST_MPL_HAS_MEMBER_INTROSPECTION_SUBSTITUTE_NAME(args, n) { \ }; \ /**/ # define BOOST_MPL_HAS_MEMBER_SUBSTITUTE(args, substitute_macro) \ BOOST_PP_REPEAT( \ BOOST_PP_ARRAY_ELEM(2, args) \ , BOOST_MPL_HAS_MEMBER_MULTI_SUBSTITUTE \ , args \ ) \ /**/ # if !BOOST_MPL_HAS_XXX_NO_EXPLICIT_TEST_FUNCTION # define BOOST_MPL_HAS_MEMBER_REJECT(args, member_macro) \ template< typename V > \ static boost::mpl::aux::no_tag \ BOOST_MPL_HAS_MEMBER_INTROSPECTION_TEST_NAME(args)(...); \ /**/ # else # define BOOST_MPL_HAS_MEMBER_REJECT(args, member_macro) \ static boost::mpl::aux::no_tag \ BOOST_MPL_HAS_MEMBER_INTROSPECTION_TEST_NAME(args)(...); \ /**/ # endif # if !BOOST_MPL_HAS_XXX_NO_WRAPPED_TYPES # define BOOST_MPL_HAS_MEMBER_MULTI_ACCEPT(z, n, args) \ template< typename V > \ static boost::mpl::aux::yes_tag \ BOOST_MPL_HAS_MEMBER_INTROSPECTION_TEST_NAME(args)( \ boost::mpl::aux::type_wrapper< V > const volatile* \ , BOOST_MPL_HAS_MEMBER_INTROSPECTION_SUBSTITUTE_NAME(args, n) < \ V::template BOOST_PP_ARRAY_ELEM(1, args) \ >* = 0 \ ); \ /**/ # define BOOST_MPL_HAS_MEMBER_ACCEPT(args, member_macro) \ BOOST_PP_REPEAT( \ BOOST_PP_ARRAY_ELEM(2, args) \ , BOOST_MPL_HAS_MEMBER_MULTI_ACCEPT \ , args \ ) \ /**/ # else # define BOOST_MPL_HAS_MEMBER_ACCEPT(args, member_macro) \ template< typename V > \ static boost::mpl::aux::yes_tag \ BOOST_MPL_HAS_MEMBER_INTROSPECTION_TEST_NAME(args)( \ V const volatile* \ , member_macro(args, V, T)* = 0 \ ); \ /**/ # endif # if !BOOST_MPL_HAS_XXX_NO_EXPLICIT_TEST_FUNCTION # define BOOST_MPL_HAS_MEMBER_TEST(args) \ sizeof(BOOST_MPL_HAS_MEMBER_INTROSPECTION_TEST_NAME(args)< U >(0)) \ == sizeof(boost::mpl::aux::yes_tag) \ /**/ # else # if !BOOST_MPL_HAS_XXX_NO_WRAPPED_TYPES # define BOOST_MPL_HAS_MEMBER_TEST(args) \ sizeof( \ BOOST_MPL_HAS_MEMBER_INTROSPECTION_TEST_NAME(args)( \ static_cast< boost::mpl::aux::type_wrapper< U >* >(0) \ ) \ ) == sizeof(boost::mpl::aux::yes_tag) \ /**/ # else # define BOOST_MPL_HAS_MEMBER_TEST(args) \ sizeof( \ BOOST_MPL_HAS_MEMBER_INTROSPECTION_TEST_NAME(args)( \ static_cast< U* >(0) \ ) \ ) == sizeof(boost::mpl::aux::yes_tag) \ /**/ # endif # endif # define BOOST_MPL_HAS_MEMBER_INTROSPECT( \ args, substitute_macro, member_macro \ ) \ template< typename U > \ struct BOOST_MPL_HAS_MEMBER_INTROSPECTION_NAME(args) { \ BOOST_MPL_HAS_MEMBER_SUBSTITUTE(args, substitute_macro) \ BOOST_MPL_HAS_MEMBER_REJECT(args, member_macro) \ BOOST_MPL_HAS_MEMBER_ACCEPT(args, member_macro) \ BOOST_STATIC_CONSTANT( \ bool, value = BOOST_MPL_HAS_MEMBER_TEST(args) \ ); \ typedef boost::mpl::bool_< value > type; \ }; \ /**/ # define BOOST_MPL_HAS_MEMBER_IMPLEMENTATION( \ args, introspect_macro, substitute_macro, member_macro \ ) \ template< \ typename T \ , typename fallback_ \ = boost::mpl::bool_< BOOST_PP_ARRAY_ELEM(3, args) > \ > \ class BOOST_PP_ARRAY_ELEM(0, args) { \ introspect_macro(args, substitute_macro, member_macro) \ public: \ static const bool value \ = BOOST_MPL_HAS_MEMBER_INTROSPECTION_NAME(args)< T >::value; \ typedef typename BOOST_MPL_HAS_MEMBER_INTROSPECTION_NAME(args)< \ T \ >::type type; \ }; \ /**/ // BOOST_MPL_HAS_MEMBER_WITH_FUNCTION_SFINAE expands to the full // implementation of the function-based metafunction. Compile with -E // to see the preprocessor output for this macro. # define BOOST_MPL_HAS_MEMBER_WITH_FUNCTION_SFINAE( \ args, substitute_macro, member_macro \ ) \ BOOST_MPL_HAS_MEMBER_IMPLEMENTATION( \ args \ , BOOST_MPL_HAS_MEMBER_INTROSPECT \ , substitute_macro \ , member_macro \ ) \ /**/ # if BOOST_MPL_HAS_XXX_NEEDS_TEMPLATE_SFINAE # if !defined(BOOST_MPL_HAS_XXX_NEEDS_NAMESPACE_LEVEL_SUBSTITUTE) # if BOOST_WORKAROUND(BOOST_MSVC, <= 1400) # define BOOST_MPL_HAS_XXX_NEEDS_NAMESPACE_LEVEL_SUBSTITUTE 1 # endif # endif # if !BOOST_MPL_HAS_XXX_NEEDS_NAMESPACE_LEVEL_SUBSTITUTE # define BOOST_MPL_HAS_MEMBER_INTROSPECTION_SUBSTITUTE_NAME_WITH_TEMPLATE_SFINAE( \ args, n \ ) \ BOOST_MPL_HAS_MEMBER_INTROSPECTION_SUBSTITUTE_NAME(args, n) \ /**/ # else # define BOOST_MPL_HAS_MEMBER_INTROSPECTION_SUBSTITUTE_NAME_WITH_TEMPLATE_SFINAE( \ args, n \ ) \ BOOST_PP_CAT( \ boost_mpl_has_xxx_ \ , BOOST_MPL_HAS_MEMBER_INTROSPECTION_SUBSTITUTE_NAME(args, n) \ ) \ /**/ # endif # define BOOST_MPL_HAS_MEMBER_INTROSPECTION_SUBSTITUTE_TAG_NAME( \ args \ ) \ BOOST_PP_CAT( \ BOOST_MPL_HAS_MEMBER_INTROSPECTION_SUBSTITUTE_NAME_WITH_TEMPLATE_SFINAE( \ args, 0 \ ) \ , _tag \ ) \ /**/ # define BOOST_MPL_HAS_MEMBER_MULTI_SUBSTITUTE_WITH_TEMPLATE_SFINAE( \ z, n, args \ ) \ template< \ template< BOOST_PP_ENUM_PARAMS(BOOST_PP_INC(n), typename U) > class U \ > \ struct BOOST_MPL_HAS_MEMBER_INTROSPECTION_SUBSTITUTE_NAME_WITH_TEMPLATE_SFINAE( \ args, n \ ) { \ typedef \ BOOST_MPL_HAS_MEMBER_INTROSPECTION_SUBSTITUTE_TAG_NAME(args) \ type; \ }; \ /**/ # define BOOST_MPL_HAS_MEMBER_SUBSTITUTE_WITH_TEMPLATE_SFINAE( \ args, substitute_macro \ ) \ typedef void \ BOOST_MPL_HAS_MEMBER_INTROSPECTION_SUBSTITUTE_TAG_NAME(args); \ BOOST_PP_REPEAT( \ BOOST_PP_ARRAY_ELEM(2, args) \ , BOOST_MPL_HAS_MEMBER_MULTI_SUBSTITUTE_WITH_TEMPLATE_SFINAE \ , args \ ) \ /**/ # define BOOST_MPL_HAS_MEMBER_REJECT_WITH_TEMPLATE_SFINAE( \ args, member_macro \ ) \ template< \ typename U \ , typename V \ = BOOST_MPL_HAS_MEMBER_INTROSPECTION_SUBSTITUTE_TAG_NAME(args) \ > \ struct BOOST_MPL_HAS_MEMBER_INTROSPECTION_TEST_NAME(args) { \ BOOST_STATIC_CONSTANT(bool, value = false); \ typedef boost::mpl::bool_< value > type; \ }; \ /**/ # define BOOST_MPL_HAS_MEMBER_MULTI_ACCEPT_WITH_TEMPLATE_SFINAE( \ z, n, args \ ) \ template< typename U > \ struct BOOST_MPL_HAS_MEMBER_INTROSPECTION_TEST_NAME(args)< \ U \ , typename \ BOOST_MPL_HAS_MEMBER_INTROSPECTION_SUBSTITUTE_NAME_WITH_TEMPLATE_SFINAE( \ args, n \ )< \ BOOST_MSVC_TYPENAME U::BOOST_PP_ARRAY_ELEM(1, args)< > \ >::type \ > { \ BOOST_STATIC_CONSTANT(bool, value = true); \ typedef boost::mpl::bool_< value > type; \ }; \ /**/ # define BOOST_MPL_HAS_MEMBER_ACCEPT_WITH_TEMPLATE_SFINAE( \ args, member_macro \ ) \ BOOST_PP_REPEAT( \ BOOST_PP_ARRAY_ELEM(2, args) \ , BOOST_MPL_HAS_MEMBER_MULTI_ACCEPT_WITH_TEMPLATE_SFINAE \ , args \ ) \ /**/ # define BOOST_MPL_HAS_MEMBER_INTROSPECT_WITH_TEMPLATE_SFINAE( \ args, substitute_macro, member_macro \ ) \ BOOST_MPL_HAS_MEMBER_REJECT_WITH_TEMPLATE_SFINAE(args, member_macro) \ BOOST_MPL_HAS_MEMBER_ACCEPT_WITH_TEMPLATE_SFINAE(args, member_macro) \ template< typename U > \ struct BOOST_MPL_HAS_MEMBER_INTROSPECTION_NAME(args) \ : BOOST_MPL_HAS_MEMBER_INTROSPECTION_TEST_NAME(args)< U > { \ }; \ /**/ // BOOST_MPL_HAS_MEMBER_WITH_TEMPLATE_SFINAE expands to the full // implementation of the template-based metafunction. Compile with -E // to see the preprocessor output for this macro. // // Note that if BOOST_MPL_HAS_XXX_NEEDS_NAMESPACE_LEVEL_SUBSTITUTE is // defined BOOST_MPL_HAS_MEMBER_SUBSTITUTE_WITH_TEMPLATE_SFINAE needs // to be expanded at namespace level before // BOOST_MPL_HAS_MEMBER_WITH_TEMPLATE_SFINAE can be used. # define BOOST_MPL_HAS_MEMBER_WITH_TEMPLATE_SFINAE( \ args, substitute_macro, member_macro \ ) \ BOOST_MPL_HAS_MEMBER_SUBSTITUTE_WITH_TEMPLATE_SFINAE( \ args, substitute_macro \ ) \ BOOST_MPL_HAS_MEMBER_IMPLEMENTATION( \ args \ , BOOST_MPL_HAS_MEMBER_INTROSPECT_WITH_TEMPLATE_SFINAE \ , substitute_macro \ , member_macro \ ) \ /**/ # endif // BOOST_MPL_HAS_XXX_NEEDS_TEMPLATE_SFINAE // Note: In the current implementation the parameter and access macros // are no longer expanded. # if !BOOST_WORKAROUND(BOOST_MSVC, <= 1400) # define BOOST_MPL_HAS_XXX_TEMPLATE_NAMED_DEF(trait, name, default_) \ BOOST_MPL_HAS_MEMBER_WITH_FUNCTION_SFINAE( \ ( 4, ( trait, name, BOOST_MPL_LIMIT_METAFUNCTION_ARITY, default_ ) ) \ , BOOST_MPL_HAS_MEMBER_TEMPLATE_SUBSTITUTE_PARAMETER \ , BOOST_MPL_HAS_MEMBER_TEMPLATE_ACCESS \ ) \ /**/ # else # define BOOST_MPL_HAS_XXX_TEMPLATE_NAMED_DEF(trait, name, default_) \ BOOST_MPL_HAS_MEMBER_WITH_TEMPLATE_SFINAE( \ ( 4, ( trait, name, BOOST_MPL_LIMIT_METAFUNCTION_ARITY, default_ ) ) \ , BOOST_MPL_HAS_MEMBER_TEMPLATE_SUBSTITUTE_PARAMETER \ , BOOST_MPL_HAS_MEMBER_TEMPLATE_ACCESS \ ) \ /**/ # endif #else // BOOST_MPL_CFG_NO_HAS_XXX_TEMPLATE // placeholder implementation # define BOOST_MPL_HAS_XXX_TEMPLATE_NAMED_DEF(trait, name, default_) \ template< typename T \ , typename fallback_ = boost::mpl::bool_< default_ > > \ struct trait { \ BOOST_STATIC_CONSTANT(bool, value = fallback_::value); \ typedef fallback_ type; \ }; \ /**/ #endif // BOOST_MPL_CFG_NO_HAS_XXX_TEMPLATE # define BOOST_MPL_HAS_XXX_TEMPLATE_DEF(name) \ BOOST_MPL_HAS_XXX_TEMPLATE_NAMED_DEF( \ BOOST_PP_CAT(has_, name), name, false \ ) \ /**/ #endif // BOOST_MPL_HAS_XXX_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/aux_0000644000000000000000000000007412717644140016475 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/aux_/0000775000372100037210000000000012717644140017401 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/has_key_impl.hpp0000644000000000000000000000007412717644140021727 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/has_key_impl.hpp0000664000372100037210000000170712717644140022563 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_HAS_KEY_IMPL_HPP_INCLUDED #define BOOST_MPL_AUX_HAS_KEY_IMPL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2002-2004 // Copyright David Abrahams 2003 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: has_key_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include namespace boost { namespace mpl { // no default implementation; the definition is needed to make MSVC happy template< typename Tag > struct has_key_impl { template< typename AssociativeSequence, typename Key > struct apply; }; BOOST_MPL_ALGORITM_TRAITS_LAMBDA_SPEC(2,has_key_impl) }} #endif // BOOST_MPL_AUX_HAS_KEY_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/preprocessor0000644000000000000000000000007312717644140021222 xustar0030 atime=1463765202.457541607 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/preprocessor/0000775000372100037210000000000012717644140022127 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/mpl/aux_/preprocessor/PaxHeaders.5405/def_params_tail.hpp0000644000000000000000000000007312717644140025122 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/preprocessor/def_params_tail.hpp0000664000372100037210000001075312717644140025760 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_PREPROCESSOR_DEF_PARAMS_TAIL_HPP_INCLUDED #define BOOST_MPL_AUX_PREPROCESSOR_DEF_PARAMS_TAIL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: def_params_tail.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include // BOOST_MPL_PP_DEF_PARAMS_TAIL(1,T,value): , T1 = value, .., Tn = value // BOOST_MPL_PP_DEF_PARAMS_TAIL(2,T,value): , T2 = value, .., Tn = value // BOOST_MPL_PP_DEF_PARAMS_TAIL(n,T,value): #if !defined(BOOST_MPL_CFG_NO_OWN_PP_PRIMITIVES) # include # include # define BOOST_MPL_PP_DEF_PARAMS_TAIL_IMPL(i, param, value_func) \ BOOST_MPL_PP_DEF_PARAMS_TAIL_DELAY_1( \ i \ , BOOST_MPL_PP_SUB(BOOST_MPL_LIMIT_METAFUNCTION_ARITY,i) \ , param \ , value_func \ ) \ /**/ # define BOOST_MPL_PP_DEF_PARAMS_TAIL_DELAY_1(i, n, param, value_func) \ BOOST_MPL_PP_DEF_PARAMS_TAIL_DELAY_2(i,n,param,value_func) \ /**/ # define BOOST_MPL_PP_DEF_PARAMS_TAIL_DELAY_2(i, n, param, value_func) \ BOOST_PP_COMMA_IF(BOOST_PP_AND(i,n)) \ BOOST_MPL_PP_DEF_PARAMS_TAIL_##i(n,param,value_func) \ /**/ # define BOOST_MPL_PP_DEF_PARAMS_TAIL_0(i,p,v) BOOST_MPL_PP_FILTER_PARAMS_##i(p##1 v(),p##2 v(),p##3 v(),p##4 v(),p##5 v(),p##6 v(),p##7 v(),p##8 v(),p##9 v()) # define BOOST_MPL_PP_DEF_PARAMS_TAIL_1(i,p,v) BOOST_MPL_PP_FILTER_PARAMS_##i(p##2 v(),p##3 v(),p##4 v(),p##5 v(),p##6 v(),p##7 v(),p##8 v(),p##9 v(),p1) # define BOOST_MPL_PP_DEF_PARAMS_TAIL_2(i,p,v) BOOST_MPL_PP_FILTER_PARAMS_##i(p##3 v(),p##4 v(),p##5 v(),p##6 v(),p##7 v(),p##8 v(),p##9 v(),p1,p2) # define BOOST_MPL_PP_DEF_PARAMS_TAIL_3(i,p,v) BOOST_MPL_PP_FILTER_PARAMS_##i(p##4 v(),p##5 v(),p##6 v(),p##7 v(),p##8 v(),p##9 v(),p1,p2,p3) # define BOOST_MPL_PP_DEF_PARAMS_TAIL_4(i,p,v) BOOST_MPL_PP_FILTER_PARAMS_##i(p##5 v(),p##6 v(),p##7 v(),p##8 v(),p##9 v(),p1,p2,p3,p4) # define BOOST_MPL_PP_DEF_PARAMS_TAIL_5(i,p,v) BOOST_MPL_PP_FILTER_PARAMS_##i(p##6 v(),p##7 v(),p##8 v(),p##9 v(),p1,p2,p3,p4,p5) # define BOOST_MPL_PP_DEF_PARAMS_TAIL_6(i,p,v) BOOST_MPL_PP_FILTER_PARAMS_##i(p##7 v(),p##8 v(),p##9 v(),p1,p2,p3,p4,p5,p6) # define BOOST_MPL_PP_DEF_PARAMS_TAIL_7(i,p,v) BOOST_MPL_PP_FILTER_PARAMS_##i(p##8 v(),p##9 v(),p1,p2,p3,p4,p5,p6,p7) # define BOOST_MPL_PP_DEF_PARAMS_TAIL_8(i,p,v) BOOST_MPL_PP_FILTER_PARAMS_##i(p##9 v(),p1,p2,p3,p4,p5,p6,p7,p8) # define BOOST_MPL_PP_DEF_PARAMS_TAIL_9(i,p,v) BOOST_MPL_PP_FILTER_PARAMS_##i(p1,p2,p3,p4,p5,p6,p7,p8,p9) #else # include # include # include # include # include # include # define BOOST_MPL_PP_AUX_TAIL_PARAM_FUNC(unused, i, op) \ , BOOST_PP_CAT( \ BOOST_PP_TUPLE_ELEM(3, 1, op) \ , BOOST_PP_ADD_D(1, i, BOOST_PP_INC(BOOST_PP_TUPLE_ELEM(3, 0, op))) \ ) BOOST_PP_TUPLE_ELEM(3, 2, op)() \ /**/ # define BOOST_MPL_PP_DEF_PARAMS_TAIL_IMPL(i, param, value_func) \ BOOST_PP_REPEAT( \ BOOST_PP_SUB_D(1, BOOST_MPL_LIMIT_METAFUNCTION_ARITY, i) \ , BOOST_MPL_PP_AUX_TAIL_PARAM_FUNC \ , (i, param, value_func) \ ) \ /**/ #endif // BOOST_MPL_CFG_NO_OWN_PP_PRIMITIVES #define BOOST_MPL_PP_DEF_PARAMS_TAIL(i, param, value) \ BOOST_MPL_PP_DEF_PARAMS_TAIL_IMPL(i, param, BOOST_PP_IDENTITY(=value)) \ /**/ #if !defined(BOOST_MPL_CFG_NO_DEFAULT_PARAMETERS_IN_NESTED_TEMPLATES) # define BOOST_MPL_PP_NESTED_DEF_PARAMS_TAIL(i, param, value) \ BOOST_MPL_PP_DEF_PARAMS_TAIL_IMPL(i, param, BOOST_PP_IDENTITY(=value)) \ /**/ #else # define BOOST_MPL_PP_NESTED_DEF_PARAMS_TAIL(i, param, value) \ BOOST_MPL_PP_DEF_PARAMS_TAIL_IMPL(i, param, BOOST_PP_EMPTY) \ /**/ #endif #endif // BOOST_MPL_AUX_PREPROCESSOR_DEF_PARAMS_TAIL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/preprocessor/PaxHeaders.5405/params.hpp0000644000000000000000000000007312717644140023273 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/preprocessor/params.hpp0000664000372100037210000000375712717644140024137 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_PREPROCESSOR_PARAMS_HPP_INCLUDED #define BOOST_MPL_AUX_PREPROCESSOR_PARAMS_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: params.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include // BOOST_MPL_PP_PARAMS(0,T): // BOOST_MPL_PP_PARAMS(1,T): T1 // BOOST_MPL_PP_PARAMS(2,T): T1, T2 // BOOST_MPL_PP_PARAMS(n,T): T1, T2, .., Tn #if !defined(BOOST_MPL_CFG_NO_OWN_PP_PRIMITIVES) # include # define BOOST_MPL_PP_PARAMS(n,p) \ BOOST_PP_CAT(BOOST_MPL_PP_PARAMS_,n)(p) \ /**/ # define BOOST_MPL_PP_PARAMS_0(p) # define BOOST_MPL_PP_PARAMS_1(p) p##1 # define BOOST_MPL_PP_PARAMS_2(p) p##1,p##2 # define BOOST_MPL_PP_PARAMS_3(p) p##1,p##2,p##3 # define BOOST_MPL_PP_PARAMS_4(p) p##1,p##2,p##3,p##4 # define BOOST_MPL_PP_PARAMS_5(p) p##1,p##2,p##3,p##4,p##5 # define BOOST_MPL_PP_PARAMS_6(p) p##1,p##2,p##3,p##4,p##5,p##6 # define BOOST_MPL_PP_PARAMS_7(p) p##1,p##2,p##3,p##4,p##5,p##6,p##7 # define BOOST_MPL_PP_PARAMS_8(p) p##1,p##2,p##3,p##4,p##5,p##6,p##7,p##8 # define BOOST_MPL_PP_PARAMS_9(p) p##1,p##2,p##3,p##4,p##5,p##6,p##7,p##8,p##9 #else # include # include # include # include # define BOOST_MPL_PP_AUX_PARAM_FUNC(unused, i, param) \ BOOST_PP_COMMA_IF(i) \ BOOST_PP_CAT(param, BOOST_PP_INC(i)) \ /**/ # define BOOST_MPL_PP_PARAMS(n, param) \ BOOST_PP_REPEAT( \ n \ , BOOST_MPL_PP_AUX_PARAM_FUNC \ , param \ ) \ /**/ #endif #endif // BOOST_MPL_AUX_PREPROCESSOR_PARAMS_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/preprocessor/PaxHeaders.5405/default_params.hpp0000644000000000000000000000007312717644140024777 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/preprocessor/default_params.hpp0000664000372100037210000000471412717644140025635 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_PREPROCESSOR_DEFAULT_PARAMS_HPP_INCLUDED #define BOOST_MPL_AUX_PREPROCESSOR_DEFAULT_PARAMS_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2002-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: default_params.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include // BOOST_MPL_PP_DEFAULT_PARAMS(0,T,int): // BOOST_MPL_PP_DEFAULT_PARAMS(1,T,int): T1 = int // BOOST_MPL_PP_DEFAULT_PARAMS(2,T,int): T1 = int, T2 = int // BOOST_MPL_PP_DEFAULT_PARAMS(n,T,int): T1 = int, T2 = int, .., Tn = int #if !defined(BOOST_MPL_CFG_NO_OWN_PP_PRIMITIVES) # include # define BOOST_MPL_PP_DEFAULT_PARAMS(n,p,v) \ BOOST_PP_CAT(BOOST_MPL_PP_DEFAULT_PARAMS_,n)(p,v) \ /**/ # define BOOST_MPL_PP_DEFAULT_PARAMS_0(p,v) # define BOOST_MPL_PP_DEFAULT_PARAMS_1(p,v) p##1=v # define BOOST_MPL_PP_DEFAULT_PARAMS_2(p,v) p##1=v,p##2=v # define BOOST_MPL_PP_DEFAULT_PARAMS_3(p,v) p##1=v,p##2=v,p##3=v # define BOOST_MPL_PP_DEFAULT_PARAMS_4(p,v) p##1=v,p##2=v,p##3=v,p##4=v # define BOOST_MPL_PP_DEFAULT_PARAMS_5(p,v) p##1=v,p##2=v,p##3=v,p##4=v,p##5=v # define BOOST_MPL_PP_DEFAULT_PARAMS_6(p,v) p##1=v,p##2=v,p##3=v,p##4=v,p##5=v,p##6=v # define BOOST_MPL_PP_DEFAULT_PARAMS_7(p,v) p##1=v,p##2=v,p##3=v,p##4=v,p##5=v,p##6=v,p##7=v # define BOOST_MPL_PP_DEFAULT_PARAMS_8(p,v) p##1=v,p##2=v,p##3=v,p##4=v,p##5=v,p##6=v,p##7=v,p##8=v # define BOOST_MPL_PP_DEFAULT_PARAMS_9(p,v) p##1=v,p##2=v,p##3=v,p##4=v,p##5=v,p##6=v,p##7=v,p##8=v,p##9=v #else # include # include # include # include # include # define BOOST_MPL_PP_AUX_DEFAULT_PARAM_FUNC(unused, i, pv) \ BOOST_PP_COMMA_IF(i) \ BOOST_PP_CAT( BOOST_PP_TUPLE_ELEM(2,0,pv), BOOST_PP_INC(i) ) \ = BOOST_PP_TUPLE_ELEM(2,1,pv) \ /**/ # define BOOST_MPL_PP_DEFAULT_PARAMS(n, param, value) \ BOOST_PP_REPEAT( \ n \ , BOOST_MPL_PP_AUX_DEFAULT_PARAM_FUNC \ , (param,value) \ ) \ /**/ #endif #endif // BOOST_MPL_AUX_PREPROCESSOR_DEFAULT_PARAMS_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/preprocessor/PaxHeaders.5405/enum.hpp0000644000000000000000000000007312717644140022754 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/preprocessor/enum.hpp0000664000372100037210000000333712717644140023612 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_PREPROCESSOR_ENUM_HPP_INCLUDED #define BOOST_MPL_AUX_PREPROCESSOR_ENUM_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: enum.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include // BOOST_MPL_PP_ENUM(0,int): // BOOST_MPL_PP_ENUM(1,int): int // BOOST_MPL_PP_ENUM(2,int): int, int // BOOST_MPL_PP_ENUM(n,int): int, int, .., int #if !defined(BOOST_MPL_CFG_NO_OWN_PP_PRIMITIVES) # include # define BOOST_MPL_PP_ENUM(n, param) \ BOOST_PP_CAT(BOOST_MPL_PP_ENUM_,n)(param) \ /**/ # define BOOST_MPL_PP_ENUM_0(p) # define BOOST_MPL_PP_ENUM_1(p) p # define BOOST_MPL_PP_ENUM_2(p) p,p # define BOOST_MPL_PP_ENUM_3(p) p,p,p # define BOOST_MPL_PP_ENUM_4(p) p,p,p,p # define BOOST_MPL_PP_ENUM_5(p) p,p,p,p,p # define BOOST_MPL_PP_ENUM_6(p) p,p,p,p,p,p # define BOOST_MPL_PP_ENUM_7(p) p,p,p,p,p,p,p # define BOOST_MPL_PP_ENUM_8(p) p,p,p,p,p,p,p,p # define BOOST_MPL_PP_ENUM_9(p) p,p,p,p,p,p,p,p,p #else # include # include # define BOOST_MPL_PP_AUX_ENUM_FUNC(unused, i, param) \ BOOST_PP_COMMA_IF(i) param \ /**/ # define BOOST_MPL_PP_ENUM(n, param) \ BOOST_PP_REPEAT( \ n \ , BOOST_MPL_PP_AUX_ENUM_FUNC \ , param \ ) \ /**/ #endif #endif // BOOST_MPL_AUX_PREPROCESSOR_ENUM_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/adl_barrier.hpp0000644000000000000000000000007412717644140021531 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/aux_/adl_barrier.hpp0000664000372100037210000000320512717644140022360 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_ADL_BARRIER_HPP_INCLUDED #define BOOST_MPL_AUX_ADL_BARRIER_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2002-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: adl_barrier.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #if !defined(BOOST_MPL_CFG_NO_ADL_BARRIER_NAMESPACE) # define BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE mpl_ # define BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN namespace mpl_ { # define BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE } # define BOOST_MPL_AUX_ADL_BARRIER_DECL(type) \ namespace boost { namespace mpl { \ using ::BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE::type; \ } } \ /**/ #if !defined(BOOST_MPL_PREPROCESSING_MODE) namespace BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE { namespace aux {} } namespace boost { namespace mpl { using namespace BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE; namespace aux { using namespace BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE::aux; } }} #endif #else // BOOST_MPL_CFG_NO_ADL_BARRIER_NAMESPACE # define BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE boost::mpl # define BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN namespace boost { namespace mpl { # define BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE }} # define BOOST_MPL_AUX_ADL_BARRIER_DECL(type) /**/ #endif #endif // BOOST_MPL_AUX_ADL_BARRIER_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/is_msvc_eti_arg.hpp0000644000000000000000000000007412717644140022420 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/is_msvc_eti_arg.hpp0000664000372100037210000000263012717644140023250 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_IS_MSVC_ETI_ARG_HPP_INCLUDED #define BOOST_MPL_AUX_IS_MSVC_ETI_ARG_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: is_msvc_eti_arg.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include namespace boost { namespace mpl { namespace aux { #if defined(BOOST_MPL_CFG_MSVC_ETI_BUG) #if defined(BOOST_MPL_CFG_MSVC_60_ETI_BUG) template< typename T > struct is_msvc_eti_arg { BOOST_STATIC_CONSTANT(bool, value = false); }; #else // BOOST_MPL_CFG_MSVC_60_ETI_BUG struct eti_int_convertible { eti_int_convertible(int); }; template< typename T > struct is_msvc_eti_arg { static no_tag test(...); static yes_tag test(eti_int_convertible); static T& get(); BOOST_STATIC_CONSTANT(bool, value = sizeof(test(get())) == sizeof(yes_tag) ); }; #endif template<> struct is_msvc_eti_arg { BOOST_STATIC_CONSTANT(bool, value = true); }; #endif // BOOST_MPL_CFG_MSVC_ETI_BUG }}} #endif // BOOST_MPL_AUX_IS_MSVC_ETI_ARG_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/yes_no.hpp0000644000000000000000000000007412717644140020557 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/aux_/yes_no.hpp0000664000372100037210000000240512717644140021407 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_YES_NO_HPP_INCLUDED #define BOOST_MPL_AUX_YES_NO_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: yes_no.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include namespace boost { namespace mpl { namespace aux { typedef char (&no_tag)[1]; typedef char (&yes_tag)[2]; template< bool C_ > struct yes_no_tag { typedef no_tag type; }; template<> struct yes_no_tag { typedef yes_tag type; }; template< BOOST_MPL_AUX_NTTP_DECL(long, n) > struct weighted_tag { #if !BOOST_WORKAROUND(BOOST_MSVC, < 1300) typedef char (&type)[n]; #else char buf[n]; typedef weighted_tag type; #endif }; #if defined(BOOST_MPL_CFG_NO_DEPENDENT_ARRAY_TYPES) template<> struct weighted_tag<0> { typedef char (&type)[1]; }; #endif }}} #endif // BOOST_MPL_AUX_YES_NO_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/clear_impl.hpp0000644000000000000000000000007412717644140021372 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/aux_/clear_impl.hpp0000664000372100037210000000165012717644140022223 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CLEAR_IMPL_HPP_INCLUDED #define BOOST_MPL_AUX_CLEAR_IMPL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: clear_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include namespace boost { namespace mpl { // no default implementation; the definition is needed to make MSVC happy template< typename Tag > struct clear_impl { template< typename Sequence > struct apply; }; BOOST_MPL_ALGORITM_TRAITS_LAMBDA_SPEC(1, clear_impl) }} #endif // BOOST_MPL_AUX_CLEAR_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/size_impl.hpp0000644000000000000000000000007312717644140021255 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/size_impl.hpp0000664000372100037210000000262612717644140022113 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_SIZE_IMPL_HPP_INCLUDED #define BOOST_MPL_AUX_SIZE_IMPL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: size_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include namespace boost { namespace mpl { // default implementation; conrete sequences might override it by // specializing either the 'size_impl' or the primary 'size' template template< typename Tag > struct size_impl { template< typename Sequence > struct apply #if !BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x561)) : distance< typename begin::type , typename end::type > { #else { typedef typename distance< typename begin::type , typename end::type >::type type; #endif }; }; BOOST_MPL_ALGORITM_TRAITS_LAMBDA_SPEC(1, size_impl) }} #endif // BOOST_MPL_AUX_SIZE_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/empty_impl.hpp0000644000000000000000000000007412717644140021442 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/empty_impl.hpp0000664000372100037210000000222012717644140022265 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_EMPTY_IMPL_HPP_INCLUDED #define BOOST_MPL_AUX_EMPTY_IMPL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: empty_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include namespace boost { namespace mpl { // default implementation; conrete sequences might override it by // specializing either the 'empty_impl' or the primary 'empty' template template< typename Tag > struct empty_impl { template< typename Sequence > struct apply : is_same< typename begin::type , typename end::type > { }; }; BOOST_MPL_ALGORITM_TRAITS_LAMBDA_SPEC(1,empty_impl) }} #endif // BOOST_MPL_AUX_EMPTY_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/numeric_cast_utils.hpp0000644000000000000000000000007412717644140023157 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/numeric_cast_utils.hpp0000664000372100037210000000353012717644140024007 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_NUMERIC_CAST_HPP_INCLUDED #define BOOST_MPL_AUX_NUMERIC_CAST_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: numeric_cast_utils.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include namespace boost { namespace mpl { namespace aux { template< typename F , typename Tag1 , typename Tag2 > struct cast1st_impl { template< typename N1, typename N2 > struct apply #if !defined(BOOST_MPL_CFG_NO_NESTED_FORWARDING) : apply_wrap2< F , typename apply_wrap1< BOOST_MPL_AUX_NUMERIC_CAST,N1 >::type , N2 > { #else { typedef typename apply_wrap2< F , typename apply_wrap1< BOOST_MPL_AUX_NUMERIC_CAST,N1 >::type , N2 >::type type; #endif }; }; template< typename F , typename Tag1 , typename Tag2 > struct cast2nd_impl { template< typename N1, typename N2 > struct apply #if !defined(BOOST_MPL_CFG_NO_NESTED_FORWARDING) : apply_wrap2< F , N1 , typename apply_wrap1< BOOST_MPL_AUX_NUMERIC_CAST,N2 >::type > { #else { typedef typename apply_wrap2< F , N1 , typename apply_wrap1< BOOST_MPL_AUX_NUMERIC_CAST,N2 >::type >::type type; #endif }; }; }}} #endif // BOOST_MPL_AUX_NUMERIC_CAST_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/traits_lambda_spec.hpp0000644000000000000000000000007312717644140023102 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/traits_lambda_spec.hpp0000664000372100037210000000322612717644140023735 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_TRAITS_LAMBDA_SPEC_HPP_INCLUDED #define BOOST_MPL_AUX_TRAITS_LAMBDA_SPEC_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2008 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: traits_lambda_spec.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #if !defined(BOOST_MPL_CFG_NO_FULL_LAMBDA_SUPPORT) # define BOOST_MPL_ALGORITM_TRAITS_LAMBDA_SPEC_IMPL(i, trait) /**/ #elif !defined(BOOST_MPL_CFG_MSVC_ETI_BUG) # define BOOST_MPL_ALGORITM_TRAITS_LAMBDA_SPEC_IMPL(i, trait) \ template<> struct trait \ { \ template< BOOST_MPL_PP_PARAMS(i, typename T) > struct apply \ { \ }; \ }; \ /**/ #else # define BOOST_MPL_ALGORITM_TRAITS_LAMBDA_SPEC_IMPL(i, trait) \ template<> struct trait \ { \ template< BOOST_MPL_PP_PARAMS(i, typename T) > struct apply \ { \ }; \ }; \ template<> struct trait \ { \ template< BOOST_MPL_PP_PARAMS(i, typename T) > struct apply \ { \ typedef int type; \ }; \ }; \ /**/ #endif // BOOST_MPL_CFG_NO_FULL_LAMBDA_SUPPORT #define BOOST_MPL_ALGORITM_TRAITS_LAMBDA_SPEC(i, trait) \ BOOST_MPL_ALGORITM_TRAITS_LAMBDA_SPEC_IMPL(i, trait) \ template<> struct trait {}; \ /**/ #endif // BOOST_MPL_AUX_TRAITS_LAMBDA_SPEC_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/na_spec.hpp0000644000000000000000000000007412717644140020673 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/na_spec.hpp0000664000372100037210000001071312717644140021524 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_NA_SPEC_HPP_INCLUDED #define BOOST_MPL_AUX_NA_SPEC_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: na_spec.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include # include # include # include # include # include #endif #include #include #include #include #include #include #include #include #include #include #define BOOST_MPL_AUX_NA_PARAMS(i) \ BOOST_MPL_PP_ENUM(i, na) \ /**/ #if defined(BOOST_MPL_CFG_BROKEN_DEFAULT_PARAMETERS_IN_NESTED_TEMPLATES) # define BOOST_MPL_AUX_NA_SPEC_ARITY(i, name) \ namespace aux { \ template< BOOST_MPL_AUX_NTTP_DECL(int, N) > \ struct arity< \ name< BOOST_MPL_AUX_NA_PARAMS(i) > \ , N \ > \ : int_< BOOST_MPL_LIMIT_METAFUNCTION_ARITY > \ { \ }; \ } \ /**/ #else # define BOOST_MPL_AUX_NA_SPEC_ARITY(i, name) /**/ #endif #define BOOST_MPL_AUX_NA_SPEC_MAIN(i, name) \ template<> \ struct name< BOOST_MPL_AUX_NA_PARAMS(i) > \ { \ template< \ BOOST_MPL_PP_PARAMS(i, typename T) \ BOOST_MPL_PP_NESTED_DEF_PARAMS_TAIL(i, typename T, na) \ > \ struct apply \ : name< BOOST_MPL_PP_PARAMS(i, T) > \ { \ }; \ }; \ /**/ #if defined(BOOST_MPL_CFG_NO_FULL_LAMBDA_SUPPORT) # define BOOST_MPL_AUX_NA_SPEC_LAMBDA(i, name) \ template<> \ struct lambda< \ name< BOOST_MPL_AUX_NA_PARAMS(i) > \ , void_ \ , true_ \ > \ { \ typedef false_ is_le; \ typedef name< BOOST_MPL_AUX_NA_PARAMS(i) > type; \ }; \ template<> \ struct lambda< \ name< BOOST_MPL_AUX_NA_PARAMS(i) > \ , void_ \ , false_ \ > \ { \ typedef false_ is_le; \ typedef name< BOOST_MPL_AUX_NA_PARAMS(i) > type; \ }; \ /**/ #else # define BOOST_MPL_AUX_NA_SPEC_LAMBDA(i, name) \ template< typename Tag > \ struct lambda< \ name< BOOST_MPL_AUX_NA_PARAMS(i) > \ , Tag \ BOOST_MPL_AUX_LAMBDA_ARITY_PARAM(int_<-1>) \ > \ { \ typedef false_ is_le; \ typedef name< BOOST_MPL_AUX_NA_PARAMS(i) > result_; \ typedef name< BOOST_MPL_AUX_NA_PARAMS(i) > type; \ }; \ /**/ #endif #if defined(BOOST_MPL_CFG_EXTENDED_TEMPLATE_PARAMETERS_MATCHING) \ || defined(BOOST_MPL_CFG_NO_FULL_LAMBDA_SUPPORT) \ && defined(BOOST_MPL_CFG_BROKEN_OVERLOAD_RESOLUTION) # define BOOST_MPL_AUX_NA_SPEC_TEMPLATE_ARITY(i, j, name) \ namespace aux { \ template< BOOST_MPL_PP_PARAMS(j, typename T) > \ struct template_arity< \ name< BOOST_MPL_PP_PARAMS(j, T) > \ > \ : int_ \ { \ }; \ \ template<> \ struct template_arity< \ name< BOOST_MPL_PP_ENUM(i, na) > \ > \ : int_<-1> \ { \ }; \ } \ /**/ #else # define BOOST_MPL_AUX_NA_SPEC_TEMPLATE_ARITY(i, j, name) /**/ #endif #if defined(BOOST_MPL_CFG_MSVC_ETI_BUG) # define BOOST_MPL_AUX_NA_SPEC_ETI(i, name) \ template<> \ struct name< BOOST_MPL_PP_ENUM(i, int) > \ { \ typedef int type; \ enum { value = 0 }; \ }; \ /**/ #else # define BOOST_MPL_AUX_NA_SPEC_ETI(i, name) /**/ #endif #define BOOST_MPL_AUX_NA_PARAM(param) param = na #define BOOST_MPL_AUX_NA_SPEC_NO_ETI(i, name) \ BOOST_MPL_AUX_NA_SPEC_MAIN(i, name) \ BOOST_MPL_AUX_NA_SPEC_LAMBDA(i, name) \ BOOST_MPL_AUX_NA_SPEC_ARITY(i, name) \ BOOST_MPL_AUX_NA_SPEC_TEMPLATE_ARITY(i, i, name) \ /**/ #define BOOST_MPL_AUX_NA_SPEC(i, name) \ BOOST_MPL_AUX_NA_SPEC_NO_ETI(i, name) \ BOOST_MPL_AUX_NA_SPEC_ETI(i, name) \ /**/ #define BOOST_MPL_AUX_NA_SPEC2(i, j, name) \ BOOST_MPL_AUX_NA_SPEC_MAIN(i, name) \ BOOST_MPL_AUX_NA_SPEC_ETI(i, name) \ BOOST_MPL_AUX_NA_SPEC_LAMBDA(i, name) \ BOOST_MPL_AUX_NA_SPEC_ARITY(i, name) \ BOOST_MPL_AUX_NA_SPEC_TEMPLATE_ARITY(i, j, name) \ /**/ #endif // BOOST_MPL_AUX_NA_SPEC_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/nttp_decl.hpp0000644000000000000000000000007412717644140021237 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/nttp_decl.hpp0000664000372100037210000000167012717644140022072 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_NTTP_DECL_HPP_INCLUDED #define BOOST_MPL_AUX_NTTP_DECL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: nttp_decl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #if defined(BOOST_MPL_CFG_NTTP_BUG) typedef bool _mpl_nttp_bool; typedef int _mpl_nttp_int; typedef unsigned _mpl_nttp_unsigned; typedef long _mpl_nttp_long; # include # define BOOST_MPL_AUX_NTTP_DECL(T, x) BOOST_PP_CAT(_mpl_nttp_,T) x /**/ #else # define BOOST_MPL_AUX_NTTP_DECL(T, x) T x /**/ #endif #endif // BOOST_MPL_AUX_NTTP_DECL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/O1_size_impl.hpp0000644000000000000000000000007412717644140021615 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/aux_/O1_size_impl.hpp0000664000372100037210000000424712717644140022453 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_O1_SIZE_IMPL_HPP_INCLUDED #define BOOST_MPL_O1_SIZE_IMPL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: O1_size_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include #include namespace boost { namespace mpl { // default implementation - returns 'Sequence::size' if sequence has a 'size' // member, and -1 otherwise; conrete sequences might override it by // specializing either the 'O1_size_impl' or the primary 'O1_size' template # if !BOOST_WORKAROUND(BOOST_MSVC, < 1300) \ && !BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3003)) namespace aux { template< typename Sequence > struct O1_size_impl : Sequence::size { }; } template< typename Tag > struct O1_size_impl { template< typename Sequence > struct apply #if !defined(BOOST_MPL_CFG_NO_NESTED_FORWARDING) : if_< aux::has_size , aux::O1_size_impl , long_<-1> >::type { #else { typedef typename if_< aux::has_size , aux::O1_size_impl , long_<-1> >::type type; BOOST_STATIC_CONSTANT(long, value = (if_< aux::has_size , aux::O1_size_impl , long_<-1> >::type::value) ); #endif }; }; # else // BOOST_MSVC template< typename Tag > struct O1_size_impl { template< typename Sequence > struct apply : long_<-1> { }; }; # endif }} #endif // BOOST_MPL_O1_SIZE_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/value_wknd.hpp0000644000000000000000000000007412717644140021422 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/aux_/value_wknd.hpp0000664000372100037210000000413212717644140022251 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_VALUE_WKND_HPP_INCLUDED #define BOOST_MPL_AUX_VALUE_WKND_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: value_wknd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #if defined(BOOST_MPL_CFG_BCC_INTEGRAL_CONSTANTS) \ || defined(BOOST_MPL_CFG_MSVC_60_ETI_BUG) # include namespace boost { namespace mpl { namespace aux { template< typename C_ > struct value_wknd : C_ { }; #if defined(BOOST_MPL_CFG_MSVC_60_ETI_BUG) template<> struct value_wknd : int_<1> { using int_<1>::value; }; #endif }}} #if !defined(BOOST_MPL_CFG_MSVC_60_ETI_BUG) # define BOOST_MPL_AUX_VALUE_WKND(C) \ ::BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE::aux::value_wknd< C > \ /**/ # define BOOST_MPL_AUX_MSVC_VALUE_WKND(C) BOOST_MPL_AUX_VALUE_WKND(C) #else # define BOOST_MPL_AUX_VALUE_WKND(C) C # define BOOST_MPL_AUX_MSVC_VALUE_WKND(C) \ ::boost::mpl::aux::value_wknd< C > \ /**/ #endif #else // BOOST_MPL_CFG_BCC_INTEGRAL_CONSTANTS # define BOOST_MPL_AUX_VALUE_WKND(C) C # define BOOST_MPL_AUX_MSVC_VALUE_WKND(C) C #endif #if BOOST_WORKAROUND(__EDG_VERSION__, <= 238) # define BOOST_MPL_AUX_NESTED_VALUE_WKND(T, C) \ BOOST_MPL_AUX_STATIC_CAST(T, C::value) \ /**/ #else # define BOOST_MPL_AUX_NESTED_VALUE_WKND(T, C) \ BOOST_MPL_AUX_VALUE_WKND(C)::value \ /**/ #endif namespace boost { namespace mpl { namespace aux { template< typename T > struct value_type_wknd { typedef typename T::value_type type; }; #if defined(BOOST_MPL_CFG_MSVC_ETI_BUG) template<> struct value_type_wknd { typedef int type; }; #endif }}} #endif // BOOST_MPL_AUX_VALUE_WKND_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/has_size.hpp0000644000000000000000000000007412717644140021070 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/has_size.hpp0000664000372100037210000000122412717644140021716 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_HAS_SIZE_HPP_INCLUDED #define BOOST_MPL_AUX_HAS_SIZE_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2002-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: has_size.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include namespace boost { namespace mpl { namespace aux { BOOST_MPL_HAS_XXX_TRAIT_DEF(size) }}} #endif // BOOST_MPL_AUX_HAS_SIZE_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/find_if_pred.hpp0000644000000000000000000000007412717644140021673 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/find_if_pred.hpp0000664000372100037210000000136412717644140022526 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_FIND_IF_PRED_HPP_INCLUDED #define BOOST_MPL_AUX_FIND_IF_PRED_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // Copyright Eric Friedman 2002 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. #include #include namespace boost { namespace mpl { namespace aux { template< typename Predicate > struct find_if_pred { template< typename Iterator > struct apply { typedef not_< aux::iter_apply1 > type; }; }; }}} #endif // BOOST_MPL_AUX_FIND_IF_PRED_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/msvc_eti_base.hpp0000644000000000000000000000007412717644140022066 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/msvc_eti_base.hpp0000664000372100037210000000336412717644140022723 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_MSVC_ETI_BASE_HPP_INCLUDED #define BOOST_MPL_AUX_MSVC_ETI_BASE_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: msvc_eti_base.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include namespace boost { namespace mpl { namespace aux { #if defined(BOOST_MPL_CFG_MSVC_70_ETI_BUG) template< bool > struct msvc_eti_base_impl { template< typename T > struct result_ : T { typedef T type; }; }; template<> struct msvc_eti_base_impl { template< typename T > struct result_ { typedef result_ type; typedef result_ first; typedef result_ second; typedef result_ tag; enum { value = 0 }; }; }; template< typename T > struct msvc_eti_base : msvc_eti_base_impl< is_msvc_eti_arg::value > ::template result_ { }; #else // !BOOST_MPL_CFG_MSVC_70_ETI_BUG template< typename T > struct msvc_eti_base : T { #if BOOST_WORKAROUND(BOOST_MPL_CFG_GCC, BOOST_TESTED_AT(0x0304)) msvc_eti_base(); #endif typedef T type; }; #endif template<> struct msvc_eti_base { typedef msvc_eti_base type; typedef msvc_eti_base first; typedef msvc_eti_base second; typedef msvc_eti_base tag; enum { value = 0 }; }; }}} #endif // BOOST_MPL_AUX_MSVC_ETI_BASE_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/reverse_iter_fold_impl.hpp0000644000000000000000000000007312717644140024005 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/reverse_iter_fold_impl.hpp0000664000372100037210000000270512717644140024641 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_ITER_FOLD_BACKWARD_IMPL_HPP_INCLUDED #define BOOST_MPL_AUX_ITER_FOLD_BACKWARD_IMPL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: reverse_iter_fold_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include # include # include # if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \ || defined(BOOST_MPL_CFG_NO_NONTYPE_TEMPLATE_PARTIAL_SPEC) # include # include # endif #endif #include #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # define BOOST_MPL_PREPROCESSED_HEADER reverse_iter_fold_impl.hpp # include #else # define AUX778076_FOLD_IMPL_OP(iter) iter # define AUX778076_FOLD_IMPL_NAME_PREFIX reverse_iter_fold # include #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #endif // BOOST_MPL_AUX_ITER_FOLD_BACKWARD_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/inserter_algorithm.hpp0000644000000000000000000000007412717644140023164 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/inserter_algorithm.hpp0000664000372100037210000001150512717644140024015 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_INSERTER_ALGORITHM_HPP_INCLUDED #define BOOST_MPL_AUX_INSERTER_ALGORITHM_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // Copyright David Abrahams 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: inserter_algorithm.hpp 55648 2009-08-18 05:16:53Z agurtovoy $ // $Date: 2009-08-17 22:16:53 -0700 (Mon, 17 Aug 2009) $ // $Revision: 55648 $ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) # define BOOST_MPL_AUX_INSERTER_ALGORITHM_DEF(arity, name) \ BOOST_MPL_AUX_COMMON_NAME_WKND(name) \ template< \ BOOST_MPL_PP_DEFAULT_PARAMS(arity, typename P, na) \ > \ struct name \ : aux::name##_impl \ { \ }; \ \ template< \ BOOST_MPL_PP_PARAMS(BOOST_PP_DEC(arity), typename P) \ > \ struct name< BOOST_MPL_PP_PARAMS(BOOST_PP_DEC(arity), P),na > \ : if_< has_push_back< typename clear::type> \ , aux::name##_impl< \ BOOST_MPL_PP_PARAMS(BOOST_PP_DEC(arity), P) \ , back_inserter< typename clear::type > \ > \ , aux::reverse_##name##_impl< \ BOOST_MPL_PP_PARAMS(BOOST_PP_DEC(arity), P) \ , front_inserter< typename clear::type > \ > \ >::type \ { \ }; \ \ template< \ BOOST_MPL_PP_DEFAULT_PARAMS(arity, typename P, na) \ > \ struct reverse_##name \ : aux::reverse_##name##_impl \ { \ }; \ \ template< \ BOOST_MPL_PP_PARAMS(BOOST_PP_DEC(arity), typename P) \ > \ struct reverse_##name< BOOST_MPL_PP_PARAMS(BOOST_PP_DEC(arity), P),na > \ : if_< has_push_back \ , aux::reverse_##name##_impl< \ BOOST_MPL_PP_PARAMS(BOOST_PP_DEC(arity), P) \ , back_inserter< typename clear::type > \ > \ , aux::name##_impl< \ BOOST_MPL_PP_PARAMS(BOOST_PP_DEC(arity), P) \ , front_inserter< typename clear::type > \ > \ >::type \ { \ }; \ BOOST_MPL_AUX_NA_SPEC(arity, name) \ BOOST_MPL_AUX_NA_SPEC(arity, reverse_##name) \ /**/ #else # define BOOST_MPL_AUX_INSERTER_ALGORITHM_DEF(arity, name) \ BOOST_MPL_AUX_COMMON_NAME_WKND(name) \ template< \ BOOST_MPL_PP_PARAMS(BOOST_PP_DEC(arity), typename P) \ > \ struct def_##name##_impl \ : if_< has_push_back \ , aux::name##_impl< \ BOOST_MPL_PP_PARAMS(BOOST_PP_DEC(arity), P) \ , back_inserter< typename clear::type > \ > \ , aux::reverse_##name##_impl< \ BOOST_MPL_PP_PARAMS(BOOST_PP_DEC(arity), P) \ , front_inserter< typename clear::type > \ > \ >::type \ { \ }; \ \ template< \ BOOST_MPL_PP_DEFAULT_PARAMS(arity, typename P, na) \ > \ struct name \ { \ typedef typename eval_if< \ is_na \ , def_##name##_impl \ , aux::name##_impl \ >::type type; \ }; \ \ template< \ BOOST_MPL_PP_PARAMS(BOOST_PP_DEC(arity), typename P) \ > \ struct def_reverse_##name##_impl \ : if_< has_push_back \ , aux::reverse_##name##_impl< \ BOOST_MPL_PP_PARAMS(BOOST_PP_DEC(arity), P) \ , back_inserter< typename clear::type > \ > \ , aux::name##_impl< \ BOOST_MPL_PP_PARAMS(BOOST_PP_DEC(arity), P) \ , front_inserter< typename clear::type > \ > \ >::type \ { \ }; \ template< \ BOOST_MPL_PP_DEFAULT_PARAMS(arity, typename P, na) \ > \ struct reverse_##name \ { \ typedef typename eval_if< \ is_na \ , def_reverse_##name##_impl \ , aux::reverse_##name##_impl \ >::type type; \ }; \ BOOST_MPL_AUX_NA_SPEC(arity, name) \ BOOST_MPL_AUX_NA_SPEC(arity, reverse_##name) \ /**/ #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION #endif // BOOST_MPL_AUX_INSERTER_ALGORITHM_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/preprocessed0000644000000000000000000000007312717644140021172 xustar0030 atime=1463765202.457541607 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/0000775000372100037210000000000012717644140022077 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/mpl/aux_/preprocessed/PaxHeaders.5405/gcc0000644000000000000000000000007312717644140021726 xustar0030 atime=1463765202.457541607 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/0000775000372100037210000000000012717644140022633 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/advance_backward.hpp0000644000000000000000000000007412717644140025754 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/advance_backward.hpp0000664000372100037210000000423612717644140026610 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/aux_/advance_backward.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { namespace aux { template< long N > struct advance_backward; template<> struct advance_backward<0> { template< typename Iterator > struct apply { typedef Iterator iter0; typedef iter0 type; }; }; template<> struct advance_backward<1> { template< typename Iterator > struct apply { typedef Iterator iter0; typedef typename prior::type iter1; typedef iter1 type; }; }; template<> struct advance_backward<2> { template< typename Iterator > struct apply { typedef Iterator iter0; typedef typename prior::type iter1; typedef typename prior::type iter2; typedef iter2 type; }; }; template<> struct advance_backward<3> { template< typename Iterator > struct apply { typedef Iterator iter0; typedef typename prior::type iter1; typedef typename prior::type iter2; typedef typename prior::type iter3; typedef iter3 type; }; }; template<> struct advance_backward<4> { template< typename Iterator > struct apply { typedef Iterator iter0; typedef typename prior::type iter1; typedef typename prior::type iter2; typedef typename prior::type iter3; typedef typename prior::type iter4; typedef iter4 type; }; }; template< long N > struct advance_backward { template< typename Iterator > struct apply { typedef typename apply_wrap1< advance_backward<4> , Iterator >::type chunk_result_; typedef typename apply_wrap1< advance_backward<( (N - 4) < 0 ? 0 : N - 4 )> , chunk_result_ >::type type; }; }; }}} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/full_lambda.hpp0000644000000000000000000000007312717644140024756 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/full_lambda.hpp0000664000372100037210000002636612717644140025623 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/aux_/full_lambda.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { namespace aux { template< bool C1 = false, bool C2 = false, bool C3 = false, bool C4 = false , bool C5 = false > struct lambda_or : true_ { }; template<> struct lambda_or< false,false,false,false,false > : false_ { }; } // namespace aux template< typename T , typename Tag , typename Arity > struct lambda { typedef false_ is_le; typedef T result_; typedef T type; }; template< typename T > struct is_lambda_expression : lambda::is_le { }; template< int N, typename Tag > struct lambda< arg,Tag, int_< -1 > > { typedef true_ is_le; typedef mpl::arg result_; // qualified for the sake of MIPSpro 7.41 typedef mpl::protect type; }; template< typename F , typename Tag > struct lambda< bind0 , Tag , int_<1> > { typedef false_ is_le; typedef bind0< F > result_; typedef result_ type; }; namespace aux { template< typename IsLE, typename Tag , template< typename P1 > class F , typename L1 > struct le_result1 { typedef F< typename L1::type > result_; typedef result_ type; }; template< typename Tag , template< typename P1 > class F , typename L1 > struct le_result1< true_,Tag,F,L1 > { typedef bind1< quote1< F,Tag > , typename L1::result_ > result_; typedef mpl::protect type; }; } // namespace aux template< template< typename P1 > class F , typename T1 , typename Tag > struct lambda< F , Tag , int_<1> > { typedef lambda< T1,Tag > l1; typedef typename l1::is_le is_le1; typedef typename aux::lambda_or< is_le1::value >::type is_le; typedef aux::le_result1< is_le, Tag, F, l1 > le_result_; typedef typename le_result_::result_ result_; typedef typename le_result_::type type; }; template< typename F, typename T1 , typename Tag > struct lambda< bind1< F,T1 > , Tag , int_<2> > { typedef false_ is_le; typedef bind1< F , T1 > result_; typedef result_ type; }; namespace aux { template< typename IsLE, typename Tag , template< typename P1, typename P2 > class F , typename L1, typename L2 > struct le_result2 { typedef F< typename L1::type, typename L2::type > result_; typedef result_ type; }; template< typename Tag , template< typename P1, typename P2 > class F , typename L1, typename L2 > struct le_result2< true_,Tag,F,L1,L2 > { typedef bind2< quote2< F,Tag > , typename L1::result_, typename L2::result_ > result_; typedef mpl::protect type; }; } // namespace aux template< template< typename P1, typename P2 > class F , typename T1, typename T2 , typename Tag > struct lambda< F< T1,T2 > , Tag , int_<2> > { typedef lambda< T1,Tag > l1; typedef lambda< T2,Tag > l2; typedef typename l1::is_le is_le1; typedef typename l2::is_le is_le2; typedef typename aux::lambda_or< is_le1::value, is_le2::value >::type is_le; typedef aux::le_result2< is_le, Tag, F, l1, l2 > le_result_; typedef typename le_result_::result_ result_; typedef typename le_result_::type type; }; template< typename F, typename T1, typename T2 , typename Tag > struct lambda< bind2< F,T1,T2 > , Tag , int_<3> > { typedef false_ is_le; typedef bind2< F , T1, T2 > result_; typedef result_ type; }; namespace aux { template< typename IsLE, typename Tag , template< typename P1, typename P2, typename P3 > class F , typename L1, typename L2, typename L3 > struct le_result3 { typedef F< typename L1::type, typename L2::type, typename L3::type > result_; typedef result_ type; }; template< typename Tag , template< typename P1, typename P2, typename P3 > class F , typename L1, typename L2, typename L3 > struct le_result3< true_,Tag,F,L1,L2,L3 > { typedef bind3< quote3< F,Tag > , typename L1::result_, typename L2::result_, typename L3::result_ > result_; typedef mpl::protect type; }; } // namespace aux template< template< typename P1, typename P2, typename P3 > class F , typename T1, typename T2, typename T3 , typename Tag > struct lambda< F< T1,T2,T3 > , Tag , int_<3> > { typedef lambda< T1,Tag > l1; typedef lambda< T2,Tag > l2; typedef lambda< T3,Tag > l3; typedef typename l1::is_le is_le1; typedef typename l2::is_le is_le2; typedef typename l3::is_le is_le3; typedef typename aux::lambda_or< is_le1::value, is_le2::value, is_le3::value >::type is_le; typedef aux::le_result3< is_le, Tag, F, l1, l2, l3 > le_result_; typedef typename le_result_::result_ result_; typedef typename le_result_::type type; }; template< typename F, typename T1, typename T2, typename T3 , typename Tag > struct lambda< bind3< F,T1,T2,T3 > , Tag , int_<4> > { typedef false_ is_le; typedef bind3< F , T1, T2, T3 > result_; typedef result_ type; }; namespace aux { template< typename IsLE, typename Tag , template< typename P1, typename P2, typename P3, typename P4 > class F , typename L1, typename L2, typename L3, typename L4 > struct le_result4 { typedef F< typename L1::type, typename L2::type, typename L3::type , typename L4::type > result_; typedef result_ type; }; template< typename Tag , template< typename P1, typename P2, typename P3, typename P4 > class F , typename L1, typename L2, typename L3, typename L4 > struct le_result4< true_,Tag,F,L1,L2,L3,L4 > { typedef bind4< quote4< F,Tag > , typename L1::result_, typename L2::result_, typename L3::result_ , typename L4::result_ > result_; typedef mpl::protect type; }; } // namespace aux template< template< typename P1, typename P2, typename P3, typename P4 > class F , typename T1, typename T2, typename T3, typename T4 , typename Tag > struct lambda< F< T1,T2,T3,T4 > , Tag , int_<4> > { typedef lambda< T1,Tag > l1; typedef lambda< T2,Tag > l2; typedef lambda< T3,Tag > l3; typedef lambda< T4,Tag > l4; typedef typename l1::is_le is_le1; typedef typename l2::is_le is_le2; typedef typename l3::is_le is_le3; typedef typename l4::is_le is_le4; typedef typename aux::lambda_or< is_le1::value, is_le2::value, is_le3::value, is_le4::value >::type is_le; typedef aux::le_result4< is_le, Tag, F, l1, l2, l3, l4 > le_result_; typedef typename le_result_::result_ result_; typedef typename le_result_::type type; }; template< typename F, typename T1, typename T2, typename T3, typename T4 , typename Tag > struct lambda< bind4< F,T1,T2,T3,T4 > , Tag , int_<5> > { typedef false_ is_le; typedef bind4< F , T1, T2, T3, T4 > result_; typedef result_ type; }; namespace aux { template< typename IsLE, typename Tag , template< typename P1, typename P2, typename P3, typename P4, typename P5 > class F , typename L1, typename L2, typename L3, typename L4, typename L5 > struct le_result5 { typedef F< typename L1::type, typename L2::type, typename L3::type , typename L4::type, typename L5::type > result_; typedef result_ type; }; template< typename Tag , template< typename P1, typename P2, typename P3, typename P4, typename P5 > class F , typename L1, typename L2, typename L3, typename L4, typename L5 > struct le_result5< true_,Tag,F,L1,L2,L3,L4,L5 > { typedef bind5< quote5< F,Tag > , typename L1::result_, typename L2::result_, typename L3::result_ , typename L4::result_, typename L5::result_ > result_; typedef mpl::protect type; }; } // namespace aux template< template< typename P1, typename P2, typename P3, typename P4 , typename P5 > class F , typename T1, typename T2, typename T3, typename T4, typename T5 , typename Tag > struct lambda< F< T1,T2,T3,T4,T5 > , Tag , int_<5> > { typedef lambda< T1,Tag > l1; typedef lambda< T2,Tag > l2; typedef lambda< T3,Tag > l3; typedef lambda< T4,Tag > l4; typedef lambda< T5,Tag > l5; typedef typename l1::is_le is_le1; typedef typename l2::is_le is_le2; typedef typename l3::is_le is_le3; typedef typename l4::is_le is_le4; typedef typename l5::is_le is_le5; typedef typename aux::lambda_or< is_le1::value, is_le2::value, is_le3::value, is_le4::value , is_le5::value >::type is_le; typedef aux::le_result5< is_le, Tag, F, l1, l2, l3, l4, l5 > le_result_; typedef typename le_result_::result_ result_; typedef typename le_result_::type type; }; template< typename F, typename T1, typename T2, typename T3, typename T4 , typename T5 , typename Tag > struct lambda< bind5< F,T1,T2,T3,T4,T5 > , Tag , int_<6> > { typedef false_ is_le; typedef bind5< F , T1, T2, T3, T4, T5 > result_; typedef result_ type; }; /// special case for 'protect' template< typename T, typename Tag > struct lambda< mpl::protect,Tag, int_<1> > { typedef false_ is_le; typedef mpl::protect result_; typedef result_ type; }; /// specializations for the main 'bind' form template< typename F, typename T1, typename T2, typename T3, typename T4 , typename T5 , typename Tag > struct lambda< bind< F,T1,T2,T3,T4,T5 > , Tag , int_<6> > { typedef false_ is_le; typedef bind< F,T1,T2,T3,T4,T5 > result_; typedef result_ type; }; template< typename F , typename Tag1 , typename Tag2 , typename Arity > struct lambda< lambda< F,Tag1,Arity > , Tag2 , int_<3> > { typedef lambda< F,Tag2 > l1; typedef lambda< Tag1,Tag2 > l2; typedef typename l1::is_le is_le; typedef bind1< quote1, typename l1::result_ > arity_; typedef lambda< typename if_< is_le,arity_,Arity >::type, Tag2 > l3; typedef aux::le_result3 le_result_; typedef typename le_result_::result_ result_; typedef typename le_result_::type type; }; BOOST_MPL_AUX_NA_SPEC2(2, 3, lambda) }} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/iter_fold_if_impl.hpp0000644000000000000000000000007312717644140026162 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/iter_fold_if_impl.hpp0000664000372100037210000001026212717644140027013 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2001-2004 // Copyright David Abrahams 2001-2002 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/aux_/iter_fold_if_impl.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { namespace aux { template< typename Iterator, typename State > struct iter_fold_if_null_step { typedef State state; typedef Iterator iterator; }; template< bool > struct iter_fold_if_step_impl { template< typename Iterator , typename State , typename StateOp , typename IteratorOp > struct result_ { typedef typename apply2< StateOp,State,Iterator >::type state; typedef typename IteratorOp::type iterator; }; }; template<> struct iter_fold_if_step_impl { template< typename Iterator , typename State , typename StateOp , typename IteratorOp > struct result_ { typedef State state; typedef Iterator iterator; }; }; template< typename Iterator , typename State , typename ForwardOp , typename Predicate > struct iter_fold_if_forward_step { typedef typename apply2< Predicate,State,Iterator >::type not_last; typedef typename iter_fold_if_step_impl< BOOST_MPL_AUX_MSVC_VALUE_WKND(not_last)::value >::template result_< Iterator,State,ForwardOp, mpl::next > impl_; typedef typename impl_::state state; typedef typename impl_::iterator iterator; }; template< typename Iterator , typename State , typename BackwardOp , typename Predicate > struct iter_fold_if_backward_step { typedef typename apply2< Predicate,State,Iterator >::type not_last; typedef typename iter_fold_if_step_impl< BOOST_MPL_AUX_MSVC_VALUE_WKND(not_last)::value >::template result_< Iterator,State,BackwardOp, identity > impl_; typedef typename impl_::state state; typedef typename impl_::iterator iterator; }; template< typename Iterator , typename State , typename ForwardOp , typename ForwardPredicate , typename BackwardOp , typename BackwardPredicate > struct iter_fold_if_impl { private: typedef iter_fold_if_null_step< Iterator,State > forward_step0; typedef iter_fold_if_forward_step< typename forward_step0::iterator, typename forward_step0::state, ForwardOp, ForwardPredicate > forward_step1; typedef iter_fold_if_forward_step< typename forward_step1::iterator, typename forward_step1::state, ForwardOp, ForwardPredicate > forward_step2; typedef iter_fold_if_forward_step< typename forward_step2::iterator, typename forward_step2::state, ForwardOp, ForwardPredicate > forward_step3; typedef iter_fold_if_forward_step< typename forward_step3::iterator, typename forward_step3::state, ForwardOp, ForwardPredicate > forward_step4; typedef typename if_< typename forward_step4::not_last , iter_fold_if_impl< typename forward_step4::iterator , typename forward_step4::state , ForwardOp , ForwardPredicate , BackwardOp , BackwardPredicate > , iter_fold_if_null_step< typename forward_step4::iterator , typename forward_step4::state > >::type backward_step4; typedef iter_fold_if_backward_step< typename forward_step3::iterator, typename backward_step4::state, BackwardOp, BackwardPredicate > backward_step3; typedef iter_fold_if_backward_step< typename forward_step2::iterator, typename backward_step3::state, BackwardOp, BackwardPredicate > backward_step2; typedef iter_fold_if_backward_step< typename forward_step1::iterator, typename backward_step2::state, BackwardOp, BackwardPredicate > backward_step1; typedef iter_fold_if_backward_step< typename forward_step0::iterator, typename backward_step1::state, BackwardOp, BackwardPredicate > backward_step0; public: typedef typename backward_step0::state state; typedef typename backward_step4::iterator iterator; }; }}} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/apply_wrap.hpp0000644000000000000000000000007412717644140024673 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/apply_wrap.hpp0000664000372100037210000000232612717644140025525 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/apply_wrap.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { template< typename F , typename has_apply_ = typename aux::has_apply::type > struct apply_wrap0 : F::template apply< > { }; template< typename F > struct apply_wrap0< F,true_ > : F::apply { }; template< typename F, typename T1 > struct apply_wrap1 : F::template apply { }; template< typename F, typename T1, typename T2 > struct apply_wrap2 : F::template apply< T1,T2 > { }; template< typename F, typename T1, typename T2, typename T3 > struct apply_wrap3 : F::template apply< T1,T2,T3 > { }; template< typename F, typename T1, typename T2, typename T3, typename T4 > struct apply_wrap4 : F::template apply< T1,T2,T3,T4 > { }; template< typename F, typename T1, typename T2, typename T3, typename T4 , typename T5 > struct apply_wrap5 : F::template apply< T1,T2,T3,T4,T5 > { }; }} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/arg.hpp0000644000000000000000000000007412717644140023266 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/arg.hpp0000664000372100037210000000551512717644140024123 0ustar00fransfrans00000000000000 // Copyright Peter Dimov 2001-2002 // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/arg.hpp" header // -- DO NOT modify by hand! BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN template<> struct arg< -1 > { BOOST_STATIC_CONSTANT(int, value = -1); BOOST_MPL_AUX_ARG_TYPEDEF(na, tag) BOOST_MPL_AUX_ARG_TYPEDEF(na, type) template< typename U1 = na, typename U2 = na, typename U3 = na , typename U4 = na, typename U5 = na > struct apply { typedef U1 type; BOOST_MPL_AUX_ASSERT_NOT_NA(type); }; }; template<> struct arg<1> { BOOST_STATIC_CONSTANT(int, value = 1); typedef arg<2> next; BOOST_MPL_AUX_ARG_TYPEDEF(na, tag) BOOST_MPL_AUX_ARG_TYPEDEF(na, type) template< typename U1 = na, typename U2 = na, typename U3 = na , typename U4 = na, typename U5 = na > struct apply { typedef U1 type; BOOST_MPL_AUX_ASSERT_NOT_NA(type); }; }; template<> struct arg<2> { BOOST_STATIC_CONSTANT(int, value = 2); typedef arg<3> next; BOOST_MPL_AUX_ARG_TYPEDEF(na, tag) BOOST_MPL_AUX_ARG_TYPEDEF(na, type) template< typename U1 = na, typename U2 = na, typename U3 = na , typename U4 = na, typename U5 = na > struct apply { typedef U2 type; BOOST_MPL_AUX_ASSERT_NOT_NA(type); }; }; template<> struct arg<3> { BOOST_STATIC_CONSTANT(int, value = 3); typedef arg<4> next; BOOST_MPL_AUX_ARG_TYPEDEF(na, tag) BOOST_MPL_AUX_ARG_TYPEDEF(na, type) template< typename U1 = na, typename U2 = na, typename U3 = na , typename U4 = na, typename U5 = na > struct apply { typedef U3 type; BOOST_MPL_AUX_ASSERT_NOT_NA(type); }; }; template<> struct arg<4> { BOOST_STATIC_CONSTANT(int, value = 4); typedef arg<5> next; BOOST_MPL_AUX_ARG_TYPEDEF(na, tag) BOOST_MPL_AUX_ARG_TYPEDEF(na, type) template< typename U1 = na, typename U2 = na, typename U3 = na , typename U4 = na, typename U5 = na > struct apply { typedef U4 type; BOOST_MPL_AUX_ASSERT_NOT_NA(type); }; }; template<> struct arg<5> { BOOST_STATIC_CONSTANT(int, value = 5); typedef arg<6> next; BOOST_MPL_AUX_ARG_TYPEDEF(na, tag) BOOST_MPL_AUX_ARG_TYPEDEF(na, type) template< typename U1 = na, typename U2 = na, typename U3 = na , typename U4 = na, typename U5 = na > struct apply { typedef U5 type; BOOST_MPL_AUX_ASSERT_NOT_NA(type); }; }; BOOST_MPL_AUX_NONTYPE_ARITY_SPEC(1,int, arg) BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/reverse_fold_impl.hpp0000644000000000000000000000007312717644140026214 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/reverse_fold_impl.hpp0000664000372100037210000001631412717644140027051 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/aux_/reverse_fold_impl.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { namespace aux { /// forward declaration template< long N , typename First , typename Last , typename State , typename BackwardOp , typename ForwardOp > struct reverse_fold_impl; template< typename First , typename Last , typename State , typename BackwardOp , typename ForwardOp > struct reverse_fold_impl< 0,First,Last,State,BackwardOp,ForwardOp > { typedef First iter0; typedef State fwd_state0; typedef fwd_state0 bkwd_state0; typedef bkwd_state0 state; typedef iter0 iterator; }; template< typename First , typename Last , typename State , typename BackwardOp , typename ForwardOp > struct reverse_fold_impl< 1,First,Last,State,BackwardOp,ForwardOp > { typedef First iter0; typedef State fwd_state0; typedef typename apply2< ForwardOp, fwd_state0, typename deref::type >::type fwd_state1; typedef typename mpl::next::type iter1; typedef fwd_state1 bkwd_state1; typedef typename apply2< BackwardOp, bkwd_state1, typename deref::type >::type bkwd_state0; typedef bkwd_state0 state; typedef iter1 iterator; }; template< typename First , typename Last , typename State , typename BackwardOp , typename ForwardOp > struct reverse_fold_impl< 2,First,Last,State,BackwardOp,ForwardOp > { typedef First iter0; typedef State fwd_state0; typedef typename apply2< ForwardOp, fwd_state0, typename deref::type >::type fwd_state1; typedef typename mpl::next::type iter1; typedef typename apply2< ForwardOp, fwd_state1, typename deref::type >::type fwd_state2; typedef typename mpl::next::type iter2; typedef fwd_state2 bkwd_state2; typedef typename apply2< BackwardOp, bkwd_state2, typename deref::type >::type bkwd_state1; typedef typename apply2< BackwardOp, bkwd_state1, typename deref::type >::type bkwd_state0; typedef bkwd_state0 state; typedef iter2 iterator; }; template< typename First , typename Last , typename State , typename BackwardOp , typename ForwardOp > struct reverse_fold_impl< 3,First,Last,State,BackwardOp,ForwardOp > { typedef First iter0; typedef State fwd_state0; typedef typename apply2< ForwardOp, fwd_state0, typename deref::type >::type fwd_state1; typedef typename mpl::next::type iter1; typedef typename apply2< ForwardOp, fwd_state1, typename deref::type >::type fwd_state2; typedef typename mpl::next::type iter2; typedef typename apply2< ForwardOp, fwd_state2, typename deref::type >::type fwd_state3; typedef typename mpl::next::type iter3; typedef fwd_state3 bkwd_state3; typedef typename apply2< BackwardOp, bkwd_state3, typename deref::type >::type bkwd_state2; typedef typename apply2< BackwardOp, bkwd_state2, typename deref::type >::type bkwd_state1; typedef typename apply2< BackwardOp, bkwd_state1, typename deref::type >::type bkwd_state0; typedef bkwd_state0 state; typedef iter3 iterator; }; template< typename First , typename Last , typename State , typename BackwardOp , typename ForwardOp > struct reverse_fold_impl< 4,First,Last,State,BackwardOp,ForwardOp > { typedef First iter0; typedef State fwd_state0; typedef typename apply2< ForwardOp, fwd_state0, typename deref::type >::type fwd_state1; typedef typename mpl::next::type iter1; typedef typename apply2< ForwardOp, fwd_state1, typename deref::type >::type fwd_state2; typedef typename mpl::next::type iter2; typedef typename apply2< ForwardOp, fwd_state2, typename deref::type >::type fwd_state3; typedef typename mpl::next::type iter3; typedef typename apply2< ForwardOp, fwd_state3, typename deref::type >::type fwd_state4; typedef typename mpl::next::type iter4; typedef fwd_state4 bkwd_state4; typedef typename apply2< BackwardOp, bkwd_state4, typename deref::type >::type bkwd_state3; typedef typename apply2< BackwardOp, bkwd_state3, typename deref::type >::type bkwd_state2; typedef typename apply2< BackwardOp, bkwd_state2, typename deref::type >::type bkwd_state1; typedef typename apply2< BackwardOp, bkwd_state1, typename deref::type >::type bkwd_state0; typedef bkwd_state0 state; typedef iter4 iterator; }; template< long N , typename First , typename Last , typename State , typename BackwardOp , typename ForwardOp > struct reverse_fold_impl { typedef First iter0; typedef State fwd_state0; typedef typename apply2< ForwardOp, fwd_state0, typename deref::type >::type fwd_state1; typedef typename mpl::next::type iter1; typedef typename apply2< ForwardOp, fwd_state1, typename deref::type >::type fwd_state2; typedef typename mpl::next::type iter2; typedef typename apply2< ForwardOp, fwd_state2, typename deref::type >::type fwd_state3; typedef typename mpl::next::type iter3; typedef typename apply2< ForwardOp, fwd_state3, typename deref::type >::type fwd_state4; typedef typename mpl::next::type iter4; typedef reverse_fold_impl< ( (N - 4) < 0 ? 0 : N - 4 ) , iter4 , Last , fwd_state4 , BackwardOp , ForwardOp > nested_chunk; typedef typename nested_chunk::state bkwd_state4; typedef typename apply2< BackwardOp, bkwd_state4, typename deref::type >::type bkwd_state3; typedef typename apply2< BackwardOp, bkwd_state3, typename deref::type >::type bkwd_state2; typedef typename apply2< BackwardOp, bkwd_state2, typename deref::type >::type bkwd_state1; typedef typename apply2< BackwardOp, bkwd_state1, typename deref::type >::type bkwd_state0; typedef bkwd_state0 state; typedef typename nested_chunk::iterator iterator; }; template< typename First , typename Last , typename State , typename BackwardOp , typename ForwardOp > struct reverse_fold_impl< -1,First,Last,State,BackwardOp,ForwardOp > { typedef reverse_fold_impl< -1 , typename mpl::next::type , Last , typename apply2::type>::type , BackwardOp , ForwardOp > nested_step; typedef typename apply2< BackwardOp , typename nested_step::state , typename deref::type >::type state; typedef typename nested_step::iterator iterator; }; template< typename Last , typename State , typename BackwardOp , typename ForwardOp > struct reverse_fold_impl< -1,Last,Last,State,BackwardOp,ForwardOp > { typedef State state; typedef Last iterator; }; }}} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/template_arity.hpp0000644000000000000000000000007312717644140025537 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/template_arity.hpp0000664000372100037210000000526412717644140026376 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // *Preprocessed* version of the main "template_arity.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { namespace aux { template< int N > struct arity_tag { typedef char (&type)[N + 1]; }; template< int C1, int C2, int C3, int C4, int C5, int C6 > struct max_arity { BOOST_STATIC_CONSTANT(int, value = ( C6 > 0 ? C6 : ( C5 > 0 ? C5 : ( C4 > 0 ? C4 : ( C3 > 0 ? C3 : ( C2 > 0 ? C2 : ( C1 > 0 ? C1 : -1 ) ) ) ) ) ) ); }; arity_tag<0>::type arity_helper(...); template< template< typename P1 > class F , typename T1 > typename arity_tag<1>::type arity_helper(type_wrapper< F >, arity_tag<1>); template< template< typename P1, typename P2 > class F , typename T1, typename T2 > typename arity_tag<2>::type arity_helper(type_wrapper< F< T1,T2 > >, arity_tag<2>); template< template< typename P1, typename P2, typename P3 > class F , typename T1, typename T2, typename T3 > typename arity_tag<3>::type arity_helper(type_wrapper< F< T1,T2,T3 > >, arity_tag<3>); template< template< typename P1, typename P2, typename P3, typename P4 > class F , typename T1, typename T2, typename T3, typename T4 > typename arity_tag<4>::type arity_helper(type_wrapper< F< T1,T2,T3,T4 > >, arity_tag<4>); template< template< typename P1, typename P2, typename P3, typename P4 , typename P5 > class F , typename T1, typename T2, typename T3, typename T4, typename T5 > typename arity_tag<5>::type arity_helper(type_wrapper< F< T1,T2,T3,T4,T5 > >, arity_tag<5>); template< template< typename P1, typename P2, typename P3, typename P4 , typename P5, typename P6 > class F , typename T1, typename T2, typename T3, typename T4, typename T5 , typename T6 > typename arity_tag<6>::type arity_helper(type_wrapper< F< T1,T2,T3,T4,T5,T6 > >, arity_tag<6>); template< typename F, int N > struct template_arity_impl { BOOST_STATIC_CONSTANT(int, value = sizeof(::boost::mpl::aux::arity_helper(type_wrapper(), arity_tag())) - 1 ); }; template< typename F > struct template_arity { BOOST_STATIC_CONSTANT(int, value = ( max_arity< template_arity_impl< F,1 >::value, template_arity_impl< F,2 >::value, template_arity_impl< F,3 >::value, template_arity_impl< F,4 >::value, template_arity_impl< F,5 >::value, template_arity_impl< F,6 >::value >::value )); typedef mpl::int_ type; }; }}} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/less.hpp0000644000000000000000000000007312717644140023462 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/less.hpp0000664000372100037210000000376312717644140024323 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/less.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { template< typename Tag1 , typename Tag2 > struct less_impl : if_c< ( BOOST_MPL_AUX_NESTED_VALUE_WKND(int, Tag1) > BOOST_MPL_AUX_NESTED_VALUE_WKND(int, Tag2) ) , aux::cast2nd_impl< less_impl< Tag1,Tag1 >,Tag1, Tag2 > , aux::cast1st_impl< less_impl< Tag2,Tag2 >,Tag1, Tag2 > >::type { }; /// for Digital Mars C++/compilers with no CTPS/TTP support template<> struct less_impl< na,na > { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template< typename Tag > struct less_impl< na,Tag > { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template< typename Tag > struct less_impl< Tag,na > { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template< typename T > struct less_tag { typedef typename T::tag type; }; template< typename BOOST_MPL_AUX_NA_PARAM(N1) , typename BOOST_MPL_AUX_NA_PARAM(N2) > struct less : less_impl< typename less_tag::type , typename less_tag::type >::template apply< N1,N2 >::type { BOOST_MPL_AUX_LAMBDA_SUPPORT(2, less, (N1, N2)) }; BOOST_MPL_AUX_NA_SPEC2(2, 2, less) }} namespace boost { namespace mpl { template<> struct less_impl< integral_c_tag,integral_c_tag > { template< typename N1, typename N2 > struct apply : bool_< ( BOOST_MPL_AUX_VALUE_WKND(N2)::value > BOOST_MPL_AUX_VALUE_WKND(N1)::value ) > { }; }; }} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/plus.hpp0000644000000000000000000000007312717644140023477 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/plus.hpp0000664000372100037210000000603512717644140024333 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/plus.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { template< typename Tag1 , typename Tag2 > struct plus_impl : if_c< ( BOOST_MPL_AUX_NESTED_VALUE_WKND(int, Tag1) > BOOST_MPL_AUX_NESTED_VALUE_WKND(int, Tag2) ) , aux::cast2nd_impl< plus_impl< Tag1,Tag1 >,Tag1, Tag2 > , aux::cast1st_impl< plus_impl< Tag2,Tag2 >,Tag1, Tag2 > >::type { }; /// for Digital Mars C++/compilers with no CTPS/TTP support template<> struct plus_impl< na,na > { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template< typename Tag > struct plus_impl< na,Tag > { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template< typename Tag > struct plus_impl< Tag,na > { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template< typename T > struct plus_tag { typedef typename T::tag type; }; template< typename BOOST_MPL_AUX_NA_PARAM(N1) , typename BOOST_MPL_AUX_NA_PARAM(N2) , typename N3 = na, typename N4 = na, typename N5 = na > struct plus : plus< plus< plus< plus< N1,N2 >, N3>, N4>, N5> { BOOST_MPL_AUX_LAMBDA_SUPPORT( 5 , plus , ( N1, N2, N3, N4, N5 ) ) }; template< typename N1, typename N2, typename N3, typename N4 > struct plus< N1,N2,N3,N4,na > : plus< plus< plus< N1,N2 >, N3>, N4> { BOOST_MPL_AUX_LAMBDA_SUPPORT_SPEC( 5 , plus , ( N1, N2, N3, N4, na ) ) }; template< typename N1, typename N2, typename N3 > struct plus< N1,N2,N3,na,na > : plus< plus< N1,N2 >, N3> { BOOST_MPL_AUX_LAMBDA_SUPPORT_SPEC( 5 , plus , ( N1, N2, N3, na, na ) ) }; template< typename N1, typename N2 > struct plus< N1,N2,na,na,na > : plus_impl< typename plus_tag::type , typename plus_tag::type >::template apply< N1,N2 >::type { BOOST_MPL_AUX_LAMBDA_SUPPORT_SPEC( 5 , plus , ( N1, N2, na, na, na ) ) }; BOOST_MPL_AUX_NA_SPEC2(2, 5, plus) }} namespace boost { namespace mpl { template<> struct plus_impl< integral_c_tag,integral_c_tag > { template< typename N1, typename N2 > struct apply : integral_c< typename aux::largest_int< typename N1::value_type , typename N2::value_type >::type , ( BOOST_MPL_AUX_VALUE_WKND(N1)::value + BOOST_MPL_AUX_VALUE_WKND(N2)::value ) > { }; }; }} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/not_equal_to.hpp0000644000000000000000000000007312717644140025205 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/not_equal_to.hpp0000664000372100037210000000415412717644140026041 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/not_equal_to.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { template< typename Tag1 , typename Tag2 > struct not_equal_to_impl : if_c< ( BOOST_MPL_AUX_NESTED_VALUE_WKND(int, Tag1) > BOOST_MPL_AUX_NESTED_VALUE_WKND(int, Tag2) ) , aux::cast2nd_impl< not_equal_to_impl< Tag1,Tag1 >,Tag1, Tag2 > , aux::cast1st_impl< not_equal_to_impl< Tag2,Tag2 >,Tag1, Tag2 > >::type { }; /// for Digital Mars C++/compilers with no CTPS/TTP support template<> struct not_equal_to_impl< na,na > { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template< typename Tag > struct not_equal_to_impl< na,Tag > { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template< typename Tag > struct not_equal_to_impl< Tag,na > { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template< typename T > struct not_equal_to_tag { typedef typename T::tag type; }; template< typename BOOST_MPL_AUX_NA_PARAM(N1) , typename BOOST_MPL_AUX_NA_PARAM(N2) > struct not_equal_to : not_equal_to_impl< typename not_equal_to_tag::type , typename not_equal_to_tag::type >::template apply< N1,N2 >::type { BOOST_MPL_AUX_LAMBDA_SUPPORT(2, not_equal_to, (N1, N2)) }; BOOST_MPL_AUX_NA_SPEC2(2, 2, not_equal_to) }} namespace boost { namespace mpl { template<> struct not_equal_to_impl< integral_c_tag,integral_c_tag > { template< typename N1, typename N2 > struct apply : bool_< ( BOOST_MPL_AUX_VALUE_WKND(N1)::value != BOOST_MPL_AUX_VALUE_WKND(N2)::value ) > { }; }; }} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/or.hpp0000644000000000000000000000007312717644140023134 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/or.hpp0000664000372100037210000000235212717644140023766 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/or.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { namespace aux { template< bool C_, typename T1, typename T2, typename T3, typename T4 > struct or_impl : true_ { }; template< typename T1, typename T2, typename T3, typename T4 > struct or_impl< false,T1,T2,T3,T4 > : or_impl< BOOST_MPL_AUX_NESTED_TYPE_WKND(T1)::value , T2, T3, T4 , false_ > { }; template<> struct or_impl< false , false_, false_, false_, false_ > : false_ { }; } // namespace aux template< typename BOOST_MPL_AUX_NA_PARAM(T1) , typename BOOST_MPL_AUX_NA_PARAM(T2) , typename T3 = false_, typename T4 = false_, typename T5 = false_ > struct or_ : aux::or_impl< BOOST_MPL_AUX_NESTED_TYPE_WKND(T1)::value , T2, T3, T4, T5 > { BOOST_MPL_AUX_LAMBDA_SUPPORT( 5 , or_ , ( T1, T2, T3, T4, T5) ) }; BOOST_MPL_AUX_NA_SPEC2( 2 , 5 , or_ ) }} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/apply.hpp0000644000000000000000000000007412717644140023642 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/apply.hpp0000664000372100037210000000527012717644140024475 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/apply.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { template< typename F > struct apply0 : apply_wrap0< typename lambda::type > { BOOST_MPL_AUX_LAMBDA_SUPPORT( 1 , apply0 , (F ) ) }; template< typename F > struct apply< F,na,na,na,na,na > : apply0 { }; template< typename F, typename T1 > struct apply1 : apply_wrap1< typename lambda::type , T1 > { BOOST_MPL_AUX_LAMBDA_SUPPORT( 2 , apply1 , (F, T1) ) }; template< typename F, typename T1 > struct apply< F,T1,na,na,na,na > : apply1< F,T1 > { }; template< typename F, typename T1, typename T2 > struct apply2 : apply_wrap2< typename lambda::type , T1, T2 > { BOOST_MPL_AUX_LAMBDA_SUPPORT( 3 , apply2 , (F, T1, T2) ) }; template< typename F, typename T1, typename T2 > struct apply< F,T1,T2,na,na,na > : apply2< F,T1,T2 > { }; template< typename F, typename T1, typename T2, typename T3 > struct apply3 : apply_wrap3< typename lambda::type , T1, T2, T3 > { BOOST_MPL_AUX_LAMBDA_SUPPORT( 4 , apply3 , (F, T1, T2, T3) ) }; template< typename F, typename T1, typename T2, typename T3 > struct apply< F,T1,T2,T3,na,na > : apply3< F,T1,T2,T3 > { }; template< typename F, typename T1, typename T2, typename T3, typename T4 > struct apply4 : apply_wrap4< typename lambda::type , T1, T2, T3, T4 > { BOOST_MPL_AUX_LAMBDA_SUPPORT( 5 , apply4 , (F, T1, T2, T3, T4) ) }; template< typename F, typename T1, typename T2, typename T3, typename T4 > struct apply< F,T1,T2,T3,T4,na > : apply4< F,T1,T2,T3,T4 > { }; template< typename F, typename T1, typename T2, typename T3, typename T4 , typename T5 > struct apply5 : apply_wrap5< typename lambda::type , T1, T2, T3, T4, T5 > { BOOST_MPL_AUX_LAMBDA_SUPPORT( 6 , apply5 , (F, T1, T2, T3, T4, T5) ) }; /// primary template (not a specialization!) template< typename F, typename T1, typename T2, typename T3, typename T4 , typename T5 > struct apply : apply5< F,T1,T2,T3,T4,T5 > { }; }} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/greater.hpp0000644000000000000000000000007312717644140024145 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/greater.hpp0000664000372100037210000000404012717644140024773 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/greater.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { template< typename Tag1 , typename Tag2 > struct greater_impl : if_c< ( BOOST_MPL_AUX_NESTED_VALUE_WKND(int, Tag1) > BOOST_MPL_AUX_NESTED_VALUE_WKND(int, Tag2) ) , aux::cast2nd_impl< greater_impl< Tag1,Tag1 >,Tag1, Tag2 > , aux::cast1st_impl< greater_impl< Tag2,Tag2 >,Tag1, Tag2 > >::type { }; /// for Digital Mars C++/compilers with no CTPS/TTP support template<> struct greater_impl< na,na > { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template< typename Tag > struct greater_impl< na,Tag > { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template< typename Tag > struct greater_impl< Tag,na > { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template< typename T > struct greater_tag { typedef typename T::tag type; }; template< typename BOOST_MPL_AUX_NA_PARAM(N1) , typename BOOST_MPL_AUX_NA_PARAM(N2) > struct greater : greater_impl< typename greater_tag::type , typename greater_tag::type >::template apply< N1,N2 >::type { BOOST_MPL_AUX_LAMBDA_SUPPORT(2, greater, (N1, N2)) }; BOOST_MPL_AUX_NA_SPEC2(2, 2, greater) }} namespace boost { namespace mpl { template<> struct greater_impl< integral_c_tag,integral_c_tag > { template< typename N1, typename N2 > struct apply : bool_< ( BOOST_MPL_AUX_VALUE_WKND(N1)::value > BOOST_MPL_AUX_VALUE_WKND(N2)::value ) > { }; }; }} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/quote.hpp0000644000000000000000000000007312717644140023651 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/quote.hpp0000664000372100037210000000424612717644140024507 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/quote.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { template< typename T, bool has_type_ > struct quote_impl { typedef typename T::type type; }; template< typename T > struct quote_impl< T,false > { typedef T type; }; template< template< typename P1 > class F , typename Tag = void_ > struct quote1 { template< typename U1 > struct apply : quote_impl< F , aux::has_type< F >::value > { }; }; template< template< typename P1, typename P2 > class F , typename Tag = void_ > struct quote2 { template< typename U1, typename U2 > struct apply : quote_impl< F< U1,U2 > , aux::has_type< F< U1,U2 > >::value > { }; }; template< template< typename P1, typename P2, typename P3 > class F , typename Tag = void_ > struct quote3 { template< typename U1, typename U2, typename U3 > struct apply : quote_impl< F< U1,U2,U3 > , aux::has_type< F< U1,U2,U3 > >::value > { }; }; template< template< typename P1, typename P2, typename P3, typename P4 > class F , typename Tag = void_ > struct quote4 { template< typename U1, typename U2, typename U3, typename U4 > struct apply : quote_impl< F< U1,U2,U3,U4 > , aux::has_type< F< U1,U2,U3,U4 > >::value > { }; }; template< template< typename P1, typename P2, typename P3, typename P4 , typename P5 > class F , typename Tag = void_ > struct quote5 { template< typename U1, typename U2, typename U3, typename U4 , typename U5 > struct apply : quote_impl< F< U1,U2,U3,U4,U5 > , aux::has_type< F< U1,U2,U3,U4,U5 > >::value > { }; }; }} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/fold_impl.hpp0000644000000000000000000000007312717644140024461 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/fold_impl.hpp0000664000372100037210000001040212717644140025306 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/aux_/fold_impl.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { namespace aux { /// forward declaration template< int N , typename First , typename Last , typename State , typename ForwardOp > struct fold_impl; template< typename First , typename Last , typename State , typename ForwardOp > struct fold_impl< 0,First,Last,State,ForwardOp > { typedef First iter0; typedef State state0; typedef state0 state; typedef iter0 iterator; }; template< typename First , typename Last , typename State , typename ForwardOp > struct fold_impl< 1,First,Last,State,ForwardOp > { typedef First iter0; typedef State state0; typedef typename apply2< ForwardOp, state0, typename deref::type >::type state1; typedef typename mpl::next::type iter1; typedef state1 state; typedef iter1 iterator; }; template< typename First , typename Last , typename State , typename ForwardOp > struct fold_impl< 2,First,Last,State,ForwardOp > { typedef First iter0; typedef State state0; typedef typename apply2< ForwardOp, state0, typename deref::type >::type state1; typedef typename mpl::next::type iter1; typedef typename apply2< ForwardOp, state1, typename deref::type >::type state2; typedef typename mpl::next::type iter2; typedef state2 state; typedef iter2 iterator; }; template< typename First , typename Last , typename State , typename ForwardOp > struct fold_impl< 3,First,Last,State,ForwardOp > { typedef First iter0; typedef State state0; typedef typename apply2< ForwardOp, state0, typename deref::type >::type state1; typedef typename mpl::next::type iter1; typedef typename apply2< ForwardOp, state1, typename deref::type >::type state2; typedef typename mpl::next::type iter2; typedef typename apply2< ForwardOp, state2, typename deref::type >::type state3; typedef typename mpl::next::type iter3; typedef state3 state; typedef iter3 iterator; }; template< typename First , typename Last , typename State , typename ForwardOp > struct fold_impl< 4,First,Last,State,ForwardOp > { typedef First iter0; typedef State state0; typedef typename apply2< ForwardOp, state0, typename deref::type >::type state1; typedef typename mpl::next::type iter1; typedef typename apply2< ForwardOp, state1, typename deref::type >::type state2; typedef typename mpl::next::type iter2; typedef typename apply2< ForwardOp, state2, typename deref::type >::type state3; typedef typename mpl::next::type iter3; typedef typename apply2< ForwardOp, state3, typename deref::type >::type state4; typedef typename mpl::next::type iter4; typedef state4 state; typedef iter4 iterator; }; template< int N , typename First , typename Last , typename State , typename ForwardOp > struct fold_impl { typedef fold_impl< 4 , First , Last , State , ForwardOp > chunk_; typedef fold_impl< ( (N - 4) < 0 ? 0 : N - 4 ) , typename chunk_::iterator , Last , typename chunk_::state , ForwardOp > res_; typedef typename res_::state state; typedef typename res_::iterator iterator; }; template< typename First , typename Last , typename State , typename ForwardOp > struct fold_impl< -1,First,Last,State,ForwardOp > : fold_impl< -1 , typename mpl::next::type , Last , typename apply2::type>::type , ForwardOp > { }; template< typename Last , typename State , typename ForwardOp > struct fold_impl< -1,Last,Last,State,ForwardOp > { typedef State state; typedef Last iterator; }; }}} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/bind.hpp0000644000000000000000000000007412717644140023431 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/bind.hpp0000664000372100037210000003411112717644140024260 0ustar00fransfrans00000000000000 // Copyright Peter Dimov 2001 // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/bind.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { namespace aux { template< typename T, typename U1, typename U2, typename U3, typename U4 , typename U5 > struct resolve_bind_arg { typedef T type; }; template< typename T , typename Arg > struct replace_unnamed_arg { typedef Arg next; typedef T type; }; template< typename Arg > struct replace_unnamed_arg< arg< -1 >, Arg > { typedef typename Arg::next next; typedef Arg type; }; template< int N, typename U1, typename U2, typename U3, typename U4, typename U5 > struct resolve_bind_arg< arg, U1, U2, U3, U4, U5 > { typedef typename apply_wrap5, U1, U2, U3, U4, U5>::type type; }; template< typename F, typename T1, typename T2, typename T3, typename T4 , typename T5, typename U1, typename U2, typename U3, typename U4 , typename U5 > struct resolve_bind_arg< bind< F,T1,T2,T3,T4,T5 >, U1, U2, U3, U4, U5 > { typedef bind< F,T1,T2,T3,T4,T5 > f_; typedef typename apply_wrap5< f_,U1,U2,U3,U4,U5 >::type type; }; } // namespace aux template< typename F > struct bind0 { template< typename U1 = na, typename U2 = na, typename U3 = na , typename U4 = na, typename U5 = na > struct apply { private: typedef aux::replace_unnamed_arg< F, mpl::arg<1> > r0; typedef typename r0::type a0; typedef typename r0::next n1; typedef typename aux::resolve_bind_arg< a0,U1,U2,U3,U4,U5 >::type f_; /// public: typedef typename apply_wrap0< f_ >::type type; }; }; namespace aux { template< typename F, typename U1, typename U2, typename U3, typename U4 , typename U5 > struct resolve_bind_arg< bind0, U1, U2, U3, U4, U5 > { typedef bind0 f_; typedef typename apply_wrap5< f_,U1,U2,U3,U4,U5 >::type type; }; } // namespace aux BOOST_MPL_AUX_ARITY_SPEC(1, bind0) BOOST_MPL_AUX_TEMPLATE_ARITY_SPEC(1, bind0) template< typename F > struct bind< F,na,na,na,na,na > : bind0 { }; template< typename F, typename T1 > struct bind1 { template< typename U1 = na, typename U2 = na, typename U3 = na , typename U4 = na, typename U5 = na > struct apply { private: typedef aux::replace_unnamed_arg< F, mpl::arg<1> > r0; typedef typename r0::type a0; typedef typename r0::next n1; typedef typename aux::resolve_bind_arg< a0,U1,U2,U3,U4,U5 >::type f_; /// typedef aux::replace_unnamed_arg< T1,n1 > r1; typedef typename r1::type a1; typedef typename r1::next n2; typedef aux::resolve_bind_arg< a1,U1,U2,U3,U4,U5 > t1; /// public: typedef typename apply_wrap1< f_ , typename t1::type >::type type; }; }; namespace aux { template< typename F, typename T1, typename U1, typename U2, typename U3 , typename U4, typename U5 > struct resolve_bind_arg< bind1< F,T1 >, U1, U2, U3, U4, U5 > { typedef bind1< F,T1 > f_; typedef typename apply_wrap5< f_,U1,U2,U3,U4,U5 >::type type; }; } // namespace aux BOOST_MPL_AUX_ARITY_SPEC(2, bind1) BOOST_MPL_AUX_TEMPLATE_ARITY_SPEC(2, bind1) template< typename F, typename T1 > struct bind< F,T1,na,na,na,na > : bind1< F,T1 > { }; template< typename F, typename T1, typename T2 > struct bind2 { template< typename U1 = na, typename U2 = na, typename U3 = na , typename U4 = na, typename U5 = na > struct apply { private: typedef aux::replace_unnamed_arg< F, mpl::arg<1> > r0; typedef typename r0::type a0; typedef typename r0::next n1; typedef typename aux::resolve_bind_arg< a0,U1,U2,U3,U4,U5 >::type f_; /// typedef aux::replace_unnamed_arg< T1,n1 > r1; typedef typename r1::type a1; typedef typename r1::next n2; typedef aux::resolve_bind_arg< a1,U1,U2,U3,U4,U5 > t1; /// typedef aux::replace_unnamed_arg< T2,n2 > r2; typedef typename r2::type a2; typedef typename r2::next n3; typedef aux::resolve_bind_arg< a2,U1,U2,U3,U4,U5 > t2; /// public: typedef typename apply_wrap2< f_ , typename t1::type, typename t2::type >::type type; }; }; namespace aux { template< typename F, typename T1, typename T2, typename U1, typename U2 , typename U3, typename U4, typename U5 > struct resolve_bind_arg< bind2< F,T1,T2 >, U1, U2, U3, U4, U5 > { typedef bind2< F,T1,T2 > f_; typedef typename apply_wrap5< f_,U1,U2,U3,U4,U5 >::type type; }; } // namespace aux BOOST_MPL_AUX_ARITY_SPEC(3, bind2) BOOST_MPL_AUX_TEMPLATE_ARITY_SPEC(3, bind2) template< typename F, typename T1, typename T2 > struct bind< F,T1,T2,na,na,na > : bind2< F,T1,T2 > { }; template< typename F, typename T1, typename T2, typename T3 > struct bind3 { template< typename U1 = na, typename U2 = na, typename U3 = na , typename U4 = na, typename U5 = na > struct apply { private: typedef aux::replace_unnamed_arg< F, mpl::arg<1> > r0; typedef typename r0::type a0; typedef typename r0::next n1; typedef typename aux::resolve_bind_arg< a0,U1,U2,U3,U4,U5 >::type f_; /// typedef aux::replace_unnamed_arg< T1,n1 > r1; typedef typename r1::type a1; typedef typename r1::next n2; typedef aux::resolve_bind_arg< a1,U1,U2,U3,U4,U5 > t1; /// typedef aux::replace_unnamed_arg< T2,n2 > r2; typedef typename r2::type a2; typedef typename r2::next n3; typedef aux::resolve_bind_arg< a2,U1,U2,U3,U4,U5 > t2; /// typedef aux::replace_unnamed_arg< T3,n3 > r3; typedef typename r3::type a3; typedef typename r3::next n4; typedef aux::resolve_bind_arg< a3,U1,U2,U3,U4,U5 > t3; /// public: typedef typename apply_wrap3< f_ , typename t1::type, typename t2::type, typename t3::type >::type type; }; }; namespace aux { template< typename F, typename T1, typename T2, typename T3, typename U1 , typename U2, typename U3, typename U4, typename U5 > struct resolve_bind_arg< bind3< F,T1,T2,T3 >, U1, U2, U3, U4, U5 > { typedef bind3< F,T1,T2,T3 > f_; typedef typename apply_wrap5< f_,U1,U2,U3,U4,U5 >::type type; }; } // namespace aux BOOST_MPL_AUX_ARITY_SPEC(4, bind3) BOOST_MPL_AUX_TEMPLATE_ARITY_SPEC(4, bind3) template< typename F, typename T1, typename T2, typename T3 > struct bind< F,T1,T2,T3,na,na > : bind3< F,T1,T2,T3 > { }; template< typename F, typename T1, typename T2, typename T3, typename T4 > struct bind4 { template< typename U1 = na, typename U2 = na, typename U3 = na , typename U4 = na, typename U5 = na > struct apply { private: typedef aux::replace_unnamed_arg< F, mpl::arg<1> > r0; typedef typename r0::type a0; typedef typename r0::next n1; typedef typename aux::resolve_bind_arg< a0,U1,U2,U3,U4,U5 >::type f_; /// typedef aux::replace_unnamed_arg< T1,n1 > r1; typedef typename r1::type a1; typedef typename r1::next n2; typedef aux::resolve_bind_arg< a1,U1,U2,U3,U4,U5 > t1; /// typedef aux::replace_unnamed_arg< T2,n2 > r2; typedef typename r2::type a2; typedef typename r2::next n3; typedef aux::resolve_bind_arg< a2,U1,U2,U3,U4,U5 > t2; /// typedef aux::replace_unnamed_arg< T3,n3 > r3; typedef typename r3::type a3; typedef typename r3::next n4; typedef aux::resolve_bind_arg< a3,U1,U2,U3,U4,U5 > t3; /// typedef aux::replace_unnamed_arg< T4,n4 > r4; typedef typename r4::type a4; typedef typename r4::next n5; typedef aux::resolve_bind_arg< a4,U1,U2,U3,U4,U5 > t4; /// public: typedef typename apply_wrap4< f_ , typename t1::type, typename t2::type, typename t3::type , typename t4::type >::type type; }; }; namespace aux { template< typename F, typename T1, typename T2, typename T3, typename T4 , typename U1, typename U2, typename U3, typename U4, typename U5 > struct resolve_bind_arg< bind4< F,T1,T2,T3,T4 >, U1, U2, U3, U4, U5 > { typedef bind4< F,T1,T2,T3,T4 > f_; typedef typename apply_wrap5< f_,U1,U2,U3,U4,U5 >::type type; }; } // namespace aux BOOST_MPL_AUX_ARITY_SPEC(5, bind4) BOOST_MPL_AUX_TEMPLATE_ARITY_SPEC(5, bind4) template< typename F, typename T1, typename T2, typename T3, typename T4 > struct bind< F,T1,T2,T3,T4,na > : bind4< F,T1,T2,T3,T4 > { }; template< typename F, typename T1, typename T2, typename T3, typename T4 , typename T5 > struct bind5 { template< typename U1 = na, typename U2 = na, typename U3 = na , typename U4 = na, typename U5 = na > struct apply { private: typedef aux::replace_unnamed_arg< F, mpl::arg<1> > r0; typedef typename r0::type a0; typedef typename r0::next n1; typedef typename aux::resolve_bind_arg< a0,U1,U2,U3,U4,U5 >::type f_; /// typedef aux::replace_unnamed_arg< T1,n1 > r1; typedef typename r1::type a1; typedef typename r1::next n2; typedef aux::resolve_bind_arg< a1,U1,U2,U3,U4,U5 > t1; /// typedef aux::replace_unnamed_arg< T2,n2 > r2; typedef typename r2::type a2; typedef typename r2::next n3; typedef aux::resolve_bind_arg< a2,U1,U2,U3,U4,U5 > t2; /// typedef aux::replace_unnamed_arg< T3,n3 > r3; typedef typename r3::type a3; typedef typename r3::next n4; typedef aux::resolve_bind_arg< a3,U1,U2,U3,U4,U5 > t3; /// typedef aux::replace_unnamed_arg< T4,n4 > r4; typedef typename r4::type a4; typedef typename r4::next n5; typedef aux::resolve_bind_arg< a4,U1,U2,U3,U4,U5 > t4; /// typedef aux::replace_unnamed_arg< T5,n5 > r5; typedef typename r5::type a5; typedef typename r5::next n6; typedef aux::resolve_bind_arg< a5,U1,U2,U3,U4,U5 > t5; /// public: typedef typename apply_wrap5< f_ , typename t1::type, typename t2::type, typename t3::type , typename t4::type, typename t5::type >::type type; }; }; namespace aux { template< typename F, typename T1, typename T2, typename T3, typename T4 , typename T5, typename U1, typename U2, typename U3, typename U4 , typename U5 > struct resolve_bind_arg< bind5< F,T1,T2,T3,T4,T5 >, U1, U2, U3, U4, U5 > { typedef bind5< F,T1,T2,T3,T4,T5 > f_; typedef typename apply_wrap5< f_,U1,U2,U3,U4,U5 >::type type; }; } // namespace aux BOOST_MPL_AUX_ARITY_SPEC(6, bind5) BOOST_MPL_AUX_TEMPLATE_ARITY_SPEC(6, bind5) /// primary template (not a specialization!) template< typename F, typename T1, typename T2, typename T3, typename T4 , typename T5 > struct bind : bind5< F,T1,T2,T3,T4,T5 > { }; /// if_/eval_if specializations template< template< typename T1, typename T2, typename T3 > class F, typename Tag > struct quote3; template< typename T1, typename T2, typename T3 > struct if_; template< typename Tag, typename T1, typename T2, typename T3 > struct bind3< quote3< if_,Tag > , T1, T2, T3 > { template< typename U1 = na, typename U2 = na, typename U3 = na , typename U4 = na, typename U5 = na > struct apply { private: typedef mpl::arg<1> n1; typedef aux::replace_unnamed_arg< T1,n1 > r1; typedef typename r1::type a1; typedef typename r1::next n2; typedef aux::resolve_bind_arg< a1,U1,U2,U3,U4,U5 > t1; /// typedef aux::replace_unnamed_arg< T2,n2 > r2; typedef typename r2::type a2; typedef typename r2::next n3; typedef aux::resolve_bind_arg< a2,U1,U2,U3,U4,U5 > t2; /// typedef aux::replace_unnamed_arg< T3,n3 > r3; typedef typename r3::type a3; typedef typename r3::next n4; typedef aux::resolve_bind_arg< a3,U1,U2,U3,U4,U5 > t3; /// typedef typename if_< typename t1::type , t2, t3 >::type f_; public: typedef typename f_::type type; }; }; template< template< typename T1, typename T2, typename T3 > class F, typename Tag > struct quote3; template< typename T1, typename T2, typename T3 > struct eval_if; template< typename Tag, typename T1, typename T2, typename T3 > struct bind3< quote3< eval_if,Tag > , T1, T2, T3 > { template< typename U1 = na, typename U2 = na, typename U3 = na , typename U4 = na, typename U5 = na > struct apply { private: typedef mpl::arg<1> n1; typedef aux::replace_unnamed_arg< T1,n1 > r1; typedef typename r1::type a1; typedef typename r1::next n2; typedef aux::resolve_bind_arg< a1,U1,U2,U3,U4,U5 > t1; /// typedef aux::replace_unnamed_arg< T2,n2 > r2; typedef typename r2::type a2; typedef typename r2::next n3; typedef aux::resolve_bind_arg< a2,U1,U2,U3,U4,U5 > t2; /// typedef aux::replace_unnamed_arg< T3,n3 > r3; typedef typename r3::type a3; typedef typename r3::next n4; typedef aux::resolve_bind_arg< a3,U1,U2,U3,U4,U5 > t3; /// typedef typename eval_if< typename t1::type , t2, t3 >::type f_; public: typedef typename f_::type type; }; }; }} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/greater_equal.hpp0000644000000000000000000000007312717644140025334 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/greater_equal.hpp0000664000372100037210000000417312717644140026171 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/greater_equal.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { template< typename Tag1 , typename Tag2 > struct greater_equal_impl : if_c< ( BOOST_MPL_AUX_NESTED_VALUE_WKND(int, Tag1) > BOOST_MPL_AUX_NESTED_VALUE_WKND(int, Tag2) ) , aux::cast2nd_impl< greater_equal_impl< Tag1,Tag1 >,Tag1, Tag2 > , aux::cast1st_impl< greater_equal_impl< Tag2,Tag2 >,Tag1, Tag2 > >::type { }; /// for Digital Mars C++/compilers with no CTPS/TTP support template<> struct greater_equal_impl< na,na > { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template< typename Tag > struct greater_equal_impl< na,Tag > { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template< typename Tag > struct greater_equal_impl< Tag,na > { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template< typename T > struct greater_equal_tag { typedef typename T::tag type; }; template< typename BOOST_MPL_AUX_NA_PARAM(N1) , typename BOOST_MPL_AUX_NA_PARAM(N2) > struct greater_equal : greater_equal_impl< typename greater_equal_tag::type , typename greater_equal_tag::type >::template apply< N1,N2 >::type { BOOST_MPL_AUX_LAMBDA_SUPPORT(2, greater_equal, (N1, N2)) }; BOOST_MPL_AUX_NA_SPEC2(2, 2, greater_equal) }} namespace boost { namespace mpl { template<> struct greater_equal_impl< integral_c_tag,integral_c_tag > { template< typename N1, typename N2 > struct apply : bool_< ( BOOST_MPL_AUX_VALUE_WKND(N1)::value >= BOOST_MPL_AUX_VALUE_WKND(N2)::value ) > { }; }; }} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/vector.hpp0000644000000000000000000000007312717644140024016 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/vector.hpp0000664000372100037210000002302212717644140024645 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/vector.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { template< typename T0 = na, typename T1 = na, typename T2 = na, typename T3 = na , typename T4 = na, typename T5 = na, typename T6 = na, typename T7 = na , typename T8 = na, typename T9 = na, typename T10 = na, typename T11 = na , typename T12 = na, typename T13 = na, typename T14 = na , typename T15 = na, typename T16 = na, typename T17 = na , typename T18 = na, typename T19 = na > struct vector; template< > struct vector< na, na, na, na, na, na, na, na, na, na, na, na, na, na, na, na, na , na, na, na > : vector0< > { typedef vector0< >::type type; }; template< typename T0 > struct vector< T0, na, na, na, na, na, na, na, na, na, na, na, na, na, na, na, na , na, na, na > : vector1 { typedef typename vector1::type type; }; template< typename T0, typename T1 > struct vector< T0, T1, na, na, na, na, na, na, na, na, na, na, na, na, na, na, na , na, na, na > : vector2< T0,T1 > { typedef typename vector2< T0,T1 >::type type; }; template< typename T0, typename T1, typename T2 > struct vector< T0, T1, T2, na, na, na, na, na, na, na, na, na, na, na, na, na, na , na, na, na > : vector3< T0,T1,T2 > { typedef typename vector3< T0,T1,T2 >::type type; }; template< typename T0, typename T1, typename T2, typename T3 > struct vector< T0, T1, T2, T3, na, na, na, na, na, na, na, na, na, na, na, na, na , na, na, na > : vector4< T0,T1,T2,T3 > { typedef typename vector4< T0,T1,T2,T3 >::type type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 > struct vector< T0, T1, T2, T3, T4, na, na, na, na, na, na, na, na, na, na, na, na , na, na, na > : vector5< T0,T1,T2,T3,T4 > { typedef typename vector5< T0,T1,T2,T3,T4 >::type type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5 > struct vector< T0, T1, T2, T3, T4, T5, na, na, na, na, na, na, na, na, na, na, na , na, na, na > : vector6< T0,T1,T2,T3,T4,T5 > { typedef typename vector6< T0,T1,T2,T3,T4,T5 >::type type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6 > struct vector< T0, T1, T2, T3, T4, T5, T6, na, na, na, na, na, na, na, na, na, na , na, na, na > : vector7< T0,T1,T2,T3,T4,T5,T6 > { typedef typename vector7< T0,T1,T2,T3,T4,T5,T6 >::type type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7 > struct vector< T0, T1, T2, T3, T4, T5, T6, T7, na, na, na, na, na, na, na, na, na , na, na, na > : vector8< T0,T1,T2,T3,T4,T5,T6,T7 > { typedef typename vector8< T0,T1,T2,T3,T4,T5,T6,T7 >::type type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7, typename T8 > struct vector< T0, T1, T2, T3, T4, T5, T6, T7, T8, na, na, na, na, na, na, na, na , na, na, na > : vector9< T0,T1,T2,T3,T4,T5,T6,T7,T8 > { typedef typename vector9< T0,T1,T2,T3,T4,T5,T6,T7,T8 >::type type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7, typename T8, typename T9 > struct vector< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, na, na, na, na, na, na, na , na, na, na > : vector10< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9 > { typedef typename vector10< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9 >::type type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7, typename T8, typename T9 , typename T10 > struct vector< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, na, na, na, na, na, na , na, na, na > : vector11< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10 > { typedef typename vector11< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10 >::type type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7, typename T8, typename T9 , typename T10, typename T11 > struct vector< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, na, na, na, na , na, na, na, na > : vector12< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11 > { typedef typename vector12< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11 >::type type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7, typename T8, typename T9 , typename T10, typename T11, typename T12 > struct vector< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, na, na, na , na, na, na, na > : vector13< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12 > { typedef typename vector13< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12 >::type type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7, typename T8, typename T9 , typename T10, typename T11, typename T12, typename T13 > struct vector< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, na, na , na, na, na, na > : vector14< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13 > { typedef typename vector14< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13 >::type type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7, typename T8, typename T9 , typename T10, typename T11, typename T12, typename T13, typename T14 > struct vector< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, na , na, na, na, na > : vector15< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14 > { typedef typename vector15< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14 >::type type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7, typename T8, typename T9 , typename T10, typename T11, typename T12, typename T13, typename T14 , typename T15 > struct vector< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14 , T15, na, na, na, na > : vector16< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14 , T15 > { typedef typename vector16< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14,T15 >::type type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7, typename T8, typename T9 , typename T10, typename T11, typename T12, typename T13, typename T14 , typename T15, typename T16 > struct vector< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14 , T15, T16, na, na, na > : vector17< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14 , T15, T16 > { typedef typename vector17< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14,T15,T16 >::type type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7, typename T8, typename T9 , typename T10, typename T11, typename T12, typename T13, typename T14 , typename T15, typename T16, typename T17 > struct vector< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14 , T15, T16, T17, na, na > : vector18< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14 , T15, T16, T17 > { typedef typename vector18< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14,T15,T16,T17 >::type type; }; template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7, typename T8, typename T9 , typename T10, typename T11, typename T12, typename T13, typename T14 , typename T15, typename T16, typename T17, typename T18 > struct vector< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14 , T15, T16, T17, T18, na > : vector19< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14 , T15, T16, T17, T18 > { typedef typename vector19< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14,T15,T16,T17,T18 >::type type; }; /// primary template (not a specialization!) template< typename T0, typename T1, typename T2, typename T3, typename T4 , typename T5, typename T6, typename T7, typename T8, typename T9 , typename T10, typename T11, typename T12, typename T13, typename T14 , typename T15, typename T16, typename T17, typename T18, typename T19 > struct vector : vector20< T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14 , T15, T16, T17, T18, T19 > { typedef typename vector20< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14,T15,T16,T17,T18,T19 >::type type; }; }} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/minus.hpp0000644000000000000000000000007312717644140023647 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/minus.hpp0000664000372100037210000000607312717644140024505 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/minus.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { template< typename Tag1 , typename Tag2 > struct minus_impl : if_c< ( BOOST_MPL_AUX_NESTED_VALUE_WKND(int, Tag1) > BOOST_MPL_AUX_NESTED_VALUE_WKND(int, Tag2) ) , aux::cast2nd_impl< minus_impl< Tag1,Tag1 >,Tag1, Tag2 > , aux::cast1st_impl< minus_impl< Tag2,Tag2 >,Tag1, Tag2 > >::type { }; /// for Digital Mars C++/compilers with no CTPS/TTP support template<> struct minus_impl< na,na > { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template< typename Tag > struct minus_impl< na,Tag > { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template< typename Tag > struct minus_impl< Tag,na > { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template< typename T > struct minus_tag { typedef typename T::tag type; }; template< typename BOOST_MPL_AUX_NA_PARAM(N1) , typename BOOST_MPL_AUX_NA_PARAM(N2) , typename N3 = na, typename N4 = na, typename N5 = na > struct minus : minus< minus< minus< minus< N1,N2 >, N3>, N4>, N5> { BOOST_MPL_AUX_LAMBDA_SUPPORT( 5 , minus , ( N1, N2, N3, N4, N5 ) ) }; template< typename N1, typename N2, typename N3, typename N4 > struct minus< N1,N2,N3,N4,na > : minus< minus< minus< N1,N2 >, N3>, N4> { BOOST_MPL_AUX_LAMBDA_SUPPORT_SPEC( 5 , minus , ( N1, N2, N3, N4, na ) ) }; template< typename N1, typename N2, typename N3 > struct minus< N1,N2,N3,na,na > : minus< minus< N1,N2 >, N3> { BOOST_MPL_AUX_LAMBDA_SUPPORT_SPEC( 5 , minus , ( N1, N2, N3, na, na ) ) }; template< typename N1, typename N2 > struct minus< N1,N2,na,na,na > : minus_impl< typename minus_tag::type , typename minus_tag::type >::template apply< N1,N2 >::type { BOOST_MPL_AUX_LAMBDA_SUPPORT_SPEC( 5 , minus , ( N1, N2, na, na, na ) ) }; BOOST_MPL_AUX_NA_SPEC2(2, 5, minus) }} namespace boost { namespace mpl { template<> struct minus_impl< integral_c_tag,integral_c_tag > { template< typename N1, typename N2 > struct apply : integral_c< typename aux::largest_int< typename N1::value_type , typename N2::value_type >::type , ( BOOST_MPL_AUX_VALUE_WKND(N1)::value - BOOST_MPL_AUX_VALUE_WKND(N2)::value ) > { }; }; }} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/apply_fwd.hpp0000644000000000000000000000007412717644140024502 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/apply_fwd.hpp0000664000372100037210000000171412717644140025334 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/apply_fwd.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { template< typename F, typename T1 = na, typename T2 = na, typename T3 = na , typename T4 = na, typename T5 = na > struct apply; template< typename F > struct apply0; template< typename F, typename T1 > struct apply1; template< typename F, typename T1, typename T2 > struct apply2; template< typename F, typename T1, typename T2, typename T3 > struct apply3; template< typename F, typename T1, typename T2, typename T3, typename T4 > struct apply4; template< typename F, typename T1, typename T2, typename T3, typename T4 , typename T5 > struct apply5; }} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/placeholders.hpp0000644000000000000000000000007312717644140025161 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/placeholders.hpp0000664000372100037210000000424312717644140026014 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2001-2004 // Copyright Peter Dimov 2001-2003 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/placeholders.hpp" header // -- DO NOT modify by hand! BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN typedef arg< -1 > _; BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE namespace boost { namespace mpl { BOOST_MPL_AUX_ARG_ADL_BARRIER_DECL(_) namespace placeholders { using BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE::_; } }} /// agurt, 17/mar/02: one more placeholder for the last 'apply#' /// specialization BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN typedef arg<1> _1; BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE namespace boost { namespace mpl { BOOST_MPL_AUX_ARG_ADL_BARRIER_DECL(_1) namespace placeholders { using BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE::_1; } }} BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN typedef arg<2> _2; BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE namespace boost { namespace mpl { BOOST_MPL_AUX_ARG_ADL_BARRIER_DECL(_2) namespace placeholders { using BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE::_2; } }} BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN typedef arg<3> _3; BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE namespace boost { namespace mpl { BOOST_MPL_AUX_ARG_ADL_BARRIER_DECL(_3) namespace placeholders { using BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE::_3; } }} BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN typedef arg<4> _4; BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE namespace boost { namespace mpl { BOOST_MPL_AUX_ARG_ADL_BARRIER_DECL(_4) namespace placeholders { using BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE::_4; } }} BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN typedef arg<5> _5; BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE namespace boost { namespace mpl { BOOST_MPL_AUX_ARG_ADL_BARRIER_DECL(_5) namespace placeholders { using BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE::_5; } }} BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN typedef arg<6> _6; BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE namespace boost { namespace mpl { BOOST_MPL_AUX_ARG_ADL_BARRIER_DECL(_6) namespace placeholders { using BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE::_6; } }} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/iter_fold_impl.hpp0000644000000000000000000000007312717644140025504 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/iter_fold_impl.hpp0000664000372100037210000001007612717644140026340 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/aux_/iter_fold_impl.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { namespace aux { /// forward declaration template< int N , typename First , typename Last , typename State , typename ForwardOp > struct iter_fold_impl; template< typename First , typename Last , typename State , typename ForwardOp > struct iter_fold_impl< 0,First,Last,State,ForwardOp > { typedef First iter0; typedef State state0; typedef state0 state; typedef iter0 iterator; }; template< typename First , typename Last , typename State , typename ForwardOp > struct iter_fold_impl< 1,First,Last,State,ForwardOp > { typedef First iter0; typedef State state0; typedef typename apply2< ForwardOp,state0,iter0 >::type state1; typedef typename mpl::next::type iter1; typedef state1 state; typedef iter1 iterator; }; template< typename First , typename Last , typename State , typename ForwardOp > struct iter_fold_impl< 2,First,Last,State,ForwardOp > { typedef First iter0; typedef State state0; typedef typename apply2< ForwardOp,state0,iter0 >::type state1; typedef typename mpl::next::type iter1; typedef typename apply2< ForwardOp,state1,iter1 >::type state2; typedef typename mpl::next::type iter2; typedef state2 state; typedef iter2 iterator; }; template< typename First , typename Last , typename State , typename ForwardOp > struct iter_fold_impl< 3,First,Last,State,ForwardOp > { typedef First iter0; typedef State state0; typedef typename apply2< ForwardOp,state0,iter0 >::type state1; typedef typename mpl::next::type iter1; typedef typename apply2< ForwardOp,state1,iter1 >::type state2; typedef typename mpl::next::type iter2; typedef typename apply2< ForwardOp,state2,iter2 >::type state3; typedef typename mpl::next::type iter3; typedef state3 state; typedef iter3 iterator; }; template< typename First , typename Last , typename State , typename ForwardOp > struct iter_fold_impl< 4,First,Last,State,ForwardOp > { typedef First iter0; typedef State state0; typedef typename apply2< ForwardOp,state0,iter0 >::type state1; typedef typename mpl::next::type iter1; typedef typename apply2< ForwardOp,state1,iter1 >::type state2; typedef typename mpl::next::type iter2; typedef typename apply2< ForwardOp,state2,iter2 >::type state3; typedef typename mpl::next::type iter3; typedef typename apply2< ForwardOp,state3,iter3 >::type state4; typedef typename mpl::next::type iter4; typedef state4 state; typedef iter4 iterator; }; template< int N , typename First , typename Last , typename State , typename ForwardOp > struct iter_fold_impl { typedef iter_fold_impl< 4 , First , Last , State , ForwardOp > chunk_; typedef iter_fold_impl< ( (N - 4) < 0 ? 0 : N - 4 ) , typename chunk_::iterator , Last , typename chunk_::state , ForwardOp > res_; typedef typename res_::state state; typedef typename res_::iterator iterator; }; template< typename First , typename Last , typename State , typename ForwardOp > struct iter_fold_impl< -1,First,Last,State,ForwardOp > : iter_fold_impl< -1 , typename mpl::next::type , Last , typename apply2< ForwardOp,State,First >::type , ForwardOp > { }; template< typename Last , typename State , typename ForwardOp > struct iter_fold_impl< -1,Last,Last,State,ForwardOp > { typedef State state; typedef Last iterator; }; }}} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/and.hpp0000644000000000000000000000007412717644140023257 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/and.hpp0000664000372100037210000000235112717644140024107 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/and.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { namespace aux { template< bool C_, typename T1, typename T2, typename T3, typename T4 > struct and_impl : false_ { }; template< typename T1, typename T2, typename T3, typename T4 > struct and_impl< true,T1,T2,T3,T4 > : and_impl< BOOST_MPL_AUX_NESTED_TYPE_WKND(T1)::value , T2, T3, T4 , true_ > { }; template<> struct and_impl< true , true_, true_, true_, true_ > : true_ { }; } // namespace aux template< typename BOOST_MPL_AUX_NA_PARAM(T1) , typename BOOST_MPL_AUX_NA_PARAM(T2) , typename T3 = true_, typename T4 = true_, typename T5 = true_ > struct and_ : aux::and_impl< BOOST_MPL_AUX_NESTED_TYPE_WKND(T1)::value , T2, T3, T4, T5 > { BOOST_MPL_AUX_LAMBDA_SUPPORT( 5 , and_ , ( T1, T2, T3, T4, T5) ) }; BOOST_MPL_AUX_NA_SPEC2( 2 , 5 , and_ ) }} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/equal_to.hpp0000644000000000000000000000007412717644140024326 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/equal_to.hpp0000664000372100037210000000406112717644140025156 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/equal_to.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { template< typename Tag1 , typename Tag2 > struct equal_to_impl : if_c< ( BOOST_MPL_AUX_NESTED_VALUE_WKND(int, Tag1) > BOOST_MPL_AUX_NESTED_VALUE_WKND(int, Tag2) ) , aux::cast2nd_impl< equal_to_impl< Tag1,Tag1 >,Tag1, Tag2 > , aux::cast1st_impl< equal_to_impl< Tag2,Tag2 >,Tag1, Tag2 > >::type { }; /// for Digital Mars C++/compilers with no CTPS/TTP support template<> struct equal_to_impl< na,na > { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template< typename Tag > struct equal_to_impl< na,Tag > { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template< typename Tag > struct equal_to_impl< Tag,na > { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template< typename T > struct equal_to_tag { typedef typename T::tag type; }; template< typename BOOST_MPL_AUX_NA_PARAM(N1) , typename BOOST_MPL_AUX_NA_PARAM(N2) > struct equal_to : equal_to_impl< typename equal_to_tag::type , typename equal_to_tag::type >::template apply< N1,N2 >::type { BOOST_MPL_AUX_LAMBDA_SUPPORT(2, equal_to, (N1, N2)) }; BOOST_MPL_AUX_NA_SPEC2(2, 2, equal_to) }} namespace boost { namespace mpl { template<> struct equal_to_impl< integral_c_tag,integral_c_tag > { template< typename N1, typename N2 > struct apply : bool_< ( BOOST_MPL_AUX_VALUE_WKND(N1)::value == BOOST_MPL_AUX_VALUE_WKND(N2)::value ) > { }; }; }} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/reverse_iter_fold_impl.hpp0000644000000000000000000000007312717644140027237 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/reverse_iter_fold_impl.hpp0000664000372100037210000001507512717644140030077 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/aux_/reverse_iter_fold_impl.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { namespace aux { /// forward declaration template< long N , typename First , typename Last , typename State , typename BackwardOp , typename ForwardOp > struct reverse_iter_fold_impl; template< typename First , typename Last , typename State , typename BackwardOp , typename ForwardOp > struct reverse_iter_fold_impl< 0,First,Last,State,BackwardOp,ForwardOp > { typedef First iter0; typedef State fwd_state0; typedef fwd_state0 bkwd_state0; typedef bkwd_state0 state; typedef iter0 iterator; }; template< typename First , typename Last , typename State , typename BackwardOp , typename ForwardOp > struct reverse_iter_fold_impl< 1,First,Last,State,BackwardOp,ForwardOp > { typedef First iter0; typedef State fwd_state0; typedef typename apply2< ForwardOp,fwd_state0,iter0 >::type fwd_state1; typedef typename mpl::next::type iter1; typedef fwd_state1 bkwd_state1; typedef typename apply2< BackwardOp,bkwd_state1,iter0 >::type bkwd_state0; typedef bkwd_state0 state; typedef iter1 iterator; }; template< typename First , typename Last , typename State , typename BackwardOp , typename ForwardOp > struct reverse_iter_fold_impl< 2,First,Last,State,BackwardOp,ForwardOp > { typedef First iter0; typedef State fwd_state0; typedef typename apply2< ForwardOp,fwd_state0,iter0 >::type fwd_state1; typedef typename mpl::next::type iter1; typedef typename apply2< ForwardOp,fwd_state1,iter1 >::type fwd_state2; typedef typename mpl::next::type iter2; typedef fwd_state2 bkwd_state2; typedef typename apply2< BackwardOp,bkwd_state2,iter1 >::type bkwd_state1; typedef typename apply2< BackwardOp,bkwd_state1,iter0 >::type bkwd_state0; typedef bkwd_state0 state; typedef iter2 iterator; }; template< typename First , typename Last , typename State , typename BackwardOp , typename ForwardOp > struct reverse_iter_fold_impl< 3,First,Last,State,BackwardOp,ForwardOp > { typedef First iter0; typedef State fwd_state0; typedef typename apply2< ForwardOp,fwd_state0,iter0 >::type fwd_state1; typedef typename mpl::next::type iter1; typedef typename apply2< ForwardOp,fwd_state1,iter1 >::type fwd_state2; typedef typename mpl::next::type iter2; typedef typename apply2< ForwardOp,fwd_state2,iter2 >::type fwd_state3; typedef typename mpl::next::type iter3; typedef fwd_state3 bkwd_state3; typedef typename apply2< BackwardOp,bkwd_state3,iter2 >::type bkwd_state2; typedef typename apply2< BackwardOp,bkwd_state2,iter1 >::type bkwd_state1; typedef typename apply2< BackwardOp,bkwd_state1,iter0 >::type bkwd_state0; typedef bkwd_state0 state; typedef iter3 iterator; }; template< typename First , typename Last , typename State , typename BackwardOp , typename ForwardOp > struct reverse_iter_fold_impl< 4,First,Last,State,BackwardOp,ForwardOp > { typedef First iter0; typedef State fwd_state0; typedef typename apply2< ForwardOp,fwd_state0,iter0 >::type fwd_state1; typedef typename mpl::next::type iter1; typedef typename apply2< ForwardOp,fwd_state1,iter1 >::type fwd_state2; typedef typename mpl::next::type iter2; typedef typename apply2< ForwardOp,fwd_state2,iter2 >::type fwd_state3; typedef typename mpl::next::type iter3; typedef typename apply2< ForwardOp,fwd_state3,iter3 >::type fwd_state4; typedef typename mpl::next::type iter4; typedef fwd_state4 bkwd_state4; typedef typename apply2< BackwardOp,bkwd_state4,iter3 >::type bkwd_state3; typedef typename apply2< BackwardOp,bkwd_state3,iter2 >::type bkwd_state2; typedef typename apply2< BackwardOp,bkwd_state2,iter1 >::type bkwd_state1; typedef typename apply2< BackwardOp,bkwd_state1,iter0 >::type bkwd_state0; typedef bkwd_state0 state; typedef iter4 iterator; }; template< long N , typename First , typename Last , typename State , typename BackwardOp , typename ForwardOp > struct reverse_iter_fold_impl { typedef First iter0; typedef State fwd_state0; typedef typename apply2< ForwardOp,fwd_state0,iter0 >::type fwd_state1; typedef typename mpl::next::type iter1; typedef typename apply2< ForwardOp,fwd_state1,iter1 >::type fwd_state2; typedef typename mpl::next::type iter2; typedef typename apply2< ForwardOp,fwd_state2,iter2 >::type fwd_state3; typedef typename mpl::next::type iter3; typedef typename apply2< ForwardOp,fwd_state3,iter3 >::type fwd_state4; typedef typename mpl::next::type iter4; typedef reverse_iter_fold_impl< ( (N - 4) < 0 ? 0 : N - 4 ) , iter4 , Last , fwd_state4 , BackwardOp , ForwardOp > nested_chunk; typedef typename nested_chunk::state bkwd_state4; typedef typename apply2< BackwardOp,bkwd_state4,iter3 >::type bkwd_state3; typedef typename apply2< BackwardOp,bkwd_state3,iter2 >::type bkwd_state2; typedef typename apply2< BackwardOp,bkwd_state2,iter1 >::type bkwd_state1; typedef typename apply2< BackwardOp,bkwd_state1,iter0 >::type bkwd_state0; typedef bkwd_state0 state; typedef typename nested_chunk::iterator iterator; }; template< typename First , typename Last , typename State , typename BackwardOp , typename ForwardOp > struct reverse_iter_fold_impl< -1,First,Last,State,BackwardOp,ForwardOp > { typedef reverse_iter_fold_impl< -1 , typename mpl::next::type , Last , typename apply2< ForwardOp,State,First >::type , BackwardOp , ForwardOp > nested_step; typedef typename apply2< BackwardOp , typename nested_step::state , First >::type state; typedef typename nested_step::iterator iterator; }; template< typename Last , typename State , typename BackwardOp , typename ForwardOp > struct reverse_iter_fold_impl< -1,Last,Last,State,BackwardOp,ForwardOp > { typedef State state; typedef Last iterator; }; }}} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/less_equal.hpp0000644000000000000000000000007312717644140024651 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/less_equal.hpp0000664000372100037210000000411612717644140025503 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/less_equal.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { template< typename Tag1 , typename Tag2 > struct less_equal_impl : if_c< ( BOOST_MPL_AUX_NESTED_VALUE_WKND(int, Tag1) > BOOST_MPL_AUX_NESTED_VALUE_WKND(int, Tag2) ) , aux::cast2nd_impl< less_equal_impl< Tag1,Tag1 >,Tag1, Tag2 > , aux::cast1st_impl< less_equal_impl< Tag2,Tag2 >,Tag1, Tag2 > >::type { }; /// for Digital Mars C++/compilers with no CTPS/TTP support template<> struct less_equal_impl< na,na > { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template< typename Tag > struct less_equal_impl< na,Tag > { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template< typename Tag > struct less_equal_impl< Tag,na > { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template< typename T > struct less_equal_tag { typedef typename T::tag type; }; template< typename BOOST_MPL_AUX_NA_PARAM(N1) , typename BOOST_MPL_AUX_NA_PARAM(N2) > struct less_equal : less_equal_impl< typename less_equal_tag::type , typename less_equal_tag::type >::template apply< N1,N2 >::type { BOOST_MPL_AUX_LAMBDA_SUPPORT(2, less_equal, (N1, N2)) }; BOOST_MPL_AUX_NA_SPEC2(2, 2, less_equal) }} namespace boost { namespace mpl { template<> struct less_equal_impl< integral_c_tag,integral_c_tag > { template< typename N1, typename N2 > struct apply : bool_< ( BOOST_MPL_AUX_VALUE_WKND(N1)::value <= BOOST_MPL_AUX_VALUE_WKND(N2)::value ) > { }; }; }} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/bind_fwd.hpp0000644000000000000000000000007412717644140024271 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/bind_fwd.hpp0000664000372100037210000000170412717644140025122 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/bind_fwd.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { template< typename F, typename T1 = na, typename T2 = na, typename T3 = na , typename T4 = na, typename T5 = na > struct bind; template< typename F > struct bind0; template< typename F, typename T1 > struct bind1; template< typename F, typename T1, typename T2 > struct bind2; template< typename F, typename T1, typename T2, typename T3 > struct bind3; template< typename F, typename T1, typename T2, typename T3, typename T4 > struct bind4; template< typename F, typename T1, typename T2, typename T3, typename T4 , typename T5 > struct bind5; }} madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/PaxHeaders.5405/advance_forward.hpp0000644000000000000000000000007412717644140025642 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/preprocessed/gcc/advance_forward.hpp0000664000372100037210000000421212717644140026470 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Preprocessed version of "boost/mpl/aux_/advance_forward.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { namespace aux { template< long N > struct advance_forward; template<> struct advance_forward<0> { template< typename Iterator > struct apply { typedef Iterator iter0; typedef iter0 type; }; }; template<> struct advance_forward<1> { template< typename Iterator > struct apply { typedef Iterator iter0; typedef typename next::type iter1; typedef iter1 type; }; }; template<> struct advance_forward<2> { template< typename Iterator > struct apply { typedef Iterator iter0; typedef typename next::type iter1; typedef typename next::type iter2; typedef iter2 type; }; }; template<> struct advance_forward<3> { template< typename Iterator > struct apply { typedef Iterator iter0; typedef typename next::type iter1; typedef typename next::type iter2; typedef typename next::type iter3; typedef iter3 type; }; }; template<> struct advance_forward<4> { template< typename Iterator > struct apply { typedef Iterator iter0; typedef typename next::type iter1; typedef typename next::type iter2; typedef typename next::type iter3; typedef typename next::type iter4; typedef iter4 type; }; }; template< long N > struct advance_forward { template< typename Iterator > struct apply { typedef typename apply_wrap1< advance_forward<4> , Iterator >::type chunk_result_; typedef typename apply_wrap1< advance_forward<( (N - 4) < 0 ? 0 : N - 4 )> , chunk_result_ >::type type; }; }; }}} madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/arity.hpp0000644000000000000000000000007412717644140020413 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/aux_/arity.hpp0000664000372100037210000000225712717644140021250 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_ARITY_HPP_INCLUDED #define BOOST_MPL_AUX_ARITY_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: arity.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #if defined(BOOST_MPL_CFG_BROKEN_DEFAULT_PARAMETERS_IN_NESTED_TEMPLATES) # include # include namespace boost { namespace mpl { namespace aux { // agurt, 15/mar/02: it's possible to implement the template so that it will // "just work" and do not require any specialization, but not on the compilers // that require the arity workaround in the first place template< typename F, BOOST_MPL_AUX_NTTP_DECL(int, N) > struct arity { BOOST_STATIC_CONSTANT(int, value = N); }; }}} #endif // BOOST_MPL_CFG_BROKEN_DEFAULT_PARAMETERS_IN_NESTED_TEMPLATES #endif // BOOST_MPL_AUX_ARITY_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/lambda_arity_param.hpp0000644000000000000000000000007412717644140023073 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/lambda_arity_param.hpp0000664000372100037210000000145512717644140023727 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_LAMBDA_ARITY_PARAM_HPP_INCLUDED #define BOOST_MPL_AUX_LAMBDA_ARITY_PARAM_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: lambda_arity_param.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #if !defined(BOOST_MPL_CFG_EXTENDED_TEMPLATE_PARAMETERS_MATCHING) # define BOOST_MPL_AUX_LAMBDA_ARITY_PARAM(param) #else # define BOOST_MPL_AUX_LAMBDA_ARITY_PARAM(param) , param #endif #endif // BOOST_MPL_AUX_LAMBDA_ARITY_PARAM_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/has_tag.hpp0000644000000000000000000000007412717644140020671 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/has_tag.hpp0000664000372100037210000000124512717644140021522 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_HAS_TAG_HPP_INCLUDED #define BOOST_MPL_AUX_HAS_TAG_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2002-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: has_tag.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include namespace boost { namespace mpl { namespace aux { BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF(has_tag, tag, false) }}} #endif // BOOST_MPL_AUX_HAS_TAG_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/config0000644000000000000000000000007412717644140017742 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/config/0000775000372100037210000000000012717644140020646 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/pp_counter.hpp0000644000000000000000000000007412717644140022706 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/config/pp_counter.hpp0000664000372100037210000000146612717644140023544 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_PP_COUNTER_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_PP_COUNTER_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2006 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: pp_counter.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if !defined(BOOST_MPL_AUX_PP_COUNTER) # include # if BOOST_WORKAROUND(BOOST_MSVC, >= 1300) # define BOOST_MPL_AUX_PP_COUNTER() __COUNTER__ # else # define BOOST_MPL_AUX_PP_COUNTER() __LINE__ # endif #endif #endif // BOOST_MPL_AUX_CONFIG_PP_COUNTER_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/preprocessor.hpp0000644000000000000000000000007412717644140023256 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/config/preprocessor.hpp0000664000372100037210000000230412717644140024104 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_PREPROCESSOR_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_PREPROCESSOR_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: preprocessor.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #if !defined(BOOST_MPL_CFG_BROKEN_PP_MACRO_EXPANSION) \ && ( BOOST_WORKAROUND(__MWERKS__, <= 0x3003) \ || BOOST_WORKAROUND(__BORLANDC__, < 0x582) \ || BOOST_WORKAROUND(__IBMCPP__, BOOST_TESTED_AT(502)) \ ) # define BOOST_MPL_CFG_BROKEN_PP_MACRO_EXPANSION #endif #if !defined(BOOST_MPL_CFG_NO_OWN_PP_PRIMITIVES) # define BOOST_MPL_CFG_NO_OWN_PP_PRIMITIVES #endif #if !defined(BOOST_NEEDS_TOKEN_PASTING_OP_FOR_TOKENS_JUXTAPOSING) \ && BOOST_WORKAROUND(__DMC__, BOOST_TESTED_AT(0x840)) # define BOOST_NEEDS_TOKEN_PASTING_OP_FOR_TOKENS_JUXTAPOSING #endif #endif // BOOST_MPL_AUX_CONFIG_PREPROCESSOR_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/eti.hpp0000644000000000000000000000007412717644140021311 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/config/eti.hpp0000664000372100037210000000247112717644140022144 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_ETI_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_ETI_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: eti.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include // flags for MSVC 6.5's so-called "early template instantiation bug" #if !defined(BOOST_MPL_CFG_MSVC_60_ETI_BUG) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) \ && BOOST_WORKAROUND(BOOST_MSVC, < 1300) # define BOOST_MPL_CFG_MSVC_60_ETI_BUG #endif #if !defined(BOOST_MPL_CFG_MSVC_70_ETI_BUG) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) \ && BOOST_WORKAROUND(BOOST_MSVC, == 1300) # define BOOST_MPL_CFG_MSVC_70_ETI_BUG #endif #if !defined(BOOST_MPL_CFG_MSVC_ETI_BUG) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) \ && ( defined(BOOST_MPL_CFG_MSVC_60_ETI_BUG) \ || defined(BOOST_MPL_CFG_MSVC_70_ETI_BUG) \ ) # define BOOST_MPL_CFG_MSVC_ETI_BUG #endif #endif // BOOST_MPL_AUX_CONFIG_ETI_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/ttp.hpp0000644000000000000000000000007412717644140021337 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/config/ttp.hpp0000664000372100037210000000236612717644140022175 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_TTP_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_TTP_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: ttp.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #if !defined(BOOST_MPL_CFG_NO_TEMPLATE_TEMPLATE_PARAMETERS) \ && ( defined(BOOST_NO_TEMPLATE_TEMPLATES) \ || BOOST_WORKAROUND( __BORLANDC__, BOOST_TESTED_AT( 0x590) ) \ ) # define BOOST_MPL_CFG_NO_TEMPLATE_TEMPLATE_PARAMETERS #endif #if !defined(BOOST_MPL_CFG_EXTENDED_TEMPLATE_PARAMETERS_MATCHING) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) \ && ( BOOST_WORKAROUND(BOOST_MPL_CFG_GCC, BOOST_TESTED_AT(0x0302)) \ || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x610)) \ ) # define BOOST_MPL_CFG_EXTENDED_TEMPLATE_PARAMETERS_MATCHING #endif #endif // BOOST_MPL_AUX_CONFIG_TTP_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/arrays.hpp0000644000000000000000000000007412717644140022031 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/aux_/config/arrays.hpp0000664000372100037210000000164612717644140022667 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_ARRAYS_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_ARRAYS_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: arrays.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #if !defined(BOOST_MPL_CFG_NO_DEPENDENT_ARRAY_TYPES) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) \ && ( BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x610)) \ || BOOST_WORKAROUND(BOOST_MSVC, <= 1300) \ ) # define BOOST_MPL_CFG_NO_DEPENDENT_ARRAY_TYPES #endif #endif // BOOST_MPL_AUX_CONFIG_ARRAYS_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/has_apply.hpp0000644000000000000000000000007412717644140022510 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/config/has_apply.hpp0000664000372100037210000000176512717644140023350 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_HAS_APPLY_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_HAS_APPLY_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: has_apply.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #if !defined(BOOST_MPL_CFG_NO_HAS_APPLY) \ && ( defined(BOOST_MPL_CFG_NO_HAS_XXX) \ || BOOST_WORKAROUND(__EDG_VERSION__, < 300) \ || BOOST_WORKAROUND(BOOST_MSVC, <= 1300) \ || BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3202)) \ ) # define BOOST_MPL_CFG_NO_HAS_APPLY #endif #endif // BOOST_MPL_AUX_CONFIG_HAS_APPLY_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/adl.hpp0000644000000000000000000000007412717644140021270 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/aux_/config/adl.hpp0000664000372100037210000000275612717644140022131 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_ADL_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_ADL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2002-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: adl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include // agurt, 25/apr/04: technically, the ADL workaround is only needed for GCC, // but putting everything expect public, user-specializable metafunctions into // a separate global namespace has a nice side effect of reducing the length // of template instantiation symbols, so we apply the workaround on all // platforms that can handle it #if !defined(BOOST_MPL_CFG_NO_ADL_BARRIER_NAMESPACE) \ && ( BOOST_WORKAROUND(BOOST_MSVC, BOOST_TESTED_AT(1400)) \ || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x610)) \ || BOOST_WORKAROUND(__DMC__, BOOST_TESTED_AT(0x840)) \ || BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3202)) \ || BOOST_WORKAROUND(BOOST_INTEL_CXX_VERSION, BOOST_TESTED_AT(810)) \ ) # define BOOST_MPL_CFG_NO_ADL_BARRIER_NAMESPACE #endif #endif // BOOST_MPL_AUX_CONFIG_ADL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/workaround.hpp0000644000000000000000000000007412717644140022723 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/config/workaround.hpp0000664000372100037210000000113612717644140023553 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_WORKAROUND_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_WORKAROUND_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2002-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: workaround.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #endif // BOOST_MPL_AUX_CONFIG_WORKAROUND_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/overload_resolution.hpp0000644000000000000000000000007412717644140024626 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/config/overload_resolution.hpp0000664000372100037210000000165012717644140025457 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_OVERLOAD_RESOLUTION_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_OVERLOAD_RESOLUTION_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2002-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: overload_resolution.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #if !defined(BOOST_MPL_CFG_BROKEN_OVERLOAD_RESOLUTION) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) \ && ( BOOST_WORKAROUND(__BORLANDC__, < 0x590) \ || BOOST_WORKAROUND(__MWERKS__, < 0x3001) \ ) # define BOOST_MPL_CFG_BROKEN_OVERLOAD_RESOLUTION #endif #endif // BOOST_MPL_AUX_CONFIG_OVERLOAD_RESOLUTION_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/forwarding.hpp0000644000000000000000000000007412717644140022672 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/config/forwarding.hpp0000664000372100037210000000147612717644140023531 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_FORWARDING_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_FORWARDING_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: forwarding.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #if !defined(BOOST_MPL_CFG_NO_NESTED_FORWARDING) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) \ && BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x610)) # define BOOST_MPL_CFG_NO_NESTED_FORWARDING #endif #endif // BOOST_MPL_AUX_CONFIG_FORWARDING_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/use_preprocessed.hpp0000644000000000000000000000007412717644140024102 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/config/use_preprocessed.hpp0000664000372100037210000000120012717644140024722 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_USE_PREPROCESSED_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_USE_PREPROCESSED_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: use_preprocessed.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ // #define BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #endif // BOOST_MPL_AUX_CONFIG_USE_PREPROCESSED_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/gcc.hpp0000644000000000000000000000007412717644140021264 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/config/gcc.hpp0000664000372100037210000000126512717644140022117 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_GCC_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_GCC_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: gcc.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if defined(__GNUC__) && !defined(__EDG_VERSION__) # define BOOST_MPL_CFG_GCC ((__GNUC__ << 8) | __GNUC_MINOR__) #else # define BOOST_MPL_CFG_GCC 0 #endif #endif // BOOST_MPL_AUX_CONFIG_GCC_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/nttp.hpp0000644000000000000000000000007412717644140021515 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/config/nttp.hpp0000664000372100037210000000213012717644140022340 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_NTTP_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_NTTP_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: nttp.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include // MSVC 6.5 ICE-s on the code as simple as this (see "aux_/nttp_decl.hpp" // for a workaround): // // namespace std { // template< typename Char > struct string; // } // // void foo(std::string); // // namespace boost { namespace mpl { // template< int > struct arg; // }} #if !defined(BOOST_MPL_CFG_NTTP_BUG) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) \ && BOOST_WORKAROUND(BOOST_MSVC, < 1300) # define BOOST_MPL_CFG_NTTP_BUG #endif #endif // BOOST_MPL_AUX_CONFIG_NTTP_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/intel.hpp0000644000000000000000000000007412717644140021643 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/config/intel.hpp0000664000372100037210000000114712717644140022475 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_INTEL_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_INTEL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: intel.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ // BOOST_INTEL_CXX_VERSION is defined here: #include #endif // BOOST_MPL_AUX_CONFIG_INTEL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/typeof.hpp0000644000000000000000000000007412717644140022036 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/config/typeof.hpp0000664000372100037210000000205212717644140022664 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_TYPEOF_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_TYPEOF_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: typeof.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #if !defined(BOOST_MPL_CFG_HAS_TYPEOF) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) \ && ( defined(BOOST_MPL_CFG_GCC) && BOOST_MPL_CFG_GCC >= 0x0302 \ || defined(__MWERKS__) && __MWERKS__ >= 0x3000 \ ) # define BOOST_MPL_CFG_HAS_TYPEOF #endif #if !defined(BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) \ && defined(BOOST_MPL_CFG_HAS_TYPEOF) # define BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES #endif #endif // BOOST_MPL_AUX_CONFIG_TYPEOF_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/integral.hpp0000644000000000000000000000007412717644140022335 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/config/integral.hpp0000664000372100037210000000220012717644140023156 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_INTEGRAL_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_INTEGRAL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: integral.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #if !defined(BOOST_MPL_CFG_BCC_INTEGRAL_CONSTANTS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) \ && BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x610)) # define BOOST_MPL_CFG_BCC_INTEGRAL_CONSTANTS #endif #if !defined(BOOST_MPL_CFG_NO_NESTED_VALUE_ARITHMETIC) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) \ && ( BOOST_WORKAROUND(BOOST_MSVC, <= 1300) \ || BOOST_WORKAROUND(__EDG_VERSION__, <= 238) \ ) # define BOOST_MPL_CFG_NO_NESTED_VALUE_ARITHMETIC #endif #endif // BOOST_MPL_AUX_CONFIG_INTEGRAL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/ctps.hpp0000644000000000000000000000007412717644140021501 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/aux_/config/ctps.hpp0000664000372100037210000000163612717644140022336 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_CTPS_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_CTPS_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: ctps.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #if !defined(BOOST_MPL_CFG_NO_NONTYPE_TEMPLATE_PARTIAL_SPEC) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) \ && BOOST_WORKAROUND(__BORLANDC__, < 0x582) # define BOOST_MPL_CFG_NO_NONTYPE_TEMPLATE_PARTIAL_SPEC #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION is defined in #endif // BOOST_MPL_AUX_CONFIG_CTPS_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/dtp.hpp0000644000000000000000000000007412717644140021317 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/aux_/config/dtp.hpp0000664000372100037210000000321112717644140022143 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_DTP_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_DTP_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: dtp.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include // MWCW 7.x-8.0 "losts" default template parameters of nested class // templates when their owner classes are passed as arguments to other // templates; Borland 5.5.1 "forgets" them from the very beginning (if // the owner class is a class template), and Borland 5.6 isn't even // able to compile a definition of nested class template with DTP #if !defined(BOOST_MPL_CFG_NO_DEFAULT_PARAMETERS_IN_NESTED_TEMPLATES) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) \ && BOOST_WORKAROUND(__BORLANDC__, >= 0x560) \ && BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x610)) # define BOOST_MPL_CFG_NO_DEFAULT_PARAMETERS_IN_NESTED_TEMPLATES #endif #if !defined(BOOST_MPL_CFG_BROKEN_DEFAULT_PARAMETERS_IN_NESTED_TEMPLATES) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) \ && ( BOOST_WORKAROUND(__MWERKS__, <= 0x3001) \ || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x610)) \ || defined(BOOST_MPL_CFG_NO_DEFAULT_PARAMETERS_IN_NESTED_TEMPLATES) \ ) # define BOOST_MPL_CFG_BROKEN_DEFAULT_PARAMETERS_IN_NESTED_TEMPLATES #endif #endif // BOOST_MPL_AUX_CONFIG_DTP_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/compiler.hpp0000644000000000000000000000007412717644140022342 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/aux_/config/compiler.hpp0000664000372100037210000000427712717644140023203 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_COMPILER_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_COMPILER_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2008 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: compiler.hpp 53189 2009-05-22 20:07:55Z hkaiser $ // $Date: 2009-05-22 13:07:55 -0700 (Fri, 22 May 2009) $ // $Revision: 53189 $ #if !defined(BOOST_MPL_CFG_COMPILER_DIR) # include # include # include # include # include # include # if BOOST_WORKAROUND(BOOST_MSVC, < 1300) # define BOOST_MPL_CFG_COMPILER_DIR msvc60 # elif BOOST_WORKAROUND(BOOST_MSVC, == 1300) # define BOOST_MPL_CFG_COMPILER_DIR msvc70 # elif BOOST_WORKAROUND(BOOST_MPL_CFG_GCC, BOOST_TESTED_AT(0x0304)) # define BOOST_MPL_CFG_COMPILER_DIR gcc # elif BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x610)) # if !defined(BOOST_MPL_CFG_NO_DEFAULT_PARAMETERS_IN_NESTED_TEMPLATES) # define BOOST_MPL_CFG_COMPILER_DIR bcc551 # elif BOOST_WORKAROUND(__BORLANDC__, >= 0x590) # define BOOST_MPL_CFG_COMPILER_DIR bcc # else # define BOOST_MPL_CFG_COMPILER_DIR bcc_pre590 # endif # elif BOOST_WORKAROUND(__DMC__, BOOST_TESTED_AT(0x840)) # define BOOST_MPL_CFG_COMPILER_DIR dmc # elif defined(__MWERKS__) # if defined(BOOST_MPL_CFG_BROKEN_DEFAULT_PARAMETERS_IN_NESTED_TEMPLATES) # define BOOST_MPL_CFG_COMPILER_DIR mwcw # else # define BOOST_MPL_CFG_COMPILER_DIR plain # endif # elif defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) # define BOOST_MPL_CFG_COMPILER_DIR no_ctps # elif defined(BOOST_MPL_CFG_NO_TEMPLATE_TEMPLATE_PARAMETERS) # define BOOST_MPL_CFG_COMPILER_DIR no_ttp # else # define BOOST_MPL_CFG_COMPILER_DIR plain # endif #endif // BOOST_MPL_CFG_COMPILER_DIR #endif // BOOST_MPL_AUX_CONFIG_COMPILER_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/has_xxx.hpp0000644000000000000000000000007412717644140022212 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/config/has_xxx.hpp0000664000372100037210000000206712717644140023046 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_HAS_XXX_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_HAS_XXX_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2002-2004 // Copyright David Abrahams 2002-2003 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: has_xxx.hpp 63518 2010-07-02 08:32:03Z agurtovoy $ // $Date: 2010-07-02 01:32:03 -0700 (Fri, 02 Jul 2010) $ // $Revision: 63518 $ #include #include // agurt, 11/jan/03: signals a stub-only 'has_xxx' implementation #if !defined(BOOST_MPL_CFG_NO_HAS_XXX) \ && ( defined(BOOST_MPL_CFG_BROKEN_OVERLOAD_RESOLUTION) \ || BOOST_WORKAROUND(__GNUC__, <= 2) \ || BOOST_WORKAROUND(__DMC__, BOOST_TESTED_AT(0x840)) \ ) # define BOOST_MPL_CFG_NO_HAS_XXX # define BOOST_MPL_CFG_NO_HAS_XXX_TEMPLATE #endif #endif // BOOST_MPL_AUX_CONFIG_HAS_XXX_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/operators.hpp0000644000000000000000000000007412717644140022546 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/config/operators.hpp0000664000372100037210000000213512717644140023376 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_OPERATORS_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_OPERATORS_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: operators.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #if !defined(BOOST_MPL_CFG_USE_OPERATORS_OVERLOADING) \ && ( BOOST_WORKAROUND(BOOST_MSVC, <= 1300) \ || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x610)) \ || BOOST_WORKAROUND(__EDG_VERSION__, <= 245) \ || BOOST_WORKAROUND(BOOST_MPL_CFG_GCC, <= 0x0295) \ || BOOST_WORKAROUND(__IBMCPP__, BOOST_TESTED_AT(600)) \ ) # define BOOST_MPL_CFG_USE_OPERATORS_OVERLOADING #endif #endif // BOOST_MPL_AUX_CONFIG_OPERATORS_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/lambda.hpp0000644000000000000000000000007412717644140021750 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/config/lambda.hpp0000664000372100037210000000176712717644140022612 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_LAMBDA_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_LAMBDA_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2002-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: lambda.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include // agurt, 15/jan/02: full-fledged implementation requires both // template template parameters _and_ partial specialization #if !defined(BOOST_MPL_CFG_NO_FULL_LAMBDA_SUPPORT) \ && ( defined(BOOST_MPL_CFG_NO_TEMPLATE_TEMPLATE_PARAMETERS) \ || defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \ ) # define BOOST_MPL_CFG_NO_FULL_LAMBDA_SUPPORT #endif #endif // BOOST_MPL_AUX_CONFIG_LAMBDA_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/bcc.hpp0000644000000000000000000000007412717644140021257 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/aux_/config/bcc.hpp0000664000372100037210000000152012717644140022104 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_BCC_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_BCC_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2008 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: bcc.hpp 49272 2008-10-11 06:50:46Z agurtovoy $ // $Date: 2004-09-02 10:41:37 -0500 (Thu, 02 Sep 2004) $ // $Revision: 24874 $ #include #if !defined(BOOST_MPL_CFG_BCC590_WORKAROUNDS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) \ && BOOST_WORKAROUND(__BORLANDC__, >= 0x590) \ && BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x610)) # define BOOST_MPL_CFG_BCC590_WORKAROUNDS #endif #endif // BOOST_MPL_AUX_CONFIG_BCC_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/msvc_typename.hpp0000644000000000000000000000007412717644140023402 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/config/msvc_typename.hpp0000664000372100037210000000143412717644140024233 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_MSVC_TYPENAME_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_MSVC_TYPENAME_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: msvc_typename.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #if BOOST_WORKAROUND(BOOST_MSVC, <= 1300) # define BOOST_MSVC_TYPENAME #else # define BOOST_MSVC_TYPENAME typename #endif #endif // BOOST_MPL_AUX_CONFIG_MSVC_TYPENAME_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/bind.hpp0000644000000000000000000000007412717644140021444 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/aux_/config/bind.hpp0000664000372100037210000000175112717644140022277 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_BIND_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_BIND_HPP_INCLUDED // Copyright David Abrahams 2002 // Copyright Aleksey Gurtovoy 2002-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: bind.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #if !defined(BOOST_MPL_CFG_NO_BIND_TEMPLATE) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) \ && ( BOOST_WORKAROUND(BOOST_MSVC, <= 1300) \ || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x610)) \ ) # define BOOST_MPL_CFG_NO_BIND_TEMPLATE #endif //#define BOOST_MPL_CFG_NO_UNNAMED_PLACEHOLDER_SUPPORT #endif // BOOST_MPL_AUX_CONFIG_BIND_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/msvc.hpp0000644000000000000000000000007412717644140021500 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/config/msvc.hpp0000664000372100037210000000113312717644140022325 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_MSVC_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_MSVC_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2002-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: msvc.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ // BOOST_MSVC is defined here: #include #endif // BOOST_MPL_AUX_CONFIG_MSVC_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/config/PaxHeaders.5405/static_constant.hpp0000644000000000000000000000007412717644140023730 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/config/static_constant.hpp0000664000372100037210000000143212717644140024557 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONFIG_STATIC_CONSTANT_HPP_INCLUDED #define BOOST_MPL_AUX_CONFIG_STATIC_CONSTANT_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: static_constant.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if !defined(BOOST_MPL_PREPROCESSING_MODE) // BOOST_STATIC_CONSTANT is defined here: # include #else // undef the macro for the preprocessing mode # undef BOOST_STATIC_CONSTANT #endif #endif // BOOST_MPL_AUX_CONFIG_STATIC_CONSTANT_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/na_fwd.hpp0000644000000000000000000000007412717644140020521 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/na_fwd.hpp0000664000372100037210000000141212717644140021346 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_NA_FWD_HPP_INCLUDED #define BOOST_MPL_AUX_NA_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: na_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN // n.a. == not available struct na { typedef na type; enum { value = 0 }; }; BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE BOOST_MPL_AUX_ADL_BARRIER_DECL(na) #endif // BOOST_MPL_AUX_NA_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/iter_apply.hpp0000644000000000000000000000007412717644140021433 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/iter_apply.hpp0000664000372100037210000000176312717644140022271 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_ITER_APPLY_HPP_INCLUDED #define BOOST_MPL_ITER_APPLY_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2002-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: iter_apply.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include namespace boost { namespace mpl { namespace aux { template< typename F , typename Iterator > struct iter_apply1 : apply1< F,typename deref::type > { }; template< typename F , typename Iterator1 , typename Iterator2 > struct iter_apply2 : apply2< F , typename deref::type , typename deref::type > { }; }}} #endif // BOOST_MPL_ITER_APPLY_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/fold_impl.hpp0000644000000000000000000000007412717644140021230 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/fold_impl.hpp0000664000372100037210000000254312717644140022063 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_FOLD_IMPL_HPP_INCLUDED #define BOOST_MPL_AUX_FOLD_IMPL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: fold_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include # include # include # include # if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) # include # include # endif #endif #include #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # define BOOST_MPL_PREPROCESSED_HEADER fold_impl.hpp # include #else # define AUX778076_FOLD_IMPL_OP(iter) typename deref::type # define AUX778076_FOLD_IMPL_NAME_PREFIX fold # include #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #endif // BOOST_MPL_AUX_FOLD_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/na.hpp0000644000000000000000000000007412717644140017661 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/na.hpp0000664000372100037210000000332212717644140020510 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_NA_HPP_INCLUDED #define BOOST_MPL_AUX_NA_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: na.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include namespace boost { namespace mpl { template< typename T > struct is_na : false_ { #if BOOST_WORKAROUND(BOOST_MSVC, < 1300) using false_::value; #endif }; template<> struct is_na : true_ { #if BOOST_WORKAROUND(BOOST_MSVC, < 1300) using true_::value; #endif }; template< typename T > struct is_not_na : true_ { #if BOOST_WORKAROUND(BOOST_MSVC, < 1300) using true_::value; #endif }; template<> struct is_not_na : false_ { #if BOOST_WORKAROUND(BOOST_MSVC, < 1300) using false_::value; #endif }; #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template< typename T, typename U > struct if_na { typedef T type; }; template< typename U > struct if_na { typedef U type; }; #else template< typename T > struct if_na_impl { template< typename U > struct apply { typedef T type; }; }; template<> struct if_na_impl { template< typename U > struct apply { typedef U type; }; }; template< typename T, typename U > struct if_na : if_na_impl::template apply { }; #endif }} #endif // BOOST_MPL_AUX_NA_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/at_impl.hpp0000644000000000000000000000007412717644140020710 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/aux_/at_impl.hpp0000664000372100037210000000225512717644140021543 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_AT_IMPL_HPP_INCLUDED #define BOOST_MPL_AUX_AT_IMPL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: at_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include namespace boost { namespace mpl { // default implementation; conrete sequences might override it by // specializing either the 'at_impl' or the primary 'at' template template< typename Tag > struct at_impl { template< typename Sequence, typename N > struct apply { typedef typename advance< typename begin::type , N >::type iter_; typedef typename deref::type type; }; }; BOOST_MPL_ALGORITM_TRAITS_LAMBDA_SPEC(2, at_impl) }} #endif // BOOST_MPL_AUX_AT_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/ptr_to_ref.hpp0000644000000000000000000000007312717644140021425 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/ptr_to_ref.hpp0000664000372100037210000000226412717644140022261 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_PTR_TO_REF_HPP_INCLUDED #define BOOST_MPL_AUX_PTR_TO_REF_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: ptr_to_ref.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #if BOOST_WORKAROUND(BOOST_MSVC, BOOST_TESTED_AT(1400)) \ || ( BOOST_WORKAROUND(__EDG_VERSION__, <= 245) \ && !(defined(__STD_STRICT_ANSI) \ || defined(__STD_STRICT_ANSI_ERRORS)) ) # define BOOST_MPL_AUX_PTR_TO_REF(X) \ *BOOST_MPL_AUX_STATIC_CAST(X*, 0) \ /**/ #else # define BOOST_MPL_AUX_PTR_TO_REF(X) \ aux::ptr_to_ref(BOOST_MPL_AUX_STATIC_CAST(X*, 0)) \ /**/ #endif namespace boost { namespace mpl { namespace aux { template< typename T > static T const& ptr_to_ref(T*); }}} #endif // BOOST_MPL_AUX_PTR_TO_REF_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/largest_int.hpp0000644000000000000000000000007412717644140021576 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/largest_int.hpp0000664000372100037210000000405112717644140022425 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_LARGEST_INT_HPP_INCLUDED #define BOOST_MPL_AUX_LARGEST_INT_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: largest_int.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include namespace boost { namespace mpl { namespace aux { template< typename T > struct integral_rank; template<> struct integral_rank : int_<1> {}; template<> struct integral_rank : int_<2> {}; template<> struct integral_rank : int_<3> {}; template<> struct integral_rank : int_<4> {}; #if !defined(BOOST_NO_INTRINSIC_WCHAR_T) template<> struct integral_rank : int_<5> {}; #endif template<> struct integral_rank : int_<6> {}; template<> struct integral_rank : int_<7> {}; template<> struct integral_rank : int_<8> {}; template<> struct integral_rank : int_<9> {}; template<> struct integral_rank : int_<10> {}; template<> struct integral_rank : int_<11> {}; #if defined(BOOST_HAS_LONG_LONG) template<> struct integral_rank : int_<12> {}; template<> struct integral_rank: int_<13> {}; #endif template< typename T1, typename T2 > struct largest_int #if !defined(BOOST_MPL_CFG_NO_NESTED_VALUE_ARITHMETIC) : if_c< ( integral_rank::value >= integral_rank::value ) , T1 , T2 > { #else { enum { rank1 = integral_rank::value }; enum { rank2 = integral_rank::value }; typedef typename if_c< (rank1 >= rank2),T1,T2 >::type type; #endif }; }}} #endif // BOOST_MPL_AUX_LARGEST_INT_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/arithmetic_op.hpp0000644000000000000000000000007412717644140022112 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/aux_/arithmetic_op.hpp0000664000372100037210000000477112717644140022752 0ustar00fransfrans00000000000000 // NO INCLUDE GUARDS, THE HEADER IS INTENDED FOR MULTIPLE INCLUSION // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: arithmetic_op.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include # include # include #endif #if !defined(AUX778076_OP_PREFIX) # define AUX778076_OP_PREFIX AUX778076_OP_NAME #endif #include #include #include #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # define BOOST_MPL_PREPROCESSED_HEADER AUX778076_OP_PREFIX.hpp # include #else # include # include namespace boost { namespace mpl { #if defined(BOOST_MPL_CFG_NO_NESTED_VALUE_ARITHMETIC) namespace aux { template< typename T, T n1, T n2 > struct BOOST_PP_CAT(AUX778076_OP_PREFIX,_wknd) { BOOST_STATIC_CONSTANT(T, value = (n1 AUX778076_OP_TOKEN n2)); typedef integral_c type; }; } #endif template<> struct AUX778076_OP_IMPL_NAME { template< typename N1, typename N2 > struct apply #if !defined(BOOST_MPL_CFG_NO_NESTED_VALUE_ARITHMETIC) : integral_c< typename aux::largest_int< typename N1::value_type , typename N2::value_type >::type , ( BOOST_MPL_AUX_VALUE_WKND(N1)::value AUX778076_OP_TOKEN BOOST_MPL_AUX_VALUE_WKND(N2)::value ) > #else : aux::BOOST_PP_CAT(AUX778076_OP_PREFIX,_wknd)< typename aux::largest_int< typename N1::value_type , typename N2::value_type >::type , N1::value , N2::value >::type #endif { }; }; }} #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #undef AUX778076_OP_TAG_NAME #undef AUX778076_OP_IMPL_NAME #undef AUX778076_OP_ARITY #undef AUX778076_OP_PREFIX #undef AUX778076_OP_NAME #undef AUX778076_OP_TOKEN madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/template_arity.hpp0000644000000000000000000000007312717644140022305 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/template_arity.hpp0000664000372100037210000001136012717644140023136 0ustar00fransfrans00000000000000 #if !defined(BOOST_PP_IS_ITERATING) ///// header body #ifndef BOOST_MPL_AUX_TEMPLATE_ARITY_HPP_INCLUDED #define BOOST_MPL_AUX_TEMPLATE_ARITY_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: template_arity.hpp 61584 2010-04-26 18:48:26Z agurtovoy $ // $Date: 2010-04-26 11:48:26 -0700 (Mon, 26 Apr 2010) $ // $Revision: 61584 $ #include #include #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include # include # if !defined(BOOST_MPL_CFG_NO_FULL_LAMBDA_SUPPORT) # if defined(BOOST_MPL_CFG_EXTENDED_TEMPLATE_PARAMETERS_MATCHING) # include # endif # else # include # endif #endif #include #include #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # define BOOST_MPL_PREPROCESSED_HEADER template_arity.hpp # include #else # if !defined(BOOST_MPL_CFG_NO_FULL_LAMBDA_SUPPORT) # if defined(BOOST_MPL_CFG_EXTENDED_TEMPLATE_PARAMETERS_MATCHING) # include # include # include # include # include # include # include # include # include # include # define AUX778076_ARITY BOOST_PP_INC(BOOST_MPL_LIMIT_METAFUNCTION_ARITY) namespace boost { namespace mpl { namespace aux { template< BOOST_MPL_AUX_NTTP_DECL(int, N) > struct arity_tag { typedef char (&type)[N + 1]; }; # define AUX778076_MAX_ARITY_OP(unused, state, i_) \ ( BOOST_PP_CAT(C,i_) > 0 ? BOOST_PP_CAT(C,i_) : state ) \ /**/ template< BOOST_MPL_PP_PARAMS(AUX778076_ARITY, BOOST_MPL_AUX_NTTP_DECL(int, C)) > struct max_arity { BOOST_STATIC_CONSTANT(int, value = BOOST_PP_SEQ_FOLD_LEFT( AUX778076_MAX_ARITY_OP , -1 , BOOST_MPL_PP_RANGE(1, AUX778076_ARITY) ) ); }; # undef AUX778076_MAX_ARITY_OP arity_tag<0>::type arity_helper(...); # define BOOST_PP_ITERATION_LIMITS (1, AUX778076_ARITY) # define BOOST_PP_FILENAME_1 # include BOOST_PP_ITERATE() template< typename F, BOOST_MPL_AUX_NTTP_DECL(int, N) > struct template_arity_impl { BOOST_STATIC_CONSTANT(int, value = sizeof(::boost::mpl::aux::arity_helper(type_wrapper(),arity_tag())) - 1 ); }; # define AUX778076_TEMPLATE_ARITY_IMPL_INVOCATION(unused, i_, F) \ BOOST_PP_COMMA_IF(i_) template_arity_impl::value \ /**/ template< typename F > struct template_arity { BOOST_STATIC_CONSTANT(int, value = ( max_arity< BOOST_MPL_PP_REPEAT( AUX778076_ARITY , AUX778076_TEMPLATE_ARITY_IMPL_INVOCATION , F ) >::value )); typedef mpl::int_ type; }; # undef AUX778076_TEMPLATE_ARITY_IMPL_INVOCATION # undef AUX778076_ARITY }}} # endif // BOOST_MPL_CFG_EXTENDED_TEMPLATE_PARAMETERS_MATCHING # else // BOOST_MPL_CFG_NO_FULL_LAMBDA_SUPPORT # include namespace boost { namespace mpl { namespace aux { template< bool > struct template_arity_impl { template< typename F > struct result_ : mpl::int_<-1> { }; }; template<> struct template_arity_impl { template< typename F > struct result_ : F::arity { }; }; template< typename F > struct template_arity : template_arity_impl< ::boost::mpl::aux::has_rebind::value > ::template result_ { }; #if defined(BOOST_MPL_CFG_MSVC_ETI_BUG) template<> struct template_arity : mpl::int_<-1> { }; #endif }}} # endif // BOOST_MPL_CFG_NO_FULL_LAMBDA_SUPPORT #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #endif // BOOST_MPL_AUX_TEMPLATE_ARITY_HPP_INCLUDED ///// iteration #else #define i_ BOOST_PP_FRAME_ITERATION(1) template< template< BOOST_MPL_PP_PARAMS(i_, typename P) > class F , BOOST_MPL_PP_PARAMS(i_, typename T) > typename arity_tag::type arity_helper(type_wrapper< F >, arity_tag); #undef i_ #endif // BOOST_PP_IS_ITERATING madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/overload_names.hpp0000644000000000000000000000007412717644140022261 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/overload_names.hpp0000664000372100037210000000413612717644140023114 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_OVERLOAD_NAMES_HPP_INCLUDED #define BOOST_MPL_AUX_OVERLOAD_NAMES_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: overload_names.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #if defined(BOOST_MPL_CFG_USE_OPERATORS_OVERLOADING) # include # define BOOST_MPL_AUX_OVERLOAD_VALUE_BY_KEY operator/ # define BOOST_MPL_AUX_OVERLOAD_ITEM_BY_ORDER operator| # define BOOST_MPL_AUX_OVERLOAD_ORDER_BY_KEY operator|| # define BOOST_MPL_AUX_OVERLOAD_IS_MASKED operator% # define BOOST_MPL_AUX_OVERLOAD_CALL_VALUE_BY_KEY(T, x) BOOST_MPL_AUX_PTR_TO_REF(T) / x # define BOOST_MPL_AUX_OVERLOAD_CALL_ITEM_BY_ORDER(T, x) BOOST_MPL_AUX_PTR_TO_REF(T) | x # define BOOST_MPL_AUX_OVERLOAD_CALL_ORDER_BY_KEY(T, x) BOOST_MPL_AUX_PTR_TO_REF(T) || x # define BOOST_MPL_AUX_OVERLOAD_CALL_IS_MASKED(T, x) BOOST_MPL_AUX_PTR_TO_REF(T) % x #else # define BOOST_MPL_AUX_OVERLOAD_VALUE_BY_KEY value_by_key_ # define BOOST_MPL_AUX_OVERLOAD_ITEM_BY_ORDER item_by_order_ # define BOOST_MPL_AUX_OVERLOAD_ORDER_BY_KEY order_by_key_ # define BOOST_MPL_AUX_OVERLOAD_IS_MASKED is_masked_ # define BOOST_MPL_AUX_OVERLOAD_CALL_VALUE_BY_KEY(T, x) T::BOOST_MPL_AUX_OVERLOAD_VALUE_BY_KEY( BOOST_MPL_AUX_PTR_TO_REF(T), x ) # define BOOST_MPL_AUX_OVERLOAD_CALL_ITEM_BY_ORDER(T, x) T::BOOST_MPL_AUX_OVERLOAD_ITEM_BY_ORDER( BOOST_MPL_AUX_PTR_TO_REF(T), x ) # define BOOST_MPL_AUX_OVERLOAD_CALL_ORDER_BY_KEY(T, x) T::BOOST_MPL_AUX_OVERLOAD_ORDER_BY_KEY( BOOST_MPL_AUX_PTR_TO_REF(T), x ) # define BOOST_MPL_AUX_OVERLOAD_CALL_IS_MASKED(T, x) T::BOOST_MPL_AUX_OVERLOAD_IS_MASKED( BOOST_MPL_AUX_PTR_TO_REF(T), x ) #endif #endif // BOOST_MPL_AUX_OVERLOAD_NAMES_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/lambda_support.hpp0000644000000000000000000000007412717644140022277 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/lambda_support.hpp0000664000372100037210000001254112717644140023131 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_LAMBDA_SUPPORT_HPP_INCLUDED #define BOOST_MPL_AUX_LAMBDA_SUPPORT_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: lambda_support.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #if !defined(BOOST_MPL_CFG_NO_FULL_LAMBDA_SUPPORT) # define BOOST_MPL_AUX_LAMBDA_SUPPORT_SPEC(i, name, params) /**/ # define BOOST_MPL_AUX_LAMBDA_SUPPORT(i,name,params) /**/ #else # include # include # include # include # include # include # include # include # include # include # include # define BOOST_MPL_AUX_LAMBDA_SUPPORT_ARG_TYPEDEF_FUNC(R,typedef_,i,param) \ typedef_ param BOOST_PP_CAT(arg,BOOST_PP_INC(i)); \ /**/ // agurt, 07/mar/03: restore an old revision for the sake of SGI MIPSpro C++ #if BOOST_WORKAROUND(__EDG_VERSION__, <= 238) # define BOOST_MPL_AUX_LAMBDA_SUPPORT(i, name, params) \ typedef BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE::int_ arity; \ BOOST_PP_LIST_FOR_EACH_I_R( \ 1 \ , BOOST_MPL_AUX_LAMBDA_SUPPORT_ARG_TYPEDEF_FUNC \ , typedef \ , BOOST_PP_TUPLE_TO_LIST(i,params) \ ) \ struct rebind \ { \ template< BOOST_MPL_PP_PARAMS(i,typename U) > struct apply \ : name< BOOST_MPL_PP_PARAMS(i,U) > \ { \ }; \ }; \ /**/ # define BOOST_MPL_AUX_LAMBDA_SUPPORT_SPEC(i, name, params) \ BOOST_MPL_AUX_LAMBDA_SUPPORT(i, name, params) \ /**/ #elif BOOST_WORKAROUND(__EDG_VERSION__, <= 244) && !defined(BOOST_INTEL_CXX_VERSION) // agurt, 18/jan/03: old EDG-based compilers actually enforce 11.4 para 9 // (in strict mode), so we have to provide an alternative to the // MSVC-optimized implementation # define BOOST_MPL_AUX_LAMBDA_SUPPORT_SPEC(i, name, params) \ typedef BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE::int_ arity; \ BOOST_PP_LIST_FOR_EACH_I_R( \ 1 \ , BOOST_MPL_AUX_LAMBDA_SUPPORT_ARG_TYPEDEF_FUNC \ , typedef \ , BOOST_PP_TUPLE_TO_LIST(i,params) \ ) \ struct rebind; \ /**/ # define BOOST_MPL_AUX_LAMBDA_SUPPORT(i, name, params) \ BOOST_MPL_AUX_LAMBDA_SUPPORT_SPEC(i, name, params) \ }; \ template< BOOST_MPL_PP_PARAMS(i,typename T) > \ struct name::rebind \ { \ template< BOOST_MPL_PP_PARAMS(i,typename U) > struct apply \ : name< BOOST_MPL_PP_PARAMS(i,U) > \ { \ }; \ /**/ #else // __EDG_VERSION__ namespace boost { namespace mpl { namespace aux { template< typename T > struct has_rebind_tag; }}} # define BOOST_MPL_AUX_LAMBDA_SUPPORT_SPEC(i, name, params) \ typedef BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE::int_ arity; \ BOOST_PP_LIST_FOR_EACH_I_R( \ 1 \ , BOOST_MPL_AUX_LAMBDA_SUPPORT_ARG_TYPEDEF_FUNC \ , typedef \ , BOOST_PP_TUPLE_TO_LIST(i,params) \ ) \ friend class BOOST_PP_CAT(name,_rebind); \ typedef BOOST_PP_CAT(name,_rebind) rebind; \ /**/ #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x610)) # define BOOST_MPL_AUX_LAMBDA_SUPPORT_HAS_REBIND(i, name, params) \ template< BOOST_MPL_PP_PARAMS(i,typename T) > \ ::boost::mpl::aux::yes_tag operator|( \ ::boost::mpl::aux::has_rebind_tag \ , name* \ ); \ ::boost::mpl::aux::no_tag operator|( \ ::boost::mpl::aux::has_rebind_tag \ , name< BOOST_MPL_PP_ENUM(i,::boost::mpl::na) >* \ ); \ /**/ #elif !BOOST_WORKAROUND(BOOST_MSVC, < 1300) # define BOOST_MPL_AUX_LAMBDA_SUPPORT_HAS_REBIND(i, name, params) \ template< BOOST_MPL_PP_PARAMS(i,typename T) > \ ::boost::mpl::aux::yes_tag operator|( \ ::boost::mpl::aux::has_rebind_tag \ , ::boost::mpl::aux::has_rebind_tag< name >* \ ); \ /**/ #else # define BOOST_MPL_AUX_LAMBDA_SUPPORT_HAS_REBIND(i, name, params) /**/ #endif # if !defined(__BORLANDC__) # define BOOST_MPL_AUX_LAMBDA_SUPPORT(i, name, params) \ BOOST_MPL_AUX_LAMBDA_SUPPORT_SPEC(i, name, params) \ }; \ BOOST_MPL_AUX_LAMBDA_SUPPORT_HAS_REBIND(i, name, params) \ class BOOST_PP_CAT(name,_rebind) \ { \ public: \ template< BOOST_MPL_PP_PARAMS(i,typename U) > struct apply \ : name< BOOST_MPL_PP_PARAMS(i,U) > \ { \ }; \ /**/ # else # define BOOST_MPL_AUX_LAMBDA_SUPPORT(i, name, params) \ BOOST_MPL_AUX_LAMBDA_SUPPORT_SPEC(i, name, params) \ }; \ BOOST_MPL_AUX_LAMBDA_SUPPORT_HAS_REBIND(i, name, params) \ class BOOST_PP_CAT(name,_rebind) \ { \ public: \ template< BOOST_MPL_PP_PARAMS(i,typename U) > struct apply \ { \ typedef typename name< BOOST_MPL_PP_PARAMS(i,U) >::type type; \ }; \ /**/ # endif // __BORLANDC__ #endif // __EDG_VERSION__ #endif // BOOST_MPL_CFG_NO_FULL_LAMBDA_SUPPORT #endif // BOOST_MPL_AUX_LAMBDA_SUPPORT_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/lambda_spec.hpp0000644000000000000000000000007412717644140021515 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/lambda_spec.hpp0000664000372100037210000000245412717644140022351 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_LAMBDA_SPEC_HPP_INCLUDED #define BOOST_MPL_AUX_LAMBDA_SPEC_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2007 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: lambda_spec.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #if !defined(BOOST_MPL_CFG_NO_FULL_LAMBDA_SUPPORT) # define BOOST_MPL_AUX_PASS_THROUGH_LAMBDA_SPEC(i, name) \ template< \ BOOST_MPL_PP_PARAMS(i, typename T) \ , typename Tag \ > \ struct lambda< \ name< BOOST_MPL_PP_PARAMS(i, T) > \ , Tag \ BOOST_MPL_AUX_LAMBDA_ARITY_PARAM(int_) \ > \ { \ typedef false_ is_le; \ typedef name< BOOST_MPL_PP_PARAMS(i, T) > result_; \ typedef result_ type; \ }; \ /**/ #else # define BOOST_MPL_AUX_PASS_THROUGH_LAMBDA_SPEC(i, name) /**/ #endif #endif // BOOST_MPL_AUX_LAMBDA_SPEC_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/begin_end_impl.hpp0000644000000000000000000000007412717644140022216 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/aux_/begin_end_impl.hpp0000664000372100037210000000530412717644140023047 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_BEGIN_END_IMPL_HPP_INCLUDED #define BOOST_MPL_AUX_BEGIN_END_IMPL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: begin_end_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include #include namespace boost { namespace mpl { namespace aux { template< typename Sequence > struct begin_type { typedef typename Sequence::begin type; }; template< typename Sequence > struct end_type { typedef typename Sequence::end type; }; } // default implementation; conrete sequences might override it by // specializing either the 'begin_impl/end_impl' or the primary // 'begin/end' templates template< typename Tag > struct begin_impl { template< typename Sequence > struct apply { typedef typename eval_if, aux::begin_type, void_>::type type; }; }; template< typename Tag > struct end_impl { template< typename Sequence > struct apply { typedef typename eval_if, aux::end_type, void_>::type type; }; }; // specialize 'begin_trait/end_trait' for two pre-defined tags # define AUX778076_IMPL_SPEC(name, tag, result) \ template<> \ struct name##_impl \ { \ template< typename Sequence > struct apply \ { \ typedef result type; \ }; \ }; \ /**/ // a sequence with nested 'begin/end' typedefs; just query them AUX778076_IMPL_SPEC(begin, nested_begin_end_tag, typename Sequence::begin) AUX778076_IMPL_SPEC(end, nested_begin_end_tag, typename Sequence::end) // if a type 'T' does not contain 'begin/end' or 'tag' members // and doesn't specialize either 'begin/end' or 'begin_impl/end_impl' // templates, then we end up here AUX778076_IMPL_SPEC(begin, non_sequence_tag, void_) AUX778076_IMPL_SPEC(end, non_sequence_tag, void_) AUX778076_IMPL_SPEC(begin, na, void_) AUX778076_IMPL_SPEC(end, na, void_) # undef AUX778076_IMPL_SPEC BOOST_MPL_ALGORITM_TRAITS_LAMBDA_SPEC_IMPL(1,begin_impl) BOOST_MPL_ALGORITM_TRAITS_LAMBDA_SPEC_IMPL(1,end_impl) }} #endif // BOOST_MPL_AUX_BEGIN_END_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/arity_spec.hpp0000644000000000000000000000007412717644140021425 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/aux_/arity_spec.hpp0000664000372100037210000000362512717644140022262 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_ARITY_SPEC_HPP_INCLUDED #define BOOST_MPL_AUX_ARITY_SPEC_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: arity_spec.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include #include #include #if defined(BOOST_MPL_CFG_BROKEN_DEFAULT_PARAMETERS_IN_NESTED_TEMPLATES) # define BOOST_MPL_AUX_NONTYPE_ARITY_SPEC(i,type,name) \ namespace aux { \ template< BOOST_MPL_AUX_NTTP_DECL(int, N), BOOST_MPL_PP_PARAMS(i,type T) > \ struct arity< \ name< BOOST_MPL_PP_PARAMS(i,T) > \ , N \ > \ { \ BOOST_STATIC_CONSTANT(int \ , value = BOOST_MPL_LIMIT_METAFUNCTION_ARITY \ ); \ }; \ } \ /**/ #else # define BOOST_MPL_AUX_NONTYPE_ARITY_SPEC(i,type,name) /**/ #endif # define BOOST_MPL_AUX_ARITY_SPEC(i,name) \ BOOST_MPL_AUX_NONTYPE_ARITY_SPEC(i,typename,name) \ /**/ #if defined(BOOST_MPL_CFG_EXTENDED_TEMPLATE_PARAMETERS_MATCHING) \ && !defined(BOOST_MPL_CFG_NO_FULL_LAMBDA_SUPPORT) # define BOOST_MPL_AUX_TEMPLATE_ARITY_SPEC(i, name) \ namespace aux { \ template< BOOST_MPL_PP_PARAMS(i,typename T) > \ struct template_arity< name > \ : int_ \ { \ }; \ } \ /**/ #else # define BOOST_MPL_AUX_TEMPLATE_ARITY_SPEC(i, name) /**/ #endif #endif // BOOST_MPL_AUX_ARITY_SPEC_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/iter_fold_if_impl.hpp0000644000000000000000000000007412717644140022731 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/iter_fold_if_impl.hpp0000664000372100037210000001351412717644140023564 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_ITER_FOLD_IF_IMPL_HPP_INCLUDED #define BOOST_MPL_AUX_ITER_FOLD_IF_IMPL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // Copyright David Abrahams 2001-2002 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: iter_fold_if_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include # include # include # include # include #endif #include #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # define BOOST_MPL_PREPROCESSED_HEADER iter_fold_if_impl.hpp # include #else # include # include # include # include # include # include namespace boost { namespace mpl { namespace aux { template< typename Iterator, typename State > struct iter_fold_if_null_step { typedef State state; typedef Iterator iterator; }; template< bool > struct iter_fold_if_step_impl { template< typename Iterator , typename State , typename StateOp , typename IteratorOp > struct result_ { typedef typename apply2::type state; typedef typename IteratorOp::type iterator; }; }; template<> struct iter_fold_if_step_impl { template< typename Iterator , typename State , typename StateOp , typename IteratorOp > struct result_ { typedef State state; typedef Iterator iterator; }; }; // agurt, 25/jun/02: MSVC 6.5 workaround, had to get rid of inheritance // here and in 'iter_fold_if_backward_step', because sometimes it interfered // with the "early template instantiation bug" in _really_ ugly ways template< typename Iterator , typename State , typename ForwardOp , typename Predicate > struct iter_fold_if_forward_step { typedef typename apply2::type not_last; typedef typename iter_fold_if_step_impl< BOOST_MPL_AUX_MSVC_VALUE_WKND(not_last)::value >::template result_< Iterator,State,ForwardOp,mpl::next > impl_; typedef typename impl_::state state; typedef typename impl_::iterator iterator; }; template< typename Iterator , typename State , typename BackwardOp , typename Predicate > struct iter_fold_if_backward_step { typedef typename apply2::type not_last; typedef typename iter_fold_if_step_impl< BOOST_MPL_AUX_MSVC_VALUE_WKND(not_last)::value >::template result_< Iterator,State,BackwardOp,identity > impl_; typedef typename impl_::state state; typedef typename impl_::iterator iterator; }; // local macros, #undef-ined at the end of the header # define AUX_ITER_FOLD_FORWARD_STEP(unused, i, unused2) \ typedef iter_fold_if_forward_step< \ typename BOOST_PP_CAT(forward_step,i)::iterator \ , typename BOOST_PP_CAT(forward_step,i)::state \ , ForwardOp \ , ForwardPredicate \ > BOOST_PP_CAT(forward_step, BOOST_PP_INC(i)); \ /**/ # define AUX_ITER_FOLD_BACKWARD_STEP_FUNC(i) \ typedef iter_fold_if_backward_step< \ typename BOOST_PP_CAT(forward_step,BOOST_PP_DEC(i))::iterator \ , typename BOOST_PP_CAT(backward_step,i)::state \ , BackwardOp \ , BackwardPredicate \ > BOOST_PP_CAT(backward_step,BOOST_PP_DEC(i)); \ /**/ # define AUX_ITER_FOLD_BACKWARD_STEP(unused, i, unused2) \ AUX_ITER_FOLD_BACKWARD_STEP_FUNC( \ BOOST_PP_SUB_D(1,BOOST_MPL_LIMIT_UNROLLING,i) \ ) \ /**/ # define AUX_LAST_FORWARD_STEP \ BOOST_PP_CAT(forward_step, BOOST_MPL_LIMIT_UNROLLING) \ /**/ # define AUX_LAST_BACKWARD_STEP \ BOOST_PP_CAT(backward_step, BOOST_MPL_LIMIT_UNROLLING) \ /**/ template< typename Iterator , typename State , typename ForwardOp , typename ForwardPredicate , typename BackwardOp , typename BackwardPredicate > struct iter_fold_if_impl { private: typedef iter_fold_if_null_step forward_step0; BOOST_PP_REPEAT( BOOST_MPL_LIMIT_UNROLLING , AUX_ITER_FOLD_FORWARD_STEP , unused ) typedef typename if_< typename AUX_LAST_FORWARD_STEP::not_last , iter_fold_if_impl< typename AUX_LAST_FORWARD_STEP::iterator , typename AUX_LAST_FORWARD_STEP::state , ForwardOp , ForwardPredicate , BackwardOp , BackwardPredicate > , iter_fold_if_null_step< typename AUX_LAST_FORWARD_STEP::iterator , typename AUX_LAST_FORWARD_STEP::state > >::type AUX_LAST_BACKWARD_STEP; BOOST_PP_REPEAT( BOOST_MPL_LIMIT_UNROLLING , AUX_ITER_FOLD_BACKWARD_STEP , unused ) public: typedef typename backward_step0::state state; typedef typename AUX_LAST_BACKWARD_STEP::iterator iterator; }; # undef AUX_LAST_BACKWARD_STEP # undef AUX_LAST_FORWARD_STEP # undef AUX_ITER_FOLD_BACKWARD_STEP # undef AUX_ITER_FOLD_BACKWARD_STEP_FUNC # undef AUX_ITER_FOLD_FORWARD_STEP }}} #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #endif // BOOST_MPL_AUX_ITER_FOLD_IF_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/push_back_impl.hpp0000644000000000000000000000007312717644140022242 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/push_back_impl.hpp0000664000372100037210000000421012717644140023067 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_PUSH_BACK_IMPL_HPP_INCLUDED #define BOOST_MPL_AUX_PUSH_BACK_IMPL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2008 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: push_back_impl.hpp 55679 2009-08-20 07:50:16Z agurtovoy $ // $Date: 2009-08-20 00:50:16 -0700 (Thu, 20 Aug 2009) $ // $Revision: 55679 $ #include #include #include #include #include #include #include namespace boost { namespace mpl { struct has_push_back_arg {}; // agurt 05/feb/04: no default implementation; the stub definition is needed // to enable the default 'has_push_back' implementation below template< typename Tag > struct push_back_impl { template< typename Sequence, typename T > struct apply { // should be instantiated only in the context of 'has_push_back_impl'; // if you've got an assert here, you are requesting a 'push_back' // specialization that doesn't exist. BOOST_MPL_ASSERT_MSG( ( boost::is_same< T, has_push_back_arg >::value ) , REQUESTED_PUSH_BACK_SPECIALIZATION_FOR_SEQUENCE_DOES_NOT_EXIST , ( Sequence ) ); }; }; template< typename Tag > struct has_push_back_impl { template< typename Seq > struct apply #if !defined(BOOST_MPL_CFG_NO_NESTED_FORWARDING) : aux::has_type< push_back< Seq, has_push_back_arg > > { #else { typedef aux::has_type< push_back< Seq, has_push_back_arg > > type; BOOST_STATIC_CONSTANT(bool, value = (aux::has_type< push_back< Seq, has_push_back_arg > >::value) ); #endif }; }; BOOST_MPL_ALGORITM_TRAITS_LAMBDA_SPEC(2, push_back_impl) BOOST_MPL_ALGORITM_TRAITS_LAMBDA_SPEC(1, has_push_back_impl) }} #endif // BOOST_MPL_AUX_PUSH_BACK_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/nested_type_wknd.hpp0000644000000000000000000000007412717644140022631 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/nested_type_wknd.hpp0000664000372100037210000000254312717644140023464 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_NESTED_TYPE_WKND_HPP_INCLUDED #define BOOST_MPL_AUX_NESTED_TYPE_WKND_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: nested_type_wknd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #if BOOST_WORKAROUND(BOOST_MPL_CFG_GCC, BOOST_TESTED_AT(0x0302)) \ || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x561)) \ || BOOST_WORKAROUND(__SUNPRO_CC, BOOST_TESTED_AT(0x530)) \ || BOOST_WORKAROUND(__DMC__, BOOST_TESTED_AT(0x840)) namespace boost { namespace mpl { namespace aux { template< typename T > struct nested_type_wknd : T::type { }; }}} #if BOOST_WORKAROUND(__DMC__, BOOST_TESTED_AT(0x840)) # define BOOST_MPL_AUX_NESTED_TYPE_WKND(T) \ aux::nested_type_wknd \ /**/ #else # define BOOST_MPL_AUX_NESTED_TYPE_WKND(T) \ ::boost::mpl::aux::nested_type_wknd \ /**/ #endif #else // !BOOST_MPL_CFG_GCC et al. # define BOOST_MPL_AUX_NESTED_TYPE_WKND(T) T::type #endif #endif // BOOST_MPL_AUX_NESTED_TYPE_WKND_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/type_wrapper.hpp0000644000000000000000000000007412717644140022004 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/aux_/type_wrapper.hpp0000664000372100037210000000241412717644140022634 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_TYPE_WRAPPER_HPP_INCLUDED #define BOOST_MPL_AUX_TYPE_WRAPPER_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // Copyright Peter Dimov 2000-2003 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: type_wrapper.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include namespace boost { namespace mpl { namespace aux { template< typename T > struct type_wrapper { typedef T type; }; #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) // agurt 08/may/03: a complicated way to extract the wrapped type; need it // mostly for the sake of GCC (3.2.x), which ICEs if you try to extract the // nested 'type' from 'type_wrapper' when the latter was the result of a // 'typeof' expression template< typename T > struct wrapped_type; template< typename T > struct wrapped_type< type_wrapper > { typedef T type; }; #else template< typename W > struct wrapped_type { typedef typename W::type type; }; #endif }}} #endif // BOOST_MPL_AUX_TYPE_WRAPPER_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/msvc_type.hpp0000644000000000000000000000007412717644140021274 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/msvc_type.hpp0000664000372100037210000000244312717644140022126 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_MSVC_TYPE_HPP_INCLUDED #define BOOST_MPL_AUX_MSVC_TYPE_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: msvc_type.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include namespace boost { namespace mpl { namespace aux { #if defined(BOOST_MPL_CFG_MSVC_70_ETI_BUG) template< bool > struct msvc_type_impl { template< typename T > struct result_ { typedef typename T::type type; }; }; template<> struct msvc_type_impl { template< typename T > struct result_ { typedef result_ type; }; }; template< typename T > struct msvc_type : msvc_type_impl< is_msvc_eti_arg::value > ::template result_ { }; #else // BOOST_MPL_CFG_MSVC_70_ETI_BUG template< typename T > struct msvc_type { typedef typename T::type type; }; template<> struct msvc_type { typedef int type; }; #endif }}} #endif // BOOST_MPL_AUX_MSVC_TYPE_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/reverse_fold_impl.hpp0000644000000000000000000000007312717644140022762 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/reverse_fold_impl.hpp0000664000372100037210000000273412717644140023620 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_REVERSE_FOLD_IMPL_HPP_INCLUDED #define BOOST_MPL_AUX_REVERSE_FOLD_IMPL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: reverse_fold_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include # include # include # include # if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \ || defined(BOOST_MPL_CFG_NO_NONTYPE_TEMPLATE_PARTIAL_SPEC) # include # include # endif #endif #include #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # define BOOST_MPL_PREPROCESSED_HEADER reverse_fold_impl.hpp # include #else # define AUX778076_FOLD_IMPL_OP(iter) typename deref::type # define AUX778076_FOLD_IMPL_NAME_PREFIX reverse_fold # include #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #endif // BOOST_MPL_AUX_REVERSE_FOLD_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/template_arity_fwd.hpp0000644000000000000000000000007312717644140023145 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/template_arity_fwd.hpp0000664000372100037210000000125012717644140023773 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_TEMPLATE_ARITY_FWD_HPP_INCLUDED #define BOOST_MPL_AUX_TEMPLATE_ARITY_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: template_arity_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ namespace boost { namespace mpl { namespace aux { template< typename F > struct template_arity; }}} #endif // BOOST_MPL_AUX_TEMPLATE_ARITY_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/full_lambda.hpp0000644000000000000000000000007412717644140021525 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/full_lambda.hpp0000664000372100037210000002131212717644140022353 0ustar00fransfrans00000000000000 #if !defined(BOOST_PP_IS_ITERATING) ///// header body #ifndef BOOST_MPL_AUX_FULL_LAMBDA_HPP_INCLUDED #define BOOST_MPL_AUX_FULL_LAMBDA_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: full_lambda.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include # include # include # include # include # include # include # include # include # include # if defined(BOOST_MPL_CFG_EXTENDED_TEMPLATE_PARAMETERS_MATCHING) # include # endif #endif #include #include #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # define BOOST_MPL_PREPROCESSED_HEADER full_lambda.hpp # include #else # include # include # include # include # include # include # include # include # include # include namespace boost { namespace mpl { // local macros, #undef-ined at the end of the header # define AUX778076_LAMBDA_PARAMS(i_, param) \ BOOST_MPL_PP_PARAMS(i_, param) \ /**/ # define AUX778076_BIND_PARAMS(param) \ BOOST_MPL_PP_PARAMS( \ BOOST_MPL_LIMIT_METAFUNCTION_ARITY \ , param \ ) \ /**/ # define AUX778076_BIND_N_PARAMS(i_, param) \ BOOST_PP_COMMA_IF(i_) \ BOOST_MPL_PP_PARAMS(i_, param) \ /**/ # define AUX778076_ARITY_PARAM(param) \ BOOST_MPL_AUX_LAMBDA_ARITY_PARAM(param) \ /**/ #define n_ BOOST_MPL_LIMIT_METAFUNCTION_ARITY namespace aux { template< BOOST_MPL_PP_DEFAULT_PARAMS(n_,bool C,false) > struct lambda_or : true_ { }; template<> struct lambda_or< BOOST_MPL_PP_ENUM(n_,false) > : false_ { }; } // namespace aux #undef n_ template< typename T , typename Tag AUX778076_ARITY_PARAM(typename Arity) > struct lambda { typedef false_ is_le; typedef T result_; typedef T type; }; template< typename T > struct is_lambda_expression : lambda::is_le { }; template< int N, typename Tag > struct lambda< arg,Tag AUX778076_ARITY_PARAM(int_<-1>) > { typedef true_ is_le; typedef mpl::arg result_; // qualified for the sake of MIPSpro 7.41 typedef mpl::protect type; }; #define BOOST_PP_ITERATION_PARAMS_1 \ (3,(0, BOOST_MPL_LIMIT_METAFUNCTION_ARITY, )) #include BOOST_PP_ITERATE() /// special case for 'protect' template< typename T, typename Tag > struct lambda< mpl::protect,Tag AUX778076_ARITY_PARAM(int_<1>) > { typedef false_ is_le; typedef mpl::protect result_; typedef result_ type; }; /// specializations for the main 'bind' form template< typename F, AUX778076_BIND_PARAMS(typename T) , typename Tag > struct lambda< bind , Tag AUX778076_ARITY_PARAM(int_) > { typedef false_ is_le; typedef bind result_; typedef result_ type; }; #if defined(BOOST_MPL_CFG_EXTENDED_TEMPLATE_PARAMETERS_MATCHING) template< typename F , typename Tag1 , typename Tag2 , typename Arity > struct lambda< lambda , Tag2 , int_<3> > { typedef lambda< F,Tag2 > l1; typedef lambda< Tag1,Tag2 > l2; typedef typename l1::is_le is_le; typedef bind1< quote1, typename l1::result_ > arity_; typedef lambda< typename if_::type,Tag2 > l3; typedef aux::le_result3 le_result_; typedef typename le_result_::result_ result_; typedef typename le_result_::type type; }; #elif !defined(BOOST_MPL_CFG_DMC_AMBIGUOUS_CTPS) /// workaround for MWCW 8.3+/EDG < 303, leads to ambiguity on Digital Mars template< typename F, typename Tag1, typename Tag2 > struct lambda< lambda< F,Tag1 > , Tag2 > { typedef lambda< F,Tag2 > l1; typedef lambda< Tag1,Tag2 > l2; typedef typename l1::is_le is_le; typedef aux::le_result2 le_result_; typedef typename le_result_::result_ result_; typedef typename le_result_::type type; }; #endif # undef AUX778076_ARITY_PARAM # undef AUX778076_BIND_N_PARAMS # undef AUX778076_BIND_PARAMS # undef AUX778076_LAMBDA_PARAMS #if !defined(BOOST_MPL_CFG_EXTENDED_TEMPLATE_PARAMETERS_MATCHING) BOOST_MPL_AUX_NA_SPEC(2, lambda) #else BOOST_MPL_AUX_NA_SPEC2(2, 3, lambda) #endif }} #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #endif // BOOST_MPL_AUX_FULL_LAMBDA_HPP_INCLUDED ///// iteration, depth == 1 // For gcc 4.4 compatability, we must include the // BOOST_PP_ITERATION_DEPTH test inside an #else clause. #else // BOOST_PP_IS_ITERATING #if BOOST_PP_ITERATION_DEPTH() == 1 #define i_ BOOST_PP_FRAME_ITERATION(1) #if i_ > 0 namespace aux { # define AUX778076_RESULT(unused, i_, T) \ BOOST_PP_COMMA_IF(i_) \ typename BOOST_PP_CAT(T, BOOST_PP_INC(i_))::result_ \ /**/ # define AUX778076_TYPE(unused, i_, T) \ BOOST_PP_COMMA_IF(i_) \ typename BOOST_PP_CAT(T, BOOST_PP_INC(i_))::type \ /**/ template< typename IsLE, typename Tag , template< AUX778076_LAMBDA_PARAMS(i_, typename P) > class F , AUX778076_LAMBDA_PARAMS(i_, typename L) > struct BOOST_PP_CAT(le_result,i_) { typedef F< BOOST_MPL_PP_REPEAT(i_, AUX778076_TYPE, L) > result_; typedef result_ type; }; template< typename Tag , template< AUX778076_LAMBDA_PARAMS(i_, typename P) > class F , AUX778076_LAMBDA_PARAMS(i_, typename L) > struct BOOST_PP_CAT(le_result,i_)< true_,Tag,F,AUX778076_LAMBDA_PARAMS(i_, L) > { typedef BOOST_PP_CAT(bind,i_)< BOOST_PP_CAT(quote,i_) , BOOST_MPL_PP_REPEAT(i_, AUX778076_RESULT, L) > result_; typedef mpl::protect type; }; # undef AUX778076_TYPE # undef AUX778076_RESULT } // namespace aux # define AUX778076_LAMBDA_TYPEDEF(unused, i_, T) \ typedef lambda< BOOST_PP_CAT(T, BOOST_PP_INC(i_)), Tag > \ BOOST_PP_CAT(l,BOOST_PP_INC(i_)); \ /**/ # define AUX778076_IS_LE_TYPEDEF(unused, i_, unused2) \ typedef typename BOOST_PP_CAT(l,BOOST_PP_INC(i_))::is_le \ BOOST_PP_CAT(is_le,BOOST_PP_INC(i_)); \ /**/ # define AUX778076_IS_LAMBDA_EXPR(unused, i_, unused2) \ BOOST_PP_COMMA_IF(i_) \ BOOST_PP_CAT(is_le,BOOST_PP_INC(i_))::value \ /**/ template< template< AUX778076_LAMBDA_PARAMS(i_, typename P) > class F , AUX778076_LAMBDA_PARAMS(i_, typename T) , typename Tag > struct lambda< F , Tag AUX778076_ARITY_PARAM(int_) > { BOOST_MPL_PP_REPEAT(i_, AUX778076_LAMBDA_TYPEDEF, T) BOOST_MPL_PP_REPEAT(i_, AUX778076_IS_LE_TYPEDEF, unused) typedef typename aux::lambda_or< BOOST_MPL_PP_REPEAT(i_, AUX778076_IS_LAMBDA_EXPR, unused) >::type is_le; typedef aux::BOOST_PP_CAT(le_result,i_)< is_le, Tag, F, AUX778076_LAMBDA_PARAMS(i_, l) > le_result_; typedef typename le_result_::result_ result_; typedef typename le_result_::type type; }; # undef AUX778076_IS_LAMBDA_EXPR # undef AUX778076_IS_LE_TYPEDEF # undef AUX778076_LAMBDA_TYPEDEF #endif // i_ > 0 template< typename F AUX778076_BIND_N_PARAMS(i_, typename T) , typename Tag > struct lambda< BOOST_PP_CAT(bind,i_) , Tag AUX778076_ARITY_PARAM(int_) > { typedef false_ is_le; typedef BOOST_PP_CAT(bind,i_)< F AUX778076_BIND_N_PARAMS(i_, T) > result_; typedef result_ type; }; #undef i_ #endif // BOOST_PP_ITERATION_DEPTH() #endif // BOOST_PP_IS_ITERATING madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/numeric_op.hpp0000644000000000000000000000007412717644140021423 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/numeric_op.hpp0000664000372100037210000002062612717644140022260 0ustar00fransfrans00000000000000 #if !defined(BOOST_PP_IS_ITERATING) ///// header body // NO INCLUDE GUARDS, THE HEADER IS INTENDED FOR MULTIPLE INCLUSION! // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: numeric_op.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include # include # include # include # include # include # include # include # include # include # include # include #endif #include #if defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ || defined(BOOST_MPL_PREPROCESSING_MODE) # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include #if !defined(AUX778076_OP_ARITY) # define AUX778076_OP_ARITY BOOST_MPL_LIMIT_METAFUNCTION_ARITY #endif #if !defined(AUX778076_OP_IMPL_NAME) # define AUX778076_OP_IMPL_NAME BOOST_PP_CAT(AUX778076_OP_PREFIX,_impl) #endif #if !defined(AUX778076_OP_TAG_NAME) # define AUX778076_OP_TAG_NAME BOOST_PP_CAT(AUX778076_OP_PREFIX,_tag) #endif namespace boost { namespace mpl { template< typename Tag1 , typename Tag2 #if BOOST_WORKAROUND(BOOST_MSVC, <= 1300) , BOOST_MPL_AUX_NTTP_DECL(int, tag1_) = BOOST_MPL_AUX_MSVC_VALUE_WKND(Tag1)::value , BOOST_MPL_AUX_NTTP_DECL(int, tag2_) = BOOST_MPL_AUX_MSVC_VALUE_WKND(Tag2)::value > struct AUX778076_OP_IMPL_NAME : if_c< ( tag1_ > tag2_ ) #else > struct AUX778076_OP_IMPL_NAME : if_c< ( BOOST_MPL_AUX_NESTED_VALUE_WKND(int, Tag1) > BOOST_MPL_AUX_NESTED_VALUE_WKND(int, Tag2) ) #endif , aux::cast2nd_impl< AUX778076_OP_IMPL_NAME,Tag1,Tag2 > , aux::cast1st_impl< AUX778076_OP_IMPL_NAME,Tag1,Tag2 > >::type { }; /// for Digital Mars C++/compilers with no CTPS/TTP support template<> struct AUX778076_OP_IMPL_NAME { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template< typename Tag > struct AUX778076_OP_IMPL_NAME { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template< typename Tag > struct AUX778076_OP_IMPL_NAME { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; #else template<> struct AUX778076_OP_IMPL_NAME { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; template<> struct AUX778076_OP_IMPL_NAME { template< typename U1, typename U2 > struct apply { typedef apply type; BOOST_STATIC_CONSTANT(int, value = 0); }; }; #endif #if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \ && BOOST_WORKAROUND(BOOST_MSVC, >= 1300) template< typename T > struct AUX778076_OP_TAG_NAME : tag { }; #else template< typename T > struct AUX778076_OP_TAG_NAME { typedef typename T::tag type; }; #endif #if AUX778076_OP_ARITY != 2 # if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) # define AUX778076_OP_RIGHT_OPERAND(unused, i, N) , BOOST_PP_CAT(N, BOOST_MPL_PP_ADD(i, 2))> # define AUX778076_OP_N_CALLS(i, N) \ BOOST_MPL_PP_REPEAT( BOOST_PP_DEC(i), BOOST_MPL_PP_REPEAT_IDENTITY_FUNC, AUX778076_OP_NAME< ) \ N1 BOOST_MPL_PP_REPEAT( BOOST_MPL_PP_SUB(i, 1), AUX778076_OP_RIGHT_OPERAND, N ) \ /**/ template< typename BOOST_MPL_AUX_NA_PARAM(N1) , typename BOOST_MPL_AUX_NA_PARAM(N2) BOOST_MPL_PP_DEF_PARAMS_TAIL(2, typename N, na) > struct AUX778076_OP_NAME : AUX778076_OP_N_CALLS(AUX778076_OP_ARITY, N) { BOOST_MPL_AUX_LAMBDA_SUPPORT( AUX778076_OP_ARITY , AUX778076_OP_NAME , ( BOOST_MPL_PP_PARAMS(AUX778076_OP_ARITY, N) ) ) }; #define BOOST_PP_ITERATION_PARAMS_1 \ (3,( BOOST_PP_DEC(AUX778076_OP_ARITY), 2, )) #include BOOST_PP_ITERATE() # undef AUX778076_OP_N_CALLS # undef AUX778076_OP_RIGHT_OPERAND # else // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION /// forward declaration template< typename BOOST_MPL_AUX_NA_PARAM(N1) , typename BOOST_MPL_AUX_NA_PARAM(N2) > struct BOOST_PP_CAT(AUX778076_OP_NAME,2); template< typename BOOST_MPL_AUX_NA_PARAM(N1) , typename BOOST_MPL_AUX_NA_PARAM(N2) BOOST_MPL_PP_DEF_PARAMS_TAIL(2, typename N, na) > struct AUX778076_OP_NAME #if BOOST_WORKAROUND(BOOST_MSVC, == 1300) : aux::msvc_eti_base< typename if_< #else : if_< #endif is_na , BOOST_PP_CAT(AUX778076_OP_NAME,2) , AUX778076_OP_NAME< BOOST_PP_CAT(AUX778076_OP_NAME,2) , BOOST_MPL_PP_EXT_PARAMS(3, BOOST_PP_INC(AUX778076_OP_ARITY), N) > >::type #if BOOST_WORKAROUND(BOOST_MSVC, == 1300) > #endif { BOOST_MPL_AUX_LAMBDA_SUPPORT( AUX778076_OP_ARITY , AUX778076_OP_NAME , ( BOOST_MPL_PP_PARAMS(AUX778076_OP_ARITY, N) ) ) }; template< typename N1 , typename N2 > struct BOOST_PP_CAT(AUX778076_OP_NAME,2) #endif #else // AUX778076_OP_ARITY == 2 template< typename BOOST_MPL_AUX_NA_PARAM(N1) , typename BOOST_MPL_AUX_NA_PARAM(N2) > struct AUX778076_OP_NAME #endif #if !defined(BOOST_MPL_CFG_MSVC_ETI_BUG) : AUX778076_OP_IMPL_NAME< typename AUX778076_OP_TAG_NAME::type , typename AUX778076_OP_TAG_NAME::type >::template apply::type #else : aux::msvc_eti_base< typename apply_wrap2< AUX778076_OP_IMPL_NAME< typename AUX778076_OP_TAG_NAME::type , typename AUX778076_OP_TAG_NAME::type > , N1 , N2 >::type >::type #endif { #if AUX778076_OP_ARITY != 2 # if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) BOOST_MPL_AUX_LAMBDA_SUPPORT_SPEC( AUX778076_OP_ARITY , AUX778076_OP_NAME , ( BOOST_MPL_PP_PARTIAL_SPEC_PARAMS(2, N, na) ) ) # else BOOST_MPL_AUX_LAMBDA_SUPPORT(2, BOOST_PP_CAT(AUX778076_OP_NAME,2), (N1, N2)) # endif #else BOOST_MPL_AUX_LAMBDA_SUPPORT(2, AUX778076_OP_NAME, (N1, N2)) #endif }; BOOST_MPL_AUX_NA_SPEC2(2, AUX778076_OP_ARITY, AUX778076_OP_NAME) }} #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS ///// iteration, depth == 1 // For gcc 4.4 compatability, we must include the // BOOST_PP_ITERATION_DEPTH test inside an #else clause. #else // BOOST_PP_IS_ITERATING #if BOOST_PP_ITERATION_DEPTH() == 1 # define i_ BOOST_PP_FRAME_ITERATION(1) template< BOOST_MPL_PP_PARAMS(i_, typename N) > struct AUX778076_OP_NAME #if i_ != 2 : AUX778076_OP_N_CALLS(i_, N) { BOOST_MPL_AUX_LAMBDA_SUPPORT_SPEC( AUX778076_OP_ARITY , AUX778076_OP_NAME , ( BOOST_MPL_PP_PARTIAL_SPEC_PARAMS(i_, N, na) ) ) }; #endif # undef i_ #endif // BOOST_PP_ITERATION_DEPTH() #endif // BOOST_PP_IS_ITERATING madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/contains_impl.hpp0000644000000000000000000000007412717644140022122 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/contains_impl.hpp0000664000372100037210000000322412717644140022752 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_CONTAINS_IMPL_HPP_INCLUDED #define BOOST_MPL_AUX_CONTAINS_IMPL_HPP_INCLUDED // Copyright Eric Friedman 2002 // Copyright Aleksey Gurtovoy 2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: contains_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include #include namespace boost { namespace mpl { template< typename Tag > struct contains_impl { template< typename Sequence, typename T > struct apply #if !defined(BOOST_MPL_CFG_NO_NESTED_FORWARDING) : not_< is_same< typename find::type , typename end::type > > { #else { typedef not_< is_same< typename find::type , typename end::type > > type; BOOST_STATIC_CONSTANT(bool, value = (not_< is_same< typename find::type , typename end::type > >::value) ); #endif }; }; BOOST_MPL_ALGORITM_TRAITS_LAMBDA_SPEC(2,contains_impl) }} #endif // BOOST_MPL_AUX_CONTAINS_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/advance_backward.hpp0000644000000000000000000000007412717644140022522 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/aux_/advance_backward.hpp0000664000372100037210000000671612717644140023363 0ustar00fransfrans00000000000000 #if !defined(BOOST_PP_IS_ITERATING) ///// header body #ifndef BOOST_MPL_AUX778076_ADVANCE_BACKWARD_HPP_INCLUDED #define BOOST_MPL_AUX778076_ADVANCE_BACKWARD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: advance_backward.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include # include #endif #include #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # define BOOST_MPL_PREPROCESSED_HEADER advance_backward.hpp # include #else # include # include # include # include # include # include namespace boost { namespace mpl { namespace aux { // forward declaration template< BOOST_MPL_AUX_NTTP_DECL(long, N) > struct advance_backward; # define BOOST_PP_ITERATION_PARAMS_1 \ (3,(0, BOOST_MPL_LIMIT_UNROLLING, )) # include BOOST_PP_ITERATE() // implementation for N that exceeds BOOST_MPL_LIMIT_UNROLLING template< BOOST_MPL_AUX_NTTP_DECL(long, N) > struct advance_backward { template< typename Iterator > struct apply { typedef typename apply_wrap1< advance_backward , Iterator >::type chunk_result_; typedef typename apply_wrap1< advance_backward<( (N - BOOST_MPL_LIMIT_UNROLLING) < 0 ? 0 : N - BOOST_MPL_LIMIT_UNROLLING )> , chunk_result_ >::type type; }; }; }}} #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #endif // BOOST_MPL_AUX778076_ADVANCE_BACKWARD_HPP_INCLUDED ///// iteration, depth == 1 // For gcc 4.4 compatability, we must include the // BOOST_PP_ITERATION_DEPTH test inside an #else clause. #else // BOOST_PP_IS_ITERATING #if BOOST_PP_ITERATION_DEPTH() == 1 #define i_ BOOST_PP_FRAME_ITERATION(1) template<> struct advance_backward< BOOST_PP_FRAME_ITERATION(1) > { template< typename Iterator > struct apply { typedef Iterator iter0; #if i_ > 0 # define BOOST_PP_ITERATION_PARAMS_2 \ (3,(1, BOOST_PP_FRAME_ITERATION(1), )) # include BOOST_PP_ITERATE() #endif typedef BOOST_PP_CAT(iter,BOOST_PP_FRAME_ITERATION(1)) type; }; #if defined(BOOST_MPL_CFG_MSVC_60_ETI_BUG) /// ETI workaround template<> struct apply { typedef int type; }; #endif }; #undef i_ ///// iteration, depth == 2 #elif BOOST_PP_ITERATION_DEPTH() == 2 # define AUX778076_ITER_0 BOOST_PP_CAT(iter,BOOST_PP_DEC(BOOST_PP_FRAME_ITERATION(2))) # define AUX778076_ITER_1 BOOST_PP_CAT(iter,BOOST_PP_FRAME_ITERATION(2)) typedef typename prior::type AUX778076_ITER_1; # undef AUX778076_ITER_1 # undef AUX778076_ITER_0 #endif // BOOST_PP_ITERATION_DEPTH() #endif // BOOST_PP_IS_ITERATING madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/integral_wrapper.hpp0000644000000000000000000000007412717644140022630 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/integral_wrapper.hpp0000664000372100037210000000704212717644140023462 0ustar00fransfrans00000000000000 // Copyright Aleksey Gurtovoy 2000-2006 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: integral_wrapper.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ // NO INCLUDE GUARDS, THE HEADER IS INTENDED FOR MULTIPLE INCLUSION! #include #include #include #include #include #include #if !defined(AUX_WRAPPER_NAME) # define AUX_WRAPPER_NAME BOOST_PP_CAT(AUX_WRAPPER_VALUE_TYPE,_) #endif #if !defined(AUX_WRAPPER_PARAMS) # define AUX_WRAPPER_PARAMS(N) BOOST_MPL_AUX_NTTP_DECL(AUX_WRAPPER_VALUE_TYPE, N) #endif #if !defined(AUX_WRAPPER_INST) # if BOOST_WORKAROUND(__MWERKS__, <= 0x2407) # define AUX_WRAPPER_INST(value) AUX_WRAPPER_NAME< value > # else # define AUX_WRAPPER_INST(value) BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE::AUX_WRAPPER_NAME< value > # endif #endif BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN template< AUX_WRAPPER_PARAMS(N) > struct AUX_WRAPPER_NAME { BOOST_STATIC_CONSTANT(AUX_WRAPPER_VALUE_TYPE, value = N); // agurt, 08/mar/03: SGI MIPSpro C++ workaround, have to #ifdef because some // other compilers (e.g. MSVC) are not particulary happy about it #if BOOST_WORKAROUND(__EDG_VERSION__, <= 238) typedef struct AUX_WRAPPER_NAME type; #else typedef AUX_WRAPPER_NAME type; #endif typedef AUX_WRAPPER_VALUE_TYPE value_type; typedef integral_c_tag tag; // have to #ifdef here: some compilers don't like the 'N + 1' form (MSVC), // while some other don't like 'value + 1' (Borland), and some don't like // either #if BOOST_WORKAROUND(__EDG_VERSION__, <= 243) private: BOOST_STATIC_CONSTANT(AUX_WRAPPER_VALUE_TYPE, next_value = BOOST_MPL_AUX_STATIC_CAST(AUX_WRAPPER_VALUE_TYPE, (N + 1))); BOOST_STATIC_CONSTANT(AUX_WRAPPER_VALUE_TYPE, prior_value = BOOST_MPL_AUX_STATIC_CAST(AUX_WRAPPER_VALUE_TYPE, (N - 1))); public: typedef AUX_WRAPPER_INST(next_value) next; typedef AUX_WRAPPER_INST(prior_value) prior; #elif BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x561)) \ || BOOST_WORKAROUND(__IBMCPP__, BOOST_TESTED_AT(502)) \ || (BOOST_WORKAROUND(__HP_aCC, <= 53800) && (BOOST_WORKAROUND(__hpxstd98, != 1))) typedef AUX_WRAPPER_INST( BOOST_MPL_AUX_STATIC_CAST(AUX_WRAPPER_VALUE_TYPE, (N + 1)) ) next; typedef AUX_WRAPPER_INST( BOOST_MPL_AUX_STATIC_CAST(AUX_WRAPPER_VALUE_TYPE, (N - 1)) ) prior; #else typedef AUX_WRAPPER_INST( BOOST_MPL_AUX_STATIC_CAST(AUX_WRAPPER_VALUE_TYPE, (value + 1)) ) next; typedef AUX_WRAPPER_INST( BOOST_MPL_AUX_STATIC_CAST(AUX_WRAPPER_VALUE_TYPE, (value - 1)) ) prior; #endif // enables uniform function call syntax for families of overloaded // functions that return objects of both arithmetic ('int', 'long', // 'double', etc.) and wrapped integral types (for an example, see // "mpl/example/power.cpp") operator AUX_WRAPPER_VALUE_TYPE() const { return static_cast(this->value); } }; #if !defined(BOOST_NO_INCLASS_MEMBER_INITIALIZATION) template< AUX_WRAPPER_PARAMS(N) > AUX_WRAPPER_VALUE_TYPE const AUX_WRAPPER_INST(N)::value; #endif BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE #undef AUX_WRAPPER_NAME #undef AUX_WRAPPER_PARAMS #undef AUX_WRAPPER_INST #undef AUX_WRAPPER_VALUE_TYPE madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/na_assert.hpp0000644000000000000000000000007412717644140021242 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/na_assert.hpp0000664000372100037210000000205212717644140022070 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_NA_ASSERT_HPP_INCLUDED #define BOOST_MPL_AUX_NA_ASSERT_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: na_assert.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #if !BOOST_WORKAROUND(_MSC_FULL_VER, <= 140050601) \ && !BOOST_WORKAROUND(__EDG_VERSION__, <= 243) # include # define BOOST_MPL_AUX_ASSERT_NOT_NA(x) \ BOOST_MPL_ASSERT_NOT((boost::mpl::is_na)) \ /**/ #else # include # define BOOST_MPL_AUX_ASSERT_NOT_NA(x) \ BOOST_STATIC_ASSERT(!boost::mpl::is_na::value) \ /**/ #endif #endif // BOOST_MPL_AUX_NA_ASSERT_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/push_front_impl.hpp0000644000000000000000000000007312717644140022472 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/push_front_impl.hpp0000664000372100037210000000423612717644140023327 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_PUSH_FRONT_IMPL_HPP_INCLUDED #define BOOST_MPL_AUX_PUSH_FRONT_IMPL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2008 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: push_front_impl.hpp 55679 2009-08-20 07:50:16Z agurtovoy $ // $Date: 2009-08-20 00:50:16 -0700 (Thu, 20 Aug 2009) $ // $Revision: 55679 $ #include #include #include #include #include #include #include namespace boost { namespace mpl { struct has_push_front_arg {}; // agurt 05/feb/04: no default implementation; the stub definition is needed // to enable the default 'has_push_front' implementation below template< typename Tag > struct push_front_impl { template< typename Sequence, typename T > struct apply { // should be instantiated only in the context of 'has_push_front_impl'; // if you've got an assert here, you are requesting a 'push_front' // specialization that doesn't exist. BOOST_MPL_ASSERT_MSG( ( boost::is_same< T, has_push_front_arg >::value ) , REQUESTED_PUSH_FRONT_SPECIALIZATION_FOR_SEQUENCE_DOES_NOT_EXIST , ( Sequence ) ); }; }; template< typename Tag > struct has_push_front_impl { template< typename Seq > struct apply #if !defined(BOOST_MPL_CFG_NO_NESTED_FORWARDING) : aux::has_type< push_front< Seq, has_push_front_arg > > { #else { typedef aux::has_type< push_front< Seq, has_push_front_arg > > type; BOOST_STATIC_CONSTANT(bool, value = (aux::has_type< push_front< Seq, has_push_front_arg > >::value) ); #endif }; }; BOOST_MPL_ALGORITM_TRAITS_LAMBDA_SPEC(2, push_front_impl) BOOST_MPL_ALGORITM_TRAITS_LAMBDA_SPEC(1, has_push_front_impl) }} #endif // BOOST_MPL_AUX_PUSH_FRONT_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/arg_typedef.hpp0000644000000000000000000000007412717644140021554 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/aux_/arg_typedef.hpp0000664000372100037210000000156612717644140022413 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_ARG_TYPEDEF_HPP_INCLUDED #define BOOST_MPL_AUX_ARG_TYPEDEF_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: arg_typedef.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #if defined(BOOST_MPL_CFG_NO_FULL_LAMBDA_SUPPORT) \ || BOOST_WORKAROUND(__DMC__, BOOST_TESTED_AT(0x840)) # define BOOST_MPL_AUX_ARG_TYPEDEF(T, name) typedef T name; #else # define BOOST_MPL_AUX_ARG_TYPEDEF(T, name) /**/ #endif #endif // BOOST_MPL_AUX_ARG_TYPEDEF_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/comparison_op.hpp0000644000000000000000000000007412717644140022133 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/aux_/comparison_op.hpp0000664000372100037210000000433112717644140022763 0ustar00fransfrans00000000000000 // NO INCLUDE GUARDS, THE HEADER IS INTENDED FOR MULTIPLE INCLUSION // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: comparison_op.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include # include #endif #if !defined(AUX778076_OP_PREFIX) # define AUX778076_OP_PREFIX AUX778076_OP_NAME #endif #define AUX778076_OP_ARITY 2 #include #include #include #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # define BOOST_MPL_PREPROCESSED_HEADER AUX778076_OP_PREFIX.hpp # include #else # include # include namespace boost { namespace mpl { // MSVC workaround: implement less in terms of greater #if 0 AUX778076_OP_TOKEN 1 && !(1 AUX778076_OP_TOKEN 0) && !(0 AUX778076_OP_TOKEN 0) # define AUX778076_OP(N1, N2) \ ( BOOST_MPL_AUX_VALUE_WKND(N2)::value > BOOST_MPL_AUX_VALUE_WKND(N1)::value ) \ /**/ #else # define AUX778076_OP(N1, N2) \ ( BOOST_MPL_AUX_VALUE_WKND(N1)::value \ AUX778076_OP_TOKEN BOOST_MPL_AUX_VALUE_WKND(N2)::value \ ) \ /**/ #endif template<> struct AUX778076_OP_IMPL_NAME { template< typename N1, typename N2 > struct apply #if !defined(BOOST_MPL_CFG_NO_NESTED_VALUE_ARITHMETIC) : bool_< AUX778076_OP(N1, N2) > { #else { BOOST_STATIC_CONSTANT(bool, value = AUX778076_OP(N1, N2)); typedef bool_ type; #endif }; }; #undef AUX778076_OP }} #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #undef AUX778076_OP_TAG_NAME #undef AUX778076_OP_IMPL_NAME #undef AUX778076_OP_ARITY #undef AUX778076_OP_PREFIX #undef AUX778076_OP_NAME #undef AUX778076_OP_TOKEN madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/static_cast.hpp0000644000000000000000000000007312717644140021563 xustar0030 atime=1463765180.113720063 29 ctime=1463765201.07355266 madp-0.4/src/boost/boost/mpl/aux_/static_cast.hpp0000664000372100037210000000155612717644140022422 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_STATIC_CAST_HPP_INCLUDED #define BOOST_MPL_AUX_STATIC_CAST_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: static_cast.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x561)) \ || BOOST_WORKAROUND(__GNUC__, < 3) \ || BOOST_WORKAROUND(__MWERKS__, <= 0x3001) # define BOOST_MPL_AUX_STATIC_CAST(T, expr) (T)(expr) #else # define BOOST_MPL_AUX_STATIC_CAST(T, expr) static_cast(expr) #endif #endif // BOOST_MPL_AUX_STATIC_CAST_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/has_begin.hpp0000644000000000000000000000007412717644140021202 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/has_begin.hpp0000664000372100037210000000126012717644140022030 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_HAS_BEGIN_HPP_INCLUDED #define BOOST_MPL_AUX_HAS_BEGIN_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2002-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: has_begin.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include namespace boost { namespace mpl { namespace aux { BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF(has_begin, begin, true) }}} #endif // BOOST_MPL_AUX_HAS_BEGIN_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/has_apply.hpp0000644000000000000000000000007412717644140021243 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/has_apply.hpp0000664000372100037210000000155312717644140022076 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_HAS_APPLY_HPP_INCLUDED #define BOOST_MPL_AUX_HAS_APPLY_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: has_apply.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include namespace boost { namespace mpl { namespace aux { #if !defined(BOOST_MPL_CFG_NO_HAS_APPLY) BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF(has_apply, apply, false) #else template< typename T, typename fallback_ = false_ > struct has_apply : fallback_ { }; #endif }}} #endif // BOOST_MPL_AUX_HAS_APPLY_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/has_type.hpp0000644000000000000000000000007412717644140021077 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/has_type.hpp0000664000372100037210000000125212717644140021726 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_HAS_TYPE_HPP_INCLUDED #define BOOST_MPL_AUX_HAS_TYPE_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2002-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: has_type.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include namespace boost { namespace mpl { namespace aux { BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF(has_type, type, true) }}} #endif // BOOST_MPL_AUX_HAS_TYPE_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/advance_forward.hpp0000644000000000000000000000007412717644140022410 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/aux_/advance_forward.hpp0000664000372100037210000000657412717644140023253 0ustar00fransfrans00000000000000 #if !defined(BOOST_PP_IS_ITERATING) ///// header body #ifndef BOOST_MPL_AUX_ADVANCE_FORWARD_HPP_INCLUDED #define BOOST_MPL_AUX_ADVANCE_FORWARD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: advance_forward.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include # include #endif #include #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # define BOOST_MPL_PREPROCESSED_HEADER advance_forward.hpp # include #else # include # include # include # include # include # include namespace boost { namespace mpl { namespace aux { // forward declaration template< BOOST_MPL_AUX_NTTP_DECL(long, N) > struct advance_forward; # define BOOST_PP_ITERATION_PARAMS_1 \ (3,(0, BOOST_MPL_LIMIT_UNROLLING, )) # include BOOST_PP_ITERATE() // implementation for N that exceeds BOOST_MPL_LIMIT_UNROLLING template< BOOST_MPL_AUX_NTTP_DECL(long, N) > struct advance_forward { template< typename Iterator > struct apply { typedef typename apply_wrap1< advance_forward , Iterator >::type chunk_result_; typedef typename apply_wrap1< advance_forward<( (N - BOOST_MPL_LIMIT_UNROLLING) < 0 ? 0 : N - BOOST_MPL_LIMIT_UNROLLING )> , chunk_result_ >::type type; }; }; }}} #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #endif // BOOST_MPL_AUX_ADVANCE_FORWARD_HPP_INCLUDED ///// iteration, depth == 1 // For gcc 4.4 compatability, we must include the // BOOST_PP_ITERATION_DEPTH test inside an #else clause. #else // BOOST_PP_IS_ITERATING #if BOOST_PP_ITERATION_DEPTH() == 1 #define i_ BOOST_PP_FRAME_ITERATION(1) template<> struct advance_forward< BOOST_PP_FRAME_ITERATION(1) > { template< typename Iterator > struct apply { typedef Iterator iter0; #if i_ > 0 # define BOOST_PP_ITERATION_PARAMS_2 \ (3,(1, i_, )) # include BOOST_PP_ITERATE() #endif typedef BOOST_PP_CAT(iter,i_) type; }; #if defined(BOOST_MPL_CFG_MSVC_60_ETI_BUG) /// ETI workaround template<> struct apply { typedef int type; }; #endif }; #undef i_ ///// iteration, depth == 2 #elif BOOST_PP_ITERATION_DEPTH() == 2 # define AUX778076_ITER_0 BOOST_PP_CAT(iter,BOOST_PP_DEC(BOOST_PP_FRAME_ITERATION(2))) # define AUX778076_ITER_1 BOOST_PP_CAT(iter,BOOST_PP_FRAME_ITERATION(2)) typedef typename next::type AUX778076_ITER_1; # undef AUX778076_ITER_1 # undef AUX778076_ITER_0 #endif // BOOST_PP_ITERATION_DEPTH() #endif // BOOST_PP_IS_ITERATING madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/common_name_wknd.hpp0000644000000000000000000000007412717644140022576 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/aux_/common_name_wknd.hpp0000664000372100037210000000173412717644140023432 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_COMMON_NAME_WKND_HPP_INCLUDED #define BOOST_MPL_AUX_COMMON_NAME_WKND_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2002-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: common_name_wknd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #if BOOST_WORKAROUND(__BORLANDC__, < 0x561) // agurt, 12/nov/02: to suppress the bogus "Cannot have both a template class // and function named 'xxx'" diagnostic # define BOOST_MPL_AUX_COMMON_NAME_WKND(name) \ namespace name_##wknd { \ template< typename > void name(); \ } \ /**/ #else # define BOOST_MPL_AUX_COMMON_NAME_WKND(name) /**/ #endif // __BORLANDC__ #endif // BOOST_MPL_AUX_COMMON_NAME_WKND_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/msvc_never_true.hpp0000644000000000000000000000007412717644140022471 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/msvc_never_true.hpp0000664000372100037210000000153112717644140023320 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_MSVC_NEVER_TRUE_HPP_INCLUDED #define BOOST_MPL_AUX_MSVC_NEVER_TRUE_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: msvc_never_true.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #if BOOST_WORKAROUND(BOOST_MSVC, <= 1300) namespace boost { namespace mpl { namespace aux { template< typename T > struct msvc_never_true { enum { value = false }; }; }}} #endif // BOOST_MSVC #endif // BOOST_MPL_AUX_MSVC_NEVER_TRUE_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/iter_fold_impl.hpp0000644000000000000000000000007412717644140022253 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.069552693 madp-0.4/src/boost/boost/mpl/aux_/iter_fold_impl.hpp0000664000372100037210000000251112717644140023101 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AUX_ITER_FOLD_IMPL_HPP_INCLUDED #define BOOST_MPL_AUX_ITER_FOLD_IMPL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: iter_fold_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include # include # include # if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) # include # include # endif #endif #include #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # define BOOST_MPL_PREPROCESSED_HEADER iter_fold_impl.hpp # include #else # define AUX778076_FOLD_IMPL_OP(iter) iter # define AUX778076_FOLD_IMPL_NAME_PREFIX iter_fold # include #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #endif // BOOST_MPL_AUX_ITER_FOLD_IMPL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/aux_/PaxHeaders.5405/include_preprocessed.hpp0000644000000000000000000000007412717644140023464 xustar0030 atime=1463765180.109720094 30 ctime=1463765201.065552725 madp-0.4/src/boost/boost/mpl/aux_/include_preprocessed.hpp0000664000372100037210000000265412717644140024322 0ustar00fransfrans00000000000000 // NO INCLUDE GUARDS, THE HEADER IS INTENDED FOR MULTIPLE INCLUSION // Copyright Aleksey Gurtovoy 2000-2006 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: include_preprocessed.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #if !defined(BOOST_NEEDS_TOKEN_PASTING_OP_FOR_TOKENS_JUXTAPOSING) # define AUX778076_PREPROCESSED_HEADER \ BOOST_MPL_CFG_COMPILER_DIR/BOOST_MPL_PREPROCESSED_HEADER \ /**/ #else # define AUX778076_PREPROCESSED_HEADER \ BOOST_PP_CAT(BOOST_MPL_CFG_COMPILER_DIR,/)##BOOST_MPL_PREPROCESSED_HEADER \ /**/ #endif #if BOOST_WORKAROUND(__IBMCPP__, BOOST_TESTED_AT(700)) # define AUX778076_INCLUDE_STRING BOOST_PP_STRINGIZE(boost/mpl/aux_/preprocessed/AUX778076_PREPROCESSED_HEADER) # include AUX778076_INCLUDE_STRING # undef AUX778076_INCLUDE_STRING #else # include BOOST_PP_STRINGIZE(boost/mpl/aux_/preprocessed/AUX778076_PREPROCESSED_HEADER) #endif # undef AUX778076_PREPROCESSED_HEADER #undef BOOST_MPL_PREPROCESSED_HEADER madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/size_t.hpp0000644000000000000000000000007412717644140017624 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/size_t.hpp0000664000372100037210000000132212717644140020451 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_SIZE_T_HPP_INCLUDED #define BOOST_MPL_SIZE_T_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: size_t.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #define AUX_WRAPPER_VALUE_TYPE std::size_t #define AUX_WRAPPER_NAME size_t #define AUX_WRAPPER_PARAMS(N) std::size_t N #include #endif // BOOST_MPL_SIZE_T_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/negate.hpp0000644000000000000000000000007412717644140017572 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/negate.hpp0000664000372100037210000000370012717644140020421 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_NEGATE_HPP_INCLUDED #define BOOST_MPL_NEGATE_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: negate.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include namespace boost { namespace mpl { template< typename Tag > struct negate_impl; template< typename T > struct negate_tag { typedef typename T::tag type; }; template< typename BOOST_MPL_AUX_NA_PARAM(N) > struct negate #if !defined(BOOST_MPL_CFG_MSVC_ETI_BUG) : negate_impl< typename negate_tag::type >::template apply::type #else : aux::msvc_eti_base< typename apply_wrap1< negate_impl< typename negate_tag::type > , N >::type >::type #endif { BOOST_MPL_AUX_LAMBDA_SUPPORT(1, negate, (N)) }; BOOST_MPL_AUX_NA_SPEC(1, negate) #if defined(BOOST_MPL_CFG_NO_NESTED_VALUE_ARITHMETIC) namespace aux { template< typename T, T n > struct negate_wknd { BOOST_STATIC_CONSTANT(T, value = -n); typedef integral_c type; }; } #endif template<> struct negate_impl { #if defined(BOOST_MPL_CFG_NO_NESTED_VALUE_ARITHMETIC) template< typename N > struct apply : aux::negate_wknd< typename N::value_type, N::value > #else template< typename N > struct apply : integral_c< typename N::value_type, (-N::value) > #endif { }; }; }} #endif // BOOST_MPL_NEGATE_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/protect.hpp0000644000000000000000000000007412717644140020007 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/protect.hpp0000664000372100037210000000247712717644140020650 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_PROTECT_HPP_INCLUDED #define BOOST_MPL_PROTECT_HPP_INCLUDED // Copyright Peter Dimov 2001 // Copyright Aleksey Gurtovoy 2002-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: protect.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include namespace boost { namespace mpl { template< typename BOOST_MPL_AUX_NA_PARAM(T) , int not_le_ = 0 > struct protect : T { #if BOOST_WORKAROUND(__EDG_VERSION__, == 238) typedef mpl::protect type; #else typedef protect type; #endif }; #if defined(BOOST_MPL_CFG_BROKEN_DEFAULT_PARAMETERS_IN_NESTED_TEMPLATES) namespace aux { template< BOOST_MPL_AUX_NTTP_DECL(int, N), typename T > struct arity< protect, N > : arity { }; } // namespace aux #endif BOOST_MPL_AUX_NA_SPEC_MAIN(1, protect) #if !defined(BOOST_MPL_CFG_NO_FULL_LAMBDA_SUPPORT) BOOST_MPL_AUX_NA_SPEC_TEMPLATE_ARITY(1, 1, protect) #endif }} #endif // BOOST_MPL_PROTECT_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/same_as.hpp0000644000000000000000000000007412717644140017737 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.085552564 madp-0.4/src/boost/boost/mpl/same_as.hpp0000664000372100037210000000231612717644140020570 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_SAME_AS_HPP_INCLUDED #define BOOST_MPL_SAME_AS_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: same_as.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include namespace boost { namespace mpl { template< typename T1 > struct same_as { template< typename T2 > struct apply #if !defined(BOOST_MPL_CFG_NO_NESTED_FORWARDING) : is_same { #else { typedef typename is_same::type type; #endif }; }; template< typename T1 > struct not_same_as { template< typename T2 > struct apply #if !defined(BOOST_MPL_CFG_NO_NESTED_FORWARDING) : not_< is_same > { #else { typedef typename not_< is_same >::type type; #endif }; }; }} #endif // BOOST_MPL_SAME_AS_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/transform.hpp0000644000000000000000000000007412717644140020342 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/transform.hpp0000664000372100037210000001032612717644140021173 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_TRANSFORM_HPP_INCLUDED #define BOOST_MPL_TRANSFORM_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // Copyright David Abrahams 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: transform.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include #include #include #include #include #include namespace boost { namespace mpl { namespace aux { template< typename Seq , typename Op , typename In > struct transform1_impl : fold< Seq , typename In::state , bind2< typename lambda< typename In::operation >::type , _1 , bind1< typename lambda::type, _2> > > { }; template< typename Seq , typename Op , typename In > struct reverse_transform1_impl : reverse_fold< Seq , typename In::state , bind2< typename lambda< typename In::operation >::type , _1 , bind1< typename lambda::type, _2> > > { }; template< typename Seq1 , typename Seq2 , typename Op , typename In > struct transform2_impl : fold< pair_view , typename In::state , bind2< typename lambda< typename In::operation >::type , _1 , bind2< typename lambda::type , bind1,_2> , bind1,_2> > > > { }; template< typename Seq1 , typename Seq2 , typename Op , typename In > struct reverse_transform2_impl : reverse_fold< pair_view , typename In::state , bind2< typename lambda< typename In::operation >::type , _1 , bind2< typename lambda< Op >::type , bind1,_2> , bind1,_2> > > > { }; } // namespace aux BOOST_MPL_AUX_INSERTER_ALGORITHM_DEF(3, transform1) BOOST_MPL_AUX_INSERTER_ALGORITHM_DEF(4, transform2) #define AUX778076_TRANSFORM_DEF(name) \ template< \ typename BOOST_MPL_AUX_NA_PARAM(Seq1) \ , typename BOOST_MPL_AUX_NA_PARAM(Seq2OrOperation) \ , typename BOOST_MPL_AUX_NA_PARAM(OperationOrInserter) \ , typename BOOST_MPL_AUX_NA_PARAM(Inserter) \ > \ struct name \ { \ typedef typename eval_if< \ or_< \ is_na \ , is_lambda_expression< Seq2OrOperation > \ , not_< is_sequence > \ > \ , name##1 \ , name##2 \ >::type type; \ }; \ BOOST_MPL_AUX_NA_SPEC(4, name) \ /**/ AUX778076_TRANSFORM_DEF(transform) AUX778076_TRANSFORM_DEF(reverse_transform) #undef AUX778076_TRANSFORM_DEF }} #endif // BOOST_MPL_TRANSFORM_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/less_equal.hpp0000644000000000000000000000007412717644140020464 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/less_equal.hpp0000664000372100037210000000120512717644140021311 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_LESS_EQUAL_HPP_INCLUDED #define BOOST_MPL_LESS_EQUAL_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: less_equal.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #define AUX778076_OP_NAME less_equal #define AUX778076_OP_TOKEN <= #include #endif // BOOST_MPL_LESS_EQUAL_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/size_fwd.hpp0000644000000000000000000000007412717644140020141 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.089552533 madp-0.4/src/boost/boost/mpl/size_fwd.hpp0000664000372100037210000000121312717644140020765 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_SIZE_FWD_HPP_INCLUDED #define BOOST_MPL_SIZE_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: size_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ namespace boost { namespace mpl { template< typename Tag > struct size_impl; template< typename Sequence > struct size; }} #endif // BOOST_MPL_SIZE_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/back_inserter.hpp0000644000000000000000000000007412717644140021142 xustar0030 atime=1463765180.113720063 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/back_inserter.hpp0000664000372100037210000000143612717644140021775 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_BACK_INSERTER_HPP_INCLUDED #define BOOST_MPL_BACK_INSERTER_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // Copyright David Abrahams 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: back_inserter.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include namespace boost { namespace mpl { template< typename Sequence > struct back_inserter : inserter< Sequence,push_back<> > { }; }} #endif // BOOST_MPL_BACK_INSERTER_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/deref.hpp0000644000000000000000000000007412717644140017414 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/deref.hpp0000664000372100037210000000202312717644140020240 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_DEREF_HPP_INCLUDED #define BOOST_MPL_DEREF_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2002-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: deref.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include namespace boost { namespace mpl { template< typename BOOST_MPL_AUX_NA_PARAM(Iterator) > struct deref { #if !defined(BOOST_MPL_CFG_MSVC_70_ETI_BUG) typedef typename Iterator::type type; #else typedef typename aux::msvc_type::type type; #endif BOOST_MPL_AUX_LAMBDA_SUPPORT(1,deref,(Iterator)) }; BOOST_MPL_AUX_NA_SPEC(1, deref) }} #endif // BOOST_MPL_DEREF_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/void.hpp0000644000000000000000000000007412717644140017270 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.093552501 madp-0.4/src/boost/boost/mpl/void.hpp0000664000372100037210000000325712717644140020126 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_VOID_HPP_INCLUDED #define BOOST_MPL_VOID_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: void.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN // [JDG Feb-4-2003] made void_ a complete type to allow it to be // instantiated so that it can be passed in as an object that can be // used to select an overloaded function. Possible use includes signaling // a zero arity functor evaluation call. struct void_ { typedef void_ type; }; BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE namespace boost { namespace mpl { template< typename T > struct is_void_ : false_ { #if BOOST_WORKAROUND(BOOST_MSVC, < 1300) using false_::value; #endif }; template<> struct is_void_ : true_ { #if BOOST_WORKAROUND(BOOST_MSVC, < 1300) using true_::value; #endif }; template< typename T > struct is_not_void_ : true_ { #if BOOST_WORKAROUND(BOOST_MSVC, < 1300) using true_::value; #endif }; template<> struct is_not_void_ : false_ { #if BOOST_WORKAROUND(BOOST_MSVC, < 1300) using false_::value; #endif }; BOOST_MPL_AUX_NA_SPEC(1, is_void_) BOOST_MPL_AUX_NA_SPEC(1, is_not_void_) }} #endif // BOOST_MPL_VOID_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/key_type_fwd.hpp0000644000000000000000000000007412717644140021020 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/key_type_fwd.hpp0000664000372100037210000000134012717644140021645 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_KEY_TYPE_FWD_HPP_INCLUDED #define BOOST_MPL_KEY_TYPE_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // Copyright David Abrahams 2003-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: key_type_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ namespace boost { namespace mpl { template< typename Tag > struct key_type_impl; template< typename AssociativeSequence, typename T > struct key_type; }} #endif // BOOST_MPL_KEY_TYPE_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/long_fwd.hpp0000644000000000000000000000007412717644140020126 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/long_fwd.hpp0000664000372100037210000000142712717644140020761 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_LONG_FWD_HPP_INCLUDED #define BOOST_MPL_LONG_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: long_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_OPEN template< BOOST_MPL_AUX_NTTP_DECL(long, N) > struct long_; BOOST_MPL_AUX_ADL_BARRIER_NAMESPACE_CLOSE BOOST_MPL_AUX_ADL_BARRIER_DECL(long_) #endif // BOOST_MPL_LONG_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/empty_fwd.hpp0000644000000000000000000000007412717644140020325 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.077552629 madp-0.4/src/boost/boost/mpl/empty_fwd.hpp0000664000372100037210000000122112717644140021150 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_EMPTY_FWD_HPP_INCLUDED #define BOOST_MPL_EMPTY_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: empty_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ namespace boost { namespace mpl { template< typename Tag > struct empty_impl; template< typename Sequence > struct empty; }} #endif // BOOST_MPL_EMPTY_FWD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/O1_size.hpp0000644000000000000000000000007412717644140017640 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/mpl/O1_size.hpp0000664000372100037210000000212512717644140020467 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_O1_SIZE_HPP_INCLUDED #define BOOST_MPL_O1_SIZE_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: O1_size.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include namespace boost { namespace mpl { // returns sequence size if it's an O(1) operation; otherwise returns -1 template< typename BOOST_MPL_AUX_NA_PARAM(Sequence) > struct O1_size : O1_size_impl< typename sequence_tag::type > ::template apply< Sequence > { BOOST_MPL_AUX_LAMBDA_SUPPORT(1, O1_size, (Sequence)) }; BOOST_MPL_AUX_NA_SPEC(1, O1_size) }} #endif // BOOST_MPL_O1_SIZE_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/iter_fold.hpp0000644000000000000000000000007412717644140020276 xustar0030 atime=1463765180.117720031 30 ctime=1463765201.081552597 madp-0.4/src/boost/boost/mpl/iter_fold.hpp0000664000372100037210000000254412717644140021132 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_ITER_FOLD_HPP_INCLUDED #define BOOST_MPL_ITER_FOLD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2001-2004 // Copyright David Abrahams 2001-2002 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: iter_fold.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #include #include #include #include #include namespace boost { namespace mpl { template< typename BOOST_MPL_AUX_NA_PARAM(Sequence) , typename BOOST_MPL_AUX_NA_PARAM(State) , typename BOOST_MPL_AUX_NA_PARAM(ForwardOp) > struct iter_fold { typedef typename aux::iter_fold_impl< ::boost::mpl::O1_size::value , typename begin::type , typename end::type , State , typename lambda::type >::state type; BOOST_MPL_AUX_LAMBDA_SUPPORT(3,iter_fold,(Sequence,State,ForwardOp)) }; BOOST_MPL_AUX_NA_SPEC(3, iter_fold) }} #endif // BOOST_MPL_ITER_FOLD_HPP_INCLUDED madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/apply_fwd.hpp0000644000000000000000000000007412717644140020314 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/apply_fwd.hpp0000664000372100037210000000532312717644140021146 0ustar00fransfrans00000000000000 #if !defined(BOOST_PP_IS_ITERATING) ///// header body #ifndef BOOST_MPL_APPLY_FWD_HPP_INCLUDED #define BOOST_MPL_APPLY_FWD_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: apply_fwd.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #if !defined(BOOST_MPL_PREPROCESSING_MODE) # include #endif #include #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # define BOOST_MPL_PREPROCESSED_HEADER apply_fwd.hpp # include #else # include # include # include # include # include # include # include # include // agurt, 15/jan/02: top-level 'apply' template gives an ICE on MSVC // (for known reasons) #if BOOST_WORKAROUND(BOOST_MSVC, < 1300) # define BOOST_MPL_CFG_NO_APPLY_TEMPLATE #endif namespace boost { namespace mpl { // local macro, #undef-ined at the end of the header # define AUX778076_APPLY_DEF_PARAMS(param, value) \ BOOST_MPL_PP_DEFAULT_PARAMS( \ BOOST_MPL_LIMIT_METAFUNCTION_ARITY \ , param \ , value \ ) \ /**/ # define AUX778076_APPLY_N_COMMA_PARAMS(n, param) \ BOOST_PP_COMMA_IF(n) \ BOOST_MPL_PP_PARAMS(n, param) \ /**/ # if !defined(BOOST_MPL_CFG_NO_APPLY_TEMPLATE) #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) // forward declaration template< typename F, AUX778076_APPLY_DEF_PARAMS(typename T, na) > struct apply; #else namespace aux { template< BOOST_AUX_NTTP_DECL(int, arity_) > struct apply_chooser; } #endif # endif // BOOST_MPL_CFG_NO_APPLY_TEMPLATE #define BOOST_PP_ITERATION_PARAMS_1 \ (3,(0, BOOST_MPL_LIMIT_METAFUNCTION_ARITY, )) #include BOOST_PP_ITERATE() # undef AUX778076_APPLY_N_COMMA_PARAMS # undef AUX778076_APPLY_DEF_PARAMS }} #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #endif // BOOST_MPL_APPLY_FWD_HPP_INCLUDED ///// iteration #else #define i_ BOOST_PP_FRAME_ITERATION(1) template< typename F AUX778076_APPLY_N_COMMA_PARAMS(i_, typename T) > struct BOOST_PP_CAT(apply,i_); #undef i_ #endif // BOOST_PP_IS_ITERATING madp-0.4/src/boost/boost/mpl/PaxHeaders.5405/and.hpp0000644000000000000000000000007412717644140017071 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.061552756 madp-0.4/src/boost/boost/mpl/and.hpp0000664000372100037210000000316212717644140017722 0ustar00fransfrans00000000000000 #ifndef BOOST_MPL_AND_HPP_INCLUDED #define BOOST_MPL_AND_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/mpl for documentation. // $Id: and.hpp 49267 2008-10-11 06:19:02Z agurtovoy $ // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $ // $Revision: 49267 $ #include #if !defined(BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS) \ && !defined(BOOST_MPL_PREPROCESSING_MODE) # include # include # include # include // agurt, 19/may/04: workaround a conflict with header's // 'or' and 'and' macros, see http://tinyurl.com/3et69; 'defined(and)' // has to be checked in a separate condition, otherwise GCC complains // about 'and' being an alternative token #if defined(_MSC_VER) #ifndef __GCCXML__ #if defined(and) # pragma push_macro("and") # undef and # define and(x) #endif #endif #endif # define BOOST_MPL_PREPROCESSED_HEADER and.hpp # include #if defined(_MSC_VER) #ifndef __GCCXML__ #if defined(and) # pragma pop_macro("and") #endif #endif #endif #else # define AUX778076_OP_NAME and_ # define AUX778076_OP_VALUE1 false # define AUX778076_OP_VALUE2 true # include #endif // BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #endif // BOOST_MPL_AND_HPP_INCLUDED madp-0.4/src/boost/boost/PaxHeaders.5405/compressed_pair.hpp0000644000000000000000000000007312717644140020715 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.041552917 madp-0.4/src/boost/boost/compressed_pair.hpp0000664000372100037210000000144112717644140021545 0ustar00fransfrans00000000000000// (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/utility for most recent version including documentation. // See boost/detail/compressed_pair.hpp and boost/detail/ob_compressed_pair.hpp // for full copyright notices. #ifndef BOOST_COMPRESSED_PAIR_HPP #define BOOST_COMPRESSED_PAIR_HPP #ifndef BOOST_CONFIG_HPP #include #endif #ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION #include #else #include #endif #endif // BOOST_COMPRESSED_PAIR_HPP madp-0.4/src/boost/boost/PaxHeaders.5405/move0000644000000000000000000000007412717644140015717 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/move/0000775000372100037210000000000012717644140016623 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/move/PaxHeaders.5405/traits.hpp0000644000000000000000000000007412717644140020013 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/move/traits.hpp0000664000372100037210000001366212717644140020652 0ustar00fransfrans00000000000000////////////////////////////////////////////////////////////////////////////// // // (C) Copyright Ion Gaztanaga 2009-2012. // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/move for documentation. // ////////////////////////////////////////////////////////////////////////////// //! \file #ifndef BOOST_MOVE_MOVE_TRAITS_HPP #define BOOST_MOVE_MOVE_TRAITS_HPP #include #include #include #include #include #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES #include #endif namespace boost { //! If this trait yields to true //! (has_trivial_destructor_after_move <T>::value == true) //! means that if T is used as argument of a move construction/assignment, //! there is no need to call T's destructor. //! This optimization tipically is used to improve containers' performance. //! //! By default this trait is true if the type has trivial destructor, //! every class should specialize this trait if it wants to improve performance //! when inserted in containers. template struct has_trivial_destructor_after_move : ::boost::has_trivial_destructor {}; //! By default this traits returns //! 

boost::is_nothrow_move_constructible::value && boost::is_nothrow_move_assignable::value
. //! Classes with non-throwing move constructor //! and assignment can specialize this trait to obtain some performance improvements. template struct has_nothrow_move : public ::boost::move_detail::integral_constant < bool , boost::is_nothrow_move_constructible::value && boost::is_nothrow_move_assignable::value > {}; namespace move_detail { // Code from Jeffrey Lee Hellrung, many thanks #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES template< class T> struct forward_type { typedef T type; }; #else // #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES template< class T> struct forward_type { typedef const T &type; }; template< class T> struct forward_type< boost::rv > { typedef T type; }; #endif // #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES template< class T > struct is_rvalue_reference : ::boost::move_detail::integral_constant { }; #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES template< class T > struct is_rvalue_reference< T&& > : ::boost::move_detail::integral_constant { }; #else // #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES template< class T > struct is_rvalue_reference< boost::rv& > : ::boost::move_detail::integral_constant {}; template< class T > struct is_rvalue_reference< const boost::rv& > : ::boost::move_detail::integral_constant {}; #endif // #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES template< class T > struct add_rvalue_reference { typedef T&& type; }; #else // #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES namespace detail_add_rvalue_reference { template< class T , bool emulation = ::boost::has_move_emulation_enabled::value , bool rv = ::boost::move_detail::is_rv::value > struct add_rvalue_reference_impl { typedef T type; }; template< class T, bool emulation> struct add_rvalue_reference_impl< T, emulation, true > { typedef T & type; }; template< class T, bool rv > struct add_rvalue_reference_impl< T, true, rv > { typedef ::boost::rv& type; }; } // namespace detail_add_rvalue_reference template< class T > struct add_rvalue_reference : detail_add_rvalue_reference::add_rvalue_reference_impl { }; template< class T > struct add_rvalue_reference { typedef T & type; }; #endif // #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES template< class T > struct remove_rvalue_reference { typedef T type; }; #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES template< class T > struct remove_rvalue_reference< T&& > { typedef T type; }; #else // #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES template< class T > struct remove_rvalue_reference< rv > { typedef T type; }; template< class T > struct remove_rvalue_reference< const rv > { typedef T type; }; template< class T > struct remove_rvalue_reference< volatile rv > { typedef T type; }; template< class T > struct remove_rvalue_reference< const volatile rv > { typedef T type; }; template< class T > struct remove_rvalue_reference< rv& > { typedef T type; }; template< class T > struct remove_rvalue_reference< const rv& > { typedef T type; }; template< class T > struct remove_rvalue_reference< volatile rv& > { typedef T type; }; template< class T > struct remove_rvalue_reference< const volatile rv& >{ typedef T type; }; #endif // #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES template typename boost::move_detail::add_rvalue_reference::type declval(); } //move_detail { // Ideas from Boost.Move review, Jeffrey Lee Hellrung: // //- TypeTraits metafunctions is_lvalue_reference, add_lvalue_reference, and remove_lvalue_reference ? // Perhaps add_reference and remove_reference can be modified so that they behave wrt emulated rvalue // references the same as wrt real rvalue references, i.e., add_reference< rv& > -> T& rather than // rv& (since T&& & -> T&). // //- Add'l TypeTraits has_[trivial_]move_{constructor,assign}...? // //- An as_lvalue(T& x) function, which amounts to an identity operation in C++0x, but strips emulated // rvalue references in C++03. This may be necessary to prevent "accidental moves". } //namespace boost { #include #endif //#ifndef BOOST_MOVE_MOVE_TRAITS_HPP madp-0.4/src/boost/boost/move/PaxHeaders.5405/detail0000644000000000000000000000007412717644140017161 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/move/detail/0000775000372100037210000000000012717644140020065 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/move/detail/PaxHeaders.5405/config_end.hpp0000644000000000000000000000007412717644140022042 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/move/detail/config_end.hpp0000664000372100037210000000140612717644140022672 0ustar00fransfrans00000000000000////////////////////////////////////////////////////////////////////////////// // // (C) Copyright Ion Gaztanaga 2012-2012. Distributed under the Boost // Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/container for documentation. // ////////////////////////////////////////////////////////////////////////////// #if defined BOOST_MSVC #pragma warning (pop) #ifdef BOOST_MOVE_DETAIL_CRT_SECURE_NO_DEPRECATE #undef BOOST_MOVE_DETAIL_CRT_SECURE_NO_DEPRECATE #undef _CRT_SECURE_NO_DEPRECATE #endif #ifndef BOOST_MOVE_SCL_SECURE_NO_WARNINGS #undef BOOST_MOVE_SCL_SECURE_NO_WARNINGS #undef _SCL_SECURE_NO_WARNINGS #endif #endif madp-0.4/src/boost/boost/move/detail/PaxHeaders.5405/move_helpers.hpp0000644000000000000000000000007412717644140022437 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/move/detail/move_helpers.hpp0000664000372100037210000001543612717644140023277 0ustar00fransfrans00000000000000////////////////////////////////////////////////////////////////////////////// // // (C) Copyright Ion Gaztanaga 2010-2012. // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/move for documentation. // ////////////////////////////////////////////////////////////////////////////// #ifndef BOOST_MOVE_MOVE_HELPERS_HPP #define BOOST_MOVE_MOVE_HELPERS_HPP #include #include #include #include #if defined(BOOST_NO_CXX11_RVALUE_REFERENCES) || (defined(_MSC_VER) && (_MSC_VER == 1600)) #include #include #include #include #endif #if defined(BOOST_NO_CXX11_RVALUE_REFERENCES) #include #endif #if defined(BOOST_NO_CXX11_RVALUE_REFERENCES) struct not_a_type; struct not_a_type2; #define BOOST_MOVE_CATCH_CONST(U) \ typename ::boost::mpl::if_< ::boost::is_class, BOOST_CATCH_CONST_RLVALUE(U), const U &>::type #define BOOST_MOVE_CATCH_RVALUE(U)\ typename ::boost::mpl::if_< ::boost::is_class, BOOST_RV_REF(U), not_a_type>::type #define BOOST_MOVE_CATCH_FWD(U) BOOST_FWD_REF(U) #else #define BOOST_MOVE_CATCH_CONST(U) const U & #define BOOST_MOVE_CATCH_RVALUE(U) U && #define BOOST_MOVE_CATCH_FWD(U) U && #endif #ifdef BOOST_NO_CXX11_RVALUE_REFERENCES #define BOOST_MOVE_CONVERSION_AWARE_CATCH(PUB_FUNCTION, TYPE, RETURN_VALUE, FWD_FUNCTION)\ RETURN_VALUE PUB_FUNCTION(BOOST_MOVE_CATCH_CONST(TYPE) x)\ { return FWD_FUNCTION(static_cast(x)); }\ \ RETURN_VALUE PUB_FUNCTION(BOOST_MOVE_CATCH_RVALUE(TYPE) x) \ { return FWD_FUNCTION(::boost::move(x)); }\ \ RETURN_VALUE PUB_FUNCTION(TYPE &x)\ { return FWD_FUNCTION(const_cast(x)); }\ \ template\ typename ::boost::enable_if_c\ < ::boost::is_class::value &&\ ::boost::is_same::value &&\ !::boost::has_move_emulation_enabled::value\ , RETURN_VALUE >::type\ PUB_FUNCTION(const BOOST_MOVE_TEMPL_PARAM &u)\ { return FWD_FUNCTION(u); }\ \ template\ typename ::boost::enable_if_c\ < (!::boost::is_class::value || \ !::boost::move_detail::is_rv::value) && \ !::boost::is_same::value \ , RETURN_VALUE >::type\ PUB_FUNCTION(const BOOST_MOVE_TEMPL_PARAM &u)\ {\ TYPE t(u);\ return FWD_FUNCTION(::boost::move(t));\ }\ // // ::boost::is_convertible::value && #elif (defined(_MSC_VER) && (_MSC_VER == 1600)) #define BOOST_MOVE_CONVERSION_AWARE_CATCH(PUB_FUNCTION, TYPE, RETURN_VALUE, FWD_FUNCTION)\ RETURN_VALUE PUB_FUNCTION(BOOST_MOVE_CATCH_CONST(TYPE) x)\ { return FWD_FUNCTION(static_cast(x)); }\ \ RETURN_VALUE PUB_FUNCTION(BOOST_MOVE_CATCH_RVALUE(TYPE) x) \ { return FWD_FUNCTION(::boost::move(x)); }\ \ template\ typename ::boost::enable_if_c\ < !::boost::is_same::value\ , RETURN_VALUE >::type\ PUB_FUNCTION(const BOOST_MOVE_TEMPL_PARAM &u)\ {\ TYPE t(u);\ return FWD_FUNCTION(::boost::move(t));\ }\ // #else #define BOOST_MOVE_CONVERSION_AWARE_CATCH(PUB_FUNCTION, TYPE, RETURN_VALUE, FWD_FUNCTION)\ RETURN_VALUE PUB_FUNCTION(BOOST_MOVE_CATCH_CONST(TYPE) x)\ { return FWD_FUNCTION(static_cast(x)); }\ \ RETURN_VALUE PUB_FUNCTION(BOOST_MOVE_CATCH_RVALUE(TYPE) x) \ { return FWD_FUNCTION(::boost::move(x)); }\ // #endif #ifdef BOOST_NO_CXX11_RVALUE_REFERENCES #define BOOST_MOVE_CONVERSION_AWARE_CATCH_1ARG(PUB_FUNCTION, TYPE, RETURN_VALUE, FWD_FUNCTION, ARG1, UNLESS_CONVERTIBLE_TO)\ RETURN_VALUE PUB_FUNCTION(ARG1 arg1, BOOST_MOVE_CATCH_CONST(TYPE) x)\ { return FWD_FUNCTION(arg1, static_cast(x)); }\ \ RETURN_VALUE PUB_FUNCTION(ARG1 arg1, BOOST_MOVE_CATCH_RVALUE(TYPE) x) \ { return FWD_FUNCTION(arg1, ::boost::move(x)); }\ \ RETURN_VALUE PUB_FUNCTION(ARG1 arg1, TYPE &x)\ { return FWD_FUNCTION(arg1, const_cast(x)); }\ \ template\ typename ::boost::enable_if_c<\ ::boost::is_same::value &&\ !::boost::has_move_emulation_enabled::value\ , RETURN_VALUE >::type\ PUB_FUNCTION(ARG1 arg1, const BOOST_MOVE_TEMPL_PARAM &u)\ { return FWD_FUNCTION(arg1, u); }\ \ template\ typename ::boost::enable_if_c<\ !::boost::move_detail::is_rv::value && \ !::boost::is_same::value && \ !::boost::is_convertible::value \ , RETURN_VALUE >::type\ PUB_FUNCTION(ARG1 arg1, const BOOST_MOVE_TEMPL_PARAM &u)\ {\ TYPE t(u);\ return FWD_FUNCTION(arg1, ::boost::move(t));\ }\ // #elif (defined(_MSC_VER) && (_MSC_VER == 1600)) #define BOOST_MOVE_CONVERSION_AWARE_CATCH_1ARG(PUB_FUNCTION, TYPE, RETURN_VALUE, FWD_FUNCTION, ARG1, UNLESS_CONVERTIBLE_TO)\ RETURN_VALUE PUB_FUNCTION(ARG1 arg1, BOOST_MOVE_CATCH_CONST(TYPE) x)\ { return FWD_FUNCTION(arg1, static_cast(x)); }\ \ RETURN_VALUE PUB_FUNCTION(ARG1 arg1, BOOST_MOVE_CATCH_RVALUE(TYPE) x) \ { return FWD_FUNCTION(arg1, ::boost::move(x)); }\ \ template\ typename ::boost::enable_if_c\ < !::boost::is_same::value && \ !::boost::is_convertible::value \ , RETURN_VALUE >::type\ PUB_FUNCTION(ARG1 arg1, const BOOST_MOVE_TEMPL_PARAM &u)\ {\ TYPE t(u);\ return FWD_FUNCTION(arg1, ::boost::move(t));\ }\ // #else #define BOOST_MOVE_CONVERSION_AWARE_CATCH_1ARG(PUB_FUNCTION, TYPE, RETURN_VALUE, FWD_FUNCTION, ARG1, UNLESS_CONVERTIBLE_TO)\ RETURN_VALUE PUB_FUNCTION(ARG1 arg1, BOOST_MOVE_CATCH_CONST(TYPE) x)\ { return FWD_FUNCTION(arg1, static_cast(x)); }\ \ RETURN_VALUE PUB_FUNCTION(ARG1 arg1, BOOST_MOVE_CATCH_RVALUE(TYPE) x) \ { return FWD_FUNCTION(arg1, ::boost::move(x)); }\ // #endif #endif //#ifndef BOOST_MOVE_MOVE_HELPERS_HPP madp-0.4/src/boost/boost/move/detail/PaxHeaders.5405/meta_utils.hpp0000644000000000000000000000007412717644140022115 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/move/detail/meta_utils.hpp0000664000372100037210000000665412717644140022757 0ustar00fransfrans00000000000000////////////////////////////////////////////////////////////////////////////// // // (C) Copyright Ion Gaztanaga 2012-2012. // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/move for documentation. // ////////////////////////////////////////////////////////////////////////////// //! \file #ifndef BOOST_MOVE_DETAIL_META_UTILS_HPP #define BOOST_MOVE_DETAIL_META_UTILS_HPP #include //Small meta-typetraits to support move namespace boost { namespace move_detail { //if_ template struct if_c { typedef T1 type; }; template struct if_c { typedef T2 type; }; template struct if_ { typedef typename if_c<0 != T1::value, T2, T3>::type type; }; //enable_if_ template struct enable_if_c { typedef T type; }; template struct enable_if_c {}; template struct enable_if : public enable_if_c {}; template struct disable_if : public enable_if_c {}; //integral_constant template struct integral_constant { static const T value = v; typedef T value_type; typedef integral_constant type; }; //identity template struct identity { typedef T type; }; //is_convertible template class is_convertible { typedef char true_t; class false_t { char dummy[2]; }; static true_t dispatch(U); static false_t dispatch(...); static T &trigger(); public: enum { value = sizeof(dispatch(trigger())) == sizeof(true_t) }; }; //and_ not_ template > struct and_ : public integral_constant {}; template struct not_ : public integral_constant {}; //is_lvalue_reference template struct is_lvalue_reference : public integral_constant {}; template struct is_lvalue_reference : public integral_constant {}; template struct is_class_or_union { struct twochar { char _[2]; }; template static char is_class_or_union_tester(void(U::*)(void)); template static twochar is_class_or_union_tester(...); static const bool value = sizeof(is_class_or_union_tester(0)) == sizeof(char); }; struct empty{}; //addressof template struct addr_impl_ref { T & v_; inline addr_impl_ref( T & v ): v_( v ) {} inline operator T& () const { return v_; } private: addr_impl_ref & operator=(const addr_impl_ref &); }; template struct addressof_impl { static inline T * f( T & v, long ) { return reinterpret_cast( &const_cast(reinterpret_cast(v))); } static inline T * f( T * v, int ) { return v; } }; template inline T * addressof( T & v ) { return ::boost::move_detail::addressof_impl::f ( ::boost::move_detail::addr_impl_ref( v ), 0 ); } } //namespace move_detail { } //namespace boost { #include #endif //#ifndef BOOST_MOVE_DETAIL_META_UTILS_HPP madp-0.4/src/boost/boost/move/detail/PaxHeaders.5405/config_begin.hpp0000644000000000000000000000007412717644140022360 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/move/detail/config_begin.hpp0000664000372100037210000000151112717644140023205 0ustar00fransfrans00000000000000////////////////////////////////////////////////////////////////////////////// // // (C) Copyright Ion Gaztanaga 2012-2012. Distributed under the Boost // Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/move for documentation. // ////////////////////////////////////////////////////////////////////////////// #include #ifdef BOOST_MSVC #ifndef _CRT_SECURE_NO_DEPRECATE #define BOOST_MOVE_CRT_SECURE_NO_DEPRECATE #define _CRT_SECURE_NO_DEPRECATE #endif #ifndef _SCL_SECURE_NO_WARNINGS #define BOOST_MOVE_SCL_SECURE_NO_WARNINGS #define _SCL_SECURE_NO_WARNINGS #endif #pragma warning (push) #pragma warning (disable : 4996) // "function": was declared deprecated #endif madp-0.4/src/boost/boost/move/PaxHeaders.5405/core.hpp0000644000000000000000000000007412717644140017435 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/move/core.hpp0000664000372100037210000002430012717644140020263 0ustar00fransfrans00000000000000////////////////////////////////////////////////////////////////////////////// // // (C) Copyright Ion Gaztanaga 2012-2012. // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/move for documentation. // ////////////////////////////////////////////////////////////////////////////// //! \file core.hpp //! This header implements macros to define movable classes and //! move-aware functions #ifndef BOOST_MOVE_CORE_HPP #define BOOST_MOVE_CORE_HPP #include //boost_move_no_copy_constructor_or_assign typedef //used to detect noncopyable types for other Boost libraries. #ifdef BOOST_NO_CXX11_DELETED_FUNCTIONS #define BOOST_MOVE_IMPL_NO_COPY_CTOR_OR_ASSIGN(TYPE) \ private:\ TYPE(TYPE &);\ TYPE& operator=(TYPE &);\ public:\ typedef int boost_move_no_copy_constructor_or_assign; \ private:\ // #else #define BOOST_MOVE_IMPL_NO_COPY_CTOR_OR_ASSIGN(TYPE) \ public:\ TYPE(TYPE const &) = delete;\ TYPE& operator=(TYPE const &) = delete;\ public:\ typedef int boost_move_no_copy_constructor_or_assign; \ private:\ // #endif //BOOST_NO_CXX11_DELETED_FUNCTIONS #if defined(BOOST_NO_CXX11_RVALUE_REFERENCES) && !defined(BOOST_MOVE_DOXYGEN_INVOKED) #include //Move emulation rv breaks standard aliasing rules so add workarounds for some compilers #if defined(__GNUC__) && (__GNUC__ >= 4) #define BOOST_MOVE_ATTRIBUTE_MAY_ALIAS __attribute__((__may_alias__)) #else #define BOOST_MOVE_ATTRIBUTE_MAY_ALIAS #endif namespace boost { ////////////////////////////////////////////////////////////////////////////// // // struct rv // ////////////////////////////////////////////////////////////////////////////// template class rv : public ::boost::move_detail::if_c < ::boost::move_detail::is_class_or_union::value , T , ::boost::move_detail::empty >::type { rv(); ~rv(); rv(rv const&); void operator=(rv const&); } BOOST_MOVE_ATTRIBUTE_MAY_ALIAS; ////////////////////////////////////////////////////////////////////////////// // // move_detail::is_rv // ////////////////////////////////////////////////////////////////////////////// namespace move_detail { template struct is_rv : ::boost::move_detail::integral_constant {}; template struct is_rv< rv > : ::boost::move_detail::integral_constant {}; template struct is_rv< const rv > : ::boost::move_detail::integral_constant {}; } //namespace move_detail { ////////////////////////////////////////////////////////////////////////////// // // has_move_emulation_enabled // ////////////////////////////////////////////////////////////////////////////// template struct has_move_emulation_enabled : ::boost::move_detail::is_convertible< T, ::boost::rv& > {}; template struct has_move_emulation_enabled : ::boost::move_detail::integral_constant {}; template struct has_move_emulation_enabled< ::boost::rv > : ::boost::move_detail::integral_constant {}; } //namespace boost { #define BOOST_RV_REF(TYPE)\ ::boost::rv< TYPE >& \ // #define BOOST_RV_REF_2_TEMPL_ARGS(TYPE, ARG1, ARG2)\ ::boost::rv< TYPE >& \ // #define BOOST_RV_REF_3_TEMPL_ARGS(TYPE, ARG1, ARG2, ARG3)\ ::boost::rv< TYPE >& \ // #define BOOST_RV_REF_BEG\ ::boost::rv< \ // #define BOOST_RV_REF_END\ >& \ // #define BOOST_FWD_REF(TYPE)\ const TYPE & \ // #define BOOST_COPY_ASSIGN_REF(TYPE)\ const ::boost::rv< TYPE >& \ // #define BOOST_COPY_ASSIGN_REF_BEG \ const ::boost::rv< \ // #define BOOST_COPY_ASSIGN_REF_END \ >& \ // #define BOOST_COPY_ASSIGN_REF_2_TEMPL_ARGS(TYPE, ARG1, ARG2)\ const ::boost::rv< TYPE >& \ // #define BOOST_COPY_ASSIGN_REF_3_TEMPL_ARGS(TYPE, ARG1, ARG2, ARG3)\ const ::boost::rv< TYPE >& \ // #define BOOST_CATCH_CONST_RLVALUE(TYPE)\ const ::boost::rv< TYPE >& \ // ////////////////////////////////////////////////////////////////////////////// // // BOOST_MOVABLE_BUT_NOT_COPYABLE // ////////////////////////////////////////////////////////////////////////////// #define BOOST_MOVABLE_BUT_NOT_COPYABLE(TYPE)\ BOOST_MOVE_IMPL_NO_COPY_CTOR_OR_ASSIGN(TYPE)\ public:\ operator ::boost::rv&() \ { return *static_cast< ::boost::rv* >(this); }\ operator const ::boost::rv&() const \ { return *static_cast* >(this); }\ private:\ // ////////////////////////////////////////////////////////////////////////////// // // BOOST_COPYABLE_AND_MOVABLE // ////////////////////////////////////////////////////////////////////////////// #define BOOST_COPYABLE_AND_MOVABLE(TYPE)\ public:\ TYPE& operator=(TYPE &t)\ { this->operator=(static_cast &>(const_cast(t))); return *this;}\ public:\ operator ::boost::rv&() \ { return *static_cast< ::boost::rv* >(this); }\ operator const ::boost::rv&() const \ { return *static_cast* >(this); }\ private:\ // #define BOOST_COPYABLE_AND_MOVABLE_ALT(TYPE)\ public:\ operator ::boost::rv&() \ { return *static_cast< ::boost::rv* >(this); }\ operator const ::boost::rv&() const \ { return *static_cast* >(this); }\ private:\ // #else //BOOST_NO_CXX11_RVALUE_REFERENCES //Compiler workaround detection #if !defined(BOOST_MOVE_DOXYGEN_INVOKED) #if defined(__GNUC__) && (__GNUC__ == 4) && (__GNUC_MINOR__ < 5) && !defined(__clang__) //Pre-standard rvalue binding rules #define BOOST_MOVE_OLD_RVALUE_REF_BINDING_RULES #elif defined(_MSC_VER) && (_MSC_VER == 1600) //Standard rvalue binding rules but with some bugs #define BOOST_MOVE_MSVC_10_MEMBER_RVALUE_REF_BUG //Use standard library for MSVC to avoid namespace issues as //some move calls in the STL are not fully qualified. //#define BOOST_MOVE_USE_STANDARD_LIBRARY_MOVE #endif #endif //! This macro marks a type as movable but not copyable, disabling copy construction //! and assignment. The user will need to write a move constructor/assignment as explained //! in the documentation to fully write a movable but not copyable class. #define BOOST_MOVABLE_BUT_NOT_COPYABLE(TYPE)\ BOOST_MOVE_IMPL_NO_COPY_CTOR_OR_ASSIGN(TYPE)\ public:\ typedef int boost_move_emulation_t;\ // //! This macro marks a type as copyable and movable. //! The user will need to write a move constructor/assignment and a copy assignment //! as explained in the documentation to fully write a copyable and movable class. #define BOOST_COPYABLE_AND_MOVABLE(TYPE)\ // #if !defined(BOOST_MOVE_DOXYGEN_INVOKED) #define BOOST_COPYABLE_AND_MOVABLE_ALT(TYPE)\ // #endif //#if !defined(BOOST_MOVE_DOXYGEN_INVOKED) namespace boost { //!This trait yields to a compile-time true boolean if T was marked as //!BOOST_MOVABLE_BUT_NOT_COPYABLE or BOOST_COPYABLE_AND_MOVABLE and //!rvalue references are not available on the platform. False otherwise. template struct has_move_emulation_enabled { static const bool value = false; }; } //namespace boost{ //!This macro is used to achieve portable syntax in move //!constructors and assignments for classes marked as //!BOOST_COPYABLE_AND_MOVABLE or BOOST_MOVABLE_BUT_NOT_COPYABLE #define BOOST_RV_REF(TYPE)\ TYPE && \ // //!This macro is used to achieve portable syntax in move //!constructors and assignments for template classes marked as //!BOOST_COPYABLE_AND_MOVABLE or BOOST_MOVABLE_BUT_NOT_COPYABLE. //!As macros have problems with comma-separatd template arguments, //!the template argument must be preceded with BOOST_RV_REF_START //!and ended with BOOST_RV_REF_END #define BOOST_RV_REF_BEG\ \ // //!This macro is used to achieve portable syntax in move //!constructors and assignments for template classes marked as //!BOOST_COPYABLE_AND_MOVABLE or BOOST_MOVABLE_BUT_NOT_COPYABLE. //!As macros have problems with comma-separatd template arguments, //!the template argument must be preceded with BOOST_RV_REF_START //!and ended with BOOST_RV_REF_END #define BOOST_RV_REF_END\ && \ //!This macro is used to achieve portable syntax in copy //!assignment for classes marked as BOOST_COPYABLE_AND_MOVABLE. #define BOOST_COPY_ASSIGN_REF(TYPE)\ const TYPE & \ // //! This macro is used to implement portable perfect forwarding //! as explained in the documentation. #define BOOST_FWD_REF(TYPE)\ TYPE && \ // #if !defined(BOOST_MOVE_DOXYGEN_INVOKED) /// @cond #define BOOST_RV_REF_2_TEMPL_ARGS(TYPE, ARG1, ARG2)\ TYPE && \ // #define BOOST_RV_REF_3_TEMPL_ARGS(TYPE, ARG1, ARG2, ARG3)\ TYPE && \ // #define BOOST_COPY_ASSIGN_REF_BEG \ const \ // #define BOOST_COPY_ASSIGN_REF_END \ & \ // #define BOOST_COPY_ASSIGN_REF_2_TEMPL_ARGS(TYPE, ARG1, ARG2)\ const TYPE & \ // #define BOOST_COPY_ASSIGN_REF_3_TEMPL_ARGS(TYPE, ARG1, ARG2, ARG3)\ const TYPE& \ // #define BOOST_CATCH_CONST_RLVALUE(TYPE)\ const TYPE & \ // /// @endcond #endif //#if !defined(BOOST_MOVE_DOXYGEN_INVOKED) #endif //BOOST_NO_CXX11_RVALUE_REFERENCES #include #endif //#ifndef BOOST_MOVE_CORE_HPP madp-0.4/src/boost/boost/move/PaxHeaders.5405/algorithm.hpp0000644000000000000000000000007412717644140020473 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/move/algorithm.hpp0000664000372100037210000002032712717644140021326 0ustar00fransfrans00000000000000////////////////////////////////////////////////////////////////////////////// // // (C) Copyright Ion Gaztanaga 2012-2012. // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/move for documentation. // ////////////////////////////////////////////////////////////////////////////// //! \file #ifndef BOOST_MOVE_ALGORITHM_HPP #define BOOST_MOVE_ALGORITHM_HPP #include #include #include #include #include //copy, copy_backward #include //uninitialized_copy namespace boost { ////////////////////////////////////////////////////////////////////////////// // // move // ////////////////////////////////////////////////////////////////////////////// #if !defined(BOOST_MOVE_USE_STANDARD_LIBRARY_MOVE) //! Effects: Moves elements in the range [first,last) into the range [result,result + (last - //! first)) starting from first and proceeding to last. For each non-negative integer n < (last-first), //! performs *(result + n) = ::boost::move (*(first + n)). //! //! Effects: result + (last - first). //! //! Requires: result shall not be in the range [first,last). //! //! Complexity: Exactly last - first move assignments. template // O models OutputIterator O move(I f, I l, O result) { while (f != l) { *result = ::boost::move(*f); ++f; ++result; } return result; } ////////////////////////////////////////////////////////////////////////////// // // move_backward // ////////////////////////////////////////////////////////////////////////////// //! Effects: Moves elements in the range [first,last) into the range //! [result - (last-first),result) starting from last - 1 and proceeding to //! first. For each positive integer n <= (last - first), //! performs *(result - n) = ::boost::move(*(last - n)). //! //! Requires: result shall not be in the range [first,last). //! //! Returns: result - (last - first). //! //! Complexity: Exactly last - first assignments. template // O models BidirectionalIterator O move_backward(I f, I l, O result) { while (f != l) { --l; --result; *result = ::boost::move(*l); } return result; } #else using ::std::move_backward; #endif //!defined(BOOST_MOVE_USE_STANDARD_LIBRARY_MOVE) ////////////////////////////////////////////////////////////////////////////// // // uninitialized_move // ////////////////////////////////////////////////////////////////////////////// //! Effects: //! \code //! for (; first != last; ++result, ++first) //! new (static_cast(&*result)) //! typename iterator_traits::value_type(boost::move(*first)); //! \endcode //! //! Returns: result template // F models ForwardIterator F uninitialized_move(I f, I l, F r /// @cond // ,typename ::boost::move_detail::enable_if::value_type> >::type* = 0 /// @endcond ) { typedef typename std::iterator_traits::value_type input_value_type; F back = r; BOOST_TRY{ while (f != l) { void * const addr = static_cast(::boost::move_detail::addressof(*r)); ::new(addr) input_value_type(::boost::move(*f)); ++f; ++r; } } BOOST_CATCH(...){ for (; back != r; ++back){ back->~input_value_type(); } BOOST_RETHROW; } BOOST_CATCH_END return r; } /// @cond /* template // F models ForwardIterator F uninitialized_move(I f, I l, F r, typename ::boost::move_detail::disable_if::value_type> >::type* = 0) { return std::uninitialized_copy(f, l, r); } */ ////////////////////////////////////////////////////////////////////////////// // // uninitialized_copy_or_move // ////////////////////////////////////////////////////////////////////////////// namespace move_detail { template // F models ForwardIterator inline F uninitialized_move_move_iterator(I f, I l, F r // ,typename ::boost::move_detail::enable_if< has_move_emulation_enabled >::type* = 0 ) { return ::boost::uninitialized_move(f, l, r); } /* template // F models ForwardIterator F uninitialized_move_move_iterator(I f, I l, F r, typename ::boost::move_detail::disable_if< has_move_emulation_enabled >::type* = 0) { return std::uninitialized_copy(f.base(), l.base(), r); } */ } //namespace move_detail { template // F models ForwardIterator inline F uninitialized_copy_or_move(I f, I l, F r, typename ::boost::move_detail::enable_if< move_detail::is_move_iterator >::type* = 0) { return ::boost::move_detail::uninitialized_move_move_iterator(f, l, r); } ////////////////////////////////////////////////////////////////////////////// // // copy_or_move // ////////////////////////////////////////////////////////////////////////////// namespace move_detail { template // F models ForwardIterator inline F move_move_iterator(I f, I l, F r // ,typename ::boost::move_detail::enable_if< has_move_emulation_enabled >::type* = 0 ) { return ::boost::move(f, l, r); } /* template // F models ForwardIterator F move_move_iterator(I f, I l, F r, typename ::boost::move_detail::disable_if< has_move_emulation_enabled >::type* = 0) { return std::copy(f.base(), l.base(), r); } */ } //namespace move_detail { template // F models ForwardIterator inline F copy_or_move(I f, I l, F r, typename ::boost::move_detail::enable_if< move_detail::is_move_iterator >::type* = 0) { return ::boost::move_detail::move_move_iterator(f, l, r); } /// @endcond //! Effects: //! \code //! for (; first != last; ++result, ++first) //! new (static_cast(&*result)) //! typename iterator_traits::value_type(*first); //! \endcode //! //! Returns: result //! //! Note: This function is provided because //! std::uninitialized_copy from some STL implementations //! is not compatible with move_iterator template // F models ForwardIterator inline F uninitialized_copy_or_move(I f, I l, F r /// @cond ,typename ::boost::move_detail::disable_if< move_detail::is_move_iterator >::type* = 0 /// @endcond ) { return std::uninitialized_copy(f, l, r); } //! Effects: //! \code //! for (; first != last; ++result, ++first) //! *result = *first; //! \endcode //! //! Returns: result //! //! Note: This function is provided because //! std::uninitialized_copy from some STL implementations //! is not compatible with move_iterator template // F models ForwardIterator inline F copy_or_move(I f, I l, F r /// @cond ,typename ::boost::move_detail::disable_if< move_detail::is_move_iterator >::type* = 0 /// @endcond ) { return std::copy(f, l, r); } } //namespace boost { #include #endif //#ifndef BOOST_MOVE_MOVE_HPP madp-0.4/src/boost/boost/move/PaxHeaders.5405/utility.hpp0000644000000000000000000000007412717644140020210 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/move/utility.hpp0000664000372100037210000001552312717644140021045 0ustar00fransfrans00000000000000////////////////////////////////////////////////////////////////////////////// // // (C) Copyright Ion Gaztanaga 2012-2012. // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/move for documentation. // ////////////////////////////////////////////////////////////////////////////// //! \file #ifndef BOOST_MOVE_MOVE_UTILITY_HPP #define BOOST_MOVE_MOVE_UTILITY_HPP #include #include #include #if defined(BOOST_NO_CXX11_RVALUE_REFERENCES) && !defined(BOOST_MOVE_DOXYGEN_INVOKED) namespace boost { template struct enable_move_utility_emulation { static const bool value = true; }; ////////////////////////////////////////////////////////////////////////////// // // move() // ////////////////////////////////////////////////////////////////////////////// template inline typename ::boost::move_detail::enable_if_c < enable_move_utility_emulation::value && !has_move_emulation_enabled::value, T&>::type move(T& x) BOOST_NOEXCEPT { return x; } template inline typename ::boost::move_detail::enable_if_c < enable_move_utility_emulation::value && has_move_emulation_enabled::value, rv&>::type move(T& x) BOOST_NOEXCEPT { return *static_cast* >(::boost::move_detail::addressof(x)); } template inline typename ::boost::move_detail::enable_if_c < enable_move_utility_emulation::value && has_move_emulation_enabled::value, rv&>::type move(rv& x) BOOST_NOEXCEPT { return x; } ////////////////////////////////////////////////////////////////////////////// // // forward() // ////////////////////////////////////////////////////////////////////////////// template inline typename ::boost::move_detail::enable_if_c < enable_move_utility_emulation::value && ::boost::move_detail::is_rv::value, T &>::type forward(const typename ::boost::move_detail::identity::type &x) BOOST_NOEXCEPT { return const_cast(x); } template inline typename ::boost::move_detail::enable_if_c < enable_move_utility_emulation::value && !::boost::move_detail::is_rv::value, const T &>::type forward(const typename ::boost::move_detail::identity::type &x) BOOST_NOEXCEPT { return x; } } //namespace boost #else //#if defined(BOOST_NO_CXX11_RVALUE_REFERENCES) && !defined(BOOST_MOVE_DOXYGEN_INVOKED) #if defined(BOOST_MOVE_USE_STANDARD_LIBRARY_MOVE) #include namespace boost{ using ::std::move; using ::std::forward; } //namespace boost #else //!BOOST_MOVE_USE_STANDARD_LIBRARY_MOVE #include namespace boost { //! This trait's internal boolean `value` is false in compilers with rvalue references //! and true in compilers without rvalue references. //! //! A user can specialize this trait for a type T to false to SFINAE out `move` and `forward` //! so that the user can define a different move emulation for that type in namespace boost //! (e.g. another Boost library for its types) and avoid any overload ambiguity. template struct enable_move_utility_emulation { static const bool value = false; }; ////////////////////////////////////////////////////////////////////////////// // // move // ////////////////////////////////////////////////////////////////////////////// #if defined(BOOST_MOVE_DOXYGEN_INVOKED) //! This function provides a way to convert a reference into a rvalue reference //! in compilers with rvalue references. For other compilers converts T & into //! ::boost::rv & so that move emulation is activated. template rvalue_reference move(input_reference) noexcept; #elif defined(BOOST_MOVE_OLD_RVALUE_REF_BINDING_RULES) //Old move approach, lvalues could bind to rvalue references template inline typename remove_reference::type && move(T&& t) BOOST_NOEXCEPT { return t; } #else //BOOST_MOVE_OLD_RVALUE_REF_BINDING_RULES template inline typename remove_reference::type && move(T&& t) BOOST_NOEXCEPT { return static_cast::type &&>(t); } #endif //BOOST_MOVE_OLD_RVALUE_REF_BINDING_RULES ////////////////////////////////////////////////////////////////////////////// // // forward // ////////////////////////////////////////////////////////////////////////////// #if defined(BOOST_MOVE_DOXYGEN_INVOKED) //! This function provides limited form of forwarding that is usually enough for //! in-place construction and avoids the exponential overloading for //! achieve the limited forwarding in C++03. //! //! For compilers with rvalue references this function provides perfect forwarding. //! //! Otherwise: //! * If input_reference binds to const ::boost::rv & then it output_reference is //! ::boost::rv & //! //! * Else, output_reference is equal to input_reference. template output_reference forward(input_reference) noexcept; #elif defined(BOOST_MOVE_OLD_RVALUE_REF_BINDING_RULES) //Old move approach, lvalues could bind to rvalue references template inline T&& forward(typename ::boost::move_detail::identity::type&& t) BOOST_NOEXCEPT { return t; } #else //Old move //Implementation #5 from N2951, thanks to Howard Hinnant template inline T&& forward(U&& t , typename ::boost::move_detail::enable_if_c< move_detail::is_lvalue_reference::value ? move_detail::is_lvalue_reference::value : true>::type * = 0/* , typename ::boost::move_detail::enable_if_c< move_detail::is_convertible ::type*, typename remove_reference::type*>::value>::type * = 0*/) BOOST_NOEXCEPT { return static_cast(t); } #endif //BOOST_MOVE_DOXYGEN_INVOKED } //namespace boost { #endif //#if defined(BOOST_MOVE_USE_STANDARD_LIBRARY_MOVE) #endif //BOOST_NO_CXX11_RVALUE_REFERENCES #include #endif //#ifndef BOOST_MOVE_MOVE_UTILITY_HPP madp-0.4/src/boost/boost/move/PaxHeaders.5405/move.hpp0000644000000000000000000000007412717644140017453 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/move/move.hpp0000664000372100037210000000160112717644140020300 0ustar00fransfrans00000000000000////////////////////////////////////////////////////////////////////////////// // // (C) Copyright David Abrahams, Vicente Botet 2009. // (C) Copyright Ion Gaztanaga 2009-2012. // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/move for documentation. // ////////////////////////////////////////////////////////////////////////////// //! \file move.hpp //! A general library header that includes //! the rest of top-level headers. #ifndef BOOST_MOVE_MOVE_HPP #define BOOST_MOVE_MOVE_HPP #include #include #include #include #include #include #endif //#ifndef BOOST_MOVE_MOVE_HPP madp-0.4/src/boost/boost/move/PaxHeaders.5405/iterator.hpp0000644000000000000000000000007412717644140020336 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/move/iterator.hpp0000664000372100037210000002244412717644140021173 0ustar00fransfrans00000000000000////////////////////////////////////////////////////////////////////////////// // // (C) Copyright Ion Gaztanaga 2012-2012. // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/move for documentation. // ////////////////////////////////////////////////////////////////////////////// //! \file #ifndef BOOST_MOVE_ITERATOR_HPP #define BOOST_MOVE_ITERATOR_HPP #include #include #include //std::iterator namespace boost { ////////////////////////////////////////////////////////////////////////////// // // move_iterator // ////////////////////////////////////////////////////////////////////////////// //! Class template move_iterator is an iterator adaptor with the same behavior //! as the underlying iterator except that its dereference operator implicitly //! converts the value returned by the underlying iterator's dereference operator //! to an rvalue reference. Some generic algorithms can be called with move //! iterators to replace copying with moving. template class move_iterator { public: typedef It iterator_type; typedef typename std::iterator_traits::value_type value_type; #if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES) || defined(BOOST_MOVE_DOXYGEN_INVOKED) typedef value_type && reference; #else typedef typename ::boost::move_detail::if_ < ::boost::has_move_emulation_enabled , ::boost::rv& , value_type & >::type reference; #endif typedef It pointer; typedef typename std::iterator_traits::difference_type difference_type; typedef typename std::iterator_traits::iterator_category iterator_category; move_iterator() {} explicit move_iterator(It i) : m_it(i) {} template move_iterator(const move_iterator& u) : m_it(u.base()) {} iterator_type base() const { return m_it; } reference operator*() const { #if defined(BOOST_NO_CXX11_RVALUE_REFERENCES) || defined(BOOST_MOVE_OLD_RVALUE_REF_BINDING_RULES) return *m_it; #else return ::boost::move(*m_it); #endif } pointer operator->() const { return m_it; } move_iterator& operator++() { ++m_it; return *this; } move_iterator operator++(int) { move_iterator tmp(*this); ++(*this); return tmp; } move_iterator& operator--() { --m_it; return *this; } move_iterator operator--(int) { move_iterator tmp(*this); --(*this); return tmp; } move_iterator operator+ (difference_type n) const { return move_iterator(m_it + n); } move_iterator& operator+=(difference_type n) { m_it += n; return *this; } move_iterator operator- (difference_type n) const { return move_iterator(m_it - n); } move_iterator& operator-=(difference_type n) { m_it -= n; return *this; } reference operator[](difference_type n) const { #if defined(BOOST_NO_CXX11_RVALUE_REFERENCES) || defined(BOOST_MOVE_OLD_RVALUE_REF_BINDING_RULES) return m_it[n]; #else return ::boost::move(m_it[n]); #endif } friend bool operator==(const move_iterator& x, const move_iterator& y) { return x.base() == y.base(); } friend bool operator!=(const move_iterator& x, const move_iterator& y) { return x.base() != y.base(); } friend bool operator< (const move_iterator& x, const move_iterator& y) { return x.base() < y.base(); } friend bool operator<=(const move_iterator& x, const move_iterator& y) { return x.base() <= y.base(); } friend bool operator> (const move_iterator& x, const move_iterator& y) { return x.base() > y.base(); } friend bool operator>=(const move_iterator& x, const move_iterator& y) { return x.base() >= y.base(); } friend difference_type operator-(const move_iterator& x, const move_iterator& y) { return x.base() - y.base(); } friend move_iterator operator+(difference_type n, const move_iterator& x) { return move_iterator(x.base() + n); } private: It m_it; }; //is_move_iterator namespace move_detail { template struct is_move_iterator : public ::boost::move_detail::integral_constant { }; template struct is_move_iterator< ::boost::move_iterator > : public ::boost::move_detail::integral_constant { }; } //namespace move_detail { ////////////////////////////////////////////////////////////////////////////// // // move_iterator // ////////////////////////////////////////////////////////////////////////////// //! //! Returns: move_iterator(i). template inline move_iterator make_move_iterator(const It &it) { return move_iterator(it); } ////////////////////////////////////////////////////////////////////////////// // // back_move_insert_iterator // ////////////////////////////////////////////////////////////////////////////// //! A move insert iterator that move constructs elements at the //! back of a container template // C models Container class back_move_insert_iterator : public std::iterator { C* container_m; public: typedef C container_type; typedef typename C::value_type value_type; typedef typename C::reference reference; explicit back_move_insert_iterator(C& x) : container_m(&x) { } back_move_insert_iterator& operator=(reference x) { container_m->push_back(boost::move(x)); return *this; } back_move_insert_iterator& operator=(BOOST_RV_REF(value_type) x) { reference rx = x; return this->operator=(rx); } back_move_insert_iterator& operator*() { return *this; } back_move_insert_iterator& operator++() { return *this; } back_move_insert_iterator& operator++(int) { return *this; } }; //! //! Returns: back_move_insert_iterator(x). template // C models Container inline back_move_insert_iterator back_move_inserter(C& x) { return back_move_insert_iterator(x); } ////////////////////////////////////////////////////////////////////////////// // // front_move_insert_iterator // ////////////////////////////////////////////////////////////////////////////// //! A move insert iterator that move constructs elements int the //! front of a container template // C models Container class front_move_insert_iterator : public std::iterator { C* container_m; public: typedef C container_type; typedef typename C::value_type value_type; typedef typename C::reference reference; explicit front_move_insert_iterator(C& x) : container_m(&x) { } front_move_insert_iterator& operator=(reference x) { container_m->push_front(boost::move(x)); return *this; } front_move_insert_iterator& operator=(BOOST_RV_REF(value_type) x) { reference rx = x; return this->operator=(rx); } front_move_insert_iterator& operator*() { return *this; } front_move_insert_iterator& operator++() { return *this; } front_move_insert_iterator& operator++(int) { return *this; } }; //! //! Returns: front_move_insert_iterator(x). template // C models Container inline front_move_insert_iterator front_move_inserter(C& x) { return front_move_insert_iterator(x); } ////////////////////////////////////////////////////////////////////////////// // // insert_move_iterator // ////////////////////////////////////////////////////////////////////////////// template // C models Container class move_insert_iterator : public std::iterator { C* container_m; typename C::iterator pos_; public: typedef C container_type; typedef typename C::value_type value_type; typedef typename C::reference reference; explicit move_insert_iterator(C& x, typename C::iterator pos) : container_m(&x), pos_(pos) {} move_insert_iterator& operator=(reference x) { pos_ = container_m->insert(pos_, ::boost::move(x)); ++pos_; return *this; } move_insert_iterator& operator=(BOOST_RV_REF(value_type) x) { reference rx = x; return this->operator=(rx); } move_insert_iterator& operator*() { return *this; } move_insert_iterator& operator++() { return *this; } move_insert_iterator& operator++(int) { return *this; } }; //! //! Returns: move_insert_iterator(x, it). template // C models Container inline move_insert_iterator move_inserter(C& x, typename C::iterator it) { return move_insert_iterator(x, it); } } //namespace boost { #include #endif //#ifndef BOOST_MOVE_ITERATOR_HPP madp-0.4/src/boost/boost/PaxHeaders.5405/type_traits.hpp0000644000000000000000000000007412717644140020106 xustar0030 atime=1463765180.177719552 30 ctime=1463765201.173551863 madp-0.4/src/boost/boost/type_traits.hpp0000664000372100037210000001072112717644140020736 0ustar00fransfrans00000000000000// (C) Copyright John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/type_traits for most recent version including documentation. // See boost/type_traits/*.hpp for full copyright notices. #ifndef BOOST_TYPE_TRAITS_HPP #define BOOST_TYPE_TRAITS_HPP #include "boost/type_traits/add_const.hpp" #include "boost/type_traits/add_cv.hpp" #include "boost/type_traits/add_lvalue_reference.hpp" #include "boost/type_traits/add_pointer.hpp" #include "boost/type_traits/add_reference.hpp" #include "boost/type_traits/add_rvalue_reference.hpp" #include "boost/type_traits/add_volatile.hpp" #include "boost/type_traits/aligned_storage.hpp" #include "boost/type_traits/alignment_of.hpp" #include "boost/type_traits/common_type.hpp" #include "boost/type_traits/conditional.hpp" #include "boost/type_traits/decay.hpp" #include "boost/type_traits/extent.hpp" #include "boost/type_traits/floating_point_promotion.hpp" #include "boost/type_traits/function_traits.hpp" #if !defined(__BORLANDC__) && !defined(__CUDACC__) #include "boost/type_traits/has_new_operator.hpp" #endif #include "boost/type_traits/has_nothrow_assign.hpp" #include "boost/type_traits/has_nothrow_constructor.hpp" #include "boost/type_traits/has_nothrow_copy.hpp" #include "boost/type_traits/has_nothrow_destructor.hpp" #include #include "boost/type_traits/has_trivial_assign.hpp" #include "boost/type_traits/has_trivial_constructor.hpp" #include "boost/type_traits/has_trivial_copy.hpp" #include "boost/type_traits/has_trivial_destructor.hpp" #include "boost/type_traits/has_trivial_move_assign.hpp" #include "boost/type_traits/has_trivial_move_constructor.hpp" #include "boost/type_traits/has_virtual_destructor.hpp" #include "boost/type_traits/is_abstract.hpp" #include "boost/type_traits/is_arithmetic.hpp" #include "boost/type_traits/is_array.hpp" #include "boost/type_traits/is_base_and_derived.hpp" #include "boost/type_traits/is_base_of.hpp" #include "boost/type_traits/is_class.hpp" #include #include "boost/type_traits/is_compound.hpp" #include "boost/type_traits/is_const.hpp" #include "boost/type_traits/is_convertible.hpp" #include "boost/type_traits/is_copy_constructible.hpp" #include "boost/type_traits/is_empty.hpp" #include "boost/type_traits/is_enum.hpp" #include "boost/type_traits/is_float.hpp" #include "boost/type_traits/is_floating_point.hpp" #include "boost/type_traits/is_function.hpp" #include "boost/type_traits/is_fundamental.hpp" #include "boost/type_traits/is_integral.hpp" #include "boost/type_traits/is_lvalue_reference.hpp" #include "boost/type_traits/is_member_function_pointer.hpp" #include "boost/type_traits/is_member_object_pointer.hpp" #include "boost/type_traits/is_member_pointer.hpp" #include "boost/type_traits/is_nothrow_move_assignable.hpp" #include "boost/type_traits/is_nothrow_move_constructible.hpp" #include "boost/type_traits/is_object.hpp" #include "boost/type_traits/is_pod.hpp" #include "boost/type_traits/is_polymorphic.hpp" #include "boost/type_traits/is_pointer.hpp" #include "boost/type_traits/is_reference.hpp" #include "boost/type_traits/is_rvalue_reference.hpp" #include "boost/type_traits/is_signed.hpp" #include "boost/type_traits/is_same.hpp" #include "boost/type_traits/is_scalar.hpp" #include "boost/type_traits/is_stateless.hpp" #include "boost/type_traits/is_union.hpp" #include "boost/type_traits/is_unsigned.hpp" #include "boost/type_traits/is_void.hpp" #include "boost/type_traits/is_virtual_base_of.hpp" #include "boost/type_traits/is_volatile.hpp" #include #include #include "boost/type_traits/rank.hpp" #include "boost/type_traits/remove_bounds.hpp" #include "boost/type_traits/remove_extent.hpp" #include "boost/type_traits/remove_all_extents.hpp" #include "boost/type_traits/remove_const.hpp" #include "boost/type_traits/remove_cv.hpp" #include "boost/type_traits/remove_pointer.hpp" #include "boost/type_traits/remove_reference.hpp" #include "boost/type_traits/remove_volatile.hpp" #include "boost/type_traits/type_with_alignment.hpp" #if !(defined(__sgi) && defined(__EDG_VERSION__) && (__EDG_VERSION__ == 238)) #include "boost/type_traits/integral_promotion.hpp" #include "boost/type_traits/promote.hpp" #endif #include "boost/type_traits/ice.hpp" #endif // BOOST_TYPE_TRAITS_HPP madp-0.4/src/boost/boost/PaxHeaders.5405/checked_delete.hpp0000644000000000000000000000007312717644140020446 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.041552917 madp-0.4/src/boost/boost/checked_delete.hpp0000664000372100037210000000306512717644140021302 0ustar00fransfrans00000000000000#ifndef BOOST_CHECKED_DELETE_HPP_INCLUDED #define BOOST_CHECKED_DELETE_HPP_INCLUDED // MS compatible compilers support #pragma once #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once #endif // // boost/checked_delete.hpp // // Copyright (c) 2002, 2003 Peter Dimov // Copyright (c) 2003 Daniel Frey // Copyright (c) 2003 Howard Hinnant // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/utility/checked_delete.html for documentation. // namespace boost { // verify that types are complete for increased safety template inline void checked_delete(T * x) { // intentionally complex - simplification causes regressions typedef char type_must_be_complete[ sizeof(T)? 1: -1 ]; (void) sizeof(type_must_be_complete); delete x; } template inline void checked_array_delete(T * x) { typedef char type_must_be_complete[ sizeof(T)? 1: -1 ]; (void) sizeof(type_must_be_complete); delete [] x; } template struct checked_deleter { typedef void result_type; typedef T * argument_type; void operator()(T * x) const { // boost:: disables ADL boost::checked_delete(x); } }; template struct checked_array_deleter { typedef void result_type; typedef T * argument_type; void operator()(T * x) const { boost::checked_array_delete(x); } }; } // namespace boost #endif // #ifndef BOOST_CHECKED_DELETE_HPP_INCLUDED madp-0.4/src/boost/boost/PaxHeaders.5405/smart_ptr.hpp0000644000000000000000000000007412717644140017552 xustar0030 atime=1463765180.165719647 30 ctime=1463765201.157551989 madp-0.4/src/boost/boost/smart_ptr.hpp0000664000372100037210000000157412717644140020410 0ustar00fransfrans00000000000000#ifndef BOOST_SMART_PTR_HPP_INCLUDED #define BOOST_SMART_PTR_HPP_INCLUDED // // smart_ptr.hpp // // For convenience, this header includes the rest of the smart // pointer library headers. // // Copyright (c) 2003 Peter Dimov Distributed under the Boost // Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // // http://www.boost.org/libs/smart_ptr/smart_ptr.htm // #include #include #include #include #include #if !defined(BOOST_NO_MEMBER_TEMPLATES) || defined(BOOST_MSVC6_MEMBER_TEMPLATES) # include # include # include # include #endif #endif // #ifndef BOOST_SMART_PTR_HPP_INCLUDED madp-0.4/src/boost/boost/PaxHeaders.5405/pending0000644000000000000000000000007412717644140016375 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.109552373 madp-0.4/src/boost/boost/pending/0000775000372100037210000000000012717644140017301 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/pending/PaxHeaders.5405/cstddef.hpp0000644000000000000000000000007412717644140020577 xustar0030 atime=1463765180.137719871 30 ctime=1463765201.109552373 madp-0.4/src/boost/boost/pending/cstddef.hpp0000664000372100037210000000060212717644140021424 0ustar00fransfrans00000000000000// -*- C++ -*- forwarding header. // (C) Copyright Jeremy Siek 2004 // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_CSTDDEF_HPP #define BOOST_CSTDDEF_HPP #if defined(__sgi) && !defined(__GNUC__) # include #else # include #endif #endif madp-0.4/src/boost/boost/pending/PaxHeaders.5405/indirect_cmp.hpp0000644000000000000000000000007412717644140021623 xustar0030 atime=1463765180.137719871 30 ctime=1463765201.109552373 madp-0.4/src/boost/boost/pending/indirect_cmp.hpp0000664000372100037210000000476612717644140022467 0ustar00fransfrans00000000000000// //======================================================================= // Copyright 1997, 1998, 1999, 2000 University of Notre Dame. // Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) //======================================================================= // #ifndef BOOST_INDIRECT_CMP_HPP #define BOOST_INDIRECT_CMP_HPP #include #include #include namespace boost { //: indirect_cmp // // could also do this with compose_f_gx_hx, and the member binder... // //!category: functors //!component: type //!tparam: ReadablePropertyMap - a model of ReadablePropertyMap //!definition: functor.h template class indirect_cmp { public: typedef typename boost::property_traits::value_type T; typedef typename boost::property_traits::key_type K; typedef K first_argument_type; typedef K second_argument_type; typedef bool result_type; inline indirect_cmp(const ReadablePropertyMap& df, const Compare& c = Compare()) : d(df), cmp(c) { } template inline bool operator()(const A& u, const B& v) const { const T& du = get(d, u); const T& dv = get(d, v); return cmp(du, dv); } protected: ReadablePropertyMap d; Compare cmp; }; template indirect_cmp make_indirect_cmp(const Compare& cmp, ReadablePropertyMap pmap) { indirect_cmp p(pmap, cmp); return p; } template class indirect_pmap { public: typedef typename boost::property_traits::value_type T; typedef typename boost::property_traits::key_type K; typedef K argument_type; typedef T result_type; inline indirect_pmap(const ReadablePropertyMap& df) : d(df) { } inline T operator()(const K& u) const { return get(d, u); } protected: ReadablePropertyMap d; }; template indirect_pmap make_indirect_pmap(ReadablePropertyMap pmap) { indirect_pmap f(pmap); return f; } } // namespace boost #endif // GGCL_INDIRECT_CMP_HPP madp-0.4/src/boost/boost/pending/PaxHeaders.5405/relaxed_heap.hpp0000644000000000000000000000007412717644140021604 xustar0030 atime=1463765180.137719871 30 ctime=1463765201.109552373 madp-0.4/src/boost/boost/pending/relaxed_heap.hpp0000664000372100037210000004132612717644140022441 0ustar00fransfrans00000000000000// Copyright 2004 The Trustees of Indiana University. // Use, modification and distribution is subject to the Boost Software // License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // Authors: Douglas Gregor // Andrew Lumsdaine #ifndef BOOST_RELAXED_HEAP_HEADER #define BOOST_RELAXED_HEAP_HEADER #include #include #include #include #include // for CHAR_BIT #include #ifdef BOOST_RELAXED_HEAP_DEBUG # include #endif // BOOST_RELAXED_HEAP_DEBUG #if defined(BOOST_MSVC) # pragma warning(push) # pragma warning(disable:4355) // complaint about using 'this' to #endif // initialize a member namespace boost { template, typename ID = identity_property_map> class relaxed_heap { struct group; typedef relaxed_heap self_type; typedef std::size_t rank_type; public: typedef IndexedType value_type; typedef rank_type size_type; private: /** * The kind of key that a group has. The actual values are discussed * in-depth in the documentation of the @c kind field of the @c group * structure. Note that the order of the enumerators *IS* important * and must not be changed. */ enum group_key_kind { smallest_key, stored_key, largest_key }; struct group { explicit group(group_key_kind kind = largest_key) : kind(kind), parent(this), rank(0) { } /** The value associated with this group. This value is only valid * when @c kind!=largest_key (which indicates a deleted * element). Note that the use of boost::optional increases the * memory requirements slightly but does not result in extraneous * memory allocations or deallocations. The optional could be * eliminated when @c value_type is a model of * DefaultConstructible. */ ::boost::optional value; /** * The kind of key stored at this group. This may be @c * smallest_key, which indicates that the key is infinitely small; * @c largest_key, which indicates that the key is infinitely * large; or @c stored_key, which means that the key is unknown, * but its relationship to other keys can be determined via the * comparison function object. */ group_key_kind kind; /// The parent of this group. Will only be NULL for the dummy root group group* parent; /// The rank of this group. Equivalent to the number of children in /// the group. rank_type rank; /** The children of this group. For the dummy root group, these are * the roots. This is an array of length log n containing pointers * to the child groups. */ group** children; }; size_type log_base_2(size_type n) // log2 is a macro on some platforms { size_type leading_zeroes = 0; do { size_type next = n << 1; if (n == (next >> 1)) { ++leading_zeroes; n = next; } else { break; } } while (true); return sizeof(size_type) * CHAR_BIT - leading_zeroes - 1; } public: relaxed_heap(size_type n, const Compare& compare = Compare(), const ID& id = ID()) : compare(compare), id(id), root(smallest_key), groups(n), smallest_value(0) { if (n == 0) { root.children = new group*[1]; return; } log_n = log_base_2(n); if (log_n == 0) log_n = 1; size_type g = n / log_n; if (n % log_n > 0) ++g; size_type log_g = log_base_2(g); size_type r = log_g; // Reserve an appropriate amount of space for data structures, so // that we do not need to expand them. index_to_group.resize(g); A.resize(r + 1, 0); root.rank = r + 1; root.children = new group*[(log_g + 1) * (g + 1)]; for (rank_type i = 0; i < r+1; ++i) root.children[i] = 0; // Build initial heap size_type idx = 0; while (idx < g) { root.children[r] = &index_to_group[idx]; idx = build_tree(root, idx, r, log_g + 1); if (idx != g) r = static_cast(log_base_2(g-idx)); } } ~relaxed_heap() { delete [] root.children; } void push(const value_type& x) { groups[get(id, x)] = x; update(x); } void update(const value_type& x) { group* a = &index_to_group[get(id, x) / log_n]; if (!a->value || *a->value == x || compare(x, *a->value)) { if (a != smallest_value) smallest_value = 0; a->kind = stored_key; a->value = x; promote(a); } } void remove(const value_type& x) { group* a = &index_to_group[get(id, x) / log_n]; assert(groups[get(id, x)] != 0); a->value = x; a->kind = smallest_key; promote(a); smallest_value = a; pop(); } value_type& top() { find_smallest(); assert(smallest_value->value != none); return *smallest_value->value; } const value_type& top() const { find_smallest(); assert(smallest_value->value != none); return *smallest_value->value; } bool empty() const { find_smallest(); return !smallest_value || (smallest_value->kind == largest_key); } bool contains(const value_type& x) const { return groups[get(id, x)]; } void pop() { // Fill in smallest_value. This is the group x. find_smallest(); group* x = smallest_value; smallest_value = 0; // Make x a leaf, giving it the smallest value within its group rank_type r = x->rank; group* p = x->parent; { assert(x->value != none); // Find x's group size_type start = get(id, *x->value) - get(id, *x->value) % log_n; size_type end = start + log_n; if (end > groups.size()) end = groups.size(); // Remove the smallest value from the group, and find the new // smallest value. groups[get(id, *x->value)].reset(); x->value.reset(); x->kind = largest_key; for (size_type i = start; i < end; ++i) { if (groups[i] && (!x->value || compare(*groups[i], *x->value))) { x->kind = stored_key; x->value = groups[i]; } } } x->rank = 0; // Combine prior children of x with x group* y = x; for (size_type c = 0; c < r; ++c) { group* child = x->children[c]; if (A[c] == child) A[c] = 0; y = combine(y, child); } // If we got back something other than x, let y take x's place if (y != x) { y->parent = p; p->children[r] = y; assert(r == y->rank); if (A[y->rank] == x) A[y->rank] = do_compare(y, p)? y : 0; } } #ifdef BOOST_RELAXED_HEAP_DEBUG /************************************************************************* * Debugging support * *************************************************************************/ void dump_tree() { dump_tree(std::cout); } void dump_tree(std::ostream& out) { dump_tree(out, &root); } void dump_tree(std::ostream& out, group* p, bool in_progress = false) { if (!in_progress) { out << "digraph heap {\n" << " edge[dir=\"back\"];\n"; } size_type p_index = 0; if (p != &root) while (&index_to_group[p_index] != p) ++p_index; for (size_type i = 0; i < p->rank; ++i) { group* c = p->children[i]; if (c) { size_type c_index = 0; if (c != &root) while (&index_to_group[c_index] != c) ++c_index; out << " "; if (p == &root) out << 'p'; else out << p_index; out << " -> "; if (c == &root) out << 'p'; else out << c_index; if (A[c->rank] == c) out << " [style=\"dotted\"]"; out << ";\n"; dump_tree(out, c, true); // Emit node information out << " "; if (c == &root) out << 'p'; else out << c_index; out << " [label=\""; if (c == &root) out << 'p'; else out << c_index; out << ":"; size_type start = c_index * log_n; size_type end = start + log_n; if (end > groups.size()) end = groups.size(); while (start != end) { if (groups[start]) { out << " " << get(id, *groups[start]); if (*groups[start] == *c->value) out << "(*)"; } ++start; } out << '"'; if (do_compare(c, p)) { out << " "; if (c == &root) out << 'p'; else out << c_index; out << ", style=\"filled\", fillcolor=\"gray\""; } out << "];\n"; } else { assert(p->parent == p); } } if (!in_progress) out << "}\n"; } bool valid() { // Check that the ranks in the A array match the ranks of the // groups stored there. Also, the active groups must be the last // child of their parent. for (size_type r = 0; r < A.size(); ++r) { if (A[r] && A[r]->rank != r) return false; if (A[r] && A[r]->parent->children[A[r]->parent->rank-1] != A[r]) return false; } // The root must have no value and a key of -Infinity if (root.kind != smallest_key) return false; return valid(&root); } bool valid(group* p) { for (size_type i = 0; i < p->rank; ++i) { group* c = p->children[i]; if (c) { // Check link structure if (c->parent != p) return false; if (c->rank != i) return false; // A bad group must be active if (do_compare(c, p) && A[i] != c) return false; // Check recursively if (!valid(c)) return false; } else { // Only the root may if (p != &root) return false; } } return true; } #endif // BOOST_RELAXED_HEAP_DEBUG private: size_type build_tree(group& parent, size_type idx, size_type r, size_type max_rank) { group& this_group = index_to_group[idx]; this_group.parent = &parent; ++idx; this_group.children = root.children + (idx * max_rank); this_group.rank = r; for (size_type i = 0; i < r; ++i) { this_group.children[i] = &index_to_group[idx]; idx = build_tree(this_group, idx, i, max_rank); } return idx; } void find_smallest() const { group** roots = root.children; if (!smallest_value) { std::size_t i; for (i = 0; i < root.rank; ++i) { if (roots[i] && (!smallest_value || do_compare(roots[i], smallest_value))) { smallest_value = roots[i]; } } for (i = 0; i < A.size(); ++i) { if (A[i] && (!smallest_value || do_compare(A[i], smallest_value))) smallest_value = A[i]; } } } bool do_compare(group* x, group* y) const { return (x->kind < y->kind || (x->kind == y->kind && x->kind == stored_key && compare(*x->value, *y->value))); } void promote(group* a) { assert(a != 0); rank_type r = a->rank; group* p = a->parent; assert(p != 0); if (do_compare(a, p)) { // s is the rank + 1 sibling group* s = p->rank > r + 1? p->children[r + 1] : 0; // If a is the last child of p if (r == p->rank - 1) { if (!A[r]) A[r] = a; else if (A[r] != a) pair_transform(a); } else { assert(s != 0); if (A[r + 1] == s) active_sibling_transform(a, s); else good_sibling_transform(a, s); } } } group* combine(group* a1, group* a2) { assert(a1->rank == a2->rank); if (do_compare(a2, a1)) do_swap(a1, a2); a1->children[a1->rank++] = a2; a2->parent = a1; clean(a1); return a1; } void clean(group* q) { if (2 > q->rank) return; group* qp = q->children[q->rank-1]; rank_type s = q->rank - 2; group* x = q->children[s]; group* xp = qp->children[s]; assert(s == x->rank); // If x is active, swap x and xp if (A[s] == x) { q->children[s] = xp; xp->parent = q; qp->children[s] = x; x->parent = qp; } } void pair_transform(group* a) { #if defined(BOOST_RELAXED_HEAP_DEBUG) && BOOST_RELAXED_HEAP_DEBUG > 1 std::cerr << "- pair transform\n"; #endif rank_type r = a->rank; // p is a's parent group* p = a->parent; assert(p != 0); // g is p's parent (a's grandparent) group* g = p->parent; assert(g != 0); // a' <- A(r) assert(A[r] != 0); group* ap = A[r]; assert(ap != 0); // A(r) <- nil A[r] = 0; // let a' have parent p' group* pp = ap->parent; assert(pp != 0); // let a' have grandparent g' group* gp = pp->parent; assert(gp != 0); // Remove a and a' from their parents assert(ap == pp->children[pp->rank-1]); // Guaranteed because ap is active --pp->rank; // Guaranteed by caller assert(a == p->children[p->rank-1]); --p->rank; // Note: a, ap, p, pp all have rank r if (do_compare(pp, p)) { do_swap(a, ap); do_swap(p, pp); do_swap(g, gp); } // Assuming k(p) <= k(p') // make p' the rank r child of p assert(r == p->rank); p->children[p->rank++] = pp; pp->parent = p; // Combine a, ap into a rank r+1 group c group* c = combine(a, ap); // make c the rank r+1 child of g' assert(gp->rank > r+1); gp->children[r+1] = c; c->parent = gp; #if defined(BOOST_RELAXED_HEAP_DEBUG) && BOOST_RELAXED_HEAP_DEBUG > 1 std::cerr << "After pair transform...\n"; dump_tree(); #endif if (A[r+1] == pp) A[r+1] = c; else promote(c); } void active_sibling_transform(group* a, group* s) { #if defined(BOOST_RELAXED_HEAP_DEBUG) && BOOST_RELAXED_HEAP_DEBUG > 1 std::cerr << "- active sibling transform\n"; #endif group* p = a->parent; group* g = p->parent; // remove a, s from their parents assert(s->parent == p); assert(p->children[p->rank-1] == s); --p->rank; assert(p->children[p->rank-1] == a); --p->rank; rank_type r = a->rank; A[r+1] = 0; a = combine(p, a); group* c = combine(a, s); // make c the rank r+2 child of g assert(g->children[r+2] == p); g->children[r+2] = c; c->parent = g; if (A[r+2] == p) A[r+2] = c; else promote(c); } void good_sibling_transform(group* a, group* s) { #if defined(BOOST_RELAXED_HEAP_DEBUG) && BOOST_RELAXED_HEAP_DEBUG > 1 std::cerr << "- good sibling transform\n"; #endif rank_type r = a->rank; group* c = s->children[s->rank-1]; assert(c->rank == r); if (A[r] == c) { #if defined(BOOST_RELAXED_HEAP_DEBUG) && BOOST_RELAXED_HEAP_DEBUG > 1 std::cerr << "- good sibling pair transform\n"; #endif A[r] = 0; group* p = a->parent; // Remove c from its parent --s->rank; // Make s the rank r child of p s->parent = p; p->children[r] = s; // combine a, c and let the result by the rank r+1 child of p assert(p->rank > r+1); group* x = combine(a, c); x->parent = p; p->children[r+1] = x; if (A[r+1] == s) A[r+1] = x; else promote(x); #if defined(BOOST_RELAXED_HEAP_DEBUG) && BOOST_RELAXED_HEAP_DEBUG > 1 dump_tree(std::cerr); #endif // pair_transform(a); } else { // Clean operation group* p = a->parent; s->children[r] = a; a->parent = s; p->children[r] = c; c->parent = p; promote(a); } } static void do_swap(group*& x, group*& y) { group* tmp = x; x = y; y = tmp; } /// Function object that compares two values in the heap Compare compare; /// Mapping from values to indices in the range [0, n). ID id; /** The root group of the queue. This group is special because it will * never store a value, but it acts as a parent to all of the * roots. Thus, its list of children is the list of roots. */ group root; /** Mapping from the group index of a value to the group associated * with that value. If a value is not in the queue, then the "value" * field will be empty. */ std::vector index_to_group; /** Flat data structure containing the values in each of the * groups. It will be indexed via the id of the values. The groups * are each log_n long, with the last group potentially being * smaller. */ std::vector< ::boost::optional > groups; /** The list of active groups, indexed by rank. When A[r] is null, * there is no active group of rank r. Otherwise, A[r] is the active * group of rank r. */ std::vector A; /** The group containing the smallest value in the queue, which must * be either a root or an active group. If this group is null, then we * will need to search for this group when it is needed. */ mutable group* smallest_value; /// Cached value log_base_2(n) size_type log_n; }; } // end namespace boost #if defined(BOOST_MSVC) # pragma warning(pop) #endif #endif // BOOST_RELAXED_HEAP_HEADER madp-0.4/src/boost/boost/pending/PaxHeaders.5405/property.hpp0000644000000000000000000000007412717644140021047 xustar0030 atime=1463765180.137719871 30 ctime=1463765201.109552373 madp-0.4/src/boost/boost/pending/property.hpp0000664000372100037210000002521412717644140021702 0ustar00fransfrans00000000000000// (C) Copyright Jeremy Siek 2004 // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_PROPERTY_HPP #define BOOST_PROPERTY_HPP #include #include #include #include #include #include namespace boost { struct no_property {}; template struct property { typedef Base next_type; typedef Tag tag_type; typedef T value_type; property(const T& v = T()) : m_value(v) { } property(const T& v, const Base& b) : m_value(v), m_base(b) { } // copy constructor and assignment operator will be generated by compiler T m_value; Base m_base; }; // Kinds of properties namespace graph_introspect_detail { BOOST_MPL_HAS_XXX_TRAIT_DEF(kind) template struct get_kind {typedef void type;}; template struct get_kind {typedef typename T::kind type;}; } // Having a default is to make this trait work for any type, not just valid // properties, to work around VC++ <= 10 bugs related to SFINAE in // compressed_sparse_row_graph's get functions and similar template struct property_kind: graph_introspect_detail::get_kind::value> {}; // Some standard properties defined independently of Boost.Graph: enum vertex_all_t {vertex_all}; enum edge_all_t {edge_all}; enum graph_all_t {graph_all}; enum vertex_bundle_t {vertex_bundle}; enum edge_bundle_t {edge_bundle}; enum graph_bundle_t {graph_bundle}; // Code to look up one property in a property list: template struct lookup_one_property_internal {BOOST_STATIC_CONSTANT(bool, found = false); typedef void type;}; // Special-case properties (vertex_all, edge_all, graph_all) #define BGL_ALL_PROP(tag) \ template \ struct lookup_one_property_internal { \ BOOST_STATIC_CONSTANT(bool, found = true); \ typedef T type; \ static T& lookup(T& x, tag) {return x;} \ static const T& lookup(const T& x, tag) {return x;} \ }; \ template \ struct lookup_one_property_internal, tag> { /* Avoid ambiguity */ \ BOOST_STATIC_CONSTANT(bool, found = true); \ typedef property type; \ static type& lookup(type& x, tag) {return x;} \ static const type& lookup(const type& x, tag) {return x;} \ }; BGL_ALL_PROP(vertex_all_t) BGL_ALL_PROP(edge_all_t) BGL_ALL_PROP(graph_all_t) #undef BGL_ALL_PROP // *_bundled; these need to be macros rather than inheritance to resolve ambiguities #define BGL_DO_ONE_BUNDLE_TYPE(kind) \ template \ struct lookup_one_property_internal { \ BOOST_STATIC_CONSTANT(bool, found = true); \ typedef T type; \ static T& lookup(T& x, BOOST_JOIN(kind, _bundle_t)) {return x;} \ static const T& lookup(const T& x, BOOST_JOIN(kind, _bundle_t)) {return x;} \ }; \ \ template \ struct lookup_one_property_internal, BOOST_JOIN(kind, _bundle_t)>: lookup_one_property_internal { \ private: \ typedef lookup_one_property_internal base_type; \ public: \ template \ static typename lazy_enable_if_c<(base_type::found && (is_same::value)), \ add_reference >::type \ lookup(property& p, BundleTag) {return base_type::lookup(p.m_base, BOOST_JOIN(kind, _bundle_t)());} \ template \ static typename lazy_enable_if_c<(base_type::found && (is_same::value)), \ add_reference >::type \ lookup(const property& p, BundleTag) {return base_type::lookup(p.m_base, BOOST_JOIN(kind, _bundle_t)());} \ }; \ BGL_DO_ONE_BUNDLE_TYPE(vertex) BGL_DO_ONE_BUNDLE_TYPE(edge) BGL_DO_ONE_BUNDLE_TYPE(graph) #undef BGL_DO_ONE_BUNDLE_TYPE // Normal old-style properties; second case also handles chaining of bundled property accesses template struct lookup_one_property_internal, Tag> { BOOST_STATIC_CONSTANT(bool, found = true); typedef property prop; typedef T type; template static typename enable_if, T&>::type lookup(U& prop, const Tag&) {return prop.m_value;} template static typename enable_if, const T&>::type lookup(const U& prop, const Tag&) {return prop.m_value;} }; template struct lookup_one_property_internal, PropName>: lookup_one_property_internal { private: typedef lookup_one_property_internal base_type; public: template static typename lazy_enable_if >, add_reference >::type lookup(PL& prop, const PropName& tag) { return base_type::lookup(prop.m_base, tag); } template static typename lazy_enable_if >, add_reference >::type lookup(const PL& prop, const PropName& tag) { return base_type::lookup(prop.m_base, tag); } }; // Pointer-to-member access to bundled properties #ifndef BOOST_GRAPH_NO_BUNDLED_PROPERTIES template struct lookup_one_property_internal >::type> { BOOST_STATIC_CONSTANT(bool, found = true); typedef R type; static R& lookup(T& x, R TMaybeBase::*ptr) {return x.*ptr;} static const R& lookup(const T& x, R TMaybeBase::*ptr) {return x.*ptr;} }; #endif // Version of above handling const property lists properly template struct lookup_one_property: lookup_one_property_internal {}; template struct lookup_one_property { BOOST_STATIC_CONSTANT(bool, found = (lookup_one_property_internal::found)); typedef const typename lookup_one_property_internal::type type; template static typename lazy_enable_if, add_reference::type> >::type lookup(const U& p, Tag tag) { return lookup_one_property_internal::lookup(p, tag); } }; // The BGL properties specialize property_kind and // property_num, and use enum's for the Property type (see // graph/properties.hpp), but the user may want to use a class // instead with a nested kind type and num. Also, we may want to // switch BGL back to using class types for properties at some point. template struct has_property : boost::mpl::true_ {}; template <> struct has_property : boost::mpl::false_ {}; } // namespace boost #include namespace boost { template struct property_value: lookup_one_property {}; template inline typename lookup_one_property::type& get_property_value(PropertyList& p, Tag tag) { return lookup_one_property::lookup(p, tag); } template inline const typename lookup_one_property::type& get_property_value(const PropertyList& p, Tag tag) { return lookup_one_property::lookup(p, tag); } namespace detail { /** This trait returns true if T is no_property. */ template struct is_no_property : mpl::bool_::value> { }; template class lookup_one_property_f; template struct lookup_one_property_f_result; template struct lookup_one_property_f_result(PList)> { typedef typename lookup_one_property::type type; }; template struct lookup_one_property_f_result(PList&)> { typedef typename lookup_one_property::type& type; }; template struct lookup_one_property_f_result(const PList&)> { typedef const typename lookup_one_property::type& type; }; template class lookup_one_property_f { Tag tag; public: lookup_one_property_f(Tag tag): tag(tag) {} template struct result: lookup_one_property_f_result {}; typename lookup_one_property_f_result::type operator()(PList& pl) const { return lookup_one_property::lookup(pl, tag); } }; } // namespace detail namespace detail { // Stuff for directed_graph and undirected_graph to skip over their first // vertex_index and edge_index properties when providing vertex_all and // edge_all; make sure you know the exact structure of your properties if you // use there. struct remove_first_property { template struct result { typedef typename boost::function_traits::arg1_type a1; typedef typename boost::remove_reference::type non_ref; typedef typename non_ref::next_type nx; typedef typename boost::mpl::if_, boost::add_const, nx>::type with_const; typedef typename boost::add_reference::type type; }; template typename Prop::next_type& operator()(Prop& p) const {return p.m_base;} template const typename Prop::next_type& operator()(const Prop& p) const {return p.m_base;} }; } } // namesapce boost #endif /* BOOST_PROPERTY_HPP */ madp-0.4/src/boost/boost/pending/PaxHeaders.5405/queue.hpp0000644000000000000000000000007412717644140020307 xustar0030 atime=1463765180.137719871 30 ctime=1463765201.109552373 madp-0.4/src/boost/boost/pending/queue.hpp0000664000372100037210000000600312717644140021135 0ustar00fransfrans00000000000000// (C) Copyright Jeremy Siek 2004 // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_QUEUE_HPP #define BOOST_QUEUE_HPP #include #include namespace boost { template > class queue; template inline bool operator==(const queue<_Tp, _Seq>&, const queue<_Tp, _Seq>&); template inline bool operator<(const queue<_Tp, _Seq>&, const queue<_Tp, _Seq>&); template class queue { #ifndef BOOST_NO_MEMBER_TEMPLATE_FRIENDS template friend bool operator== (const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&); template friend bool operator< (const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&); #endif public: typedef typename _Sequence::value_type value_type; typedef typename _Sequence::size_type size_type; typedef _Sequence container_type; typedef typename _Sequence::reference reference; typedef typename _Sequence::const_reference const_reference; #ifndef BOOST_NO_MEMBER_TEMPLATE_FRIENDS protected: #endif _Sequence c; public: queue() : c() {} explicit queue(const _Sequence& __c) : c(__c) {} bool empty() const { return c.empty(); } size_type size() const { return c.size(); } reference front() { return c.front(); } const_reference front() const { return c.front(); } reference top() { return c.front(); } const_reference top() const { return c.front(); } reference back() { return c.back(); } const_reference back() const { return c.back(); } void push(const value_type& __x) { c.push_back(__x); } void pop() { c.pop_front(); } void swap(queue& other) { using std::swap; swap(c, other.c); } }; template bool operator==(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y) { return __x.c == __y.c; } template bool operator<(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y) { return __x.c < __y.c; } template bool operator!=(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y) { return !(__x == __y); } template bool operator>(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y) { return __y < __x; } template bool operator<=(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y) { return !(__y < __x); } template bool operator>=(const queue<_Tp, _Sequence>& __x, const queue<_Tp, _Sequence>& __y) { return !(__x < __y); } template inline void swap(queue<_Tp, _Sequence>& __x, queue<_Tp, _Sequence>& __y) { __x.swap(__y); } } /* namespace boost */ #endif /* BOOST_QUEUE_HPP */ madp-0.4/src/boost/boost/pending/PaxHeaders.5405/integer_log2.hpp0000644000000000000000000000007412717644140021543 xustar0030 atime=1463765180.137719871 30 ctime=1463765201.109552373 madp-0.4/src/boost/boost/pending/integer_log2.hpp0000664000372100037210000000431512717644140022375 0ustar00fransfrans00000000000000// ----------------------------------------------------------- // integer_log2.hpp // // Gives the integer part of the logarithm, in base 2, of a // given number. Behavior is undefined if the argument is <= 0. // // Copyright (c) 2003-2004, 2008 Gennaro Prota // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // ----------------------------------------------------------- #ifndef BOOST_INTEGER_LOG2_HPP_GP_20030301 #define BOOST_INTEGER_LOG2_HPP_GP_20030301 #include #ifdef __BORLANDC__ #include #endif #include "boost/limits.hpp" #include "boost/config.hpp" namespace boost { namespace detail { template int integer_log2_impl(T x, int n) { int result = 0; while (x != 1) { const T t = static_cast(x >> n); if (t) { result += n; x = t; } n /= 2; } return result; } // helper to find the maximum power of two // less than p (more involved than necessary, // to avoid PTS) // template struct max_pow2_less { enum { c = 2*n < p }; BOOST_STATIC_CONSTANT(int, value = c ? (max_pow2_less< c*p, 2*c*n>::value) : n); }; template <> struct max_pow2_less<0, 0> { BOOST_STATIC_CONSTANT(int, value = 0); }; // this template is here just for Borland :( // we could simply rely on numeric_limits but sometimes // Borland tries to use numeric_limits, because // of its usual const-related problems in argument deduction // - gps template struct width { #ifdef __BORLANDC__ BOOST_STATIC_CONSTANT(int, value = sizeof(T) * CHAR_BIT); #else BOOST_STATIC_CONSTANT(int, value = (std::numeric_limits::digits)); #endif }; } // detail // --------- // integer_log2 // --------------- // template int integer_log2(T x) { assert(x > 0); const int n = detail::max_pow2_less< detail::width :: value, 4 > :: value; return detail::integer_log2_impl(x, n); } } #endif // include guard madp-0.4/src/boost/boost/pending/PaxHeaders.5405/detail0000644000000000000000000000007412717644140017637 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.109552373 madp-0.4/src/boost/boost/pending/detail/0000775000372100037210000000000012717644140020543 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/pending/detail/PaxHeaders.5405/property.hpp0000644000000000000000000000007412717644140022311 xustar0030 atime=1463765180.137719871 30 ctime=1463765201.109552373 madp-0.4/src/boost/boost/pending/detail/property.hpp0000664000372100037210000000102012717644140023131 0ustar00fransfrans00000000000000// (C) Copyright Jeremy Siek 2004 // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_DETAIL_PROPERTY_HPP #define BOOST_DETAIL_PROPERTY_HPP #include // for std::pair #include // for is_same namespace boost { namespace detail { struct error_property_not_found { }; } // namespace detail } // namespace boost #endif // BOOST_DETAIL_PROPERTY_HPP madp-0.4/src/boost/boost/pending/PaxHeaders.5405/container_traits.hpp0000644000000000000000000000007412717644140022533 xustar0030 atime=1463765180.137719871 30 ctime=1463765201.109552373 madp-0.4/src/boost/boost/pending/container_traits.hpp0000664000372100037210000004275312717644140023375 0ustar00fransfrans00000000000000// (C) Copyright Jeremy Siek 2004 // (C) Copyright Thomas Claveirole 2010 // (C) Copyright Ignacy Gawedzki 2010 // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_GRAPH_DETAIL_CONTAINER_TRAITS_H #define BOOST_GRAPH_DETAIL_CONTAINER_TRAITS_H // Sure would be nice to be able to forward declare these // instead of pulling in all the headers. Too bad that // is not legal. There ought to be a standard header. -JGS #include #include // for std::remove #include #include #include #include #include #include #if !defined BOOST_NO_SLIST # ifdef BOOST_SLIST_HEADER # include BOOST_SLIST_HEADER # else # include # endif #endif #if BOOST_WORKAROUND(BOOST_MSVC, < 1300) // Stay out of the way of concept checking class templates # define Container Container_ # define AssociativeContainer AssociativeContainer_ #endif // The content of this file is in 'graph_detail' because otherwise // there will be name clashes with // sandbox/boost/sequence_algo/container_traits.hpp // The 'detail' subnamespace will still cause problems. namespace boost { namespace graph_detail { //====================================================================== // Container Category Tags // // They use virtual inheritance because there are lots of // inheritance diamonds. struct container_tag { }; struct forward_container_tag : virtual public container_tag { }; struct reversible_container_tag : virtual public forward_container_tag { }; struct random_access_container_tag : virtual public reversible_container_tag { }; struct sequence_tag : virtual public forward_container_tag { }; struct associative_container_tag : virtual public forward_container_tag { }; struct sorted_associative_container_tag : virtual public associative_container_tag, virtual public reversible_container_tag { }; struct front_insertion_sequence_tag : virtual public sequence_tag { }; struct back_insertion_sequence_tag : virtual public sequence_tag { }; struct unique_associative_container_tag : virtual public associative_container_tag { }; struct multiple_associative_container_tag : virtual public associative_container_tag { }; struct simple_associative_container_tag : virtual public associative_container_tag { }; struct pair_associative_container_tag : virtual public associative_container_tag { }; //====================================================================== // Iterator Stability Tags // // Do mutating operations such as insert/erase/resize invalidate all // outstanding iterators? struct stable_tag { }; struct unstable_tag { }; //====================================================================== // Container Traits Class and container_category() function #if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION // don't use this unless there is partial specialization template struct container_traits { typedef typename Container::category category; typedef typename Container::iterator_stability iterator_stability; }; #endif // Use this as a compile-time assertion that X is stable inline void require_stable(stable_tag) { } // std::vector struct vector_tag : virtual public random_access_container_tag, virtual public back_insertion_sequence_tag { }; template vector_tag container_category(const std::vector&) { return vector_tag(); } template unstable_tag iterator_stability(const std::vector&) { return unstable_tag(); } #if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION template struct container_traits< std::vector > { typedef vector_tag category; typedef unstable_tag iterator_stability; }; #endif // std::list struct list_tag : virtual public reversible_container_tag, virtual public back_insertion_sequence_tag // this causes problems for push_dispatch... // virtual public front_insertion_sequence_tag { }; template list_tag container_category(const std::list&) { return list_tag(); } template stable_tag iterator_stability(const std::list&) { return stable_tag(); } #if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION template struct container_traits< std::list > { typedef list_tag category; typedef stable_tag iterator_stability; }; #endif // std::slist #ifndef BOOST_NO_SLIST # ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION template struct container_traits > { typedef front_insertion_sequence_tag category; typedef stable_tag iterator_stability; }; #endif template front_insertion_sequence_tag container_category( const BOOST_STD_EXTENSION_NAMESPACE::slist& ) { return front_insertion_sequence_tag(); } template stable_tag iterator_stability( const BOOST_STD_EXTENSION_NAMESPACE::slist&) { return stable_tag(); } #endif // std::set struct set_tag : virtual public sorted_associative_container_tag, virtual public simple_associative_container_tag, virtual public unique_associative_container_tag { }; template set_tag container_category(const std::set&) { return set_tag(); } template stable_tag iterator_stability(const std::set&) { return stable_tag(); } #if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION template struct container_traits< std::set > { typedef set_tag category; typedef stable_tag iterator_stability; }; #endif // std::multiset struct multiset_tag : virtual public sorted_associative_container_tag, virtual public simple_associative_container_tag, virtual public multiple_associative_container_tag { }; template multiset_tag container_category(const std::multiset&) { return multiset_tag(); } template stable_tag iterator_stability(const std::multiset&) { return stable_tag(); } #if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION template struct container_traits< std::multiset > { typedef multiset_tag category; typedef stable_tag iterator_stability; }; #endif // deque // std::map struct map_tag : virtual public sorted_associative_container_tag, virtual public pair_associative_container_tag, virtual public unique_associative_container_tag { }; #if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION template struct container_traits< std::map > { typedef map_tag category; typedef stable_tag iterator_stability; }; #endif template map_tag container_category(const std::map&) { return map_tag(); } template stable_tag iterator_stability(const std::map&) { return stable_tag(); } // std::multimap struct multimap_tag : virtual public sorted_associative_container_tag, virtual public pair_associative_container_tag, virtual public multiple_associative_container_tag { }; #if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION template struct container_traits< std::multimap > { typedef multimap_tag category; typedef stable_tag iterator_stability; }; #endif template multimap_tag container_category(const std::multimap&) { return multimap_tag(); } template stable_tag iterator_stability(const std::multimap&) { return stable_tag(); } // hash_set, hash_map struct unordered_set_tag : virtual public simple_associative_container_tag, virtual public unique_associative_container_tag { }; struct unordered_multiset_tag : virtual public simple_associative_container_tag, virtual public multiple_associative_container_tag { }; struct unordered_map_tag : virtual public pair_associative_container_tag, virtual public unique_associative_container_tag { }; struct unordered_multimap_tag : virtual public pair_associative_container_tag, virtual public multiple_associative_container_tag { }; #ifndef BOOST_NO_HASH #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION template struct container_traits< boost::unordered_set > { typedef unordered_set_tag category; typedef unstable_tag iterator_stability; }; template struct container_traits< boost::unordered_map > { typedef unordered_map_tag category; typedef unstable_tag iterator_stability; }; template struct container_traits< boost::unordered_multiset > { typedef unordered_multiset_tag category; typedef unstable_tag iterator_stability; }; template struct container_traits< boost::unordered_multimap > { typedef unordered_multimap_tag category; typedef unstable_tag iterator_stability; }; #endif template unordered_set_tag container_category(const boost::unordered_set&) { return unordered_set_tag(); } template unordered_map_tag container_category(const boost::unordered_map&) { return unordered_map_tag(); } template unstable_tag iterator_stability(const boost::unordered_set&) { return unstable_tag(); } template unstable_tag iterator_stability(const boost::unordered_map&) { return unstable_tag(); } template unordered_multiset_tag container_category(const boost::unordered_multiset&) { return unordered_multiset_tag(); } template unordered_multimap_tag container_category(const boost::unordered_multimap&) { return unordered_multimap_tag(); } template unstable_tag iterator_stability(const boost::unordered_multiset&) { return unstable_tag(); } template unstable_tag iterator_stability(const boost::unordered_multimap&) { return unstable_tag(); } #endif //=========================================================================== // Generalized Container Functions // Erase template void erase_dispatch(Sequence& c, const T& x, sequence_tag) { c.erase(std::remove(c.begin(), c.end(), x), c.end()); } template void erase_dispatch(AssociativeContainer& c, const T& x, associative_container_tag) { c.erase(x); } template void erase(Container& c, const T& x) { erase_dispatch(c, x, container_category(c)); } // Erase If template void erase_if_dispatch(Sequence& c, Predicate p, sequence_tag, IteratorStability) { #if 0 c.erase(std::remove_if(c.begin(), c.end(), p), c.end()); #else if (! c.empty()) c.erase(std::remove_if(c.begin(), c.end(), p), c.end()); #endif } template void erase_if_dispatch(AssociativeContainer& c, Predicate p, associative_container_tag, stable_tag) { typename AssociativeContainer::iterator i, next; for (i = next = c.begin(); next != c.end(); i = next) { ++next; if (p(*i)) c.erase(i); } } template void erase_if_dispatch(AssociativeContainer& c, Predicate p, associative_container_tag, unstable_tag) { // This method is really slow, so hopefully we won't have any // associative containers with unstable iterators! // Is there a better way to do this? typename AssociativeContainer::iterator i; typename AssociativeContainer::size_type n = c.size(); while (n--) for (i = c.begin(); i != c.end(); ++i) if (p(*i)) { c.erase(i); break; } } template void erase_if(Container& c, Predicate p) { erase_if_dispatch(c, p, container_category(c), iterator_stability(c)); } // Push template std::pair push_dispatch(Container& c, const T& v, back_insertion_sequence_tag) { c.push_back(v); return std::make_pair(boost::prior(c.end()), true); } template std::pair push_dispatch(Container& c, const T& v, front_insertion_sequence_tag) { c.push_front(v); return std::make_pair(c.begin(), true); } template std::pair push_dispatch(AssociativeContainer& c, const T& v, unique_associative_container_tag) { return c.insert(v); } template std::pair push_dispatch(AssociativeContainer& c, const T& v, multiple_associative_container_tag) { return std::make_pair(c.insert(v), true); } template std::pair push(Container& c, const T& v) { return push_dispatch(c, v, container_category(c)); } // Find template typename Container::iterator find_dispatch(Container& c, const Value& value, container_tag) { return std::find(c.begin(), c.end(), value); } template typename AssociativeContainer::iterator find_dispatch(AssociativeContainer& c, const Value& value, associative_container_tag) { return c.find(value); } template typename Container::iterator find(Container& c, const Value& value) { return find_dispatch(c, value, graph_detail::container_category(c)); } // Find (const versions) template typename Container::const_iterator find_dispatch(const Container& c, const Value& value, container_tag) { return std::find(c.begin(), c.end(), value); } template typename AssociativeContainer::const_iterator find_dispatch(const AssociativeContainer& c, const Value& value, associative_container_tag) { return c.find(value); } template typename Container::const_iterator find(const Container& c, const Value& value) { return find_dispatch(c, value, graph_detail::container_category(c)); } // Equal range #if 0 // Make the dispatch fail if c is not an Associative Container (and thus // doesn't have equal_range unless it is sorted, which we cannot check // statically and is not typically true for BGL's uses of this function). template std::pair equal_range_dispatch(Container& c, const LessThanComparable& value, container_tag) { // c must be sorted for std::equal_range to behave properly. return std::equal_range(c.begin(), c.end(), value); } #endif template std::pair equal_range_dispatch(AssociativeContainer& c, const Value& value, associative_container_tag) { return c.equal_range(value); } template std::pair equal_range(Container& c, const Value& value) { return equal_range_dispatch(c, value, graph_detail::container_category(c)); } }} // namespace boost::graph_detail #if BOOST_WORKAROUND(BOOST_MSVC, < 1300) // Stay out of the way of concept checking class templates # undef Container # undef AssociativeContainer #endif #endif // BOOST_GRAPH_DETAIL_CONTAINER_TRAITS_H madp-0.4/src/boost/boost/PaxHeaders.5405/throw_exception.hpp0000644000000000000000000000007412717644140020760 xustar0030 atime=1463765180.173719584 30 ctime=1463765201.173551863 madp-0.4/src/boost/boost/throw_exception.hpp0000664000372100037210000000576512717644140021624 0ustar00fransfrans00000000000000#ifndef UUID_AA15E74A856F11E08B8D93F24824019B #define UUID_AA15E74A856F11E08B8D93F24824019B #if (__GNUC__*100+__GNUC_MINOR__>301) && !defined(BOOST_EXCEPTION_ENABLE_WARNINGS) #pragma GCC system_header #endif #if defined(_MSC_VER) && !defined(BOOST_EXCEPTION_ENABLE_WARNINGS) #pragma warning(push,1) #endif // MS compatible compilers support #pragma once #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once #endif // // boost/throw_exception.hpp // // Copyright (c) 2002 Peter Dimov and Multi Media Ltd. // Copyright (c) 2008-2009 Emil Dotchevski and Reverge Studios, Inc. // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // http://www.boost.org/libs/utility/throw_exception.html // #include #include #include #include #if !defined( BOOST_EXCEPTION_DISABLE ) && defined( __BORLANDC__ ) && BOOST_WORKAROUND( __BORLANDC__, BOOST_TESTED_AT(0x593) ) # define BOOST_EXCEPTION_DISABLE #endif #if !defined( BOOST_EXCEPTION_DISABLE ) && defined( BOOST_MSVC ) && BOOST_WORKAROUND( BOOST_MSVC, < 1310 ) # define BOOST_EXCEPTION_DISABLE #endif #if !defined( BOOST_EXCEPTION_DISABLE ) # include #if !defined(BOOST_THROW_EXCEPTION_CURRENT_FUNCTION) # include # define BOOST_THROW_EXCEPTION_CURRENT_FUNCTION BOOST_CURRENT_FUNCTION #endif # define BOOST_THROW_EXCEPTION(x) ::boost::exception_detail::throw_exception_(x,BOOST_THROW_EXCEPTION_CURRENT_FUNCTION,__FILE__,__LINE__) #else # define BOOST_THROW_EXCEPTION(x) ::boost::throw_exception(x) #endif namespace boost { #ifdef BOOST_NO_EXCEPTIONS void throw_exception( std::exception const & e ); // user defined #else inline void throw_exception_assert_compatibility( std::exception const & ) { } template BOOST_ATTRIBUTE_NORETURN inline void throw_exception( E const & e ) { //All boost exceptions are required to derive from std::exception, //to ensure compatibility with BOOST_NO_EXCEPTIONS. throw_exception_assert_compatibility(e); #ifndef BOOST_EXCEPTION_DISABLE throw enable_current_exception(enable_error_info(e)); #else throw e; #endif } #endif #if !defined( BOOST_EXCEPTION_DISABLE ) namespace exception_detail { template BOOST_ATTRIBUTE_NORETURN void throw_exception_( E const & x, char const * current_function, char const * file, int line ) { boost::throw_exception( set_info( set_info( set_info( enable_error_info(x), throw_function(current_function)), throw_file(file)), throw_line(line))); } } #endif } // namespace boost #if defined(_MSC_VER) && !defined(BOOST_EXCEPTION_ENABLE_WARNINGS) #pragma warning(pop) #endif #endif madp-0.4/src/boost/boost/PaxHeaders.5405/config0000644000000000000000000000007412717644140016216 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/config/0000775000372100037210000000000012717644140017122 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/config/PaxHeaders.5405/user.hpp0000644000000000000000000000007312717644140017761 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/config/user.hpp0000664000372100037210000001204512717644140020613 0ustar00fransfrans00000000000000// boost/config/user.hpp ---------------------------------------------------// // (C) Copyright John Maddock 2001. // Use, modification and distribution are subject to the // Boost Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // Do not check in modified versions of this file, // This file may be customized by the end user, but not by boost. // // Use this file to define a site and compiler specific // configuration policy: // // define this to locate a compiler config file: // #define BOOST_COMPILER_CONFIG // define this to locate a stdlib config file: // #define BOOST_STDLIB_CONFIG // define this to locate a platform config file: // #define BOOST_PLATFORM_CONFIG // define this to disable compiler config, // use if your compiler config has nothing to set: // #define BOOST_NO_COMPILER_CONFIG // define this to disable stdlib config, // use if your stdlib config has nothing to set: // #define BOOST_NO_STDLIB_CONFIG // define this to disable platform config, // use if your platform config has nothing to set: // #define BOOST_NO_PLATFORM_CONFIG // define this to disable all config options, // excluding the user config. Use if your // setup is fully ISO compliant, and has no // useful extensions, or for autoconf generated // setups: // #define BOOST_NO_CONFIG // define this to make the config "optimistic" // about unknown compiler versions. Normally // unknown compiler versions are assumed to have // all the defects of the last known version, however // setting this flag, causes the config to assume // that unknown compiler versions are fully conformant // with the standard: // #define BOOST_STRICT_CONFIG // define this to cause the config to halt compilation // with an #error if it encounters anything unknown -- // either an unknown compiler version or an unknown // compiler/platform/library: // #define BOOST_ASSERT_CONFIG // define if you want to disable threading support, even // when available: // #define BOOST_DISABLE_THREADS // define when you want to disable Win32 specific features // even when available: // #define BOOST_DISABLE_WIN32 // BOOST_DISABLE_ABI_HEADERS: Stops boost headers from including any // prefix/suffix headers that normally control things like struct // packing and alignment. // #define BOOST_DISABLE_ABI_HEADERS // BOOST_ABI_PREFIX: A prefix header to include in place of whatever // boost.config would normally select, any replacement should set up // struct packing and alignment options as required. // #define BOOST_ABI_PREFIX my-header-name // BOOST_ABI_SUFFIX: A suffix header to include in place of whatever // boost.config would normally select, any replacement should undo // the effects of the prefix header. // #define BOOST_ABI_SUFFIX my-header-name // BOOST_ALL_DYN_LINK: Forces all libraries that have separate source, // to be linked as dll's rather than static libraries on Microsoft Windows // (this macro is used to turn on __declspec(dllimport) modifiers, so that // the compiler knows which symbols to look for in a dll rather than in a // static library). Note that there may be some libraries that can only // be statically linked (Boost.Test for example) and others which may only // be dynamically linked (Boost.Threads for example), in these cases this // macro has no effect. // #define BOOST_ALL_DYN_LINK // BOOST_WHATEVER_DYN_LINK: Forces library "whatever" to be linked as a dll // rather than a static library on Microsoft Windows: replace the WHATEVER // part of the macro name with the name of the library that you want to // dynamically link to, for example use BOOST_DATE_TIME_DYN_LINK or // BOOST_REGEX_DYN_LINK etc (this macro is used to turn on __declspec(dllimport) // modifiers, so that the compiler knows which symbols to look for in a dll // rather than in a static library). // Note that there may be some libraries that can only be statically linked // (Boost.Test for example) and others which may only be dynamically linked // (Boost.Threads for example), in these cases this macro is unsupported. // #define BOOST_WHATEVER_DYN_LINK // BOOST_ALL_NO_LIB: Tells the config system not to automatically select // which libraries to link against. // Normally if a compiler supports #pragma lib, then the correct library // build variant will be automatically selected and linked against, // simply by the act of including one of that library's headers. // This macro turns that feature off. // #define BOOST_ALL_NO_LIB // BOOST_WHATEVER_NO_LIB: Tells the config system not to automatically // select which library to link against for library "whatever", // replace WHATEVER in the macro name with the name of the library; // for example BOOST_DATE_TIME_NO_LIB or BOOST_REGEX_NO_LIB. // Normally if a compiler supports #pragma lib, then the correct library // build variant will be automatically selected and linked against, simply // by the act of including one of that library's headers. This macro turns // that feature off. // #define BOOST_WHATEVER_NO_LIB madp-0.4/src/boost/boost/config/PaxHeaders.5405/platform0000644000000000000000000000007412717644140020042 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/config/platform/0000775000372100037210000000000012717644140020746 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/config/platform/PaxHeaders.5405/linux.hpp0000644000000000000000000000007312717644140021766 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/config/platform/linux.hpp0000664000372100037210000000477412717644140022632 0ustar00fransfrans00000000000000// (C) Copyright John Maddock 2001 - 2003. // (C) Copyright Jens Maurer 2001 - 2003. // Use, modification and distribution are subject to the // Boost Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // See http://www.boost.org for most recent version. // linux specific config options: #define BOOST_PLATFORM "linux" // make sure we have __GLIBC_PREREQ if available at all #ifdef __cplusplus #include #else #include #endif // // added to glibc 2.1.1 // We can only test for 2.1 though: // #if defined(__GLIBC__) && ((__GLIBC__ > 2) || ((__GLIBC__ == 2) && (__GLIBC_MINOR__ >= 1))) // defines int64_t unconditionally, but defines // int64_t only if __GNUC__. Thus, assume a fully usable // only when using GCC. # if defined __GNUC__ # define BOOST_HAS_STDINT_H # endif #endif #if defined(__LIBCOMO__) // // como on linux doesn't have std:: c functions: // NOTE: versions of libcomo prior to beta28 have octal version numbering, // e.g. version 25 is 21 (dec) // # if __LIBCOMO_VERSION__ <= 20 # define BOOST_NO_STDC_NAMESPACE # endif # if __LIBCOMO_VERSION__ <= 21 # define BOOST_NO_SWPRINTF # endif #endif // // If glibc is past version 2 then we definitely have // gettimeofday, earlier versions may or may not have it: // #if defined(__GLIBC__) && (__GLIBC__ >= 2) # define BOOST_HAS_GETTIMEOFDAY #endif #ifdef __USE_POSIX199309 # define BOOST_HAS_NANOSLEEP #endif #if defined(__GLIBC__) && defined(__GLIBC_PREREQ) // __GLIBC_PREREQ is available since 2.1.2 // swprintf is available since glibc 2.2.0 # if !__GLIBC_PREREQ(2,2) || (!defined(__USE_ISOC99) && !defined(__USE_UNIX98)) # define BOOST_NO_SWPRINTF # endif #else # define BOOST_NO_SWPRINTF #endif // boilerplate code: #define BOOST_HAS_UNISTD_H #include #define BOOST_HAS_PTHREAD_YIELD #ifndef __GNUC__ // // if the compiler is not gcc we still need to be able to parse // the GNU system headers, some of which (mainly ) // use GNU specific extensions: // # ifndef __extension__ # define __extension__ # endif # ifndef __const__ # define __const__ const # endif # ifndef __volatile__ # define __volatile__ volatile # endif # ifndef __signed__ # define __signed__ signed # endif # ifndef __typeof__ # define __typeof__ typeof # endif # ifndef __inline__ # define __inline__ inline # endif #endif madp-0.4/src/boost/boost/config/PaxHeaders.5405/no_tr10000644000000000000000000000007412717644140017420 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/config/no_tr1/0000775000372100037210000000000012717644140020324 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/config/no_tr1/PaxHeaders.5405/functional.hpp0000644000000000000000000000007312717644140022347 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/config/no_tr1/functional.hpp0000664000372100037210000000155612717644140023206 0ustar00fransfrans00000000000000// (C) Copyright John Maddock 2005. // Use, modification and distribution are subject to the // Boost Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // // The aim of this header is just to include but to do // so in a way that does not result in recursive inclusion of // the Boost TR1 components if boost/tr1/tr1/functional is in the // include search path. We have to do this to avoid circular // dependencies: // #ifndef BOOST_CONFIG_FUNCTIONAL # define BOOST_CONFIG_FUNCTIONAL # ifndef BOOST_TR1_NO_RECURSION # define BOOST_TR1_NO_RECURSION # define BOOST_CONFIG_NO_FUNCTIONAL_RECURSION # endif # include # ifdef BOOST_CONFIG_NO_FUNCTIONAL_RECURSION # undef BOOST_TR1_NO_RECURSION # undef BOOST_CONFIG_NO_FUNCTIONAL_RECURSION # endif #endif madp-0.4/src/boost/boost/config/no_tr1/PaxHeaders.5405/cmath.hpp0000644000000000000000000000007312717644140021301 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/config/no_tr1/cmath.hpp0000664000372100037210000000150612717644140022133 0ustar00fransfrans00000000000000// (C) Copyright John Maddock 2008. // Use, modification and distribution are subject to the // Boost Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // // The aim of this header is just to include but to do // so in a way that does not result in recursive inclusion of // the Boost TR1 components if boost/tr1/tr1/cmath is in the // include search path. We have to do this to avoid circular // dependencies: // #ifndef BOOST_CONFIG_CMATH # define BOOST_CONFIG_CMATH # ifndef BOOST_TR1_NO_RECURSION # define BOOST_TR1_NO_RECURSION # define BOOST_CONFIG_NO_CMATH_RECURSION # endif # include # ifdef BOOST_CONFIG_NO_CMATH_RECURSION # undef BOOST_TR1_NO_RECURSION # undef BOOST_CONFIG_NO_CMATH_RECURSION # endif #endif madp-0.4/src/boost/boost/config/no_tr1/PaxHeaders.5405/utility.hpp0000644000000000000000000000007312717644140021710 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/config/no_tr1/utility.hpp0000664000372100037210000000152612717644140022544 0ustar00fransfrans00000000000000// (C) Copyright John Maddock 2005. // Use, modification and distribution are subject to the // Boost Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // // The aim of this header is just to include but to do // so in a way that does not result in recursive inclusion of // the Boost TR1 components if boost/tr1/tr1/utility is in the // include search path. We have to do this to avoid circular // dependencies: // #ifndef BOOST_CONFIG_UTILITY # define BOOST_CONFIG_UTILITY # ifndef BOOST_TR1_NO_RECURSION # define BOOST_TR1_NO_RECURSION # define BOOST_CONFIG_NO_UTILITY_RECURSION # endif # include # ifdef BOOST_CONFIG_NO_UTILITY_RECURSION # undef BOOST_TR1_NO_RECURSION # undef BOOST_CONFIG_NO_UTILITY_RECURSION # endif #endif madp-0.4/src/boost/boost/config/no_tr1/PaxHeaders.5405/memory.hpp0000644000000000000000000000007312717644140021515 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/config/no_tr1/memory.hpp0000664000372100037210000000151612717644140022350 0ustar00fransfrans00000000000000// (C) Copyright John Maddock 2005. // Use, modification and distribution are subject to the // Boost Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // // The aim of this header is just to include but to do // so in a way that does not result in recursive inclusion of // the Boost TR1 components if boost/tr1/tr1/memory is in the // include search path. We have to do this to avoid circular // dependencies: // #ifndef BOOST_CONFIG_MEMORY # define BOOST_CONFIG_MEMORY # ifndef BOOST_TR1_NO_RECURSION # define BOOST_TR1_NO_RECURSION # define BOOST_CONFIG_NO_MEMORY_RECURSION # endif # include # ifdef BOOST_CONFIG_NO_MEMORY_RECURSION # undef BOOST_TR1_NO_RECURSION # undef BOOST_CONFIG_NO_MEMORY_RECURSION # endif #endif madp-0.4/src/boost/boost/config/PaxHeaders.5405/posix_features.hpp0000644000000000000000000000007312717644140022043 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/config/posix_features.hpp0000664000372100037210000000723012717644140022675 0ustar00fransfrans00000000000000// (C) Copyright John Maddock 2001 - 2003. // Use, modification and distribution are subject to the // Boost Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // See http://www.boost.org for most recent version. // All POSIX feature tests go in this file, // Note that we test _POSIX_C_SOURCE and _XOPEN_SOURCE as well // _POSIX_VERSION and _XOPEN_VERSION: on some systems POSIX API's // may be present but none-functional unless _POSIX_C_SOURCE and // _XOPEN_SOURCE have been defined to the right value (it's up // to the user to do this *before* including any header, although // in most cases the compiler will do this for you). # if defined(BOOST_HAS_UNISTD_H) # include // XOpen has , but is this the correct version check? # if defined(_XOPEN_VERSION) && (_XOPEN_VERSION >= 3) # define BOOST_HAS_NL_TYPES_H # endif // POSIX version 6 requires # if defined(_POSIX_VERSION) && (_POSIX_VERSION >= 200100) # define BOOST_HAS_STDINT_H # endif // POSIX version 2 requires # if defined(_POSIX_VERSION) && (_POSIX_VERSION >= 199009L) # define BOOST_HAS_DIRENT_H # endif // POSIX version 3 requires to have sigaction: # if defined(_POSIX_VERSION) && (_POSIX_VERSION >= 199506L) # define BOOST_HAS_SIGACTION # endif // POSIX defines _POSIX_THREADS > 0 for pthread support, // however some platforms define _POSIX_THREADS without // a value, hence the (_POSIX_THREADS+0 >= 0) check. // Strictly speaking this may catch platforms with a // non-functioning stub , but such occurrences should // occur very rarely if at all. # if defined(_POSIX_THREADS) && (_POSIX_THREADS+0 >= 0) && !defined(BOOST_HAS_WINTHREADS) && !defined(BOOST_HAS_MPTASKS) # define BOOST_HAS_PTHREADS # endif // BOOST_HAS_NANOSLEEP: // This is predicated on _POSIX_TIMERS or _XOPEN_REALTIME: # if (defined(_POSIX_TIMERS) && (_POSIX_TIMERS+0 >= 0)) \ || (defined(_XOPEN_REALTIME) && (_XOPEN_REALTIME+0 >= 0)) # define BOOST_HAS_NANOSLEEP # endif // BOOST_HAS_CLOCK_GETTIME: // This is predicated on _POSIX_TIMERS (also on _XOPEN_REALTIME // but at least one platform - linux - defines that flag without // defining clock_gettime): # if (defined(_POSIX_TIMERS) && (_POSIX_TIMERS+0 >= 0)) # define BOOST_HAS_CLOCK_GETTIME # endif // BOOST_HAS_SCHED_YIELD: // This is predicated on _POSIX_PRIORITY_SCHEDULING or // on _POSIX_THREAD_PRIORITY_SCHEDULING or on _XOPEN_REALTIME. # if defined(_POSIX_PRIORITY_SCHEDULING) && (_POSIX_PRIORITY_SCHEDULING+0 > 0)\ || (defined(_POSIX_THREAD_PRIORITY_SCHEDULING) && (_POSIX_THREAD_PRIORITY_SCHEDULING+0 > 0))\ || (defined(_XOPEN_REALTIME) && (_XOPEN_REALTIME+0 >= 0)) # define BOOST_HAS_SCHED_YIELD # endif // BOOST_HAS_GETTIMEOFDAY: // BOOST_HAS_PTHREAD_MUTEXATTR_SETTYPE: // These are predicated on _XOPEN_VERSION, and appears to be first released // in issue 4, version 2 (_XOPEN_VERSION > 500). // Likewise for the functions log1p and expm1. # if defined(_XOPEN_VERSION) && (_XOPEN_VERSION+0 >= 500) # define BOOST_HAS_GETTIMEOFDAY # if defined(_XOPEN_SOURCE) && (_XOPEN_SOURCE+0 >= 500) # define BOOST_HAS_PTHREAD_MUTEXATTR_SETTYPE # endif # ifndef BOOST_HAS_LOG1P # define BOOST_HAS_LOG1P # endif # ifndef BOOST_HAS_EXPM1 # define BOOST_HAS_EXPM1 # endif # endif # endif madp-0.4/src/boost/boost/config/PaxHeaders.5405/select_stdlib_config.hpp0000644000000000000000000000007312717644140023150 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/config/select_stdlib_config.hpp0000664000372100037210000000565012717644140024006 0ustar00fransfrans00000000000000// Boost compiler configuration selection header file // (C) Copyright John Maddock 2001 - 2003. // (C) Copyright Jens Maurer 2001 - 2002. // Use, modification and distribution are subject to the // Boost Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // See http://www.boost.org for most recent version. // locate which std lib we are using and define BOOST_STDLIB_CONFIG as needed: // First include to determine if some version of STLport is in use as the std lib // (do not rely on this header being included since users can short-circuit this header // if they know whose std lib they are using.) #ifdef __cplusplus # include #else # include #endif #if defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION) // STLPort library; this _must_ come first, otherwise since // STLport typically sits on top of some other library, we // can end up detecting that first rather than STLport: # define BOOST_STDLIB_CONFIG "boost/config/stdlib/stlport.hpp" #else // If our std lib was not some version of STLport, then include as it is about // the smallest of the std lib headers that includes real C++ stuff. (Some std libs do not // include their C++-related macros in so this additional include makes sure // we get those definitions) // (again do not rely on this header being included since users can short-circuit this // header if they know whose std lib they are using.) #include #if defined(__LIBCOMO__) // Comeau STL: #define BOOST_STDLIB_CONFIG "boost/config/stdlib/libcomo.hpp" #elif defined(__STD_RWCOMPILER_H__) || defined(_RWSTD_VER) // Rogue Wave library: # define BOOST_STDLIB_CONFIG "boost/config/stdlib/roguewave.hpp" #elif defined(_LIBCPP_VERSION) // libc++ # define BOOST_STDLIB_CONFIG "boost/config/stdlib/libcpp.hpp" #elif defined(__GLIBCPP__) || defined(__GLIBCXX__) // GNU libstdc++ 3 # define BOOST_STDLIB_CONFIG "boost/config/stdlib/libstdcpp3.hpp" #elif defined(__STL_CONFIG_H) // generic SGI STL # define BOOST_STDLIB_CONFIG "boost/config/stdlib/sgi.hpp" #elif defined(__MSL_CPP__) // MSL standard lib: # define BOOST_STDLIB_CONFIG "boost/config/stdlib/msl.hpp" #elif defined(__IBMCPP__) // take the default VACPP std lib # define BOOST_STDLIB_CONFIG "boost/config/stdlib/vacpp.hpp" #elif defined(MSIPL_COMPILE_H) // Modena C++ standard library # define BOOST_STDLIB_CONFIG "boost/config/stdlib/modena.hpp" #elif (defined(_YVALS) && !defined(__IBMCPP__)) || defined(_CPPLIB_VER) // Dinkumware Library (this has to appear after any possible replacement libraries): # define BOOST_STDLIB_CONFIG "boost/config/stdlib/dinkumware.hpp" #elif defined (BOOST_ASSERT_CONFIG) // this must come last - generate an error if we don't // recognise the library: # error "Unknown standard library - please configure and report the results to boost.org" #endif #endif madp-0.4/src/boost/boost/config/PaxHeaders.5405/abi_suffix.hpp0000644000000000000000000000007312717644140021122 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.041552917 madp-0.4/src/boost/boost/config/abi_suffix.hpp0000664000372100037210000000141512717644140021753 0ustar00fransfrans00000000000000// abi_sufffix header -------------------------------------------------------// // (c) Copyright John Maddock 2003 // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // This header should be #included AFTER code that was preceded by a #include // . #ifndef BOOST_CONFIG_ABI_PREFIX_HPP # error Header boost/config/abi_suffix.hpp must only be used after boost/config/abi_prefix.hpp #else # undef BOOST_CONFIG_ABI_PREFIX_HPP #endif // the suffix header occurs after all of our code: #ifdef BOOST_HAS_ABI_HEADERS # include BOOST_ABI_SUFFIX #endif #if defined( __BORLANDC__ ) #pragma nopushoptwarn #endif madp-0.4/src/boost/boost/config/PaxHeaders.5405/stdlib0000644000000000000000000000007412717644140017477 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/config/stdlib/0000775000372100037210000000000012717644140020403 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/config/stdlib/PaxHeaders.5405/libstdcpp3.hpp0000644000000000000000000000007312717644140022333 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/config/stdlib/libstdcpp3.hpp0000664000372100037210000001402412717644140023164 0ustar00fransfrans00000000000000// (C) Copyright John Maddock 2001. // (C) Copyright Jens Maurer 2001. // Use, modification and distribution are subject to the // Boost Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // See http://www.boost.org for most recent version. // config for libstdc++ v3 // not much to go in here: #define BOOST_GNU_STDLIB 1 #ifdef __GLIBCXX__ #define BOOST_STDLIB "GNU libstdc++ version " BOOST_STRINGIZE(__GLIBCXX__) #else #define BOOST_STDLIB "GNU libstdc++ version " BOOST_STRINGIZE(__GLIBCPP__) #endif #if !defined(_GLIBCPP_USE_WCHAR_T) && !defined(_GLIBCXX_USE_WCHAR_T) # define BOOST_NO_CWCHAR # define BOOST_NO_CWCTYPE # define BOOST_NO_STD_WSTRING # define BOOST_NO_STD_WSTREAMBUF #endif #if defined(__osf__) && !defined(_REENTRANT) \ && ( defined(_GLIBCXX_HAVE_GTHR_DEFAULT) || defined(_GLIBCPP_HAVE_GTHR_DEFAULT) ) // GCC 3 on Tru64 forces the definition of _REENTRANT when any std lib header // file is included, therefore for consistency we define it here as well. # define _REENTRANT #endif #ifdef __GLIBCXX__ // gcc 3.4 and greater: # if defined(_GLIBCXX_HAVE_GTHR_DEFAULT) \ || defined(_GLIBCXX__PTHREADS) \ || defined(_GLIBCXX_HAS_GTHREADS) \ || defined(_WIN32) \ || defined(_AIX) // // If the std lib has thread support turned on, then turn it on in Boost // as well. We do this because some gcc-3.4 std lib headers define _REENTANT // while others do not... // # define BOOST_HAS_THREADS # else # define BOOST_DISABLE_THREADS # endif #elif defined(__GLIBCPP__) \ && !defined(_GLIBCPP_HAVE_GTHR_DEFAULT) \ && !defined(_GLIBCPP__PTHREADS) // disable thread support if the std lib was built single threaded: # define BOOST_DISABLE_THREADS #endif #if (defined(linux) || defined(__linux) || defined(__linux__)) && defined(__arm__) && defined(_GLIBCPP_HAVE_GTHR_DEFAULT) // linux on arm apparently doesn't define _REENTRANT // so just turn on threading support whenever the std lib is thread safe: # define BOOST_HAS_THREADS #endif #if !defined(_GLIBCPP_USE_LONG_LONG) \ && !defined(_GLIBCXX_USE_LONG_LONG)\ && defined(BOOST_HAS_LONG_LONG) // May have been set by compiler/*.hpp, but "long long" without library // support is useless. # undef BOOST_HAS_LONG_LONG #endif // Apple doesn't seem to reliably defined a *unix* macro #if !defined(CYGWIN) && ( defined(__unix__) \ || defined(__unix) \ || defined(unix) \ || defined(__APPLE__) \ || defined(__APPLE) \ || defined(APPLE)) # include #endif #if defined(__GLIBCXX__) || (defined(__GLIBCPP__) && __GLIBCPP__>=20020514) // GCC >= 3.1.0 # define BOOST_STD_EXTENSION_NAMESPACE __gnu_cxx # define BOOST_HAS_SLIST # define BOOST_HAS_HASH # define BOOST_SLIST_HEADER # if !defined(__GNUC__) || __GNUC__ < 4 || (__GNUC__ == 4 && __GNUC_MINOR__ < 3) # define BOOST_HASH_SET_HEADER # define BOOST_HASH_MAP_HEADER # else # define BOOST_HASH_SET_HEADER # define BOOST_HASH_MAP_HEADER # endif #endif // stdlibc++ C++0x support is detected via __GNUC__, __GNUC_MINOR__, and possibly // __GNUC_PATCHLEVEL__ at the suggestion of Jonathan Wakely, one of the stdlibc++ // developers. He also commented: // // "I'm not sure how useful __GLIBCXX__ is for your purposes, for instance in // GCC 4.2.4 it is set to 20080519 but in GCC 4.3.0 it is set to 20080305. // Although 4.3.0 was released earlier than 4.2.4, it has better C++0x support // than any release in the 4.2 series." // // Another resource for understanding stdlibc++ features is: // http://gcc.gnu.org/onlinedocs/libstdc++/manual/status.html#manual.intro.status.standard.200x // C++0x headers in GCC 4.3.0 and later // #if __GNUC__ < 4 || (__GNUC__ == 4 && __GNUC_MINOR__ < 3) || !defined(__GXX_EXPERIMENTAL_CXX0X__) # define BOOST_NO_CXX11_HDR_ARRAY # define BOOST_NO_CXX11_HDR_REGEX # define BOOST_NO_CXX11_HDR_TUPLE # define BOOST_NO_CXX11_HDR_UNORDERED_MAP # define BOOST_NO_CXX11_HDR_UNORDERED_SET # define BOOST_NO_CXX11_HDR_FUNCTIONAL #endif // C++0x headers in GCC 4.4.0 and later // #if __GNUC__ < 4 || (__GNUC__ == 4 && __GNUC_MINOR__ < 4) || !defined(__GXX_EXPERIMENTAL_CXX0X__) # define BOOST_NO_CXX11_HDR_CONDITION_VARIABLE # define BOOST_NO_CXX11_HDR_FORWARD_LIST # define BOOST_NO_CXX11_HDR_INITIALIZER_LIST # define BOOST_NO_CXX11_HDR_MUTEX # define BOOST_NO_CXX11_HDR_RATIO # define BOOST_NO_CXX11_HDR_SYSTEM_ERROR # define BOOST_NO_CXX11_SMART_PTR #else # define BOOST_HAS_TR1_COMPLEX_INVERSE_TRIG # define BOOST_HAS_TR1_COMPLEX_OVERLOADS #endif #if (!defined(_GLIBCXX_HAS_GTHREADS) || !defined(_GLIBCXX_USE_C99_STDINT_TR1)) && (!defined(BOOST_NO_CXX11_HDR_CONDITION_VARIABLE) || !defined(BOOST_NO_CXX11_HDR_MUTEX)) # define BOOST_NO_CXX11_HDR_CONDITION_VARIABLE # define BOOST_NO_CXX11_HDR_MUTEX #endif // C++0x features in GCC 4.5.0 and later // #if __GNUC__ < 4 || (__GNUC__ == 4 && __GNUC_MINOR__ < 5) || !defined(__GXX_EXPERIMENTAL_CXX0X__) # define BOOST_NO_CXX11_NUMERIC_LIMITS # define BOOST_NO_CXX11_HDR_FUTURE # define BOOST_NO_CXX11_HDR_RANDOM #endif // C++0x features in GCC 4.6.0 and later // #if __GNUC__ < 4 || (__GNUC__ == 4 && __GNUC_MINOR__ < 6) || !defined(__GXX_EXPERIMENTAL_CXX0X__) # define BOOST_NO_CXX11_HDR_TYPEINDEX #endif // C++0x features in GCC 4.7.0 and later // #if __GNUC__ < 4 || (__GNUC__ == 4 && __GNUC_MINOR__ < 7) || !defined(__GXX_EXPERIMENTAL_CXX0X__) // Note that although existed prior to 4.7, "stead_clock" is spelled "monotonic_clock" // so 4.7.0 is the first truely conforming one. # define BOOST_NO_CXX11_HDR_CHRONO # define BOOST_NO_CXX11_ALLOCATOR #endif // C++0x headers not yet (fully!) implemented // # define BOOST_NO_CXX11_HDR_THREAD # define BOOST_NO_CXX11_HDR_TYPE_TRAITS # define BOOST_NO_CXX11_HDR_CODECVT # define BOOST_NO_CXX11_ATOMIC_SMART_PTR // --- end --- madp-0.4/src/boost/boost/config/PaxHeaders.5405/auto_link.hpp0000644000000000000000000000007312717644140020770 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/config/auto_link.hpp0000664000372100037210000003404612717644140021627 0ustar00fransfrans00000000000000// (C) Copyright John Maddock 2003. // Use, modification and distribution are subject to the // Boost Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) /* * LOCATION: see http://www.boost.org for most recent version. * FILE auto_link.hpp * VERSION see * DESCRIPTION: Automatic library inclusion for Borland/Microsoft compilers. */ /************************************************************************* USAGE: ~~~~~~ Before including this header you must define one or more of define the following macros: BOOST_LIB_NAME: Required: A string containing the basename of the library, for example boost_regex. BOOST_LIB_TOOLSET: Optional: the base name of the toolset. BOOST_DYN_LINK: Optional: when set link to dll rather than static library. BOOST_LIB_DIAGNOSTIC: Optional: when set the header will print out the name of the library selected (useful for debugging). BOOST_AUTO_LINK_NOMANGLE: Specifies that we should link to BOOST_LIB_NAME.lib, rather than a mangled-name version. BOOST_AUTO_LINK_TAGGED: Specifies that we link to libraries built with the --layout=tagged option. This is essentially the same as the default name-mangled version, but without the compiler name and version, or the Boost version. Just the build options. These macros will be undef'ed at the end of the header, further this header has no include guards - so be sure to include it only once from your library! Algorithm: ~~~~~~~~~~ Libraries for Borland and Microsoft compilers are automatically selected here, the name of the lib is selected according to the following formula: BOOST_LIB_PREFIX + BOOST_LIB_NAME + "_" + BOOST_LIB_TOOLSET + BOOST_LIB_THREAD_OPT + BOOST_LIB_RT_OPT "-" + BOOST_LIB_VERSION These are defined as: BOOST_LIB_PREFIX: "lib" for static libraries otherwise "". BOOST_LIB_NAME: The base name of the lib ( for example boost_regex). BOOST_LIB_TOOLSET: The compiler toolset name (vc6, vc7, bcb5 etc). BOOST_LIB_THREAD_OPT: "-mt" for multithread builds, otherwise nothing. BOOST_LIB_RT_OPT: A suffix that indicates the runtime library used, contains one or more of the following letters after a hyphen: s static runtime (dynamic if not present). g debug/diagnostic runtime (release if not present). y Python debug/diagnostic runtime (release if not present). d debug build (release if not present). p STLport build. n STLport build without its IOStreams. BOOST_LIB_VERSION: The Boost version, in the form x_y, for Boost version x.y. ***************************************************************************/ #ifdef __cplusplus # ifndef BOOST_CONFIG_HPP # include # endif #elif defined(_MSC_VER) && !defined(__MWERKS__) && !defined(__EDG_VERSION__) // // C language compatability (no, honestly) // # define BOOST_MSVC _MSC_VER # define BOOST_STRINGIZE(X) BOOST_DO_STRINGIZE(X) # define BOOST_DO_STRINGIZE(X) #X #endif // // Only include what follows for known and supported compilers: // #if defined(BOOST_MSVC) \ || defined(__BORLANDC__) \ || (defined(__MWERKS__) && defined(_WIN32) && (__MWERKS__ >= 0x3000)) \ || (defined(__ICL) && defined(_MSC_EXTENSIONS) && (_MSC_VER >= 1200)) #ifndef BOOST_VERSION_HPP # include #endif #ifndef BOOST_LIB_NAME # error "Macro BOOST_LIB_NAME not set (internal error)" #endif // // error check: // #if defined(__MSVC_RUNTIME_CHECKS) && !defined(_DEBUG) # pragma message("Using the /RTC option without specifying a debug runtime will lead to linker errors") # pragma message("Hint: go to the code generation options and switch to one of the debugging runtimes") # error "Incompatible build options" #endif // // select toolset if not defined already: // #ifndef BOOST_LIB_TOOLSET # if defined(BOOST_MSVC) && (BOOST_MSVC < 1200) // Note: no compilers before 1200 are supported # elif defined(BOOST_MSVC) && (BOOST_MSVC < 1300) # ifdef UNDER_CE // eVC4: # define BOOST_LIB_TOOLSET "evc4" # else // vc6: # define BOOST_LIB_TOOLSET "vc6" # endif # elif defined(BOOST_MSVC) && (BOOST_MSVC < 1310) // vc7: # define BOOST_LIB_TOOLSET "vc7" # elif defined(BOOST_MSVC) && (BOOST_MSVC < 1400) // vc71: # define BOOST_LIB_TOOLSET "vc71" # elif defined(BOOST_MSVC) && (BOOST_MSVC < 1500) // vc80: # define BOOST_LIB_TOOLSET "vc80" # elif defined(BOOST_MSVC) && (BOOST_MSVC < 1600) // vc90: # define BOOST_LIB_TOOLSET "vc90" # elif defined(BOOST_MSVC) && (BOOST_MSVC < 1700) // vc10: # define BOOST_LIB_TOOLSET "vc100" # elif defined(BOOST_MSVC) && (BOOST_MSVC < 1800) // vc11: # define BOOST_LIB_TOOLSET "vc110" # elif defined(BOOST_MSVC) // vc12: # define BOOST_LIB_TOOLSET "vc120" # elif defined(__BORLANDC__) // CBuilder 6: # define BOOST_LIB_TOOLSET "bcb" # elif defined(__ICL) // Intel C++, no version number: # define BOOST_LIB_TOOLSET "iw" # elif defined(__MWERKS__) && (__MWERKS__ <= 0x31FF ) // Metrowerks CodeWarrior 8.x # define BOOST_LIB_TOOLSET "cw8" # elif defined(__MWERKS__) && (__MWERKS__ <= 0x32FF ) // Metrowerks CodeWarrior 9.x # define BOOST_LIB_TOOLSET "cw9" # endif #endif // BOOST_LIB_TOOLSET // // select thread opt: // #if defined(_MT) || defined(__MT__) # define BOOST_LIB_THREAD_OPT "-mt" #else # define BOOST_LIB_THREAD_OPT #endif #if defined(_MSC_VER) || defined(__MWERKS__) # ifdef _DLL # if (defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION)) && (defined(_STLP_OWN_IOSTREAMS) || defined(__STL_OWN_IOSTREAMS)) # if defined(_DEBUG) && (defined(__STL_DEBUG) || defined(_STLP_DEBUG))\ && defined(BOOST_DEBUG_PYTHON) && defined(BOOST_LINKING_PYTHON) # define BOOST_LIB_RT_OPT "-gydp" # elif defined(_DEBUG) && (defined(__STL_DEBUG) || defined(_STLP_DEBUG)) # define BOOST_LIB_RT_OPT "-gdp" # elif defined(_DEBUG)\ && defined(BOOST_DEBUG_PYTHON) && defined(BOOST_LINKING_PYTHON) # define BOOST_LIB_RT_OPT "-gydp" # pragma message("warning: STLport debug versions are built with /D_STLP_DEBUG=1") # error "Build options aren't compatible with pre-built libraries" # elif defined(_DEBUG) # define BOOST_LIB_RT_OPT "-gdp" # pragma message("warning: STLport debug versions are built with /D_STLP_DEBUG=1") # error "Build options aren't compatible with pre-built libraries" # else # define BOOST_LIB_RT_OPT "-p" # endif # elif defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION) # if defined(_DEBUG) && (defined(__STL_DEBUG) || defined(_STLP_DEBUG))\ && defined(BOOST_DEBUG_PYTHON) && defined(BOOST_LINKING_PYTHON) # define BOOST_LIB_RT_OPT "-gydpn" # elif defined(_DEBUG) && (defined(__STL_DEBUG) || defined(_STLP_DEBUG)) # define BOOST_LIB_RT_OPT "-gdpn" # elif defined(_DEBUG)\ && defined(BOOST_DEBUG_PYTHON) && defined(BOOST_LINKING_PYTHON) # define BOOST_LIB_RT_OPT "-gydpn" # pragma message("warning: STLport debug versions are built with /D_STLP_DEBUG=1") # error "Build options aren't compatible with pre-built libraries" # elif defined(_DEBUG) # define BOOST_LIB_RT_OPT "-gdpn" # pragma message("warning: STLport debug versions are built with /D_STLP_DEBUG=1") # error "Build options aren't compatible with pre-built libraries" # else # define BOOST_LIB_RT_OPT "-pn" # endif # else # if defined(_DEBUG) && defined(BOOST_DEBUG_PYTHON) && defined(BOOST_LINKING_PYTHON) # define BOOST_LIB_RT_OPT "-gyd" # elif defined(_DEBUG) # define BOOST_LIB_RT_OPT "-gd" # else # define BOOST_LIB_RT_OPT # endif # endif # else # if (defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION)) && (defined(_STLP_OWN_IOSTREAMS) || defined(__STL_OWN_IOSTREAMS)) # if defined(_DEBUG) && (defined(__STL_DEBUG) || defined(_STLP_DEBUG))\ && defined(BOOST_DEBUG_PYTHON) && defined(BOOST_LINKING_PYTHON) # define BOOST_LIB_RT_OPT "-sgydp" # elif defined(_DEBUG) && (defined(__STL_DEBUG) || defined(_STLP_DEBUG)) # define BOOST_LIB_RT_OPT "-sgdp" # elif defined(_DEBUG)\ && defined(BOOST_DEBUG_PYTHON) && defined(BOOST_LINKING_PYTHON) # define BOOST_LIB_RT_OPT "-sgydp" # pragma message("warning: STLport debug versions are built with /D_STLP_DEBUG=1") # error "Build options aren't compatible with pre-built libraries" # elif defined(_DEBUG) # define BOOST_LIB_RT_OPT "-sgdp" # pragma message("warning: STLport debug versions are built with /D_STLP_DEBUG=1") # error "Build options aren't compatible with pre-built libraries" # else # define BOOST_LIB_RT_OPT "-sp" # endif # elif defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION) # if defined(_DEBUG) && (defined(__STL_DEBUG) || defined(_STLP_DEBUG))\ && defined(BOOST_DEBUG_PYTHON) && defined(BOOST_LINKING_PYTHON) # define BOOST_LIB_RT_OPT "-sgydpn" # elif defined(_DEBUG) && (defined(__STL_DEBUG) || defined(_STLP_DEBUG)) # define BOOST_LIB_RT_OPT "-sgdpn" # elif defined(_DEBUG)\ && defined(BOOST_DEBUG_PYTHON) && defined(BOOST_LINKING_PYTHON) # define BOOST_LIB_RT_OPT "-sgydpn" # pragma message("warning: STLport debug versions are built with /D_STLP_DEBUG=1") # error "Build options aren't compatible with pre-built libraries" # elif defined(_DEBUG) # define BOOST_LIB_RT_OPT "-sgdpn" # pragma message("warning: STLport debug versions are built with /D_STLP_DEBUG=1") # error "Build options aren't compatible with pre-built libraries" # else # define BOOST_LIB_RT_OPT "-spn" # endif # else # if defined(_DEBUG)\ && defined(BOOST_DEBUG_PYTHON) && defined(BOOST_LINKING_PYTHON) # define BOOST_LIB_RT_OPT "-sgyd" # elif defined(_DEBUG) # define BOOST_LIB_RT_OPT "-sgd" # else # define BOOST_LIB_RT_OPT "-s" # endif # endif # endif #elif defined(__BORLANDC__) // // figure out whether we want the debug builds or not: // #if __BORLANDC__ > 0x561 #pragma defineonoption BOOST_BORLAND_DEBUG -v #endif // // sanity check: // #if defined(__STL_DEBUG) || defined(_STLP_DEBUG) #error "Pre-built versions of the Boost libraries are not provided in STLport-debug form" #endif # ifdef _RTLDLL # if defined(BOOST_BORLAND_DEBUG)\ && defined(BOOST_DEBUG_PYTHON) && defined(BOOST_LINKING_PYTHON) # define BOOST_LIB_RT_OPT "-yd" # elif defined(BOOST_BORLAND_DEBUG) # define BOOST_LIB_RT_OPT "-d" # elif defined(BOOST_DEBUG_PYTHON) && defined(BOOST_LINKING_PYTHON) # define BOOST_LIB_RT_OPT -y # else # define BOOST_LIB_RT_OPT # endif # else # if defined(BOOST_BORLAND_DEBUG)\ && defined(BOOST_DEBUG_PYTHON) && defined(BOOST_LINKING_PYTHON) # define BOOST_LIB_RT_OPT "-syd" # elif defined(BOOST_BORLAND_DEBUG) # define BOOST_LIB_RT_OPT "-sd" # elif defined(BOOST_DEBUG_PYTHON) && defined(BOOST_LINKING_PYTHON) # define BOOST_LIB_RT_OPT "-sy" # else # define BOOST_LIB_RT_OPT "-s" # endif # endif #endif // // select linkage opt: // #if (defined(_DLL) || defined(_RTLDLL)) && defined(BOOST_DYN_LINK) # define BOOST_LIB_PREFIX #elif defined(BOOST_DYN_LINK) # error "Mixing a dll boost library with a static runtime is a really bad idea..." #else # define BOOST_LIB_PREFIX "lib" #endif // // now include the lib: // #if defined(BOOST_LIB_NAME) \ && defined(BOOST_LIB_PREFIX) \ && defined(BOOST_LIB_TOOLSET) \ && defined(BOOST_LIB_THREAD_OPT) \ && defined(BOOST_LIB_RT_OPT) \ && defined(BOOST_LIB_VERSION) #ifdef BOOST_AUTO_LINK_TAGGED # pragma comment(lib, BOOST_LIB_PREFIX BOOST_STRINGIZE(BOOST_LIB_NAME) BOOST_LIB_THREAD_OPT BOOST_LIB_RT_OPT ".lib") # ifdef BOOST_LIB_DIAGNOSTIC # pragma message ("Linking to lib file: " BOOST_LIB_PREFIX BOOST_STRINGIZE(BOOST_LIB_NAME) BOOST_LIB_THREAD_OPT BOOST_LIB_RT_OPT ".lib") # endif #elif defined(BOOST_AUTO_LINK_NOMANGLE) # pragma comment(lib, BOOST_STRINGIZE(BOOST_LIB_NAME) ".lib") # ifdef BOOST_LIB_DIAGNOSTIC # pragma message ("Linking to lib file: " BOOST_STRINGIZE(BOOST_LIB_NAME) ".lib") # endif #else # pragma comment(lib, BOOST_LIB_PREFIX BOOST_STRINGIZE(BOOST_LIB_NAME) "-" BOOST_LIB_TOOLSET BOOST_LIB_THREAD_OPT BOOST_LIB_RT_OPT "-" BOOST_LIB_VERSION ".lib") # ifdef BOOST_LIB_DIAGNOSTIC # pragma message ("Linking to lib file: " BOOST_LIB_PREFIX BOOST_STRINGIZE(BOOST_LIB_NAME) "-" BOOST_LIB_TOOLSET BOOST_LIB_THREAD_OPT BOOST_LIB_RT_OPT "-" BOOST_LIB_VERSION ".lib") # endif #endif #else # error "some required macros where not defined (internal logic error)." #endif #endif // _MSC_VER || __BORLANDC__ // // finally undef any macros we may have set: // #ifdef BOOST_LIB_PREFIX # undef BOOST_LIB_PREFIX #endif #if defined(BOOST_LIB_NAME) # undef BOOST_LIB_NAME #endif // Don't undef this one: it can be set by the user and should be the // same for all libraries: //#if defined(BOOST_LIB_TOOLSET) //# undef BOOST_LIB_TOOLSET //#endif #if defined(BOOST_LIB_THREAD_OPT) # undef BOOST_LIB_THREAD_OPT #endif #if defined(BOOST_LIB_RT_OPT) # undef BOOST_LIB_RT_OPT #endif #if defined(BOOST_LIB_LINK_OPT) # undef BOOST_LIB_LINK_OPT #endif #if defined(BOOST_LIB_DEBUG_OPT) # undef BOOST_LIB_DEBUG_OPT #endif #if defined(BOOST_DYN_LINK) # undef BOOST_DYN_LINK #endif madp-0.4/src/boost/boost/config/PaxHeaders.5405/compiler0000644000000000000000000000007412717644140020030 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/config/compiler/0000775000372100037210000000000012717644140020734 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/config/compiler/PaxHeaders.5405/gcc.hpp0000644000000000000000000000007312717644140021351 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/config/compiler/gcc.hpp0000664000372100037210000002131512717644140022203 0ustar00fransfrans00000000000000// (C) Copyright John Maddock 2001 - 2003. // (C) Copyright Darin Adler 2001 - 2002. // (C) Copyright Jens Maurer 2001 - 2002. // (C) Copyright Beman Dawes 2001 - 2003. // (C) Copyright Douglas Gregor 2002. // (C) Copyright David Abrahams 2002 - 2003. // (C) Copyright Synge Todo 2003. // Use, modification and distribution are subject to the // Boost Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // See http://www.boost.org for most recent version. // GNU C++ compiler setup. // // Define BOOST_GCC so we know this is "real" GCC and not some pretender: // #if !defined(__CUDACC__) #define BOOST_GCC (__GNUC__ * 10000 + __GNUC_MINOR__ * 100 + __GNUC_PATCHLEVEL__) #endif #if __GNUC__ == 3 # if defined (__PATHSCALE__) # define BOOST_NO_TWO_PHASE_NAME_LOOKUP # define BOOST_NO_IS_ABSTRACT # endif # if __GNUC_MINOR__ < 4 # define BOOST_NO_IS_ABSTRACT # endif # define BOOST_NO_CXX11_EXTERN_TEMPLATE #endif #if __GNUC__ < 4 // // All problems to gcc-3.x and earlier here: // #define BOOST_NO_TWO_PHASE_NAME_LOOKUP # ifdef __OPEN64__ # define BOOST_NO_IS_ABSTRACT # endif #endif // GCC prior to 3.4 had #pragma once too but it didn't work well with filesystem links #if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4) #define BOOST_HAS_PRAGMA_ONCE #endif #if __GNUC__ < 4 || ( __GNUC__ == 4 && __GNUC_MINOR__ < 4 ) // Previous versions of GCC did not completely implement value-initialization: // GCC Bug 30111, "Value-initialization of POD base class doesn't initialize // members", reported by Jonathan Wakely in 2006, // http://gcc.gnu.org/bugzilla/show_bug.cgi?id=30111 (fixed for GCC 4.4) // GCC Bug 33916, "Default constructor fails to initialize array members", // reported by Michael Elizabeth Chastain in 2007, // http://gcc.gnu.org/bugzilla/show_bug.cgi?id=33916 (fixed for GCC 4.2.4) // See also: http://www.boost.org/libs/utility/value_init.htm#compiler_issues #define BOOST_NO_COMPLETE_VALUE_INITIALIZATION #endif #if !defined(__EXCEPTIONS) && !defined(BOOST_NO_EXCEPTIONS) # define BOOST_NO_EXCEPTIONS #endif // // Threading support: Turn this on unconditionally here (except for // those platforms where we can know for sure). It will get turned off again // later if no threading API is detected. // #if !defined(__MINGW32__) && !defined(linux) && !defined(__linux) && !defined(__linux__) # define BOOST_HAS_THREADS #endif // // gcc has "long long" // #define BOOST_HAS_LONG_LONG // // gcc implements the named return value optimization since version 3.1 // #define BOOST_HAS_NRVO // Branch prediction hints #define BOOST_LIKELY(x) __builtin_expect(x, 1) #define BOOST_UNLIKELY(x) __builtin_expect(x, 0) // // Dynamic shared object (DSO) and dynamic-link library (DLL) support // #if __GNUC__ >= 4 # if (defined(_WIN32) || defined(__WIN32__) || defined(WIN32)) && !defined(__CYGWIN__) // All Win32 development environments, including 64-bit Windows and MinGW, define // _WIN32 or one of its variant spellings. Note that Cygwin is a POSIX environment, // so does not define _WIN32 or its variants. # define BOOST_HAS_DECLSPEC # define BOOST_SYMBOL_EXPORT __attribute__((__dllexport__)) # define BOOST_SYMBOL_IMPORT __attribute__((__dllimport__)) # else # define BOOST_SYMBOL_EXPORT __attribute__((__visibility__("default"))) # define BOOST_SYMBOL_IMPORT # endif # define BOOST_SYMBOL_VISIBLE __attribute__((__visibility__("default"))) #else // config/platform/win32.hpp will define BOOST_SYMBOL_EXPORT, etc., unless already defined # define BOOST_SYMBOL_EXPORT #endif // // RTTI and typeinfo detection is possible post gcc-4.3: // #if __GNUC__ * 100 + __GNUC_MINOR__ >= 403 # ifndef __GXX_RTTI # ifndef BOOST_NO_TYPEID # define BOOST_NO_TYPEID # endif # ifndef BOOST_NO_RTTI # define BOOST_NO_RTTI # endif # endif #endif // // Recent GCC versions have __int128 when in 64-bit mode. // // We disable this if the compiler is really nvcc as it // doesn't actually support __int128 as of CUDA_VERSION=5000 // even though it defines __SIZEOF_INT128__. // See https://svn.boost.org/trac/boost/ticket/8048 // Only re-enable this for nvcc if you're absolutely sure // of the circumstances under which it's supported: // #if defined(__SIZEOF_INT128__) && !defined(__CUDACC__) # define BOOST_HAS_INT128 #endif // C++0x features in 4.3.n and later // #if (__GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ > 2)) && defined(__GXX_EXPERIMENTAL_CXX0X__) // C++0x features are only enabled when -std=c++0x or -std=gnu++0x are // passed on the command line, which in turn defines // __GXX_EXPERIMENTAL_CXX0X__. # define BOOST_HAS_DECLTYPE # define BOOST_HAS_RVALUE_REFS # define BOOST_HAS_STATIC_ASSERT # define BOOST_HAS_VARIADIC_TMPL #else # define BOOST_NO_CXX11_DECLTYPE # define BOOST_NO_CXX11_FUNCTION_TEMPLATE_DEFAULT_ARGS # define BOOST_NO_CXX11_RVALUE_REFERENCES # define BOOST_NO_CXX11_STATIC_ASSERT // Variadic templates compiler: // http://www.generic-programming.org/~dgregor/cpp/variadic-templates.html # if defined(__VARIADIC_TEMPLATES) || (__GNUC__ > 4) || ((__GNUC__ == 4) && (__GNUC_MINOR__ >= 4) && defined(__GXX_EXPERIMENTAL_CXX0X__)) # define BOOST_HAS_VARIADIC_TMPL # else # define BOOST_NO_CXX11_VARIADIC_TEMPLATES # endif #endif // C++0x features in 4.4.n and later // #if __GNUC__ < 4 || (__GNUC__ == 4 && __GNUC_MINOR__ < 4) || !defined(__GXX_EXPERIMENTAL_CXX0X__) # define BOOST_NO_CXX11_AUTO_DECLARATIONS # define BOOST_NO_CXX11_AUTO_MULTIDECLARATIONS # define BOOST_NO_CXX11_CHAR16_T # define BOOST_NO_CXX11_CHAR32_T # define BOOST_NO_CXX11_HDR_INITIALIZER_LIST # define BOOST_NO_CXX11_DEFAULTED_FUNCTIONS # define BOOST_NO_CXX11_DELETED_FUNCTIONS # define BOOST_NO_CXX11_TRAILING_RESULT_TYPES # define BOOST_NO_CXX11_INLINE_NAMESPACES #endif #if __GNUC__ < 4 || (__GNUC__ == 4 && __GNUC_MINOR__ < 5) # define BOOST_NO_SFINAE_EXPR #endif // GCC 4.5 forbids declaration of defaulted functions in private or protected sections #if !defined(BOOST_NO_CXX11_DEFAULTED_FUNCTIONS) && (__GNUC__ == 4 && __GNUC_MINOR__ <= 5) # define BOOST_NO_CXX11_NON_PUBLIC_DEFAULTED_FUNCTIONS #endif // C++0x features in 4.5.0 and later // #if __GNUC__ < 4 || (__GNUC__ == 4 && __GNUC_MINOR__ < 5) || !defined(__GXX_EXPERIMENTAL_CXX0X__) # define BOOST_NO_CXX11_EXPLICIT_CONVERSION_OPERATORS # define BOOST_NO_CXX11_LAMBDAS # define BOOST_NO_CXX11_LOCAL_CLASS_TEMPLATE_PARAMETERS # define BOOST_NO_CXX11_RAW_LITERALS # define BOOST_NO_CXX11_UNICODE_LITERALS #endif // C++0x features in 4.5.1 and later // #if (__GNUC__*10000 + __GNUC_MINOR__*100 + __GNUC_PATCHLEVEL__ < 40501) || !defined(__GXX_EXPERIMENTAL_CXX0X__) // scoped enums have a serious bug in 4.4.0, so define BOOST_NO_CXX11_SCOPED_ENUMS before 4.5.1 // See http://gcc.gnu.org/bugzilla/show_bug.cgi?id=38064 # define BOOST_NO_CXX11_SCOPED_ENUMS #endif // C++0x features in 4.6.n and later // #if __GNUC__ < 4 || (__GNUC__ == 4 && __GNUC_MINOR__ < 6) || !defined(__GXX_EXPERIMENTAL_CXX0X__) #define BOOST_NO_CXX11_CONSTEXPR #define BOOST_NO_CXX11_NOEXCEPT #define BOOST_NO_CXX11_NULLPTR #define BOOST_NO_CXX11_RANGE_BASED_FOR #define BOOST_NO_CXX11_UNIFIED_INITIALIZATION_SYNTAX #endif // C++0x features in 4.7.n and later // #if __GNUC__ < 4 || (__GNUC__ == 4 && __GNUC_MINOR__ < 7) || !defined(__GXX_EXPERIMENTAL_CXX0X__) # define BOOST_NO_CXX11_TEMPLATE_ALIASES # define BOOST_NO_CXX11_USER_DEFINED_LITERALS #endif // C++0x features in 4.8.n and later // #if __GNUC__ < 4 || (__GNUC__ == 4 && __GNUC_MINOR__ < 8) || !defined(__GXX_EXPERIMENTAL_CXX0X__) # define BOOST_NO_CXX11_ALIGNAS #endif // C++0x features in 4.8.1 and later // #if (__GNUC__*10000 + __GNUC_MINOR__*100 + __GNUC_PATCHLEVEL__ < 40801) || !defined(__GXX_EXPERIMENTAL_CXX0X__) # define BOOST_NO_CXX11_DECLTYPE_N3276 #endif #ifndef BOOST_COMPILER # define BOOST_COMPILER "GNU C++ version " __VERSION__ #endif // ConceptGCC compiler: // http://www.generic-programming.org/software/ConceptGCC/ #ifdef __GXX_CONCEPTS__ # define BOOST_HAS_CONCEPTS # define BOOST_COMPILER "ConceptGCC version " __VERSION__ #endif // versions check: // we don't know gcc prior to version 3.30: #if (__GNUC__ < 3) || (__GNUC__ == 3 && (__GNUC_MINOR__ < 3)) # error "Compiler not configured - please reconfigure" #endif // // last known and checked version is 4.6 (Pre-release): #if (__GNUC__ > 4) || ((__GNUC__ == 4) && (__GNUC_MINOR__ > 6)) # if defined(BOOST_ASSERT_CONFIG) # error "Unknown compiler version - please run the configure tests and report the results" # else // we don't emit warnings here anymore since there are no defect macros defined for // gcc post 3.4, so any failures are gcc regressions... //# warning "Unknown compiler version - please run the configure tests and report the results" # endif #endif madp-0.4/src/boost/boost/config/PaxHeaders.5405/suffix.hpp0000644000000000000000000000007312717644140020307 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/config/suffix.hpp0000664000372100037210000010121712717644140021141 0ustar00fransfrans00000000000000// Boost config.hpp configuration header file ------------------------------// // boostinspect:ndprecated_macros -- tell the inspect tool to ignore this file // Copyright (c) 2001-2003 John Maddock // Copyright (c) 2001 Darin Adler // Copyright (c) 2001 Peter Dimov // Copyright (c) 2002 Bill Kempf // Copyright (c) 2002 Jens Maurer // Copyright (c) 2002-2003 David Abrahams // Copyright (c) 2003 Gennaro Prota // Copyright (c) 2003 Eric Friedman // Copyright (c) 2010 Eric Jourdanneau, Joel Falcou // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // See http://www.boost.org/ for most recent version. // Boost config.hpp policy and rationale documentation has been moved to // http://www.boost.org/libs/config/ // // This file is intended to be stable, and relatively unchanging. // It should contain boilerplate code only - no compiler specific // code unless it is unavoidable - no changes unless unavoidable. #ifndef BOOST_CONFIG_SUFFIX_HPP #define BOOST_CONFIG_SUFFIX_HPP #if defined(__GNUC__) && (__GNUC__ >= 4) // // Some GCC-4.x versions issue warnings even when __extension__ is used, // so use this as a workaround: // #pragma GCC system_header #endif // // ensure that visibility macros are always defined, thus symplifying use // #ifndef BOOST_SYMBOL_EXPORT # define BOOST_SYMBOL_EXPORT #endif #ifndef BOOST_SYMBOL_IMPORT # define BOOST_SYMBOL_IMPORT #endif #ifndef BOOST_SYMBOL_VISIBLE # define BOOST_SYMBOL_VISIBLE #endif // // look for long long by looking for the appropriate macros in . // Note that we use limits.h rather than climits for maximal portability, // remember that since these just declare a bunch of macros, there should be // no namespace issues from this. // #if !defined(BOOST_HAS_LONG_LONG) && !defined(BOOST_NO_LONG_LONG) \ && !defined(BOOST_MSVC) && !defined(__BORLANDC__) # include # if (defined(ULLONG_MAX) || defined(ULONG_LONG_MAX) || defined(ULONGLONG_MAX)) # define BOOST_HAS_LONG_LONG # else # define BOOST_NO_LONG_LONG # endif #endif // GCC 3.x will clean up all of those nasty macro definitions that // BOOST_NO_CTYPE_FUNCTIONS is intended to help work around, so undefine // it under GCC 3.x. #if defined(__GNUC__) && (__GNUC__ >= 3) && defined(BOOST_NO_CTYPE_FUNCTIONS) # undef BOOST_NO_CTYPE_FUNCTIONS #endif // // Assume any extensions are in namespace std:: unless stated otherwise: // # ifndef BOOST_STD_EXTENSION_NAMESPACE # define BOOST_STD_EXTENSION_NAMESPACE std # endif // // If cv-qualified specializations are not allowed, then neither are cv-void ones: // # if defined(BOOST_NO_CV_SPECIALIZATIONS) \ && !defined(BOOST_NO_CV_VOID_SPECIALIZATIONS) # define BOOST_NO_CV_VOID_SPECIALIZATIONS # endif // // If there is no numeric_limits template, then it can't have any compile time // constants either! // # if defined(BOOST_NO_LIMITS) \ && !defined(BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS) # define BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS # define BOOST_NO_MS_INT64_NUMERIC_LIMITS # define BOOST_NO_LONG_LONG_NUMERIC_LIMITS # endif // // if there is no long long then there is no specialisation // for numeric_limits either: // #if !defined(BOOST_HAS_LONG_LONG) && !defined(BOOST_NO_LONG_LONG_NUMERIC_LIMITS) # define BOOST_NO_LONG_LONG_NUMERIC_LIMITS #endif // // if there is no __int64 then there is no specialisation // for numeric_limits<__int64> either: // #if !defined(BOOST_HAS_MS_INT64) && !defined(BOOST_NO_MS_INT64_NUMERIC_LIMITS) # define BOOST_NO_MS_INT64_NUMERIC_LIMITS #endif // // if member templates are supported then so is the // VC6 subset of member templates: // # if !defined(BOOST_NO_MEMBER_TEMPLATES) \ && !defined(BOOST_MSVC6_MEMBER_TEMPLATES) # define BOOST_MSVC6_MEMBER_TEMPLATES # endif // // Without partial specialization, can't test for partial specialisation bugs: // # if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \ && !defined(BOOST_BCB_PARTIAL_SPECIALIZATION_BUG) # define BOOST_BCB_PARTIAL_SPECIALIZATION_BUG # endif // // Without partial specialization, we can't have array-type partial specialisations: // # if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \ && !defined(BOOST_NO_ARRAY_TYPE_SPECIALIZATIONS) # define BOOST_NO_ARRAY_TYPE_SPECIALIZATIONS # endif // // Without partial specialization, std::iterator_traits can't work: // # if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \ && !defined(BOOST_NO_STD_ITERATOR_TRAITS) # define BOOST_NO_STD_ITERATOR_TRAITS # endif // // Without partial specialization, partial // specialization with default args won't work either: // # if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \ && !defined(BOOST_NO_PARTIAL_SPECIALIZATION_IMPLICIT_DEFAULT_ARGS) # define BOOST_NO_PARTIAL_SPECIALIZATION_IMPLICIT_DEFAULT_ARGS # endif // // Without member template support, we can't have template constructors // in the standard library either: // # if defined(BOOST_NO_MEMBER_TEMPLATES) \ && !defined(BOOST_MSVC6_MEMBER_TEMPLATES) \ && !defined(BOOST_NO_TEMPLATED_ITERATOR_CONSTRUCTORS) # define BOOST_NO_TEMPLATED_ITERATOR_CONSTRUCTORS # endif // // Without member template support, we can't have a conforming // std::allocator template either: // # if defined(BOOST_NO_MEMBER_TEMPLATES) \ && !defined(BOOST_MSVC6_MEMBER_TEMPLATES) \ && !defined(BOOST_NO_STD_ALLOCATOR) # define BOOST_NO_STD_ALLOCATOR # endif // // without ADL support then using declarations will break ADL as well: // #if defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP) && !defined(BOOST_FUNCTION_SCOPE_USING_DECLARATION_BREAKS_ADL) # define BOOST_FUNCTION_SCOPE_USING_DECLARATION_BREAKS_ADL #endif // // Without typeid support we have no dynamic RTTI either: // #if defined(BOOST_NO_TYPEID) && !defined(BOOST_NO_RTTI) # define BOOST_NO_RTTI #endif // // If we have a standard allocator, then we have a partial one as well: // #if !defined(BOOST_NO_STD_ALLOCATOR) # define BOOST_HAS_PARTIAL_STD_ALLOCATOR #endif // // We can't have a working std::use_facet if there is no std::locale: // # if defined(BOOST_NO_STD_LOCALE) && !defined(BOOST_NO_STD_USE_FACET) # define BOOST_NO_STD_USE_FACET # endif // // We can't have a std::messages facet if there is no std::locale: // # if defined(BOOST_NO_STD_LOCALE) && !defined(BOOST_NO_STD_MESSAGES) # define BOOST_NO_STD_MESSAGES # endif // // We can't have a working std::wstreambuf if there is no std::locale: // # if defined(BOOST_NO_STD_LOCALE) && !defined(BOOST_NO_STD_WSTREAMBUF) # define BOOST_NO_STD_WSTREAMBUF # endif // // We can't have a if there is no : // # if defined(BOOST_NO_CWCHAR) && !defined(BOOST_NO_CWCTYPE) # define BOOST_NO_CWCTYPE # endif // // We can't have a swprintf if there is no : // # if defined(BOOST_NO_CWCHAR) && !defined(BOOST_NO_SWPRINTF) # define BOOST_NO_SWPRINTF # endif // // If Win32 support is turned off, then we must turn off // threading support also, unless there is some other // thread API enabled: // #if defined(BOOST_DISABLE_WIN32) && defined(_WIN32) \ && !defined(BOOST_DISABLE_THREADS) && !defined(BOOST_HAS_PTHREADS) # define BOOST_DISABLE_THREADS #endif // // Turn on threading support if the compiler thinks that it's in // multithreaded mode. We put this here because there are only a // limited number of macros that identify this (if there's any missing // from here then add to the appropriate compiler section): // #if (defined(__MT__) || defined(_MT) || defined(_REENTRANT) \ || defined(_PTHREADS) || defined(__APPLE__) || defined(__DragonFly__)) \ && !defined(BOOST_HAS_THREADS) # define BOOST_HAS_THREADS #endif // // Turn threading support off if BOOST_DISABLE_THREADS is defined: // #if defined(BOOST_DISABLE_THREADS) && defined(BOOST_HAS_THREADS) # undef BOOST_HAS_THREADS #endif // // Turn threading support off if we don't recognise the threading API: // #if defined(BOOST_HAS_THREADS) && !defined(BOOST_HAS_PTHREADS)\ && !defined(BOOST_HAS_WINTHREADS) && !defined(BOOST_HAS_BETHREADS)\ && !defined(BOOST_HAS_MPTASKS) # undef BOOST_HAS_THREADS #endif // // Turn threading detail macros off if we don't (want to) use threading // #ifndef BOOST_HAS_THREADS # undef BOOST_HAS_PTHREADS # undef BOOST_HAS_PTHREAD_MUTEXATTR_SETTYPE # undef BOOST_HAS_PTHREAD_YIELD # undef BOOST_HAS_PTHREAD_DELAY_NP # undef BOOST_HAS_WINTHREADS # undef BOOST_HAS_BETHREADS # undef BOOST_HAS_MPTASKS #endif // // If the compiler claims to be C99 conformant, then it had better // have a : // # if defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901) # define BOOST_HAS_STDINT_H # ifndef BOOST_HAS_LOG1P # define BOOST_HAS_LOG1P # endif # ifndef BOOST_HAS_EXPM1 # define BOOST_HAS_EXPM1 # endif # endif // // Define BOOST_NO_SLIST and BOOST_NO_HASH if required. // Note that this is for backwards compatibility only. // # if !defined(BOOST_HAS_SLIST) && !defined(BOOST_NO_SLIST) # define BOOST_NO_SLIST # endif # if !defined(BOOST_HAS_HASH) && !defined(BOOST_NO_HASH) # define BOOST_NO_HASH # endif // // Set BOOST_SLIST_HEADER if not set already: // #if defined(BOOST_HAS_SLIST) && !defined(BOOST_SLIST_HEADER) # define BOOST_SLIST_HEADER #endif // // Set BOOST_HASH_SET_HEADER if not set already: // #if defined(BOOST_HAS_HASH) && !defined(BOOST_HASH_SET_HEADER) # define BOOST_HASH_SET_HEADER #endif // // Set BOOST_HASH_MAP_HEADER if not set already: // #if defined(BOOST_HAS_HASH) && !defined(BOOST_HASH_MAP_HEADER) # define BOOST_HASH_MAP_HEADER #endif // BOOST_HAS_ABI_HEADERS // This macro gets set if we have headers that fix the ABI, // and prevent ODR violations when linking to external libraries: #if defined(BOOST_ABI_PREFIX) && defined(BOOST_ABI_SUFFIX) && !defined(BOOST_HAS_ABI_HEADERS) # define BOOST_HAS_ABI_HEADERS #endif #if defined(BOOST_HAS_ABI_HEADERS) && defined(BOOST_DISABLE_ABI_HEADERS) # undef BOOST_HAS_ABI_HEADERS #endif // BOOST_NO_STDC_NAMESPACE workaround --------------------------------------// // Because std::size_t usage is so common, even in boost headers which do not // otherwise use the C library, the workaround is included here so // that ugly workaround code need not appear in many other boost headers. // NOTE WELL: This is a workaround for non-conforming compilers; // must still be #included in the usual places so that inclusion // works as expected with standard conforming compilers. The resulting // double inclusion of is harmless. # if defined(BOOST_NO_STDC_NAMESPACE) && defined(__cplusplus) # include namespace std { using ::ptrdiff_t; using ::size_t; } # endif // Workaround for the unfortunate min/max macros defined by some platform headers #define BOOST_PREVENT_MACRO_SUBSTITUTION #ifndef BOOST_USING_STD_MIN # define BOOST_USING_STD_MIN() using std::min #endif #ifndef BOOST_USING_STD_MAX # define BOOST_USING_STD_MAX() using std::max #endif // BOOST_NO_STD_MIN_MAX workaround -----------------------------------------// # if defined(BOOST_NO_STD_MIN_MAX) && defined(__cplusplus) namespace std { template inline const _Tp& min BOOST_PREVENT_MACRO_SUBSTITUTION (const _Tp& __a, const _Tp& __b) { return __b < __a ? __b : __a; } template inline const _Tp& max BOOST_PREVENT_MACRO_SUBSTITUTION (const _Tp& __a, const _Tp& __b) { return __a < __b ? __b : __a; } } # endif // BOOST_STATIC_CONSTANT workaround --------------------------------------- // // On compilers which don't allow in-class initialization of static integral // constant members, we must use enums as a workaround if we want the constants // to be available at compile-time. This macro gives us a convenient way to // declare such constants. # ifdef BOOST_NO_INCLASS_MEMBER_INITIALIZATION # define BOOST_STATIC_CONSTANT(type, assignment) enum { assignment } # else # define BOOST_STATIC_CONSTANT(type, assignment) static const type assignment # endif // BOOST_USE_FACET / HAS_FACET workaround ----------------------------------// // When the standard library does not have a conforming std::use_facet there // are various workarounds available, but they differ from library to library. // The same problem occurs with has_facet. // These macros provide a consistent way to access a locale's facets. // Usage: // replace // std::use_facet(loc); // with // BOOST_USE_FACET(Type, loc); // Note do not add a std:: prefix to the front of BOOST_USE_FACET! // Use for BOOST_HAS_FACET is analogous. #if defined(BOOST_NO_STD_USE_FACET) # ifdef BOOST_HAS_TWO_ARG_USE_FACET # define BOOST_USE_FACET(Type, loc) std::use_facet(loc, static_cast(0)) # define BOOST_HAS_FACET(Type, loc) std::has_facet(loc, static_cast(0)) # elif defined(BOOST_HAS_MACRO_USE_FACET) # define BOOST_USE_FACET(Type, loc) std::_USE(loc, Type) # define BOOST_HAS_FACET(Type, loc) std::_HAS(loc, Type) # elif defined(BOOST_HAS_STLP_USE_FACET) # define BOOST_USE_FACET(Type, loc) (*std::_Use_facet(loc)) # define BOOST_HAS_FACET(Type, loc) std::has_facet< Type >(loc) # endif #else # define BOOST_USE_FACET(Type, loc) std::use_facet< Type >(loc) # define BOOST_HAS_FACET(Type, loc) std::has_facet< Type >(loc) #endif // BOOST_NESTED_TEMPLATE workaround ------------------------------------------// // Member templates are supported by some compilers even though they can't use // the A::template member syntax, as a workaround replace: // // typedef typename A::template rebind binder; // // with: // // typedef typename A::BOOST_NESTED_TEMPLATE rebind binder; #ifndef BOOST_NO_MEMBER_TEMPLATE_KEYWORD # define BOOST_NESTED_TEMPLATE template #else # define BOOST_NESTED_TEMPLATE #endif // BOOST_UNREACHABLE_RETURN(x) workaround -------------------------------------// // Normally evaluates to nothing, unless BOOST_NO_UNREACHABLE_RETURN_DETECTION // is defined, in which case it evaluates to return x; Use when you have a return // statement that can never be reached. #ifdef BOOST_NO_UNREACHABLE_RETURN_DETECTION # define BOOST_UNREACHABLE_RETURN(x) return x; #else # define BOOST_UNREACHABLE_RETURN(x) #endif // BOOST_DEDUCED_TYPENAME workaround ------------------------------------------// // // Some compilers don't support the use of `typename' for dependent // types in deduced contexts, e.g. // // template void f(T, typename T::type); // ^^^^^^^^ // Replace these declarations with: // // template void f(T, BOOST_DEDUCED_TYPENAME T::type); #ifndef BOOST_NO_DEDUCED_TYPENAME # define BOOST_DEDUCED_TYPENAME typename #else # define BOOST_DEDUCED_TYPENAME #endif #ifndef BOOST_NO_TYPENAME_WITH_CTOR # define BOOST_CTOR_TYPENAME typename #else # define BOOST_CTOR_TYPENAME #endif // long long workaround ------------------------------------------// // On gcc (and maybe other compilers?) long long is alway supported // but it's use may generate either warnings (with -ansi), or errors // (with -pedantic -ansi) unless it's use is prefixed by __extension__ // #if defined(BOOST_HAS_LONG_LONG) && defined(__cplusplus) namespace boost{ # ifdef __GNUC__ __extension__ typedef long long long_long_type; __extension__ typedef unsigned long long ulong_long_type; # else typedef long long long_long_type; typedef unsigned long long ulong_long_type; # endif } #endif // same again for __int128: #if defined(BOOST_HAS_INT128) && defined(__cplusplus) namespace boost{ # ifdef __GNUC__ __extension__ typedef __int128 int128_type; __extension__ typedef unsigned __int128 uint128_type; # else typedef __int128 int128_type; typedef unsigned __int128 uint128_type; # endif } #endif // BOOST_[APPEND_]EXPLICIT_TEMPLATE_[NON_]TYPE macros --------------------------// // These macros are obsolete. Port away and remove. # define BOOST_EXPLICIT_TEMPLATE_TYPE(t) # define BOOST_EXPLICIT_TEMPLATE_TYPE_SPEC(t) # define BOOST_EXPLICIT_TEMPLATE_NON_TYPE(t, v) # define BOOST_EXPLICIT_TEMPLATE_NON_TYPE_SPEC(t, v) # define BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(t) # define BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE_SPEC(t) # define BOOST_APPEND_EXPLICIT_TEMPLATE_NON_TYPE(t, v) # define BOOST_APPEND_EXPLICIT_TEMPLATE_NON_TYPE_SPEC(t, v) // When BOOST_NO_STD_TYPEINFO is defined, we can just import // the global definition into std namespace: #if defined(BOOST_NO_STD_TYPEINFO) && defined(__cplusplus) #include namespace std{ using ::type_info; } #endif // ---------------------------------------------------------------------------// // // Helper macro BOOST_STRINGIZE: // Converts the parameter X to a string after macro replacement // on X has been performed. // #define BOOST_STRINGIZE(X) BOOST_DO_STRINGIZE(X) #define BOOST_DO_STRINGIZE(X) #X // // Helper macro BOOST_JOIN: // The following piece of macro magic joins the two // arguments together, even when one of the arguments is // itself a macro (see 16.3.1 in C++ standard). The key // is that macro expansion of macro arguments does not // occur in BOOST_DO_JOIN2 but does in BOOST_DO_JOIN. // #define BOOST_JOIN( X, Y ) BOOST_DO_JOIN( X, Y ) #define BOOST_DO_JOIN( X, Y ) BOOST_DO_JOIN2(X,Y) #define BOOST_DO_JOIN2( X, Y ) X##Y // // Set some default values for compiler/library/platform names. // These are for debugging config setup only: // # ifndef BOOST_COMPILER # define BOOST_COMPILER "Unknown ISO C++ Compiler" # endif # ifndef BOOST_STDLIB # define BOOST_STDLIB "Unknown ISO standard library" # endif # ifndef BOOST_PLATFORM # if defined(unix) || defined(__unix) || defined(_XOPEN_SOURCE) \ || defined(_POSIX_SOURCE) # define BOOST_PLATFORM "Generic Unix" # else # define BOOST_PLATFORM "Unknown" # endif # endif // // Set some default values GPU support // # ifndef BOOST_GPU_ENABLED # define BOOST_GPU_ENABLED # endif // BOOST_FORCEINLINE ---------------------------------------------// // Macro to use in place of 'inline' to force a function to be inline #if !defined(BOOST_FORCEINLINE) # if defined(_MSC_VER) # define BOOST_FORCEINLINE __forceinline # elif defined(__GNUC__) && __GNUC__ > 3 // Clang also defines __GNUC__ (as 4) # define BOOST_FORCEINLINE inline __attribute__ ((__always_inline__)) # else # define BOOST_FORCEINLINE inline # endif #endif // BOOST_NOINLINE ---------------------------------------------// // Macro to use in place of 'inline' to prevent a function to be inlined #if !defined(BOOST_NOINLINE) # if defined(_MSC_VER) # define BOOST_NOINLINE __declspec(noinline) # elif defined(__GNUC__) && __GNUC__ > 3 // Clang also defines __GNUC__ (as 4) # define BOOST_NOINLINE __attribute__ ((__noinline__)) # else # define BOOST_NOINLINE # endif #endif // Branch prediction hints // These macros are intended to wrap conditional expressions that yield true or false // // if (BOOST_LIKELY(var == 10)) // { // // the most probable code here // } // #if !defined(BOOST_LIKELY) # define BOOST_LIKELY(x) x #endif #if !defined(BOOST_UNLIKELY) # define BOOST_UNLIKELY(x) x #endif // Type and data alignment specification // #if !defined(BOOST_NO_CXX11_ALIGNAS) # define BOOST_ALIGNMENT(x) alignas(x) #elif defined(_MSC_VER) # define BOOST_ALIGNMENT(x) __declspec(align(x)) #elif defined(__GNUC__) # define BOOST_ALIGNMENT(x) __attribute__ ((__aligned__(x))) #else # define BOOST_NO_ALIGNMENT # define BOOST_ALIGNMENT(x) #endif // Defaulted and deleted function declaration helpers // These macros are intended to be inside a class definition. // BOOST_DEFAULTED_FUNCTION accepts the function declaration and its // body, which will be used if the compiler doesn't support defaulted functions. // BOOST_DELETED_FUNCTION only accepts the function declaration. It // will expand to a private function declaration, if the compiler doesn't support // deleted functions. Because of this it is recommended to use BOOST_DELETED_FUNCTION // in the end of the class definition. // // class my_class // { // public: // // Default-constructible // BOOST_DEFAULTED_FUNCTION(my_class(), {}) // // Copying prohibited // BOOST_DELETED_FUNCTION(my_class(my_class const&)) // BOOST_DELETED_FUNCTION(my_class& operator= (my_class const&)) // }; // #if !(defined(BOOST_NO_CXX11_DEFAULTED_FUNCTIONS) || defined(BOOST_NO_CXX11_NON_PUBLIC_DEFAULTED_FUNCTIONS)) # define BOOST_DEFAULTED_FUNCTION(fun, body) fun = default; #else # define BOOST_DEFAULTED_FUNCTION(fun, body) fun body #endif #if !defined(BOOST_NO_CXX11_DELETED_FUNCTIONS) # define BOOST_DELETED_FUNCTION(fun) fun = delete; #else # define BOOST_DELETED_FUNCTION(fun) private: fun; #endif // // Set BOOST_NO_DECLTYPE_N3276 when BOOST_NO_DECLTYPE is defined // #if defined(BOOST_NO_CXX11_DECLTYPE) && !defined(BOOST_NO_CXX11_DECLTYPE_N3276) #define BOOST_NO_CXX11_DECLTYPE_N3276 BOOST_NO_CXX11_DECLTYPE #endif // -------------------- Deprecated macros for 1.50 --------------------------- // These will go away in a future release // Use BOOST_NO_CXX11_HDR_UNORDERED_SET or BOOST_NO_CXX11_HDR_UNORDERED_MAP // instead of BOOST_NO_STD_UNORDERED #if defined(BOOST_NO_CXX11_HDR_UNORDERED_MAP) || defined (BOOST_NO_CXX11_HDR_UNORDERED_SET) # ifndef BOOST_NO_CXX11_STD_UNORDERED # define BOOST_NO_CXX11_STD_UNORDERED # endif #endif // Use BOOST_NO_CXX11_HDR_INITIALIZER_LIST instead of BOOST_NO_INITIALIZER_LISTS #if defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) && !defined(BOOST_NO_INITIALIZER_LISTS) # define BOOST_NO_INITIALIZER_LISTS #endif // Use BOOST_NO_CXX11_HDR_ARRAY instead of BOOST_NO_0X_HDR_ARRAY #if defined(BOOST_NO_CXX11_HDR_ARRAY) && !defined(BOOST_NO_0X_HDR_ARRAY) # define BOOST_NO_0X_HDR_ARRAY #endif // Use BOOST_NO_CXX11_HDR_CHRONO instead of BOOST_NO_0X_HDR_CHRONO #if defined(BOOST_NO_CXX11_HDR_CHRONO) && !defined(BOOST_NO_0X_HDR_CHRONO) # define BOOST_NO_0X_HDR_CHRONO #endif // Use BOOST_NO_CXX11_HDR_CODECVT instead of BOOST_NO_0X_HDR_CODECVT #if defined(BOOST_NO_CXX11_HDR_CODECVT) && !defined(BOOST_NO_0X_HDR_CODECVT) # define BOOST_NO_0X_HDR_CODECVT #endif // Use BOOST_NO_CXX11_HDR_CONDITION_VARIABLE instead of BOOST_NO_0X_HDR_CONDITION_VARIABLE #if defined(BOOST_NO_CXX11_HDR_CONDITION_VARIABLE) && !defined(BOOST_NO_0X_HDR_CONDITION_VARIABLE) # define BOOST_NO_0X_HDR_CONDITION_VARIABLE #endif // Use BOOST_NO_CXX11_HDR_FORWARD_LIST instead of BOOST_NO_0X_HDR_FORWARD_LIST #if defined(BOOST_NO_CXX11_HDR_FORWARD_LIST) && !defined(BOOST_NO_0X_HDR_FORWARD_LIST) # define BOOST_NO_0X_HDR_FORWARD_LIST #endif // Use BOOST_NO_CXX11_HDR_FUTURE instead of BOOST_NO_0X_HDR_FUTURE #if defined(BOOST_NO_CXX11_HDR_FUTURE) && !defined(BOOST_NO_0X_HDR_FUTURE) # define BOOST_NO_0X_HDR_FUTURE #endif // Use BOOST_NO_CXX11_HDR_INITIALIZER_LIST // instead of BOOST_NO_0X_HDR_INITIALIZER_LIST or BOOST_NO_INITIALIZER_LISTS #ifdef BOOST_NO_CXX11_HDR_INITIALIZER_LIST # ifndef BOOST_NO_0X_HDR_INITIALIZER_LIST # define BOOST_NO_0X_HDR_INITIALIZER_LIST # endif # ifndef BOOST_NO_INITIALIZER_LISTS # define BOOST_NO_INITIALIZER_LISTS # endif #endif // Use BOOST_NO_CXX11_HDR_MUTEX instead of BOOST_NO_0X_HDR_MUTEX #if defined(BOOST_NO_CXX11_HDR_MUTEX) && !defined(BOOST_NO_0X_HDR_MUTEX) # define BOOST_NO_0X_HDR_MUTEX #endif // Use BOOST_NO_CXX11_HDR_RANDOM instead of BOOST_NO_0X_HDR_RANDOM #if defined(BOOST_NO_CXX11_HDR_RANDOM) && !defined(BOOST_NO_0X_HDR_RANDOM) # define BOOST_NO_0X_HDR_RANDOM #endif // Use BOOST_NO_CXX11_HDR_RATIO instead of BOOST_NO_0X_HDR_RATIO #if defined(BOOST_NO_CXX11_HDR_RATIO) && !defined(BOOST_NO_0X_HDR_RATIO) # define BOOST_NO_0X_HDR_RATIO #endif // Use BOOST_NO_CXX11_HDR_REGEX instead of BOOST_NO_0X_HDR_REGEX #if defined(BOOST_NO_CXX11_HDR_REGEX) && !defined(BOOST_NO_0X_HDR_REGEX) # define BOOST_NO_0X_HDR_REGEX #endif // Use BOOST_NO_CXX11_HDR_SYSTEM_ERROR instead of BOOST_NO_0X_HDR_SYSTEM_ERROR #if defined(BOOST_NO_CXX11_HDR_SYSTEM_ERROR) && !defined(BOOST_NO_0X_HDR_SYSTEM_ERROR) # define BOOST_NO_0X_HDR_SYSTEM_ERROR #endif // Use BOOST_NO_CXX11_HDR_THREAD instead of BOOST_NO_0X_HDR_THREAD #if defined(BOOST_NO_CXX11_HDR_THREAD) && !defined(BOOST_NO_0X_HDR_THREAD) # define BOOST_NO_0X_HDR_THREAD #endif // Use BOOST_NO_CXX11_HDR_TUPLE instead of BOOST_NO_0X_HDR_TUPLE #if defined(BOOST_NO_CXX11_HDR_TUPLE) && !defined(BOOST_NO_0X_HDR_TUPLE) # define BOOST_NO_0X_HDR_TUPLE #endif // Use BOOST_NO_CXX11_HDR_TYPE_TRAITS instead of BOOST_NO_0X_HDR_TYPE_TRAITS #if defined(BOOST_NO_CXX11_HDR_TYPE_TRAITS) && !defined(BOOST_NO_0X_HDR_TYPE_TRAITS) # define BOOST_NO_0X_HDR_TYPE_TRAITS #endif // Use BOOST_NO_CXX11_HDR_TYPEINDEX instead of BOOST_NO_0X_HDR_TYPEINDEX #if defined(BOOST_NO_CXX11_HDR_TYPEINDEX) && !defined(BOOST_NO_0X_HDR_TYPEINDEX) # define BOOST_NO_0X_HDR_TYPEINDEX #endif // Use BOOST_NO_CXX11_HDR_UNORDERED_MAP instead of BOOST_NO_0X_HDR_UNORDERED_MAP #if defined(BOOST_NO_CXX11_HDR_UNORDERED_MAP) && !defined(BOOST_NO_0X_HDR_UNORDERED_MAP) # define BOOST_NO_0X_HDR_UNORDERED_MAP #endif // Use BOOST_NO_CXX11_HDR_UNORDERED_SET instead of BOOST_NO_0X_HDR_UNORDERED_SET #if defined(BOOST_NO_CXX11_HDR_UNORDERED_SET) && !defined(BOOST_NO_0X_HDR_UNORDERED_SET) # define BOOST_NO_0X_HDR_UNORDERED_SET #endif // ------------------ End of deprecated macros for 1.50 --------------------------- // -------------------- Deprecated macros for 1.51 --------------------------- // These will go away in a future release // Use BOOST_NO_CXX11_AUTO_DECLARATIONS instead of BOOST_NO_AUTO_DECLARATIONS #if defined(BOOST_NO_CXX11_AUTO_DECLARATIONS) && !defined(BOOST_NO_AUTO_DECLARATIONS) # define BOOST_NO_AUTO_DECLARATIONS #endif // Use BOOST_NO_CXX11_AUTO_MULTIDECLARATIONS instead of BOOST_NO_AUTO_MULTIDECLARATIONS #if defined(BOOST_NO_CXX11_AUTO_MULTIDECLARATIONS) && !defined(BOOST_NO_AUTO_MULTIDECLARATIONS) # define BOOST_NO_AUTO_MULTIDECLARATIONS #endif // Use BOOST_NO_CXX11_CHAR16_T instead of BOOST_NO_CHAR16_T #if defined(BOOST_NO_CXX11_CHAR16_T) && !defined(BOOST_NO_CHAR16_T) # define BOOST_NO_CHAR16_T #endif // Use BOOST_NO_CXX11_CHAR32_T instead of BOOST_NO_CHAR32_T #if defined(BOOST_NO_CXX11_CHAR32_T) && !defined(BOOST_NO_CHAR32_T) # define BOOST_NO_CHAR32_T #endif // Use BOOST_NO_CXX11_TEMPLATE_ALIASES instead of BOOST_NO_TEMPLATE_ALIASES #if defined(BOOST_NO_CXX11_TEMPLATE_ALIASES) && !defined(BOOST_NO_TEMPLATE_ALIASES) # define BOOST_NO_TEMPLATE_ALIASES #endif // Use BOOST_NO_CXX11_CONSTEXPR instead of BOOST_NO_CONSTEXPR #if defined(BOOST_NO_CXX11_CONSTEXPR) && !defined(BOOST_NO_CONSTEXPR) # define BOOST_NO_CONSTEXPR #endif // Use BOOST_NO_CXX11_DECLTYPE_N3276 instead of BOOST_NO_DECLTYPE_N3276 #if defined(BOOST_NO_CXX11_DECLTYPE_N3276) && !defined(BOOST_NO_DECLTYPE_N3276) # define BOOST_NO_DECLTYPE_N3276 #endif // Use BOOST_NO_CXX11_DECLTYPE instead of BOOST_NO_DECLTYPE #if defined(BOOST_NO_CXX11_DECLTYPE) && !defined(BOOST_NO_DECLTYPE) # define BOOST_NO_DECLTYPE #endif // Use BOOST_NO_CXX11_DEFAULTED_FUNCTIONS instead of BOOST_NO_DEFAULTED_FUNCTIONS #if defined(BOOST_NO_CXX11_DEFAULTED_FUNCTIONS) && !defined(BOOST_NO_DEFAULTED_FUNCTIONS) # define BOOST_NO_DEFAULTED_FUNCTIONS #endif // Use BOOST_NO_CXX11_DELETED_FUNCTIONS instead of BOOST_NO_DELETED_FUNCTIONS #if defined(BOOST_NO_CXX11_DELETED_FUNCTIONS) && !defined(BOOST_NO_DELETED_FUNCTIONS) # define BOOST_NO_DELETED_FUNCTIONS #endif // Use BOOST_NO_CXX11_EXPLICIT_CONVERSION_OPERATORS instead of BOOST_NO_EXPLICIT_CONVERSION_OPERATORS #if defined(BOOST_NO_CXX11_EXPLICIT_CONVERSION_OPERATORS) && !defined(BOOST_NO_EXPLICIT_CONVERSION_OPERATORS) # define BOOST_NO_EXPLICIT_CONVERSION_OPERATORS #endif // Use BOOST_NO_CXX11_EXTERN_TEMPLATE instead of BOOST_NO_EXTERN_TEMPLATE #if defined(BOOST_NO_CXX11_EXTERN_TEMPLATE) && !defined(BOOST_NO_EXTERN_TEMPLATE) # define BOOST_NO_EXTERN_TEMPLATE #endif // Use BOOST_NO_CXX11_FUNCTION_TEMPLATE_DEFAULT_ARGS instead of BOOST_NO_FUNCTION_TEMPLATE_DEFAULT_ARGS #if defined(BOOST_NO_CXX11_FUNCTION_TEMPLATE_DEFAULT_ARGS) && !defined(BOOST_NO_FUNCTION_TEMPLATE_DEFAULT_ARGS) # define BOOST_NO_FUNCTION_TEMPLATE_DEFAULT_ARGS #endif // Use BOOST_NO_CXX11_LAMBDAS instead of BOOST_NO_LAMBDAS #if defined(BOOST_NO_CXX11_LAMBDAS) && !defined(BOOST_NO_LAMBDAS) # define BOOST_NO_LAMBDAS #endif // Use BOOST_NO_CXX11_LOCAL_CLASS_TEMPLATE_PARAMETERS instead of BOOST_NO_LOCAL_CLASS_TEMPLATE_PARAMETERS #if defined(BOOST_NO_CXX11_LOCAL_CLASS_TEMPLATE_PARAMETERS) && !defined(BOOST_NO_LOCAL_CLASS_TEMPLATE_PARAMETERS) # define BOOST_NO_LOCAL_CLASS_TEMPLATE_PARAMETERS #endif // Use BOOST_NO_CXX11_NOEXCEPT instead of BOOST_NO_NOEXCEPT #if defined(BOOST_NO_CXX11_NOEXCEPT) && !defined(BOOST_NO_NOEXCEPT) # define BOOST_NO_NOEXCEPT #endif // Use BOOST_NO_CXX11_NULLPTR instead of BOOST_NO_NULLPTR #if defined(BOOST_NO_CXX11_NULLPTR) && !defined(BOOST_NO_NULLPTR) # define BOOST_NO_NULLPTR #endif // Use BOOST_NO_CXX11_RAW_LITERALS instead of BOOST_NO_RAW_LITERALS #if defined(BOOST_NO_CXX11_RAW_LITERALS) && !defined(BOOST_NO_RAW_LITERALS) # define BOOST_NO_RAW_LITERALS #endif // Use BOOST_NO_CXX11_RVALUE_REFERENCES instead of BOOST_NO_RVALUE_REFERENCES #if defined(BOOST_NO_CXX11_RVALUE_REFERENCES) && !defined(BOOST_NO_RVALUE_REFERENCES) # define BOOST_NO_RVALUE_REFERENCES #endif // Use BOOST_NO_CXX11_SCOPED_ENUMS instead of BOOST_NO_SCOPED_ENUMS #if defined(BOOST_NO_CXX11_SCOPED_ENUMS) && !defined(BOOST_NO_SCOPED_ENUMS) # define BOOST_NO_SCOPED_ENUMS #endif // Use BOOST_NO_CXX11_STATIC_ASSERT instead of BOOST_NO_STATIC_ASSERT #if defined(BOOST_NO_CXX11_STATIC_ASSERT) && !defined(BOOST_NO_STATIC_ASSERT) # define BOOST_NO_STATIC_ASSERT #endif // Use BOOST_NO_CXX11_STD_UNORDERED instead of BOOST_NO_STD_UNORDERED #if defined(BOOST_NO_CXX11_STD_UNORDERED) && !defined(BOOST_NO_STD_UNORDERED) # define BOOST_NO_STD_UNORDERED #endif // Use BOOST_NO_CXX11_UNICODE_LITERALS instead of BOOST_NO_UNICODE_LITERALS #if defined(BOOST_NO_CXX11_UNICODE_LITERALS) && !defined(BOOST_NO_UNICODE_LITERALS) # define BOOST_NO_UNICODE_LITERALS #endif // Use BOOST_NO_CXX11_UNIFIED_INITIALIZATION_SYNTAX instead of BOOST_NO_UNIFIED_INITIALIZATION_SYNTAX #if defined(BOOST_NO_CXX11_UNIFIED_INITIALIZATION_SYNTAX) && !defined(BOOST_NO_UNIFIED_INITIALIZATION_SYNTAX) # define BOOST_NO_UNIFIED_INITIALIZATION_SYNTAX #endif // Use BOOST_NO_CXX11_VARIADIC_TEMPLATES instead of BOOST_NO_VARIADIC_TEMPLATES #if defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) && !defined(BOOST_NO_VARIADIC_TEMPLATES) # define BOOST_NO_VARIADIC_TEMPLATES #endif // Use BOOST_NO_CXX11_VARIADIC_MACROS instead of BOOST_NO_VARIADIC_MACROS #if defined(BOOST_NO_CXX11_VARIADIC_MACROS) && !defined(BOOST_NO_VARIADIC_MACROS) # define BOOST_NO_VARIADIC_MACROS #endif // Use BOOST_NO_CXX11_NUMERIC_LIMITS instead of BOOST_NO_NUMERIC_LIMITS_LOWEST #if defined(BOOST_NO_CXX11_NUMERIC_LIMITS) && !defined(BOOST_NO_NUMERIC_LIMITS_LOWEST) # define BOOST_NO_NUMERIC_LIMITS_LOWEST #endif // ------------------ End of deprecated macros for 1.51 --------------------------- // // Helper macros BOOST_NOEXCEPT, BOOST_NOEXCEPT_IF, BOOST_NOEXCEPT_EXPR // These aid the transition to C++11 while still supporting C++03 compilers // #ifdef BOOST_NO_CXX11_NOEXCEPT # define BOOST_NOEXCEPT # define BOOST_NOEXCEPT_OR_NOTHROW throw() # define BOOST_NOEXCEPT_IF(Predicate) # define BOOST_NOEXCEPT_EXPR(Expression) false #else # define BOOST_NOEXCEPT noexcept # define BOOST_NOEXCEPT_OR_NOTHROW noexcept # define BOOST_NOEXCEPT_IF(Predicate) noexcept((Predicate)) # define BOOST_NOEXCEPT_EXPR(Expression) noexcept((Expression)) #endif // // Helper macro BOOST_FALLTHROUGH // Fallback definition of BOOST_FALLTHROUGH macro used to mark intended // fall-through between case labels in a switch statement. We use a definition // that requires a semicolon after it to avoid at least one type of misuse even // on unsupported compilers. // #ifndef BOOST_FALLTHROUGH # define BOOST_FALLTHROUGH ((void)0) #endif // // constexpr workarounds // #if defined(BOOST_NO_CXX11_CONSTEXPR) #define BOOST_CONSTEXPR #define BOOST_CONSTEXPR_OR_CONST const #else #define BOOST_CONSTEXPR constexpr #define BOOST_CONSTEXPR_OR_CONST constexpr #endif #define BOOST_STATIC_CONSTEXPR static BOOST_CONSTEXPR_OR_CONST // // Set BOOST_HAS_STATIC_ASSERT when BOOST_NO_CXX11_STATIC_ASSERT is not defined // #if !defined(BOOST_NO_CXX11_STATIC_ASSERT) && !defined(BOOST_HAS_STATIC_ASSERT) # define BOOST_HAS_STATIC_ASSERT #endif // // Set BOOST_HAS_RVALUE_REFS when BOOST_NO_CXX11_RVALUE_REFERENCES is not defined // #if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES) && !defined(BOOST_HAS_RVALUE_REFS) #define BOOST_HAS_RVALUE_REFS #endif // // Set BOOST_HAS_VARIADIC_TMPL when BOOST_NO_CXX11_VARIADIC_TEMPLATES is not defined // #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) && !defined(BOOST_HAS_VARIADIC_TMPL) #define BOOST_HAS_VARIADIC_TMPL #endif #endif madp-0.4/src/boost/boost/config/PaxHeaders.5405/abi_prefix.hpp0000644000000000000000000000007312717644140021113 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.041552917 madp-0.4/src/boost/boost/config/abi_prefix.hpp0000664000372100037210000000127212717644140021745 0ustar00fransfrans00000000000000// abi_prefix header -------------------------------------------------------// // (c) Copyright John Maddock 2003 // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). #ifndef BOOST_CONFIG_ABI_PREFIX_HPP # define BOOST_CONFIG_ABI_PREFIX_HPP #else # error double inclusion of header boost/config/abi_prefix.hpp is an error #endif #include // this must occur after all other includes and before any code appears: #ifdef BOOST_HAS_ABI_HEADERS # include BOOST_ABI_PREFIX #endif #if defined( __BORLANDC__ ) #pragma nopushoptwarn #endif madp-0.4/src/boost/boost/config/PaxHeaders.5405/select_platform_config.hpp0000644000000000000000000000007312717644140023513 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/config/select_platform_config.hpp0000664000372100037210000000622712717644140024352 0ustar00fransfrans00000000000000// Boost compiler configuration selection header file // (C) Copyright John Maddock 2001 - 2002. // (C) Copyright Jens Maurer 2001. // Use, modification and distribution are subject to the // Boost Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // See http://www.boost.org for most recent version. // locate which platform we are on and define BOOST_PLATFORM_CONFIG as needed. // Note that we define the headers to include using "header_name" not // in order to prevent macro expansion within the header // name (for example "linux" is a macro on linux systems). #if (defined(linux) || defined(__linux) || defined(__linux__) || defined(__GNU__) || defined(__GLIBC__)) && !defined(_CRAYC) // linux, also other platforms (Hurd etc) that use GLIBC, should these really have their own config headers though? # define BOOST_PLATFORM_CONFIG "boost/config/platform/linux.hpp" #elif defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) || defined(__DragonFly__) // BSD: # define BOOST_PLATFORM_CONFIG "boost/config/platform/bsd.hpp" #elif defined(sun) || defined(__sun) // solaris: # define BOOST_PLATFORM_CONFIG "boost/config/platform/solaris.hpp" #elif defined(__sgi) // SGI Irix: # define BOOST_PLATFORM_CONFIG "boost/config/platform/irix.hpp" #elif defined(__hpux) // hp unix: # define BOOST_PLATFORM_CONFIG "boost/config/platform/hpux.hpp" #elif defined(__CYGWIN__) // cygwin is not win32: # define BOOST_PLATFORM_CONFIG "boost/config/platform/cygwin.hpp" #elif defined(_WIN32) || defined(__WIN32__) || defined(WIN32) // win32: # define BOOST_PLATFORM_CONFIG "boost/config/platform/win32.hpp" #elif defined(__BEOS__) // BeOS # define BOOST_PLATFORM_CONFIG "boost/config/platform/beos.hpp" #elif defined(macintosh) || defined(__APPLE__) || defined(__APPLE_CC__) // MacOS # define BOOST_PLATFORM_CONFIG "boost/config/platform/macos.hpp" #elif defined(__IBMCPP__) || defined(_AIX) // IBM # define BOOST_PLATFORM_CONFIG "boost/config/platform/aix.hpp" #elif defined(__amigaos__) // AmigaOS # define BOOST_PLATFORM_CONFIG "boost/config/platform/amigaos.hpp" #elif defined(__QNXNTO__) // QNX: # define BOOST_PLATFORM_CONFIG "boost/config/platform/qnxnto.hpp" #elif defined(__VXWORKS__) // vxWorks: # define BOOST_PLATFORM_CONFIG "boost/config/platform/vxworks.hpp" #elif defined(__SYMBIAN32__) // Symbian: # define BOOST_PLATFORM_CONFIG "boost/config/platform/symbian.hpp" #elif defined(_CRAYC) // Cray: # define BOOST_PLATFORM_CONFIG "boost/config/platform/cray.hpp" #elif defined(__VMS) // VMS: # define BOOST_PLATFORM_CONFIG "boost/config/platform/vms.hpp" #else # if defined(unix) \ || defined(__unix) \ || defined(_XOPEN_SOURCE) \ || defined(_POSIX_SOURCE) // generic unix platform: # ifndef BOOST_HAS_UNISTD_H # define BOOST_HAS_UNISTD_H # endif # include # endif # if defined (BOOST_ASSERT_CONFIG) // this must come last - generate an error if we don't // recognise the platform: # error "Unknown platform - please configure and report the results to boost.org" # endif #endif madp-0.4/src/boost/boost/config/PaxHeaders.5405/select_compiler_config.hpp0000644000000000000000000000007312717644140023501 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/config/select_compiler_config.hpp0000664000372100037210000000714612717644140024341 0ustar00fransfrans00000000000000// Boost compiler configuration selection header file // (C) Copyright John Maddock 2001 - 2003. // (C) Copyright Martin Wille 2003. // (C) Copyright Guillaume Melquiond 2003. // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // See http://www.boost.org/ for most recent version. // locate which compiler we are using and define // BOOST_COMPILER_CONFIG as needed: #if defined __CUDACC__ // NVIDIA CUDA C++ compiler for GPU # include "boost/config/compiler/nvcc.hpp" #endif #if defined(__GCCXML__) // GCC-XML emulates other compilers, it has to appear first here! # define BOOST_COMPILER_CONFIG "boost/config/compiler/gcc_xml.hpp" #elif defined(_CRAYC) // EDG based Cray compiler: # define BOOST_COMPILER_CONFIG "boost/config/compiler/cray.hpp" #elif defined __COMO__ // Comeau C++ # define BOOST_COMPILER_CONFIG "boost/config/compiler/comeau.hpp" #elif defined(__PATHSCALE__) && (__PATHCC__ >= 4) // PathScale EKOPath compiler (has to come before clang and gcc) # define BOOST_COMPILER_CONFIG "boost/config/compiler/pathscale.hpp" #elif defined(__INTEL_COMPILER) || defined(__ICL) || defined(__ICC) || defined(__ECC) // Intel # define BOOST_COMPILER_CONFIG "boost/config/compiler/intel.hpp" #elif defined __clang__ // Clang C++ emulates GCC, so it has to appear early. # define BOOST_COMPILER_CONFIG "boost/config/compiler/clang.hpp" #elif defined __DMC__ // Digital Mars C++ # define BOOST_COMPILER_CONFIG "boost/config/compiler/digitalmars.hpp" # elif defined __GNUC__ // GNU C++: # define BOOST_COMPILER_CONFIG "boost/config/compiler/gcc.hpp" #elif defined __KCC // Kai C++ # define BOOST_COMPILER_CONFIG "boost/config/compiler/kai.hpp" #elif defined __sgi // SGI MIPSpro C++ # define BOOST_COMPILER_CONFIG "boost/config/compiler/sgi_mipspro.hpp" #elif defined __DECCXX // Compaq Tru64 Unix cxx # define BOOST_COMPILER_CONFIG "boost/config/compiler/compaq_cxx.hpp" #elif defined __ghs // Greenhills C++ # define BOOST_COMPILER_CONFIG "boost/config/compiler/greenhills.hpp" #elif defined __CODEGEARC__ // CodeGear - must be checked for before Borland # define BOOST_COMPILER_CONFIG "boost/config/compiler/codegear.hpp" #elif defined __BORLANDC__ // Borland # define BOOST_COMPILER_CONFIG "boost/config/compiler/borland.hpp" #elif defined __MWERKS__ // Metrowerks CodeWarrior # define BOOST_COMPILER_CONFIG "boost/config/compiler/metrowerks.hpp" #elif defined __SUNPRO_CC // Sun Workshop Compiler C++ # define BOOST_COMPILER_CONFIG "boost/config/compiler/sunpro_cc.hpp" #elif defined __HP_aCC // HP aCC # define BOOST_COMPILER_CONFIG "boost/config/compiler/hp_acc.hpp" #elif defined(__MRC__) || defined(__SC__) // MPW MrCpp or SCpp # define BOOST_COMPILER_CONFIG "boost/config/compiler/mpw.hpp" #elif defined(__IBMCPP__) // IBM Visual Age # define BOOST_COMPILER_CONFIG "boost/config/compiler/vacpp.hpp" #elif defined(__PGI) // Portland Group Inc. # define BOOST_COMPILER_CONFIG "boost/config/compiler/pgi.hpp" #elif defined _MSC_VER // Microsoft Visual C++ // // Must remain the last #elif since some other vendors (Metrowerks, for // example) also #define _MSC_VER # define BOOST_COMPILER_CONFIG "boost/config/compiler/visualc.hpp" #elif defined (BOOST_ASSERT_CONFIG) // this must come last - generate an error if we don't // recognise the compiler: # error "Unknown compiler - please configure (http://www.boost.org/libs/config/config.htm#configuring) and report the results to the main boost mailing list (http://www.boost.org/more/mailing_lists.htm#main)" #endif madp-0.4/src/boost/boost/PaxHeaders.5405/is_placeholder.hpp0000644000000000000000000000007412717644140020514 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/is_placeholder.hpp0000664000372100037210000000117212717644140021344 0ustar00fransfrans00000000000000#ifndef BOOST_IS_PLACEHOLDER_HPP_INCLUDED #define BOOST_IS_PLACEHOLDER_HPP_INCLUDED // MS compatible compilers support #pragma once #if defined( _MSC_VER ) && ( _MSC_VER >= 1020 ) # pragma once #endif // is_placeholder.hpp - TR1 is_placeholder metafunction // // Copyright (c) 2006 Peter Dimov // // Distributed under the Boost Software License, Version 1.0. // // See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt namespace boost { template< class T > struct is_placeholder { enum _vt { value = 0 }; }; } // namespace boost #endif // #ifndef BOOST_IS_PLACEHOLDER_HPP_INCLUDED madp-0.4/src/boost/boost/PaxHeaders.5405/functional.hpp0000644000000000000000000000007412717644140017701 xustar0030 atime=1463765180.101720159 30 ctime=1463765201.049552852 madp-0.4/src/boost/boost/functional.hpp0000664000372100037210000004471512717644140020543 0ustar00fransfrans00000000000000// ------------------------------------------------------------------------------ // Copyright (c) 2000 Cadenza New Zealand Ltd // Distributed under the Boost Software License, Version 1.0. (See accompany- // ing file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // ------------------------------------------------------------------------------ // Boost functional.hpp header file // See http://www.boost.org/libs/functional for documentation. // ------------------------------------------------------------------------------ // $Id: functional.hpp 36246 2006-12-02 14:17:26Z andreas_huber69 $ // ------------------------------------------------------------------------------ #ifndef BOOST_FUNCTIONAL_HPP #define BOOST_FUNCTIONAL_HPP #include #include #include namespace boost { #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION // -------------------------------------------------------------------------- // The following traits classes allow us to avoid the need for ptr_fun // because the types of arguments and the result of a function can be // deduced. // // In addition to the standard types defined in unary_function and // binary_function, we add // // - function_type, the type of the function or function object itself. // // - param_type, the type that should be used for passing the function or // function object as an argument. // -------------------------------------------------------------------------- namespace detail { template struct unary_traits_imp; template struct unary_traits_imp { typedef Operation function_type; typedef const function_type & param_type; typedef typename Operation::result_type result_type; typedef typename Operation::argument_type argument_type; }; template struct unary_traits_imp { typedef R (*function_type)(A); typedef R (*param_type)(A); typedef R result_type; typedef A argument_type; }; template struct binary_traits_imp; template struct binary_traits_imp { typedef Operation function_type; typedef const function_type & param_type; typedef typename Operation::result_type result_type; typedef typename Operation::first_argument_type first_argument_type; typedef typename Operation::second_argument_type second_argument_type; }; template struct binary_traits_imp { typedef R (*function_type)(A1,A2); typedef R (*param_type)(A1,A2); typedef R result_type; typedef A1 first_argument_type; typedef A2 second_argument_type; }; } // namespace detail template struct unary_traits { typedef typename detail::unary_traits_imp::function_type function_type; typedef typename detail::unary_traits_imp::param_type param_type; typedef typename detail::unary_traits_imp::result_type result_type; typedef typename detail::unary_traits_imp::argument_type argument_type; }; template struct unary_traits { typedef R (*function_type)(A); typedef R (*param_type)(A); typedef R result_type; typedef A argument_type; }; template struct binary_traits { typedef typename detail::binary_traits_imp::function_type function_type; typedef typename detail::binary_traits_imp::param_type param_type; typedef typename detail::binary_traits_imp::result_type result_type; typedef typename detail::binary_traits_imp::first_argument_type first_argument_type; typedef typename detail::binary_traits_imp::second_argument_type second_argument_type; }; template struct binary_traits { typedef R (*function_type)(A1,A2); typedef R (*param_type)(A1,A2); typedef R result_type; typedef A1 first_argument_type; typedef A2 second_argument_type; }; #else // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION // -------------------------------------------------------------------------- // If we have no partial specialisation available, decay to a situation // that is no worse than in the Standard, i.e., ptr_fun will be required. // -------------------------------------------------------------------------- template struct unary_traits { typedef Operation function_type; typedef const Operation& param_type; typedef typename Operation::result_type result_type; typedef typename Operation::argument_type argument_type; }; template struct binary_traits { typedef Operation function_type; typedef const Operation & param_type; typedef typename Operation::result_type result_type; typedef typename Operation::first_argument_type first_argument_type; typedef typename Operation::second_argument_type second_argument_type; }; #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION // -------------------------------------------------------------------------- // unary_negate, not1 // -------------------------------------------------------------------------- template class unary_negate : public std::unary_function::argument_type,bool> { public: explicit unary_negate(typename unary_traits::param_type x) : pred(x) {} bool operator()(typename call_traits::argument_type>::param_type x) const { return !pred(x); } private: typename unary_traits::function_type pred; }; template unary_negate not1(const Predicate &pred) { // The cast is to placate Borland C++Builder in certain circumstances. // I don't think it should be necessary. return unary_negate((typename unary_traits::param_type)pred); } template unary_negate not1(Predicate &pred) { return unary_negate(pred); } // -------------------------------------------------------------------------- // binary_negate, not2 // -------------------------------------------------------------------------- template class binary_negate : public std::binary_function::first_argument_type, typename binary_traits::second_argument_type, bool> { public: explicit binary_negate(typename binary_traits::param_type x) : pred(x) {} bool operator()(typename call_traits::first_argument_type>::param_type x, typename call_traits::second_argument_type>::param_type y) const { return !pred(x,y); } private: typename binary_traits::function_type pred; }; template binary_negate not2(const Predicate &pred) { // The cast is to placate Borland C++Builder in certain circumstances. // I don't think it should be necessary. return binary_negate((typename binary_traits::param_type)pred); } template binary_negate not2(Predicate &pred) { return binary_negate(pred); } // -------------------------------------------------------------------------- // binder1st, bind1st // -------------------------------------------------------------------------- template class binder1st : public std::unary_function::second_argument_type, typename binary_traits::result_type> { public: binder1st(typename binary_traits::param_type x, typename call_traits::first_argument_type>::param_type y) : op(x), value(y) {} typename binary_traits::result_type operator()(typename call_traits::second_argument_type>::param_type x) const { return op(value, x); } protected: typename binary_traits::function_type op; typename binary_traits::first_argument_type value; }; template inline binder1st bind1st(const Operation &op, typename call_traits< typename binary_traits::first_argument_type >::param_type x) { // The cast is to placate Borland C++Builder in certain circumstances. // I don't think it should be necessary. return binder1st((typename binary_traits::param_type)op, x); } template inline binder1st bind1st(Operation &op, typename call_traits< typename binary_traits::first_argument_type >::param_type x) { return binder1st(op, x); } // -------------------------------------------------------------------------- // binder2nd, bind2nd // -------------------------------------------------------------------------- template class binder2nd : public std::unary_function::first_argument_type, typename binary_traits::result_type> { public: binder2nd(typename binary_traits::param_type x, typename call_traits::second_argument_type>::param_type y) : op(x), value(y) {} typename binary_traits::result_type operator()(typename call_traits::first_argument_type>::param_type x) const { return op(x, value); } protected: typename binary_traits::function_type op; typename binary_traits::second_argument_type value; }; template inline binder2nd bind2nd(const Operation &op, typename call_traits< typename binary_traits::second_argument_type >::param_type x) { // The cast is to placate Borland C++Builder in certain circumstances. // I don't think it should be necessary. return binder2nd((typename binary_traits::param_type)op, x); } template inline binder2nd bind2nd(Operation &op, typename call_traits< typename binary_traits::second_argument_type >::param_type x) { return binder2nd(op, x); } // -------------------------------------------------------------------------- // mem_fun, etc // -------------------------------------------------------------------------- template class mem_fun_t : public std::unary_function { public: explicit mem_fun_t(S (T::*p)()) : ptr(p) {} S operator()(T* p) const { return (p->*ptr)(); } private: S (T::*ptr)(); }; template class mem_fun1_t : public std::binary_function { public: explicit mem_fun1_t(S (T::*p)(A)) : ptr(p) {} S operator()(T* p, typename call_traits::param_type x) const { return (p->*ptr)(x); } private: S (T::*ptr)(A); }; template class const_mem_fun_t : public std::unary_function { public: explicit const_mem_fun_t(S (T::*p)() const) : ptr(p) {} S operator()(const T* p) const { return (p->*ptr)(); } private: S (T::*ptr)() const; }; template class const_mem_fun1_t : public std::binary_function { public: explicit const_mem_fun1_t(S (T::*p)(A) const) : ptr(p) {} S operator()(const T* p, typename call_traits::param_type x) const { return (p->*ptr)(x); } private: S (T::*ptr)(A) const; }; template inline mem_fun_t mem_fun(S (T::*f)()) { return mem_fun_t(f); } template inline mem_fun1_t mem_fun(S (T::*f)(A)) { return mem_fun1_t(f); } #ifndef BOOST_NO_POINTER_TO_MEMBER_CONST template inline const_mem_fun_t mem_fun(S (T::*f)() const) { return const_mem_fun_t(f); } template inline const_mem_fun1_t mem_fun(S (T::*f)(A) const) { return const_mem_fun1_t(f); } #endif // BOOST_NO_POINTER_TO_MEMBER_CONST // -------------------------------------------------------------------------- // mem_fun_ref, etc // -------------------------------------------------------------------------- template class mem_fun_ref_t : public std::unary_function { public: explicit mem_fun_ref_t(S (T::*p)()) : ptr(p) {} S operator()(T& p) const { return (p.*ptr)(); } private: S (T::*ptr)(); }; template class mem_fun1_ref_t : public std::binary_function { public: explicit mem_fun1_ref_t(S (T::*p)(A)) : ptr(p) {} S operator()(T& p, typename call_traits::param_type x) const { return (p.*ptr)(x); } private: S (T::*ptr)(A); }; template class const_mem_fun_ref_t : public std::unary_function { public: explicit const_mem_fun_ref_t(S (T::*p)() const) : ptr(p) {} S operator()(const T &p) const { return (p.*ptr)(); } private: S (T::*ptr)() const; }; template class const_mem_fun1_ref_t : public std::binary_function { public: explicit const_mem_fun1_ref_t(S (T::*p)(A) const) : ptr(p) {} S operator()(const T& p, typename call_traits::param_type x) const { return (p.*ptr)(x); } private: S (T::*ptr)(A) const; }; template inline mem_fun_ref_t mem_fun_ref(S (T::*f)()) { return mem_fun_ref_t(f); } template inline mem_fun1_ref_t mem_fun_ref(S (T::*f)(A)) { return mem_fun1_ref_t(f); } #ifndef BOOST_NO_POINTER_TO_MEMBER_CONST template inline const_mem_fun_ref_t mem_fun_ref(S (T::*f)() const) { return const_mem_fun_ref_t(f); } template inline const_mem_fun1_ref_t mem_fun_ref(S (T::*f)(A) const) { return const_mem_fun1_ref_t(f); } #endif // BOOST_NO_POINTER_TO_MEMBER_CONST // -------------------------------------------------------------------------- // ptr_fun // -------------------------------------------------------------------------- template class pointer_to_unary_function : public std::unary_function { public: explicit pointer_to_unary_function(Result (*f)(Arg)) : func(f) {} Result operator()(typename call_traits::param_type x) const { return func(x); } private: Result (*func)(Arg); }; template inline pointer_to_unary_function ptr_fun(Result (*f)(Arg)) { return pointer_to_unary_function(f); } template class pointer_to_binary_function : public std::binary_function { public: explicit pointer_to_binary_function(Result (*f)(Arg1, Arg2)) : func(f) {} Result operator()(typename call_traits::param_type x, typename call_traits::param_type y) const { return func(x,y); } private: Result (*func)(Arg1, Arg2); }; template inline pointer_to_binary_function ptr_fun(Result (*f)(Arg1, Arg2)) { return pointer_to_binary_function(f); } } // namespace boost #endif madp-0.4/src/boost/boost/PaxHeaders.5405/iterator0000644000000000000000000000007412717644140016602 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/iterator/0000775000372100037210000000000012717644140017506 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/iterator/PaxHeaders.5405/iterator_concepts.hpp0000644000000000000000000000007412717644140023117 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/iterator/iterator_concepts.hpp0000664000372100037210000001713012717644140023750 0ustar00fransfrans00000000000000// (C) Copyright Jeremy Siek 2002. // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_ITERATOR_CONCEPTS_HPP #define BOOST_ITERATOR_CONCEPTS_HPP #include #include // Use boost::detail::iterator_traits to work around some MSVC/Dinkumware problems. #include #include #include #include #include #include #include #include // Use boost/limits to work around missing limits headers on some compilers #include #include #include #include namespace boost_concepts { // Used a different namespace here (instead of "boost") so that the // concept descriptions do not take for granted the names in // namespace boost. //=========================================================================== // Iterator Access Concepts BOOST_concept(ReadableIterator,(Iterator)) : boost::Assignable , boost::CopyConstructible { typedef BOOST_DEDUCED_TYPENAME boost::detail::iterator_traits::value_type value_type; typedef BOOST_DEDUCED_TYPENAME boost::detail::iterator_traits::reference reference; BOOST_CONCEPT_USAGE(ReadableIterator) { value_type v = *i; boost::ignore_unused_variable_warning(v); } private: Iterator i; }; template < typename Iterator , typename ValueType = BOOST_DEDUCED_TYPENAME boost::detail::iterator_traits::value_type > struct WritableIterator : boost::CopyConstructible { BOOST_CONCEPT_USAGE(WritableIterator) { *i = v; } private: ValueType v; Iterator i; }; template < typename Iterator , typename ValueType = BOOST_DEDUCED_TYPENAME boost::detail::iterator_traits::value_type > struct WritableIteratorConcept : WritableIterator {}; BOOST_concept(SwappableIterator,(Iterator)) { BOOST_CONCEPT_USAGE(SwappableIterator) { std::iter_swap(i1, i2); } private: Iterator i1; Iterator i2; }; BOOST_concept(LvalueIterator,(Iterator)) { typedef typename boost::detail::iterator_traits::value_type value_type; BOOST_CONCEPT_USAGE(LvalueIterator) { value_type& r = const_cast(*i); boost::ignore_unused_variable_warning(r); } private: Iterator i; }; //=========================================================================== // Iterator Traversal Concepts BOOST_concept(IncrementableIterator,(Iterator)) : boost::Assignable , boost::CopyConstructible { typedef typename boost::iterator_traversal::type traversal_category; BOOST_CONCEPT_ASSERT(( boost::Convertible< traversal_category , boost::incrementable_traversal_tag >)); BOOST_CONCEPT_USAGE(IncrementableIterator) { ++i; (void)i++; } private: Iterator i; }; BOOST_concept(SinglePassIterator,(Iterator)) : IncrementableIterator , boost::EqualityComparable { BOOST_CONCEPT_ASSERT(( boost::Convertible< BOOST_DEDUCED_TYPENAME SinglePassIterator::traversal_category , boost::single_pass_traversal_tag > )); }; BOOST_concept(ForwardTraversal,(Iterator)) : SinglePassIterator , boost::DefaultConstructible { typedef typename boost::detail::iterator_traits::difference_type difference_type; BOOST_MPL_ASSERT((boost::is_integral)); BOOST_MPL_ASSERT_RELATION(std::numeric_limits::is_signed, ==, true); BOOST_CONCEPT_ASSERT(( boost::Convertible< BOOST_DEDUCED_TYPENAME ForwardTraversal::traversal_category , boost::forward_traversal_tag > )); }; BOOST_concept(BidirectionalTraversal,(Iterator)) : ForwardTraversal { BOOST_CONCEPT_ASSERT(( boost::Convertible< BOOST_DEDUCED_TYPENAME BidirectionalTraversal::traversal_category , boost::bidirectional_traversal_tag > )); BOOST_CONCEPT_USAGE(BidirectionalTraversal) { --i; (void)i--; } private: Iterator i; }; BOOST_concept(RandomAccessTraversal,(Iterator)) : BidirectionalTraversal { BOOST_CONCEPT_ASSERT(( boost::Convertible< BOOST_DEDUCED_TYPENAME RandomAccessTraversal::traversal_category , boost::random_access_traversal_tag > )); BOOST_CONCEPT_USAGE(RandomAccessTraversal) { i += n; i = i + n; i = n + i; i -= n; i = i - n; n = i - j; } private: typename BidirectionalTraversal::difference_type n; Iterator i, j; }; //=========================================================================== // Iterator Interoperability namespace detail { template void interop_single_pass_constraints(Iterator1 const& i1, Iterator2 const& i2) { bool b; b = i1 == i2; b = i1 != i2; b = i2 == i1; b = i2 != i1; boost::ignore_unused_variable_warning(b); } template void interop_rand_access_constraints( Iterator1 const& i1, Iterator2 const& i2, boost::random_access_traversal_tag, boost::random_access_traversal_tag) { bool b; typename boost::detail::iterator_traits::difference_type n; b = i1 < i2; b = i1 <= i2; b = i1 > i2; b = i1 >= i2; n = i1 - i2; b = i2 < i1; b = i2 <= i1; b = i2 > i1; b = i2 >= i1; n = i2 - i1; boost::ignore_unused_variable_warning(b); boost::ignore_unused_variable_warning(n); } template void interop_rand_access_constraints( Iterator1 const&, Iterator2 const&, boost::single_pass_traversal_tag, boost::single_pass_traversal_tag) { } } // namespace detail BOOST_concept(InteroperableIterator,(Iterator)(ConstIterator)) { private: typedef typename boost::detail::pure_traversal_tag< typename boost::iterator_traversal< Iterator >::type >::type traversal_category; typedef typename boost::detail::pure_traversal_tag< typename boost::iterator_traversal< ConstIterator >::type >::type const_traversal_category; public: BOOST_CONCEPT_ASSERT((SinglePassIterator)); BOOST_CONCEPT_ASSERT((SinglePassIterator)); BOOST_CONCEPT_USAGE(InteroperableIterator) { detail::interop_single_pass_constraints(i, ci); detail::interop_rand_access_constraints(i, ci, traversal_category(), const_traversal_category()); ci = i; } private: Iterator i; ConstIterator ci; }; } // namespace boost_concepts #include #endif // BOOST_ITERATOR_CONCEPTS_HPP madp-0.4/src/boost/boost/iterator/PaxHeaders.5405/iterator_facade.hpp0000644000000000000000000000007412717644140022504 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/iterator/iterator_facade.hpp0000664000372100037210000007064312717644140023345 0ustar00fransfrans00000000000000// (C) Copyright David Abrahams 2002. // (C) Copyright Jeremy Siek 2002. // (C) Copyright Thomas Witt 2002. // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_ITERATOR_FACADE_23022003THW_HPP #define BOOST_ITERATOR_FACADE_23022003THW_HPP #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include // this goes last namespace boost { // This forward declaration is required for the friend declaration // in iterator_core_access template class iterator_facade; namespace detail { // A binary metafunction class that always returns bool. VC6 // ICEs on mpl::always, probably because of the default // parameters. struct always_bool2 { template struct apply { typedef bool type; }; }; // // enable if for use in operator implementation. // template < class Facade1 , class Facade2 , class Return > struct enable_if_interoperable #if BOOST_WORKAROUND(BOOST_MSVC, <= 1300) { typedef typename mpl::if_< mpl::or_< is_convertible , is_convertible > , Return , int[3] >::type type; }; #else : ::boost::iterators::enable_if< mpl::or_< is_convertible , is_convertible > , Return > {}; #endif // // Generates associated types for an iterator_facade with the // given parameters. // template < class ValueParam , class CategoryOrTraversal , class Reference , class Difference > struct iterator_facade_types { typedef typename facade_iterator_category< CategoryOrTraversal, ValueParam, Reference >::type iterator_category; typedef typename remove_const::type value_type; // Not the real associated pointer type typedef typename mpl::eval_if< boost::detail::iterator_writability_disabled , add_pointer , add_pointer >::type pointer; # if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \ && (BOOST_WORKAROUND(_STLPORT_VERSION, BOOST_TESTED_AT(0x452)) \ || BOOST_WORKAROUND(BOOST_DINKUMWARE_STDLIB, BOOST_TESTED_AT(310))) \ || BOOST_WORKAROUND(BOOST_RWSTD_VER, BOOST_TESTED_AT(0x20101)) \ || BOOST_WORKAROUND(BOOST_DINKUMWARE_STDLIB, <= 310) // To interoperate with some broken library/compiler // combinations, user-defined iterators must be derived from // std::iterator. It is possible to implement a standard // library for broken compilers without this limitation. # define BOOST_ITERATOR_FACADE_NEEDS_ITERATOR_BASE 1 typedef iterator base; # endif }; // iterators whose dereference operators reference the same value // for all iterators into the same sequence (like many input // iterators) need help with their postfix ++: the referenced // value must be read and stored away before the increment occurs // so that *a++ yields the originally referenced element and not // the next one. template class postfix_increment_proxy { typedef typename iterator_value::type value_type; public: explicit postfix_increment_proxy(Iterator const& x) : stored_value(*x) {} // Returning a mutable reference allows nonsense like // (*r++).mutate(), but it imposes fewer assumptions about the // behavior of the value_type. In particular, recall that // (*r).mutate() is legal if operator* returns by value. value_type& operator*() const { return this->stored_value; } private: mutable value_type stored_value; }; // // In general, we can't determine that such an iterator isn't // writable -- we also need to store a copy of the old iterator so // that it can be written into. template class writable_postfix_increment_proxy { typedef typename iterator_value::type value_type; public: explicit writable_postfix_increment_proxy(Iterator const& x) : stored_value(*x) , stored_iterator(x) {} // Dereferencing must return a proxy so that both *r++ = o and // value_type(*r++) can work. In this case, *r is the same as // *r++, and the conversion operator below is used to ensure // readability. writable_postfix_increment_proxy const& operator*() const { return *this; } // Provides readability of *r++ operator value_type&() const { return stored_value; } // Provides writability of *r++ template T const& operator=(T const& x) const { *this->stored_iterator = x; return x; } // This overload just in case only non-const objects are writable template T& operator=(T& x) const { *this->stored_iterator = x; return x; } // Provides X(r++) operator Iterator const&() const { return stored_iterator; } private: mutable value_type stored_value; Iterator stored_iterator; }; # ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION template struct is_non_proxy_reference_impl { static Reference r; template static typename mpl::if_< is_convertible< R const volatile* , Value const volatile* > , char[1] , char[2] >::type& helper(R const&); BOOST_STATIC_CONSTANT(bool, value = sizeof(helper(r)) == 1); }; template struct is_non_proxy_reference : mpl::bool_< is_non_proxy_reference_impl::value > {}; # else template struct is_non_proxy_reference : is_convertible< typename remove_reference::type const volatile* , Value const volatile* > {}; # endif // A metafunction to choose the result type of postfix ++ // // Because the C++98 input iterator requirements say that *r++ has // type T (value_type), implementations of some standard // algorithms like lexicographical_compare may use constructions // like: // // *r++ < *s++ // // If *r++ returns a proxy (as required if r is writable but not // multipass), this sort of expression will fail unless the proxy // supports the operator<. Since there are any number of such // operations, we're not going to try to support them. Therefore, // even if r++ returns a proxy, *r++ will only return a proxy if // *r also returns a proxy. template struct postfix_increment_result : mpl::eval_if< mpl::and_< // A proxy is only needed for readable iterators is_convertible // No multipass iterator can have values that disappear // before positions can be re-visited , mpl::not_< is_convertible< typename iterator_category_to_traversal::type , forward_traversal_tag > > > , mpl::if_< is_non_proxy_reference , postfix_increment_proxy , writable_postfix_increment_proxy > , mpl::identity > {}; // operator->() needs special support for input iterators to strictly meet the // standard's requirements. If *i is not a reference type, we must still // produce an lvalue to which a pointer can be formed. We do that by // returning a proxy object containing an instance of the reference object. template struct operator_arrow_dispatch // proxy references { struct proxy { explicit proxy(Reference const & x) : m_ref(x) {} Reference* operator->() { return boost::addressof(m_ref); } // This function is needed for MWCW and BCC, which won't call // operator-> again automatically per 13.3.1.2 para 8 operator Reference*() { return boost::addressof(m_ref); } Reference m_ref; }; typedef proxy result_type; static result_type apply(Reference const & x) { return result_type(x); } }; template struct operator_arrow_dispatch // "real" references { typedef Pointer result_type; static result_type apply(T& x) { return boost::addressof(x); } }; # if BOOST_WORKAROUND(BOOST_MSVC, < 1300) // Deal with ETI template<> struct operator_arrow_dispatch { typedef int result_type; }; # endif // A proxy return type for operator[], needed to deal with // iterators that may invalidate referents upon destruction. // Consider the temporary iterator in *(a + n) template class operator_brackets_proxy { // Iterator is actually an iterator_facade, so we do not have to // go through iterator_traits to access the traits. typedef typename Iterator::reference reference; typedef typename Iterator::value_type value_type; public: operator_brackets_proxy(Iterator const& iter) : m_iter(iter) {} operator reference() const { return *m_iter; } operator_brackets_proxy& operator=(value_type const& val) { *m_iter = val; return *this; } private: Iterator m_iter; }; // A metafunction that determines whether operator[] must return a // proxy, or whether it can simply return a copy of the value_type. template struct use_operator_brackets_proxy : mpl::not_< mpl::and_< // Really we want an is_copy_constructible trait here, // but is_POD will have to suffice in the meantime. boost::is_POD , iterator_writability_disabled > > {}; template struct operator_brackets_result { typedef typename mpl::if_< use_operator_brackets_proxy , operator_brackets_proxy , Value >::type type; }; template operator_brackets_proxy make_operator_brackets_result(Iterator const& iter, mpl::true_) { return operator_brackets_proxy(iter); } template typename Iterator::value_type make_operator_brackets_result(Iterator const& iter, mpl::false_) { return *iter; } struct choose_difference_type { template struct apply : # ifdef BOOST_NO_ONE_WAY_ITERATOR_INTEROP iterator_difference # elif BOOST_WORKAROUND(BOOST_MSVC, < 1300) mpl::if_< is_convertible , typename I1::difference_type , typename I2::difference_type > # else mpl::eval_if< is_convertible , iterator_difference , iterator_difference > # endif {}; }; } // namespace detail // Macros which describe the declarations of binary operators # ifdef BOOST_NO_STRICT_ITERATOR_INTEROPERABILITY # define BOOST_ITERATOR_FACADE_INTEROP_HEAD(prefix, op, result_type) \ template < \ class Derived1, class V1, class TC1, class Reference1, class Difference1 \ , class Derived2, class V2, class TC2, class Reference2, class Difference2 \ > \ prefix typename mpl::apply2::type \ operator op( \ iterator_facade const& lhs \ , iterator_facade const& rhs) # else # define BOOST_ITERATOR_FACADE_INTEROP_HEAD(prefix, op, result_type) \ template < \ class Derived1, class V1, class TC1, class Reference1, class Difference1 \ , class Derived2, class V2, class TC2, class Reference2, class Difference2 \ > \ prefix typename boost::detail::enable_if_interoperable< \ Derived1, Derived2 \ , typename mpl::apply2::type \ >::type \ operator op( \ iterator_facade const& lhs \ , iterator_facade const& rhs) # endif # define BOOST_ITERATOR_FACADE_PLUS_HEAD(prefix,args) \ template \ prefix Derived operator+ args // // Helper class for granting access to the iterator core interface. // // The simple core interface is used by iterator_facade. The core // interface of a user/library defined iterator type should not be made public // so that it does not clutter the public interface. Instead iterator_core_access // should be made friend so that iterator_facade can access the core // interface through iterator_core_access. // class iterator_core_access { # if defined(BOOST_NO_MEMBER_TEMPLATE_FRIENDS) // Tasteless as this may seem, making all members public allows member templates // to work in the absence of member template friends. public: # else template friend class iterator_facade; # define BOOST_ITERATOR_FACADE_RELATION(op) \ BOOST_ITERATOR_FACADE_INTEROP_HEAD(friend,op, boost::detail::always_bool2); BOOST_ITERATOR_FACADE_RELATION(==) BOOST_ITERATOR_FACADE_RELATION(!=) BOOST_ITERATOR_FACADE_RELATION(<) BOOST_ITERATOR_FACADE_RELATION(>) BOOST_ITERATOR_FACADE_RELATION(<=) BOOST_ITERATOR_FACADE_RELATION(>=) # undef BOOST_ITERATOR_FACADE_RELATION BOOST_ITERATOR_FACADE_INTEROP_HEAD( friend, -, boost::detail::choose_difference_type) ; BOOST_ITERATOR_FACADE_PLUS_HEAD( friend inline , (iterator_facade const& , typename Derived::difference_type) ) ; BOOST_ITERATOR_FACADE_PLUS_HEAD( friend inline , (typename Derived::difference_type , iterator_facade const&) ) ; # endif template static typename Facade::reference dereference(Facade const& f) { return f.dereference(); } template static void increment(Facade& f) { f.increment(); } template static void decrement(Facade& f) { f.decrement(); } template static bool equal(Facade1 const& f1, Facade2 const& f2, mpl::true_) { return f1.equal(f2); } template static bool equal(Facade1 const& f1, Facade2 const& f2, mpl::false_) { return f2.equal(f1); } template static void advance(Facade& f, typename Facade::difference_type n) { f.advance(n); } template static typename Facade1::difference_type distance_from( Facade1 const& f1, Facade2 const& f2, mpl::true_) { return -f1.distance_to(f2); } template static typename Facade2::difference_type distance_from( Facade1 const& f1, Facade2 const& f2, mpl::false_) { return f2.distance_to(f1); } // // Curiously Recurring Template interface. // template static I& derived(iterator_facade& facade) { return *static_cast(&facade); } template static I const& derived(iterator_facade const& facade) { return *static_cast(&facade); } private: // objects of this class are useless iterator_core_access(); //undefined }; // // iterator_facade - use as a public base class for defining new // standard-conforming iterators. // template < class Derived // The derived iterator type being constructed , class Value , class CategoryOrTraversal , class Reference = Value& , class Difference = std::ptrdiff_t > class iterator_facade # ifdef BOOST_ITERATOR_FACADE_NEEDS_ITERATOR_BASE : public boost::detail::iterator_facade_types< Value, CategoryOrTraversal, Reference, Difference >::base # undef BOOST_ITERATOR_FACADE_NEEDS_ITERATOR_BASE # endif { private: // // Curiously Recurring Template interface. // Derived& derived() { return *static_cast(this); } Derived const& derived() const { return *static_cast(this); } typedef boost::detail::iterator_facade_types< Value, CategoryOrTraversal, Reference, Difference > associated_types; typedef boost::detail::operator_arrow_dispatch< Reference , typename associated_types::pointer > operator_arrow_dispatch_; protected: // For use by derived classes typedef iterator_facade iterator_facade_; public: typedef typename associated_types::value_type value_type; typedef Reference reference; typedef Difference difference_type; typedef typename operator_arrow_dispatch_::result_type pointer; typedef typename associated_types::iterator_category iterator_category; reference operator*() const { return iterator_core_access::dereference(this->derived()); } pointer operator->() const { return operator_arrow_dispatch_::apply(*this->derived()); } typename boost::detail::operator_brackets_result::type operator[](difference_type n) const { typedef boost::detail::use_operator_brackets_proxy use_proxy; return boost::detail::make_operator_brackets_result( this->derived() + n , use_proxy() ); } Derived& operator++() { iterator_core_access::increment(this->derived()); return this->derived(); } # if BOOST_WORKAROUND(BOOST_MSVC, < 1300) typename boost::detail::postfix_increment_result::type operator++(int) { typename boost::detail::postfix_increment_result::type tmp(this->derived()); ++*this; return tmp; } # endif Derived& operator--() { iterator_core_access::decrement(this->derived()); return this->derived(); } Derived operator--(int) { Derived tmp(this->derived()); --*this; return tmp; } Derived& operator+=(difference_type n) { iterator_core_access::advance(this->derived(), n); return this->derived(); } Derived& operator-=(difference_type n) { iterator_core_access::advance(this->derived(), -n); return this->derived(); } Derived operator-(difference_type x) const { Derived result(this->derived()); return result -= x; } # if BOOST_WORKAROUND(BOOST_MSVC, < 1300) // There appears to be a bug which trashes the data of classes // derived from iterator_facade when they are assigned unless we // define this assignment operator. This bug is only revealed // (so far) in STLPort debug mode, but it's clearly a codegen // problem so we apply the workaround for all MSVC6. iterator_facade& operator=(iterator_facade const&) { return *this; } # endif }; # if !BOOST_WORKAROUND(BOOST_MSVC, < 1300) template inline typename boost::detail::postfix_increment_result::type operator++( iterator_facade& i , int ) { typename boost::detail::postfix_increment_result::type tmp(*static_cast(&i)); ++i; return tmp; } # endif // // Comparison operator implementation. The library supplied operators // enables the user to provide fully interoperable constant/mutable // iterator types. I.e. the library provides all operators // for all mutable/constant iterator combinations. // // Note though that this kind of interoperability for constant/mutable // iterators is not required by the standard for container iterators. // All the standard asks for is a conversion mutable -> constant. // Most standard library implementations nowadays provide fully interoperable // iterator implementations, but there are still heavily used implementations // that do not provide them. (Actually it's even worse, they do not provide // them for only a few iterators.) // // ?? Maybe a BOOST_ITERATOR_NO_FULL_INTEROPERABILITY macro should // enable the user to turn off mixed type operators // // The library takes care to provide only the right operator overloads. // I.e. // // bool operator==(Iterator, Iterator); // bool operator==(ConstIterator, Iterator); // bool operator==(Iterator, ConstIterator); // bool operator==(ConstIterator, ConstIterator); // // ... // // In order to do so it uses c++ idioms that are not yet widely supported // by current compiler releases. The library is designed to degrade gracefully // in the face of compiler deficiencies. In general compiler // deficiencies result in less strict error checking and more obscure // error messages, functionality is not affected. // // For full operation compiler support for "Substitution Failure Is Not An Error" // (aka. enable_if) and boost::is_convertible is required. // // The following problems occur if support is lacking. // // Pseudo code // // --------------- // AdaptorA a1; // AdaptorA a2; // // // This will result in a no such overload error in full operation // // If enable_if or is_convertible is not supported // // The instantiation will fail with an error hopefully indicating that // // there is no operator== for Iterator1, Iterator2 // // The same will happen if no enable_if is used to remove // // false overloads from the templated conversion constructor // // of AdaptorA. // // a1 == a2; // ---------------- // // AdaptorA a; // AdaptorB b; // // // This will result in a no such overload error in full operation // // If enable_if is not supported the static assert used // // in the operator implementation will fail. // // This will accidently work if is_convertible is not supported. // // a == b; // ---------------- // # ifdef BOOST_NO_ONE_WAY_ITERATOR_INTEROP # define BOOST_ITERATOR_CONVERTIBLE(a,b) mpl::true_() # else # define BOOST_ITERATOR_CONVERTIBLE(a,b) is_convertible() # endif # define BOOST_ITERATOR_FACADE_INTEROP(op, result_type, return_prefix, base_op) \ BOOST_ITERATOR_FACADE_INTEROP_HEAD(inline, op, result_type) \ { \ /* For those compilers that do not support enable_if */ \ BOOST_STATIC_ASSERT(( \ is_interoperable< Derived1, Derived2 >::value \ )); \ return_prefix iterator_core_access::base_op( \ *static_cast(&lhs) \ , *static_cast(&rhs) \ , BOOST_ITERATOR_CONVERTIBLE(Derived2,Derived1) \ ); \ } # define BOOST_ITERATOR_FACADE_RELATION(op, return_prefix, base_op) \ BOOST_ITERATOR_FACADE_INTEROP( \ op \ , boost::detail::always_bool2 \ , return_prefix \ , base_op \ ) BOOST_ITERATOR_FACADE_RELATION(==, return, equal) BOOST_ITERATOR_FACADE_RELATION(!=, return !, equal) BOOST_ITERATOR_FACADE_RELATION(<, return 0 >, distance_from) BOOST_ITERATOR_FACADE_RELATION(>, return 0 <, distance_from) BOOST_ITERATOR_FACADE_RELATION(<=, return 0 >=, distance_from) BOOST_ITERATOR_FACADE_RELATION(>=, return 0 <=, distance_from) # undef BOOST_ITERATOR_FACADE_RELATION // operator- requires an additional part in the static assertion BOOST_ITERATOR_FACADE_INTEROP( - , boost::detail::choose_difference_type , return , distance_from ) # undef BOOST_ITERATOR_FACADE_INTEROP # undef BOOST_ITERATOR_FACADE_INTEROP_HEAD # define BOOST_ITERATOR_FACADE_PLUS(args) \ BOOST_ITERATOR_FACADE_PLUS_HEAD(inline, args) \ { \ Derived tmp(static_cast(i)); \ return tmp += n; \ } BOOST_ITERATOR_FACADE_PLUS(( iterator_facade const& i , typename Derived::difference_type n )) BOOST_ITERATOR_FACADE_PLUS(( typename Derived::difference_type n , iterator_facade const& i )) # undef BOOST_ITERATOR_FACADE_PLUS # undef BOOST_ITERATOR_FACADE_PLUS_HEAD } // namespace boost #include #endif // BOOST_ITERATOR_FACADE_23022003THW_HPP madp-0.4/src/boost/boost/iterator/PaxHeaders.5405/reverse_iterator.hpp0000644000000000000000000000007412717644140022754 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/iterator/reverse_iterator.hpp0000664000372100037210000000361212717644140023605 0ustar00fransfrans00000000000000// (C) Copyright David Abrahams 2002. // (C) Copyright Jeremy Siek 2002. // (C) Copyright Thomas Witt 2002. // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_REVERSE_ITERATOR_23022003THW_HPP #define BOOST_REVERSE_ITERATOR_23022003THW_HPP #include #include #include namespace boost { // // // template class reverse_iterator : public iterator_adaptor< reverse_iterator, Iterator > { typedef iterator_adaptor< reverse_iterator, Iterator > super_t; friend class iterator_core_access; public: reverse_iterator() {} explicit reverse_iterator(Iterator x) : super_t(x) {} template reverse_iterator( reverse_iterator const& r , typename enable_if_convertible::type* = 0 ) : super_t(r.base()) {} private: typename super_t::reference dereference() const { return *boost::prior(this->base()); } void increment() { --this->base_reference(); } void decrement() { ++this->base_reference(); } void advance(typename super_t::difference_type n) { this->base_reference() += -n; } template typename super_t::difference_type distance_to(reverse_iterator const& y) const { return this->base_reference() - y.base(); } }; template reverse_iterator make_reverse_iterator(BidirectionalIterator x) { return reverse_iterator(x); } } // namespace boost #endif // BOOST_REVERSE_ITERATOR_23022003THW_HPP madp-0.4/src/boost/boost/iterator/PaxHeaders.5405/iterator_traits.hpp0000644000000000000000000000007412717644140022607 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/iterator/iterator_traits.hpp0000664000372100037210000000376212717644140023446 0ustar00fransfrans00000000000000// Copyright David Abrahams 2003. // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef ITERATOR_TRAITS_DWA200347_HPP # define ITERATOR_TRAITS_DWA200347_HPP # include # include namespace boost { // Unfortunately, g++ 2.95.x chokes when we define a class template // iterator_category which has the same name as its // std::iterator_category() function, probably due in part to the // "std:: is visible globally" hack it uses. Use // BOOST_ITERATOR_CATEGORY to write code that's portable to older // GCCs. # if BOOST_WORKAROUND(__GNUC__, <= 2) # define BOOST_ITERATOR_CATEGORY iterator_category_ # else # define BOOST_ITERATOR_CATEGORY iterator_category # endif template struct iterator_value { typedef typename boost::detail::iterator_traits::value_type type; }; template struct iterator_reference { typedef typename boost::detail::iterator_traits::reference type; }; template struct iterator_pointer { typedef typename boost::detail::iterator_traits::pointer type; }; template struct iterator_difference { typedef typename boost::detail::iterator_traits::difference_type type; }; template struct BOOST_ITERATOR_CATEGORY { typedef typename boost::detail::iterator_traits::iterator_category type; }; # if BOOST_WORKAROUND(BOOST_MSVC, < 1300) template <> struct iterator_value { typedef void type; }; template <> struct iterator_reference { typedef void type; }; template <> struct iterator_pointer { typedef void type; }; template <> struct iterator_difference { typedef void type; }; template <> struct BOOST_ITERATOR_CATEGORY { typedef void type; }; # endif } // namespace boost::iterator #endif // ITERATOR_TRAITS_DWA200347_HPP madp-0.4/src/boost/boost/iterator/PaxHeaders.5405/iterator_adaptor.hpp0000644000000000000000000000007412717644140022733 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/iterator/iterator_adaptor.hpp0000664000372100037210000002615112717644140023567 0ustar00fransfrans00000000000000// (C) Copyright David Abrahams 2002. // (C) Copyright Jeremy Siek 2002. // (C) Copyright Thomas Witt 2002. // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_ITERATOR_ADAPTOR_23022003THW_HPP #define BOOST_ITERATOR_ADAPTOR_23022003THW_HPP #include #include #include #include #include #include #include #include #include #include #include #ifdef BOOST_ITERATOR_REF_CONSTNESS_KILLS_WRITABILITY # include #endif #include #include #include namespace boost { // Used as a default template argument internally, merely to // indicate "use the default", this can also be passed by users // explicitly in order to specify that the default should be used. struct use_default; # ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION // the incompleteness of use_default causes massive problems for // is_convertible (naturally). This workaround is fortunately not // needed for vc6/vc7. template struct is_convertible : mpl::false_ {}; # endif namespace detail { // // Result type used in enable_if_convertible meta function. // This can be an incomplete type, as only pointers to // enable_if_convertible< ... >::type are used. // We could have used void for this, but conversion to // void* is just to easy. // struct enable_type; } // // enable_if for use in adapted iterators constructors. // // In order to provide interoperability between adapted constant and // mutable iterators, adapted iterators will usually provide templated // conversion constructors of the following form // // template // class adapted_iterator : // public iterator_adaptor< adapted_iterator, Iterator > // { // public: // // ... // // template // adapted_iterator( // OtherIterator const& it // , typename enable_if_convertible::type* = 0); // // ... // }; // // enable_if_convertible is used to remove those overloads from the overload // set that cannot be instantiated. For all practical purposes only overloads // for constant/mutable interaction will remain. This has the advantage that // meta functions like boost::is_convertible do not return false positives, // as they can only look at the signature of the conversion constructor // and not at the actual instantiation. // // enable_if_interoperable can be safely used in user code. It falls back to // always enabled for compilers that don't support enable_if or is_convertible. // There is no need for compiler specific workarounds in user code. // // The operators implementation relies on boost::is_convertible not returning // false positives for user/library defined iterator types. See comments // on operator implementation for consequences. // # if BOOST_WORKAROUND(BOOST_MSVC, <= 1300) template struct enable_if_convertible { typedef typename mpl::if_< mpl::or_< is_same , is_convertible > , boost::detail::enable_type , int& >::type type; }; # elif defined(BOOST_NO_IS_CONVERTIBLE) || defined(BOOST_NO_SFINAE) template struct enable_if_convertible { typedef boost::detail::enable_type type; }; # elif BOOST_WORKAROUND(_MSC_FULL_VER, BOOST_TESTED_AT(13102292)) && BOOST_MSVC > 1300 // For some reason vc7.1 needs us to "cut off" instantiation // of is_convertible in a few cases. template struct enable_if_convertible : iterators::enable_if< mpl::or_< is_same , is_convertible > , boost::detail::enable_type > {}; # else template struct enable_if_convertible : iterators::enable_if< is_convertible , boost::detail::enable_type > {}; # endif // // Default template argument handling for iterator_adaptor // namespace detail { // If T is use_default, return the result of invoking // DefaultNullaryFn, otherwise return T. template struct ia_dflt_help : mpl::eval_if< is_same , DefaultNullaryFn , mpl::identity > { }; // A metafunction which computes an iterator_adaptor's base class, // a specialization of iterator_facade. template < class Derived , class Base , class Value , class Traversal , class Reference , class Difference > struct iterator_adaptor_base { typedef iterator_facade< Derived # ifdef BOOST_ITERATOR_REF_CONSTNESS_KILLS_WRITABILITY , typename boost::detail::ia_dflt_help< Value , mpl::eval_if< is_same , iterator_value , remove_reference > >::type # else , typename boost::detail::ia_dflt_help< Value, iterator_value >::type # endif , typename boost::detail::ia_dflt_help< Traversal , iterator_traversal >::type , typename boost::detail::ia_dflt_help< Reference , mpl::eval_if< is_same , iterator_reference , add_reference > >::type , typename boost::detail::ia_dflt_help< Difference, iterator_difference >::type > type; }; // workaround for aC++ CR JAGaf33512 template inline void iterator_adaptor_assert_traversal () { BOOST_STATIC_ASSERT((is_convertible::value)); } } // // Iterator Adaptor // // The parameter ordering changed slightly with respect to former // versions of iterator_adaptor The idea is that when the user needs // to fiddle with the reference type it is highly likely that the // iterator category has to be adjusted as well. Any of the // following four template arguments may be ommitted or explicitly // replaced by use_default. // // Value - if supplied, the value_type of the resulting iterator, unless // const. If const, a conforming compiler strips constness for the // value_type. If not supplied, iterator_traits::value_type is used // // Category - the traversal category of the resulting iterator. If not // supplied, iterator_traversal::type is used. // // Reference - the reference type of the resulting iterator, and in // particular, the result type of operator*(). If not supplied but // Value is supplied, Value& is used. Otherwise // iterator_traits::reference is used. // // Difference - the difference_type of the resulting iterator. If not // supplied, iterator_traits::difference_type is used. // template < class Derived , class Base , class Value = use_default , class Traversal = use_default , class Reference = use_default , class Difference = use_default > class iterator_adaptor : public boost::detail::iterator_adaptor_base< Derived, Base, Value, Traversal, Reference, Difference >::type { friend class iterator_core_access; protected: typedef typename boost::detail::iterator_adaptor_base< Derived, Base, Value, Traversal, Reference, Difference >::type super_t; public: iterator_adaptor() {} explicit iterator_adaptor(Base const &iter) : m_iterator(iter) { } typedef Base base_type; Base const& base() const { return m_iterator; } protected: // for convenience in derived classes typedef iterator_adaptor iterator_adaptor_; // // lvalue access to the Base object for Derived // Base const& base_reference() const { return m_iterator; } Base& base_reference() { return m_iterator; } private: // // Core iterator interface for iterator_facade. This is private // to prevent temptation for Derived classes to use it, which // will often result in an error. Derived classes should use // base_reference(), above, to get direct access to m_iterator. // typename super_t::reference dereference() const { return *m_iterator; } template < class OtherDerived, class OtherIterator, class V, class C, class R, class D > bool equal(iterator_adaptor const& x) const { // Maybe readd with same_distance // BOOST_STATIC_ASSERT( // (detail::same_category_and_difference::value) // ); return m_iterator == x.base(); } typedef typename iterator_category_to_traversal< typename super_t::iterator_category >::type my_traversal; # define BOOST_ITERATOR_ADAPTOR_ASSERT_TRAVERSAL(cat) \ boost::detail::iterator_adaptor_assert_traversal(); void advance(typename super_t::difference_type n) { BOOST_ITERATOR_ADAPTOR_ASSERT_TRAVERSAL(random_access_traversal_tag) m_iterator += n; } void increment() { ++m_iterator; } void decrement() { BOOST_ITERATOR_ADAPTOR_ASSERT_TRAVERSAL(bidirectional_traversal_tag) --m_iterator; } template < class OtherDerived, class OtherIterator, class V, class C, class R, class D > typename super_t::difference_type distance_to( iterator_adaptor const& y) const { BOOST_ITERATOR_ADAPTOR_ASSERT_TRAVERSAL(random_access_traversal_tag) // Maybe readd with same_distance // BOOST_STATIC_ASSERT( // (detail::same_category_and_difference::value) // ); return y.base() - m_iterator; } # undef BOOST_ITERATOR_ADAPTOR_ASSERT_TRAVERSAL private: // data members Base m_iterator; }; } // namespace boost #include #endif // BOOST_ITERATOR_ADAPTOR_23022003THW_HPP madp-0.4/src/boost/boost/iterator/PaxHeaders.5405/detail0000644000000000000000000000007412717644140020044 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/iterator/detail/0000775000372100037210000000000012717644140020750 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/iterator/detail/PaxHeaders.5405/enable_if.hpp0000644000000000000000000000007412717644140022536 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/iterator/detail/enable_if.hpp0000664000372100037210000000373312717644140023373 0ustar00fransfrans00000000000000// (C) Copyright David Abrahams 2002. // (C) Copyright Jeremy Siek 2002. // (C) Copyright Thomas Witt 2002. // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_ENABLE_IF_23022003THW_HPP #define BOOST_ENABLE_IF_23022003THW_HPP #include #include #include // // Boost iterators uses its own enable_if cause we need // special semantics for deficient compilers. // 23/02/03 thw // namespace boost { namespace iterators { // // Base machinery for all kinds of enable if // template struct enabled { template struct base { typedef T type; }; }; // // For compilers that don't support "Substitution Failure Is Not An Error" // enable_if falls back to always enabled. See comments // on operator implementation for consequences. // template<> struct enabled { template struct base { #ifdef BOOST_NO_SFINAE typedef T type; // This way to do it would give a nice error message containing // invalid overload, but has the big disadvantage that // there is no reference to user code in the error message. // // struct invalid_overload; // typedef invalid_overload type; // #endif }; }; template struct enable_if # if !defined(BOOST_NO_SFINAE) && !defined(BOOST_NO_IS_CONVERTIBLE) : enabled<(Cond::value)>::template base # else : mpl::identity # endif { # if BOOST_WORKAROUND(BOOST_MSVC, < 1300) typedef Return type; # endif }; } // namespace iterators } // namespace boost #include #endif // BOOST_ENABLE_IF_23022003THW_HPP madp-0.4/src/boost/boost/iterator/detail/PaxHeaders.5405/facade_iterator_category.hpp0000644000000000000000000000007412717644140025643 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/iterator/detail/facade_iterator_category.hpp0000664000372100037210000001430412717644140026474 0ustar00fransfrans00000000000000// Copyright David Abrahams 2003. Use, modification and distribution is // subject to the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) #ifndef FACADE_ITERATOR_CATEGORY_DWA20031118_HPP # define FACADE_ITERATOR_CATEGORY_DWA20031118_HPP # include # include // used in iterator_tag inheritance logic # include # include # include # include # include # include # include # include # include # include # include // try to keep this last # ifdef BOOST_ITERATOR_REF_CONSTNESS_KILLS_WRITABILITY # include # endif // // iterator_category deduction for iterator_facade // // forward declaration namespace boost { struct use_default; } namespace boost { namespace detail { struct input_output_iterator_tag : std::input_iterator_tag { // Using inheritance for only input_iterator_tag helps to avoid // ambiguities when a stdlib implementation dispatches on a // function which is overloaded on both input_iterator_tag and // output_iterator_tag, as STLPort does, in its __valid_range // function. I claim it's better to avoid the ambiguity in these // cases. operator std::output_iterator_tag() const { return std::output_iterator_tag(); } }; // // True iff the user has explicitly disabled writability of this // iterator. Pass the iterator_facade's Value parameter and its // nested ::reference type. // template struct iterator_writability_disabled # ifdef BOOST_ITERATOR_REF_CONSTNESS_KILLS_WRITABILITY // Adding Thomas' logic? : mpl::or_< is_const , boost::detail::indirect_traits::is_reference_to_const , is_const > # else : is_const # endif {}; // // Convert an iterator_facade's traversal category, Value parameter, // and ::reference type to an appropriate old-style category. // // If writability has been disabled per the above metafunction, the // result will not be convertible to output_iterator_tag. // // Otherwise, if Traversal == single_pass_traversal_tag, the following // conditions will result in a tag that is convertible both to // input_iterator_tag and output_iterator_tag: // // 1. Reference is a reference to non-const // 2. Reference is not a reference and is convertible to Value // template struct iterator_facade_default_category : mpl::eval_if< mpl::and_< is_reference , is_convertible > , mpl::eval_if< is_convertible , mpl::identity , mpl::if_< is_convertible , std::bidirectional_iterator_tag , std::forward_iterator_tag > > , typename mpl::eval_if< mpl::and_< is_convertible // check for readability , is_convertible > , mpl::identity , mpl::identity > > { }; // True iff T is convertible to an old-style iterator category. template struct is_iterator_category : mpl::or_< is_convertible , is_convertible > { }; template struct is_iterator_traversal : is_convertible {}; // // A composite iterator_category tag convertible to Category (a pure // old-style category) and Traversal (a pure traversal tag). // Traversal must be a strict increase of the traversal power given by // Category. // template struct iterator_category_with_traversal : Category, Traversal { # if !BOOST_WORKAROUND(BOOST_MSVC, <= 1300) // Make sure this isn't used to build any categories where // convertibility to Traversal is redundant. Should just use the // Category element in that case. BOOST_MPL_ASSERT_NOT(( is_convertible< typename iterator_category_to_traversal::type , Traversal >)); BOOST_MPL_ASSERT((is_iterator_category)); BOOST_MPL_ASSERT_NOT((is_iterator_category)); BOOST_MPL_ASSERT_NOT((is_iterator_traversal)); # if !BOOST_WORKAROUND(BOOST_MSVC, BOOST_TESTED_AT(1310)) BOOST_MPL_ASSERT((is_iterator_traversal)); # endif # endif }; // Computes an iterator_category tag whose traversal is Traversal and // which is appropriate for an iterator template struct facade_iterator_category_impl { # if !BOOST_WORKAROUND(BOOST_MSVC, <= 1300) BOOST_MPL_ASSERT_NOT((is_iterator_category)); # endif typedef typename iterator_facade_default_category< Traversal,ValueParam,Reference >::type category; typedef typename mpl::if_< is_same< Traversal , typename iterator_category_to_traversal::type > , category , iterator_category_with_traversal >::type type; }; // // Compute an iterator_category for iterator_facade // template struct facade_iterator_category : mpl::eval_if< is_iterator_category , mpl::identity // old-style categories are fine as-is , facade_iterator_category_impl > { }; }} // namespace boost::detail # include #endif // FACADE_ITERATOR_CATEGORY_DWA20031118_HPP madp-0.4/src/boost/boost/iterator/detail/PaxHeaders.5405/config_def.hpp0000644000000000000000000000007412717644140022715 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/iterator/detail/config_def.hpp0000664000372100037210000001056212717644140023550 0ustar00fransfrans00000000000000// (C) Copyright David Abrahams 2002. // (C) Copyright Jeremy Siek 2002. // (C) Copyright Thomas Witt 2002. // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // no include guard multiple inclusion intended // // This is a temporary workaround until the bulk of this is // available in boost config. // 23/02/03 thw // #include // for prior #include #ifdef BOOST_ITERATOR_CONFIG_DEF # error you have nested config_def #inclusion. #else # define BOOST_ITERATOR_CONFIG_DEF #endif // We enable this always now. Otherwise, the simple case in // libs/iterator/test/constant_iterator_arrow.cpp fails to compile // because the operator-> return is improperly deduced as a non-const // pointer. #if 1 || defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \ || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x531)) // Recall that in general, compilers without partial specialization // can't strip constness. Consider counting_iterator, which normally // passes a const Value to iterator_facade. As a result, any code // which makes a std::vector of the iterator's value_type will fail // when its allocator declares functions overloaded on reference and // const_reference (the same type). // // Furthermore, Borland 5.5.1 drops constness in enough ways that we // end up using a proxy for operator[] when we otherwise shouldn't. // Using reference constness gives it an extra hint that it can // return the value_type from operator[] directly, but is not // strictly necessary. Not sure how best to resolve this one. # define BOOST_ITERATOR_REF_CONSTNESS_KILLS_WRITABILITY 1 #endif #if BOOST_WORKAROUND(BOOST_MSVC, <= 1300) \ || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x5A0)) \ || (BOOST_WORKAROUND(BOOST_INTEL_CXX_VERSION, <= 700) && defined(_MSC_VER)) \ || BOOST_WORKAROUND(__DECCXX_VER, BOOST_TESTED_AT(60590042)) \ || BOOST_WORKAROUND(__SUNPRO_CC, BOOST_TESTED_AT(0x590)) # define BOOST_NO_LVALUE_RETURN_DETECTION # if 0 // test code struct v {}; typedef char (&no)[3]; template no foo(T const&, ...); template char foo(T&, int); struct value_iterator { v operator*() const; }; template struct lvalue_deref_helper { static T& x; enum { value = (sizeof(foo(*x,0)) == 1) }; }; int z2[(lvalue_deref_helper::value == 1) ? 1 : -1]; int z[(lvalue_deref_helper::value) == 1 ? -1 : 1 ]; # endif #endif #if BOOST_WORKAROUND(__MWERKS__, <=0x2407) # define BOOST_NO_IS_CONVERTIBLE // "is_convertible doesn't work for simple types" #endif #if BOOST_WORKAROUND(__GNUC__, == 2) \ || BOOST_WORKAROUND(__GNUC__, == 3) && BOOST_WORKAROUND(__GNUC_MINOR__, < 4) && !defined(__EDG_VERSION__) \ || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x551)) # define BOOST_NO_IS_CONVERTIBLE_TEMPLATE // The following program fails to compile: # if 0 // test code #include template struct foo { foo(T); template foo(foo const& other) : p(other.p) { } T p; }; bool x = boost::is_convertible, foo >::value; # endif #endif #if !defined(BOOST_MSVC) && (defined(BOOST_NO_SFINAE) || defined(BOOST_NO_IS_CONVERTIBLE) || defined(BOOST_NO_IS_CONVERTIBLE_TEMPLATE)) # define BOOST_NO_STRICT_ITERATOR_INTEROPERABILITY #endif # if !BOOST_WORKAROUND(BOOST_MSVC, <= 1300) # define BOOST_ARG_DEPENDENT_TYPENAME typename # else # define BOOST_ARG_DEPENDENT_TYPENAME # endif # if BOOST_WORKAROUND(__GNUC__, == 2) && BOOST_WORKAROUND(__GNUC_MINOR__, BOOST_TESTED_AT(95)) \ || BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) // GCC-2.95 eagerly instantiates templated constructors and conversion // operators in convertibility checks, causing premature errors. // // Borland's problems are harder to diagnose due to lack of an // instantiation stack backtrace. They may be due in part to the fact // that it drops cv-qualification willy-nilly in templates. # define BOOST_NO_ONE_WAY_ITERATOR_INTEROP # endif // no include guard; multiple inclusion intended madp-0.4/src/boost/boost/iterator/detail/PaxHeaders.5405/config_undef.hpp0000644000000000000000000000007412717644140023260 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/iterator/detail/config_undef.hpp0000664000372100037210000000132212717644140024105 0ustar00fransfrans00000000000000// (C) Copyright Thomas Witt 2002. // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // no include guard multiple inclusion intended // // This is a temporary workaround until the bulk of this is // available in boost config. // 23/02/03 thw // #undef BOOST_NO_IS_CONVERTIBLE #undef BOOST_NO_IS_CONVERTIBLE_TEMPLATE #undef BOOST_NO_STRICT_ITERATOR_INTEROPERABILITY #undef BOOST_ARG_DEPENDENT_TYPENAME #undef BOOST_NO_LVALUE_RETURN_DETECTION #undef BOOST_NO_ONE_WAY_ITERATOR_INTEROP #ifdef BOOST_ITERATOR_CONFIG_DEF # undef BOOST_ITERATOR_CONFIG_DEF #else # error missing or nested #include config_def #endif madp-0.4/src/boost/boost/iterator/PaxHeaders.5405/iterator_categories.hpp0000644000000000000000000000007412717644140023426 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/iterator/iterator_categories.hpp0000664000372100037210000001231312717644140024255 0ustar00fransfrans00000000000000// (C) Copyright Jeremy Siek 2002. // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_ITERATOR_CATEGORIES_HPP # define BOOST_ITERATOR_CATEGORIES_HPP # include # include # include # include # include # include # include # include # include # include namespace boost { // // Traversal Categories // struct no_traversal_tag {}; struct incrementable_traversal_tag : no_traversal_tag { // incrementable_traversal_tag() {} // incrementable_traversal_tag(std::output_iterator_tag const&) {}; }; struct single_pass_traversal_tag : incrementable_traversal_tag { // single_pass_traversal_tag() {} // single_pass_traversal_tag(std::input_iterator_tag const&) {}; }; struct forward_traversal_tag : single_pass_traversal_tag { // forward_traversal_tag() {} // forward_traversal_tag(std::forward_iterator_tag const&) {}; }; struct bidirectional_traversal_tag : forward_traversal_tag { // bidirectional_traversal_tag() {}; // bidirectional_traversal_tag(std::bidirectional_iterator_tag const&) {}; }; struct random_access_traversal_tag : bidirectional_traversal_tag { // random_access_traversal_tag() {}; // random_access_traversal_tag(std::random_access_iterator_tag const&) {}; }; namespace detail { // // Convert a "strictly old-style" iterator category to a traversal // tag. This is broken out into a separate metafunction to reduce // the cost of instantiating iterator_category_to_traversal, below, // for new-style types. // template struct old_category_to_traversal : mpl::eval_if< is_convertible , mpl::identity , mpl::eval_if< is_convertible , mpl::identity , mpl::eval_if< is_convertible , mpl::identity , mpl::eval_if< is_convertible , mpl::identity , mpl::eval_if< is_convertible , mpl::identity , void > > > > > {}; # if BOOST_WORKAROUND(BOOST_MSVC, < 1300) template <> struct old_category_to_traversal { typedef int type; }; # endif template struct pure_traversal_tag : mpl::eval_if< is_convertible , mpl::identity , mpl::eval_if< is_convertible , mpl::identity , mpl::eval_if< is_convertible , mpl::identity , mpl::eval_if< is_convertible , mpl::identity , mpl::eval_if< is_convertible , mpl::identity , void > > > > > { }; # if BOOST_WORKAROUND(BOOST_MSVC, < 1300) template <> struct pure_traversal_tag { typedef int type; }; # endif } // namespace detail // // Convert an iterator category into a traversal tag // template struct iterator_category_to_traversal : mpl::eval_if< // if already convertible to a traversal tag, we're done. is_convertible , mpl::identity , boost::detail::old_category_to_traversal > {}; // Trait to get an iterator's traversal category template struct iterator_traversal : iterator_category_to_traversal< typename boost::detail::iterator_traits::iterator_category > {}; # ifdef BOOST_MPL_CFG_NO_FULL_LAMBDA_SUPPORT // Hack because BOOST_MPL_AUX_LAMBDA_SUPPORT doesn't seem to work // out well. Instantiating the nested apply template also // requires instantiating iterator_traits on the // placeholder. Instead we just specialize it as a metafunction // class. template <> struct iterator_traversal { template struct apply : iterator_traversal {}; }; template <> struct iterator_traversal : iterator_traversal {}; # endif } // namespace boost #include #endif // BOOST_ITERATOR_CATEGORIES_HPP madp-0.4/src/boost/boost/iterator/PaxHeaders.5405/interoperable.hpp0000644000000000000000000000007412717644140022223 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/iterator/interoperable.hpp0000664000372100037210000000270312717644140023054 0ustar00fransfrans00000000000000// (C) Copyright David Abrahams 2002. // (C) Copyright Jeremy Siek 2002. // (C) Copyright Thomas Witt 2002. // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_INTEROPERABLE_23022003THW_HPP # define BOOST_INTEROPERABLE_23022003THW_HPP # include # include # include # include // must appear last namespace boost { // // Meta function that determines whether two // iterator types are considered interoperable. // // Two iterator types A,B are considered interoperable if either // A is convertible to B or vice versa. // This interoperability definition is in sync with the // standards requirements on constant/mutable container // iterators (23.1 [lib.container.requirements]). // // For compilers that don't support is_convertible // is_interoperable gives false positives. See comments // on operator implementation for consequences. // template struct is_interoperable # ifdef BOOST_NO_STRICT_ITERATOR_INTEROPERABILITY : mpl::true_ # else : mpl::or_< is_convertible< A, B > , is_convertible< B, A > > # endif { }; } // namespace boost # include #endif // BOOST_INTEROPERABLE_23022003THW_HPP madp-0.4/src/boost/boost/PaxHeaders.5405/random0000644000000000000000000000007412717644140016231 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/random/0000775000372100037210000000000012717644140017135 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/random/PaxHeaders.5405/linear_congruential.hpp0000644000000000000000000000007312717644140023042 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/random/linear_congruential.hpp0000664000372100037210000003731312717644140023701 0ustar00fransfrans00000000000000/* boost random/linear_congruential.hpp header file * * Copyright Jens Maurer 2000-2001 * Distributed under the Boost Software License, Version 1.0. (See * accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org for most recent version including documentation. * * $Id: linear_congruential.hpp 71018 2011-04-05 21:27:52Z steven_watanabe $ * * Revision history * 2001-02-18 moved to individual header files */ #ifndef BOOST_RANDOM_LINEAR_CONGRUENTIAL_HPP #define BOOST_RANDOM_LINEAR_CONGRUENTIAL_HPP #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include namespace boost { namespace random { /** * Instantiations of class template linear_congruential_engine model a * \pseudo_random_number_generator. Linear congruential pseudo-random * number generators are described in: * * @blockquote * "Mathematical methods in large-scale computing units", D. H. Lehmer, * Proc. 2nd Symposium on Large-Scale Digital Calculating Machines, * Harvard University Press, 1951, pp. 141-146 * @endblockquote * * Let x(n) denote the sequence of numbers returned by some pseudo-random * number generator. Then for the linear congruential generator, * x(n+1) := (a * x(n) + c) mod m. Parameters for the generator are * x(0), a, c, m. The template parameter IntType shall denote an integral * type. It must be large enough to hold values a, c, and m. The template * parameters a and c must be smaller than m. * * Note: The quality of the generator crucially depends on the choice of * the parameters. User code should use one of the sensibly parameterized * generators such as minstd_rand instead. */ template class linear_congruential_engine { public: typedef IntType result_type; // Required for old Boost.Random concept BOOST_STATIC_CONSTANT(bool, has_fixed_range = false); BOOST_STATIC_CONSTANT(IntType, multiplier = a); BOOST_STATIC_CONSTANT(IntType, increment = c); BOOST_STATIC_CONSTANT(IntType, modulus = m); BOOST_STATIC_CONSTANT(IntType, default_seed = 1); BOOST_STATIC_ASSERT(std::numeric_limits::is_integer); BOOST_STATIC_ASSERT(m == 0 || a < m); BOOST_STATIC_ASSERT(m == 0 || c < m); /** * Constructs a @c linear_congruential_engine, using the default seed */ linear_congruential_engine() { seed(); } /** * Constructs a @c linear_congruential_engine, seeding it with @c x0. */ BOOST_RANDOM_DETAIL_ARITHMETIC_CONSTRUCTOR(linear_congruential_engine, IntType, x0) { seed(x0); } /** * Constructs a @c linear_congruential_engine, seeding it with values * produced by a call to @c seq.generate(). */ BOOST_RANDOM_DETAIL_SEED_SEQ_CONSTRUCTOR(linear_congruential_engine, SeedSeq, seq) { seed(seq); } /** * Constructs a @c linear_congruential_engine and seeds it * with values taken from the itrator range [first, last) * and adjusts first to point to the element after the last one * used. If there are not enough elements, throws @c std::invalid_argument. * * first and last must be input iterators. */ template linear_congruential_engine(It& first, It last) { seed(first, last); } // compiler-generated copy constructor and assignment operator are fine /** * Calls seed(default_seed) */ void seed() { seed(default_seed); } /** * If c mod m is zero and x0 mod m is zero, changes the current value of * the generator to 1. Otherwise, changes it to x0 mod m. If c is zero, * distinct seeds in the range [1,m) will leave the generator in distinct * states. If c is not zero, the range is [0,m). */ BOOST_RANDOM_DETAIL_ARITHMETIC_SEED(linear_congruential_engine, IntType, x0) { // wrap _x if it doesn't fit in the destination if(modulus == 0) { _x = x0; } else { _x = x0 % modulus; } // handle negative seeds if(_x <= 0 && _x != 0) { _x += modulus; } // adjust to the correct range if(increment == 0 && _x == 0) { _x = 1; } BOOST_ASSERT(_x >= (min)()); BOOST_ASSERT(_x <= (max)()); } /** * Seeds a @c linear_congruential_engine using values from a SeedSeq. */ BOOST_RANDOM_DETAIL_SEED_SEQ_SEED(linear_congruential_engine, SeedSeq, seq) { seed(detail::seed_one_int(seq)); } /** * seeds a @c linear_congruential_engine with values taken * from the itrator range [first, last) and adjusts @c first to * point to the element after the last one used. If there are * not enough elements, throws @c std::invalid_argument. * * @c first and @c last must be input iterators. */ template void seed(It& first, It last) { seed(detail::get_one_int(first, last)); } /** * Returns the smallest value that the @c linear_congruential_engine * can produce. */ static result_type min BOOST_PREVENT_MACRO_SUBSTITUTION () { return c == 0 ? 1 : 0; } /** * Returns the largest value that the @c linear_congruential_engine * can produce. */ static result_type max BOOST_PREVENT_MACRO_SUBSTITUTION () { return modulus-1; } /** Returns the next value of the @c linear_congruential_engine. */ IntType operator()() { _x = const_mod::mult_add(a, _x, c); return _x; } /** Fills a range with random values */ template void generate(Iter first, Iter last) { detail::generate_from_int(*this, first, last); } /** Advances the state of the generator by @c z. */ void discard(boost::uintmax_t z) { typedef const_mod mod_type; IntType b_inv = mod_type::invert(a-1); IntType b_gcd = mod_type::mult(a-1, b_inv); if(b_gcd == 1) { IntType a_z = mod_type::pow(a, z); _x = mod_type::mult_add(a_z, _x, mod_type::mult(mod_type::mult(c, b_inv), a_z - 1)); } else { // compute (a^z - 1)*c % (b_gcd * m) / (b / b_gcd) * inv(b / b_gcd) // we're storing the intermediate result / b_gcd IntType a_zm1_over_gcd = 0; IntType a_km1_over_gcd = (a - 1) / b_gcd; boost::uintmax_t exponent = z; while(exponent != 0) { if(exponent % 2 == 1) { a_zm1_over_gcd = mod_type::mult_add( b_gcd, mod_type::mult(a_zm1_over_gcd, a_km1_over_gcd), mod_type::add(a_zm1_over_gcd, a_km1_over_gcd)); } a_km1_over_gcd = mod_type::mult_add( b_gcd, mod_type::mult(a_km1_over_gcd, a_km1_over_gcd), mod_type::add(a_km1_over_gcd, a_km1_over_gcd)); exponent /= 2; } IntType a_z = mod_type::mult_add(b_gcd, a_zm1_over_gcd, 1); IntType num = mod_type::mult(c, a_zm1_over_gcd); b_inv = mod_type::invert((a-1)/b_gcd); _x = mod_type::mult_add(a_z, _x, mod_type::mult(b_inv, num)); } } friend bool operator==(const linear_congruential_engine& x, const linear_congruential_engine& y) { return x._x == y._x; } friend bool operator!=(const linear_congruential_engine& x, const linear_congruential_engine& y) { return !(x == y); } #if !defined(BOOST_RANDOM_NO_STREAM_OPERATORS) /** Writes a @c linear_congruential_engine to a @c std::ostream. */ template friend std::basic_ostream& operator<<(std::basic_ostream& os, const linear_congruential_engine& lcg) { return os << lcg._x; } /** Reads a @c linear_congruential_engine from a @c std::istream. */ template friend std::basic_istream& operator>>(std::basic_istream& is, linear_congruential_engine& lcg) { lcg.read(is); return is; } #endif private: /// \cond show_private template void read(std::basic_istream& is) { IntType x; if(is >> x) { if(x >= (min)() && x <= (max)()) { _x = x; } else { is.setstate(std::ios_base::failbit); } } } /// \endcond IntType _x; }; #ifndef BOOST_NO_INCLASS_MEMBER_INITIALIZATION // A definition is required even for integral static constants template const bool linear_congruential_engine::has_fixed_range; template const IntType linear_congruential_engine::multiplier; template const IntType linear_congruential_engine::increment; template const IntType linear_congruential_engine::modulus; template const IntType linear_congruential_engine::default_seed; #endif /// \cond show_deprecated // provided for backwards compatibility template class linear_congruential : public linear_congruential_engine { typedef linear_congruential_engine base_type; public: linear_congruential(IntType x0 = 1) : base_type(x0) {} template linear_congruential(It& first, It last) : base_type(first, last) {} }; /// \endcond /** * The specialization \minstd_rand0 was originally suggested in * * @blockquote * A pseudo-random number generator for the System/360, P.A. Lewis, * A.S. Goodman, J.M. Miller, IBM Systems Journal, Vol. 8, No. 2, * 1969, pp. 136-146 * @endblockquote * * It is examined more closely together with \minstd_rand in * * @blockquote * "Random Number Generators: Good ones are hard to find", * Stephen K. Park and Keith W. Miller, Communications of * the ACM, Vol. 31, No. 10, October 1988, pp. 1192-1201 * @endblockquote */ typedef linear_congruential_engine minstd_rand0; /** The specialization \minstd_rand was suggested in * * @blockquote * "Random Number Generators: Good ones are hard to find", * Stephen K. Park and Keith W. Miller, Communications of * the ACM, Vol. 31, No. 10, October 1988, pp. 1192-1201 * @endblockquote */ typedef linear_congruential_engine minstd_rand; #if !defined(BOOST_NO_INT64_T) && !defined(BOOST_NO_INTEGRAL_INT64_T) /** * Class @c rand48 models a \pseudo_random_number_generator. It uses * the linear congruential algorithm with the parameters a = 0x5DEECE66D, * c = 0xB, m = 2**48. It delivers identical results to the @c lrand48() * function available on some systems (assuming lcong48 has not been called). * * It is only available on systems where @c uint64_t is provided as an * integral type, so that for example static in-class constants and/or * enum definitions with large @c uint64_t numbers work. */ class rand48 { public: typedef boost::uint32_t result_type; BOOST_STATIC_CONSTANT(bool, has_fixed_range = false); /** * Returns the smallest value that the generator can produce */ static uint32_t min BOOST_PREVENT_MACRO_SUBSTITUTION () { return 0; } /** * Returns the largest value that the generator can produce */ static uint32_t max BOOST_PREVENT_MACRO_SUBSTITUTION () { return 0x7FFFFFFF; } /** Seeds the generator with the default seed. */ rand48() : lcf(cnv(static_cast(1))) {} /** * Constructs a \rand48 generator with x(0) := (x0 << 16) | 0x330e. */ BOOST_RANDOM_DETAIL_ARITHMETIC_CONSTRUCTOR(rand48, result_type, x0) { seed(x0); } /** * Seeds the generator with values produced by @c seq.generate(). */ BOOST_RANDOM_DETAIL_SEED_SEQ_CONSTRUCTOR(rand48, SeedSeq, seq) { seed(seq); } /** * Seeds the generator using values from an iterator range, * and updates first to point one past the last value consumed. */ template rand48(It& first, It last) : lcf(first, last) { } // compiler-generated copy ctor and assignment operator are fine /** Seeds the generator with the default seed. */ void seed() { seed(static_cast(1)); } /** * Changes the current value x(n) of the generator to (x0 << 16) | 0x330e. */ BOOST_RANDOM_DETAIL_ARITHMETIC_SEED(rand48, result_type, x0) { lcf.seed(cnv(x0)); } /** * Seeds the generator using values from an iterator range, * and updates first to point one past the last value consumed. */ template void seed(It& first, It last) { lcf.seed(first,last); } /** * Seeds the generator with values produced by @c seq.generate(). */ BOOST_RANDOM_DETAIL_SEED_SEQ_SEED(rand48, SeedSeq, seq) { lcf.seed(seq); } /** Returns the next value of the generator. */ uint32_t operator()() { return static_cast(lcf() >> 17); } /** Advances the state of the generator by @c z. */ void discard(boost::uintmax_t z) { lcf.discard(z); } /** Fills a range with random values */ template void generate(Iter first, Iter last) { for(; first != last; ++first) { *first = (*this)(); } } #ifndef BOOST_RANDOM_NO_STREAM_OPERATORS /** Writes a @c rand48 to a @c std::ostream. */ template friend std::basic_ostream& operator<<(std::basic_ostream& os, const rand48& r) { os << r.lcf; return os; } /** Reads a @c rand48 from a @c std::istream. */ template friend std::basic_istream& operator>>(std::basic_istream& is, rand48& r) { is >> r.lcf; return is; } #endif /** * Returns true if the two generators will produce identical * sequences of values. */ friend bool operator==(const rand48& x, const rand48& y) { return x.lcf == y.lcf; } /** * Returns true if the two generators will produce different * sequences of values. */ friend bool operator!=(const rand48& x, const rand48& y) { return !(x == y); } private: /// \cond show_private typedef random::linear_congruential_engine lcf_t; lcf_t lcf; static boost::uint64_t cnv(boost::uint32_t x) { return (static_cast(x) << 16) | 0x330e; } /// \endcond }; #endif /* !BOOST_NO_INT64_T && !BOOST_NO_INTEGRAL_INT64_T */ } // namespace random using random::minstd_rand0; using random::minstd_rand; using random::rand48; } // namespace boost #include #endif // BOOST_RANDOM_LINEAR_CONGRUENTIAL_HPP madp-0.4/src/boost/boost/random/PaxHeaders.5405/normal_distribution.hpp0000644000000000000000000000007312717644140023105 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/random/normal_distribution.hpp0000664000372100037210000001622412717644140023742 0ustar00fransfrans00000000000000/* boost random/normal_distribution.hpp header file * * Copyright Jens Maurer 2000-2001 * Copyright Steven Watanabe 2010-2011 * Distributed under the Boost Software License, Version 1.0. (See * accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org for most recent version including documentation. * * $Id: normal_distribution.hpp 71018 2011-04-05 21:27:52Z steven_watanabe $ * * Revision history * 2001-02-18 moved to individual header files */ #ifndef BOOST_RANDOM_NORMAL_DISTRIBUTION_HPP #define BOOST_RANDOM_NORMAL_DISTRIBUTION_HPP #include #include #include #include #include #include #include #include #include namespace boost { namespace random { // deterministic Box-Muller method, uses trigonometric functions /** * Instantiations of class template normal_distribution model a * \random_distribution. Such a distribution produces random numbers * @c x distributed with probability density function * \f$\displaystyle p(x) = * \frac{1}{\sqrt{2\pi\sigma}} e^{-\frac{(x-\mu)^2}{2\sigma^2}} * \f$, * where mean and sigma are the parameters of the distribution. */ template class normal_distribution { public: typedef RealType input_type; typedef RealType result_type; class param_type { public: typedef normal_distribution distribution_type; /** * Constructs a @c param_type with a given mean and * standard deviation. * * Requires: sigma >= 0 */ explicit param_type(RealType mean_arg = RealType(0.0), RealType sigma_arg = RealType(1.0)) : _mean(mean_arg), _sigma(sigma_arg) {} /** Returns the mean of the distribution. */ RealType mean() const { return _mean; } /** Returns the standand deviation of the distribution. */ RealType sigma() const { return _sigma; } /** Writes a @c param_type to a @c std::ostream. */ BOOST_RANDOM_DETAIL_OSTREAM_OPERATOR(os, param_type, parm) { os << parm._mean << " " << parm._sigma ; return os; } /** Reads a @c param_type from a @c std::istream. */ BOOST_RANDOM_DETAIL_ISTREAM_OPERATOR(is, param_type, parm) { is >> parm._mean >> std::ws >> parm._sigma; return is; } /** Returns true if the two sets of parameters are the same. */ BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR(param_type, lhs, rhs) { return lhs._mean == rhs._mean && lhs._sigma == rhs._sigma; } /** Returns true if the two sets of parameters are the different. */ BOOST_RANDOM_DETAIL_INEQUALITY_OPERATOR(param_type) private: RealType _mean; RealType _sigma; }; /** * Constructs a @c normal_distribution object. @c mean and @c sigma are * the parameters for the distribution. * * Requires: sigma >= 0 */ explicit normal_distribution(const RealType& mean_arg = RealType(0.0), const RealType& sigma_arg = RealType(1.0)) : _mean(mean_arg), _sigma(sigma_arg), _r1(0), _r2(0), _cached_rho(0), _valid(false) { BOOST_ASSERT(_sigma >= RealType(0)); } /** * Constructs a @c normal_distribution object from its parameters. */ explicit normal_distribution(const param_type& parm) : _mean(parm.mean()), _sigma(parm.sigma()), _r1(0), _r2(0), _cached_rho(0), _valid(false) {} /** Returns the mean of the distribution. */ RealType mean() const { return _mean; } /** Returns the standard deviation of the distribution. */ RealType sigma() const { return _sigma; } /** Returns the smallest value that the distribution can produce. */ RealType min BOOST_PREVENT_MACRO_SUBSTITUTION () const { return -std::numeric_limits::infinity(); } /** Returns the largest value that the distribution can produce. */ RealType max BOOST_PREVENT_MACRO_SUBSTITUTION () const { return std::numeric_limits::infinity(); } /** Returns the parameters of the distribution. */ param_type param() const { return param_type(_mean, _sigma); } /** Sets the parameters of the distribution. */ void param(const param_type& parm) { _mean = parm.mean(); _sigma = parm.sigma(); _valid = false; } /** * Effects: Subsequent uses of the distribution do not depend * on values produced by any engine prior to invoking reset. */ void reset() { _valid = false; } /** Returns a normal variate. */ template result_type operator()(Engine& eng) { using std::sqrt; using std::log; using std::sin; using std::cos; if(!_valid) { _r1 = boost::uniform_01()(eng); _r2 = boost::uniform_01()(eng); _cached_rho = sqrt(-result_type(2) * log(result_type(1)-_r2)); _valid = true; } else { _valid = false; } // Can we have a boost::mathconst please? const result_type pi = result_type(3.14159265358979323846); return _cached_rho * (_valid ? cos(result_type(2)*pi*_r1) : sin(result_type(2)*pi*_r1)) * _sigma + _mean; } /** Returns a normal variate with parameters specified by @c param. */ template result_type operator()(URNG& urng, const param_type& parm) { return normal_distribution(parm)(urng); } /** Writes a @c normal_distribution to a @c std::ostream. */ BOOST_RANDOM_DETAIL_OSTREAM_OPERATOR(os, normal_distribution, nd) { os << nd._mean << " " << nd._sigma << " " << nd._valid << " " << nd._cached_rho << " " << nd._r1; return os; } /** Reads a @c normal_distribution from a @c std::istream. */ BOOST_RANDOM_DETAIL_ISTREAM_OPERATOR(is, normal_distribution, nd) { is >> std::ws >> nd._mean >> std::ws >> nd._sigma >> std::ws >> nd._valid >> std::ws >> nd._cached_rho >> std::ws >> nd._r1; return is; } /** * Returns true if the two instances of @c normal_distribution will * return identical sequences of values given equal generators. */ BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR(normal_distribution, lhs, rhs) { return lhs._mean == rhs._mean && lhs._sigma == rhs._sigma && lhs._valid == rhs._valid && (!lhs._valid || (lhs._r1 == rhs._r1 && lhs._r2 == rhs._r2)); } /** * Returns true if the two instances of @c normal_distribution will * return different sequences of values given equal generators. */ BOOST_RANDOM_DETAIL_INEQUALITY_OPERATOR(normal_distribution) private: RealType _mean, _sigma; RealType _r1, _r2, _cached_rho; bool _valid; }; } // namespace random using random::normal_distribution; } // namespace boost #endif // BOOST_RANDOM_NORMAL_DISTRIBUTION_HPP madp-0.4/src/boost/boost/random/PaxHeaders.5405/uniform_01.hpp0000644000000000000000000000007312717644140020775 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/random/uniform_01.hpp0000664000372100037210000001721312717644140021631 0ustar00fransfrans00000000000000/* boost random/uniform_01.hpp header file * * Copyright Jens Maurer 2000-2001 * Distributed under the Boost Software License, Version 1.0. (See * accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org for most recent version including documentation. * * $Id: uniform_01.hpp 71018 2011-04-05 21:27:52Z steven_watanabe $ * * Revision history * 2001-02-18 moved to individual header files */ #ifndef BOOST_RANDOM_UNIFORM_01_HPP #define BOOST_RANDOM_UNIFORM_01_HPP #include #include #include #include #include #include #include namespace boost { namespace random { #ifdef BOOST_RANDOM_DOXYGEN /** * The distribution function uniform_01 models a \random_distribution. * On each invocation, it returns a random floating-point value * uniformly distributed in the range [0..1). * * The template parameter RealType shall denote a float-like value type * with support for binary operators +, -, and /. * * Note: The current implementation is buggy, because it may not fill * all of the mantissa with random bits. I'm unsure how to fill a * (to-be-invented) @c boost::bigfloat class with random bits efficiently. * It's probably time for a traits class. */ template class uniform_01 { public: typedef RealType input_type; typedef RealType result_type; result_type min BOOST_PREVENT_MACRO_SUBSTITUTION () const; result_type max BOOST_PREVENT_MACRO_SUBSTITUTION () const; void reset(); template result_type operator()(Engine& eng); #ifndef BOOST_RANDOM_NO_STREAM_OPERATORS template friend std::basic_ostream& operator<<(std::basic_ostream& os, const new_uniform_01&) { return os; } template friend std::basic_istream& operator>>(std::basic_istream& is, new_uniform_01&) { return is; } #endif }; #else namespace detail { template class new_uniform_01 { public: typedef RealType input_type; typedef RealType result_type; // compiler-generated copy ctor and copy assignment are fine result_type min BOOST_PREVENT_MACRO_SUBSTITUTION () const { return result_type(0); } result_type max BOOST_PREVENT_MACRO_SUBSTITUTION () const { return result_type(1); } void reset() { } template result_type operator()(Engine& eng) { for (;;) { typedef typename Engine::result_type base_result; result_type factor = result_type(1) / (result_type((eng.max)()-(eng.min)()) + result_type(std::numeric_limits::is_integer ? 1 : 0)); result_type result = result_type(eng() - (eng.min)()) * factor; if (result < result_type(1)) return result; } } #ifndef BOOST_RANDOM_NO_STREAM_OPERATORS template friend std::basic_ostream& operator<<(std::basic_ostream& os, const new_uniform_01&) { return os; } template friend std::basic_istream& operator>>(std::basic_istream& is, new_uniform_01&) { return is; } #endif }; template class backward_compatible_uniform_01 { typedef boost::random::detail::ptr_helper traits; public: typedef UniformRandomNumberGenerator base_type; typedef RealType result_type; BOOST_STATIC_CONSTANT(bool, has_fixed_range = false); #if !defined(BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS) && !(defined(BOOST_MSVC) && BOOST_MSVC <= 1300) BOOST_STATIC_ASSERT(!std::numeric_limits::is_integer); #endif explicit backward_compatible_uniform_01(typename traits::rvalue_type rng) : _rng(rng), _factor(result_type(1) / (result_type((base().max)()-(base().min)()) + result_type(std::numeric_limits::is_integer ? 1 : 0))) { } // compiler-generated copy ctor and copy assignment are fine result_type min BOOST_PREVENT_MACRO_SUBSTITUTION () const { return result_type(0); } result_type max BOOST_PREVENT_MACRO_SUBSTITUTION () const { return result_type(1); } typename traits::value_type& base() { return traits::ref(_rng); } const typename traits::value_type& base() const { return traits::ref(_rng); } void reset() { } result_type operator()() { for (;;) { result_type result = result_type(base()() - (base().min)()) * _factor; if (result < result_type(1)) return result; } } #if !defined(BOOST_NO_OPERATORS_IN_NAMESPACE) && !defined(BOOST_NO_MEMBER_TEMPLATE_FRIENDS) template friend std::basic_ostream& operator<<(std::basic_ostream& os, const backward_compatible_uniform_01& u) { os << u._rng; return os; } template friend std::basic_istream& operator>>(std::basic_istream& is, backward_compatible_uniform_01& u) { is >> u._rng; return is; } #endif private: typedef typename traits::value_type::result_type base_result; UniformRandomNumberGenerator _rng; result_type _factor; }; #ifndef BOOST_NO_INCLASS_MEMBER_INITIALIZATION // A definition is required even for integral static constants template const bool backward_compatible_uniform_01::has_fixed_range; #endif template struct select_uniform_01 { template struct apply { typedef backward_compatible_uniform_01 type; }; }; template<> struct select_uniform_01 { template struct apply { typedef new_uniform_01 type; }; }; template<> struct select_uniform_01 { template struct apply { typedef new_uniform_01 type; }; }; template<> struct select_uniform_01 { template struct apply { typedef new_uniform_01 type; }; }; } // Because it is so commonly used: uniform distribution on the real [0..1) // range. This allows for specializations to avoid a costly int -> float // conversion plus float multiplication template class uniform_01 : public detail::select_uniform_01::BOOST_NESTED_TEMPLATE apply::type { typedef typename detail::select_uniform_01::BOOST_NESTED_TEMPLATE apply::type impl_type; typedef boost::random::detail::ptr_helper traits; public: uniform_01() {} explicit uniform_01(typename traits::rvalue_type rng) : impl_type(rng) { } #if !defined(BOOST_NO_OPERATORS_IN_NAMESPACE) && !defined(BOOST_NO_MEMBER_TEMPLATE_FRIENDS) template friend std::basic_ostream& operator<<(std::basic_ostream& os, const uniform_01& u) { os << static_cast(u); return os; } template friend std::basic_istream& operator>>(std::basic_istream& is, uniform_01& u) { is >> static_cast(u); return is; } #endif }; #endif } // namespace random using random::uniform_01; } // namespace boost #include #endif // BOOST_RANDOM_UNIFORM_01_HPP madp-0.4/src/boost/boost/random/PaxHeaders.5405/variate_generator.hpp0000644000000000000000000000007312717644140022517 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/random/variate_generator.hpp0000664000372100037210000000727712717644140023364 0ustar00fransfrans00000000000000/* boost random/variate_generator.hpp header file * * Copyright Jens Maurer 2002 * Copyright Steven Watanabe 2011 * Distributed under the Boost Software License, Version 1.0. (See * accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org for most recent version including documentation. * * $Id: variate_generator.hpp 71018 2011-04-05 21:27:52Z steven_watanabe $ * */ #ifndef BOOST_RANDOM_RANDOM_GENERATOR_HPP #define BOOST_RANDOM_RANDOM_GENERATOR_HPP #include #include namespace boost { /// \cond hide_private_members namespace random { ///\endcond /** * A random variate generator is used to join a random number * generator together with a random number distribution. * Boost.Random provides a vast choice of \generators as well * as \distributions. * * The argument for the template parameter Engine shall be of * the form U, U&, or U*, where U models a * \uniform_random_number_generator. Then, the member * engine_value_type names U (not the pointer or reference to U). * * Specializations of @c variate_generator satisfy the * requirements of CopyConstructible. They also satisfy the * requirements of Assignable unless the template parameter * Engine is of the form U&. * * The complexity of all functions specified in this section * is constant. No function described in this section except * the constructor throws an exception. */ template class variate_generator { private: typedef boost::random::detail::ptr_helper helper_type; public: typedef typename helper_type::value_type engine_value_type; typedef Engine engine_type; typedef Distribution distribution_type; typedef typename Distribution::result_type result_type; /** * Constructs a @c variate_generator object with the associated * \uniform_random_number_generator eng and the associated * \random_distribution d. * * Throws: If and what the copy constructor of Engine or * Distribution throws. */ variate_generator(Engine e, Distribution d) : _eng(e), _dist(d) { } /** Returns: distribution()(engine()) */ result_type operator()() { return _dist(engine()); } /** * Returns: distribution()(engine(), value). */ template result_type operator()(const T& value) { return _dist(engine(), value); } /** * Returns: A reference to the associated uniform random number generator. */ engine_value_type& engine() { return helper_type::ref(_eng); } /** * Returns: A reference to the associated uniform random number generator. */ const engine_value_type& engine() const { return helper_type::ref(_eng); } /** Returns: A reference to the associated \random_distribution. */ distribution_type& distribution() { return _dist; } /** * Returns: A reference to the associated random distribution. */ const distribution_type& distribution() const { return _dist; } /** * Precondition: distribution().min() is well-formed * * Returns: distribution().min() */ result_type min BOOST_PREVENT_MACRO_SUBSTITUTION () const { return (distribution().min)(); } /** * Precondition: distribution().max() is well-formed * * Returns: distribution().max() */ result_type max BOOST_PREVENT_MACRO_SUBSTITUTION () const { return (distribution().max)(); } private: Engine _eng; distribution_type _dist; }; } // namespace random using random::variate_generator; } // namespace boost #include #endif // BOOST_RANDOM_RANDOM_GENERATOR_HPP madp-0.4/src/boost/boost/random/PaxHeaders.5405/uniform_real_distribution.hpp0000644000000000000000000000007312717644140024277 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/random/uniform_real_distribution.hpp0000664000372100037210000001677012717644140025142 0ustar00fransfrans00000000000000/* boost random/uniform_real_distribution.hpp header file * * Copyright Jens Maurer 2000-2001 * Copyright Steven Watanabe 2011 * Distributed under the Boost Software License, Version 1.0. (See * accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org for most recent version including documentation. * * $Id: uniform_real_distribution.hpp 71018 2011-04-05 21:27:52Z steven_watanabe $ * */ #ifndef BOOST_RANDOM_UNIFORM_REAL_DISTRIBUTION_HPP #define BOOST_RANDOM_UNIFORM_REAL_DISTRIBUTION_HPP #include #include #include #include #include #include #include #include #include namespace boost { namespace random { namespace detail { template T generate_uniform_real( Engine& eng, T min_value, T max_value, boost::mpl::false_ /** is_integral */) { for(;;) { typedef T result_type; typedef typename Engine::result_type base_result; result_type numerator = static_cast(eng() - (eng.min)()); result_type divisor = static_cast((eng.max)() - (eng.min)()); BOOST_ASSERT(divisor > 0); BOOST_ASSERT(numerator >= 0 && numerator <= divisor); T result = numerator / divisor * (max_value - min_value) + min_value; if(result < max_value) return result; } } template T generate_uniform_real( Engine& eng, T min_value, T max_value, boost::mpl::true_ /** is_integral */) { for(;;) { typedef T result_type; typedef typename Engine::result_type base_result; result_type numerator = static_cast(subtract()(eng(), (eng.min)())); result_type divisor = static_cast(subtract()((eng.max)(), (eng.min)())) + 1; BOOST_ASSERT(divisor > 0); BOOST_ASSERT(numerator >= 0 && numerator <= divisor); T result = numerator / divisor * (max_value - min_value) + min_value; if(result < max_value) return result; } } template inline T generate_uniform_real(Engine& eng, T min_value, T max_value) { typedef typename Engine::result_type base_result; return generate_uniform_real(eng, min_value, max_value, boost::is_integral()); } } /** * The class template uniform_real_distribution models a \random_distribution. * On each invocation, it returns a random floating-point value uniformly * distributed in the range [min..max). */ template class uniform_real_distribution { public: typedef RealType input_type; typedef RealType result_type; class param_type { public: typedef uniform_real_distribution distribution_type; /** * Constructs the parameters of a uniform_real_distribution. * * Requires min <= max */ explicit param_type(RealType min_arg = RealType(0.0), RealType max_arg = RealType(1.0)) : _min(min_arg), _max(max_arg) { BOOST_ASSERT(_min <= _max); } /** Returns the minimum value of the distribution. */ RealType a() const { return _min; } /** Returns the maximum value of the distribution. */ RealType b() const { return _max; } /** Writes the parameters to a @c std::ostream. */ BOOST_RANDOM_DETAIL_OSTREAM_OPERATOR(os, param_type, parm) { os << parm._min << " " << parm._max; return os; } /** Reads the parameters from a @c std::istream. */ BOOST_RANDOM_DETAIL_ISTREAM_OPERATOR(is, param_type, parm) { RealType min_in, max_in; if(is >> min_in >> std::ws >> max_in) { if(min_in <= max_in) { parm._min = min_in; parm._max = max_in; } else { is.setstate(std::ios_base::failbit); } } return is; } /** Returns true if the two sets of parameters are equal. */ BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR(param_type, lhs, rhs) { return lhs._min == rhs._min && lhs._max == rhs._max; } /** Returns true if the two sets of parameters are different. */ BOOST_RANDOM_DETAIL_INEQUALITY_OPERATOR(param_type) private: RealType _min; RealType _max; }; /** * Constructs a uniform_real_distribution. @c min and @c max are * the parameters of the distribution. * * Requires: min <= max */ explicit uniform_real_distribution( RealType min_arg = RealType(0.0), RealType max_arg = RealType(1.0)) : _min(min_arg), _max(max_arg) { BOOST_ASSERT(min_arg <= max_arg); } /** Constructs a uniform_real_distribution from its parameters. */ explicit uniform_real_distribution(const param_type& parm) : _min(parm.a()), _max(parm.b()) {} /** Returns the minimum value of the distribution */ RealType min BOOST_PREVENT_MACRO_SUBSTITUTION () const { return _min; } /** Returns the maximum value of the distribution */ RealType max BOOST_PREVENT_MACRO_SUBSTITUTION () const { return _max; } /** Returns the minimum value of the distribution */ RealType a() const { return _min; } /** Returns the maximum value of the distribution */ RealType b() const { return _max; } /** Returns the parameters of the distribution. */ param_type param() const { return param_type(_min, _max); } /** Sets the parameters of the distribution. */ void param(const param_type& parm) { _min = parm.a(); _max = parm.b(); } /** * Effects: Subsequent uses of the distribution do not depend * on values produced by any engine prior to invoking reset. */ void reset() { } /** Returns a value uniformly distributed in the range [min, max). */ template result_type operator()(Engine& eng) const { return detail::generate_uniform_real(eng, _min, _max); } /** * Returns a value uniformly distributed in the range * [param.a(), param.b()). */ template result_type operator()(Engine& eng, const param_type& parm) const { return detail::generate_uniform_real(eng, parm.a(), parm.b()); } /** Writes the distribution to a @c std::ostream. */ BOOST_RANDOM_DETAIL_OSTREAM_OPERATOR(os, uniform_real_distribution, ud) { os << ud.param(); return os; } /** Reads the distribution from a @c std::istream. */ BOOST_RANDOM_DETAIL_ISTREAM_OPERATOR(is, uniform_real_distribution, ud) { param_type parm; if(is >> parm) { ud.param(parm); } return is; } /** * Returns true if the two distributions will produce identical sequences * of values given equal generators. */ BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR(uniform_real_distribution, lhs, rhs) { return lhs._min == rhs._min && lhs._max == rhs._max; } /** * Returns true if the two distributions may produce different sequences * of values given equal generators. */ BOOST_RANDOM_DETAIL_INEQUALITY_OPERATOR(uniform_real_distribution) private: RealType _min; RealType _max; }; } // namespace random } // namespace boost #endif // BOOST_RANDOM_UNIFORM_INT_HPP madp-0.4/src/boost/boost/random/PaxHeaders.5405/uniform_real.hpp0000644000000000000000000000007312717644140021500 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/random/uniform_real.hpp0000664000372100037210000000472012717644140022333 0ustar00fransfrans00000000000000/* boost random/uniform_real.hpp header file * * Copyright Jens Maurer 2000-2001 * Distributed under the Boost Software License, Version 1.0. (See * accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org for most recent version including documentation. * * $Id: uniform_real.hpp 71018 2011-04-05 21:27:52Z steven_watanabe $ * * Revision history * 2001-04-08 added min #include #include #include namespace boost { /** * The distribution function uniform_real models a random distribution. * On each invocation, it returns a random floating-point value uniformly * distributed in the range [min..max). * * This class is deprecated. Please use @c uniform_real_distribution in * new code. */ template class uniform_real : public random::uniform_real_distribution { typedef random::uniform_real_distribution base_type; public: class param_type : public base_type::param_type { public: typedef uniform_real distribution_type; /** * Constructs the parameters of a uniform_real distribution. * * Requires: min <= max */ explicit param_type(RealType min_arg = RealType(0.0), RealType max_arg = RealType(1.0)) : base_type::param_type(min_arg, max_arg) {} }; /** * Constructs a uniform_real object. @c min and @c max are the * parameters of the distribution. * * Requires: min <= max */ explicit uniform_real(RealType min_arg = RealType(0.0), RealType max_arg = RealType(1.0)) : base_type(min_arg, max_arg) { BOOST_ASSERT(min_arg <= max_arg); } /** Constructs a uniform_real distribution from its parameters. */ explicit uniform_real(const param_type& parm) : base_type(parm) {} /** Returns the parameters of the distribution */ param_type param() const { return param_type(this->a(), this->b()); } /** Sets the parameters of the distribution. */ void param(const param_type& parm) { this->base_type::param(parm); } }; } // namespace boost #endif // BOOST_RANDOM_UNIFORM_REAL_HPP madp-0.4/src/boost/boost/random/PaxHeaders.5405/detail0000644000000000000000000000007412717644140017473 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/random/detail/0000775000372100037210000000000012717644140020377 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/random/detail/PaxHeaders.5405/large_arithmetic.hpp0000644000000000000000000000007312717644140023563 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.145552085 madp-0.4/src/boost/boost/random/detail/large_arithmetic.hpp0000664000372100037210000000710312717644140024414 0ustar00fransfrans00000000000000/* boost random/detail/large_arithmetic.hpp header file * * Copyright Steven Watanabe 2011 * Distributed under the Boost Software License, Version 1.0. (See * accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org for most recent version including documentation. * * $Id: large_arithmetic.hpp 71018 2011-04-05 21:27:52Z steven_watanabe $ */ #ifndef BOOST_RANDOM_DETAIL_LARGE_ARITHMETIC_HPP #define BOOST_RANDOM_DETAIL_LARGE_ARITHMETIC_HPP #include #include #include #include #include namespace boost { namespace random { namespace detail { struct div_t { boost::uintmax_t quotient; boost::uintmax_t remainder; }; inline div_t muldivmod(boost::uintmax_t a, boost::uintmax_t b, boost::uintmax_t m) { static const int bits = ::std::numeric_limits< ::boost::uintmax_t>::digits / 2; static const ::boost::uintmax_t mask = (::boost::uintmax_t(1) << bits) - 1; typedef ::boost::uint_t::fast digit_t; int shift = std::numeric_limits< ::boost::uintmax_t>::digits - 1 - detail::integer_log2(m); a <<= shift; m <<= shift; digit_t product[4] = { 0, 0, 0, 0 }; digit_t a_[2] = { digit_t(a & mask), digit_t((a >> bits) & mask) }; digit_t b_[2] = { digit_t(b & mask), digit_t((b >> bits) & mask) }; digit_t m_[2] = { digit_t(m & mask), digit_t((m >> bits) & mask) }; // multiply a * b for(int i = 0; i < 2; ++i) { digit_t carry = 0; for(int j = 0; j < 2; ++j) { ::boost::uint64_t temp = ::boost::uintmax_t(a_[i]) * b_[j] + carry + product[i + j]; product[i + j] = digit_t(temp & mask); carry = digit_t(temp >> bits); } if(carry != 0) { product[i + 2] += carry; } } digit_t quotient[2]; if(m == 0) { div_t result = { ((::boost::uintmax_t(product[3]) << bits) | product[2]), ((::boost::uintmax_t(product[1]) << bits) | product[0]) >> shift, }; return result; } // divide product / m for(int i = 3; i >= 2; --i) { ::boost::uintmax_t temp = ::boost::uintmax_t(product[i]) << bits | product[i - 1]; digit_t q = digit_t((product[i] == m_[1]) ? mask : temp / m_[1]); ::boost::uintmax_t rem = ((temp - ::boost::uintmax_t(q) * m_[1]) << bits) + product[i - 2]; ::boost::uintmax_t diff = m_[0] * ::boost::uintmax_t(q); int error = 0; if(diff > rem) { if(diff - rem > m) { error = 2; } else { error = 1; } } q -= error; rem = rem + error * m - diff; quotient[i - 2] = q; product[i] = 0; product[i-1] = (rem >> bits) & mask; product[i-2] = rem & mask; } div_t result = { ((::boost::uintmax_t(quotient[1]) << bits) | quotient[0]), ((::boost::uintmax_t(product[1]) << bits) | product[0]) >> shift, }; return result; } inline boost::uintmax_t muldiv(boost::uintmax_t a, boost::uintmax_t b, boost::uintmax_t m) { return detail::muldivmod(a, b, m).quotient; } inline boost::uintmax_t mulmod(boost::uintmax_t a, boost::uintmax_t b, boost::uintmax_t m) { return detail::muldivmod(a, b, m).remainder; } } // namespace detail } // namespace random } // namespace boost #include #endif // BOOST_RANDOM_DETAIL_LARGE_ARITHMETIC_HPP madp-0.4/src/boost/boost/random/detail/PaxHeaders.5405/const_mod.hpp0000644000000000000000000000007312717644140022245 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.145552085 madp-0.4/src/boost/boost/random/detail/const_mod.hpp0000664000372100037210000001276012717644140023103 0ustar00fransfrans00000000000000/* boost random/detail/const_mod.hpp header file * * Copyright Jens Maurer 2000-2001 * Distributed under the Boost Software License, Version 1.0. (See * accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org for most recent version including documentation. * * $Id: const_mod.hpp 71018 2011-04-05 21:27:52Z steven_watanabe $ * * Revision history * 2001-02-18 moved to individual header files */ #ifndef BOOST_RANDOM_CONST_MOD_HPP #define BOOST_RANDOM_CONST_MOD_HPP #include #include #include #include #include #include namespace boost { namespace random { template class const_mod { public: static IntType apply(IntType x) { if(((unsigned_m() - 1) & unsigned_m()) == 0) return (unsigned_type(x)) & (unsigned_m() - 1); else { IntType supress_warnings = (m == 0); BOOST_ASSERT(supress_warnings == 0); return x % (m + supress_warnings); } } static IntType add(IntType x, IntType c) { if(((unsigned_m() - 1) & unsigned_m()) == 0) return (unsigned_type(x) + unsigned_type(c)) & (unsigned_m() - 1); else if(c == 0) return x; else if(x < m - c) return x + c; else return x - (m - c); } static IntType mult(IntType a, IntType x) { if(((unsigned_m() - 1) & unsigned_m()) == 0) return unsigned_type(a) * unsigned_type(x) & (unsigned_m() - 1); else if(a == 0) return 0; else if(a == 1) return x; else if(m <= traits::const_max/a) // i.e. a*m <= max return mult_small(a, x); else if(traits::is_signed && (m%a < m/a)) return mult_schrage(a, x); else return mult_general(a, x); } static IntType mult_add(IntType a, IntType x, IntType c) { if(((unsigned_m() - 1) & unsigned_m()) == 0) return (unsigned_type(a) * unsigned_type(x) + unsigned_type(c)) & (unsigned_m() - 1); else if(a == 0) return c; else if(m <= (traits::const_max-c)/a) { // i.e. a*m+c <= max IntType supress_warnings = (m == 0); BOOST_ASSERT(supress_warnings == 0); return (a*x+c) % (m + supress_warnings); } else return add(mult(a, x), c); } static IntType pow(IntType a, boost::uintmax_t exponent) { IntType result = 1; while(exponent != 0) { if(exponent % 2 == 1) { result = mult(result, a); } a = mult(a, a); exponent /= 2; } return result; } static IntType invert(IntType x) { return x == 0 ? 0 : (m == 0? invert_euclidian0(x) : invert_euclidian(x)); } private: typedef integer_traits traits; typedef typename make_unsigned::type unsigned_type; const_mod(); // don't instantiate static IntType mult_small(IntType a, IntType x) { IntType supress_warnings = (m == 0); BOOST_ASSERT(supress_warnings == 0); return a*x % (m + supress_warnings); } static IntType mult_schrage(IntType a, IntType value) { const IntType q = m / a; const IntType r = m % a; BOOST_ASSERT(r < q); // check that overflow cannot happen return sub(a*(value%q), r*(value/q)); } static IntType mult_general(IntType a, IntType b) { IntType suppress_warnings = (m == 0); BOOST_ASSERT(suppress_warnings == 0); IntType modulus = m + suppress_warnings; BOOST_ASSERT(modulus == m); if(::boost::uintmax_t(modulus) <= (::std::numeric_limits< ::boost::uintmax_t>::max)() / modulus) { return static_cast(boost::uintmax_t(a) * b % modulus); } else { return static_cast(detail::mulmod(a, b, modulus)); } } static IntType sub(IntType a, IntType b) { if(a < b) return m - (b - a); else return a - b; } static unsigned_type unsigned_m() { if(m == 0) { return unsigned_type((std::numeric_limits::max)()) + 1; } else { return unsigned_type(m); } } // invert c in the finite field (mod m) (m must be prime) static IntType invert_euclidian(IntType c) { // we are interested in the gcd factor for c, because this is our inverse BOOST_ASSERT(c > 0); IntType l1 = 0; IntType l2 = 1; IntType n = c; IntType p = m; for(;;) { IntType q = p / n; l1 += q * l2; p -= q * n; if(p == 0) return l2; IntType q2 = n / p; l2 += q2 * l1; n -= q2 * p; if(n == 0) return m - l1; } } // invert c in the finite field (mod m) (c must be relatively prime to m) static IntType invert_euclidian0(IntType c) { // we are interested in the gcd factor for c, because this is our inverse BOOST_ASSERT(c > 0); if(c == 1) return 1; IntType l1 = 0; IntType l2 = 1; IntType n = c; IntType p = m; IntType max = (std::numeric_limits::max)(); IntType q = max / n; BOOST_ASSERT(max % n != n - 1 && "c must be relatively prime to m."); l1 += q * l2; p = max - q * n + 1; for(;;) { if(p == 0) return l2; IntType q2 = n / p; l2 += q2 * l1; n -= q2 * p; if(n == 0) return m - l1; q = p / n; l1 += q * l2; p -= q * n; } } }; } // namespace random } // namespace boost #include #endif // BOOST_RANDOM_CONST_MOD_HPP madp-0.4/src/boost/boost/random/detail/PaxHeaders.5405/config.hpp0000644000000000000000000000007312717644140021525 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.145552085 madp-0.4/src/boost/boost/random/detail/config.hpp0000664000372100037210000000112212717644140022351 0ustar00fransfrans00000000000000/* boost random/detail/config.hpp header file * * Copyright Steven Watanabe 2009 * Distributed under the Boost Software License, Version 1.0. (See * accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org for most recent version including documentation. * * $Id: config.hpp 52492 2009-04-19 14:55:57Z steven_watanabe $ */ #include #if (defined(BOOST_NO_OPERATORS_IN_NAMESPACE) || defined(BOOST_NO_MEMBER_TEMPLATE_FRIENDS)) \ && !defined(BOOST_MSVC) #define BOOST_RANDOM_NO_STREAM_OPERATORS #endif madp-0.4/src/boost/boost/random/detail/PaxHeaders.5405/seed_impl.hpp0000644000000000000000000000007312717644140022221 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/random/detail/seed_impl.hpp0000664000372100037210000003313112717644140023052 0ustar00fransfrans00000000000000/* boost random/detail/seed.hpp header file * * Copyright Steven Watanabe 2009 * Distributed under the Boost Software License, Version 1.0. (See * accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org for most recent version including documentation. * * $Id: seed_impl.hpp 72951 2011-07-07 04:57:37Z steven_watanabe $ */ #ifndef BOOST_RANDOM_DETAIL_SEED_IMPL_HPP #define BOOST_RANDOM_DETAIL_SEED_IMPL_HPP #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include namespace boost { namespace random { namespace detail { // finds the seed type of an engine, given its // result_type. If the result_type is integral // the seed type is the same. If the result_type // is floating point, the seed type is uint32_t template struct seed_type { typedef typename boost::mpl::if_, T, boost::uint32_t >::type type; }; template struct const_pow_impl { template static T call(T arg, int n, T result) { return const_pow_impl::call(arg * arg, n / 2, n%2 == 0? result : result * arg); } }; template<> struct const_pow_impl<0> { template static T call(T, int, T result) { return result; } }; // requires N is an upper bound on n template inline T const_pow(T arg, int n) { return const_pow_impl::call(arg, n, T(1)); } template inline T pow2(int n) { typedef unsigned int_type; const int max_bits = std::numeric_limits::digits; T multiplier = T(int_type(1) << (max_bits - 1)) * 2; return (int_type(1) << (n % max_bits)) * const_pow::digits / max_bits>(multiplier, n / max_bits); } template void generate_from_real(Engine& eng, Iter begin, Iter end) { using std::fmod; typedef typename Engine::result_type RealType; const int Bits = detail::generator_bits::value(); int remaining_bits = 0; boost::uint_least32_t saved_bits = 0; RealType multiplier = pow2( Bits); RealType mult32 = RealType(4294967296.0); // 2^32 while(true) { RealType val = eng() * multiplier; int available_bits = Bits; // Make sure the compiler can optimize this out // if it isn't possible. if(Bits < 32 && available_bits < 32 - remaining_bits) { saved_bits |= boost::uint_least32_t(val) << remaining_bits; remaining_bits += Bits; } else { // If Bits < 32, then remaining_bits != 0, since // if remaining_bits == 0, available_bits < 32 - 0, // and we won't get here to begin with. if(Bits < 32 || remaining_bits != 0) { boost::uint_least32_t divisor = (boost::uint_least32_t(1) << (32 - remaining_bits)); boost::uint_least32_t extra_bits = boost::uint_least32_t(fmod(val, mult32)) & (divisor - 1); val = val / divisor; *begin++ = saved_bits | (extra_bits << remaining_bits); if(begin == end) return; available_bits -= 32 - remaining_bits; remaining_bits = 0; } // If Bits < 32 we should never enter this loop if(Bits >= 32) { for(; available_bits >= 32; available_bits -= 32) { boost::uint_least32_t word = boost::uint_least32_t(fmod(val, mult32)); val /= mult32; *begin++ = word; if(begin == end) return; } } remaining_bits = available_bits; saved_bits = static_cast(val); } } } template void generate_from_int(Engine& eng, Iter begin, Iter end) { typedef typename Engine::result_type IntType; typedef typename boost::make_unsigned::type unsigned_type; int remaining_bits = 0; boost::uint_least32_t saved_bits = 0; unsigned_type range = boost::random::detail::subtract()((eng.max)(), (eng.min)()); int bits = (range == (std::numeric_limits::max)()) ? std::numeric_limits::digits : detail::integer_log2(range + 1); { int discarded_bits = detail::integer_log2(bits); unsigned_type excess = (range + 1) >> (bits - discarded_bits); if(excess != 0) { int extra_bits = detail::integer_log2((excess - 1) ^ excess); bits = bits - discarded_bits + extra_bits; } } unsigned_type mask = (static_cast(2) << (bits - 1)) - 1; unsigned_type limit = ((range + 1) & ~mask) - 1; while(true) { unsigned_type val; do { val = boost::random::detail::subtract()(eng(), (eng.min)()); } while(limit != range && val > limit); val &= mask; int available_bits = bits; if(available_bits == 32) { *begin++ = static_cast(val) & 0xFFFFFFFFu; if(begin == end) return; } else if(available_bits % 32 == 0) { for(int i = 0; i < available_bits / 32; ++i) { boost::uint_least32_t word = boost::uint_least32_t(val) & 0xFFFFFFFFu; int supress_warning = (bits >= 32); BOOST_ASSERT(supress_warning == 1); val >>= (32 * supress_warning); *begin++ = word; if(begin == end) return; } } else if(bits < 32 && available_bits < 32 - remaining_bits) { saved_bits |= boost::uint_least32_t(val) << remaining_bits; remaining_bits += bits; } else { if(bits < 32 || remaining_bits != 0) { boost::uint_least32_t extra_bits = boost::uint_least32_t(val) & ((boost::uint_least32_t(1) << (32 - remaining_bits)) - 1); val >>= 32 - remaining_bits; *begin++ = saved_bits | (extra_bits << remaining_bits); if(begin == end) return; available_bits -= 32 - remaining_bits; remaining_bits = 0; } if(bits >= 32) { for(; available_bits >= 32; available_bits -= 32) { boost::uint_least32_t word = boost::uint_least32_t(val) & 0xFFFFFFFFu; int supress_warning = (bits >= 32); BOOST_ASSERT(supress_warning == 1); val >>= (32 * supress_warning); *begin++ = word; if(begin == end) return; } } remaining_bits = available_bits; saved_bits = static_cast(val); } } } template void generate_impl(Engine& eng, Iter first, Iter last, boost::mpl::true_) { return detail::generate_from_int(eng, first, last); } template void generate_impl(Engine& eng, Iter first, Iter last, boost::mpl::false_) { return detail::generate_from_real(eng, first, last); } template void generate(Engine& eng, Iter first, Iter last) { return detail::generate_impl(eng, first, last, boost::is_integral()); } template IntType seed_one_int(SeedSeq& seq) { static const int log = ::boost::mpl::if_c<(m == 0), ::boost::mpl::int_<(::std::numeric_limits::digits)>, ::boost::static_log2 >::type::value; static const int k = (log + ((~(static_cast(2) << (log - 1)) & m)? 32 : 31)) / 32; ::boost::uint_least32_t array[log / 32 + 4]; seq.generate(&array[0], &array[0] + k + 3); IntType s = 0; for(int j = 0; j < k; ++j) { IntType digit = const_mod::apply(IntType(array[j+3])); IntType mult = IntType(1) << 32*j; s = const_mod::mult_add(mult, digit, s); } return s; } template IntType get_one_int(Iter& first, Iter last) { static const int log = ::boost::mpl::if_c<(m == 0), ::boost::mpl::int_<(::std::numeric_limits::digits)>, ::boost::static_log2 >::type::value; static const int k = (log + ((~(static_cast(2) << (log - 1)) & m)? 32 : 31)) / 32; IntType s = 0; for(int j = 0; j < k; ++j) { if(first == last) { throw ::std::invalid_argument("Not enough elements in call to seed."); } IntType digit = const_mod::apply(IntType(*first++)); IntType mult = IntType(1) << 32*j; s = const_mod::mult_add(mult, digit, s); } return s; } // TODO: work in-place whenever possible template void seed_array_int_impl(SeedSeq& seq, UIntType (&x)[n]) { boost::uint_least32_t storage[((w+31)/32) * n]; seq.generate(&storage[0], &storage[0] + ((w+31)/32) * n); for(std::size_t j = 0; j < n; j++) { UIntType val = 0; for(std::size_t k = 0; k < (w+31)/32; ++k) { val += static_cast(storage[(w+31)/32*j + k]) << 32*k; } x[j] = val & ::boost::low_bits_mask_t::sig_bits; } } template inline void seed_array_int_impl(SeedSeq& seq, IntType (&x)[n], boost::mpl::true_) { typedef typename boost::make_unsigned::type unsigned_array[n]; seed_array_int_impl(seq, reinterpret_cast(x)); } template inline void seed_array_int_impl(SeedSeq& seq, IntType (&x)[n], boost::mpl::false_) { seed_array_int_impl(seq, x); } template inline void seed_array_int(SeedSeq& seq, IntType (&x)[n]) { seed_array_int_impl(seq, x, boost::is_signed()); } template void fill_array_int_impl(Iter& first, Iter last, UIntType (&x)[n]) { for(std::size_t j = 0; j < n; j++) { UIntType val = 0; for(std::size_t k = 0; k < (w+31)/32; ++k) { if(first == last) { throw std::invalid_argument("Not enough elements in call to seed."); } val += static_cast(*first++) << 32*k; } x[j] = val & ::boost::low_bits_mask_t::sig_bits; } } template inline void fill_array_int_impl(Iter& first, Iter last, IntType (&x)[n], boost::mpl::true_) { typedef typename boost::make_unsigned::type unsigned_array[n]; fill_array_int_impl(first, last, reinterpret_cast(x)); } template inline void fill_array_int_impl(Iter& first, Iter last, IntType (&x)[n], boost::mpl::false_) { fill_array_int_impl(first, last, x); } template inline void fill_array_int(Iter& first, Iter last, IntType (&x)[n]) { fill_array_int_impl(first, last, x, boost::is_signed()); } template void seed_array_real_impl(const boost::uint_least32_t* storage, RealType (&x)[n]) { boost::uint_least32_t mask = ~((~boost::uint_least32_t(0)) << (w%32)); RealType two32 = 4294967296.0; const RealType divisor = RealType(1)/detail::pow2(w); unsigned int j; for(j = 0; j < n; ++j) { RealType val = RealType(0); RealType mult = divisor; for(int k = 0; k < w/32; ++k) { val += *storage++ * mult; mult *= two32; } if(mask != 0) { val += (*storage++ & mask) * mult; } BOOST_ASSERT(val >= 0); BOOST_ASSERT(val < 1); x[j] = val; } } template void seed_array_real(SeedSeq& seq, RealType (&x)[n]) { using std::pow; boost::uint_least32_t storage[((w+31)/32) * n]; seq.generate(&storage[0], &storage[0] + ((w+31)/32) * n); seed_array_real_impl(storage, x); } template void fill_array_real(Iter& first, Iter last, RealType (&x)[n]) { boost::uint_least32_t mask = ~((~boost::uint_least32_t(0)) << (w%32)); RealType two32 = 4294967296.0; const RealType divisor = RealType(1)/detail::pow2(w); unsigned int j; for(j = 0; j < n; ++j) { RealType val = RealType(0); RealType mult = divisor; for(int k = 0; k < w/32; ++k, ++first) { if(first == last) throw std::invalid_argument("Not enough elements in call to seed."); val += *first * mult; mult *= two32; } if(mask != 0) { if(first == last) throw std::invalid_argument("Not enough elements in call to seed."); val += (*first & mask) * mult; ++first; } BOOST_ASSERT(val >= 0); BOOST_ASSERT(val < 1); x[j] = val; } } } } } #include #endif madp-0.4/src/boost/boost/random/detail/PaxHeaders.5405/ptr_helper.hpp0000644000000000000000000000007312717644140022424 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/random/detail/ptr_helper.hpp0000664000372100037210000000555612717644140023267 0ustar00fransfrans00000000000000/* boost random/detail/ptr_helper.hpp header file * * Copyright Jens Maurer 2002 * Distributed under the Boost Software License, Version 1.0. (See * accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org for most recent version including documentation. * * $Id: ptr_helper.hpp 24096 2004-07-27 03:43:34Z dgregor $ * */ #ifndef BOOST_RANDOM_DETAIL_PTR_HELPER_HPP #define BOOST_RANDOM_DETAIL_PTR_HELPER_HPP #include namespace boost { namespace random { namespace detail { // type_traits could help here, but I don't want to depend on type_traits. template struct ptr_helper { typedef T value_type; typedef T& reference_type; typedef const T& rvalue_type; static reference_type ref(T& r) { return r; } static const T& ref(const T& r) { return r; } }; #ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION template struct ptr_helper { typedef T value_type; typedef T& reference_type; typedef T& rvalue_type; static reference_type ref(T& r) { return r; } static const T& ref(const T& r) { return r; } }; template struct ptr_helper { typedef T value_type; typedef T& reference_type; typedef T* rvalue_type; static reference_type ref(T * p) { return *p; } static const T& ref(const T * p) { return *p; } }; #endif } // namespace detail } // namespace random } // namespace boost // // BOOST_RANDOM_PTR_HELPER_SPEC -- // // Helper macro for broken compilers defines specializations of // ptr_helper. // #ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION # define BOOST_RANDOM_PTR_HELPER_SPEC(T) \ namespace boost { namespace random { namespace detail { \ template<> \ struct ptr_helper \ { \ typedef T value_type; \ typedef T& reference_type; \ typedef T& rvalue_type; \ static reference_type ref(T& r) { return r; } \ static const T& ref(const T& r) { return r; } \ }; \ \ template<> \ struct ptr_helper \ { \ typedef T value_type; \ typedef T& reference_type; \ typedef T* rvalue_type; \ static reference_type ref(T * p) { return *p; } \ static const T& ref(const T * p) { return *p; } \ }; \ }}} #else # define BOOST_RANDOM_PTR_HELPER_SPEC(T) #endif #endif // BOOST_RANDOM_DETAIL_PTR_HELPER_HPP madp-0.4/src/boost/boost/random/detail/PaxHeaders.5405/enable_warnings.hpp0000644000000000000000000000007312717644140023416 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.145552085 madp-0.4/src/boost/boost/random/detail/enable_warnings.hpp0000664000372100037210000000103112717644140024241 0ustar00fransfrans00000000000000/* boost random/detail/enable_warnings.hpp header file * * Copyright Steven Watanabe 2009 * Distributed under the Boost Software License, Version 1.0. (See * accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org for most recent version including documentation. * * $Id: enable_warnings.hpp 58649 2010-01-02 21:23:17Z steven_watanabe $ * */ // No #include guard. This header is intended to be included multiple times. #ifdef BOOST_MSVC #pragma warning(pop) #endif madp-0.4/src/boost/boost/random/detail/PaxHeaders.5405/signed_unsigned_tools.hpp0000644000000000000000000000007312717644140024645 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/random/detail/signed_unsigned_tools.hpp0000664000372100037210000000433612717644140025503 0ustar00fransfrans00000000000000/* boost random/detail/signed_unsigned_tools.hpp header file * * Copyright Jens Maurer 2006 * Distributed under the Boost Software License, Version 1.0. (See * accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org for most recent version including documentation. */ #ifndef BOOST_RANDOM_DETAIL_SIGNED_UNSIGNED_TOOLS #define BOOST_RANDOM_DETAIL_SIGNED_UNSIGNED_TOOLS #include #include #include namespace boost { namespace random { namespace detail { /* * Compute x - y, we know that x >= y, return an unsigned value. */ template::is_signed> struct subtract { }; template struct subtract { typedef T result_type; result_type operator()(T x, T y) { return x - y; } }; template struct subtract { typedef typename make_unsigned::type result_type; result_type operator()(T x, T y) { if (y >= 0) // because x >= y, it follows that x >= 0, too return result_type(x) - result_type(y); if (x >= 0) // y < 0 // avoid the nasty two's complement case for y == min() return result_type(x) + result_type(-(y+1)) + 1; // both x and y are negative: no signed overflow return result_type(x - y); } }; /* * Compute x + y, x is unsigned, result fits in type of "y". */ template::is_signed> struct add { }; template struct add { typedef T2 result_type; result_type operator()(T1 x, T2 y) { return T2(x) + y; } }; template struct add { typedef T2 result_type; result_type operator()(T1 x, T2 y) { if (y >= 0) return T2(x) + y; // y < 0 if (x > T1(-(y+1))) // result >= 0 after subtraction // avoid the nasty two's complement edge case for y == min() return T2(x - T1(-(y+1)) - 1); // abs(x) < abs(y), thus T2 able to represent x return T2(x) + y; } }; } // namespace detail } // namespace random } // namespace boost #endif // BOOST_RANDOM_DETAIL_SIGNED_UNSIGNED_TOOLS madp-0.4/src/boost/boost/random/detail/PaxHeaders.5405/integer_log2.hpp0000644000000000000000000000007312717644140022640 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.145552085 madp-0.4/src/boost/boost/random/detail/integer_log2.hpp0000664000372100037210000000426412717644140023476 0ustar00fransfrans00000000000000/* boost random/detail/integer_log2.hpp header file * * Copyright Steven Watanabe 2011 * Distributed under the Boost Software License, Version 1.0. (See * accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org for most recent version including documentation. * * $Id: integer_log2.hpp 85813 2013-09-21 20:17:00Z jewillco $ * */ #ifndef BOOST_RANDOM_DETAIL_INTEGER_LOG2_HPP #define BOOST_RANDOM_DETAIL_INTEGER_LOG2_HPP #include #include #include namespace boost { namespace random { namespace detail { #if !defined(BOOST_NO_CXX11_CONSTEXPR) #define BOOST_RANDOM_DETAIL_CONSTEXPR constexpr #elif defined(BOOST_MSVC) #define BOOST_RANDOM_DETAIL_CONSTEXPR __forceinline #elif defined(__GNUC__) && __GNUC__ >= 4 #define BOOST_RANDOM_DETAIL_CONSTEXPR inline __attribute__((const)) __attribute__((always_inline)) #else #define BOOST_RANDOM_DETAIL_CONSTEXPR inline #endif template struct integer_log2_impl { #if defined(BOOST_NO_CXX11_CONSTEXPR) template BOOST_RANDOM_DETAIL_CONSTEXPR static int apply(T t, int accum) { int update = ((t >> Shift) != 0) * Shift; return integer_log2_impl::apply(t >> update, accum + update); } #else template BOOST_RANDOM_DETAIL_CONSTEXPR static int apply2(T t, int accum, int update) { return integer_log2_impl::apply(t >> update, accum + update); } template BOOST_RANDOM_DETAIL_CONSTEXPR static int apply(T t, int accum) { return apply2(t, accum, ((t >> Shift) != 0) * Shift); } #endif }; template<> struct integer_log2_impl<1> { template BOOST_RANDOM_DETAIL_CONSTEXPR static int apply(T t, int accum) { return int(t >> 1) + accum; } }; template BOOST_RANDOM_DETAIL_CONSTEXPR int integer_log2(T t) { return integer_log2_impl< ::boost::detail::max_pow2_less< ::std::numeric_limits::digits, 4 >::value >::apply(t, 0); } } // namespace detail } // namespace random } // namespace boost #endif // BOOST_RANDOM_DETAIL_INTEGER_LOG2_HPP madp-0.4/src/boost/boost/random/detail/PaxHeaders.5405/seed.hpp0000644000000000000000000000007312717644140021200 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/random/detail/seed.hpp0000664000372100037210000001166412717644140022040 0ustar00fransfrans00000000000000/* boost random/detail/seed.hpp header file * * Copyright Steven Watanabe 2009 * Distributed under the Boost Software License, Version 1.0. (See * accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org for most recent version including documentation. * * $Id: seed.hpp 71018 2011-04-05 21:27:52Z steven_watanabe $ */ #ifndef BOOST_RANDOM_DETAIL_SEED_HPP #define BOOST_RANDOM_DETAIL_SEED_HPP #include // Sun seems to have trouble with the use of SFINAE for the // templated constructor. So does Borland. #if !defined(BOOST_NO_SFINAE) && !defined(__SUNPRO_CC) && !defined(__BORLANDC__) #include #include namespace boost { namespace random { namespace detail { template struct disable_seed : boost::disable_if > {}; template struct disable_constructor : disable_seed {}; template struct disable_constructor {}; #define BOOST_RANDOM_DETAIL_GENERATOR_CONSTRUCTOR(Self, Generator, gen) \ template \ explicit Self(Generator& gen, typename ::boost::random::detail::disable_constructor::type* = 0) #define BOOST_RANDOM_DETAIL_GENERATOR_SEED(Self, Generator, gen) \ template \ void seed(Generator& gen, typename ::boost::random::detail::disable_seed::type* = 0) #define BOOST_RANDOM_DETAIL_SEED_SEQ_CONSTRUCTOR(Self, SeedSeq, seq) \ template \ explicit Self(SeedSeq& seq, typename ::boost::random::detail::disable_constructor::type* = 0) #define BOOST_RANDOM_DETAIL_SEED_SEQ_SEED(Self, SeedSeq, seq) \ template \ void seed(SeedSeq& seq, typename ::boost::random::detail::disable_seed::type* = 0) #define BOOST_RANDOM_DETAIL_ARITHMETIC_CONSTRUCTOR(Self, T, x) \ explicit Self(const T& x) #define BOOST_RANDOM_DETAIL_ARITHMETIC_SEED(Self, T, x) \ void seed(const T& x) } } } #else #include #include #define BOOST_RANDOM_DETAIL_GENERATOR_CONSTRUCTOR(Self, Generator, gen) \ Self(Self& other) { *this = other; } \ Self(const Self& other) { *this = other; } \ template \ explicit Self(Generator& gen) { \ boost_random_constructor_impl(gen, ::boost::is_arithmetic());\ } \ template \ void boost_random_constructor_impl(Generator& gen, ::boost::mpl::false_) #define BOOST_RANDOM_DETAIL_GENERATOR_SEED(Self, Generator, gen) \ template \ void seed(Generator& gen) { \ boost_random_seed_impl(gen, ::boost::is_arithmetic());\ }\ template\ void boost_random_seed_impl(Generator& gen, ::boost::mpl::false_) #define BOOST_RANDOM_DETAIL_SEED_SEQ_CONSTRUCTOR(Self, SeedSeq, seq) \ Self(Self& other) { *this = other; } \ Self(const Self& other) { *this = other; } \ template \ explicit Self(SeedSeq& seq) { \ boost_random_constructor_impl(seq, ::boost::is_arithmetic());\ } \ template \ void boost_random_constructor_impl(SeedSeq& seq, ::boost::mpl::false_) #define BOOST_RANDOM_DETAIL_SEED_SEQ_SEED(Self, SeedSeq, seq) \ template \ void seed(SeedSeq& seq) { \ boost_random_seed_impl(seq, ::boost::is_arithmetic()); \ } \ template \ void boost_random_seed_impl(SeedSeq& seq, ::boost::mpl::false_) #define BOOST_RANDOM_DETAIL_ARITHMETIC_CONSTRUCTOR(Self, T, x) \ explicit Self(const T& x) { boost_random_constructor_impl(x, ::boost::mpl::true_()); }\ void boost_random_constructor_impl(const T& x, ::boost::mpl::true_) #define BOOST_RANDOM_DETAIL_ARITHMETIC_SEED(Self, T, x) \ void seed(const T& x) { boost_random_seed_impl(x, ::boost::mpl::true_()); }\ void boost_random_seed_impl(const T& x, ::boost::mpl::true_) #endif #endif madp-0.4/src/boost/boost/random/detail/PaxHeaders.5405/generator_bits.hpp0000644000000000000000000000007312717644140023267 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.145552085 madp-0.4/src/boost/boost/random/detail/generator_bits.hpp0000664000372100037210000000165212717644140024123 0ustar00fransfrans00000000000000/* boost random/detail/generator_bits.hpp header file * * Copyright Steven Watanabe 2011 * Distributed under the Boost Software License, Version 1.0. (See * accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org for most recent version including documentation. * * $Id: generator_bits.hpp 72951 2011-07-07 04:57:37Z steven_watanabe $ * */ #ifndef BOOST_RANDOM_DETAIL_GENERATOR_BITS_HPP #define BOOST_RANDOM_DETAIL_GENERATOR_BITS_HPP #include namespace boost { namespace random { namespace detail { // This is a temporary measure that retains backwards // compatibility. template struct generator_bits { static std::size_t value() { return std::numeric_limits::digits; } }; } // namespace detail } // namespace random } // namespace boost #endif // BOOST_RANDOM_DETAIL_GENERATOR_BITS_HPP madp-0.4/src/boost/boost/random/detail/PaxHeaders.5405/operators.hpp0000644000000000000000000000007312717644140022276 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.149552054 madp-0.4/src/boost/boost/random/detail/operators.hpp0000664000372100037210000000722412717644140023133 0ustar00fransfrans00000000000000/* boost random/detail/operators.hpp header file * * Copyright Steven Watanabe 2010-2011 * Distributed under the Boost Software License, Version 1.0. (See * accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org for most recent version including documentation. * * $Id: operators.hpp 71018 2011-04-05 21:27:52Z steven_watanabe $ */ #ifndef BOOST_RANDOM_DETAIL_OPERATORS_HPP #define BOOST_RANDOM_DETAIL_OPERATORS_HPP #include #include #if BOOST_WORKAROUND(BOOST_MSVC, <= 1310) \ || BOOST_WORKAROUND(__SUNPRO_CC, BOOST_TESTED_AT(0x5100)) #define BOOST_RANDOM_DETAIL_OSTREAM_OPERATOR(os, T, t) \ template \ friend std::basic_ostream& \ operator<<(std::basic_ostream& os, const T& t) { \ t.print(os, t); \ return os; \ } \ template \ static std::basic_ostream& \ print(std::basic_ostream& os, const T& t) #define BOOST_RANDOM_DETAIL_ISTREAM_OPERATOR(is, T, t) \ template \ friend std::basic_istream& \ operator>>(std::basic_istream& is, T& t) { \ t.read(is, t); \ return is; \ } \ template \ static std::basic_istream& \ read(std::basic_istream& is, T& t) #endif #if defined(__BORLANDC__) #define BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR(T, lhs, rhs) \ bool operator==(const T& rhs) const \ { return T::is_equal(*this, rhs); } \ static bool is_equal(const T& lhs, const T& rhs) #define BOOST_RANDOM_DETAIL_INEQUALITY_OPERATOR(T) \ bool operator!=(const T& rhs) const \ { return !T::is_equal(*this, rhs); } #endif #ifndef BOOST_RANDOM_DETAIL_OSTREAM_OPERATOR #define BOOST_RANDOM_DETAIL_OSTREAM_OPERATOR(os, T, t) \ template \ friend std::basic_ostream& \ operator<<(std::basic_ostream& os, const T& t) #endif #ifndef BOOST_RANDOM_DETAIL_ISTREAM_OPERATOR #define BOOST_RANDOM_DETAIL_ISTREAM_OPERATOR(is, T, t) \ template \ friend std::basic_istream& \ operator>>(std::basic_istream& is, T& t) #endif #ifndef BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR #define BOOST_RANDOM_DETAIL_EQUALITY_OPERATOR(T, lhs, rhs) \ friend bool operator==(const T& lhs, const T& rhs) #endif #ifndef BOOST_RANDOM_DETAIL_INEQUALITY_OPERATOR #define BOOST_RANDOM_DETAIL_INEQUALITY_OPERATOR(T) \ friend bool operator!=(const T& lhs, const T& rhs) \ { return !(lhs == rhs); } #endif #endif madp-0.4/src/boost/boost/random/detail/PaxHeaders.5405/disable_warnings.hpp0000644000000000000000000000007312717644140023573 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.145552085 madp-0.4/src/boost/boost/random/detail/disable_warnings.hpp0000664000372100037210000000122312717644140024421 0ustar00fransfrans00000000000000/* boost random/detail/disable_warnings.hpp header file * * Copyright Steven Watanabe 2009 * Distributed under the Boost Software License, Version 1.0. (See * accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org for most recent version including documentation. * * $Id: disable_warnings.hpp 60755 2010-03-22 00:45:06Z steven_watanabe $ * */ // No #include guard. This header is intended to be included multiple times. #include #ifdef BOOST_MSVC #pragma warning(push) #pragma warning(disable:4512) #pragma warning(disable:4127) #pragma warning(disable:4724) #endif madp-0.4/src/boost/boost/PaxHeaders.5405/multi_index0000644000000000000000000000007412717644140017272 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/0000775000372100037210000000000012717644140020176 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/multi_index/PaxHeaders.5405/mem_fun.hpp0000644000000000000000000000007412717644140021506 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/mem_fun.hpp0000664000372100037210000001244412717644140022342 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_MEM_FUN_HPP #define BOOST_MULTI_INDEX_MEM_FUN_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #if !defined(BOOST_NO_SFINAE) #include #endif namespace boost{ template class reference_wrapper; /* fwd decl. */ namespace multi_index{ /* mem_fun implements a read-only key extractor based on a given non-const * member function of a class. * const_mem_fun does the same for const member functions. * Additionally, mem_fun and const_mem_fun are overloaded to support * referece_wrappers of T and "chained pointers" to T's. By chained pointer * to T we mean a type P such that, given a p of Type P * *...n...*x is convertible to T&, for some n>=1. * Examples of chained pointers are raw and smart pointers, iterators and * arbitrary combinations of these (vg. T** or auto_ptr.) */ template struct const_mem_fun { typedef typename remove_reference::type result_type; template #if !defined(BOOST_NO_SFINAE) typename disable_if< is_convertible,Type>::type #else Type #endif operator()(const ChainedPtr& x)const { return operator()(*x); } Type operator()(const Class& x)const { return (x.*PtrToMemberFunction)(); } Type operator()(const reference_wrapper& x)const { return operator()(x.get()); } Type operator()(const reference_wrapper& x)const { return operator()(x.get()); } }; template struct mem_fun { typedef typename remove_reference::type result_type; template #if !defined(BOOST_NO_SFINAE) typename disable_if< is_convertible,Type>::type #else Type #endif operator()(const ChainedPtr& x)const { return operator()(*x); } Type operator()(Class& x)const { return (x.*PtrToMemberFunction)(); } Type operator()(const reference_wrapper& x)const { return operator()(x.get()); } }; /* MSVC++ 6.0 has problems with const member functions as non-type template * parameters, somehow it takes them as non-const. const_mem_fun_explicit * workarounds this deficiency by accepting an extra type parameter that * specifies the signature of the member function. The workaround was found at: * Daniel, C.:"Re: weird typedef problem in VC", * news:microsoft.public.vc.language, 21st nov 2002, * http://groups.google.com/groups? * hl=en&lr=&ie=UTF-8&selm=ukwvg3O0BHA.1512%40tkmsftngp05 */ template< class Class,typename Type, typename PtrToMemberFunctionType,PtrToMemberFunctionType PtrToMemberFunction> struct const_mem_fun_explicit { typedef typename remove_reference::type result_type; template #if !defined(BOOST_NO_SFINAE) typename disable_if< is_convertible,Type>::type #else Type #endif operator()(const ChainedPtr& x)const { return operator()(*x); } Type operator()(const Class& x)const { return (x.*PtrToMemberFunction)(); } Type operator()(const reference_wrapper& x)const { return operator()(x.get()); } Type operator()(const reference_wrapper& x)const { return operator()(x.get()); } }; template< class Class,typename Type, typename PtrToMemberFunctionType,PtrToMemberFunctionType PtrToMemberFunction> struct mem_fun_explicit { typedef typename remove_reference::type result_type; template #if !defined(BOOST_NO_SFINAE) typename disable_if< is_convertible,Type>::type #else Type #endif operator()(const ChainedPtr& x)const { return operator()(*x); } Type operator()(Class& x)const { return (x.*PtrToMemberFunction)(); } Type operator()(const reference_wrapper& x)const { return operator()(x.get()); } }; /* BOOST_MULTI_INDEX_CONST_MEM_FUN and BOOST_MULTI_INDEX_MEM_FUN resolve to * [const_]mem_fun_explicit for MSVC++ 6.0 and to [const_]mem_fun otherwise. */ #if defined(BOOST_MSVC)&&(BOOST_MSVC<1300) #define BOOST_MULTI_INDEX_CONST_MEM_FUN(Class,Type,MemberFunName) \ ::boost::multi_index::const_mem_fun_explicit<\ Class,Type,Type (Class::*)()const,&Class::MemberFunName > #define BOOST_MULTI_INDEX_MEM_FUN(Class,Type,MemberFunName) \ ::boost::multi_index::mem_fun_explicit<\ Class,Type,Type (Class::*)(),&Class::MemberFunName > #else #define BOOST_MULTI_INDEX_CONST_MEM_FUN(Class,Type,MemberFunName) \ ::boost::multi_index::const_mem_fun< Class,Type,&Class::MemberFunName > #define BOOST_MULTI_INDEX_MEM_FUN(Class,Type,MemberFunName) \ ::boost::multi_index::mem_fun< Class,Type,&Class::MemberFunName > #endif } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/PaxHeaders.5405/global_fun.hpp0000644000000000000000000000007412717644140022170 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/global_fun.hpp0000664000372100037210000001117312717644140023022 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_GLOBAL_FUN_HPP #define BOOST_MULTI_INDEX_GLOBAL_FUN_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include #include #if !defined(BOOST_NO_SFINAE) #include #endif namespace boost{ template class reference_wrapper; /* fwd decl. */ namespace multi_index{ namespace detail{ /* global_fun is a read-only key extractor from Value based on a given global * (or static member) function with signature: * * Type f([const] Value [&]); * * Additionally, global_fun and const_global_fun are overloaded to support * referece_wrappers of Value and "chained pointers" to Value's. By chained * pointer to T we mean a type P such that, given a p of Type P * *...n...*x is convertible to T&, for some n>=1. * Examples of chained pointers are raw and smart pointers, iterators and * arbitrary combinations of these (vg. T** or auto_ptr.) */ /* NB. Some overloads of operator() have an extra dummy parameter int=0. * This disambiguator serves several purposes: * - Without it, MSVC++ 6.0 incorrectly regards some overloads as * specializations of a previous member function template. * - MSVC++ 6.0/7.0 seem to incorrectly treat some different memfuns * as if they have the same signature. * - If remove_const is broken due to lack of PTS, int=0 avoids the * declaration of memfuns with identical signature. */ template struct const_ref_global_fun_base { typedef typename remove_reference::type result_type; template #if !defined(BOOST_NO_SFINAE) typename disable_if< is_convertible,Type>::type #else Type #endif operator()(const ChainedPtr& x)const { return operator()(*x); } Type operator()(Value x)const { return PtrToFunction(x); } Type operator()( const reference_wrapper< typename remove_reference::type>& x)const { return operator()(x.get()); } Type operator()( const reference_wrapper< typename remove_const< typename remove_reference::type>::type>& x,int=0)const { return operator()(x.get()); } }; template struct non_const_ref_global_fun_base { typedef typename remove_reference::type result_type; template #if !defined(BOOST_NO_SFINAE) typename disable_if< is_convertible,Type>::type #else Type #endif operator()(const ChainedPtr& x)const { return operator()(*x); } Type operator()(Value x)const { return PtrToFunction(x); } Type operator()( const reference_wrapper< typename remove_reference::type>& x)const { return operator()(x.get()); } }; template struct non_ref_global_fun_base { typedef typename remove_reference::type result_type; template #if !defined(BOOST_NO_SFINAE) typename disable_if< is_convertible,Type>::type #else Type #endif operator()(const ChainedPtr& x)const { return operator()(*x); } Type operator()(const Value& x)const { return PtrToFunction(x); } Type operator()(const reference_wrapper& x)const { return operator()(x.get()); } Type operator()( const reference_wrapper< typename remove_const::type>& x,int=0)const { return operator()(x.get()); } }; } /* namespace multi_index::detail */ template struct global_fun: mpl::if_c< is_reference::value, typename mpl::if_c< is_const::type>::value, detail::const_ref_global_fun_base, detail::non_const_ref_global_fun_base >::type, detail::non_ref_global_fun_base >::type { }; } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/PaxHeaders.5405/sequenced_index.hpp0000644000000000000000000000007412717644140023223 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/sequenced_index.hpp0000664000372100037210000007461412717644140024066 0ustar00fransfrans00000000000000/* Copyright 2003-2013 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_SEQUENCED_INDEX_HPP #define BOOST_MULTI_INDEX_SEQUENCED_INDEX_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) #include #endif #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) #include #endif #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING) #define BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT_OF(x) \ detail::scope_guard BOOST_JOIN(check_invariant_,__LINE__)= \ detail::make_obj_guard(x,&sequenced_index::check_invariant_); \ BOOST_JOIN(check_invariant_,__LINE__).touch(); #define BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT \ BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT_OF(*this) #else #define BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT_OF(x) #define BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT #endif namespace boost{ namespace multi_index{ namespace detail{ /* sequenced_index adds a layer of sequenced indexing to a given Super */ template class sequenced_index: BOOST_MULTI_INDEX_PROTECTED_IF_MEMBER_TEMPLATE_FRIENDS SuperMeta::type #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) #if BOOST_WORKAROUND(BOOST_MSVC,<1300) ,public safe_ctr_proxy_impl< bidir_node_iterator< sequenced_index_node >, sequenced_index > #else ,public safe_mode::safe_container< sequenced_index > #endif #endif { #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING)&&\ BOOST_WORKAROUND(__MWERKS__,<=0x3003) /* The "ISO C++ Template Parser" option in CW8.3 has a problem with the * lifetime of const references bound to temporaries --precisely what * scopeguards are. */ #pragma parse_mfunc_templ off #endif typedef typename SuperMeta::type super; protected: typedef sequenced_index_node< typename super::node_type> node_type; private: typedef typename node_type::impl_type node_impl_type; public: /* types */ typedef typename node_type::value_type value_type; typedef tuples::null_type ctor_args; typedef typename super::final_allocator_type allocator_type; typedef typename allocator_type::reference reference; typedef typename allocator_type::const_reference const_reference; #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) #if BOOST_WORKAROUND(BOOST_MSVC,<1300) typedef safe_mode::safe_iterator< bidir_node_iterator, safe_ctr_proxy< bidir_node_iterator > > iterator; #else typedef safe_mode::safe_iterator< bidir_node_iterator, sequenced_index> iterator; #endif #else typedef bidir_node_iterator iterator; #endif typedef iterator const_iterator; typedef std::size_t size_type; typedef std::ptrdiff_t difference_type; typedef typename allocator_type::pointer pointer; typedef typename allocator_type::const_pointer const_pointer; typedef typename boost::reverse_iterator reverse_iterator; typedef typename boost::reverse_iterator const_reverse_iterator; typedef TagList tag_list; protected: typedef typename super::final_node_type final_node_type; typedef tuples::cons< ctor_args, typename super::ctor_args_list> ctor_args_list; typedef typename mpl::push_front< typename super::index_type_list, sequenced_index>::type index_type_list; typedef typename mpl::push_front< typename super::iterator_type_list, iterator>::type iterator_type_list; typedef typename mpl::push_front< typename super::const_iterator_type_list, const_iterator>::type const_iterator_type_list; typedef typename super::copy_map_type copy_map_type; #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) typedef typename super::index_saver_type index_saver_type; typedef typename super::index_loader_type index_loader_type; #endif private: #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) #if BOOST_WORKAROUND(BOOST_MSVC,<1300) typedef safe_ctr_proxy_impl< bidir_node_iterator, sequenced_index> safe_super; #else typedef safe_mode::safe_container< sequenced_index> safe_super; #endif #endif typedef typename call_traits::param_type value_param_type; /* Needed to avoid commas in BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL * expansion. */ typedef std::pair emplace_return_type; public: /* construct/copy/destroy * Default and copy ctors are in the protected section as indices are * not supposed to be created on their own. No range ctor either. */ sequenced_index& operator=( const sequenced_index& x) { this->final()=x.final(); return *this; } #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) sequenced_index& operator=( std::initializer_list list) { this->final()=list; return *this; } #endif template void assign(InputIterator first,InputIterator last) { assign_iter(first,last,mpl::not_ >()); } #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) void assign(std::initializer_list list) { assign(list.begin(),list.end()); } #endif void assign(size_type n,value_param_type value) { BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; clear(); for(size_type i=0;ifinal().get_allocator(); } /* iterators */ iterator begin() {return make_iterator(node_type::from_impl(header()->next()));} const_iterator begin()const {return make_iterator(node_type::from_impl(header()->next()));} iterator end(){return make_iterator(header());} const_iterator end()const{return make_iterator(header());} reverse_iterator rbegin(){return make_reverse_iterator(end());} const_reverse_iterator rbegin()const{return make_reverse_iterator(end());} reverse_iterator rend(){return make_reverse_iterator(begin());} const_reverse_iterator rend()const{return make_reverse_iterator(begin());} const_iterator cbegin()const{return begin();} const_iterator cend()const{return end();} const_reverse_iterator crbegin()const{return rbegin();} const_reverse_iterator crend()const{return rend();} iterator iterator_to(const value_type& x) { return make_iterator(node_from_value(&x)); } const_iterator iterator_to(const value_type& x)const { return make_iterator(node_from_value(&x)); } /* capacity */ bool empty()const{return this->final_empty_();} size_type size()const{return this->final_size_();} size_type max_size()const{return this->final_max_size_();} void resize(size_type n) { BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; if(n>size()){ for(size_type m=n-size();m--;) this->final_emplace_(BOOST_MULTI_INDEX_NULL_PARAM_PACK); } else if(nsize())insert(end(),n-size(),x); else if(n push_front(const value_type& x) {return insert(begin(),x);} std::pair push_front(BOOST_RV_REF(value_type) x) {return insert(begin(),boost::move(x));} void pop_front(){erase(begin());} BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL( emplace_return_type,emplace_back,emplace_back_impl) std::pair push_back(const value_type& x) {return insert(end(),x);} std::pair push_back(BOOST_RV_REF(value_type) x) {return insert(end(),boost::move(x));} void pop_back(){erase(--end());} BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL_EXTRA_ARG( emplace_return_type,emplace,emplace_impl,iterator,position) std::pair insert(iterator position,const value_type& x) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; std::pair p=this->final_insert_(x); if(p.second&&position.get_node()!=header()){ relink(position.get_node(),p.first); } return std::pair(make_iterator(p.first),p.second); } std::pair insert(iterator position,BOOST_RV_REF(value_type) x) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; std::pair p=this->final_insert_rv_(x); if(p.second&&position.get_node()!=header()){ relink(position.get_node(),p.first); } return std::pair(make_iterator(p.first),p.second); } void insert(iterator position,size_type n,value_param_type x) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; for(size_type i=0;i void insert(iterator position,InputIterator first,InputIterator last) { insert_iter(position,first,last,mpl::not_ >()); } #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) void insert(iterator position,std::initializer_list list) { insert(position,list.begin(),list.end()); } #endif iterator erase(iterator position) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; this->final_erase_(static_cast(position++.get_node())); return position; } iterator erase(iterator first,iterator last) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(first); BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(last); BOOST_MULTI_INDEX_CHECK_IS_OWNER(first,*this); BOOST_MULTI_INDEX_CHECK_IS_OWNER(last,*this); BOOST_MULTI_INDEX_CHECK_VALID_RANGE(first,last); BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; while(first!=last){ first=erase(first); } return first; } bool replace(iterator position,const value_type& x) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; return this->final_replace_( x,static_cast(position.get_node())); } bool replace(iterator position,BOOST_RV_REF(value_type) x) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; return this->final_replace_rv_( x,static_cast(position.get_node())); } template bool modify(iterator position,Modifier mod) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) /* MSVC++ 6.0 optimizer on safe mode code chokes if this * this is not added. Left it for all compilers as it does no * harm. */ position.detach(); #endif return this->final_modify_( mod,static_cast(position.get_node())); } template bool modify(iterator position,Modifier mod,Rollback back) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) /* MSVC++ 6.0 optimizer on safe mode code chokes if this * this is not added. Left it for all compilers as it does no * harm. */ position.detach(); #endif return this->final_modify_( mod,back,static_cast(position.get_node())); } void swap(sequenced_index& x) { BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT_OF(x); this->final_swap_(x.final()); } void clear() { BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; this->final_clear_(); } /* list operations */ void splice(iterator position,sequenced_index& x) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_CHECK_DIFFERENT_CONTAINER(*this,x); BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; iterator first=x.begin(),last=x.end(); while(first!=last){ if(insert(position,*first).second)first=x.erase(first); else ++first; } } void splice(iterator position,sequenced_index& x,iterator i) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(i); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(i); BOOST_MULTI_INDEX_CHECK_IS_OWNER(i,x); BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; if(&x==this){ if(position!=i)relink(position.get_node(),i.get_node()); } else{ if(insert(position,*i).second){ #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) /* MSVC++ 6.0 optimizer has a hard time with safe mode, and the following * workaround is needed. Left it for all compilers as it does no * harm. */ i.detach(); x.erase(x.make_iterator(i.get_node())); #else x.erase(i); #endif } } } void splice( iterator position,sequenced_index& x, iterator first,iterator last) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(first); BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(last); BOOST_MULTI_INDEX_CHECK_IS_OWNER(first,x); BOOST_MULTI_INDEX_CHECK_IS_OWNER(last,x); BOOST_MULTI_INDEX_CHECK_VALID_RANGE(first,last); BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; if(&x==this){ BOOST_MULTI_INDEX_CHECK_OUTSIDE_RANGE(position,first,last); if(position!=last)relink( position.get_node(),first.get_node(),last.get_node()); } else{ while(first!=last){ if(insert(position,*first).second)first=x.erase(first); else ++first; } } } void remove(value_param_type value) { sequenced_index_remove( *this,std::bind2nd(std::equal_to(),value)); } template void remove_if(Predicate pred) { sequenced_index_remove(*this,pred); } void unique() { sequenced_index_unique(*this,std::equal_to()); } template void unique(BinaryPredicate binary_pred) { sequenced_index_unique(*this,binary_pred); } void merge(sequenced_index& x) { sequenced_index_merge(*this,x,std::less()); } template void merge(sequenced_index& x,Compare comp) { sequenced_index_merge(*this,x,comp); } void sort() { BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; sequenced_index_sort(header(),std::less()); } template void sort(Compare comp) { BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; sequenced_index_sort(header(),comp); } void reverse() { BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; node_impl_type::reverse(header()->impl()); } /* rearrange operations */ void relocate(iterator position,iterator i) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(i); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(i); BOOST_MULTI_INDEX_CHECK_IS_OWNER(i,*this); BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; if(position!=i)relink(position.get_node(),i.get_node()); } void relocate(iterator position,iterator first,iterator last) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(first); BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(last); BOOST_MULTI_INDEX_CHECK_IS_OWNER(first,*this); BOOST_MULTI_INDEX_CHECK_IS_OWNER(last,*this); BOOST_MULTI_INDEX_CHECK_VALID_RANGE(first,last); BOOST_MULTI_INDEX_CHECK_OUTSIDE_RANGE(position,first,last); BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; if(position!=last)relink( position.get_node(),first.get_node(),last.get_node()); } template void rearrange(InputIterator first) { BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; node_type* pos=header(); for(size_type s=size();s--;){ const value_type& v=*first++; relink(pos,node_from_value(&v)); } } BOOST_MULTI_INDEX_PROTECTED_IF_MEMBER_TEMPLATE_FRIENDS: sequenced_index(const ctor_args_list& args_list,const allocator_type& al): super(args_list.get_tail(),al) { empty_initialize(); } sequenced_index(const sequenced_index& x): super(x) #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) ,safe_super() #endif { /* the actual copying takes place in subsequent call to copy_() */ } sequenced_index( const sequenced_index& x,do_not_copy_elements_tag): super(x,do_not_copy_elements_tag()) #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) ,safe_super() #endif { empty_initialize(); } ~sequenced_index() { /* the container is guaranteed to be empty by now */ } #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) iterator make_iterator(node_type* node){return iterator(node,this);} const_iterator make_iterator(node_type* node)const {return const_iterator(node,const_cast(this));} #else iterator make_iterator(node_type* node){return iterator(node);} const_iterator make_iterator(node_type* node)const {return const_iterator(node);} #endif void copy_( const sequenced_index& x,const copy_map_type& map) { node_type* org=x.header(); node_type* cpy=header(); do{ node_type* next_org=node_type::from_impl(org->next()); node_type* next_cpy=map.find(static_cast(next_org)); cpy->next()=next_cpy->impl(); next_cpy->prior()=cpy->impl(); org=next_org; cpy=next_cpy; }while(org!=x.header()); super::copy_(x,map); } template node_type* insert_(value_param_type v,node_type* x,Variant variant) { node_type* res=static_cast(super::insert_(v,x,variant)); if(res==x)link(x); return res; } template node_type* insert_( value_param_type v,node_type* position,node_type* x,Variant variant) { node_type* res= static_cast(super::insert_(v,position,x,variant)); if(res==x)link(x); return res; } void erase_(node_type* x) { unlink(x); super::erase_(x); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) detach_iterators(x); #endif } void delete_all_nodes_() { for(node_type* x=node_type::from_impl(header()->next());x!=header();){ node_type* y=node_type::from_impl(x->next()); this->final_delete_node_(static_cast(x)); x=y; } } void clear_() { super::clear_(); empty_initialize(); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) safe_super::detach_dereferenceable_iterators(); #endif } void swap_(sequenced_index& x) { #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) safe_super::swap(x); #endif super::swap_(x); } void swap_elements_(sequenced_index& x) { #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) safe_super::swap(x); #endif super::swap_elements_(x); } template bool replace_(value_param_type v,node_type* x,Variant variant) { return super::replace_(v,x,variant); } bool modify_(node_type* x) { BOOST_TRY{ if(!super::modify_(x)){ unlink(x); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) detach_iterators(x); #endif return false; } else return true; } BOOST_CATCH(...){ unlink(x); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) detach_iterators(x); #endif BOOST_RETHROW; } BOOST_CATCH_END } bool modify_rollback_(node_type* x) { return super::modify_rollback_(x); } #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) /* serialization */ template void save_( Archive& ar,const unsigned int version,const index_saver_type& sm)const { sm.save(begin(),end(),ar,version); super::save_(ar,version,sm); } template void load_( Archive& ar,const unsigned int version,const index_loader_type& lm) { lm.load( ::boost::bind(&sequenced_index::rearranger,this,_1,_2), ar,version); super::load_(ar,version,lm); } #endif #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING) /* invariant stuff */ bool invariant_()const { if(size()==0||begin()==end()){ if(size()!=0||begin()!=end()|| header()->next()!=header()->impl()|| header()->prior()!=header()->impl())return false; } else{ size_type s=0; for(const_iterator it=begin(),it_end=end();it!=it_end;++it,++s){ if(it.get_node()->next()->prior()!=it.get_node()->impl())return false; if(it.get_node()->prior()->next()!=it.get_node()->impl())return false; } if(s!=size())return false; } return super::invariant_(); } /* This forwarding function eases things for the boost::mem_fn construct * in BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT. Actually, * final_check_invariant is already an inherited member function of index. */ void check_invariant_()const{this->final_check_invariant_();} #endif private: node_type* header()const{return this->final_header();} void empty_initialize() { header()->prior()=header()->next()=header()->impl(); } void link(node_type* x) { node_impl_type::link(x->impl(),header()->impl()); }; static void unlink(node_type* x) { node_impl_type::unlink(x->impl()); } static void relink(node_type* position,node_type* x) { node_impl_type::relink(position->impl(),x->impl()); } static void relink(node_type* position,node_type* first,node_type* last) { node_impl_type::relink( position->impl(),first->impl(),last->impl()); } #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) void rearranger(node_type* position,node_type *x) { if(!position)position=header(); node_type::increment(position); if(position!=x)relink(position,x); } #endif #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) void detach_iterators(node_type* x) { iterator it=make_iterator(x); safe_mode::detach_equivalent_iterators(it); } #endif template void assign_iter(InputIterator first,InputIterator last,mpl::true_) { BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; clear(); for(;first!=last;++first)this->final_insert_ref_(*first); } void assign_iter(size_type n,value_param_type value,mpl::false_) { BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; clear(); for(size_type i=0;i void insert_iter( iterator position,InputIterator first,InputIterator last,mpl::true_) { BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; for(;first!=last;++first){ std::pair p= this->final_insert_ref_(*first); if(p.second&&position.get_node()!=header()){ relink(position.get_node(),p.first); } } } void insert_iter( iterator position,size_type n,value_param_type x,mpl::false_) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; for(size_type i=0;i std::pair emplace_front_impl( BOOST_MULTI_INDEX_FUNCTION_PARAM_PACK) { return emplace_impl(begin(),BOOST_MULTI_INDEX_FORWARD_PARAM_PACK); } template std::pair emplace_back_impl( BOOST_MULTI_INDEX_FUNCTION_PARAM_PACK) { return emplace_impl(end(),BOOST_MULTI_INDEX_FORWARD_PARAM_PACK); } template std::pair emplace_impl( iterator position,BOOST_MULTI_INDEX_FUNCTION_PARAM_PACK) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT; std::pair p= this->final_emplace_(BOOST_MULTI_INDEX_FORWARD_PARAM_PACK); if(p.second&&position.get_node()!=header()){ relink(position.get_node(),p.first); } return std::pair(make_iterator(p.first),p.second); } #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING)&&\ BOOST_WORKAROUND(__MWERKS__,<=0x3003) #pragma parse_mfunc_templ reset #endif }; /* comparison */ template< typename SuperMeta1,typename TagList1, typename SuperMeta2,typename TagList2 > bool operator==( const sequenced_index& x, const sequenced_index& y) { return x.size()==y.size()&&std::equal(x.begin(),x.end(),y.begin()); } template< typename SuperMeta1,typename TagList1, typename SuperMeta2,typename TagList2 > bool operator<( const sequenced_index& x, const sequenced_index& y) { return std::lexicographical_compare(x.begin(),x.end(),y.begin(),y.end()); } template< typename SuperMeta1,typename TagList1, typename SuperMeta2,typename TagList2 > bool operator!=( const sequenced_index& x, const sequenced_index& y) { return !(x==y); } template< typename SuperMeta1,typename TagList1, typename SuperMeta2,typename TagList2 > bool operator>( const sequenced_index& x, const sequenced_index& y) { return y bool operator>=( const sequenced_index& x, const sequenced_index& y) { return !(x bool operator<=( const sequenced_index& x, const sequenced_index& y) { return !(x>y); } /* specialized algorithms */ template void swap( sequenced_index& x, sequenced_index& y) { x.swap(y); } } /* namespace multi_index::detail */ /* sequenced index specifier */ template struct sequenced { BOOST_STATIC_ASSERT(detail::is_tag::value); template struct node_class { typedef detail::sequenced_index_node type; }; template struct index_class { typedef detail::sequenced_index type; }; }; } /* namespace multi_index */ } /* namespace boost */ /* Boost.Foreach compatibility */ template inline boost::mpl::true_* boost_foreach_is_noncopyable( boost::multi_index::detail::sequenced_index*&, boost::foreach::tag) { return 0; } #undef BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT #undef BOOST_MULTI_INDEX_SEQ_INDEX_CHECK_INVARIANT_OF #endif madp-0.4/src/boost/boost/multi_index/PaxHeaders.5405/key_extractors.hpp0000644000000000000000000000007412717644140023126 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/key_extractors.hpp0000664000372100037210000000121412717644140023753 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_KEY_EXTRACTORS_HPP #define BOOST_MULTI_INDEX_KEY_EXTRACTORS_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include #include #include #include #include #endif madp-0.4/src/boost/boost/multi_index/PaxHeaders.5405/safe_mode_errors.hpp0000644000000000000000000000007412717644140023376 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/safe_mode_errors.hpp0000664000372100037210000000206312717644140024226 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_SAFE_MODE_ERRORS_HPP #define BOOST_MULTI_INDEX_SAFE_MODE_ERRORS_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif namespace boost{ namespace multi_index{ namespace safe_mode{ /* Error codes for Boost.MultiIndex safe mode. These go in a separate * header so that the user can include it when redefining * BOOST_MULTI_INDEX_SAFE_MODE_ASSERT prior to the inclusion of * any other header of Boost.MultiIndex. */ enum error_code { invalid_iterator=0, not_dereferenceable_iterator, not_incrementable_iterator, not_decrementable_iterator, not_owner, not_same_owner, invalid_range, inside_range, out_of_bounds, same_container }; } /* namespace multi_index::safe_mode */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/PaxHeaders.5405/sequenced_index_fwd.hpp0000644000000000000000000000007412717644140024063 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/sequenced_index_fwd.hpp0000664000372100037210000000421412717644140024713 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_SEQUENCED_INDEX_FWD_HPP #define BOOST_MULTI_INDEX_SEQUENCED_INDEX_FWD_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include namespace boost{ namespace multi_index{ namespace detail{ template class sequenced_index; template< typename SuperMeta1,typename TagList1, typename SuperMeta2,typename TagList2 > bool operator==( const sequenced_index& x, const sequenced_index& y); template< typename SuperMeta1,typename TagList1, typename SuperMeta2,typename TagList2 > bool operator<( const sequenced_index& x, const sequenced_index& y); template< typename SuperMeta1,typename TagList1, typename SuperMeta2,typename TagList2 > bool operator!=( const sequenced_index& x, const sequenced_index& y); template< typename SuperMeta1,typename TagList1, typename SuperMeta2,typename TagList2 > bool operator>( const sequenced_index& x, const sequenced_index& y); template< typename SuperMeta1,typename TagList1, typename SuperMeta2,typename TagList2 > bool operator>=( const sequenced_index& x, const sequenced_index& y); template< typename SuperMeta1,typename TagList1, typename SuperMeta2,typename TagList2 > bool operator<=( const sequenced_index& x, const sequenced_index& y); template void swap( sequenced_index& x, sequenced_index& y); } /* namespace multi_index::detail */ /* index specifiers */ template > struct sequenced; } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/PaxHeaders.5405/random_access_index.hpp0000644000000000000000000000007412717644140024050 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/random_access_index.hpp0000664000372100037210000010240112717644140024675 0ustar00fransfrans00000000000000/* Copyright 2003-2013 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_RANDOM_ACCESS_INDEX_HPP #define BOOST_MULTI_INDEX_RANDOM_ACCESS_INDEX_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) #include #endif #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) #include #include #endif #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING) #define BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT_OF(x) \ detail::scope_guard BOOST_JOIN(check_invariant_,__LINE__)= \ detail::make_obj_guard(x,&random_access_index::check_invariant_); \ BOOST_JOIN(check_invariant_,__LINE__).touch(); #define BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT \ BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT_OF(*this) #else #define BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT_OF(x) #define BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT #endif namespace boost{ namespace multi_index{ namespace detail{ /* random_access_index adds a layer of random access indexing * to a given Super */ template class random_access_index: BOOST_MULTI_INDEX_PROTECTED_IF_MEMBER_TEMPLATE_FRIENDS SuperMeta::type #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) #if BOOST_WORKAROUND(BOOST_MSVC,<1300) ,public safe_ctr_proxy_impl< rnd_node_iterator< random_access_index_node >, random_access_index > #else ,public safe_mode::safe_container< random_access_index > #endif #endif { #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING)&&\ BOOST_WORKAROUND(__MWERKS__,<=0x3003) /* The "ISO C++ Template Parser" option in CW8.3 has a problem with the * lifetime of const references bound to temporaries --precisely what * scopeguards are. */ #pragma parse_mfunc_templ off #endif typedef typename SuperMeta::type super; protected: typedef random_access_index_node< typename super::node_type> node_type; private: typedef typename node_type::impl_type node_impl_type; typedef random_access_index_ptr_array< typename super::final_allocator_type> ptr_array; typedef typename ptr_array::pointer node_impl_ptr_pointer; public: /* types */ typedef typename node_type::value_type value_type; typedef tuples::null_type ctor_args; typedef typename super::final_allocator_type allocator_type; typedef typename allocator_type::reference reference; typedef typename allocator_type::const_reference const_reference; #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) #if BOOST_WORKAROUND(BOOST_MSVC,<1300) typedef safe_mode::safe_iterator< rnd_node_iterator, safe_ctr_proxy< rnd_node_iterator > > iterator; #else typedef safe_mode::safe_iterator< rnd_node_iterator, random_access_index> iterator; #endif #else typedef rnd_node_iterator iterator; #endif typedef iterator const_iterator; typedef std::size_t size_type; typedef std::ptrdiff_t difference_type; typedef typename allocator_type::pointer pointer; typedef typename allocator_type::const_pointer const_pointer; typedef typename boost::reverse_iterator reverse_iterator; typedef typename boost::reverse_iterator const_reverse_iterator; typedef TagList tag_list; protected: typedef typename super::final_node_type final_node_type; typedef tuples::cons< ctor_args, typename super::ctor_args_list> ctor_args_list; typedef typename mpl::push_front< typename super::index_type_list, random_access_index>::type index_type_list; typedef typename mpl::push_front< typename super::iterator_type_list, iterator>::type iterator_type_list; typedef typename mpl::push_front< typename super::const_iterator_type_list, const_iterator>::type const_iterator_type_list; typedef typename super::copy_map_type copy_map_type; #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) typedef typename super::index_saver_type index_saver_type; typedef typename super::index_loader_type index_loader_type; #endif private: #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) #if BOOST_WORKAROUND(BOOST_MSVC,<1300) typedef safe_ctr_proxy_impl< rnd_node_iterator, random_access_index> safe_super; #else typedef safe_mode::safe_container< random_access_index> safe_super; #endif #endif typedef typename call_traits< value_type>::param_type value_param_type; /* Needed to avoid commas in BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL * expansion. */ typedef std::pair emplace_return_type; public: /* construct/copy/destroy * Default and copy ctors are in the protected section as indices are * not supposed to be created on their own. No range ctor either. */ random_access_index& operator=( const random_access_index& x) { this->final()=x.final(); return *this; } #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) random_access_index& operator=( std::initializer_list list) { this->final()=list; return *this; } #endif template void assign(InputIterator first,InputIterator last) { assign_iter(first,last,mpl::not_ >()); } #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) void assign(std::initializer_list list) { assign(list.begin(),list.end()); } #endif void assign(size_type n,value_param_type value) { BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; clear(); for(size_type i=0;ifinal().get_allocator(); } /* iterators */ iterator begin() {return make_iterator(node_type::from_impl(*ptrs.begin()));} const_iterator begin()const {return make_iterator(node_type::from_impl(*ptrs.begin()));} iterator end(){return make_iterator(header());} const_iterator end()const{return make_iterator(header());} reverse_iterator rbegin(){return make_reverse_iterator(end());} const_reverse_iterator rbegin()const{return make_reverse_iterator(end());} reverse_iterator rend(){return make_reverse_iterator(begin());} const_reverse_iterator rend()const{return make_reverse_iterator(begin());} const_iterator cbegin()const{return begin();} const_iterator cend()const{return end();} const_reverse_iterator crbegin()const{return rbegin();} const_reverse_iterator crend()const{return rend();} iterator iterator_to(const value_type& x) { return make_iterator(node_from_value(&x)); } const_iterator iterator_to(const value_type& x)const { return make_iterator(node_from_value(&x)); } /* capacity */ bool empty()const{return this->final_empty_();} size_type size()const{return this->final_size_();} size_type max_size()const{return this->final_max_size_();} size_type capacity()const{return ptrs.capacity();} void reserve(size_type n) { BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; ptrs.reserve(n); } void shrink_to_fit() { BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; ptrs.shrink_to_fit(); } void resize(size_type n) { BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; if(n>size()) for(size_type m=n-size();m--;) this->final_emplace_(BOOST_MULTI_INDEX_NULL_PARAM_PACK); else if(nsize())for(size_type m=n-size();m--;)this->final_insert_(x); else if(nvalue(); } const_reference at(size_type n)const { if(n>=size())throw_exception(std::out_of_range("random access index")); return node_type::from_impl(*ptrs.at(n))->value(); } const_reference front()const{return operator[](0);} const_reference back()const{return operator[](size()-1);} /* modifiers */ BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL( emplace_return_type,emplace_front,emplace_front_impl) std::pair push_front(const value_type& x) {return insert(begin(),x);} std::pair push_front(BOOST_RV_REF(value_type) x) {return insert(begin(),boost::move(x));} void pop_front(){erase(begin());} BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL( emplace_return_type,emplace_back,emplace_back_impl) std::pair push_back(const value_type& x) {return insert(end(),x);} std::pair push_back(BOOST_RV_REF(value_type) x) {return insert(end(),boost::move(x));} void pop_back(){erase(--end());} BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL_EXTRA_ARG( emplace_return_type,emplace,emplace_impl,iterator,position) std::pair insert(iterator position,const value_type& x) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; std::pair p=this->final_insert_(x); if(p.second&&position.get_node()!=header()){ relocate(position.get_node(),p.first); } return std::pair(make_iterator(p.first),p.second); } std::pair insert(iterator position,BOOST_RV_REF(value_type) x) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; std::pair p=this->final_insert_rv_(x); if(p.second&&position.get_node()!=header()){ relocate(position.get_node(),p.first); } return std::pair(make_iterator(p.first),p.second); } void insert(iterator position,size_type n,value_param_type x) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; size_type s=0; BOOST_TRY{ while(n--){ if(push_back(x).second)++s; } } BOOST_CATCH(...){ relocate(position,end()-s,end()); BOOST_RETHROW; } BOOST_CATCH_END relocate(position,end()-s,end()); } template void insert(iterator position,InputIterator first,InputIterator last) { insert_iter(position,first,last,mpl::not_ >()); } #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) void insert(iterator position,std::initializer_list list) { insert(position,list.begin(),list.end()); } #endif iterator erase(iterator position) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; this->final_erase_(static_cast(position++.get_node())); return position; } iterator erase(iterator first,iterator last) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(first); BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(last); BOOST_MULTI_INDEX_CHECK_IS_OWNER(first,*this); BOOST_MULTI_INDEX_CHECK_IS_OWNER(last,*this); BOOST_MULTI_INDEX_CHECK_VALID_RANGE(first,last); BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; difference_type n=last-first; relocate(end(),first,last); while(n--)pop_back(); return last; } bool replace(iterator position,const value_type& x) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; return this->final_replace_( x,static_cast(position.get_node())); } bool replace(iterator position,BOOST_RV_REF(value_type) x) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; return this->final_replace_rv_( x,static_cast(position.get_node())); } template bool modify(iterator position,Modifier mod) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) /* MSVC++ 6.0 optimizer on safe mode code chokes if this * this is not added. Left it for all compilers as it does no * harm. */ position.detach(); #endif return this->final_modify_( mod,static_cast(position.get_node())); } template bool modify(iterator position,Modifier mod,Rollback back) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) /* MSVC++ 6.0 optimizer on safe mode code chokes if this * this is not added. Left it for all compilers as it does no * harm. */ position.detach(); #endif return this->final_modify_( mod,back,static_cast(position.get_node())); } void swap(random_access_index& x) { BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT_OF(x); this->final_swap_(x.final()); } void clear() { BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; this->final_clear_(); } /* list operations */ void splice(iterator position,random_access_index& x) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_CHECK_DIFFERENT_CONTAINER(*this,x); BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; iterator first=x.begin(),last=x.end(); size_type n=0; BOOST_TRY{ while(first!=last){ if(push_back(*first).second){ first=x.erase(first); ++n; } else ++first; } } BOOST_CATCH(...){ relocate(position,end()-n,end()); BOOST_RETHROW; } BOOST_CATCH_END relocate(position,end()-n,end()); } void splice( iterator position,random_access_index& x,iterator i) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(i); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(i); BOOST_MULTI_INDEX_CHECK_IS_OWNER(i,x); BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; if(&x==this)relocate(position,i); else{ if(insert(position,*i).second){ #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) /* MSVC++ 6.0 optimizer has a hard time with safe mode, and the following * workaround is needed. Left it for all compilers as it does no * harm. */ i.detach(); x.erase(x.make_iterator(i.get_node())); #else x.erase(i); #endif } } } void splice( iterator position,random_access_index& x, iterator first,iterator last) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(first); BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(last); BOOST_MULTI_INDEX_CHECK_IS_OWNER(first,x); BOOST_MULTI_INDEX_CHECK_IS_OWNER(last,x); BOOST_MULTI_INDEX_CHECK_VALID_RANGE(first,last); BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; if(&x==this)relocate(position,first,last); else{ size_type n=0; BOOST_TRY{ while(first!=last){ if(push_back(*first).second){ first=x.erase(first); ++n; } else ++first; } } BOOST_CATCH(...){ relocate(position,end()-n,end()); BOOST_RETHROW; } BOOST_CATCH_END relocate(position,end()-n,end()); } } void remove(value_param_type value) { BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; difference_type n= end()-make_iterator( random_access_index_remove( ptrs,std::bind2nd(std::equal_to(),value))); while(n--)pop_back(); } template void remove_if(Predicate pred) { BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; difference_type n= end()-make_iterator(random_access_index_remove(ptrs,pred)); while(n--)pop_back(); } void unique() { BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; difference_type n= end()-make_iterator( random_access_index_unique( ptrs,std::equal_to())); while(n--)pop_back(); } template void unique(BinaryPredicate binary_pred) { BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; difference_type n= end()-make_iterator( random_access_index_unique(ptrs,binary_pred)); while(n--)pop_back(); } void merge(random_access_index& x) { if(this!=&x){ BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; size_type s=size(); splice(end(),x); random_access_index_inplace_merge( get_allocator(),ptrs,ptrs.at(s),std::less()); } } template void merge(random_access_index& x,Compare comp) { if(this!=&x){ BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; size_type s=size(); splice(end(),x); random_access_index_inplace_merge( get_allocator(),ptrs,ptrs.at(s),comp); } } void sort() { BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; random_access_index_sort( get_allocator(),ptrs,std::less()); } template void sort(Compare comp) { BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; random_access_index_sort( get_allocator(),ptrs,comp); } void reverse() { BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; node_impl_type::reverse(ptrs.begin(),ptrs.end()); } /* rearrange operations */ void relocate(iterator position,iterator i) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(i); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(i); BOOST_MULTI_INDEX_CHECK_IS_OWNER(i,*this); BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; if(position!=i)relocate(position.get_node(),i.get_node()); } void relocate(iterator position,iterator first,iterator last) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(first); BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(last); BOOST_MULTI_INDEX_CHECK_IS_OWNER(first,*this); BOOST_MULTI_INDEX_CHECK_IS_OWNER(last,*this); BOOST_MULTI_INDEX_CHECK_VALID_RANGE(first,last); BOOST_MULTI_INDEX_CHECK_OUTSIDE_RANGE(position,first,last); BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; if(position!=last)relocate( position.get_node(),first.get_node(),last.get_node()); } template void rearrange(InputIterator first) { BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; for(node_impl_ptr_pointer p0=ptrs.begin(),p0_end=ptrs.end(); p0!=p0_end;++first,++p0){ const value_type& v1=*first; node_impl_ptr_pointer p1=node_from_value(&v1)->up(); std::swap(*p0,*p1); (*p0)->up()=p0; (*p1)->up()=p1; } } BOOST_MULTI_INDEX_PROTECTED_IF_MEMBER_TEMPLATE_FRIENDS: random_access_index( const ctor_args_list& args_list,const allocator_type& al): super(args_list.get_tail(),al), ptrs(al,header()->impl(),0) { } random_access_index(const random_access_index& x): super(x), #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) safe_super(), #endif ptrs(x.get_allocator(),header()->impl(),x.size()) { /* The actual copying takes place in subsequent call to copy_(). */ } random_access_index( const random_access_index& x,do_not_copy_elements_tag): super(x,do_not_copy_elements_tag()), #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) safe_super(), #endif ptrs(x.get_allocator(),header()->impl(),0) { } ~random_access_index() { /* the container is guaranteed to be empty by now */ } #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) iterator make_iterator(node_type* node){return iterator(node,this);} const_iterator make_iterator(node_type* node)const {return const_iterator(node,const_cast(this));} #else iterator make_iterator(node_type* node){return iterator(node);} const_iterator make_iterator(node_type* node)const {return const_iterator(node);} #endif void copy_( const random_access_index& x,const copy_map_type& map) { for(node_impl_ptr_pointer begin_org=x.ptrs.begin(), begin_cpy=ptrs.begin(), end_org=x.ptrs.end(); begin_org!=end_org;++begin_org,++begin_cpy){ *begin_cpy= static_cast( map.find( static_cast( node_type::from_impl(*begin_org))))->impl(); (*begin_cpy)->up()=begin_cpy; } super::copy_(x,map); } template node_type* insert_(value_param_type v,node_type* x,Variant variant) { ptrs.room_for_one(); node_type* res=static_cast(super::insert_(v,x,variant)); if(res==x)ptrs.push_back(x->impl()); return res; } template node_type* insert_( value_param_type v,node_type* position,node_type* x,Variant variant) { ptrs.room_for_one(); node_type* res= static_cast(super::insert_(v,position,x,variant)); if(res==x)ptrs.push_back(x->impl()); return res; } void erase_(node_type* x) { ptrs.erase(x->impl()); super::erase_(x); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) detach_iterators(x); #endif } void delete_all_nodes_() { for(node_impl_ptr_pointer x=ptrs.begin(),x_end=ptrs.end();x!=x_end;++x){ this->final_delete_node_( static_cast(node_type::from_impl(*x))); } } void clear_() { super::clear_(); ptrs.clear(); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) safe_super::detach_dereferenceable_iterators(); #endif } void swap_(random_access_index& x) { ptrs.swap(x.ptrs); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) safe_super::swap(x); #endif super::swap_(x); } void swap_elements_(random_access_index& x) { ptrs.swap(x.ptrs); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) safe_super::swap(x); #endif super::swap_elements_(x); } template bool replace_(value_param_type v,node_type* x,Variant variant) { return super::replace_(v,x,variant); } bool modify_(node_type* x) { BOOST_TRY{ if(!super::modify_(x)){ ptrs.erase(x->impl()); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) detach_iterators(x); #endif return false; } else return true; } BOOST_CATCH(...){ ptrs.erase(x->impl()); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) detach_iterators(x); #endif BOOST_RETHROW; } BOOST_CATCH_END } bool modify_rollback_(node_type* x) { return super::modify_rollback_(x); } #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) /* serialization */ template void save_( Archive& ar,const unsigned int version,const index_saver_type& sm)const { sm.save(begin(),end(),ar,version); super::save_(ar,version,sm); } template void load_( Archive& ar,const unsigned int version,const index_loader_type& lm) { { typedef random_access_index_loader loader; loader ld(get_allocator(),ptrs); lm.load(::boost::bind(&loader::rearrange,&ld,_1,_2),ar,version); } /* exit scope so that ld frees its resources */ super::load_(ar,version,lm); } #endif #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING) /* invariant stuff */ bool invariant_()const { if(size()>capacity())return false; if(size()==0||begin()==end()){ if(size()!=0||begin()!=end())return false; } else{ size_type s=0; for(const_iterator it=begin(),it_end=end();;++it,++s){ if(*(it.get_node()->up())!=it.get_node()->impl())return false; if(it==it_end)break; } if(s!=size())return false; } return super::invariant_(); } /* This forwarding function eases things for the boost::mem_fn construct * in BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT. Actually, * final_check_invariant is already an inherited member function of index. */ void check_invariant_()const{this->final_check_invariant_();} #endif private: node_type* header()const{return this->final_header();} static void relocate(node_type* position,node_type* x) { node_impl_type::relocate(position->up(),x->up()); } static void relocate(node_type* position,node_type* first,node_type* last) { node_impl_type::relocate( position->up(),first->up(),last->up()); } #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) void detach_iterators(node_type* x) { iterator it=make_iterator(x); safe_mode::detach_equivalent_iterators(it); } #endif template void assign_iter(InputIterator first,InputIterator last,mpl::true_) { BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; clear(); for(;first!=last;++first)this->final_insert_ref_(*first); } void assign_iter(size_type n,value_param_type value,mpl::false_) { BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; clear(); for(size_type i=0;i void insert_iter( iterator position,InputIterator first,InputIterator last,mpl::true_) { BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; size_type s=0; BOOST_TRY{ for(;first!=last;++first){ if(this->final_insert_ref_(*first).second)++s; } } BOOST_CATCH(...){ relocate(position,end()-s,end()); BOOST_RETHROW; } BOOST_CATCH_END relocate(position,end()-s,end()); } void insert_iter( iterator position,size_type n,value_param_type x,mpl::false_) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; size_type s=0; BOOST_TRY{ while(n--){ if(push_back(x).second)++s; } } BOOST_CATCH(...){ relocate(position,end()-s,end()); BOOST_RETHROW; } BOOST_CATCH_END relocate(position,end()-s,end()); } template std::pair emplace_front_impl( BOOST_MULTI_INDEX_FUNCTION_PARAM_PACK) { return emplace_impl(begin(),BOOST_MULTI_INDEX_FORWARD_PARAM_PACK); } template std::pair emplace_back_impl( BOOST_MULTI_INDEX_FUNCTION_PARAM_PACK) { return emplace_impl(end(),BOOST_MULTI_INDEX_FORWARD_PARAM_PACK); } template std::pair emplace_impl( iterator position,BOOST_MULTI_INDEX_FUNCTION_PARAM_PACK) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT; std::pair p= this->final_emplace_(BOOST_MULTI_INDEX_FORWARD_PARAM_PACK); if(p.second&&position.get_node()!=header()){ relocate(position.get_node(),p.first); } return std::pair(make_iterator(p.first),p.second); } ptr_array ptrs; #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING)&&\ BOOST_WORKAROUND(__MWERKS__,<=0x3003) #pragma parse_mfunc_templ reset #endif }; /* comparison */ template< typename SuperMeta1,typename TagList1, typename SuperMeta2,typename TagList2 > bool operator==( const random_access_index& x, const random_access_index& y) { return x.size()==y.size()&&std::equal(x.begin(),x.end(),y.begin()); } template< typename SuperMeta1,typename TagList1, typename SuperMeta2,typename TagList2 > bool operator<( const random_access_index& x, const random_access_index& y) { return std::lexicographical_compare(x.begin(),x.end(),y.begin(),y.end()); } template< typename SuperMeta1,typename TagList1, typename SuperMeta2,typename TagList2 > bool operator!=( const random_access_index& x, const random_access_index& y) { return !(x==y); } template< typename SuperMeta1,typename TagList1, typename SuperMeta2,typename TagList2 > bool operator>( const random_access_index& x, const random_access_index& y) { return y bool operator>=( const random_access_index& x, const random_access_index& y) { return !(x bool operator<=( const random_access_index& x, const random_access_index& y) { return !(x>y); } /* specialized algorithms */ template void swap( random_access_index& x, random_access_index& y) { x.swap(y); } } /* namespace multi_index::detail */ /* random access index specifier */ template struct random_access { BOOST_STATIC_ASSERT(detail::is_tag::value); template struct node_class { typedef detail::random_access_index_node type; }; template struct index_class { typedef detail::random_access_index< SuperMeta,typename TagList::type> type; }; }; } /* namespace multi_index */ } /* namespace boost */ /* Boost.Foreach compatibility */ template inline boost::mpl::true_* boost_foreach_is_noncopyable( boost::multi_index::detail::random_access_index*&, boost::foreach::tag) { return 0; } #undef BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT #undef BOOST_MULTI_INDEX_RND_INDEX_CHECK_INVARIANT_OF #endif madp-0.4/src/boost/boost/multi_index/PaxHeaders.5405/ordered_index.hpp0000644000000000000000000000007412717644140022673 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/ordered_index.hpp0000664000372100037210000013135412717644140023531 0ustar00fransfrans00000000000000/* Copyright 2003-2013 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. * * The internal implementation of red-black trees is based on that of SGI STL * stl_tree.h file: * * Copyright (c) 1996,1997 * Silicon Graphics Computer Systems, Inc. * * Permission to use, copy, modify, distribute and sell this software * and its documentation for any purpose is hereby granted without fee, * provided that the above copyright notice appear in all copies and * that both that copyright notice and this permission notice appear * in supporting documentation. Silicon Graphics makes no * representations about the suitability of this software for any * purpose. It is provided "as is" without express or implied warranty. * * * Copyright (c) 1994 * Hewlett-Packard Company * * Permission to use, copy, modify, distribute and sell this software * and its documentation for any purpose is hereby granted without fee, * provided that the above copyright notice appear in all copies and * that both that copyright notice and this permission notice appear * in supporting documentation. Hewlett-Packard Company makes no * representations about the suitability of this software for any * purpose. It is provided "as is" without express or implied warranty. * */ #ifndef BOOST_MULTI_INDEX_ORDERED_INDEX_HPP #define BOOST_MULTI_INDEX_ORDERED_INDEX_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) #include #endif #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) #include #include #include #include #endif #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING) #define BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT_OF(x) \ detail::scope_guard BOOST_JOIN(check_invariant_,__LINE__)= \ detail::make_obj_guard(x,&ordered_index::check_invariant_); \ BOOST_JOIN(check_invariant_,__LINE__).touch(); #define BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT \ BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT_OF(*this) #else #define BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT_OF(x) #define BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT #endif namespace boost{ namespace multi_index{ namespace detail{ /* ordered_index adds a layer of ordered indexing to a given Super */ /* Most of the implementation of unique and non-unique indices is * shared. We tell from one another on instantiation time by using * these tags. */ struct ordered_unique_tag{}; struct ordered_non_unique_tag{}; template< typename KeyFromValue,typename Compare, typename SuperMeta,typename TagList,typename Category > class ordered_index: BOOST_MULTI_INDEX_PROTECTED_IF_MEMBER_TEMPLATE_FRIENDS SuperMeta::type #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) #if BOOST_WORKAROUND(BOOST_MSVC,<1300) ,public safe_ctr_proxy_impl< bidir_node_iterator< ordered_index_node >, ordered_index > #else ,public safe_mode::safe_container< ordered_index > #endif #endif { #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING)&&\ BOOST_WORKAROUND(__MWERKS__,<=0x3003) /* The "ISO C++ Template Parser" option in CW8.3 has a problem with the * lifetime of const references bound to temporaries --precisely what * scopeguards are. */ #pragma parse_mfunc_templ off #endif typedef typename SuperMeta::type super; protected: typedef ordered_index_node< typename super::node_type> node_type; private: typedef typename node_type::impl_type node_impl_type; typedef typename node_impl_type::pointer node_impl_pointer; public: /* types */ typedef typename KeyFromValue::result_type key_type; typedef typename node_type::value_type value_type; typedef KeyFromValue key_from_value; typedef Compare key_compare; typedef value_comparison< value_type,KeyFromValue,Compare> value_compare; typedef tuple ctor_args; typedef typename super::final_allocator_type allocator_type; typedef typename allocator_type::reference reference; typedef typename allocator_type::const_reference const_reference; #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) #if BOOST_WORKAROUND(BOOST_MSVC,<1300) typedef safe_mode::safe_iterator< bidir_node_iterator, safe_ctr_proxy< bidir_node_iterator > > iterator; #else typedef safe_mode::safe_iterator< bidir_node_iterator, ordered_index> iterator; #endif #else typedef bidir_node_iterator iterator; #endif typedef iterator const_iterator; typedef std::size_t size_type; typedef std::ptrdiff_t difference_type; typedef typename allocator_type::pointer pointer; typedef typename allocator_type::const_pointer const_pointer; typedef typename boost::reverse_iterator reverse_iterator; typedef typename boost::reverse_iterator const_reverse_iterator; typedef TagList tag_list; protected: typedef typename super::final_node_type final_node_type; typedef tuples::cons< ctor_args, typename super::ctor_args_list> ctor_args_list; typedef typename mpl::push_front< typename super::index_type_list, ordered_index>::type index_type_list; typedef typename mpl::push_front< typename super::iterator_type_list, iterator>::type iterator_type_list; typedef typename mpl::push_front< typename super::const_iterator_type_list, const_iterator>::type const_iterator_type_list; typedef typename super::copy_map_type copy_map_type; #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) typedef typename super::index_saver_type index_saver_type; typedef typename super::index_loader_type index_loader_type; #endif private: #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) #if BOOST_WORKAROUND(BOOST_MSVC,<1300) typedef safe_ctr_proxy_impl< bidir_node_iterator, ordered_index> safe_super; #else typedef safe_mode::safe_container safe_super; #endif #endif typedef typename call_traits< value_type>::param_type value_param_type; typedef typename call_traits< key_type>::param_type key_param_type; /* Needed to avoid commas in BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL * expansion. */ typedef std::pair emplace_return_type; public: /* construct/copy/destroy * Default and copy ctors are in the protected section as indices are * not supposed to be created on their own. No range ctor either. */ ordered_index& operator=( const ordered_index& x) { this->final()=x.final(); return *this; } #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) ordered_index& operator=( std::initializer_list list) { this->final()=list; return *this; } #endif allocator_type get_allocator()const { return this->final().get_allocator(); } /* iterators */ iterator begin(){return make_iterator(leftmost());} const_iterator begin()const{return make_iterator(leftmost());} iterator end(){return make_iterator(header());} const_iterator end()const{return make_iterator(header());} reverse_iterator rbegin(){return make_reverse_iterator(end());} const_reverse_iterator rbegin()const{return make_reverse_iterator(end());} reverse_iterator rend(){return make_reverse_iterator(begin());} const_reverse_iterator rend()const{return make_reverse_iterator(begin());} const_iterator cbegin()const{return begin();} const_iterator cend()const{return end();} const_reverse_iterator crbegin()const{return rbegin();} const_reverse_iterator crend()const{return rend();} iterator iterator_to(const value_type& x) { return make_iterator(node_from_value(&x)); } const_iterator iterator_to(const value_type& x)const { return make_iterator(node_from_value(&x)); } /* capacity */ bool empty()const{return this->final_empty_();} size_type size()const{return this->final_size_();} size_type max_size()const{return this->final_max_size_();} /* modifiers */ BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL( emplace_return_type,emplace,emplace_impl) BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL_EXTRA_ARG( iterator,emplace_hint,emplace_hint_impl,iterator,position) std::pair insert(const value_type& x) { BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; std::pair p=this->final_insert_(x); return std::pair(make_iterator(p.first),p.second); } std::pair insert(BOOST_RV_REF(value_type) x) { BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; std::pair p=this->final_insert_rv_(x); return std::pair(make_iterator(p.first),p.second); } iterator insert(iterator position,const value_type& x) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; std::pair p=this->final_insert_( x,static_cast(position.get_node())); return make_iterator(p.first); } iterator insert(iterator position,BOOST_RV_REF(value_type) x) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; std::pair p=this->final_insert_rv_( x,static_cast(position.get_node())); return make_iterator(p.first); } template void insert(InputIterator first,InputIterator last) { BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; node_type* hint=header(); /* end() */ for(;first!=last;++first){ hint=this->final_insert_ref_( *first,static_cast(hint)).first; node_type::increment(hint); } } #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) void insert(std::initializer_list list) { insert(list.begin(),list.end()); } #endif iterator erase(iterator position) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; this->final_erase_(static_cast(position++.get_node())); return position; } size_type erase(key_param_type x) { BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; std::pair p=equal_range(x); size_type s=0; while(p.first!=p.second){ p.first=erase(p.first); ++s; } return s; } iterator erase(iterator first,iterator last) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(first); BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(last); BOOST_MULTI_INDEX_CHECK_IS_OWNER(first,*this); BOOST_MULTI_INDEX_CHECK_IS_OWNER(last,*this); BOOST_MULTI_INDEX_CHECK_VALID_RANGE(first,last); BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; while(first!=last){ first=erase(first); } return first; } bool replace(iterator position,const value_type& x) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; return this->final_replace_( x,static_cast(position.get_node())); } bool replace(iterator position,BOOST_RV_REF(value_type) x) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; return this->final_replace_rv_( x,static_cast(position.get_node())); } template bool modify(iterator position,Modifier mod) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) /* MSVC++ 6.0 optimizer on safe mode code chokes if this * this is not added. Left it for all compilers as it does no * harm. */ position.detach(); #endif return this->final_modify_( mod,static_cast(position.get_node())); } template bool modify(iterator position,Modifier mod,Rollback back) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) /* MSVC++ 6.0 optimizer on safe mode code chokes if this * this is not added. Left it for all compilers as it does no * harm. */ position.detach(); #endif return this->final_modify_( mod,back,static_cast(position.get_node())); } template bool modify_key(iterator position,Modifier mod) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; return modify( position,modify_key_adaptor(mod,key)); } template bool modify_key(iterator position,Modifier mod,Rollback back) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; return modify( position, modify_key_adaptor(mod,key), modify_key_adaptor(back,key)); } void swap(ordered_index& x) { BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT_OF(x); this->final_swap_(x.final()); } void clear() { BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; this->final_clear_(); } /* observers */ key_from_value key_extractor()const{return key;} key_compare key_comp()const{return comp_;} value_compare value_comp()const{return value_compare(key,comp_);} /* set operations */ /* Internally, these ops rely on const_iterator being the same * type as iterator. */ template iterator find(const CompatibleKey& x)const { return make_iterator(ordered_index_find(root(),header(),key,x,comp_)); } template iterator find( const CompatibleKey& x,const CompatibleCompare& comp)const { return make_iterator(ordered_index_find(root(),header(),key,x,comp)); } template size_type count(const CompatibleKey& x)const { return count(x,comp_); } template size_type count(const CompatibleKey& x,const CompatibleCompare& comp)const { std::pair p=equal_range(x,comp); size_type n=std::distance(p.first,p.second); return n; } template iterator lower_bound(const CompatibleKey& x)const { return make_iterator( ordered_index_lower_bound(root(),header(),key,x,comp_)); } template iterator lower_bound( const CompatibleKey& x,const CompatibleCompare& comp)const { return make_iterator( ordered_index_lower_bound(root(),header(),key,x,comp)); } template iterator upper_bound(const CompatibleKey& x)const { return make_iterator( ordered_index_upper_bound(root(),header(),key,x,comp_)); } template iterator upper_bound( const CompatibleKey& x,const CompatibleCompare& comp)const { return make_iterator( ordered_index_upper_bound(root(),header(),key,x,comp)); } template std::pair equal_range( const CompatibleKey& x)const { std::pair p= ordered_index_equal_range(root(),header(),key,x,comp_); return std::pair( make_iterator(p.first),make_iterator(p.second)); } template std::pair equal_range( const CompatibleKey& x,const CompatibleCompare& comp)const { std::pair p= ordered_index_equal_range(root(),header(),key,x,comp); return std::pair( make_iterator(p.first),make_iterator(p.second)); } /* range */ template std::pair range(LowerBounder lower,UpperBounder upper)const { typedef typename mpl::if_< is_same, BOOST_DEDUCED_TYPENAME mpl::if_< is_same, both_unbounded_tag, lower_unbounded_tag >::type, BOOST_DEDUCED_TYPENAME mpl::if_< is_same, upper_unbounded_tag, none_unbounded_tag >::type >::type dispatch; return range(lower,upper,dispatch()); } BOOST_MULTI_INDEX_PROTECTED_IF_MEMBER_TEMPLATE_FRIENDS: ordered_index(const ctor_args_list& args_list,const allocator_type& al): super(args_list.get_tail(),al), key(tuples::get<0>(args_list.get_head())), comp_(tuples::get<1>(args_list.get_head())) { empty_initialize(); } ordered_index( const ordered_index& x): super(x), #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) safe_super(), #endif key(x.key), comp_(x.comp_) { /* Copy ctor just takes the key and compare objects from x. The rest is * done in a subsequent call to copy_(). */ } ordered_index( const ordered_index& x, do_not_copy_elements_tag): super(x,do_not_copy_elements_tag()), #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) safe_super(), #endif key(x.key), comp_(x.comp_) { empty_initialize(); } ~ordered_index() { /* the container is guaranteed to be empty by now */ } #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) iterator make_iterator(node_type* node){return iterator(node,this);} const_iterator make_iterator(node_type* node)const {return const_iterator(node,const_cast(this));} #else iterator make_iterator(node_type* node){return iterator(node);} const_iterator make_iterator(node_type* node)const {return const_iterator(node);} #endif void copy_( const ordered_index& x, const copy_map_type& map) { if(!x.root()){ empty_initialize(); } else{ header()->color()=x.header()->color(); node_type* root_cpy=map.find(static_cast(x.root())); header()->parent()=root_cpy->impl(); node_type* leftmost_cpy=map.find( static_cast(x.leftmost())); header()->left()=leftmost_cpy->impl(); node_type* rightmost_cpy=map.find( static_cast(x.rightmost())); header()->right()=rightmost_cpy->impl(); typedef typename copy_map_type::const_iterator copy_map_iterator; for(copy_map_iterator it=map.begin(),it_end=map.end();it!=it_end;++it){ node_type* org=it->first; node_type* cpy=it->second; cpy->color()=org->color(); node_impl_pointer parent_org=org->parent(); if(parent_org==node_impl_pointer(0))cpy->parent()=node_impl_pointer(0); else{ node_type* parent_cpy=map.find( static_cast(node_type::from_impl(parent_org))); cpy->parent()=parent_cpy->impl(); if(parent_org->left()==org->impl()){ parent_cpy->left()=cpy->impl(); } else if(parent_org->right()==org->impl()){ /* header() does not satisfy this nor the previous check */ parent_cpy->right()=cpy->impl(); } } if(org->left()==node_impl_pointer(0)) cpy->left()=node_impl_pointer(0); if(org->right()==node_impl_pointer(0)) cpy->right()=node_impl_pointer(0); } } super::copy_(x,map); } template node_type* insert_(value_param_type v,node_type* x,Variant variant) { link_info inf; if(!link_point(key(v),inf,Category())){ return node_type::from_impl(inf.pos); } node_type* res=static_cast(super::insert_(v,x,variant)); if(res==x){ node_impl_type::link(x->impl(),inf.side,inf.pos,header()->impl()); } return res; } template node_type* insert_( value_param_type v,node_type* position,node_type* x,Variant variant) { link_info inf; if(!hinted_link_point(key(v),position,inf,Category())){ return node_type::from_impl(inf.pos); } node_type* res=static_cast(super::insert_(v,position,x,variant)); if(res==x){ node_impl_type::link(x->impl(),inf.side,inf.pos,header()->impl()); } return res; } void erase_(node_type* x) { node_impl_type::rebalance_for_erase( x->impl(),header()->parent(),header()->left(),header()->right()); super::erase_(x); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) detach_iterators(x); #endif } void delete_all_nodes_() { delete_all_nodes(root()); } void clear_() { super::clear_(); empty_initialize(); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) safe_super::detach_dereferenceable_iterators(); #endif } void swap_(ordered_index& x) { std::swap(key,x.key); std::swap(comp_,x.comp_); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) safe_super::swap(x); #endif super::swap_(x); } void swap_elements_( ordered_index& x) { #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) safe_super::swap(x); #endif super::swap_elements_(x); } template bool replace_(value_param_type v,node_type* x,Variant variant) { if(in_place(v,x,Category())){ return super::replace_(v,x,variant); } node_type* next=x; node_type::increment(next); node_impl_type::rebalance_for_erase( x->impl(),header()->parent(),header()->left(),header()->right()); BOOST_TRY{ link_info inf; if(link_point(key(v),inf,Category())&&super::replace_(v,x,variant)){ node_impl_type::link(x->impl(),inf.side,inf.pos,header()->impl()); return true; } node_impl_type::restore(x->impl(),next->impl(),header()->impl()); return false; } BOOST_CATCH(...){ node_impl_type::restore(x->impl(),next->impl(),header()->impl()); BOOST_RETHROW; } BOOST_CATCH_END } bool modify_(node_type* x) { bool b; BOOST_TRY{ b=in_place(x->value(),x,Category()); } BOOST_CATCH(...){ erase_(x); BOOST_RETHROW; } BOOST_CATCH_END if(!b){ node_impl_type::rebalance_for_erase( x->impl(),header()->parent(),header()->left(),header()->right()); BOOST_TRY{ link_info inf; if(!link_point(key(x->value()),inf,Category())){ super::erase_(x); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) detach_iterators(x); #endif return false; } node_impl_type::link(x->impl(),inf.side,inf.pos,header()->impl()); } BOOST_CATCH(...){ super::erase_(x); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) detach_iterators(x); #endif BOOST_RETHROW; } BOOST_CATCH_END } BOOST_TRY{ if(!super::modify_(x)){ node_impl_type::rebalance_for_erase( x->impl(),header()->parent(),header()->left(),header()->right()); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) detach_iterators(x); #endif return false; } else return true; } BOOST_CATCH(...){ node_impl_type::rebalance_for_erase( x->impl(),header()->parent(),header()->left(),header()->right()); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) detach_iterators(x); #endif BOOST_RETHROW; } BOOST_CATCH_END } bool modify_rollback_(node_type* x) { if(in_place(x->value(),x,Category())){ return super::modify_rollback_(x); } node_type* next=x; node_type::increment(next); node_impl_type::rebalance_for_erase( x->impl(),header()->parent(),header()->left(),header()->right()); BOOST_TRY{ link_info inf; if(link_point(key(x->value()),inf,Category())&& super::modify_rollback_(x)){ node_impl_type::link(x->impl(),inf.side,inf.pos,header()->impl()); return true; } node_impl_type::restore(x->impl(),next->impl(),header()->impl()); return false; } BOOST_CATCH(...){ node_impl_type::restore(x->impl(),next->impl(),header()->impl()); BOOST_RETHROW; } BOOST_CATCH_END } #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) /* serialization */ template void save_( Archive& ar,const unsigned int version,const index_saver_type& sm)const { save_(ar,version,sm,Category()); } template void load_(Archive& ar,const unsigned int version,const index_loader_type& lm) { load_(ar,version,lm,Category()); } #endif #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING) /* invariant stuff */ bool invariant_()const { if(size()==0||begin()==end()){ if(size()!=0||begin()!=end()|| header()->left()!=header()->impl()|| header()->right()!=header()->impl())return false; } else{ if((size_type)std::distance(begin(),end())!=size())return false; std::size_t len=node_impl_type::black_count( leftmost()->impl(),root()->impl()); for(const_iterator it=begin(),it_end=end();it!=it_end;++it){ node_type* x=it.get_node(); node_type* left_x=node_type::from_impl(x->left()); node_type* right_x=node_type::from_impl(x->right()); if(x->color()==red){ if((left_x&&left_x->color()==red)|| (right_x&&right_x->color()==red))return false; } if(left_x&&comp_(key(x->value()),key(left_x->value())))return false; if(right_x&&comp_(key(right_x->value()),key(x->value())))return false; if(!left_x&&!right_x&& node_impl_type::black_count(x->impl(),root()->impl())!=len) return false; } if(leftmost()->impl()!=node_impl_type::minimum(root()->impl())) return false; if(rightmost()->impl()!=node_impl_type::maximum(root()->impl())) return false; } return super::invariant_(); } /* This forwarding function eases things for the boost::mem_fn construct * in BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT. Actually, * final_check_invariant is already an inherited member function of * ordered_index. */ void check_invariant_()const{this->final_check_invariant_();} #endif private: node_type* header()const{return this->final_header();} node_type* root()const{return node_type::from_impl(header()->parent());} node_type* leftmost()const{return node_type::from_impl(header()->left());} node_type* rightmost()const{return node_type::from_impl(header()->right());} void empty_initialize() { header()->color()=red; /* used to distinguish header() from root, in iterator.operator++ */ header()->parent()=node_impl_pointer(0); header()->left()=header()->impl(); header()->right()=header()->impl(); } struct link_info { link_info():side(to_left){} ordered_index_side side; node_impl_pointer pos; }; bool link_point(key_param_type k,link_info& inf,ordered_unique_tag) { node_type* y=header(); node_type* x=root(); bool c=true; while(x){ y=x; c=comp_(k,key(x->value())); x=node_type::from_impl(c?x->left():x->right()); } node_type* yy=y; if(c){ if(yy==leftmost()){ inf.side=to_left; inf.pos=y->impl(); return true; } else node_type::decrement(yy); } if(comp_(key(yy->value()),k)){ inf.side=c?to_left:to_right; inf.pos=y->impl(); return true; } else{ inf.pos=yy->impl(); return false; } } bool link_point(key_param_type k,link_info& inf,ordered_non_unique_tag) { node_type* y=header(); node_type* x=root(); bool c=true; while (x){ y=x; c=comp_(k,key(x->value())); x=node_type::from_impl(c?x->left():x->right()); } inf.side=c?to_left:to_right; inf.pos=y->impl(); return true; } bool lower_link_point(key_param_type k,link_info& inf,ordered_non_unique_tag) { node_type* y=header(); node_type* x=root(); bool c=false; while (x){ y=x; c=comp_(key(x->value()),k); x=node_type::from_impl(c?x->right():x->left()); } inf.side=c?to_right:to_left; inf.pos=y->impl(); return true; } bool hinted_link_point( key_param_type k,node_type* position,link_info& inf,ordered_unique_tag) { if(position->impl()==header()->left()){ if(size()>0&&comp_(k,key(position->value()))){ inf.side=to_left; inf.pos=position->impl(); return true; } else return link_point(k,inf,ordered_unique_tag()); } else if(position==header()){ if(comp_(key(rightmost()->value()),k)){ inf.side=to_right; inf.pos=rightmost()->impl(); return true; } else return link_point(k,inf,ordered_unique_tag()); } else{ node_type* before=position; node_type::decrement(before); if(comp_(key(before->value()),k)&&comp_(k,key(position->value()))){ if(before->right()==node_impl_pointer(0)){ inf.side=to_right; inf.pos=before->impl(); return true; } else{ inf.side=to_left; inf.pos=position->impl(); return true; } } else return link_point(k,inf,ordered_unique_tag()); } } bool hinted_link_point( key_param_type k,node_type* position,link_info& inf,ordered_non_unique_tag) { if(position->impl()==header()->left()){ if(size()>0&&!comp_(key(position->value()),k)){ inf.side=to_left; inf.pos=position->impl(); return true; } else return lower_link_point(k,inf,ordered_non_unique_tag()); } else if(position==header()){ if(!comp_(k,key(rightmost()->value()))){ inf.side=to_right; inf.pos=rightmost()->impl(); return true; } else return link_point(k,inf,ordered_non_unique_tag()); } else{ node_type* before=position; node_type::decrement(before); if(!comp_(k,key(before->value()))){ if(!comp_(key(position->value()),k)){ if(before->right()==node_impl_pointer(0)){ inf.side=to_right; inf.pos=before->impl(); return true; } else{ inf.side=to_left; inf.pos=position->impl(); return true; } } else return lower_link_point(k,inf,ordered_non_unique_tag()); } else return link_point(k,inf,ordered_non_unique_tag()); } } void delete_all_nodes(node_type* x) { if(!x)return; delete_all_nodes(node_type::from_impl(x->left())); delete_all_nodes(node_type::from_impl(x->right())); this->final_delete_node_(static_cast(x)); } bool in_place(value_param_type v,node_type* x,ordered_unique_tag) { node_type* y; if(x!=leftmost()){ y=x; node_type::decrement(y); if(!comp_(key(y->value()),key(v)))return false; } y=x; node_type::increment(y); return y==header()||comp_(key(v),key(y->value())); } bool in_place(value_param_type v,node_type* x,ordered_non_unique_tag) { node_type* y; if(x!=leftmost()){ y=x; node_type::decrement(y); if(comp_(key(v),key(y->value())))return false; } y=x; node_type::increment(y); return y==header()||!comp_(key(y->value()),key(v)); } #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) void detach_iterators(node_type* x) { iterator it=make_iterator(x); safe_mode::detach_equivalent_iterators(it); } #endif template std::pair emplace_impl(BOOST_MULTI_INDEX_FUNCTION_PARAM_PACK) { BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; std::pairp= this->final_emplace_(BOOST_MULTI_INDEX_FORWARD_PARAM_PACK); return std::pair(make_iterator(p.first),p.second); } template iterator emplace_hint_impl( iterator position,BOOST_MULTI_INDEX_FUNCTION_PARAM_PACK) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT; std::pairp= this->final_emplace_hint_( static_cast(position.get_node()), BOOST_MULTI_INDEX_FORWARD_PARAM_PACK); return make_iterator(p.first); } template std::pair range(LowerBounder lower,UpperBounder upper,none_unbounded_tag)const { node_type* y=header(); node_type* z=root(); while(z){ if(!lower(key(z->value()))){ z=node_type::from_impl(z->right()); } else if(!upper(key(z->value()))){ y=z; z=node_type::from_impl(z->left()); } else{ return std::pair( make_iterator( lower_range(node_type::from_impl(z->left()),z,lower)), make_iterator( upper_range(node_type::from_impl(z->right()),y,upper))); } } return std::pair(make_iterator(y),make_iterator(y)); } template std::pair range(LowerBounder,UpperBounder upper,lower_unbounded_tag)const { return std::pair( begin(), make_iterator(upper_range(root(),header(),upper))); } template std::pair range(LowerBounder lower,UpperBounder,upper_unbounded_tag)const { return std::pair( make_iterator(lower_range(root(),header(),lower)), end()); } template std::pair range(LowerBounder,UpperBounder,both_unbounded_tag)const { return std::pair(begin(),end()); } template node_type * lower_range(node_type* top,node_type* y,LowerBounder lower)const { while(top){ if(lower(key(top->value()))){ y=top; top=node_type::from_impl(top->left()); } else top=node_type::from_impl(top->right()); } return y; } template node_type * upper_range(node_type* top,node_type* y,UpperBounder upper)const { while(top){ if(!upper(key(top->value()))){ y=top; top=node_type::from_impl(top->left()); } else top=node_type::from_impl(top->right()); } return y; } #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) template void save_( Archive& ar,const unsigned int version,const index_saver_type& sm, ordered_unique_tag)const { super::save_(ar,version,sm); } template void load_( Archive& ar,const unsigned int version,const index_loader_type& lm, ordered_unique_tag) { super::load_(ar,version,lm); } template void save_( Archive& ar,const unsigned int version,const index_saver_type& sm, ordered_non_unique_tag)const { typedef duplicates_iterator dup_iterator; sm.save( dup_iterator(begin().get_node(),end().get_node(),value_comp()), dup_iterator(end().get_node(),value_comp()), ar,version); super::save_(ar,version,sm); } template void load_( Archive& ar,const unsigned int version,const index_loader_type& lm, ordered_non_unique_tag) { lm.load( ::boost::bind(&ordered_index::rearranger,this,_1,_2), ar,version); super::load_(ar,version,lm); } void rearranger(node_type* position,node_type *x) { if(!position||comp_(key(position->value()),key(x->value()))){ position=lower_bound(key(x->value())).get_node(); } else if(comp_(key(x->value()),key(position->value()))){ /* inconsistent rearrangement */ throw_exception( archive::archive_exception( archive::archive_exception::other_exception)); } else node_type::increment(position); if(position!=x){ node_impl_type::rebalance_for_erase( x->impl(),header()->parent(),header()->left(),header()->right()); node_impl_type::restore( x->impl(),position->impl(),header()->impl()); } } #endif /* serialization */ key_from_value key; key_compare comp_; #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING)&&\ BOOST_WORKAROUND(__MWERKS__,<=0x3003) #pragma parse_mfunc_templ reset #endif }; /* comparison */ template< typename KeyFromValue1,typename Compare1, typename SuperMeta1,typename TagList1,typename Category1, typename KeyFromValue2,typename Compare2, typename SuperMeta2,typename TagList2,typename Category2 > bool operator==( const ordered_index& x, const ordered_index& y) { return x.size()==y.size()&&std::equal(x.begin(),x.end(),y.begin()); } template< typename KeyFromValue1,typename Compare1, typename SuperMeta1,typename TagList1,typename Category1, typename KeyFromValue2,typename Compare2, typename SuperMeta2,typename TagList2,typename Category2 > bool operator<( const ordered_index& x, const ordered_index& y) { return std::lexicographical_compare(x.begin(),x.end(),y.begin(),y.end()); } template< typename KeyFromValue1,typename Compare1, typename SuperMeta1,typename TagList1,typename Category1, typename KeyFromValue2,typename Compare2, typename SuperMeta2,typename TagList2,typename Category2 > bool operator!=( const ordered_index& x, const ordered_index& y) { return !(x==y); } template< typename KeyFromValue1,typename Compare1, typename SuperMeta1,typename TagList1,typename Category1, typename KeyFromValue2,typename Compare2, typename SuperMeta2,typename TagList2,typename Category2 > bool operator>( const ordered_index& x, const ordered_index& y) { return y bool operator>=( const ordered_index& x, const ordered_index& y) { return !(x bool operator<=( const ordered_index& x, const ordered_index& y) { return !(x>y); } /* specialized algorithms */ template< typename KeyFromValue,typename Compare, typename SuperMeta,typename TagList,typename Category > void swap( ordered_index& x, ordered_index& y) { x.swap(y); } } /* namespace multi_index::detail */ /* ordered_index specifiers */ template struct ordered_unique { typedef typename detail::ordered_index_args< Arg1,Arg2,Arg3> index_args; typedef typename index_args::tag_list_type::type tag_list_type; typedef typename index_args::key_from_value_type key_from_value_type; typedef typename index_args::compare_type compare_type; template struct node_class { typedef detail::ordered_index_node type; }; template struct index_class { typedef detail::ordered_index< key_from_value_type,compare_type, SuperMeta,tag_list_type,detail::ordered_unique_tag> type; }; }; template struct ordered_non_unique { typedef detail::ordered_index_args< Arg1,Arg2,Arg3> index_args; typedef typename index_args::tag_list_type::type tag_list_type; typedef typename index_args::key_from_value_type key_from_value_type; typedef typename index_args::compare_type compare_type; template struct node_class { typedef detail::ordered_index_node type; }; template struct index_class { typedef detail::ordered_index< key_from_value_type,compare_type, SuperMeta,tag_list_type,detail::ordered_non_unique_tag> type; }; }; } /* namespace multi_index */ } /* namespace boost */ /* Boost.Foreach compatibility */ template< typename KeyFromValue,typename Compare, typename SuperMeta,typename TagList,typename Category > inline boost::mpl::true_* boost_foreach_is_noncopyable( boost::multi_index::detail::ordered_index< KeyFromValue,Compare,SuperMeta,TagList,Category>*&, boost::foreach::tag) { return 0; } #undef BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT #undef BOOST_MULTI_INDEX_ORD_INDEX_CHECK_INVARIANT_OF #endif madp-0.4/src/boost/boost/multi_index/PaxHeaders.5405/hashed_index.hpp0000644000000000000000000000007412717644140022503 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/hashed_index.hpp0000664000372100037210000011466512717644140023347 0ustar00fransfrans00000000000000/* Copyright 2003-2013 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_HASHED_INDEX_HPP #define BOOST_MULTI_INDEX_HASHED_INDEX_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) #include #endif #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) #include #endif #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING) #define BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT_OF(x) \ detail::scope_guard BOOST_JOIN(check_invariant_,__LINE__)= \ detail::make_obj_guard(x,&hashed_index::check_invariant_); \ BOOST_JOIN(check_invariant_,__LINE__).touch(); #define BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT \ BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT_OF(*this) #else #define BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT_OF(x) #define BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT #endif namespace boost{ namespace multi_index{ namespace detail{ /* hashed_index adds a layer of hashed indexing to a given Super */ /* Most of the implementation of unique and non-unique indices is * shared. We tell from one another on instantiation time by using * these tags. */ struct hashed_unique_tag{}; struct hashed_non_unique_tag{}; template< typename KeyFromValue,typename Hash,typename Pred, typename SuperMeta,typename TagList,typename Category > class hashed_index: BOOST_MULTI_INDEX_PROTECTED_IF_MEMBER_TEMPLATE_FRIENDS SuperMeta::type #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) #if BOOST_WORKAROUND(BOOST_MSVC,<1300) ,public safe_ctr_proxy_impl< hashed_index_iterator< hashed_index_node, bucket_array >, hashed_index > #else ,public safe_mode::safe_container< hashed_index > #endif #endif { #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING)&&\ BOOST_WORKAROUND(__MWERKS__,<=0x3003) /* The "ISO C++ Template Parser" option in CW8.3 has a problem with the * lifetime of const references bound to temporaries --precisely what * scopeguards are. */ #pragma parse_mfunc_templ off #endif typedef typename SuperMeta::type super; protected: typedef hashed_index_node< typename super::node_type> node_type; private: typedef typename node_type::impl_type node_impl_type; typedef typename node_impl_type::pointer node_impl_pointer; typedef bucket_array< typename super::final_allocator_type> bucket_array_type; public: /* types */ typedef typename KeyFromValue::result_type key_type; typedef typename node_type::value_type value_type; typedef KeyFromValue key_from_value; typedef Hash hasher; typedef Pred key_equal; typedef tuple ctor_args; typedef typename super::final_allocator_type allocator_type; typedef typename allocator_type::pointer pointer; typedef typename allocator_type::const_pointer const_pointer; typedef typename allocator_type::reference reference; typedef typename allocator_type::const_reference const_reference; typedef std::size_t size_type; typedef std::ptrdiff_t difference_type; #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) #if BOOST_WORKAROUND(BOOST_MSVC,<1300) typedef safe_mode::safe_iterator< hashed_index_iterator< node_type,bucket_array_type>, safe_ctr_proxy< hashed_index_iterator< node_type,bucket_array_type> > > iterator; #else typedef safe_mode::safe_iterator< hashed_index_iterator< node_type,bucket_array_type>, hashed_index> iterator; #endif #else typedef hashed_index_iterator< node_type,bucket_array_type> iterator; #endif typedef iterator const_iterator; typedef iterator local_iterator; typedef const_iterator const_local_iterator; typedef TagList tag_list; protected: typedef typename super::final_node_type final_node_type; typedef tuples::cons< ctor_args, typename super::ctor_args_list> ctor_args_list; typedef typename mpl::push_front< typename super::index_type_list, hashed_index>::type index_type_list; typedef typename mpl::push_front< typename super::iterator_type_list, iterator>::type iterator_type_list; typedef typename mpl::push_front< typename super::const_iterator_type_list, const_iterator>::type const_iterator_type_list; typedef typename super::copy_map_type copy_map_type; #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) typedef typename super::index_saver_type index_saver_type; typedef typename super::index_loader_type index_loader_type; #endif private: #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) #if BOOST_WORKAROUND(BOOST_MSVC,<1300) typedef safe_ctr_proxy_impl< hashed_index_iterator< node_type,bucket_array_type>, hashed_index> safe_super; #else typedef safe_mode::safe_container< hashed_index> safe_super; #endif #endif typedef typename call_traits::param_type value_param_type; typedef typename call_traits< key_type>::param_type key_param_type; /* Needed to avoid commas in BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL * expansion. */ typedef std::pair emplace_return_type; public: /* construct/destroy/copy * Default and copy ctors are in the protected section as indices are * not supposed to be created on their own. No range ctor either. */ hashed_index& operator=( const hashed_index& x) { this->final()=x.final(); return *this; } #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) hashed_index& operator=( std::initializer_list list) { this->final()=list; return *this; } #endif allocator_type get_allocator()const { return this->final().get_allocator(); } /* size and capacity */ bool empty()const{return this->final_empty_();} size_type size()const{return this->final_size_();} size_type max_size()const{return this->final_max_size_();} /* iterators */ iterator begin() { return make_iterator( node_type::from_impl(buckets.at(first_bucket)->next())); } const_iterator begin()const { return make_iterator( node_type::from_impl(buckets.at(first_bucket)->next())); } iterator end(){return make_iterator(header());} const_iterator end()const{return make_iterator(header());} const_iterator cbegin()const{return begin();} const_iterator cend()const{return end();} iterator iterator_to(const value_type& x) { return make_iterator(node_from_value(&x)); } const_iterator iterator_to(const value_type& x)const { return make_iterator(node_from_value(&x)); } /* modifiers */ BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL( emplace_return_type,emplace,emplace_impl) BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL_EXTRA_ARG( iterator,emplace_hint,emplace_hint_impl,iterator,position) std::pair insert(const value_type& x) { BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT; std::pair p=this->final_insert_(x); return std::pair(make_iterator(p.first),p.second); } std::pair insert(BOOST_RV_REF(value_type) x) { BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT; std::pair p=this->final_insert_rv_(x); return std::pair(make_iterator(p.first),p.second); } iterator insert(iterator position,const value_type& x) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT; std::pair p=this->final_insert_( x,static_cast(position.get_node())); return make_iterator(p.first); } iterator insert(iterator position,BOOST_RV_REF(value_type) x) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT; std::pair p=this->final_insert_rv_( x,static_cast(position.get_node())); return make_iterator(p.first); } template void insert(InputIterator first,InputIterator last) { BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT; for(;first!=last;++first)this->final_insert_ref_(*first); } #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) void insert(std::initializer_list list) { insert(list.begin(),list.end()); } #endif iterator erase(iterator position) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT; this->final_erase_(static_cast(position++.get_node())); return position; } size_type erase(key_param_type k) { BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT; size_type s=0; std::size_t buc=buckets.position(hash_(k)); node_impl_pointer x=buckets.at(buc); node_impl_pointer y=x->next(); while(y!=x){ if(eq_(k,key(node_type::from_impl(y)->value()))){ bool b; do{ node_impl_pointer z=y->next(); b=z!=x&&eq_( key(node_type::from_impl(y)->value()), key(node_type::from_impl(z)->value())); this->final_erase_( static_cast(node_type::from_impl(y))); y=z; ++s; }while(b); break; } y=y->next(); } return s; } iterator erase(iterator first,iterator last) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(first); BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(last); BOOST_MULTI_INDEX_CHECK_IS_OWNER(first,*this); BOOST_MULTI_INDEX_CHECK_IS_OWNER(last,*this); BOOST_MULTI_INDEX_CHECK_VALID_RANGE(first,last); BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT; while(first!=last){ first=erase(first); } return first; } bool replace(iterator position,const value_type& x) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT; return this->final_replace_( x,static_cast(position.get_node())); } bool replace(iterator position,BOOST_RV_REF(value_type) x) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT; return this->final_replace_rv_( x,static_cast(position.get_node())); } template bool modify(iterator position,Modifier mod) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT; #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) /* MSVC++ 6.0 optimizer on safe mode code chokes if this * this is not added. Left it for all compilers as it does no * harm. */ position.detach(); #endif return this->final_modify_( mod,static_cast(position.get_node())); } template bool modify(iterator position,Modifier mod,Rollback back) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT; #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) /* MSVC++ 6.0 optimizer on safe mode code chokes if this * this is not added. Left it for all compilers as it does no * harm. */ position.detach(); #endif return this->final_modify_( mod,back,static_cast(position.get_node())); } template bool modify_key(iterator position,Modifier mod) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT; return modify( position,modify_key_adaptor(mod,key)); } template bool modify_key(iterator position,Modifier mod,Rollback back) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT; return modify( position, modify_key_adaptor(mod,key), modify_key_adaptor(back,key)); } void clear() { BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT; this->final_clear_(); } void swap(hashed_index& x) { BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT; BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT_OF(x); this->final_swap_(x.final()); } /* observers */ key_from_value key_extractor()const{return key;} hasher hash_function()const{return hash_;} key_equal key_eq()const{return eq_;} /* lookup */ /* Internally, these ops rely on const_iterator being the same * type as iterator. */ template iterator find(const CompatibleKey& k)const { return find(k,hash_,eq_); } template< typename CompatibleKey,typename CompatibleHash,typename CompatiblePred > iterator find( const CompatibleKey& k, const CompatibleHash& hash,const CompatiblePred& eq)const { std::size_t buc=buckets.position(hash(k)); node_impl_pointer x=buckets.at(buc); node_impl_pointer y=x->next(); while(y!=x){ if(eq(k,key(node_type::from_impl(y)->value()))){ return make_iterator(node_type::from_impl(y)); } y=y->next(); } return end(); } template size_type count(const CompatibleKey& k)const { return count(k,hash_,eq_); } template< typename CompatibleKey,typename CompatibleHash,typename CompatiblePred > size_type count( const CompatibleKey& k, const CompatibleHash& hash,const CompatiblePred& eq)const { size_type res=0; std::size_t buc=buckets.position(hash(k)); node_impl_pointer x=buckets.at(buc); node_impl_pointer y=x->next(); while(y!=x){ if(eq(k,key(node_type::from_impl(y)->value()))){ do{ ++res; y=y->next(); }while(y!=x&&eq(k,key(node_type::from_impl(y)->value()))); break; } y=y->next(); } return res; } template std::pair equal_range(const CompatibleKey& k)const { return equal_range(k,hash_,eq_); } template< typename CompatibleKey,typename CompatibleHash,typename CompatiblePred > std::pair equal_range( const CompatibleKey& k, const CompatibleHash& hash,const CompatiblePred& eq)const { std::size_t buc=buckets.position(hash(k)); node_impl_pointer x=buckets.at(buc); node_impl_pointer y=x->next(); while(y!=x){ if(eq(k,key(node_type::from_impl(y)->value()))){ node_impl_pointer y0=y; do{ y=y->next(); }while(y!=x&&eq(k,key(node_type::from_impl(y)->value()))); if(y==x){ do{ ++y; }while(y==y->next()); y=y->next(); } return std::pair( make_iterator(node_type::from_impl(y0)), make_iterator(node_type::from_impl(y))); } y=y->next(); } return std::pair(end(),end()); } /* bucket interface */ size_type bucket_count()const{return buckets.size();} size_type max_bucket_count()const{return static_cast(-1);} size_type bucket_size(size_type n)const { size_type res=0; node_impl_pointer x=buckets.at(n); node_impl_pointer y=x->next(); while(y!=x){ ++res; y=y->next(); } return res; } size_type bucket(key_param_type k)const { return buckets.position(hash_(k)); } local_iterator begin(size_type n) { return const_cast(this)->begin(n); } const_local_iterator begin(size_type n)const { node_impl_pointer x=buckets.at(n); node_impl_pointer y=x->next(); if(y==x)return end(); return make_iterator(node_type::from_impl(y)); } local_iterator end(size_type n) { return const_cast(this)->end(n); } const_local_iterator end(size_type n)const { node_impl_pointer x=buckets.at(n); if(x==x->next())return end(); do{ ++x; }while(x==x->next()); return make_iterator(node_type::from_impl(x->next())); } const_local_iterator cbegin(size_type n)const{return begin(n);} const_local_iterator cend(size_type n)const{return end(n);} local_iterator local_iterator_to(const value_type& x) { return make_iterator(node_from_value(&x)); } const_local_iterator local_iterator_to(const value_type& x)const { return make_iterator(node_from_value(&x)); } /* hash policy */ float load_factor()const{return static_cast(size())/bucket_count();} float max_load_factor()const{return mlf;} void max_load_factor(float z){mlf=z;calculate_max_load();} void rehash(size_type n) { BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT; if(size()::max)(); float fbc=static_cast(1+size()/mlf); if(bc>fbc){ bc=static_cast(fbc); if(bc(args_list.get_head())), hash_(tuples::get<2>(args_list.get_head())), eq_(tuples::get<3>(args_list.get_head())), buckets(al,header()->impl(),tuples::get<0>(args_list.get_head())), mlf(1.0f), first_bucket(buckets.size()) { calculate_max_load(); } hashed_index( const hashed_index& x): super(x), #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) safe_super(), #endif key(x.key), hash_(x.hash_), eq_(x.eq_), buckets(x.get_allocator(),header()->impl(),x.buckets.size()), mlf(x.mlf), max_load(x.max_load), first_bucket(x.first_bucket) { /* Copy ctor just takes the internal configuration objects from x. The rest * is done in subsequent call to copy_(). */ } hashed_index( const hashed_index& x, do_not_copy_elements_tag): super(x,do_not_copy_elements_tag()), #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) safe_super(), #endif key(x.key), hash_(x.hash_), eq_(x.eq_), buckets(x.get_allocator(),header()->impl(),0), mlf(1.0f), first_bucket(buckets.size()) { calculate_max_load(); } ~hashed_index() { /* the container is guaranteed to be empty by now */ } #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) iterator make_iterator(node_type* node) { return iterator(node,&buckets,this); } const_iterator make_iterator(node_type* node)const { return const_iterator( node, &const_cast(buckets), const_cast(this)); } #else iterator make_iterator(node_type* node) { return iterator(node,&buckets); } const_iterator make_iterator(node_type* node)const { return const_iterator(node,&const_cast(buckets)); } #endif void copy_( const hashed_index& x, const copy_map_type& map) { for(node_impl_pointer begin_org=x.buckets.begin(), begin_cpy=buckets.begin(), end_org=x.buckets.end(); begin_org!=end_org;++begin_org,++begin_cpy){ node_impl_pointer next_org=begin_org->next(); node_impl_pointer cpy=begin_cpy; while(next_org!=begin_org){ cpy->next()= static_cast( map.find( static_cast( node_type::from_impl(next_org))))->impl(); next_org=next_org->next(); cpy=cpy->next(); } cpy->next()=begin_cpy; } super::copy_(x,map); } template node_type* insert_(value_param_type v,node_type* x,Variant variant) { reserve(size()+1); std::size_t buc=find_bucket(v); node_impl_pointer pos=buckets.at(buc); if(!link_point(v,pos,Category()))return node_type::from_impl(pos); node_type* res=static_cast(super::insert_(v,x,variant)); if(res==x){ link(x,pos); if(first_bucket>buc)first_bucket=buc; } return res; } template node_type* insert_( value_param_type v,node_type* position,node_type* x,Variant variant) { reserve(size()+1); std::size_t buc=find_bucket(v); node_impl_pointer pos=buckets.at(buc); if(!link_point(v,pos,Category()))return node_type::from_impl(pos); node_type* res= static_cast(super::insert_(v,position,x,variant)); if(res==x){ link(x,pos); if(first_bucket>buc)first_bucket=buc; } return res; } void erase_(node_type* x) { unlink(x); first_bucket=buckets.first_nonempty(first_bucket); super::erase_(x); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) detach_iterators(x); #endif } void delete_all_nodes_() { for(node_impl_pointer x=buckets.begin(),x_end=buckets.end(); x!=x_end;++x){ node_impl_pointer y=x->next(); while(y!=x){ node_impl_pointer z=y->next(); this->final_delete_node_( static_cast(node_type::from_impl(y))); y=z; } } } void clear_() { super::clear_(); buckets.clear(); first_bucket=buckets.size(); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) safe_super::detach_dereferenceable_iterators(); #endif } void swap_( hashed_index& x) { std::swap(key,x.key); std::swap(hash_,x.hash_); std::swap(eq_,x.eq_); buckets.swap(x.buckets); std::swap(mlf,x.mlf); std::swap(max_load,x.max_load); std::swap(first_bucket,x.first_bucket); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) safe_super::swap(x); #endif super::swap_(x); } void swap_elements_( hashed_index& x) { buckets.swap(x.buckets); std::swap(mlf,x.mlf); std::swap(max_load,x.max_load); std::swap(first_bucket,x.first_bucket); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) safe_super::swap(x); #endif super::swap_elements_(x); } template bool replace_(value_param_type v,node_type* x,Variant variant) { if(eq_(key(v),key(x->value()))){ return super::replace_(v,x,variant); } node_impl_pointer y=prev(x); unlink_next(y); BOOST_TRY{ std::size_t buc=find_bucket(v); node_impl_pointer pos=buckets.at(buc); if(link_point(v,pos,Category())&&super::replace_(v,x,variant)){ link(x,pos); if(first_bucket>buc){ first_bucket=buc; } else if(first_bucketvalue()); b=in_place(x->impl(),key(x->value()),buc,Category()); } BOOST_CATCH(...){ erase_(x); BOOST_RETHROW; } BOOST_CATCH_END if(!b){ unlink(x); BOOST_TRY{ node_impl_pointer pos=buckets.at(buc); if(!link_point(x->value(),pos,Category())){ first_bucket=buckets.first_nonempty(first_bucket); super::erase_(x); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) detach_iterators(x); #endif return false; } link(x,pos); if(first_bucket>buc){ first_bucket=buc; } else if(first_bucketvalue()); if(in_place(x->impl(),key(x->value()),buc,Category())){ return super::modify_rollback_(x); } node_impl_pointer y=prev(x); unlink_next(y); BOOST_TRY{ node_impl_pointer pos=buckets.at(buc); if(link_point(x->value(),pos,Category())&&super::modify_rollback_(x)){ link(x,pos); if(first_bucket>buc){ first_bucket=buc; } else if(first_bucket void save_( Archive& ar,const unsigned int version,const index_saver_type& sm)const { ar< void load_(Archive& ar,const unsigned int version,const index_loader_type& lm) { ar>>serialization::make_nvp("position",buckets); super::load_(ar,version,lm); } #endif #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING) /* invariant stuff */ bool invariant_()const { if(size()==0||begin()==end()){ if(size()!=0||begin()!=end())return false; } else{ size_type s0=0; for(const_iterator it=begin(),it_end=end();it!=it_end;++it,++s0){} if(s0!=size())return false; size_type s1=0; for(size_type buc=0;bucfinal_check_invariant_();} #endif private: node_type* header()const{return this->final_header();} std::size_t find_bucket(value_param_type v)const { return bucket(key(v)); } bool link_point( value_param_type v,node_impl_pointer& pos,hashed_unique_tag) { node_impl_pointer x=pos->next(); while(x!=pos){ if(eq_(key(v),key(node_type::from_impl(x)->value()))){ pos=x; return false; } x=x->next(); } return true; } bool link_point( value_param_type v,node_impl_pointer& pos,hashed_non_unique_tag) { node_impl_pointer prev=pos; node_impl_pointer x=pos->next(); while(x!=pos){ if(eq_(key(v),key(node_type::from_impl(x)->value()))){ pos=prev; return true; } prev=x; x=x->next(); } return true; } static void link(node_type* x,node_impl_pointer pos) { node_impl_type::link(x->impl(),pos); }; static void link(node_impl_pointer x,node_impl_pointer pos) { node_impl_type::link(x,pos); }; static void unlink(node_type* x) { node_impl_type::unlink(x->impl()); }; static node_impl_pointer prev(node_type* x) { return node_impl_type::prev(x->impl()); } static node_impl_pointer prev_from(node_type* x,node_impl_pointer y) { return node_impl_type::prev_from(x->impl(),y); } static void unlink_next(node_impl_pointer x) { node_impl_type::unlink_next(x); } void calculate_max_load() { float fml=static_cast(mlf*bucket_count()); max_load=(std::numeric_limits::max)(); if(max_load>fml)max_load=static_cast(fml); } void reserve(size_type n) { if(n>max_load){ size_type bc =(std::numeric_limits::max)(); float fbc=static_cast(1+static_cast(n)/mlf); if(bc>fbc)bc =static_cast(fbc); unchecked_rehash(bc); } } void unchecked_rehash(size_type n) { bucket_array_type buckets1(get_allocator(),header()->impl(),n); auto_space hashes(get_allocator(),size()); std::size_t i=0; node_impl_pointer x=buckets.begin(); node_impl_pointer x_end=buckets.end(); for(;x!=x_end;++x){ node_impl_pointer y=x->next(); while(y!=x){ hashes.data()[i++]=hash_(key(node_type::from_impl(y)->value())); y=y->next(); } } i=0; x=buckets.begin(); for(;x!=x_end;++x){ node_impl_pointer y=x->next(); while(y!=x){ node_impl_pointer z=y->next(); std::size_t buc1=buckets1.position(hashes.data()[i++]); node_impl_pointer x1=buckets1.at(buc1); link(y,x1); y=z; } } buckets.swap(buckets1); calculate_max_load(); first_bucket=buckets.first_nonempty(0); } bool in_place( node_impl_pointer x,key_param_type k,std::size_t buc, hashed_unique_tag)const { std::less_equal leq; node_impl_pointer bbegin=buckets.begin(); node_impl_pointer bend=buckets.end(); node_impl_pointer pbuc=x->next(); while(!leq(bbegin,pbuc)||!leq(pbuc,bend))pbuc=pbuc->next(); if(buc!=static_cast(pbuc-bbegin))return false; node_impl_pointer y=x; while(y->next()!=x){ y=y->next(); if(y==pbuc)continue; if(eq_(k,key(node_type::from_impl(y)->value())))return false; } return true; } bool in_place( node_impl_pointer x,key_param_type k,std::size_t buc, hashed_non_unique_tag)const { std::less_equal leq; node_impl_pointer bbegin=buckets.begin(); node_impl_pointer bend=buckets.end(); node_impl_pointer pbuc=x->next(); while(!leq(bbegin,pbuc)||!leq(pbuc,bend))pbuc=pbuc->next(); if(buc!=static_cast(pbuc-bbegin))return false; node_impl_pointer y=x->next(); if(y!=pbuc){ if(eq_(k,key(node_type::from_impl(y)->value()))){ /* adjacent to equivalent element -> in place */ return true; } else{ y=y->next(); while(y!=pbuc){ if(eq_(k,key(node_type::from_impl(y)->value())))return false; y=y->next(); } } } while(y->next()!=x){ y=y->next(); if(eq_(k,key(node_type::from_impl(y)->value()))){ while(y->next()!=x){ y=y->next(); if(!eq_(k,key(node_type::from_impl(y)->value())))return false; } /* after a group of equivalent elements --> in place */ return true; } } return true; } #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) void detach_iterators(node_type* x) { iterator it=make_iterator(x); safe_mode::detach_equivalent_iterators(it); } #endif template std::pair emplace_impl(BOOST_MULTI_INDEX_FUNCTION_PARAM_PACK) { BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT; std::pairp= this->final_emplace_(BOOST_MULTI_INDEX_FORWARD_PARAM_PACK); return std::pair(make_iterator(p.first),p.second); } template iterator emplace_hint_impl( iterator position,BOOST_MULTI_INDEX_FUNCTION_PARAM_PACK) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(position); BOOST_MULTI_INDEX_CHECK_IS_OWNER(position,*this); BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT; std::pairp= this->final_emplace_hint_( static_cast(position.get_node()), BOOST_MULTI_INDEX_FORWARD_PARAM_PACK); return make_iterator(p.first); } key_from_value key; hasher hash_; key_equal eq_; bucket_array_type buckets; float mlf; size_type max_load; std::size_t first_bucket; #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING)&&\ BOOST_WORKAROUND(__MWERKS__,<=0x3003) #pragma parse_mfunc_templ reset #endif }; /* specialized algorithms */ template< typename KeyFromValue,typename Hash,typename Pred, typename SuperMeta,typename TagList,typename Category > void swap( hashed_index& x, hashed_index& y) { x.swap(y); } } /* namespace multi_index::detail */ /* hashed index specifiers */ template struct hashed_unique { typedef typename detail::hashed_index_args< Arg1,Arg2,Arg3,Arg4> index_args; typedef typename index_args::tag_list_type::type tag_list_type; typedef typename index_args::key_from_value_type key_from_value_type; typedef typename index_args::hash_type hash_type; typedef typename index_args::pred_type pred_type; template struct node_class { typedef detail::hashed_index_node type; }; template struct index_class { typedef detail::hashed_index< key_from_value_type,hash_type,pred_type, SuperMeta,tag_list_type,detail::hashed_unique_tag> type; }; }; template struct hashed_non_unique { typedef typename detail::hashed_index_args< Arg1,Arg2,Arg3,Arg4> index_args; typedef typename index_args::tag_list_type::type tag_list_type; typedef typename index_args::key_from_value_type key_from_value_type; typedef typename index_args::hash_type hash_type; typedef typename index_args::pred_type pred_type; template struct node_class { typedef detail::hashed_index_node type; }; template struct index_class { typedef detail::hashed_index< key_from_value_type,hash_type,pred_type, SuperMeta,tag_list_type,detail::hashed_non_unique_tag> type; }; }; } /* namespace multi_index */ } /* namespace boost */ /* Boost.Foreach compatibility */ template< typename KeyFromValue,typename Hash,typename Pred, typename SuperMeta,typename TagList,typename Category > inline boost::mpl::true_* boost_foreach_is_noncopyable( boost::multi_index::detail::hashed_index< KeyFromValue,Hash,Pred,SuperMeta,TagList,Category>*&, boost::foreach::tag) { return 0; } #undef BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT #undef BOOST_MULTI_INDEX_HASHED_INDEX_CHECK_INVARIANT_OF #endif madp-0.4/src/boost/boost/multi_index/PaxHeaders.5405/detail0000644000000000000000000000007412717644140020534 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/detail/0000775000372100037210000000000012717644140021440 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/ord_index_args.hpp0000644000000000000000000000007412717644140024311 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/ord_index_args.hpp0000664000372100037210000000451512717644140025145 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_ORD_INDEX_ARGS_HPP #define BOOST_MULTI_INDEX_DETAIL_ORD_INDEX_ARGS_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include #include #include #include namespace boost{ namespace multi_index{ namespace detail{ /* Oredered index specifiers can be instantiated in two forms: * * (ordered_unique|ordered_non_unique)< * KeyFromValue,Compare=std::less > * (ordered_unique|ordered_non_unique)< * TagList,KeyFromValue,Compare=std::less > * * index_args implements the machinery to accept this argument-dependent * polymorphism. */ template struct index_args_default_compare { typedef std::less type; }; template struct ordered_index_args { typedef is_tag full_form; typedef typename mpl::if_< full_form, Arg1, tag< > >::type tag_list_type; typedef typename mpl::if_< full_form, Arg2, Arg1>::type key_from_value_type; typedef typename mpl::if_< full_form, Arg3, Arg2>::type supplied_compare_type; typedef typename mpl::eval_if< mpl::is_na, index_args_default_compare, mpl::identity >::type compare_type; BOOST_STATIC_ASSERT(is_tag::value); BOOST_STATIC_ASSERT(!mpl::is_na::value); BOOST_STATIC_ASSERT(!mpl::is_na::value); }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/value_compare.hpp0000644000000000000000000000007412717644140024144 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/detail/value_compare.hpp0000664000372100037210000000227612717644140025002 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_VALUE_COMPARE_HPP #define BOOST_MULTI_INDEX_DETAIL_VALUE_COMPARE_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include namespace boost{ namespace multi_index{ namespace detail{ template struct value_comparison:std::binary_function { value_comparison( const KeyFromValue& key_=KeyFromValue(),const Compare& comp_=Compare()): key(key_),comp(comp_) { } bool operator()( typename call_traits::param_type x, typename call_traits::param_type y)const { return comp(key(x),key(y)); } private: KeyFromValue key; Compare comp; }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/bidir_node_iterator.hpp0000644000000000000000000000007412717644140025331 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/bidir_node_iterator.hpp0000664000372100037210000000475212717644140026170 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_BIDIR_NODE_ITERATOR_HPP #define BOOST_MULTI_INDEX_DETAIL_BIDIR_NODE_ITERATOR_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) #include #include #endif namespace boost{ namespace multi_index{ namespace detail{ /* Iterator class for node-based indices with bidirectional * iterators (ordered and sequenced indices.) */ template class bidir_node_iterator: public bidirectional_iterator_helper< bidir_node_iterator, typename Node::value_type, std::ptrdiff_t, const typename Node::value_type*, const typename Node::value_type&> { public: bidir_node_iterator(){} explicit bidir_node_iterator(Node* node_):node(node_){} const typename Node::value_type& operator*()const { return node->value(); } bidir_node_iterator& operator++() { Node::increment(node); return *this; } bidir_node_iterator& operator--() { Node::decrement(node); return *this; } #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) /* Serialization. As for why the following is public, * see explanation in safe_mode_iterator notes in safe_mode.hpp. */ BOOST_SERIALIZATION_SPLIT_MEMBER() typedef typename Node::base_type node_base_type; template void save(Archive& ar,const unsigned int)const { node_base_type* bnode=node; ar< void load(Archive& ar,const unsigned int) { node_base_type* bnode; ar>>serialization::make_nvp("pointer",bnode); node=static_cast(bnode); } #endif /* get_node is not to be used by the user */ typedef Node node_type; Node* get_node()const{return node;} private: Node* node; }; template bool operator==( const bidir_node_iterator& x, const bidir_node_iterator& y) { return x.get_node()==y.get_node(); } } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/bucket_array.hpp0000644000000000000000000000007412717644140023775 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/bucket_array.hpp0000664000372100037210000001276212717644140024634 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_BUCKET_ARRAY_HPP #define BOOST_MULTI_INDEX_DETAIL_BUCKET_ARRAY_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include #include #include #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) #include #include #include #endif namespace boost{ namespace multi_index{ namespace detail{ /* bucket structure for use by hashed indices */ class bucket_array_base:private noncopyable { protected: inline static std::size_t next_prime(std::size_t n) { static const std::size_t prime_list[]={ 53ul, 97ul, 193ul, 389ul, 769ul, 1543ul, 3079ul, 6151ul, 12289ul, 24593ul, 49157ul, 98317ul, 196613ul, 393241ul, 786433ul, 1572869ul, 3145739ul, 6291469ul, 12582917ul, 25165843ul, 50331653ul, 100663319ul, 201326611ul, 402653189ul, 805306457ul, 1610612741ul, 3221225473ul, #if ((((ULONG_MAX>>16)>>16)>>16)>>15)==0 /* unsigned long less than 64 bits */ 4294967291ul #else /* obtained with aid from * http://javaboutique.internet.com/prime_numb/ * http://www.rsok.com/~jrm/next_ten_primes.html * and verified with * http://www.alpertron.com.ar/ECM.HTM */ 6442450939ul, 12884901893ul, 25769803751ul, 51539607551ul, 103079215111ul, 206158430209ul, 412316860441ul, 824633720831ul, 1649267441651ul, 3298534883309ul, 6597069766657ul, 13194139533299ul, 26388279066623ul, 52776558133303ul, 105553116266489ul, 211106232532969ul, 422212465066001ul, 844424930131963ul, 1688849860263953ul, 3377699720527861ul, 6755399441055731ul, 13510798882111483ul, 27021597764222939ul, 54043195528445957ul, 108086391056891903ul, 216172782113783843ul, 432345564227567621ul, 864691128455135207ul, 1729382256910270481ul, 3458764513820540933ul, 6917529027641081903ul, 13835058055282163729ul, 18446744073709551557ul #endif }; static const std::size_t prime_list_size= sizeof(prime_list)/sizeof(prime_list[0]); std::size_t const *bound= std::lower_bound(prime_list,prime_list+prime_list_size,n); if(bound==prime_list+prime_list_size)bound--; return *bound; } }; template class bucket_array:public bucket_array_base { typedef typename prevent_eti< Allocator, hashed_index_node_impl< typename boost::detail::allocator::rebind_to< Allocator, char >::type > >::type node_impl_type; public: typedef typename node_impl_type::pointer pointer; bucket_array(const Allocator& al,pointer end_,std::size_t size): size_(bucket_array_base::next_prime(size)), spc(al,size_+1) { clear(); end()->next()=end_; end_->next()=end(); } std::size_t size()const { return size_; } std::size_t position(std::size_t hash)const { return hash%size_; } pointer begin()const{return buckets();} pointer end()const{return buckets()+size_;} pointer at(std::size_t n)const{return buckets()+n;} std::size_t first_nonempty(std::size_t n)const { for(;;++n){ pointer x=at(n); if(x->next()!=x)return n; } } void clear() { for(pointer x=begin(),y=end();x!=y;++x)x->next()=x; } void swap(bucket_array& x) { std::swap(size_,x.size_); spc.swap(x.spc); } private: std::size_t size_; auto_space spc; pointer buckets()const { return spc.data(); } #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) friend class boost::serialization::access; /* bucket_arrays do not emit any kind of serialization info. They are * fed to Boost.Serialization as hashed index iterators need to track * them during serialization. */ template void serialize(Archive&,const unsigned int) { } #endif }; template void swap(bucket_array& x,bucket_array& y) { x.swap(y); } } /* namespace multi_index::detail */ } /* namespace multi_index */ #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) /* bucket_arrays never get constructed directly by Boost.Serialization, * as archives are always fed pointers to previously existent * arrays. So, if this is called it means we are dealing with a * somehow invalid archive. */ #if defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP) namespace serialization{ #else namespace multi_index{ namespace detail{ #endif template inline void load_construct_data( Archive&,boost::multi_index::detail::bucket_array*, const unsigned int) { throw_exception( archive::archive_exception(archive::archive_exception::other_exception)); } #if defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP) } /* namespace serialization */ #else } /* namespace multi_index::detail */ } /* namespace multi_index */ #endif #endif } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/serialization_version.hpp0000644000000000000000000000007412717644140025744 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/detail/serialization_version.hpp0000664000372100037210000000353112717644140026575 0ustar00fransfrans00000000000000/* Copyright 2003-2010 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_SERIALIZATION_VERSION_HPP #define BOOST_MULTI_INDEX_DETAIL_SERIALIZATION_VERSION_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include namespace boost{ namespace multi_index{ namespace detail{ /* Helper class for storing and retrieving a given type serialization class * version while avoiding saving the number multiple times in the same * archive. * Behavior undefined if template partial specialization is not supported. */ template struct serialization_version { serialization_version(): value(boost::serialization::version::value){} serialization_version& operator=(unsigned int x){value=x;return *this;}; operator unsigned int()const{return value;} private: friend class boost::serialization::access; BOOST_SERIALIZATION_SPLIT_MEMBER() template void save(Archive&,const unsigned int)const{} template void load(Archive&,const unsigned int version) { this->value=version; } unsigned int value; }; } /* namespace multi_index::detail */ } /* namespace multi_index */ #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) namespace serialization { template struct version > { BOOST_STATIC_CONSTANT(int,value=version::value); }; } /* namespace serialization */ #endif } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/rnd_index_ptr_array.hpp0000644000000000000000000000007412717644140025357 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/rnd_index_ptr_array.hpp0000664000372100037210000000645412717644140026217 0ustar00fransfrans00000000000000/* Copyright 2003-2013 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_RND_INDEX_PTR_ARRAY_HPP #define BOOST_MULTI_INDEX_DETAIL_RND_INDEX_PTR_ARRAY_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include #include #include namespace boost{ namespace multi_index{ namespace detail{ /* pointer structure for use by random access indices */ template class random_access_index_ptr_array:private noncopyable { typedef typename prevent_eti< Allocator, random_access_index_node_impl< typename boost::detail::allocator::rebind_to< Allocator, char >::type > >::type node_impl_type; public: typedef typename node_impl_type::pointer value_type; typedef typename prevent_eti< Allocator, typename boost::detail::allocator::rebind_to< Allocator,value_type >::type >::type::pointer pointer; random_access_index_ptr_array( const Allocator& al,value_type end_,std::size_t size): size_(size), capacity_(size), spc(al,capacity_+1) { *end()=end_; end_->up()=end(); } std::size_t size()const{return size_;} std::size_t capacity()const{return capacity_;} void room_for_one() { if(size_==capacity_){ reserve(capacity_<=10?15:capacity_+capacity_/2); } } void reserve(std::size_t c) { if(c>capacity_)set_capacity(c); } void shrink_to_fit() { if(capacity_>size_)set_capacity(size_); } pointer begin()const{return ptrs();} pointer end()const{return ptrs()+size_;} pointer at(std::size_t n)const{return ptrs()+n;} void push_back(value_type x) { *(end()+1)=*end(); (*(end()+1))->up()=end()+1; *end()=x; (*end())->up()=end(); ++size_; } void erase(value_type x) { node_impl_type::extract(x->up(),end()+1); --size_; } void clear() { *begin()=*end(); (*begin())->up()=begin(); size_=0; } void swap(random_access_index_ptr_array& x) { std::swap(size_,x.size_); std::swap(capacity_,x.capacity_); spc.swap(x.spc); } private: std::size_t size_; std::size_t capacity_; auto_space spc; pointer ptrs()const { return spc.data(); } void set_capacity(std::size_t c) { auto_space spc1(spc.get_allocator(),c+1); node_impl_type::transfer(begin(),end()+1,spc1.data()); spc.swap(spc1); capacity_=c; } }; template void swap( random_access_index_ptr_array& x, random_access_index_ptr_array& y) { x.swap(y); } } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/index_matcher.hpp0000644000000000000000000000007412717644140024134 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/index_matcher.hpp0000664000372100037210000001371112717644140024766 0ustar00fransfrans00000000000000/* Copyright 2003-2013 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_INDEX_MATCHER_HPP #define BOOST_MULTI_INDEX_DETAIL_INDEX_MATCHER_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include namespace boost{ namespace multi_index{ namespace detail{ /* index_matcher compares a sequence of elements against a * base sequence, identifying those elements that belong to the * longest subsequence which is ordered with respect to the base. * For instance, if the base sequence is: * * 0 1 2 3 4 5 6 7 8 9 * * and the compared sequence (not necesarilly the same length): * * 1 4 2 3 0 7 8 9 * * the elements of the longest ordered subsequence are: * * 1 2 3 7 8 9 * * The algorithm for obtaining such a subsequence is called * Patience Sorting, described in ch. 1 of: * Aldous, D., Diaconis, P.: "Longest increasing subsequences: from * patience sorting to the Baik-Deift-Johansson Theorem", Bulletin * of the American Mathematical Society, vol. 36, no 4, pp. 413-432, * July 1999. * http://www.ams.org/bull/1999-36-04/S0273-0979-99-00796-X/ * S0273-0979-99-00796-X.pdf * * This implementation is not fully generic since it assumes that * the sequences given are pointed to by index iterators (having a * get_node() memfun.) */ namespace index_matcher{ /* The algorithm stores the nodes of the base sequence and a number * of "piles" that are dynamically updated during the calculation * stage. From a logical point of view, nodes form an independent * sequence from piles. They are stored together so as to minimize * allocated memory. */ struct entry { entry(void* node_,std::size_t pos_=0):node(node_),pos(pos_){} /* node stuff */ void* node; std::size_t pos; entry* previous; bool ordered; struct less_by_node { bool operator()( const entry& x,const entry& y)const { return std::less()(x.node,y.node); } }; /* pile stuff */ std::size_t pile_top; entry* pile_top_entry; struct less_by_pile_top { bool operator()( const entry& x,const entry& y)const { return x.pile_top class algorithm_base:private noncopyable { protected: algorithm_base(const Allocator& al,std::size_t size): spc(al,size),size_(size),n_(0),sorted(false) { } void add(void* node) { entries()[n_]=entry(node,n_); ++n_; } void begin_algorithm()const { if(!sorted){ std::sort(entries(),entries()+size_,entry::less_by_node()); sorted=true; } num_piles=0; } void add_node_to_algorithm(void* node)const { entry* ent= std::lower_bound( entries(),entries()+size_, entry(node),entry::less_by_node()); /* localize entry */ ent->ordered=false; std::size_t n=ent->pos; /* get its position */ entry dummy(0); dummy.pile_top=n; entry* pile_ent= /* find the first available pile */ std::lower_bound( /* to stack the entry */ entries(),entries()+num_piles, dummy,entry::less_by_pile_top()); pile_ent->pile_top=n; /* stack the entry */ pile_ent->pile_top_entry=ent; /* if not the first pile, link entry to top of the preceding pile */ if(pile_ent>&entries()[0]){ ent->previous=(pile_ent-1)->pile_top_entry; } if(pile_ent==&entries()[num_piles]){ /* new pile? */ ++num_piles; } } void finish_algorithm()const { if(num_piles>0){ /* Mark those elements which are in their correct position, i.e. those * belonging to the longest increasing subsequence. These are those * elements linked from the top of the last pile. */ entry* ent=entries()[num_piles-1].pile_top_entry; for(std::size_t n=num_piles;n--;){ ent->ordered=true; ent=ent->previous; } } } bool is_ordered(void * node)const { return std::lower_bound( entries(),entries()+size_, entry(node),entry::less_by_node())->ordered; } private: entry* entries()const{return &*spc.data();} auto_space spc; std::size_t size_; std::size_t n_; mutable bool sorted; mutable std::size_t num_piles; }; /* The algorithm has three phases: * - Initialization, during which the nodes of the base sequence are added. * - Execution. * - Results querying, through the is_ordered memfun. */ template class algorithm:private algorithm_base { typedef algorithm_base super; public: algorithm(const Allocator& al,std::size_t size):super(al,size){} void add(Node* node) { super::add(node); } template void execute(IndexIterator first,IndexIterator last)const { super::begin_algorithm(); for(IndexIterator it=first;it!=last;++it){ add_node_to_algorithm(get_node(it)); } super::finish_algorithm(); } bool is_ordered(Node* node)const { return super::is_ordered(node); } private: void add_node_to_algorithm(Node* node)const { super::add_node_to_algorithm(node); } template static Node* get_node(IndexIterator it) { return static_cast(it.get_node()); } }; } /* namespace multi_index::detail::index_matcher */ } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/do_not_copy_elements_tag.hpp0000644000000000000000000000007412717644140026365 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/do_not_copy_elements_tag.hpp0000664000372100037210000000141412717644140027214 0ustar00fransfrans00000000000000/* Copyright 2003-2013 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_DO_NOT_COPY_ELEMENTS_TAG_HPP #define BOOST_MULTI_INDEX_DETAIL_DO_NOT_COPY_ELEMENTS_TAG_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif namespace boost{ namespace multi_index{ namespace detail{ /* Used to mark a special ctor variant that copies the internal objects of * a container but not its elements. */ struct do_not_copy_elements_tag{}; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/seq_index_node.hpp0000644000000000000000000000007412717644140024306 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/detail/seq_index_node.hpp0000664000372100037210000001260112717644140025135 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_SEQ_INDEX_NODE_HPP #define BOOST_MULTI_INDEX_DETAIL_SEQ_INDEX_NODE_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include namespace boost{ namespace multi_index{ namespace detail{ /* doubly-linked node for use by sequenced_index */ template struct sequenced_index_node_impl { typedef typename prevent_eti< Allocator, typename boost::detail::allocator::rebind_to< Allocator,sequenced_index_node_impl >::type >::type::pointer pointer; typedef typename prevent_eti< Allocator, typename boost::detail::allocator::rebind_to< Allocator,sequenced_index_node_impl >::type >::type::const_pointer const_pointer; pointer& prior(){return prior_;} pointer prior()const{return prior_;} pointer& next(){return next_;} pointer next()const{return next_;} /* interoperability with bidir_node_iterator */ static void increment(pointer& x){x=x->next();} static void decrement(pointer& x){x=x->prior();} /* algorithmic stuff */ static void link(pointer x,pointer header) { x->prior()=header->prior(); x->next()=header; x->prior()->next()=x->next()->prior()=x; }; static void unlink(pointer x) { x->prior()->next()=x->next(); x->next()->prior()=x->prior(); } static void relink(pointer position,pointer x) { unlink(x); x->prior()=position->prior(); x->next()=position; x->prior()->next()=x->next()->prior()=x; } static void relink(pointer position,pointer x,pointer y) { /* position is assumed not to be in [x,y) */ if(x!=y){ pointer z=y->prior(); x->prior()->next()=y; y->prior()=x->prior(); x->prior()=position->prior(); z->next()=position; x->prior()->next()=x; z->next()->prior()=z; } } static void reverse(pointer header) { pointer x=header; do{ pointer y=x->next(); std::swap(x->prior(),x->next()); x=y; }while(x!=header); } static void swap(pointer x,pointer y) { /* This swap function does not exchange the header nodes, * but rather their pointers. This is *not* used for implementing * sequenced_index::swap. */ if(x->next()!=x){ if(y->next()!=y){ std::swap(x->next(),y->next()); std::swap(x->prior(),y->prior()); x->next()->prior()=x->prior()->next()=x; y->next()->prior()=y->prior()->next()=y; } else{ y->next()=x->next(); y->prior()=x->prior(); x->next()=x->prior()=x; y->next()->prior()=y->prior()->next()=y; } } else if(y->next()!=y){ x->next()=y->next(); x->prior()=y->prior(); y->next()=y->prior()=y; x->next()->prior()=x->prior()->next()=x; } } private: pointer prior_; pointer next_; }; template struct sequenced_index_node_trampoline: prevent_eti< Super, sequenced_index_node_impl< typename boost::detail::allocator::rebind_to< typename Super::allocator_type, char >::type > >::type { typedef typename prevent_eti< Super, sequenced_index_node_impl< typename boost::detail::allocator::rebind_to< typename Super::allocator_type, char >::type > >::type impl_type; }; template struct sequenced_index_node:Super,sequenced_index_node_trampoline { private: typedef sequenced_index_node_trampoline trampoline; public: typedef typename trampoline::impl_type impl_type; typedef typename trampoline::pointer impl_pointer; typedef typename trampoline::const_pointer const_impl_pointer; impl_pointer& prior(){return trampoline::prior();} impl_pointer prior()const{return trampoline::prior();} impl_pointer& next(){return trampoline::next();} impl_pointer next()const{return trampoline::next();} impl_pointer impl() { return static_cast( static_cast(static_cast(this))); } const_impl_pointer impl()const { return static_cast( static_cast(static_cast(this))); } static sequenced_index_node* from_impl(impl_pointer x) { return static_cast( static_cast(&*x)); } static const sequenced_index_node* from_impl(const_impl_pointer x) { return static_cast( static_cast(&*x)); } /* interoperability with bidir_node_iterator */ static void increment(sequenced_index_node*& x) { impl_pointer xi=x->impl(); trampoline::increment(xi); x=from_impl(xi); } static void decrement(sequenced_index_node*& x) { impl_pointer xi=x->impl(); trampoline::decrement(xi); x=from_impl(xi); } }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/hash_index_iterator.hpp0000644000000000000000000000007412717644140025345 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/hash_index_iterator.hpp0000664000372100037210000000516212717644140026200 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_HASH_INDEX_ITERATOR_HPP #define BOOST_MULTI_INDEX_DETAIL_HASH_INDEX_ITERATOR_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) #include #include #endif namespace boost{ namespace multi_index{ namespace detail{ /* Iterator class for hashed indices. */ template class hashed_index_iterator: public forward_iterator_helper< hashed_index_iterator, typename Node::value_type, std::ptrdiff_t, const typename Node::value_type*, const typename Node::value_type&> { public: hashed_index_iterator(){} hashed_index_iterator(Node* node_,BucketArray* buckets_): node(node_),buckets(buckets_) {} const typename Node::value_type& operator*()const { return node->value(); } hashed_index_iterator& operator++() { Node::increment(node,buckets->begin(),buckets->end()); return *this; } #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) /* Serialization. As for why the following is public, * see explanation in safe_mode_iterator notes in safe_mode.hpp. */ BOOST_SERIALIZATION_SPLIT_MEMBER() typedef typename Node::base_type node_base_type; template void save(Archive& ar,const unsigned int)const { node_base_type* bnode=node; ar< void load(Archive& ar,const unsigned int) { node_base_type* bnode; ar>>serialization::make_nvp("pointer",bnode); node=static_cast(bnode); ar>>serialization::make_nvp("pointer",buckets); } #endif /* get_node is not to be used by the user */ typedef Node node_type; Node* get_node()const{return node;} private: Node* node; BucketArray* buckets; }; template bool operator==( const hashed_index_iterator& x, const hashed_index_iterator& y) { return x.get_node()==y.get_node(); } } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/invariant_assert.hpp0000644000000000000000000000007412717644140024676 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/invariant_assert.hpp0000664000372100037210000000112412717644140025523 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_INVARIANT_ASSERT_HPP #define BOOST_MULTI_INDEX_DETAIL_INVARIANT_ASSERT_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #if !defined(BOOST_MULTI_INDEX_INVARIANT_ASSERT) #include #define BOOST_MULTI_INDEX_INVARIANT_ASSERT BOOST_ASSERT #endif #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/scope_guard.hpp0000644000000000000000000000007412717644140023615 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/detail/scope_guard.hpp0000664000372100037210000003263312717644140024453 0ustar00fransfrans00000000000000/* Copyright 2003-2013 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_SCOPE_GUARD_HPP #define BOOST_MULTI_INDEX_DETAIL_SCOPE_GUARD_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include #include namespace boost{ namespace multi_index{ namespace detail{ /* Until some official version of the ScopeGuard idiom makes it into Boost, * we locally define our own. This is a merely reformated version of * ScopeGuard.h as defined in: * Alexandrescu, A., Marginean, P.:"Generic: Change the Way You * Write Exception-Safe Code - Forever", C/C++ Users Jornal, Dec 2000, * http://www.drdobbs.com/184403758 * with the following modifications: * - General pretty formatting (pretty to my taste at least.) * - Naming style changed to standard C++ library requirements. * - Added scope_guard_impl4 and obj_scope_guard_impl3, (Boost.MultiIndex * needs them). A better design would provide guards for many more * arguments through the Boost Preprocessor Library. * - Added scope_guard_impl_base::touch (see below.) * - Removed RefHolder and ByRef, whose functionality is provided * already by Boost.Ref. * - Removed static make_guard's and make_obj_guard's, so that the code * will work even if BOOST_NO_MEMBER_TEMPLATES is defined. This forces * us to move some private ctors to public, though. * * NB: CodeWarrior Pro 8 seems to have problems looking up safe_execute * without an explicit qualification. * * We also define the following variants of the idiom: * * - make_guard_if_c( ... ) * - make_guard_if( ... ) * - make_obj_guard_if_c( ... ) * - make_obj_guard_if( ... ) * which may be used with a compile-time constant to yield * a "null_guard" if the boolean compile-time parameter is false, * or conversely, the guard is only constructed if the constant is true. * This is useful to avoid extra tagging, because the returned * null_guard can be optimzed comlpetely away by the compiler. */ class scope_guard_impl_base { public: scope_guard_impl_base():dismissed_(false){} void dismiss()const{dismissed_=true;} /* This helps prevent some "unused variable" warnings under, for instance, * GCC 3.2. */ void touch()const{} protected: ~scope_guard_impl_base(){} scope_guard_impl_base(const scope_guard_impl_base& other): dismissed_(other.dismissed_) { other.dismiss(); } template static void safe_execute(J& j){ BOOST_TRY{ if(!j.dismissed_)j.execute(); } BOOST_CATCH(...){} BOOST_CATCH_END } mutable bool dismissed_; private: scope_guard_impl_base& operator=(const scope_guard_impl_base&); }; typedef const scope_guard_impl_base& scope_guard; struct null_guard : public scope_guard_impl_base { template< class T1 > null_guard( const T1& ) { } template< class T1, class T2 > null_guard( const T1&, const T2& ) { } template< class T1, class T2, class T3 > null_guard( const T1&, const T2&, const T3& ) { } template< class T1, class T2, class T3, class T4 > null_guard( const T1&, const T2&, const T3&, const T4& ) { } template< class T1, class T2, class T3, class T4, class T5 > null_guard( const T1&, const T2&, const T3&, const T4&, const T5& ) { } }; template< bool cond, class T > struct null_guard_return { typedef typename boost::mpl::if_c::type type; }; template class scope_guard_impl0:public scope_guard_impl_base { public: scope_guard_impl0(F fun):fun_(fun){} ~scope_guard_impl0(){scope_guard_impl_base::safe_execute(*this);} void execute(){fun_();} protected: F fun_; }; template inline scope_guard_impl0 make_guard(F fun) { return scope_guard_impl0(fun); } template inline typename null_guard_return >::type make_guard_if_c(F fun) { return typename null_guard_return >::type(fun); } template inline typename null_guard_return >::type make_guard_if(F fun) { return make_guard_if(fun); } template class scope_guard_impl1:public scope_guard_impl_base { public: scope_guard_impl1(F fun,P1 p1):fun_(fun),p1_(p1){} ~scope_guard_impl1(){scope_guard_impl_base::safe_execute(*this);} void execute(){fun_(p1_);} protected: F fun_; const P1 p1_; }; template inline scope_guard_impl1 make_guard(F fun,P1 p1) { return scope_guard_impl1(fun,p1); } template inline typename null_guard_return >::type make_guard_if_c(F fun,P1 p1) { return typename null_guard_return >::type(fun,p1); } template inline typename null_guard_return >::type make_guard_if(F fun,P1 p1) { return make_guard_if_c(fun,p1); } template class scope_guard_impl2:public scope_guard_impl_base { public: scope_guard_impl2(F fun,P1 p1,P2 p2):fun_(fun),p1_(p1),p2_(p2){} ~scope_guard_impl2(){scope_guard_impl_base::safe_execute(*this);} void execute(){fun_(p1_,p2_);} protected: F fun_; const P1 p1_; const P2 p2_; }; template inline scope_guard_impl2 make_guard(F fun,P1 p1,P2 p2) { return scope_guard_impl2(fun,p1,p2); } template inline typename null_guard_return >::type make_guard_if_c(F fun,P1 p1,P2 p2) { return typename null_guard_return >::type(fun,p1,p2); } template inline typename null_guard_return >::type make_guard_if(F fun,P1 p1,P2 p2) { return make_guard_if_c(fun,p1,p2); } template class scope_guard_impl3:public scope_guard_impl_base { public: scope_guard_impl3(F fun,P1 p1,P2 p2,P3 p3):fun_(fun),p1_(p1),p2_(p2),p3_(p3){} ~scope_guard_impl3(){scope_guard_impl_base::safe_execute(*this);} void execute(){fun_(p1_,p2_,p3_);} protected: F fun_; const P1 p1_; const P2 p2_; const P3 p3_; }; template inline scope_guard_impl3 make_guard(F fun,P1 p1,P2 p2,P3 p3) { return scope_guard_impl3(fun,p1,p2,p3); } template inline typename null_guard_return >::type make_guard_if_c(F fun,P1 p1,P2 p2,P3 p3) { return typename null_guard_return >::type(fun,p1,p2,p3); } template inline typename null_guard_return< C::value,scope_guard_impl3 >::type make_guard_if(F fun,P1 p1,P2 p2,P3 p3) { return make_guard_if_c(fun,p1,p2,p3); } template class scope_guard_impl4:public scope_guard_impl_base { public: scope_guard_impl4(F fun,P1 p1,P2 p2,P3 p3,P4 p4): fun_(fun),p1_(p1),p2_(p2),p3_(p3),p4_(p4){} ~scope_guard_impl4(){scope_guard_impl_base::safe_execute(*this);} void execute(){fun_(p1_,p2_,p3_,p4_);} protected: F fun_; const P1 p1_; const P2 p2_; const P3 p3_; const P4 p4_; }; template inline scope_guard_impl4 make_guard( F fun,P1 p1,P2 p2,P3 p3,P4 p4) { return scope_guard_impl4(fun,p1,p2,p3,p4); } template inline typename null_guard_return >::type make_guard_if_c( F fun,P1 p1,P2 p2,P3 p3,P4 p4) { return typename null_guard_return >::type(fun,p1,p2,p3,p4); } template inline typename null_guard_return >::type make_guard_if( F fun,P1 p1,P2 p2,P3 p3,P4 p4) { return make_guard_if_c(fun,p1,p2,p3,p4); } template class obj_scope_guard_impl0:public scope_guard_impl_base { public: obj_scope_guard_impl0(Obj& obj,MemFun mem_fun):obj_(obj),mem_fun_(mem_fun){} ~obj_scope_guard_impl0(){scope_guard_impl_base::safe_execute(*this);} void execute(){(obj_.*mem_fun_)();} protected: Obj& obj_; MemFun mem_fun_; }; template inline obj_scope_guard_impl0 make_obj_guard(Obj& obj,MemFun mem_fun) { return obj_scope_guard_impl0(obj,mem_fun); } template inline typename null_guard_return >::type make_obj_guard_if_c(Obj& obj,MemFun mem_fun) { return typename null_guard_return >::type(obj,mem_fun); } template inline typename null_guard_return >::type make_obj_guard_if(Obj& obj,MemFun mem_fun) { return make_obj_guard_if_c(obj,mem_fun); } template class obj_scope_guard_impl1:public scope_guard_impl_base { public: obj_scope_guard_impl1(Obj& obj,MemFun mem_fun,P1 p1): obj_(obj),mem_fun_(mem_fun),p1_(p1){} ~obj_scope_guard_impl1(){scope_guard_impl_base::safe_execute(*this);} void execute(){(obj_.*mem_fun_)(p1_);} protected: Obj& obj_; MemFun mem_fun_; const P1 p1_; }; template inline obj_scope_guard_impl1 make_obj_guard( Obj& obj,MemFun mem_fun,P1 p1) { return obj_scope_guard_impl1(obj,mem_fun,p1); } template inline typename null_guard_return >::type make_obj_guard_if_c( Obj& obj,MemFun mem_fun,P1 p1) { return typename null_guard_return >::type(obj,mem_fun,p1); } template inline typename null_guard_return >::type make_obj_guard_if( Obj& obj,MemFun mem_fun,P1 p1) { return make_obj_guard_if_c(obj,mem_fun,p1); } template class obj_scope_guard_impl2:public scope_guard_impl_base { public: obj_scope_guard_impl2(Obj& obj,MemFun mem_fun,P1 p1,P2 p2): obj_(obj),mem_fun_(mem_fun),p1_(p1),p2_(p2) {} ~obj_scope_guard_impl2(){scope_guard_impl_base::safe_execute(*this);} void execute(){(obj_.*mem_fun_)(p1_,p2_);} protected: Obj& obj_; MemFun mem_fun_; const P1 p1_; const P2 p2_; }; template inline obj_scope_guard_impl2 make_obj_guard(Obj& obj,MemFun mem_fun,P1 p1,P2 p2) { return obj_scope_guard_impl2(obj,mem_fun,p1,p2); } template inline typename null_guard_return >::type make_obj_guard_if_c(Obj& obj,MemFun mem_fun,P1 p1,P2 p2) { return typename null_guard_return >::type(obj,mem_fun,p1,p2); } template inline typename null_guard_return >::type make_obj_guard_if(Obj& obj,MemFun mem_fun,P1 p1,P2 p2) { return make_obj_guard_if_c(obj,mem_fun,p1,p2); } template class obj_scope_guard_impl3:public scope_guard_impl_base { public: obj_scope_guard_impl3(Obj& obj,MemFun mem_fun,P1 p1,P2 p2,P3 p3): obj_(obj),mem_fun_(mem_fun),p1_(p1),p2_(p2),p3_(p3) {} ~obj_scope_guard_impl3(){scope_guard_impl_base::safe_execute(*this);} void execute(){(obj_.*mem_fun_)(p1_,p2_,p3_);} protected: Obj& obj_; MemFun mem_fun_; const P1 p1_; const P2 p2_; const P3 p3_; }; template inline obj_scope_guard_impl3 make_obj_guard(Obj& obj,MemFun mem_fun,P1 p1,P2 p2,P3 p3) { return obj_scope_guard_impl3(obj,mem_fun,p1,p2,p3); } template inline typename null_guard_return >::type make_obj_guard_if_c(Obj& obj,MemFun mem_fun,P1 p1,P2 p2,P3 p3) { return typename null_guard_return >::type(obj,mem_fun,p1,p2,p3); } template inline typename null_guard_return >::type make_obj_guard_if(Obj& obj,MemFun mem_fun,P1 p1,P2 p2,P3 p3) { return make_obj_guard_if_c(obj,mem_fun,p1,p2,p3); } } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/rnd_index_loader.hpp0000644000000000000000000000007412717644140024622 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/rnd_index_loader.hpp0000664000372100037210000001147512717644140025461 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_RND_INDEX_LOADER_HPP #define BOOST_MULTI_INDEX_DETAIL_RND_INDEX_LOADER_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include #include #include namespace boost{ namespace multi_index{ namespace detail{ /* This class implements a serialization rearranger for random access * indices. In order to achieve O(n) performance, the following strategy * is followed: the nodes of the index are handled as if in a bidirectional * list, where the next pointers are stored in the original * random_access_index_ptr_array and the prev pointers are stored in * an auxiliary array. Rearranging of nodes in such a bidirectional list * is constant time. Once all the arrangements are performed (on destruction * time) the list is traversed in reverse order and * pointers are swapped and set accordingly so that they recover its * original semantics ( *(node->up())==node ) while retaining the * new order. */ template class random_access_index_loader_base:private noncopyable { protected: typedef typename prevent_eti< Allocator, random_access_index_node_impl< typename boost::detail::allocator::rebind_to< Allocator, char >::type > >::type node_impl_type; typedef typename node_impl_type::pointer node_impl_pointer; typedef random_access_index_ptr_array ptr_array; random_access_index_loader_base(const Allocator& al_,ptr_array& ptrs_): al(al_), ptrs(ptrs_), header(*ptrs.end()), prev_spc(al,0), preprocessed(false) {} ~random_access_index_loader_base() { if(preprocessed) { node_impl_pointer n=header; next(n)=n; for(std::size_t i=ptrs.size();i--;){ n=prev(n); std::size_t d=position(n); if(d!=i){ node_impl_pointer m=prev(next_at(i)); std::swap(m->up(),n->up()); next_at(d)=next_at(i); std::swap(prev_at(d),prev_at(i)); } next(n)=n; } } } void rearrange(node_impl_pointer position,node_impl_pointer x) { preprocess(); /* only incur this penalty if rearrange() is ever called */ if(position==node_impl_pointer(0))position=header; next(prev(x))=next(x); prev(next(x))=prev(x); prev(x)=position; next(x)=next(position); next(prev(x))=prev(next(x))=x; } private: void preprocess() { if(!preprocessed){ /* get space for the auxiliary prev array */ auto_space tmp(al,ptrs.size()+1); prev_spc.swap(tmp); /* prev_spc elements point to the prev nodes */ std::rotate_copy( &*ptrs.begin(),&*ptrs.end(),&*ptrs.end()+1,&*prev_spc.data()); /* ptrs elements point to the next nodes */ std::rotate(&*ptrs.begin(),&*ptrs.begin()+1,&*ptrs.end()+1); preprocessed=true; } } std::size_t position(node_impl_pointer x)const { return (std::size_t)(x->up()-ptrs.begin()); } node_impl_pointer& next_at(std::size_t n)const { return *ptrs.at(n); } node_impl_pointer& prev_at(std::size_t n)const { return *(prev_spc.data()+n); } node_impl_pointer& next(node_impl_pointer x)const { return *(x->up()); } node_impl_pointer& prev(node_impl_pointer x)const { return prev_at(position(x)); } Allocator al; ptr_array& ptrs; node_impl_pointer header; auto_space prev_spc; bool preprocessed; }; template class random_access_index_loader: private random_access_index_loader_base { typedef random_access_index_loader_base super; typedef typename super::node_impl_pointer node_impl_pointer; typedef typename super::ptr_array ptr_array; public: random_access_index_loader(const Allocator& al_,ptr_array& ptrs_): super(al_,ptrs_) {} void rearrange(Node* position,Node *x) { super::rearrange(position?position->impl():node_impl_pointer(0),x->impl()); } }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/has_tag.hpp0000644000000000000000000000007412717644140022730 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/has_tag.hpp0000664000372100037210000000164512717644140023565 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_HAS_TAG_HPP #define BOOST_MULTI_INDEX_DETAIL_HAS_TAG_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include namespace boost{ namespace multi_index{ namespace detail{ /* determines whether an index type has a given tag in its tag list */ template struct has_tag { template struct apply:mpl::contains { }; }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/index_loader.hpp0000644000000000000000000000007412717644140023757 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/index_loader.hpp0000664000372100037210000000654312717644140024616 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_INDEX_LOADER_HPP #define BOOST_MULTI_INDEX_DETAIL_INDEX_LOADER_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include #include #include namespace boost{ namespace multi_index{ namespace detail{ /* Counterpart of index_saver (check index_saver.hpp for serialization * details.)* multi_index_container is in charge of supplying the info about * the base sequence, and each index can subsequently load itself using the * const interface of index_loader. */ template class index_loader:private noncopyable { public: index_loader(const Allocator& al,std::size_t size): spc(al,size),size_(size),n(0),sorted(false) { } template void add(Node* node,Archive& ar,const unsigned int) { ar>>serialization::make_nvp("position",*node); entries()[n++]=node; } template void add_track(Node* node,Archive& ar,const unsigned int) { ar>>serialization::make_nvp("position",*node); } /* A rearranger is passed two nodes, and is expected to * reposition the second after the first. * If the first node is 0, then the second should be moved * to the beginning of the sequence. */ template void load(Rearranger r,Archive& ar,const unsigned int)const { FinalNode* prev=unchecked_load_node(ar); if(!prev)return; if(!sorted){ std::sort(entries(),entries()+size_); sorted=true; } check_node(prev); for(;;){ for(;;){ FinalNode* node=load_node(ar); if(!node)break; if(node==prev)prev=0; r(prev,node); prev=node; } prev=load_node(ar); if(!prev)break; } } private: Node** entries()const{return &*spc.data();} /* We try to delay sorting as much as possible just in case it * is not necessary, hence this version of load_node. */ template FinalNode* unchecked_load_node(Archive& ar)const { Node* node=0; ar>>serialization::make_nvp("pointer",node); return static_cast(node); } template FinalNode* load_node(Archive& ar)const { Node* node=0; ar>>serialization::make_nvp("pointer",node); check_node(node); return static_cast(node); } void check_node(Node* node)const { if(node!=0&&!std::binary_search(entries(),entries()+size_,node)){ throw_exception( archive::archive_exception( archive::archive_exception::other_exception)); } } auto_space spc; std::size_t size_; std::size_t n; mutable bool sorted; }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/converter.hpp0000644000000000000000000000007412717644140023331 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/converter.hpp0000664000372100037210000000253012717644140024160 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_CONVERTER_HPP #define BOOST_MULTI_INDEX_DETAIL_CONVERTER_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif namespace boost{ namespace multi_index{ namespace detail{ /* converter offers means to access indices of a given multi_index_container * and for convertibilty between index iterators, so providing a * localized access point for get() and project() functions. */ template struct converter { static const Index& index(const MultiIndexContainer& x){return x;} static Index& index(MultiIndexContainer& x){return x;} static typename Index::const_iterator const_iterator( const MultiIndexContainer& x,typename MultiIndexContainer::node_type* node) { return x.Index::make_iterator(node); } static typename Index::iterator iterator( MultiIndexContainer& x,typename MultiIndexContainer::node_type* node) { return x.Index::make_iterator(node); } }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/index_saver.hpp0000644000000000000000000000007412717644140023631 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/index_saver.hpp0000664000372100037210000000733512717644140024470 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_INDEX_SAVER_HPP #define BOOST_MULTI_INDEX_DETAIL_INDEX_SAVER_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include namespace boost{ namespace multi_index{ namespace detail{ /* index_saver accepts a base sequence of previously saved elements * and saves a possibly reordered subsequence in an efficient manner, * serializing only the information needed to rearrange the subsequence * based on the original order of the base. * multi_index_container is in charge of supplying the info about the * base sequence, and each index can subsequently save itself using the * const interface of index_saver. */ template class index_saver:private noncopyable { public: index_saver(const Allocator& al,std::size_t size):alg(al,size){} template void add(Node* node,Archive& ar,const unsigned int) { ar< void add_track(Node* node,Archive& ar,const unsigned int) { ar< void save( IndexIterator first,IndexIterator last,Archive& ar, const unsigned int)const { /* calculate ordered positions */ alg.execute(first,last); /* Given a consecutive subsequence of displaced elements * x1,...,xn, the following information is serialized: * * p0,p1,...,pn,0 * * where pi is a pointer to xi and p0 is a pointer to the element * preceding x1. Crealy, from this information is possible to * restore the original order on loading time. If x1 is the first * element in the sequence, the following is serialized instead: * * p1,p1,...,pn,0 * * For each subsequence of n elements, n+2 pointers are serialized. * An optimization policy is applied: consider for instance the * sequence * * a,B,c,D * * where B and D are displaced, but c is in its correct position. * Applying the schema described above we would serialize 6 pointers: * * p(a),p(B),0 * p(c),p(D),0 * * but this can be reduced to 5 pointers by treating c as a displaced * element: * * p(a),p(B),p(c),p(D),0 */ std::size_t last_saved=3; /* distance to last pointer saved */ for(IndexIterator it=first,prev=first;it!=last;prev=it++,++last_saved){ if(!alg.is_ordered(get_node(it))){ if(last_saved>1)save_node(get_node(prev),ar); save_node(get_node(it),ar); last_saved=0; } else if(last_saved==2)save_node(null_node(),ar); } if(last_saved<=2)save_node(null_node(),ar); /* marks the end of the serialization info for [first,last) */ save_node(null_node(),ar); } private: template static Node* get_node(IndexIterator it) { return it.get_node(); } static Node* null_node(){return 0;} template static void save_node(Node* node,Archive& ar) { ar< alg; }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/safe_ctr_proxy.hpp0000644000000000000000000000007412717644140024351 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/safe_ctr_proxy.hpp0000664000372100037210000000617012717644140025204 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_SAFE_CTR_PROXY_HPP #define BOOST_MULTI_INDEX_DETAIL_SAFE_CTR_PROXY_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) #include /* keep it first to prevent nasty warns in MSVC */ #include #if BOOST_WORKAROUND(BOOST_MSVC,<1300) #include namespace boost{ namespace multi_index{ namespace detail{ /* A safe iterator is instantiated in the form * safe_iterator: MSVC++ 6.0 has serious troubles with * the resulting symbols names, given that index names (which stand for * Container) are fairly long themselves. safe_ctr_proxy does not statically * depend on Container, and provides the necessary methods (begin and end) to * the safe mode framework via an abstract interface. With safe_ctr_proxy, * instead of deriving from safe_container the following base class * must be used: * * safe_ctr_proxy_impl * * where Iterator is the type of the *unsafe* iterator being wrapped. * The corresponding safe iterator instantiation is then * * safe_iterator >, * * which does not include the name of Container. */ template class safe_ctr_proxy: public safe_mode::safe_container > { public: typedef safe_mode::safe_iterator iterator; typedef iterator const_iterator; iterator begin(){return begin_impl();} const_iterator begin()const{return begin_impl();} iterator end(){return end_impl();} const_iterator end()const{return end_impl();} protected: virtual iterator begin_impl()=0; virtual const_iterator begin_impl()const=0; virtual iterator end_impl()=0; virtual const_iterator end_impl()const=0; }; template class safe_ctr_proxy_impl:public safe_ctr_proxy { typedef safe_ctr_proxy super; typedef Container container_type; public: typedef typename super::iterator iterator; typedef typename super::const_iterator const_iterator; virtual iterator begin_impl(){return container().begin();} virtual const_iterator begin_impl()const{return container().begin();} virtual iterator end_impl(){return container().end();} virtual const_iterator end_impl()const{return container().end();} private: container_type& container() { return *static_cast(this); } const container_type& container()const { return *static_cast(this); } }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif /* workaround */ #endif /* BOOST_MULTI_INDEX_ENABLE_SAFE_MODE */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/hash_index_args.hpp0000644000000000000000000000007412717644140024450 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/hash_index_args.hpp0000664000372100037210000000601412717644140025300 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_HASH_INDEX_ARGS_HPP #define BOOST_MULTI_INDEX_DETAIL_HASH_INDEX_ARGS_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include #include #include #include #include namespace boost{ namespace multi_index{ namespace detail{ /* Hashed index specifiers can be instantiated in two forms: * * (hashed_unique|hashed_non_unique)< * KeyFromValue, * Hash=boost::hash, * Pred=std::equal_to > * (hashed_unique|hashed_non_unique)< * TagList, * KeyFromValue, * Hash=boost::hash, * Pred=std::equal_to > * * hashed_index_args implements the machinery to accept this * argument-dependent polymorphism. */ template struct index_args_default_hash { typedef ::boost::hash type; }; template struct index_args_default_pred { typedef std::equal_to type; }; template struct hashed_index_args { typedef is_tag full_form; typedef typename mpl::if_< full_form, Arg1, tag< > >::type tag_list_type; typedef typename mpl::if_< full_form, Arg2, Arg1>::type key_from_value_type; typedef typename mpl::if_< full_form, Arg3, Arg2>::type supplied_hash_type; typedef typename mpl::eval_if< mpl::is_na, index_args_default_hash, mpl::identity >::type hash_type; typedef typename mpl::if_< full_form, Arg4, Arg3>::type supplied_pred_type; typedef typename mpl::eval_if< mpl::is_na, index_args_default_pred, mpl::identity >::type pred_type; BOOST_STATIC_ASSERT(is_tag::value); BOOST_STATIC_ASSERT(!mpl::is_na::value); BOOST_STATIC_ASSERT(!mpl::is_na::value); BOOST_STATIC_ASSERT(!mpl::is_na::value); }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/uintptr_type.hpp0000644000000000000000000000007412717644140024070 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/detail/uintptr_type.hpp0000664000372100037210000000464012717644140024723 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_UINTPTR_TYPE_HPP #define BOOST_MULTI_INDEX_DETAIL_UINTPTR_TYPE_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include namespace boost{ namespace multi_index{ namespace detail{ /* has_uintptr_type is an MPL integral constant determining whether * there exists an unsigned integral type with the same size as * void *. * uintptr_type is such a type if has_uintptr is true, or unsigned int * otherwise. * Note that uintptr_type is more restrictive than C99 uintptr_t, * where an integral type with size greater than that of void * * would be conformant. */ templatestruct uintptr_candidates; template<>struct uintptr_candidates<-1>{typedef unsigned int type;}; template<>struct uintptr_candidates<0> {typedef unsigned int type;}; template<>struct uintptr_candidates<1> {typedef unsigned short type;}; template<>struct uintptr_candidates<2> {typedef unsigned long type;}; #if defined(BOOST_HAS_LONG_LONG) template<>struct uintptr_candidates<3> {typedef boost::ulong_long_type type;}; #else template<>struct uintptr_candidates<3> {typedef unsigned int type;}; #endif #if defined(BOOST_HAS_MS_INT64) template<>struct uintptr_candidates<4> {typedef unsigned __int64 type;}; #else template<>struct uintptr_candidates<4> {typedef unsigned int type;}; #endif struct uintptr_aux { BOOST_STATIC_CONSTANT(int,index= sizeof(void*)==sizeof(uintptr_candidates<0>::type)?0: sizeof(void*)==sizeof(uintptr_candidates<1>::type)?1: sizeof(void*)==sizeof(uintptr_candidates<2>::type)?2: sizeof(void*)==sizeof(uintptr_candidates<3>::type)?3: sizeof(void*)==sizeof(uintptr_candidates<4>::type)?4:-1); BOOST_STATIC_CONSTANT(bool,has_uintptr_type=(index>=0)); typedef uintptr_candidates::type type; }; typedef mpl::bool_ has_uintptr_type; typedef uintptr_aux::type uintptr_type; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/unbounded.hpp0000644000000000000000000000007412717644140023305 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/detail/unbounded.hpp0000664000372100037210000000406312717644140024137 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_UNBOUNDED_HPP #define BOOST_MULTI_INDEX_DETAIL_UNBOUNDED_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include namespace boost{ namespace multi_index{ /* dummy type and variable for use in ordered_index::range() */ #if BOOST_WORKAROUND(BOOST_MSVC,<1300) /* The default branch actually works for MSVC 6.0, but seems like * this implementation of unbounded improves the performance of ordered * indices! This behavior is hard to explain and probably a test artifact, * but it does not hurt to have the workaround anyway. */ namespace detail{struct unbounded_type{};} namespace{ static detail::unbounded_type unbounded_obj=detail::unbounded_type(); static detail::unbounded_type& unbounded=unbounded_obj; } /* unnamed */ #else /* ODR-abiding technique shown at the example attached to * http://lists.boost.org/Archives/boost/2006/07/108355.php */ namespace detail{class unbounded_helper;} detail::unbounded_helper unbounded(detail::unbounded_helper); namespace detail{ class unbounded_helper { unbounded_helper(){} unbounded_helper(const unbounded_helper&){} friend unbounded_helper multi_index::unbounded(unbounded_helper); }; typedef unbounded_helper (*unbounded_type)(unbounded_helper); } /* namespace multi_index::detail */ inline detail::unbounded_helper unbounded(detail::unbounded_helper) { return detail::unbounded_helper(); } #endif /* tags used in the implementation of range */ namespace detail{ struct none_unbounded_tag{}; struct lower_unbounded_tag{}; struct upper_unbounded_tag{}; struct both_unbounded_tag{}; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/is_index_list.hpp0000644000000000000000000000007412717644140024157 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/is_index_list.hpp0000664000372100037210000000174412717644140025014 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_IS_INDEX_LIST_HPP #define BOOST_MULTI_INDEX_DETAIL_IS_INDEX_LIST_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include namespace boost{ namespace multi_index{ namespace detail{ template struct is_index_list { BOOST_STATIC_CONSTANT(bool,mpl_sequence=mpl::is_sequence::value); BOOST_STATIC_CONSTANT(bool,non_empty=!mpl::empty::value); BOOST_STATIC_CONSTANT(bool,value=mpl_sequence&&non_empty); }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/iter_adaptor.hpp0000644000000000000000000000007412717644140023777 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/iter_adaptor.hpp0000664000372100037210000001710612717644140024633 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_ITER_ADAPTOR_HPP #define BOOST_MULTI_INDEX_DETAIL_ITER_ADAPTOR_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include namespace boost{ namespace multi_index{ namespace detail{ /* Poor man's version of boost::iterator_adaptor. Used instead of the * original as compile times for the latter are significantly higher. * The interface is not replicated exactly, only to the extent necessary * for internal consumption. */ /* NB. The purpose of the (non-inclass) global operators ==, < and - defined * above is to partially alleviate a problem of MSVC++ 6.0 by * which * friend-injected operators on T are not visible if T is instantiated only * in template code where T is a dependent type. */ class iter_adaptor_access { public: template static typename Class::reference dereference(const Class& x) { return x.dereference(); } template static bool equal(const Class& x,const Class& y) { return x.equal(y); } template static void increment(Class& x) { x.increment(); } template static void decrement(Class& x) { x.decrement(); } template static void advance(Class& x,typename Class::difference_type n) { x.advance(n); } template static typename Class::difference_type distance_to( const Class& x,const Class& y) { return x.distance_to(y); } }; template struct iter_adaptor_selector; template class forward_iter_adaptor_base: public forward_iterator_helper< Derived, typename Base::value_type, typename Base::difference_type, typename Base::pointer, typename Base::reference> { public: typedef typename Base::reference reference; reference operator*()const { return iter_adaptor_access::dereference(final()); } friend bool operator==(const Derived& x,const Derived& y) { return iter_adaptor_access::equal(x,y); } Derived& operator++() { iter_adaptor_access::increment(final()); return final(); } private: Derived& final(){return *static_cast(this);} const Derived& final()const{return *static_cast(this);} }; template bool operator==( const forward_iter_adaptor_base& x, const forward_iter_adaptor_base& y) { return iter_adaptor_access::equal( static_cast(x),static_cast(y)); } template<> struct iter_adaptor_selector { template struct apply { typedef forward_iter_adaptor_base type; }; }; template class bidirectional_iter_adaptor_base: public bidirectional_iterator_helper< Derived, typename Base::value_type, typename Base::difference_type, typename Base::pointer, typename Base::reference> { public: typedef typename Base::reference reference; reference operator*()const { return iter_adaptor_access::dereference(final()); } friend bool operator==(const Derived& x,const Derived& y) { return iter_adaptor_access::equal(x,y); } Derived& operator++() { iter_adaptor_access::increment(final()); return final(); } Derived& operator--() { iter_adaptor_access::decrement(final()); return final(); } private: Derived& final(){return *static_cast(this);} const Derived& final()const{return *static_cast(this);} }; template bool operator==( const bidirectional_iter_adaptor_base& x, const bidirectional_iter_adaptor_base& y) { return iter_adaptor_access::equal( static_cast(x),static_cast(y)); } template<> struct iter_adaptor_selector { template struct apply { typedef bidirectional_iter_adaptor_base type; }; }; template class random_access_iter_adaptor_base: public random_access_iterator_helper< Derived, typename Base::value_type, typename Base::difference_type, typename Base::pointer, typename Base::reference> { public: typedef typename Base::reference reference; typedef typename Base::difference_type difference_type; reference operator*()const { return iter_adaptor_access::dereference(final()); } friend bool operator==(const Derived& x,const Derived& y) { return iter_adaptor_access::equal(x,y); } friend bool operator<(const Derived& x,const Derived& y) { return iter_adaptor_access::distance_to(x,y)>0; } Derived& operator++() { iter_adaptor_access::increment(final()); return final(); } Derived& operator--() { iter_adaptor_access::decrement(final()); return final(); } Derived& operator+=(difference_type n) { iter_adaptor_access::advance(final(),n); return final(); } Derived& operator-=(difference_type n) { iter_adaptor_access::advance(final(),-n); return final(); } friend difference_type operator-(const Derived& x,const Derived& y) { return iter_adaptor_access::distance_to(y,x); } private: Derived& final(){return *static_cast(this);} const Derived& final()const{return *static_cast(this);} }; template bool operator==( const random_access_iter_adaptor_base& x, const random_access_iter_adaptor_base& y) { return iter_adaptor_access::equal( static_cast(x),static_cast(y)); } template bool operator<( const random_access_iter_adaptor_base& x, const random_access_iter_adaptor_base& y) { return iter_adaptor_access::distance_to( static_cast(x),static_cast(y))>0; } template typename random_access_iter_adaptor_base::difference_type operator-( const random_access_iter_adaptor_base& x, const random_access_iter_adaptor_base& y) { return iter_adaptor_access::distance_to( static_cast(y),static_cast(x)); } template<> struct iter_adaptor_selector { template struct apply { typedef random_access_iter_adaptor_base type; }; }; template struct iter_adaptor_base { typedef iter_adaptor_selector< typename Base::iterator_category> selector; typedef typename prevent_eti< selector, typename mpl::apply2< selector,Derived,Base>::type >::type type; }; template class iter_adaptor:public iter_adaptor_base::type { protected: iter_adaptor(){} explicit iter_adaptor(const Base& b_):b(b_){} const Base& base_reference()const{return b;} Base& base_reference(){return b;} private: Base b; }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/msvc_index_specifier.hpp0000644000000000000000000000007412717644140025512 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/msvc_index_specifier.hpp0000664000372100037210000000316512717644140026346 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_MSVC_INDEX_SPECIFIER_HPP #define BOOST_MULTI_INDEX_DETAIL_MSVC_INDEX_SPECIFIER_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #if BOOST_WORKAROUND(BOOST_MSVC,<1310) /* Workaround for a problem in MSVC with dependent template typedefs * when accesing index specifiers. * Modeled after (thanks, Aleksey!) */ #include namespace boost{ namespace multi_index{ namespace detail{ template struct msvc_index_specifier { template struct fake_index_type:IndexSpecifier{}; template<> struct fake_index_type { template struct node_class{}; template struct index_class{}; }; template struct result_node_class: fake_index_type::value>:: template node_class { }; template struct result_index_class: fake_index_type::value>:: template index_class { }; }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif /* workaround */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/seq_index_ops.hpp0000644000000000000000000000007412717644140024162 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/detail/seq_index_ops.hpp0000664000372100037210000001374312717644140025021 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_SEQ_INDEX_OPS_HPP #define BOOST_MULTI_INDEX_DETAIL_SEQ_INDEX_OPS_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include #include namespace boost{ namespace multi_index{ namespace detail{ /* Common code for sequenced_index memfuns having templatized and * non-templatized versions. */ template void sequenced_index_remove(SequencedIndex& x,Predicate pred) { typedef typename SequencedIndex::iterator iterator; iterator first=x.begin(),last=x.end(); while(first!=last){ if(pred(*first))x.erase(first++); else ++first; } } template void sequenced_index_unique(SequencedIndex& x,BinaryPredicate binary_pred) { typedef typename SequencedIndex::iterator iterator; iterator first=x.begin(); iterator last=x.end(); if(first!=last){ for(iterator middle=first;++middle!=last;middle=first){ if(binary_pred(*middle,*first))x.erase(middle); else first=middle; } } } template void sequenced_index_merge(SequencedIndex& x,SequencedIndex& y,Compare comp) { typedef typename SequencedIndex::iterator iterator; if(&x!=&y){ iterator first0=x.begin(),last0=x.end(); iterator first1=y.begin(),last1=y.end(); while(first0!=last0&&first1!=last1){ if(comp(*first1,*first0))x.splice(first0,y,first1++); else ++first0; } x.splice(last0,y,first1,last1); } } /* sorting */ /* auxiliary stuff */ template void sequenced_index_collate( BOOST_DEDUCED_TYPENAME Node::impl_type* x, BOOST_DEDUCED_TYPENAME Node::impl_type* y, Compare comp BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(Node)) { typedef typename Node::impl_type impl_type; typedef typename Node::impl_pointer impl_pointer; impl_pointer first0=x->next(); impl_pointer last0=x; impl_pointer first1=y->next(); impl_pointer last1=y; while(first0!=last0&&first1!=last1){ if(comp( Node::from_impl(first1)->value(),Node::from_impl(first0)->value())){ impl_pointer tmp=first1->next(); impl_type::relink(first0,first1); first1=tmp; } else first0=first0->next(); } impl_type::relink(last0,first1,last1); } /* Some versions of CGG require a bogus typename in counter_spc * inside sequenced_index_sort if the following is defined * also inside sequenced_index_sort. */ BOOST_STATIC_CONSTANT( std::size_t, sequenced_index_sort_max_fill= (std::size_t)std::numeric_limits::digits+1); template void sequenced_index_sort(Node* header,Compare comp) { /* Musser's mergesort, see http://www.cs.rpi.edu/~musser/gp/List/lists1.html. * The implementation is a little convoluted: in the original code * counter elements and carry are std::lists: here we do not want * to use multi_index instead, so we do things at a lower level, managing * directly the internal node representation. * Incidentally, the implementations I've seen of this algorithm (SGI, * Dinkumware, STLPort) are not exception-safe: this is. Moreover, we do not * use any dynamic storage. */ if(header->next()==header->impl()|| header->next()->next()==header->impl())return; typedef typename Node::impl_type impl_type; typedef typename Node::impl_pointer impl_pointer; typedef typename aligned_storage< sizeof(impl_type), alignment_of::value >::type carry_spc_type; carry_spc_type carry_spc; impl_type& carry= *static_cast(static_cast(&carry_spc)); typedef typename aligned_storage< sizeof( impl_type [sequenced_index_sort_max_fill]), alignment_of< impl_type [sequenced_index_sort_max_fill] >::value >::type counter_spc_type; counter_spc_type counter_spc; impl_type* counter= static_cast(static_cast(&counter_spc)); std::size_t fill=0; carry.prior()=carry.next()=static_cast(&carry); counter[0].prior()=counter[0].next()=static_cast(&counter[0]); BOOST_TRY{ while(header->next()!=header->impl()){ impl_type::relink(carry.next(),header->next()); std::size_t i=0; while(i(&counter[i])){ sequenced_index_collate(&carry,&counter[i++],comp); } impl_type::swap( static_cast(&carry), static_cast(&counter[i])); if(i==fill){ ++fill; counter[fill].prior()=counter[fill].next()= static_cast(&counter[fill]); } } for(std::size_t i=1;i(&counter[i],&counter[i-1],comp); } impl_type::swap( header->impl(),static_cast(&counter[fill-1])); } BOOST_CATCH(...) { impl_type::relink( header->impl(),carry.next(),static_cast(&carry)); for(std::size_t i=0;i<=fill;++i){ impl_type::relink( header->impl(),counter[i].next(), static_cast(&counter[i])); } BOOST_RETHROW; } BOOST_CATCH_END } } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/access_specifier.hpp0000644000000000000000000000007412717644140024614 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.093552501 madp-0.4/src/boost/boost/multi_index/detail/access_specifier.hpp0000664000372100037210000000417312717644140025450 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_ACCESS_SPECIFIER_HPP #define BOOST_MULTI_INDEX_DETAIL_ACCESS_SPECIFIER_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include #include /* In those compilers that do not accept the member template friend syntax, * some protected and private sections might need to be specified as * public. */ #if defined(BOOST_NO_MEMBER_TEMPLATE_FRIENDS) #define BOOST_MULTI_INDEX_PROTECTED_IF_MEMBER_TEMPLATE_FRIENDS public #define BOOST_MULTI_INDEX_PRIVATE_IF_MEMBER_TEMPLATE_FRIENDS public #else #define BOOST_MULTI_INDEX_PROTECTED_IF_MEMBER_TEMPLATE_FRIENDS protected #define BOOST_MULTI_INDEX_PRIVATE_IF_MEMBER_TEMPLATE_FRIENDS private #endif /* GCC does not correctly support in-class using declarations for template * functions. See http://gcc.gnu.org/bugzilla/show_bug.cgi?id=9810 * MSVC 7.1/8.0 seem to have a similar problem, though the conditions in * which the error happens are not that simple. I have yet to isolate this * into a snippet suitable for bug reporting. * Sun Studio also has this problem, which might be related, from the * information gathered at Sun forums, with a known issue notified at the * internal bug report 6421933. The bug is present up to Studio Express 2, * the latest preview version of the future Sun Studio 12. As of this writing * (October 2006) it is not known whether a fix will finally make it into the * official Sun Studio 12. */ #if BOOST_WORKAROUND(__GNUC__, <3)||\ BOOST_WORKAROUND(__GNUC__,==3)&&(__GNUC_MINOR__<4)||\ BOOST_WORKAROUND(BOOST_MSVC,==1310)||\ BOOST_WORKAROUND(BOOST_MSVC,==1400)||\ BOOST_WORKAROUND(__SUNPRO_CC,BOOST_TESTED_AT(0x590)) #define BOOST_MULTI_INDEX_PRIVATE_IF_USING_DECL_FOR_TEMPL_FUNCTIONS public #else #define BOOST_MULTI_INDEX_PRIVATE_IF_USING_DECL_FOR_TEMPL_FUNCTIONS private #endif #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/node_type.hpp0000644000000000000000000000007412717644140023310 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/node_type.hpp0000664000372100037210000000413512717644140024142 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_NODE_TYPE_HPP #define BOOST_MULTI_INDEX_DETAIL_NODE_TYPE_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include #include #include #include #include #include namespace boost{ namespace multi_index{ namespace detail{ /* MPL machinery to construct the internal node type associated to an * index list. */ #if BOOST_WORKAROUND(BOOST_MSVC,<1310) struct index_node_applier { template struct apply: msvc_index_specifier< mpl::deref::type >:: template result_node_class { }; }; #else struct index_node_applier { template struct apply { typedef typename mpl::deref::type index_specifier; typedef typename index_specifier:: BOOST_NESTED_TEMPLATE node_class::type type; }; }; #endif template struct multi_index_node_type { BOOST_STATIC_ASSERT(detail::is_index_list::value); typedef typename mpl::reverse_iter_fold< IndexSpecifierList, index_node_base, mpl::bind2 >::type type; }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/hash_index_node.hpp0000644000000000000000000000007412717644140024441 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/hash_index_node.hpp0000664000372100037210000000730712717644140025277 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_HASH_INDEX_NODE_HPP #define BOOST_MULTI_INDEX_DETAIL_HASH_INDEX_NODE_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include namespace boost{ namespace multi_index{ namespace detail{ /* singly-linked node for use by hashed_index */ template struct hashed_index_node_impl { typedef typename prevent_eti< Allocator, typename boost::detail::allocator::rebind_to< Allocator,hashed_index_node_impl >::type >::type::pointer pointer; typedef typename prevent_eti< Allocator, typename boost::detail::allocator::rebind_to< Allocator,hashed_index_node_impl >::type >::type::const_pointer const_pointer; pointer& next(){return next_;} pointer next()const{return next_;} /* algorithmic stuff */ static void increment(pointer& x,pointer bbegin,pointer bend) { std::less_equal leq; x=x->next(); if(leq(bbegin,x)&&leq(x,bend)){ /* bucket node */ do{ ++x; }while(x->next()==x); x=x->next(); } } static void link(pointer x,pointer pos) { x->next()=pos->next(); pos->next()=x; }; static void unlink(pointer x) { pointer y=x->next(); while(y->next()!=x){y=y->next();} y->next()=x->next(); } static pointer prev(pointer x) { pointer y=x->next(); while(y->next()!=x){y=y->next();} return y; } static void unlink_next(pointer x) { x->next()=x->next()->next(); } private: pointer next_; }; template struct hashed_index_node_trampoline: prevent_eti< Super, hashed_index_node_impl< typename boost::detail::allocator::rebind_to< typename Super::allocator_type, char >::type > >::type { typedef typename prevent_eti< Super, hashed_index_node_impl< typename boost::detail::allocator::rebind_to< typename Super::allocator_type, char >::type > >::type impl_type; }; template struct hashed_index_node:Super,hashed_index_node_trampoline { private: typedef hashed_index_node_trampoline trampoline; public: typedef typename trampoline::impl_type impl_type; typedef typename trampoline::pointer impl_pointer; typedef typename trampoline::const_pointer const_impl_pointer; impl_pointer impl() { return static_cast( static_cast(static_cast(this))); } const_impl_pointer impl()const { return static_cast( static_cast(static_cast(this))); } static hashed_index_node* from_impl(impl_pointer x) { return static_cast( static_cast(&*x)); } static const hashed_index_node* from_impl(const_impl_pointer x) { return static_cast( static_cast(&*x)); } static void increment( hashed_index_node*& x,impl_pointer bbegin,impl_pointer bend) { impl_pointer xi=x->impl(); trampoline::increment(xi,bbegin,bend); x=from_impl(xi); } }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/rnd_index_ops.hpp0000644000000000000000000000007412717644140024155 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/rnd_index_ops.hpp0000664000372100037210000001407012717644140025006 0ustar00fransfrans00000000000000/* Copyright 2003-2009 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_RND_INDEX_OPS_HPP #define BOOST_MULTI_INDEX_DETAIL_RND_INDEX_OPS_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include namespace boost{ namespace multi_index{ namespace detail{ /* Common code for random_access_index memfuns having templatized and * non-templatized versions. */ template Node* random_access_index_remove( random_access_index_ptr_array& ptrs,Predicate pred BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(Node)) { typedef typename Node::value_type value_type; typedef typename Node::impl_ptr_pointer impl_ptr_pointer; impl_ptr_pointer first=ptrs.begin(), res=first, last=ptrs.end(); for(;first!=last;++first){ if(!pred( const_cast(Node::from_impl(*first)->value()))){ if(first!=res){ std::swap(*first,*res); (*first)->up()=first; (*res)->up()=res; } ++res; } } return Node::from_impl(*res); } template Node* random_access_index_unique( random_access_index_ptr_array& ptrs,BinaryPredicate binary_pred BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(Node)) { typedef typename Node::value_type value_type; typedef typename Node::impl_ptr_pointer impl_ptr_pointer; impl_ptr_pointer first=ptrs.begin(), res=first, last=ptrs.end(); if(first!=last){ for(;++first!=last;){ if(!binary_pred( const_cast(Node::from_impl(*res)->value()), const_cast(Node::from_impl(*first)->value()))){ ++res; if(first!=res){ std::swap(*first,*res); (*first)->up()=first; (*res)->up()=res; } } } ++res; } return Node::from_impl(*res); } template void random_access_index_inplace_merge( const Allocator& al, random_access_index_ptr_array& ptrs, BOOST_DEDUCED_TYPENAME Node::impl_ptr_pointer first1,Compare comp BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(Node)) { typedef typename Node::value_type value_type; typedef typename Node::impl_pointer impl_pointer; typedef typename Node::impl_ptr_pointer impl_ptr_pointer; auto_space spc(al,ptrs.size()); impl_ptr_pointer first0=ptrs.begin(), last0=first1, last1=ptrs.end(), out=spc.data(); while(first0!=last0&&first1!=last1){ if(comp( const_cast(Node::from_impl(*first1)->value()), const_cast(Node::from_impl(*first0)->value()))){ *out++=*first1++; } else{ *out++=*first0++; } } std::copy(&*first0,&*last0,&*out); std::copy(&*first1,&*last1,&*out); first1=ptrs.begin(); out=spc.data(); while(first1!=last1){ *first1=*out++; (*first1)->up()=first1; ++first1; } } /* sorting */ /* auxiliary stuff */ template struct random_access_index_sort_compare: std::binary_function< typename Node::impl_pointer, typename Node::impl_pointer,bool> { random_access_index_sort_compare(Compare comp_=Compare()):comp(comp_){} bool operator()( typename Node::impl_pointer x,typename Node::impl_pointer y)const { typedef typename Node::value_type value_type; return comp( const_cast(Node::from_impl(x)->value()), const_cast(Node::from_impl(y)->value())); } private: Compare comp; }; template void random_access_index_sort( const Allocator& al, random_access_index_ptr_array& ptrs, Compare comp BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(Node)) { /* The implementation is extremely simple: an auxiliary * array of pointers is sorted using stdlib facilities and * then used to rearrange the index. This is suboptimal * in space and time, but has some advantages over other * possible approaches: * - Use std::stable_sort() directly on ptrs using some * special iterator in charge of maintaining pointers * and up() pointers in sync: we cannot guarantee * preservation of the container invariants in the face of * exceptions, if, for instance, std::stable_sort throws * when ptrs transitorily contains duplicate elements. * - Rewrite the internal algorithms of std::stable_sort * adapted for this case: besides being a fair amount of * work, making a stable sort compatible with Boost.MultiIndex * invariants (basically, no duplicates or missing elements * even if an exception is thrown) is complicated, error-prone * and possibly won't perform much better than the * solution adopted. */ if(ptrs.size()<=1)return; typedef typename Node::value_type value_type; typedef typename Node::impl_pointer impl_pointer; typedef typename Node::impl_ptr_pointer impl_ptr_pointer; typedef random_access_index_sort_compare< Node,Compare> ptr_compare; impl_ptr_pointer first=ptrs.begin(); impl_ptr_pointer last=ptrs.end(); auto_space< impl_pointer, Allocator> spc(al,ptrs.size()); impl_ptr_pointer buf=spc.data(); std::copy(&*first,&*last,&*buf); std::stable_sort(&*buf,&*buf+ptrs.size(),ptr_compare(comp)); while(first!=last){ *first=*buf++; (*first)->up()=first; ++first; } } } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/vartempl_support.hpp0000644000000000000000000000007412717644140024750 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/detail/vartempl_support.hpp0000664000372100037210000002534712717644140025612 0ustar00fransfrans00000000000000/* Copyright 2003-2013 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_VARTEMPL_SUPPORT_HPP #define BOOST_MULTI_INDEX_DETAIL_VARTEMPL_SUPPORT_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif /* Utilities for emulation of variadic template functions. Variadic packs are * replaced by lists of BOOST_MULTI_INDEX_LIMIT_VARTEMPL_ARGS parameters: * * - typename... Args --> BOOST_MULTI_INDEX_TEMPLATE_PARAM_PACK * - Args&&... args --> BOOST_MULTI_INDEX_FUNCTION_PARAM_PACK * - std::forward(args)... --> BOOST_MULTI_INDEX_FORWARD_PARAM_PACK * * Forwarding emulated with Boost.Move. A template functions foo_imp * defined in such way accepts *exactly* BOOST_MULTI_INDEX_LIMIT_VARTEMPL_ARGS * arguments: variable number of arguments is emulated by providing a set of * overloads foo forwarding to foo_impl with * * BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL * BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL_EXTRA_ARG (initial extra arg) * * which fill the extra args with boost::multi_index::detail::noarg's. * boost::multi_index::detail::vartempl_placement_new works the opposite * way: it acceps a full a pointer x to Value and a * BOOST_MULTI_INDEX_FUNCTION_PARAM_PACK and forwards to * new(x) Value(args) where args is the argument pack after discarding * noarg's. * * Emulation decays to the real thing when the compiler supports variadic * templates and move semantics natively. */ #include #if defined(BOOST_NO_CXX11_RVALUE_REFERENCES)||\ defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #if !defined(BOOST_MULTI_INDEX_LIMIT_VARTEMPL_ARGS) #define BOOST_MULTI_INDEX_LIMIT_VARTEMPL_ARGS 5 #endif #define BOOST_MULTI_INDEX_TEMPLATE_PARAM_PACK \ BOOST_PP_ENUM_PARAMS( \ BOOST_MULTI_INDEX_LIMIT_VARTEMPL_ARGS,typename T) #define BOOST_MULTI_INDEX_VARTEMPL_ARG(z,n,_) \ BOOST_FWD_REF(BOOST_PP_CAT(T,n)) BOOST_PP_CAT(t,n) #define BOOST_MULTI_INDEX_FUNCTION_PARAM_PACK \ BOOST_PP_ENUM( \ BOOST_MULTI_INDEX_LIMIT_VARTEMPL_ARGS, \ BOOST_MULTI_INDEX_VARTEMPL_ARG,~) #define BOOST_MULTI_INDEX_VARTEMPL_FORWARD_ARG(z,n,_) \ boost::forward(BOOST_PP_CAT(t,n)) #define BOOST_MULTI_INDEX_FORWARD_PARAM_PACK \ BOOST_PP_ENUM( \ BOOST_MULTI_INDEX_LIMIT_VARTEMPL_ARGS, \ BOOST_MULTI_INDEX_VARTEMPL_FORWARD_ARG,~) namespace boost{namespace multi_index{namespace detail{ struct noarg{}; }}} /* call vartempl function without args */ #define BOOST_MULTI_INDEX_NULL_PARAM_PACK \ BOOST_PP_ENUM_PARAMS( \ BOOST_MULTI_INDEX_LIMIT_VARTEMPL_ARGS, \ boost::multi_index::detail::noarg() BOOST_PP_INTERCEPT) #define BOOST_MULTI_INDEX_TEMPLATE_N(n) \ template #define BOOST_MULTI_INDEX_TEMPLATE_0(n) #define BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL_AUX(z,n,data) \ BOOST_PP_IF(n, \ BOOST_MULTI_INDEX_TEMPLATE_N, \ BOOST_MULTI_INDEX_TEMPLATE_0)(n) \ BOOST_PP_SEQ_ELEM(0,data) /* ret */ \ BOOST_PP_SEQ_ELEM(1,data) /* name_from */ ( \ BOOST_PP_ENUM(n,BOOST_MULTI_INDEX_VARTEMPL_ARG,~)) \ { \ return BOOST_PP_SEQ_ELEM(2,data) /* name_to */ ( \ BOOST_PP_ENUM(n,BOOST_MULTI_INDEX_VARTEMPL_FORWARD_ARG,~) \ BOOST_PP_COMMA_IF( \ BOOST_PP_AND( \ n,BOOST_PP_SUB(BOOST_MULTI_INDEX_LIMIT_VARTEMPL_ARGS,n))) \ BOOST_PP_ENUM_PARAMS( \ BOOST_PP_SUB(BOOST_MULTI_INDEX_LIMIT_VARTEMPL_ARGS,n), \ boost::multi_index::detail::noarg() BOOST_PP_INTERCEPT) \ ); \ } #define BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL( \ ret,name_from,name_to) \ BOOST_PP_REPEAT_FROM_TO( \ 0,BOOST_PP_ADD(BOOST_MULTI_INDEX_LIMIT_VARTEMPL_ARGS,1), \ BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL_AUX, \ (ret)(name_from)(name_to)) #define BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL_EXTRA_ARG_AUX( \ z,n,data) \ BOOST_PP_IF(n, \ BOOST_MULTI_INDEX_TEMPLATE_N, \ BOOST_MULTI_INDEX_TEMPLATE_0)(n) \ BOOST_PP_SEQ_ELEM(0,data) /* ret */ \ BOOST_PP_SEQ_ELEM(1,data) /* name_from */ ( \ BOOST_PP_SEQ_ELEM(3,data) BOOST_PP_SEQ_ELEM(4,data) /* extra arg */\ BOOST_PP_COMMA_IF(n) \ BOOST_PP_ENUM(n,BOOST_MULTI_INDEX_VARTEMPL_ARG,~)) \ { \ return BOOST_PP_SEQ_ELEM(2,data) /* name_to */ ( \ BOOST_PP_SEQ_ELEM(4,data) /* extra_arg_name */ \ BOOST_PP_COMMA_IF(n) \ BOOST_PP_ENUM(n,BOOST_MULTI_INDEX_VARTEMPL_FORWARD_ARG,~) \ BOOST_PP_COMMA_IF( \ BOOST_PP_SUB(BOOST_MULTI_INDEX_LIMIT_VARTEMPL_ARGS,n)) \ BOOST_PP_ENUM_PARAMS( \ BOOST_PP_SUB(BOOST_MULTI_INDEX_LIMIT_VARTEMPL_ARGS,n), \ boost::multi_index::detail::noarg() BOOST_PP_INTERCEPT) \ ); \ } #define BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL_EXTRA_ARG( \ ret,name_from,name_to,extra_arg_type,extra_arg_name) \ BOOST_PP_REPEAT_FROM_TO( \ 0,BOOST_PP_ADD(BOOST_MULTI_INDEX_LIMIT_VARTEMPL_ARGS,1), \ BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL_EXTRA_ARG_AUX, \ (ret)(name_from)(name_to)(extra_arg_type)(extra_arg_name)) namespace boost{ namespace multi_index{ namespace detail{ #define BOOST_MULTI_INDEX_VARTEMPL_TO_PLACEMENT_NEW_AUX(z,n,name) \ template< \ typename Value \ BOOST_PP_COMMA_IF(n) \ BOOST_PP_ENUM_PARAMS(n,typename T) \ > \ Value* name( \ Value* x \ BOOST_PP_COMMA_IF(n) \ BOOST_PP_ENUM(n,BOOST_MULTI_INDEX_VARTEMPL_ARG,~) \ BOOST_PP_COMMA_IF( \ BOOST_PP_SUB(BOOST_MULTI_INDEX_LIMIT_VARTEMPL_ARGS,n)) \ BOOST_PP_ENUM_PARAMS( \ BOOST_PP_SUB(BOOST_MULTI_INDEX_LIMIT_VARTEMPL_ARGS,n), \ BOOST_FWD_REF(noarg) BOOST_PP_INTERCEPT)) \ { \ return new(x) Value( \ BOOST_PP_ENUM(n,BOOST_MULTI_INDEX_VARTEMPL_FORWARD_ARG,~)); \ } #define BOOST_MULTI_INDEX_VARTEMPL_TO_PLACEMENT_NEW(name) \ BOOST_PP_REPEAT_FROM_TO( \ 0,BOOST_PP_ADD(BOOST_MULTI_INDEX_LIMIT_VARTEMPL_ARGS,1), \ BOOST_MULTI_INDEX_VARTEMPL_TO_PLACEMENT_NEW_AUX, \ name) BOOST_MULTI_INDEX_VARTEMPL_TO_PLACEMENT_NEW(vartempl_placement_new) #undef BOOST_MULTI_INDEX_VARTEMPL_TO_PLACEMENT_NEW_AUX #undef BOOST_MULTI_INDEX_VARTEMPL_TO_PLACEMENT_NEW } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #else /* native variadic templates support */ #include #define BOOST_MULTI_INDEX_TEMPLATE_PARAM_PACK typename... Args #define BOOST_MULTI_INDEX_FUNCTION_PARAM_PACK Args&&... args #define BOOST_MULTI_INDEX_FORWARD_PARAM_PACK std::forward(args)... #define BOOST_MULTI_INDEX_NULL_PARAM_PACK #define BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL( \ ret,name_from,name_to) \ template ret name_from(Args&&... args) \ { \ return name_to(std::forward(args)...); \ } #define BOOST_MULTI_INDEX_OVERLOADS_TO_VARTEMPL_EXTRA_ARG( \ ret,name_from,name_to,extra_arg_type,extra_arg_name) \ template ret name_from( \ extra_arg_type extra_arg_name,Args&&... args) \ { \ return name_to(extra_arg_name,std::forward(args)...); \ } namespace boost{ namespace multi_index{ namespace detail{ template Value* vartempl_placement_new(Value*x,Args&&... args) { return new(x) Value(std::forward(args)...); } } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/no_duplicate_tags.hpp0000644000000000000000000000007412717644140025006 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/no_duplicate_tags.hpp0000664000372100037210000000426712717644140025646 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_NO_DUPLICATE_TAGS_HPP #define BOOST_MULTI_INDEX_DETAIL_NO_DUPLICATE_TAGS_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include namespace boost{ namespace multi_index{ namespace detail{ /* no_duplicate_tags check at compile-time that a tag list * has no duplicate tags. * The algorithm deserves some explanation: tags * are sequentially inserted into a mpl::set if they were * not already present. Due to the magic of mpl::set * (mpl::has_key is contant time), this operation takes linear * time, and even MSVC++ 6.5 handles it gracefully (other obvious * solutions are quadratic.) */ struct duplicate_tag_mark{}; struct duplicate_tag_marker { template struct apply { typedef mpl::s_item< typename mpl::if_,duplicate_tag_mark,Tag>::type, MplSet > type; }; }; template struct no_duplicate_tags { typedef typename mpl::fold< TagList, mpl::set0<>, duplicate_tag_marker >::type aux; BOOST_STATIC_CONSTANT( bool,value=!(mpl::has_key::value)); }; /* Variant for an index list: duplication is checked * across all the indices. */ struct duplicate_tag_list_marker { template struct apply:mpl::fold< BOOST_DEDUCED_TYPENAME Index::tag_list, MplSet, duplicate_tag_marker> { }; }; template struct no_duplicate_tags_in_index_list { typedef typename mpl::fold< IndexList, mpl::set0<>, duplicate_tag_list_marker >::type aux; BOOST_STATIC_CONSTANT( bool,value=!(mpl::has_key::value)); }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/modify_key_adaptor.hpp0000644000000000000000000000007412717644140025173 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/modify_key_adaptor.hpp0000664000372100037210000000207412717644140026025 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_MODIFY_KEY_ADAPTOR_HPP #define BOOST_MULTI_INDEX_DETAIL_MODIFY_KEY_ADAPTOR_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif namespace boost{ namespace multi_index{ namespace detail{ /* Functional adaptor to resolve modify_key as a call to modify. * Preferred over compose_f_gx and stuff cause it eliminates problems * with references to references, dealing with function pointers, etc. */ template struct modify_key_adaptor { modify_key_adaptor(Fun f_,KeyFromValue kfv_):f(f_),kfv(kfv_){} void operator()(Value& x) { f(kfv(x)); } private: Fun f; KeyFromValue kfv; }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/archive_constructed.hpp0000644000000000000000000000007412717644140025360 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.093552501 madp-0.4/src/boost/boost/multi_index/detail/archive_constructed.hpp0000664000372100037210000000354712717644140026220 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_ARCHIVE_CONSTRUCTED_HPP #define BOOST_MULTI_INDEX_DETAIL_ARCHIVE_CONSTRUCTED_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include namespace boost{ namespace multi_index{ namespace detail{ /* constructs a stack-based object from a serialization archive */ template struct archive_constructed:private noncopyable { template archive_constructed(Archive& ar,const unsigned int version) { serialization::load_construct_data_adl(ar,&get(),version); BOOST_TRY{ ar>>get(); } BOOST_CATCH(...){ (&get())->~T(); BOOST_RETHROW; } BOOST_CATCH_END } template archive_constructed(const char* name,Archive& ar,const unsigned int version) { serialization::load_construct_data_adl(ar,&get(),version); BOOST_TRY{ ar>>serialization::make_nvp(name,get()); } BOOST_CATCH(...){ (&get())->~T(); BOOST_RETHROW; } BOOST_CATCH_END } ~archive_constructed() { (&get())->~T(); } T& get(){return *static_cast(static_cast(&space));} private: typename aligned_storage::value>::type space; }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/base_type.hpp0000644000000000000000000000007412717644140023275 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.093552501 madp-0.4/src/boost/boost/multi_index/detail/base_type.hpp0000664000372100037210000000442112717644140024125 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_BASE_TYPE_HPP #define BOOST_MULTI_INDEX_DETAIL_BASE_TYPE_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include #include #include #include namespace boost{ namespace multi_index{ namespace detail{ /* MPL machinery to construct a linear hierarchy of indices out of * a index list. */ #if BOOST_WORKAROUND(BOOST_MSVC,<1310) struct index_applier { template struct apply: msvc_index_specifier:: template result_index_class { }; }; #else struct index_applier { template struct apply { typedef typename IndexSpecifierMeta::type index_specifier; typedef typename index_specifier:: BOOST_NESTED_TEMPLATE index_class::type type; }; }; #endif template struct nth_layer { BOOST_STATIC_CONSTANT(int,length=mpl::size::value); typedef typename mpl::eval_if_c< N==length, mpl::identity >, mpl::apply2< index_applier, mpl::at_c, nth_layer > >::type type; }; template struct multi_index_base_type:nth_layer<0,Value,IndexSpecifierList,Allocator> { BOOST_STATIC_ASSERT(detail::is_index_list::value); }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/adl_swap.hpp0000644000000000000000000000007412717644140023114 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.093552501 madp-0.4/src/boost/boost/multi_index/detail/adl_swap.hpp0000664000372100037210000000155412717644140023750 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_ADL_SWAP_HPP #define BOOST_MULTI_INDEX_DETAIL_ADL_SWAP_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include namespace boost{ namespace multi_index{ namespace detail{ template void adl_swap(T& x,T& y) { #if !defined(BOOST_FUNCTION_SCOPE_USING_DECLARATION_BREAKS_ADL) using std::swap; swap(x,y); #else std::swap(x,y); #endif } } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/ord_index_ops.hpp0000644000000000000000000000007412717644140024156 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/ord_index_ops.hpp0000664000372100037210000000766212717644140025020 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. * * The internal implementation of red-black trees is based on that of SGI STL * stl_tree.h file: * * Copyright (c) 1996,1997 * Silicon Graphics Computer Systems, Inc. * * Permission to use, copy, modify, distribute and sell this software * and its documentation for any purpose is hereby granted without fee, * provided that the above copyright notice appear in all copies and * that both that copyright notice and this permission notice appear * in supporting documentation. Silicon Graphics makes no * representations about the suitability of this software for any * purpose. It is provided "as is" without express or implied warranty. * * * Copyright (c) 1994 * Hewlett-Packard Company * * Permission to use, copy, modify, distribute and sell this software * and its documentation for any purpose is hereby granted without fee, * provided that the above copyright notice appear in all copies and * that both that copyright notice and this permission notice appear * in supporting documentation. Hewlett-Packard Company makes no * representations about the suitability of this software for any * purpose. It is provided "as is" without express or implied warranty. * */ #ifndef BOOST_MULTI_INDEX_DETAIL_ORD_INDEX_OPS_HPP #define BOOST_MULTI_INDEX_DETAIL_ORD_INDEX_OPS_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include namespace boost{ namespace multi_index{ namespace detail{ /* Common code for index memfuns having templatized and * non-templatized versions. */ template< typename Node,typename KeyFromValue, typename CompatibleKey,typename CompatibleCompare > inline Node* ordered_index_find( Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x, const CompatibleCompare& comp) { Node* y0=y; while (top){ if(!comp(key(top->value()),x)){ y=top; top=Node::from_impl(top->left()); } else top=Node::from_impl(top->right()); } return (y==y0||comp(x,key(y->value())))?y0:y; } template< typename Node,typename KeyFromValue, typename CompatibleKey,typename CompatibleCompare > inline Node* ordered_index_lower_bound( Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x, const CompatibleCompare& comp) { while(top){ if(!comp(key(top->value()),x)){ y=top; top=Node::from_impl(top->left()); } else top=Node::from_impl(top->right()); } return y; } template< typename Node,typename KeyFromValue, typename CompatibleKey,typename CompatibleCompare > inline Node* ordered_index_upper_bound( Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x, const CompatibleCompare& comp) { while(top){ if(comp(x,key(top->value()))){ y=top; top=Node::from_impl(top->left()); } else top=Node::from_impl(top->right()); } return y; } template< typename Node,typename KeyFromValue, typename CompatibleKey,typename CompatibleCompare > inline std::pair ordered_index_equal_range( Node* top,Node* y,const KeyFromValue& key,const CompatibleKey& x, const CompatibleCompare& comp) { while(top){ if(comp(key(top->value()),x)){ top=Node::from_impl(top->right()); } else if(comp(x,key(top->value()))){ y=top; top=Node::from_impl(top->left()); } else{ return std::pair( ordered_index_lower_bound(Node::from_impl(top->left()),top,key,x,comp), ordered_index_upper_bound(Node::from_impl(top->right()),y,key,x,comp)); } } return std::pair(y,y); } } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/rnd_index_node.hpp0000644000000000000000000000007412717644140024301 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/rnd_index_node.hpp0000664000372100037210000001430512717644140025133 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_RND_INDEX_NODE_HPP #define BOOST_MULTI_INDEX_DETAIL_RND_INDEX_NODE_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include #include namespace boost{ namespace multi_index{ namespace detail{ template struct random_access_index_node_impl { typedef typename prevent_eti< Allocator, typename boost::detail::allocator::rebind_to< Allocator,random_access_index_node_impl >::type >::type::pointer pointer; typedef typename prevent_eti< Allocator, typename boost::detail::allocator::rebind_to< Allocator,random_access_index_node_impl >::type >::type::const_pointer const_pointer; typedef typename prevent_eti< Allocator, typename boost::detail::allocator::rebind_to< Allocator,pointer >::type >::type::pointer ptr_pointer; ptr_pointer& up(){return up_;} ptr_pointer up()const{return up_;} /* interoperability with rnd_node_iterator */ static void increment(pointer& x) { x=*(x->up()+1); } static void decrement(pointer& x) { x=*(x->up()-1); } static void advance(pointer& x,std::ptrdiff_t n) { x=*(x->up()+n); } static std::ptrdiff_t distance(pointer x,pointer y) { return y->up()-x->up(); } /* algorithmic stuff */ static void relocate(ptr_pointer pos,ptr_pointer x) { pointer n=*x; if(xup()=pos-1; } else{ while(x!=pos){ *x=*(x-1); (*x)->up()=x; --x; } *pos=n; n->up()=pos; } }; static void relocate(ptr_pointer pos,ptr_pointer first,ptr_pointer last) { ptr_pointer begin,middle,end; if(posup()=begin+j; break; } else{ *(begin+j)=*(begin+k); (*(begin+j))->up()=begin+j; } if(kup()=begin+k; break; } else{ *(begin+k)=*(begin+j); (*(begin+k))->up()=begin+k; } } } }; static void extract(ptr_pointer x,ptr_pointer pend) { --pend; while(x!=pend){ *x=*(x+1); (*x)->up()=x; ++x; } } static void transfer( ptr_pointer pbegin0,ptr_pointer pend0,ptr_pointer pbegin1) { while(pbegin0!=pend0){ *pbegin1=*pbegin0++; (*pbegin1)->up()=pbegin1; ++pbegin1; } } static void reverse(ptr_pointer pbegin,ptr_pointer pend) { std::ptrdiff_t d=(pend-pbegin)/2; for(std::ptrdiff_t i=0;iup()=pbegin; (*pend)->up()=pend; ++pbegin; } } private: ptr_pointer up_; }; template struct random_access_index_node_trampoline: prevent_eti< Super, random_access_index_node_impl< typename boost::detail::allocator::rebind_to< typename Super::allocator_type, char >::type > >::type { typedef typename prevent_eti< Super, random_access_index_node_impl< typename boost::detail::allocator::rebind_to< typename Super::allocator_type, char >::type > >::type impl_type; }; template struct random_access_index_node: Super,random_access_index_node_trampoline { private: typedef random_access_index_node_trampoline trampoline; public: typedef typename trampoline::impl_type impl_type; typedef typename trampoline::pointer impl_pointer; typedef typename trampoline::const_pointer const_impl_pointer; typedef typename trampoline::ptr_pointer impl_ptr_pointer; impl_ptr_pointer& up(){return trampoline::up();} impl_ptr_pointer up()const{return trampoline::up();} impl_pointer impl() { return static_cast( static_cast(static_cast(this))); } const_impl_pointer impl()const { return static_cast( static_cast(static_cast(this))); } static random_access_index_node* from_impl(impl_pointer x) { return static_cast( static_cast(&*x)); } static const random_access_index_node* from_impl(const_impl_pointer x) { return static_cast( static_cast(&*x)); } /* interoperability with rnd_node_iterator */ static void increment(random_access_index_node*& x) { impl_pointer xi=x->impl(); trampoline::increment(xi); x=from_impl(xi); } static void decrement(random_access_index_node*& x) { impl_pointer xi=x->impl(); trampoline::decrement(xi); x=from_impl(xi); } static void advance(random_access_index_node*& x,std::ptrdiff_t n) { impl_pointer xi=x->impl(); trampoline::advance(xi,n); x=from_impl(xi); } static std::ptrdiff_t distance( random_access_index_node* x,random_access_index_node* y) { return trampoline::distance(x->impl(),y->impl()); } }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/ord_index_node.hpp0000644000000000000000000000007412717644140024302 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/ord_index_node.hpp0000664000372100037210000004417412717644140025143 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. * * The internal implementation of red-black trees is based on that of SGI STL * stl_tree.h file: * * Copyright (c) 1996,1997 * Silicon Graphics Computer Systems, Inc. * * Permission to use, copy, modify, distribute and sell this software * and its documentation for any purpose is hereby granted without fee, * provided that the above copyright notice appear in all copies and * that both that copyright notice and this permission notice appear * in supporting documentation. Silicon Graphics makes no * representations about the suitability of this software for any * purpose. It is provided "as is" without express or implied warranty. * * * Copyright (c) 1994 * Hewlett-Packard Company * * Permission to use, copy, modify, distribute and sell this software * and its documentation for any purpose is hereby granted without fee, * provided that the above copyright notice appear in all copies and * that both that copyright notice and this permission notice appear * in supporting documentation. Hewlett-Packard Company makes no * representations about the suitability of this software for any * purpose. It is provided "as is" without express or implied warranty. * */ #ifndef BOOST_MULTI_INDEX_DETAIL_ORD_INDEX_NODE_HPP #define BOOST_MULTI_INDEX_DETAIL_ORD_INDEX_NODE_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #if !defined(BOOST_MULTI_INDEX_DISABLE_COMPRESSED_ORDERED_INDEX_NODES) #include #include #include #include #include #endif namespace boost{ namespace multi_index{ namespace detail{ /* definition of red-black nodes for ordered_index */ enum ordered_index_color{red=false,black=true}; enum ordered_index_side{to_left=false,to_right=true}; template struct ordered_index_node_impl; /* fwd decl. */ template struct ordered_index_node_std_base { typedef typename prevent_eti< Allocator, typename boost::detail::allocator::rebind_to< Allocator, ordered_index_node_impl >::type >::type::pointer pointer; typedef typename prevent_eti< Allocator, typename boost::detail::allocator::rebind_to< Allocator, ordered_index_node_impl >::type >::type::const_pointer const_pointer; typedef ordered_index_color& color_ref; typedef pointer& parent_ref; ordered_index_color& color(){return color_;} ordered_index_color color()const{return color_;} pointer& parent(){return parent_;} pointer parent()const{return parent_;} pointer& left(){return left_;} pointer left()const{return left_;} pointer& right(){return right_;} pointer right()const{return right_;} private: ordered_index_color color_; pointer parent_; pointer left_; pointer right_; }; #if !defined(BOOST_MULTI_INDEX_DISABLE_COMPRESSED_ORDERED_INDEX_NODES) /* If ordered_index_node_impl has even alignment, we can use the least * significant bit of one of the ordered_index_node_impl pointers to * store color information. This typically reduces the size of * ordered_index_node_impl by 25%. */ #if defined(BOOST_MSVC) /* This code casts pointers to an integer type that has been computed * to be large enough to hold the pointer, however the metaprogramming * logic is not always spotted by the VC++ code analyser that issues a * long list of warnings. */ #pragma warning(push) #pragma warning(disable:4312 4311) #endif template struct ordered_index_node_compressed_base { typedef ordered_index_node_impl* pointer; typedef const ordered_index_node_impl* const_pointer; struct color_ref { color_ref(uintptr_type* r_):r(r_){} operator ordered_index_color()const { return ordered_index_color(*r&uintptr_type(1)); } color_ref& operator=(ordered_index_color c) { *r&=~uintptr_type(1); *r|=uintptr_type(c); return *this; } color_ref& operator=(const color_ref& x) { return operator=(x.operator ordered_index_color()); } private: uintptr_type* r; }; struct parent_ref { parent_ref(uintptr_type* r_):r(r_){} operator pointer()const { return (pointer)(void*)(*r&~uintptr_type(1)); } parent_ref& operator=(pointer p) { *r=((uintptr_type)(void*)p)|(*r&uintptr_type(1)); return *this; } parent_ref& operator=(const parent_ref& x) { return operator=(x.operator pointer()); } pointer operator->()const { return operator pointer(); } private: uintptr_type* r; }; color_ref color(){return color_ref(&parentcolor_);} ordered_index_color color()const { return ordered_index_color(parentcolor_&std::size_t(1ul)); } parent_ref parent(){return parent_ref(&parentcolor_);} pointer parent()const { return (pointer)(void*)(parentcolor_&~uintptr_type(1)); } pointer& left(){return left_;} pointer left()const{return left_;} pointer& right(){return right_;} pointer right()const{return right_;} private: uintptr_type parentcolor_; pointer left_; pointer right_; }; #if defined(BOOST_MSVC) #pragma warning(pop) #endif #endif template struct ordered_index_node_impl_base: #if !defined(BOOST_MULTI_INDEX_DISABLE_COMPRESSED_ORDERED_INDEX_NODES) mpl::if_c< !(has_uintptr_type::value)|| (alignment_of >::value%2)|| !(is_same< typename prevent_eti< Allocator, typename boost::detail::allocator::rebind_to< Allocator, ordered_index_node_impl >::type >::type::pointer, ordered_index_node_impl*>::value), ordered_index_node_std_base, ordered_index_node_compressed_base >::type #else ordered_index_node_std_base #endif {}; template struct ordered_index_node_impl:ordered_index_node_impl_base { private: typedef ordered_index_node_impl_base super; public: typedef typename super::color_ref color_ref; typedef typename super::parent_ref parent_ref; typedef typename super::pointer pointer; typedef typename super::const_pointer const_pointer; /* interoperability with bidir_node_iterator */ static void increment(pointer& x) { if(x->right()!=pointer(0)){ x=x->right(); while(x->left()!=pointer(0))x=x->left(); } else{ pointer y=x->parent(); while(x==y->right()){ x=y; y=y->parent(); } if(x->right()!=y)x=y; } } static void decrement(pointer& x) { if(x->color()==red&&x->parent()->parent()==x){ x=x->right(); } else if(x->left()!=pointer(0)){ pointer y=x->left(); while(y->right()!=pointer(0))y=y->right(); x=y; }else{ pointer y=x->parent(); while(x==y->left()){ x=y; y=y->parent(); } x=y; } } /* algorithmic stuff */ static void rotate_left(pointer x,parent_ref root) { pointer y=x->right(); x->right()=y->left(); if(y->left()!=pointer(0))y->left()->parent()=x; y->parent()=x->parent(); if(x==root) root=y; else if(x==x->parent()->left())x->parent()->left()=y; else x->parent()->right()=y; y->left()=x; x->parent()=y; } static pointer minimum(pointer x) { while(x->left()!=pointer(0))x=x->left(); return x; } static pointer maximum(pointer x) { while(x->right()!=pointer(0))x=x->right(); return x; } static void rotate_right(pointer x,parent_ref root) { pointer y=x->left(); x->left()=y->right(); if(y->right()!=pointer(0))y->right()->parent()=x; y->parent()=x->parent(); if(x==root) root=y; else if(x==x->parent()->right())x->parent()->right()=y; else x->parent()->left()=y; y->right()=x; x->parent()=y; } static void rebalance(pointer x,parent_ref root) { x->color()=red; while(x!=root&&x->parent()->color()==red){ if(x->parent()==x->parent()->parent()->left()){ pointer y=x->parent()->parent()->right(); if(y!=pointer(0)&&y->color()==red){ x->parent()->color()=black; y->color()=black; x->parent()->parent()->color()=red; x=x->parent()->parent(); } else{ if(x==x->parent()->right()){ x=x->parent(); rotate_left(x,root); } x->parent()->color()=black; x->parent()->parent()->color()=red; rotate_right(x->parent()->parent(),root); } } else{ pointer y=x->parent()->parent()->left(); if(y!=pointer(0)&&y->color()==red){ x->parent()->color()=black; y->color()=black; x->parent()->parent()->color()=red; x=x->parent()->parent(); } else{ if(x==x->parent()->left()){ x=x->parent(); rotate_right(x,root); } x->parent()->color()=black; x->parent()->parent()->color()=red; rotate_left(x->parent()->parent(),root); } } } root->color()=black; } static void link( pointer x,ordered_index_side side,pointer position,pointer header) { if(side==to_left){ position->left()=x; /* also makes leftmost=x when parent==header */ if(position==header){ header->parent()=x; header->right()=x; } else if(position==header->left()){ header->left()=x; /* maintain leftmost pointing to min node */ } } else{ position->right()=x; if(position==header->right()){ header->right()=x; /* maintain rightmost pointing to max node */ } } x->parent()=position; x->left()=pointer(0); x->right()=pointer(0); ordered_index_node_impl::rebalance(x,header->parent()); } static pointer rebalance_for_erase( pointer z,parent_ref root,pointer& leftmost,pointer& rightmost) { pointer y=z; pointer x=pointer(0); pointer x_parent=pointer(0); if(y->left()==pointer(0)){ /* z has at most one non-null child. y==z. */ x=y->right(); /* x might be null */ } else{ if(y->right()==pointer(0)){ /* z has exactly one non-null child. y==z. */ x=y->left(); /* x is not null */ } else{ /* z has two non-null children. Set y to */ y=y->right(); /* z's successor. x might be null. */ while(y->left()!=pointer(0))y=y->left(); x=y->right(); } } if(y!=z){ z->left()->parent()=y; /* relink y in place of z. y is z's successor */ y->left()=z->left(); if(y!=z->right()){ x_parent=y->parent(); if(x!=pointer(0))x->parent()=y->parent(); y->parent()->left()=x; /* y must be a child of left */ y->right()=z->right(); z->right()->parent()=y; } else{ x_parent=y; } if(root==z) root=y; else if(z->parent()->left()==z)z->parent()->left()=y; else z->parent()->right()=y; y->parent()=z->parent(); ordered_index_color c=y->color(); y->color()=z->color(); z->color()=c; y=z; /* y now points to node to be actually deleted */ } else{ /* y==z */ x_parent=y->parent(); if(x!=pointer(0))x->parent()=y->parent(); if(root==z){ root=x; } else{ if(z->parent()->left()==z)z->parent()->left()=x; else z->parent()->right()=x; } if(leftmost==z){ if(z->right()==pointer(0)){ /* z->left() must be null also */ leftmost=z->parent(); } else{ leftmost=minimum(x); /* makes leftmost==header if z==root */ } } if(rightmost==z){ if(z->left()==pointer(0)){ /* z->right() must be null also */ rightmost=z->parent(); } else{ /* x==z->left() */ rightmost=maximum(x); /* makes rightmost==header if z==root */ } } } if(y->color()!=red){ while(x!=root&&(x==pointer(0)|| x->color()==black)){ if(x==x_parent->left()){ pointer w=x_parent->right(); if(w->color()==red){ w->color()=black; x_parent->color()=red; rotate_left(x_parent,root); w=x_parent->right(); } if((w->left()==pointer(0)||w->left()->color()==black) && (w->right()==pointer(0)||w->right()->color()==black)){ w->color()=red; x=x_parent; x_parent=x_parent->parent(); } else{ if(w->right()==pointer(0 ) || w->right()->color()==black){ if(w->left()!=pointer(0)) w->left()->color()=black; w->color()=red; rotate_right(w,root); w=x_parent->right(); } w->color()=x_parent->color(); x_parent->color()=black; if(w->right()!=pointer(0))w->right()->color()=black; rotate_left(x_parent,root); break; } } else{ /* same as above,with right <-> left */ pointer w=x_parent->left(); if(w->color()==red){ w->color()=black; x_parent->color()=red; rotate_right(x_parent,root); w=x_parent->left(); } if((w->right()==pointer(0)||w->right()->color()==black) && (w->left()==pointer(0)||w->left()->color()==black)){ w->color()=red; x=x_parent; x_parent=x_parent->parent(); } else{ if(w->left()==pointer(0)||w->left()->color()==black){ if(w->right()!=pointer(0))w->right()->color()=black; w->color()=red; rotate_left(w,root); w=x_parent->left(); } w->color()=x_parent->color(); x_parent->color()=black; if(w->left()!=pointer(0))w->left()->color()=black; rotate_right(x_parent,root); break; } } } if(x!=pointer(0))x->color()=black; } return y; } static void restore(pointer x,pointer position,pointer header) { if(position->left()==pointer(0)||position->left()==header){ link(x,to_left,position,header); } else{ decrement(position); link(x,to_right,position,header); } } #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING) /* invariant stuff */ static std::size_t black_count(pointer node,pointer root) { if(node==pointer(0))return 0; std::size_t sum=0; for(;;){ if(node->color()==black)++sum; if(node==root)break; node=node->parent(); } return sum; } #endif }; template struct ordered_index_node_trampoline: prevent_eti< Super, ordered_index_node_impl< typename boost::detail::allocator::rebind_to< typename Super::allocator_type, char >::type > >::type { typedef typename prevent_eti< Super, ordered_index_node_impl< typename boost::detail::allocator::rebind_to< typename Super::allocator_type, char >::type > >::type impl_type; }; template struct ordered_index_node:Super,ordered_index_node_trampoline { private: typedef ordered_index_node_trampoline trampoline; public: typedef typename trampoline::impl_type impl_type; typedef typename trampoline::color_ref impl_color_ref; typedef typename trampoline::parent_ref impl_parent_ref; typedef typename trampoline::pointer impl_pointer; typedef typename trampoline::const_pointer const_impl_pointer; impl_color_ref color(){return trampoline::color();} ordered_index_color color()const{return trampoline::color();} impl_parent_ref parent(){return trampoline::parent();} impl_pointer parent()const{return trampoline::parent();} impl_pointer& left(){return trampoline::left();} impl_pointer left()const{return trampoline::left();} impl_pointer& right(){return trampoline::right();} impl_pointer right()const{return trampoline::right();} impl_pointer impl() { return static_cast( static_cast(static_cast(this))); } const_impl_pointer impl()const { return static_cast( static_cast(static_cast(this))); } static ordered_index_node* from_impl(impl_pointer x) { return static_cast( static_cast(&*x)); } static const ordered_index_node* from_impl(const_impl_pointer x) { return static_cast( static_cast(&*x)); } /* interoperability with bidir_node_iterator */ static void increment(ordered_index_node*& x) { impl_pointer xi=x->impl(); trampoline::increment(xi); x=from_impl(xi); } static void decrement(ordered_index_node*& x) { impl_pointer xi=x->impl(); trampoline::decrement(xi); x=from_impl(xi); } }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/duplicates_iterator.hpp0000644000000000000000000000007412717644140025370 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/duplicates_iterator.hpp0000664000372100037210000000506312717644140026223 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_DUPLICATES_ITERATOR_HPP #define BOOST_MULTI_INDEX_DETAIL_DUPLICATES_ITERATOR_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include namespace boost{ namespace multi_index{ namespace detail{ /* duplicates_operator is given a range of ordered elements and * passes only over those which are duplicated. */ template class duplicates_iterator { public: typedef typename Node::value_type value_type; typedef std::ptrdiff_t difference_type; typedef const typename Node::value_type* pointer; typedef const typename Node::value_type& reference; typedef std::forward_iterator_tag iterator_category; duplicates_iterator(Node* node_,Node* end_,Predicate pred_): node(node_),begin_chunk(0),end(end_),pred(pred_) { advance(); } duplicates_iterator(Node* end_,Predicate pred_): node(end_),begin_chunk(end_),end(end_),pred(pred_) { } reference operator*()const { return node->value(); } pointer operator->()const { return &node->value(); } duplicates_iterator& operator++() { Node::increment(node); sync(); return *this; } duplicates_iterator operator++(int) { duplicates_iterator tmp(*this); ++(*this); return tmp; } Node* get_node()const{return node;} private: void sync() { if(node!=end&&pred(begin_chunk->value(),node->value()))advance(); } void advance() { for(Node* node2=node;node!=end;node=node2){ Node::increment(node2); if(node2!=end&&!pred(node->value(),node2->value()))break; } begin_chunk=node; } Node* node; Node* begin_chunk; Node* end; Predicate pred; }; template bool operator==( const duplicates_iterator& x, const duplicates_iterator& y) { return x.get_node()==y.get_node(); } template bool operator!=( const duplicates_iterator& x, const duplicates_iterator& y) { return !(x==y); } } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/index_base.hpp0000644000000000000000000000007412717644140023423 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/index_base.hpp0000664000372100037210000002002112717644140024245 0ustar00fransfrans00000000000000/* Copyright 2003-2013 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_INDEX_BASE_HPP #define BOOST_MULTI_INDEX_DETAIL_INDEX_BASE_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include #include #include #include #include #include #include #include #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) #include #include #endif namespace boost{ namespace multi_index{ namespace detail{ /* The role of this class is threefold: * - tops the linear hierarchy of indices. * - terminates some cascading backbone function calls (insert_, etc.), * - grants access to the backbone functions of the final * multi_index_container class (for access restriction reasons, these * cannot be called directly from the index classes.) */ struct lvalue_tag{}; struct rvalue_tag{}; struct emplaced_tag{}; template class index_base { protected: typedef index_node_base node_type; typedef typename multi_index_node_type< Value,IndexSpecifierList,Allocator>::type final_node_type; typedef multi_index_container< Value,IndexSpecifierList,Allocator> final_type; typedef tuples::null_type ctor_args_list; typedef typename boost::detail::allocator::rebind_to< Allocator, typename Allocator::value_type>::type final_allocator_type; typedef mpl::vector0<> index_type_list; typedef mpl::vector0<> iterator_type_list; typedef mpl::vector0<> const_iterator_type_list; typedef copy_map< final_node_type, final_allocator_type> copy_map_type; #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) typedef index_saver< node_type, final_allocator_type> index_saver_type; typedef index_loader< node_type, final_node_type, final_allocator_type> index_loader_type; #endif private: typedef Value value_type; protected: explicit index_base(const ctor_args_list&,const Allocator&){} index_base( const index_base&, do_not_copy_elements_tag) {} void copy_( const index_base&,const copy_map_type&) {} node_type* insert_(const value_type& v,node_type* x,lvalue_tag) { boost::detail::allocator::construct(&x->value(),v); return x; } node_type* insert_(const value_type& v,node_type* x,rvalue_tag) { /* This shoud have used a modified, T&&-compatible version of * boost::detail::allocator::construct, but * is too old and venerable to mess * with; besides, it is a general internal utility and the imperfect * perfect forwarding emulation of Boost.Move might break other libs. */ new (&x->value()) value_type(boost::move(const_cast(v))); return x; } node_type* insert_(const value_type&,node_type* x,emplaced_tag) { return x; } node_type* insert_(const value_type& v,node_type*,node_type* x,lvalue_tag) { boost::detail::allocator::construct(&x->value(),v); return x; } node_type* insert_(const value_type& v,node_type*,node_type* x,rvalue_tag) { new (&x->value()) value_type(boost::move(const_cast(v))); return x; } node_type* insert_(const value_type&,node_type*,node_type* x,emplaced_tag) { return x; } void erase_(node_type* x) { boost::detail::allocator::destroy(&x->value()); } void delete_node_(node_type* x) { boost::detail::allocator::destroy(&x->value()); } void clear_(){} void swap_(index_base&){} void swap_elements_(index_base&){} bool replace_(const value_type& v,node_type* x,lvalue_tag) { x->value()=v; return true; } bool replace_(const value_type& v,node_type* x,rvalue_tag) { x->value()=boost::move(const_cast(v)); return true; } bool modify_(node_type*){return true;} bool modify_rollback_(node_type*){return true;} #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) /* serialization */ template void save_(Archive&,const unsigned int,const index_saver_type&)const{} template void load_(Archive&,const unsigned int,const index_loader_type&){} #endif #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING) /* invariant stuff */ bool invariant_()const{return true;} #endif /* access to backbone memfuns of Final class */ final_type& final(){return *static_cast(this);} const final_type& final()const{return *static_cast(this);} final_node_type* final_header()const{return final().header();} bool final_empty_()const{return final().empty_();} std::size_t final_size_()const{return final().size_();} std::size_t final_max_size_()const{return final().max_size_();} std::pair final_insert_(const value_type& x) {return final().insert_(x);} std::pair final_insert_rv_(const value_type& x) {return final().insert_rv_(x);} template std::pair final_insert_ref_(T& t) {return final().insert_ref_(t);} template std::pair final_emplace_( BOOST_MULTI_INDEX_FUNCTION_PARAM_PACK) { return final().emplace_(BOOST_MULTI_INDEX_FORWARD_PARAM_PACK); } std::pair final_insert_( const value_type& x,final_node_type* position) {return final().insert_(x,position);} std::pair final_insert_rv_( const value_type& x,final_node_type* position) {return final().insert_rv_(x,position);} template std::pair final_insert_ref_( T& t,final_node_type* position) {return final().insert_ref_(t,position);} template std::pair final_emplace_hint_( final_node_type* position,BOOST_MULTI_INDEX_FUNCTION_PARAM_PACK) { return final().emplace_hint_( position,BOOST_MULTI_INDEX_FORWARD_PARAM_PACK); } void final_erase_(final_node_type* x){final().erase_(x);} void final_delete_node_(final_node_type* x){final().delete_node_(x);} void final_delete_all_nodes_(){final().delete_all_nodes_();} void final_clear_(){final().clear_();} void final_swap_(final_type& x){final().swap_(x);} bool final_replace_( const value_type& k,final_node_type* x) {return final().replace_(k,x);} bool final_replace_rv_( const value_type& k,final_node_type* x) {return final().replace_rv_(k,x);} template bool final_modify_(Modifier& mod,final_node_type* x) {return final().modify_(mod,x);} template bool final_modify_(Modifier& mod,Rollback& back,final_node_type* x) {return final().modify_(mod,back,x);} #if defined(BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING) void final_check_invariant_()const{final().check_invariant_();} #endif }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/copy_map.hpp0000644000000000000000000000007412717644140023131 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/copy_map.hpp0000664000372100037210000000750312717644140023765 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_COPY_MAP_HPP #define BOOST_MULTI_INDEX_DETAIL_COPY_MAP_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include #include #include namespace boost{ namespace multi_index{ namespace detail{ /* copy_map is used as an auxiliary structure during copy_() operations. * When a container with n nodes is replicated, node_map holds the pairings * between original and copied nodes, and provides a fast way to find a * copied node from an original one. * The semantics of the class are not simple, and no attempt has been made * to enforce it: multi_index_container handles it right. On the other hand, * the const interface, which is the one provided to index implementations, * only allows for: * - Enumeration of pairs of (original,copied) nodes (excluding the headers), * - fast retrieval of copied nodes (including the headers.) */ template struct copy_map_entry { copy_map_entry(Node* f,Node* s):first(f),second(s){} Node* first; Node* second; bool operator<(const copy_map_entry& x)const { return std::less()(first,x.first); } }; template class copy_map:private noncopyable { public: typedef const copy_map_entry* const_iterator; copy_map( const Allocator& al,std::size_t size,Node* header_org,Node* header_cpy): al_(al),size_(size),spc(al_,size_),n(0), header_org_(header_org),header_cpy_(header_cpy),released(false) {} ~copy_map() { if(!released){ for(std::size_t i=0;isecond->value()); deallocate((spc.data()+i)->second); } } } const_iterator begin()const{return &*spc.data();} const_iterator end()const{return &*(spc.data()+n);} void clone(Node* node) { (spc.data()+n)->first=node; (spc.data()+n)->second=&*al_.allocate(1); BOOST_TRY{ boost::detail::allocator::construct( &(spc.data()+n)->second->value(),node->value()); } BOOST_CATCH(...){ deallocate((spc.data()+n)->second); BOOST_RETHROW; } BOOST_CATCH_END ++n; if(n==size_)std::sort(&*spc.data(),&*spc.data()+size_); } Node* find(Node* node)const { if(node==header_org_)return header_cpy_; return std::lower_bound( begin(),end(),copy_map_entry(node,0))->second; } void release() { released=true; } private: typedef typename prevent_eti< Allocator, typename boost::detail::allocator::rebind_to< Allocator,Node>::type >::type allocator_type; typedef typename allocator_type::pointer allocator_pointer; allocator_type al_; std::size_t size_; auto_space,Allocator> spc; std::size_t n; Node* header_org_; Node* header_cpy_; bool released; void deallocate(Node* node) { al_.deallocate(static_cast(node),1); } }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/auto_space.hpp0000644000000000000000000000007412717644140023445 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.093552501 madp-0.4/src/boost/boost/multi_index/detail/auto_space.hpp0000664000372100037210000000511012717644140024271 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_AUTO_SPACE_HPP #define BOOST_MULTI_INDEX_DETAIL_AUTO_SPACE_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include #include namespace boost{ namespace multi_index{ namespace detail{ /* auto_space provides uninitialized space suitably to store * a given number of elements of a given type. */ /* NB: it is not clear whether using an allocator to handle * zero-sized arrays of elements is conformant or not. GCC 3.3.1 * and prior fail here, other stdlibs handle the issue gracefully. * To be on the safe side, the case n==0 is given special treatment. * References: * GCC Bugzilla, "standard allocator crashes when deallocating segment * "of zero length", http://gcc.gnu.org/bugzilla/show_bug.cgi?id=14176 * C++ Standard Library Defect Report List (Revision 28), issue 199 * "What does allocate(0) return?", * http://anubis.dkuug.dk/jtc1/sc22/wg21/docs/lwg-defects.html#199 */ template > struct auto_space:private noncopyable { typedef typename prevent_eti< Allocator, typename boost::detail::allocator::rebind_to< Allocator,T >::type >::type::pointer pointer; explicit auto_space(const Allocator& al=Allocator(),std::size_t n=1): al_(al),n_(n),data_(n_?al_.allocate(n_):pointer(0)) {} ~auto_space() { if(n_)al_.deallocate(data_,n_); } Allocator get_allocator()const{return al_;} pointer data()const{return data_;} void swap(auto_space& x) { if(al_!=x.al_)adl_swap(al_,x.al_); std::swap(n_,x.n_); std::swap(data_,x.data_); } private: typename boost::detail::allocator::rebind_to< Allocator,T>::type al_; std::size_t n_; pointer data_; }; template void swap(auto_space& x,auto_space& y) { x.swap(y); } } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/header_holder.hpp0000644000000000000000000000007412717644140024107 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/header_holder.hpp0000664000372100037210000000244212717644140024740 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_HEADER_HOLDER_HPP #define BOOST_MULTI_INDEX_DETAIL_HEADER_HOLDER_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include namespace boost{ namespace multi_index{ namespace detail{ /* A utility class used to hold a pointer to the header node. * The base from member idiom is used because index classes, which are * superclasses of multi_index_container, need this header in construction * time. The allocation is made by the allocator of the multi_index_container * class --hence, this allocator needs also be stored resorting * to the base from member trick. */ template struct header_holder:private noncopyable { header_holder():member(final().allocate_node()){} ~header_holder(){final().deallocate_node(&*member);} NodeTypePtr member; private: Final& final(){return *static_cast(this);} }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/safe_mode.hpp0000644000000000000000000000007412717644140023244 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/safe_mode.hpp0000664000372100037210000004152112717644140024076 0ustar00fransfrans00000000000000/* Copyright 2003-2013 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_SAFE_MODE_HPP #define BOOST_MULTI_INDEX_DETAIL_SAFE_MODE_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif /* Safe mode machinery, in the spirit of Cay Hortmann's "Safe STL" * (http://www.horstmann.com/safestl.html). * In this mode, containers of type Container are derived from * safe_container, and their corresponding iterators * are wrapped with safe_iterator. These classes provide * an internal record of which iterators are at a given moment associated * to a given container, and properly mark the iterators as invalid * when the container gets destroyed. * Iterators are chained in a single attached list, whose header is * kept by the container. More elaborate data structures would yield better * performance, but I decided to keep complexity to a minimum since * speed is not an issue here. * Safe mode iterators automatically check that only proper operations * are performed on them: for instance, an invalid iterator cannot be * dereferenced. Additionally, a set of utilty macros and functions are * provided that serve to implement preconditions and cooperate with * the framework within the container. * Iterators can also be unchecked, i.e. they do not have info about * which container they belong in. This situation arises when the iterator * is restored from a serialization archive: only information on the node * is available, and it is not possible to determine to which container * the iterator is associated to. The only sensible policy is to assume * unchecked iterators are valid, though this can certainly generate false * positive safe mode checks. * This is not a full-fledged safe mode framework, and is only intended * for use within the limits of Boost.MultiIndex. */ /* Assertion macros. These resolve to no-ops if * !defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE). */ #if !defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) #undef BOOST_MULTI_INDEX_SAFE_MODE_ASSERT #define BOOST_MULTI_INDEX_SAFE_MODE_ASSERT(expr,error_code) ((void)0) #else #if !defined(BOOST_MULTI_INDEX_SAFE_MODE_ASSERT) #include #define BOOST_MULTI_INDEX_SAFE_MODE_ASSERT(expr,error_code) BOOST_ASSERT(expr) #endif #endif #define BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(it) \ BOOST_MULTI_INDEX_SAFE_MODE_ASSERT( \ safe_mode::check_valid_iterator(it), \ safe_mode::invalid_iterator); #define BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(it) \ BOOST_MULTI_INDEX_SAFE_MODE_ASSERT( \ safe_mode::check_dereferenceable_iterator(it), \ safe_mode::not_dereferenceable_iterator); #define BOOST_MULTI_INDEX_CHECK_INCREMENTABLE_ITERATOR(it) \ BOOST_MULTI_INDEX_SAFE_MODE_ASSERT( \ safe_mode::check_incrementable_iterator(it), \ safe_mode::not_incrementable_iterator); #define BOOST_MULTI_INDEX_CHECK_DECREMENTABLE_ITERATOR(it) \ BOOST_MULTI_INDEX_SAFE_MODE_ASSERT( \ safe_mode::check_decrementable_iterator(it), \ safe_mode::not_decrementable_iterator); #define BOOST_MULTI_INDEX_CHECK_IS_OWNER(it,cont) \ BOOST_MULTI_INDEX_SAFE_MODE_ASSERT( \ safe_mode::check_is_owner(it,cont), \ safe_mode::not_owner); #define BOOST_MULTI_INDEX_CHECK_SAME_OWNER(it0,it1) \ BOOST_MULTI_INDEX_SAFE_MODE_ASSERT( \ safe_mode::check_same_owner(it0,it1), \ safe_mode::not_same_owner); #define BOOST_MULTI_INDEX_CHECK_VALID_RANGE(it0,it1) \ BOOST_MULTI_INDEX_SAFE_MODE_ASSERT( \ safe_mode::check_valid_range(it0,it1), \ safe_mode::invalid_range); #define BOOST_MULTI_INDEX_CHECK_OUTSIDE_RANGE(it,it0,it1) \ BOOST_MULTI_INDEX_SAFE_MODE_ASSERT( \ safe_mode::check_outside_range(it,it0,it1), \ safe_mode::inside_range); #define BOOST_MULTI_INDEX_CHECK_IN_BOUNDS(it,n) \ BOOST_MULTI_INDEX_SAFE_MODE_ASSERT( \ safe_mode::check_in_bounds(it,n), \ safe_mode::out_of_bounds); #define BOOST_MULTI_INDEX_CHECK_DIFFERENT_CONTAINER(cont0,cont1) \ BOOST_MULTI_INDEX_SAFE_MODE_ASSERT( \ safe_mode::check_different_container(cont0,cont1), \ safe_mode::same_container); #if defined(BOOST_MULTI_INDEX_ENABLE_SAFE_MODE) #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include #include #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) #include #endif #if defined(BOOST_HAS_THREADS) #include #endif namespace boost{ namespace multi_index{ namespace safe_mode{ /* Checking routines. Assume the best for unchecked iterators * (i.e. they pass the checking when there is not enough info * to know.) */ template inline bool check_valid_iterator(const Iterator& it) { return it.valid()||it.unchecked(); } template inline bool check_dereferenceable_iterator(const Iterator& it) { return (it.valid()&&it!=it.owner()->end())||it.unchecked(); } template inline bool check_incrementable_iterator(const Iterator& it) { return (it.valid()&&it!=it.owner()->end())||it.unchecked(); } template inline bool check_decrementable_iterator(const Iterator& it) { return (it.valid()&&it!=it.owner()->begin())||it.unchecked(); } template inline bool check_is_owner( const Iterator& it,const typename Iterator::container_type& cont) { return (it.valid()&&it.owner()==&cont)||it.unchecked(); } template inline bool check_same_owner(const Iterator& it0,const Iterator& it1) { return (it0.valid()&&it1.valid()&&it0.owner()==it1.owner())|| it0.unchecked()||it1.unchecked(); } template inline bool check_valid_range(const Iterator& it0,const Iterator& it1) { if(!check_same_owner(it0,it1))return false; if(it0.valid()){ Iterator last=it0.owner()->end(); if(it1==last)return true; for(Iterator first=it0;first!=last;++first){ if(first==it1)return true; } return false; } return true; } template inline bool check_outside_range( const Iterator& it,const Iterator& it0,const Iterator& it1) { if(!check_same_owner(it0,it1))return false; if(it0.valid()){ Iterator last=it0.owner()->end(); bool found=false; Iterator first=it0; for(;first!=last;++first){ if(first==it1)break; /* crucial that this check goes after previous break */ if(first==it)found=true; } if(first!=it1)return false; return !found; } return true; } template inline bool check_in_bounds(const Iterator& it,Difference n) { if(it.unchecked())return true; if(!it.valid()) return false; if(n>0) return it.owner()->end()-it>=n; else return it.owner()->begin()-it<=n; } template inline bool check_different_container( const Container& cont0,const Container& cont1) { return &cont0!=&cont1; } /* Invalidates all iterators equivalent to that given. Safe containers * must call this when deleting elements: the safe mode framework cannot * perform this operation automatically without outside help. */ template inline void detach_equivalent_iterators(Iterator& it) { if(it.valid()){ { #if defined(BOOST_HAS_THREADS) boost::detail::lightweight_mutex::scoped_lock lock(it.cont->mutex); #endif Iterator *prev_,*next_; for( prev_=static_cast(&it.cont->header); (next_=static_cast(prev_->next))!=0;){ if(next_!=&it&&*next_==it){ prev_->next=next_->next; next_->cont=0; } else prev_=next_; } } it.detach(); } } template class safe_container; /* fwd decl. */ } /* namespace multi_index::safe_mode */ namespace detail{ class safe_container_base; /* fwd decl. */ class safe_iterator_base { public: bool valid()const{return cont!=0;} bool unchecked()const{return unchecked_;} inline void detach(); void uncheck() { detach(); unchecked_=true; } protected: safe_iterator_base():cont(0),next(0),unchecked_(false){} explicit safe_iterator_base(safe_container_base* cont_): unchecked_(false) { attach(cont_); } safe_iterator_base(const safe_iterator_base& it): unchecked_(it.unchecked_) { attach(it.cont); } safe_iterator_base& operator=(const safe_iterator_base& it) { unchecked_=it.unchecked_; safe_container_base* new_cont=it.cont; if(cont!=new_cont){ detach(); attach(new_cont); } return *this; } ~safe_iterator_base() { detach(); } const safe_container_base* owner()const{return cont;} BOOST_MULTI_INDEX_PRIVATE_IF_MEMBER_TEMPLATE_FRIENDS: friend class safe_container_base; #if !defined(BOOST_NO_MEMBER_TEMPLATE_FRIENDS) template friend class safe_mode::safe_container; template friend void safe_mode::detach_equivalent_iterators(Iterator&); #endif inline void attach(safe_container_base* cont_); safe_container_base* cont; safe_iterator_base* next; bool unchecked_; }; class safe_container_base:private noncopyable { public: safe_container_base(){} BOOST_MULTI_INDEX_PROTECTED_IF_MEMBER_TEMPLATE_FRIENDS: friend class safe_iterator_base; #if !defined(BOOST_NO_MEMBER_TEMPLATE_FRIENDS) template friend void safe_mode::detach_equivalent_iterators(Iterator&); #endif ~safe_container_base() { /* Detaches all remaining iterators, which by now will * be those pointing to the end of the container. */ for(safe_iterator_base* it=header.next;it;it=it->next)it->cont=0; header.next=0; } void swap(safe_container_base& x) { for(safe_iterator_base* it0=header.next;it0;it0=it0->next)it0->cont=&x; for(safe_iterator_base* it1=x.header.next;it1;it1=it1->next)it1->cont=this; std::swap(header.cont,x.header.cont); std::swap(header.next,x.header.next); } safe_iterator_base header; #if defined(BOOST_HAS_THREADS) boost::detail::lightweight_mutex mutex; #endif }; void safe_iterator_base::attach(safe_container_base* cont_) { cont=cont_; if(cont){ #if defined(BOOST_HAS_THREADS) boost::detail::lightweight_mutex::scoped_lock lock(cont->mutex); #endif next=cont->header.next; cont->header.next=this; } } void safe_iterator_base::detach() { if(cont){ #if defined(BOOST_HAS_THREADS) boost::detail::lightweight_mutex::scoped_lock lock(cont->mutex); #endif safe_iterator_base *prev_,*next_; for(prev_=&cont->header;(next_=prev_->next)!=this;prev_=next_){} prev_->next=next; cont=0; } } } /* namespace multi_index::detail */ namespace safe_mode{ /* In order to enable safe mode on a container: * - The container must derive from safe_container, * - iterators must be generated via safe_iterator, which adapts a * preexistent unsafe iterator class. */ template class safe_container; template class safe_iterator: public detail::iter_adaptor,Iterator>, public detail::safe_iterator_base { typedef detail::iter_adaptor super; typedef detail::safe_iterator_base safe_super; public: typedef Container container_type; typedef typename Iterator::reference reference; typedef typename Iterator::difference_type difference_type; safe_iterator(){} explicit safe_iterator(safe_container* cont_): safe_super(cont_){} template safe_iterator(const T0& t0,safe_container* cont_): super(Iterator(t0)),safe_super(cont_){} template safe_iterator( const T0& t0,const T1& t1,safe_container* cont_): super(Iterator(t0,t1)),safe_super(cont_){} safe_iterator& operator=(const safe_iterator& x) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(x); this->base_reference()=x.base_reference(); safe_super::operator=(x); return *this; } const container_type* owner()const { return static_cast( static_cast*>( this->safe_super::owner())); } /* get_node is not to be used by the user */ typedef typename Iterator::node_type node_type; node_type* get_node()const{return this->base_reference().get_node();} private: friend class boost::multi_index::detail::iter_adaptor_access; reference dereference()const { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(*this); BOOST_MULTI_INDEX_CHECK_DEREFERENCEABLE_ITERATOR(*this); return *(this->base_reference()); } bool equal(const safe_iterator& x)const { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(*this); BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(x); BOOST_MULTI_INDEX_CHECK_SAME_OWNER(*this,x); return this->base_reference()==x.base_reference(); } void increment() { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(*this); BOOST_MULTI_INDEX_CHECK_INCREMENTABLE_ITERATOR(*this); ++(this->base_reference()); } void decrement() { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(*this); BOOST_MULTI_INDEX_CHECK_DECREMENTABLE_ITERATOR(*this); --(this->base_reference()); } void advance(difference_type n) { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(*this); BOOST_MULTI_INDEX_CHECK_IN_BOUNDS(*this,n); this->base_reference()+=n; } difference_type distance_to(const safe_iterator& x)const { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(*this); BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(x); BOOST_MULTI_INDEX_CHECK_SAME_OWNER(*this,x); return x.base_reference()-this->base_reference(); } #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) /* Serialization. Note that Iterator::save and Iterator:load * are assumed to be defined and public: at first sight it seems * like we could have resorted to the public serialization interface * for doing the forwarding to the adapted iterator class: * ar<>base_reference(); * but this would cause incompatibilities if a saving * program is in safe mode and the loading program is not, or * viceversa --in safe mode, the archived iterator data is one layer * deeper, this is especially relevant with XML archives. * It'd be nice if Boost.Serialization provided some forwarding * facility for use by adaptor classes. */ friend class boost::serialization::access; BOOST_SERIALIZATION_SPLIT_MEMBER() template void save(Archive& ar,const unsigned int version)const { BOOST_MULTI_INDEX_CHECK_VALID_ITERATOR(*this); this->base_reference().save(ar,version); } template void load(Archive& ar,const unsigned int version) { this->base_reference().load(ar,version); safe_super::uncheck(); } #endif }; template class safe_container:public detail::safe_container_base { typedef detail::safe_container_base super; public: void detach_dereferenceable_iterators() { typedef typename Container::iterator iterator; iterator end_=static_cast(this)->end(); iterator *prev_,*next_; for( prev_=static_cast(&this->header); (next_=static_cast(prev_->next))!=0;){ if(*next_!=end_){ prev_->next=next_->next; next_->cont=0; } else prev_=next_; } } void swap(safe_container& x) { super::swap(x); } }; } /* namespace multi_index::safe_mode */ } /* namespace multi_index */ } /* namespace boost */ #endif /* BOOST_MULTI_INDEX_ENABLE_SAFE_MODE */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/index_node_base.hpp0000644000000000000000000000007412717644140024430 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/index_node_base.hpp0000664000372100037210000000663412717644140025270 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_INDEX_NODE_BASE_HPP #define BOOST_MULTI_INDEX_DETAIL_INDEX_NODE_BASE_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) #include #include #include #endif namespace boost{ namespace multi_index{ namespace detail{ /* index_node_base tops the node hierarchy of multi_index_container. It holds * the value of the element contained. */ template struct pod_value_holder { typename aligned_storage< sizeof(Value), alignment_of::value >::type space; }; template struct index_node_base:private pod_value_holder { typedef index_node_base base_type; /* used for serialization purposes */ typedef Value value_type; typedef Allocator allocator_type; value_type& value() { return *static_cast( static_cast(&this->space)); } const value_type& value()const { return *static_cast( static_cast(&this->space)); } static index_node_base* from_value(const value_type* p) { return static_cast( reinterpret_cast*>( /* std 9.2.17 */ const_cast(p))); } private: #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) friend class boost::serialization::access; /* nodes do not emit any kind of serialization info. They are * fed to Boost.Serialization so that pointers to nodes are * tracked correctly. */ template void serialize(Archive&,const unsigned int) { } #endif }; template Node* node_from_value( const Value* p BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(Node)) { typedef typename Node::allocator_type allocator_type; return static_cast( index_node_base::from_value(p)); } } /* namespace multi_index::detail */ } /* namespace multi_index */ #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) /* Index nodes never get constructed directly by Boost.Serialization, * as archives are always fed pointers to previously existent * nodes. So, if this is called it means we are dealing with a * somehow invalid archive. */ #if defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP) namespace serialization{ #else namespace multi_index{ namespace detail{ #endif template inline void load_construct_data( Archive&,boost::multi_index::detail::index_node_base*, const unsigned int) { throw_exception( archive::archive_exception(archive::archive_exception::other_exception)); } #if defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP) } /* namespace serialization */ #else } /* namespace multi_index::detail */ } /* namespace multi_index */ #endif #endif } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/rnd_node_iterator.hpp0000644000000000000000000000007412717644140025023 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/rnd_node_iterator.hpp0000664000372100037210000000574112717644140025661 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_RND_NODE_ITERATOR_HPP #define BOOST_MULTI_INDEX_DETAIL_RND_NODE_ITERATOR_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) #include #include #endif namespace boost{ namespace multi_index{ namespace detail{ /* Iterator class for node-based indices with random access iterators. */ template class rnd_node_iterator: public random_access_iterator_helper< rnd_node_iterator, typename Node::value_type, std::ptrdiff_t, const typename Node::value_type*, const typename Node::value_type&> { public: rnd_node_iterator(){} explicit rnd_node_iterator(Node* node_):node(node_){} const typename Node::value_type& operator*()const { return node->value(); } rnd_node_iterator& operator++() { Node::increment(node); return *this; } rnd_node_iterator& operator--() { Node::decrement(node); return *this; } rnd_node_iterator& operator+=(std::ptrdiff_t n) { Node::advance(node,n); return *this; } rnd_node_iterator& operator-=(std::ptrdiff_t n) { Node::advance(node,-n); return *this; } #if !defined(BOOST_MULTI_INDEX_DISABLE_SERIALIZATION) /* Serialization. As for why the following is public, * see explanation in safe_mode_iterator notes in safe_mode.hpp. */ BOOST_SERIALIZATION_SPLIT_MEMBER() typedef typename Node::base_type node_base_type; template void save(Archive& ar,const unsigned int)const { node_base_type* bnode=node; ar< void load(Archive& ar,const unsigned int) { node_base_type* bnode; ar>>serialization::make_nvp("pointer",bnode); node=static_cast(bnode); } #endif /* get_node is not to be used by the user */ typedef Node node_type; Node* get_node()const{return node;} private: Node* node; }; template bool operator==( const rnd_node_iterator& x, const rnd_node_iterator& y) { return x.get_node()==y.get_node(); } template bool operator<( const rnd_node_iterator& x, const rnd_node_iterator& y) { return Node::distance(x.get_node(),y.get_node())>0; } template std::ptrdiff_t operator-( const rnd_node_iterator& x, const rnd_node_iterator& y) { return Node::distance(y.get_node(),x.get_node()); } } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/detail/PaxHeaders.5405/prevent_eti.hpp0000644000000000000000000000007412717644140023646 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.097552468 madp-0.4/src/boost/boost/multi_index/detail/prevent_eti.hpp0000664000372100037210000000253212717644140024477 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_PREVENT_ETI_HPP #define BOOST_MULTI_INDEX_DETAIL_PREVENT_ETI_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #if BOOST_WORKAROUND(BOOST_MSVC,<1300) #include #include #include #endif namespace boost{ namespace multi_index{ namespace detail{ #if BOOST_WORKAROUND(BOOST_MSVC,<1300) /* See * http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl?Effective_MPL * Item 5.6, Beware of the 'early template instantiation' trap. */ template struct prevent_eti { typedef typename mpl::if_< mpl::aux::msvc_never_true, mpl::integral_c, Construct >::type type; }; #else template struct prevent_eti { typedef Construct type; }; #endif } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/PaxHeaders.5405/composite_key.hpp0000644000000000000000000000007412717644140022732 xustar0030 atime=1463765180.125719967 30 ctime=1463765201.093552501 madp-0.4/src/boost/boost/multi_index/composite_key.hpp0000664000372100037210000012114312717644140023563 0ustar00fransfrans00000000000000/* Copyright 2003-2011 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_COMPOSITE_KEY_HPP #define BOOST_MULTI_INDEX_COMPOSITE_KEY_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) #include #endif #if !defined(BOOST_NO_SFINAE) #include #endif /* A composite key stores n key extractors and "computes" the * result on a given value as a packed reference to the value and * the composite key itself. Actual invocations to the component * key extractors are lazily performed when executing an operation * on composite_key results (equality, comparison, hashing.) * As the other key extractors in Boost.MultiIndex, composite_key * is overloaded to work on chained pointers to T and reference_wrappers * of T. */ /* This user_definable macro limits the number of elements of a composite * key; useful for shortening resulting symbol names (MSVC++ 6.0, for * instance has problems coping with very long symbol names.) * NB: This cannot exceed the maximum number of arguments of * boost::tuple. In Boost 1.32, the limit is 10. */ #if !defined(BOOST_MULTI_INDEX_LIMIT_COMPOSITE_KEY_SIZE) #if defined(BOOST_MSVC)&&(BOOST_MSVC<1300) #define BOOST_MULTI_INDEX_LIMIT_COMPOSITE_KEY_SIZE 5 #else #define BOOST_MULTI_INDEX_LIMIT_COMPOSITE_KEY_SIZE 10 #endif #endif /* maximum number of key extractors in a composite key */ #if BOOST_MULTI_INDEX_LIMIT_COMPOSITE_KEY_SIZE<10 /* max length of a tuple */ #define BOOST_MULTI_INDEX_COMPOSITE_KEY_SIZE \ BOOST_MULTI_INDEX_LIMIT_COMPOSITE_KEY_SIZE #else #define BOOST_MULTI_INDEX_COMPOSITE_KEY_SIZE 10 #endif /* BOOST_PP_ENUM of BOOST_MULTI_INDEX_COMPOSITE_KEY_SIZE elements */ #define BOOST_MULTI_INDEX_CK_ENUM(macro,data) \ BOOST_PP_ENUM(BOOST_MULTI_INDEX_COMPOSITE_KEY_SIZE,macro,data) /* BOOST_PP_ENUM_PARAMS of BOOST_MULTI_INDEX_COMPOSITE_KEY_SIZE elements */ #define BOOST_MULTI_INDEX_CK_ENUM_PARAMS(param) \ BOOST_PP_ENUM_PARAMS(BOOST_MULTI_INDEX_COMPOSITE_KEY_SIZE,param) /* if n==0 -> text0 * otherwise -> textn=tuples::null_type */ #define BOOST_MULTI_INDEX_CK_TEMPLATE_PARM(z,n,text) \ typename BOOST_PP_CAT(text,n) BOOST_PP_EXPR_IF(n,=tuples::null_type) /* const textn& kn=textn() */ #define BOOST_MULTI_INDEX_CK_CTOR_ARG(z,n,text) \ const BOOST_PP_CAT(text,n)& BOOST_PP_CAT(k,n) = BOOST_PP_CAT(text,n)() /* typename list(0)::type */ #define BOOST_MULTI_INDEX_CK_APPLY_METAFUNCTION_N(z,n,list) \ BOOST_DEDUCED_TYPENAME BOOST_PP_LIST_AT(list,0)< \ BOOST_PP_LIST_AT(list,1),n \ >::type namespace boost{ template class reference_wrapper; /* fwd decl. */ namespace multi_index{ namespace detail{ /* n-th key extractor of a composite key */ template struct nth_key_from_value { typedef typename CompositeKey::key_extractor_tuple key_extractor_tuple; typedef typename prevent_eti< tuples::element, typename mpl::eval_if_c< N::value, tuples::element, mpl::identity >::type >::type type; }; /* nth_composite_key_##name::type yields * functor >, or tuples::null_type * if N exceeds the length of the composite key. */ #define BOOST_MULTI_INDEX_CK_NTH_COMPOSITE_KEY_FUNCTOR(name,functor) \ template \ struct BOOST_PP_CAT(key_,name) \ { \ typedef functor type; \ }; \ \ template<> \ struct BOOST_PP_CAT(key_,name) \ { \ typedef tuples::null_type type; \ }; \ \ template \ struct BOOST_PP_CAT(nth_composite_key_,name) \ { \ typedef typename nth_key_from_value::type key_from_value; \ typedef typename BOOST_PP_CAT(key_,name)::type type; \ }; /* nth_composite_key_equal_to * nth_composite_key_less * nth_composite_key_greater * nth_composite_key_hash */ BOOST_MULTI_INDEX_CK_NTH_COMPOSITE_KEY_FUNCTOR(equal_to,std::equal_to) BOOST_MULTI_INDEX_CK_NTH_COMPOSITE_KEY_FUNCTOR(less,std::less) BOOST_MULTI_INDEX_CK_NTH_COMPOSITE_KEY_FUNCTOR(greater,std::greater) BOOST_MULTI_INDEX_CK_NTH_COMPOSITE_KEY_FUNCTOR(hash,boost::hash) /* used for defining equality and comparison ops of composite_key_result */ #define BOOST_MULTI_INDEX_CK_IDENTITY_ENUM_MACRO(z,n,text) text struct generic_operator_equal { template bool operator()(const T& x,const Q& y)const{return x==y;} }; typedef tuple< BOOST_MULTI_INDEX_CK_ENUM( BOOST_MULTI_INDEX_CK_IDENTITY_ENUM_MACRO, detail::generic_operator_equal)> generic_operator_equal_tuple; struct generic_operator_less { template bool operator()(const T& x,const Q& y)const{return x generic_operator_less_tuple; /* Metaprogramming machinery for implementing equality, comparison and * hashing operations of composite_key_result. * * equal_* checks for equality between composite_key_results and * between those and tuples, accepting a tuple of basic equality functors. * compare_* does lexicographical comparison. * hash_* computes a combination of elementwise hash values. */ template < typename KeyCons1,typename Value1, typename KeyCons2, typename Value2, typename EqualCons > struct equal_ckey_ckey; /* fwd decl. */ template < typename KeyCons1,typename Value1, typename KeyCons2, typename Value2, typename EqualCons > struct equal_ckey_ckey_terminal { static bool compare( const KeyCons1&,const Value1&, const KeyCons2&,const Value2&, const EqualCons&) { return true; } }; template < typename KeyCons1,typename Value1, typename KeyCons2, typename Value2, typename EqualCons > struct equal_ckey_ckey_normal { static bool compare( const KeyCons1& c0,const Value1& v0, const KeyCons2& c1,const Value2& v1, const EqualCons& eq) { if(!eq.get_head()(c0.get_head()(v0),c1.get_head()(v1)))return false; return equal_ckey_ckey< BOOST_DEDUCED_TYPENAME KeyCons1::tail_type,Value1, BOOST_DEDUCED_TYPENAME KeyCons2::tail_type,Value2, BOOST_DEDUCED_TYPENAME EqualCons::tail_type >::compare(c0.get_tail(),v0,c1.get_tail(),v1,eq.get_tail()); } }; template < typename KeyCons1,typename Value1, typename KeyCons2, typename Value2, typename EqualCons > struct equal_ckey_ckey: mpl::if_< mpl::or_< is_same, is_same >, equal_ckey_ckey_terminal, equal_ckey_ckey_normal >::type { }; template < typename KeyCons,typename Value, typename ValCons,typename EqualCons > struct equal_ckey_cval; /* fwd decl. */ template < typename KeyCons,typename Value, typename ValCons,typename EqualCons > struct equal_ckey_cval_terminal { static bool compare( const KeyCons&,const Value&,const ValCons&,const EqualCons&) { return true; } static bool compare( const ValCons&,const KeyCons&,const Value&,const EqualCons&) { return true; } }; template < typename KeyCons,typename Value, typename ValCons,typename EqualCons > struct equal_ckey_cval_normal { static bool compare( const KeyCons& c,const Value& v,const ValCons& vc, const EqualCons& eq) { if(!eq.get_head()(c.get_head()(v),vc.get_head()))return false; return equal_ckey_cval< BOOST_DEDUCED_TYPENAME KeyCons::tail_type,Value, BOOST_DEDUCED_TYPENAME ValCons::tail_type, BOOST_DEDUCED_TYPENAME EqualCons::tail_type >::compare(c.get_tail(),v,vc.get_tail(),eq.get_tail()); } static bool compare( const ValCons& vc,const KeyCons& c,const Value& v, const EqualCons& eq) { if(!eq.get_head()(vc.get_head(),c.get_head()(v)))return false; return equal_ckey_cval< BOOST_DEDUCED_TYPENAME KeyCons::tail_type,Value, BOOST_DEDUCED_TYPENAME ValCons::tail_type, BOOST_DEDUCED_TYPENAME EqualCons::tail_type >::compare(vc.get_tail(),c.get_tail(),v,eq.get_tail()); } }; template < typename KeyCons,typename Value, typename ValCons,typename EqualCons > struct equal_ckey_cval: mpl::if_< mpl::or_< is_same, is_same >, equal_ckey_cval_terminal, equal_ckey_cval_normal >::type { }; template < typename KeyCons1,typename Value1, typename KeyCons2, typename Value2, typename CompareCons > struct compare_ckey_ckey; /* fwd decl. */ template < typename KeyCons1,typename Value1, typename KeyCons2, typename Value2, typename CompareCons > struct compare_ckey_ckey_terminal { static bool compare( const KeyCons1&,const Value1&, const KeyCons2&,const Value2&, const CompareCons&) { return false; } }; template < typename KeyCons1,typename Value1, typename KeyCons2, typename Value2, typename CompareCons > struct compare_ckey_ckey_normal { static bool compare( const KeyCons1& c0,const Value1& v0, const KeyCons2& c1,const Value2& v1, const CompareCons& comp) { if(comp.get_head()(c0.get_head()(v0),c1.get_head()(v1)))return true; if(comp.get_head()(c1.get_head()(v1),c0.get_head()(v0)))return false; return compare_ckey_ckey< BOOST_DEDUCED_TYPENAME KeyCons1::tail_type,Value1, BOOST_DEDUCED_TYPENAME KeyCons2::tail_type,Value2, BOOST_DEDUCED_TYPENAME CompareCons::tail_type >::compare(c0.get_tail(),v0,c1.get_tail(),v1,comp.get_tail()); } }; template < typename KeyCons1,typename Value1, typename KeyCons2, typename Value2, typename CompareCons > struct compare_ckey_ckey: mpl::if_< mpl::or_< is_same, is_same >, compare_ckey_ckey_terminal, compare_ckey_ckey_normal >::type { }; template < typename KeyCons,typename Value, typename ValCons,typename CompareCons > struct compare_ckey_cval; /* fwd decl. */ template < typename KeyCons,typename Value, typename ValCons,typename CompareCons > struct compare_ckey_cval_terminal { static bool compare( const KeyCons&,const Value&,const ValCons&,const CompareCons&) { return false; } static bool compare( const ValCons&,const KeyCons&,const Value&,const CompareCons&) { return false; } }; template < typename KeyCons,typename Value, typename ValCons,typename CompareCons > struct compare_ckey_cval_normal { static bool compare( const KeyCons& c,const Value& v,const ValCons& vc, const CompareCons& comp) { if(comp.get_head()(c.get_head()(v),vc.get_head()))return true; if(comp.get_head()(vc.get_head(),c.get_head()(v)))return false; return compare_ckey_cval< BOOST_DEDUCED_TYPENAME KeyCons::tail_type,Value, BOOST_DEDUCED_TYPENAME ValCons::tail_type, BOOST_DEDUCED_TYPENAME CompareCons::tail_type >::compare(c.get_tail(),v,vc.get_tail(),comp.get_tail()); } static bool compare( const ValCons& vc,const KeyCons& c,const Value& v, const CompareCons& comp) { if(comp.get_head()(vc.get_head(),c.get_head()(v)))return true; if(comp.get_head()(c.get_head()(v),vc.get_head()))return false; return compare_ckey_cval< BOOST_DEDUCED_TYPENAME KeyCons::tail_type,Value, BOOST_DEDUCED_TYPENAME ValCons::tail_type, BOOST_DEDUCED_TYPENAME CompareCons::tail_type >::compare(vc.get_tail(),c.get_tail(),v,comp.get_tail()); } }; template < typename KeyCons,typename Value, typename ValCons,typename CompareCons > struct compare_ckey_cval: mpl::if_< mpl::or_< is_same, is_same >, compare_ckey_cval_terminal, compare_ckey_cval_normal >::type { }; template struct hash_ckey; /* fwd decl. */ template struct hash_ckey_terminal { static std::size_t hash( const KeyCons&,const Value&,const HashCons&,std::size_t carry) { return carry; } }; template struct hash_ckey_normal { static std::size_t hash( const KeyCons& c,const Value& v,const HashCons& h,std::size_t carry=0) { /* same hashing formula as boost::hash_combine */ carry^=h.get_head()(c.get_head()(v))+0x9e3779b9+(carry<<6)+(carry>>2); return hash_ckey< BOOST_DEDUCED_TYPENAME KeyCons::tail_type,Value, BOOST_DEDUCED_TYPENAME HashCons::tail_type >::hash(c.get_tail(),v,h.get_tail(),carry); } }; template struct hash_ckey: mpl::if_< is_same, hash_ckey_terminal, hash_ckey_normal >::type { }; template struct hash_cval; /* fwd decl. */ template struct hash_cval_terminal { static std::size_t hash(const ValCons&,const HashCons&,std::size_t carry) { return carry; } }; template struct hash_cval_normal { static std::size_t hash( const ValCons& vc,const HashCons& h,std::size_t carry=0) { carry^=h.get_head()(vc.get_head())+0x9e3779b9+(carry<<6)+(carry>>2); return hash_cval< BOOST_DEDUCED_TYPENAME ValCons::tail_type, BOOST_DEDUCED_TYPENAME HashCons::tail_type >::hash(vc.get_tail(),h.get_tail(),carry); } }; template struct hash_cval: mpl::if_< is_same, hash_cval_terminal, hash_cval_normal >::type { }; } /* namespace multi_index::detail */ /* composite_key_result */ #if defined(BOOST_MSVC) #pragma warning(push) #pragma warning(disable:4512) #endif template struct composite_key_result { typedef CompositeKey composite_key_type; typedef typename composite_key_type::value_type value_type; composite_key_result( const composite_key_type& composite_key_,const value_type& value_): composite_key(composite_key_),value(value_) {} const composite_key_type& composite_key; const value_type& value; }; #if defined(BOOST_MSVC) #pragma warning(pop) #endif /* composite_key */ /* NB. Some overloads of operator() have an extra dummy parameter int=0. * This disambiguator serves several purposes: * - Without it, MSVC++ 6.0 incorrectly regards some overloads as * specializations of a previous member function template. * - MSVC++ 6.0/7.0 seem to incorrectly treat some different memfuns * as if they have the same signature. * - If remove_const is broken due to lack of PTS, int=0 avoids the * declaration of memfuns with identical signature. */ template< typename Value, BOOST_MULTI_INDEX_CK_ENUM(BOOST_MULTI_INDEX_CK_TEMPLATE_PARM,KeyFromValue) > struct composite_key: private tuple { private: typedef tuple super; public: typedef super key_extractor_tuple; typedef Value value_type; typedef composite_key_result result_type; composite_key( BOOST_MULTI_INDEX_CK_ENUM(BOOST_MULTI_INDEX_CK_CTOR_ARG,KeyFromValue)): super(BOOST_MULTI_INDEX_CK_ENUM_PARAMS(k)) {} composite_key(const key_extractor_tuple& x):super(x){} const key_extractor_tuple& key_extractors()const{return *this;} key_extractor_tuple& key_extractors(){return *this;} template #if !defined(BOOST_NO_SFINAE) typename disable_if< is_convertible,result_type>::type #else result_type #endif operator()(const ChainedPtr& x)const { return operator()(*x); } result_type operator()(const value_type& x)const { return result_type(*this,x); } result_type operator()(const reference_wrapper& x)const { return result_type(*this,x.get()); } result_type operator()(const reference_wrapper& x,int=0)const { return result_type(*this,x.get()); } }; /* comparison operators */ /* == */ template inline bool operator==( const composite_key_result& x, const composite_key_result& y) { typedef typename CompositeKey1::key_extractor_tuple key_extractor_tuple1; typedef typename CompositeKey1::value_type value_type1; typedef typename CompositeKey2::key_extractor_tuple key_extractor_tuple2; typedef typename CompositeKey2::value_type value_type2; BOOST_STATIC_ASSERT( tuples::length::value== tuples::length::value); return detail::equal_ckey_ckey< key_extractor_tuple1,value_type1, key_extractor_tuple2,value_type2, detail::generic_operator_equal_tuple >::compare( x.composite_key.key_extractors(),x.value, y.composite_key.key_extractors(),y.value, detail::generic_operator_equal_tuple()); } template< typename CompositeKey, BOOST_MULTI_INDEX_CK_ENUM_PARAMS(typename Value) > inline bool operator==( const composite_key_result& x, const tuple& y) { typedef typename CompositeKey::key_extractor_tuple key_extractor_tuple; typedef typename CompositeKey::value_type value_type; typedef tuple key_tuple; BOOST_STATIC_ASSERT( tuples::length::value== tuples::length::value); return detail::equal_ckey_cval< key_extractor_tuple,value_type, key_tuple,detail::generic_operator_equal_tuple >::compare( x.composite_key.key_extractors(),x.value, y,detail::generic_operator_equal_tuple()); } template < BOOST_MULTI_INDEX_CK_ENUM_PARAMS(typename Value), typename CompositeKey > inline bool operator==( const tuple& x, const composite_key_result& y) { typedef typename CompositeKey::key_extractor_tuple key_extractor_tuple; typedef typename CompositeKey::value_type value_type; typedef tuple key_tuple; BOOST_STATIC_ASSERT( tuples::length::value== tuples::length::value); return detail::equal_ckey_cval< key_extractor_tuple,value_type, key_tuple,detail::generic_operator_equal_tuple >::compare( x,y.composite_key.key_extractors(), y.value,detail::generic_operator_equal_tuple()); } /* < */ template inline bool operator<( const composite_key_result& x, const composite_key_result& y) { typedef typename CompositeKey1::key_extractor_tuple key_extractor_tuple1; typedef typename CompositeKey1::value_type value_type1; typedef typename CompositeKey2::key_extractor_tuple key_extractor_tuple2; typedef typename CompositeKey2::value_type value_type2; return detail::compare_ckey_ckey< key_extractor_tuple1,value_type1, key_extractor_tuple2,value_type2, detail::generic_operator_less_tuple >::compare( x.composite_key.key_extractors(),x.value, y.composite_key.key_extractors(),y.value, detail::generic_operator_less_tuple()); } template < typename CompositeKey, BOOST_MULTI_INDEX_CK_ENUM_PARAMS(typename Value) > inline bool operator<( const composite_key_result& x, const tuple& y) { typedef typename CompositeKey::key_extractor_tuple key_extractor_tuple; typedef typename CompositeKey::value_type value_type; typedef tuple key_tuple; return detail::compare_ckey_cval< key_extractor_tuple,value_type, key_tuple,detail::generic_operator_less_tuple >::compare( x.composite_key.key_extractors(),x.value, y,detail::generic_operator_less_tuple()); } template < BOOST_MULTI_INDEX_CK_ENUM_PARAMS(typename Value), typename CompositeKey > inline bool operator<( const tuple& x, const composite_key_result& y) { typedef typename CompositeKey::key_extractor_tuple key_extractor_tuple; typedef typename CompositeKey::value_type value_type; typedef tuple key_tuple; return detail::compare_ckey_cval< key_extractor_tuple,value_type, key_tuple,detail::generic_operator_less_tuple >::compare( x,y.composite_key.key_extractors(), y.value,detail::generic_operator_less_tuple()); } /* rest of comparison operators */ #define BOOST_MULTI_INDEX_CK_COMPLETE_COMP_OPS(t1,t2,a1,a2) \ template inline bool operator!=(const a1& x,const a2& y) \ { \ return !(x==y); \ } \ \ template inline bool operator>(const a1& x,const a2& y) \ { \ return y inline bool operator>=(const a1& x,const a2& y) \ { \ return !(x inline bool operator<=(const a1& x,const a2& y) \ { \ return !(y, composite_key_result ) BOOST_MULTI_INDEX_CK_COMPLETE_COMP_OPS( typename CompositeKey, BOOST_MULTI_INDEX_CK_ENUM_PARAMS(typename Value), composite_key_result, tuple ) BOOST_MULTI_INDEX_CK_COMPLETE_COMP_OPS( BOOST_MULTI_INDEX_CK_ENUM_PARAMS(typename Value), typename CompositeKey, tuple, composite_key_result ) /* composite_key_equal_to */ template < BOOST_MULTI_INDEX_CK_ENUM(BOOST_MULTI_INDEX_CK_TEMPLATE_PARM,Pred) > struct composite_key_equal_to: private tuple { private: typedef tuple super; public: typedef super key_eq_tuple; composite_key_equal_to( BOOST_MULTI_INDEX_CK_ENUM(BOOST_MULTI_INDEX_CK_CTOR_ARG,Pred)): super(BOOST_MULTI_INDEX_CK_ENUM_PARAMS(k)) {} composite_key_equal_to(const key_eq_tuple& x):super(x){} const key_eq_tuple& key_eqs()const{return *this;} key_eq_tuple& key_eqs(){return *this;} template bool operator()( const composite_key_result & x, const composite_key_result & y)const { typedef typename CompositeKey1::key_extractor_tuple key_extractor_tuple1; typedef typename CompositeKey1::value_type value_type1; typedef typename CompositeKey2::key_extractor_tuple key_extractor_tuple2; typedef typename CompositeKey2::value_type value_type2; BOOST_STATIC_ASSERT( tuples::length::value<= tuples::length::value&& tuples::length::value== tuples::length::value); return detail::equal_ckey_ckey< key_extractor_tuple1,value_type1, key_extractor_tuple2,value_type2, key_eq_tuple >::compare( x.composite_key.key_extractors(),x.value, y.composite_key.key_extractors(),y.value, key_eqs()); } template < typename CompositeKey, BOOST_MULTI_INDEX_CK_ENUM_PARAMS(typename Value) > bool operator()( const composite_key_result& x, const tuple& y)const { typedef typename CompositeKey::key_extractor_tuple key_extractor_tuple; typedef typename CompositeKey::value_type value_type; typedef tuple key_tuple; BOOST_STATIC_ASSERT( tuples::length::value<= tuples::length::value&& tuples::length::value== tuples::length::value); return detail::equal_ckey_cval< key_extractor_tuple,value_type, key_tuple,key_eq_tuple >::compare(x.composite_key.key_extractors(),x.value,y,key_eqs()); } template < BOOST_MULTI_INDEX_CK_ENUM_PARAMS(typename Value), typename CompositeKey > bool operator()( const tuple& x, const composite_key_result& y)const { typedef typename CompositeKey::key_extractor_tuple key_extractor_tuple; typedef typename CompositeKey::value_type value_type; typedef tuple key_tuple; BOOST_STATIC_ASSERT( tuples::length::value<= tuples::length::value&& tuples::length::value== tuples::length::value); return detail::equal_ckey_cval< key_extractor_tuple,value_type, key_tuple,key_eq_tuple >::compare(x,y.composite_key.key_extractors(),y.value,key_eqs()); } }; /* composite_key_compare */ template < BOOST_MULTI_INDEX_CK_ENUM(BOOST_MULTI_INDEX_CK_TEMPLATE_PARM,Compare) > struct composite_key_compare: private tuple { private: typedef tuple super; public: typedef super key_comp_tuple; composite_key_compare( BOOST_MULTI_INDEX_CK_ENUM(BOOST_MULTI_INDEX_CK_CTOR_ARG,Compare)): super(BOOST_MULTI_INDEX_CK_ENUM_PARAMS(k)) {} composite_key_compare(const key_comp_tuple& x):super(x){} const key_comp_tuple& key_comps()const{return *this;} key_comp_tuple& key_comps(){return *this;} template bool operator()( const composite_key_result & x, const composite_key_result & y)const { typedef typename CompositeKey1::key_extractor_tuple key_extractor_tuple1; typedef typename CompositeKey1::value_type value_type1; typedef typename CompositeKey2::key_extractor_tuple key_extractor_tuple2; typedef typename CompositeKey2::value_type value_type2; BOOST_STATIC_ASSERT( tuples::length::value<= tuples::length::value|| tuples::length::value<= tuples::length::value); return detail::compare_ckey_ckey< key_extractor_tuple1,value_type1, key_extractor_tuple2,value_type2, key_comp_tuple >::compare( x.composite_key.key_extractors(),x.value, y.composite_key.key_extractors(),y.value, key_comps()); } #if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) template bool operator()( const composite_key_result& x, const Value& y)const { return operator()(x,boost::make_tuple(boost::cref(y))); } #endif template < typename CompositeKey, BOOST_MULTI_INDEX_CK_ENUM_PARAMS(typename Value) > bool operator()( const composite_key_result& x, const tuple& y)const { typedef typename CompositeKey::key_extractor_tuple key_extractor_tuple; typedef typename CompositeKey::value_type value_type; typedef tuple key_tuple; BOOST_STATIC_ASSERT( tuples::length::value<= tuples::length::value|| tuples::length::value<= tuples::length::value); return detail::compare_ckey_cval< key_extractor_tuple,value_type, key_tuple,key_comp_tuple >::compare(x.composite_key.key_extractors(),x.value,y,key_comps()); } #if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) template bool operator()( const Value& x, const composite_key_result& y)const { return operator()(boost::make_tuple(boost::cref(x)),y); } #endif template < BOOST_MULTI_INDEX_CK_ENUM_PARAMS(typename Value), typename CompositeKey > bool operator()( const tuple& x, const composite_key_result& y)const { typedef typename CompositeKey::key_extractor_tuple key_extractor_tuple; typedef typename CompositeKey::value_type value_type; typedef tuple key_tuple; BOOST_STATIC_ASSERT( tuples::length::value<= tuples::length::value|| tuples::length::value<= tuples::length::value); return detail::compare_ckey_cval< key_extractor_tuple,value_type, key_tuple,key_comp_tuple >::compare(x,y.composite_key.key_extractors(),y.value,key_comps()); } }; /* composite_key_hash */ template < BOOST_MULTI_INDEX_CK_ENUM(BOOST_MULTI_INDEX_CK_TEMPLATE_PARM,Hash) > struct composite_key_hash: private tuple { private: typedef tuple super; public: typedef super key_hasher_tuple; composite_key_hash( BOOST_MULTI_INDEX_CK_ENUM(BOOST_MULTI_INDEX_CK_CTOR_ARG,Hash)): super(BOOST_MULTI_INDEX_CK_ENUM_PARAMS(k)) {} composite_key_hash(const key_hasher_tuple& x):super(x){} const key_hasher_tuple& key_hash_functions()const{return *this;} key_hasher_tuple& key_hash_functions(){return *this;} template std::size_t operator()(const composite_key_result & x)const { typedef typename CompositeKey::key_extractor_tuple key_extractor_tuple; typedef typename CompositeKey::value_type value_type; BOOST_STATIC_ASSERT( tuples::length::value== tuples::length::value); return detail::hash_ckey< key_extractor_tuple,value_type, key_hasher_tuple >::hash(x.composite_key.key_extractors(),x.value,key_hash_functions()); } template std::size_t operator()( const tuple& x)const { typedef tuple key_tuple; BOOST_STATIC_ASSERT( tuples::length::value== tuples::length::value); return detail::hash_cval< key_tuple,key_hasher_tuple >::hash(x,key_hash_functions()); } }; /* Instantiations of the former functors with "natural" basic components: * composite_key_result_equal_to uses std::equal_to of the values. * composite_key_result_less uses std::less. * composite_key_result_greater uses std::greater. * composite_key_result_hash uses boost::hash. */ #define BOOST_MULTI_INDEX_CK_RESULT_EQUAL_TO_SUPER \ composite_key_equal_to< \ BOOST_MULTI_INDEX_CK_ENUM( \ BOOST_MULTI_INDEX_CK_APPLY_METAFUNCTION_N, \ /* the argument is a PP list */ \ (detail::nth_composite_key_equal_to, \ (BOOST_DEDUCED_TYPENAME CompositeKeyResult::composite_key_type, \ BOOST_PP_NIL))) \ > template struct composite_key_result_equal_to: BOOST_MULTI_INDEX_PRIVATE_IF_USING_DECL_FOR_TEMPL_FUNCTIONS BOOST_MULTI_INDEX_CK_RESULT_EQUAL_TO_SUPER { private: typedef BOOST_MULTI_INDEX_CK_RESULT_EQUAL_TO_SUPER super; public: typedef CompositeKeyResult first_argument_type; typedef first_argument_type second_argument_type; typedef bool result_type; using super::operator(); }; #define BOOST_MULTI_INDEX_CK_RESULT_LESS_SUPER \ composite_key_compare< \ BOOST_MULTI_INDEX_CK_ENUM( \ BOOST_MULTI_INDEX_CK_APPLY_METAFUNCTION_N, \ /* the argument is a PP list */ \ (detail::nth_composite_key_less, \ (BOOST_DEDUCED_TYPENAME CompositeKeyResult::composite_key_type, \ BOOST_PP_NIL))) \ > template struct composite_key_result_less: BOOST_MULTI_INDEX_PRIVATE_IF_USING_DECL_FOR_TEMPL_FUNCTIONS BOOST_MULTI_INDEX_CK_RESULT_LESS_SUPER { private: typedef BOOST_MULTI_INDEX_CK_RESULT_LESS_SUPER super; public: typedef CompositeKeyResult first_argument_type; typedef first_argument_type second_argument_type; typedef bool result_type; using super::operator(); }; #define BOOST_MULTI_INDEX_CK_RESULT_GREATER_SUPER \ composite_key_compare< \ BOOST_MULTI_INDEX_CK_ENUM( \ BOOST_MULTI_INDEX_CK_APPLY_METAFUNCTION_N, \ /* the argument is a PP list */ \ (detail::nth_composite_key_greater, \ (BOOST_DEDUCED_TYPENAME CompositeKeyResult::composite_key_type, \ BOOST_PP_NIL))) \ > template struct composite_key_result_greater: BOOST_MULTI_INDEX_PRIVATE_IF_USING_DECL_FOR_TEMPL_FUNCTIONS BOOST_MULTI_INDEX_CK_RESULT_GREATER_SUPER { private: typedef BOOST_MULTI_INDEX_CK_RESULT_GREATER_SUPER super; public: typedef CompositeKeyResult first_argument_type; typedef first_argument_type second_argument_type; typedef bool result_type; using super::operator(); }; #define BOOST_MULTI_INDEX_CK_RESULT_HASH_SUPER \ composite_key_hash< \ BOOST_MULTI_INDEX_CK_ENUM( \ BOOST_MULTI_INDEX_CK_APPLY_METAFUNCTION_N, \ /* the argument is a PP list */ \ (detail::nth_composite_key_hash, \ (BOOST_DEDUCED_TYPENAME CompositeKeyResult::composite_key_type, \ BOOST_PP_NIL))) \ > template struct composite_key_result_hash: BOOST_MULTI_INDEX_PRIVATE_IF_USING_DECL_FOR_TEMPL_FUNCTIONS BOOST_MULTI_INDEX_CK_RESULT_HASH_SUPER { private: typedef BOOST_MULTI_INDEX_CK_RESULT_HASH_SUPER super; public: typedef CompositeKeyResult argument_type; typedef std::size_t result_type; using super::operator(); }; } /* namespace multi_index */ } /* namespace boost */ /* Specializations of std::equal_to, std::less, std::greater and boost::hash * for composite_key_results enabling interoperation with tuples of values. */ #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) namespace std{ template struct equal_to >: boost::multi_index::composite_key_result_equal_to< boost::multi_index::composite_key_result > { }; template struct less >: boost::multi_index::composite_key_result_less< boost::multi_index::composite_key_result > { }; template struct greater >: boost::multi_index::composite_key_result_greater< boost::multi_index::composite_key_result > { }; } /* namespace std */ namespace boost{ template struct hash >: boost::multi_index::composite_key_result_hash< boost::multi_index::composite_key_result > { }; } /* namespace boost */ #else /* Lacking template partial specialization, std::equal_to, std::less and * std::greater will still work for composite_key_results although without * tuple interoperability. To achieve the same graceful degrading with * boost::hash, we define the appropriate hash_value overload. */ namespace boost{ #if !defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP) namespace multi_index{ #endif template inline std::size_t hash_value( const boost::multi_index::composite_key_result& x) { boost::multi_index::composite_key_result_hash< boost::multi_index::composite_key_result > h; return h(x); } #if !defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP) } /* namespace multi_index */ #endif } /* namespace boost */ #endif #undef BOOST_MULTI_INDEX_CK_RESULT_HASH_SUPER #undef BOOST_MULTI_INDEX_CK_RESULT_GREATER_SUPER #undef BOOST_MULTI_INDEX_CK_RESULT_LESS_SUPER #undef BOOST_MULTI_INDEX_CK_RESULT_EQUAL_TO_SUPER #undef BOOST_MULTI_INDEX_CK_COMPLETE_COMP_OPS #undef BOOST_MULTI_INDEX_CK_IDENTITY_ENUM_MACRO #undef BOOST_MULTI_INDEX_CK_NTH_COMPOSITE_KEY_FUNCTOR #undef BOOST_MULTI_INDEX_CK_APPLY_METAFUNCTION_N #undef BOOST_MULTI_INDEX_CK_CTOR_ARG #undef BOOST_MULTI_INDEX_CK_TEMPLATE_PARM #undef BOOST_MULTI_INDEX_CK_ENUM_PARAMS #undef BOOST_MULTI_INDEX_CK_ENUM #undef BOOST_MULTI_INDEX_COMPOSITE_KEY_SIZE #endif madp-0.4/src/boost/boost/multi_index/PaxHeaders.5405/identity_fwd.hpp0000644000000000000000000000007412717644140022551 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/identity_fwd.hpp0000664000372100037210000000107212717644140023400 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_IDENTITY_FWD_HPP #define BOOST_MULTI_INDEX_IDENTITY_FWD_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif namespace boost{ namespace multi_index{ template struct identity; } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/PaxHeaders.5405/random_access_index_fwd.hpp0000644000000000000000000000007412717644140024710 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/random_access_index_fwd.hpp0000664000372100037210000000432412717644140025542 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_RANDOM_ACCESS_INDEX_FWD_HPP #define BOOST_MULTI_INDEX_RANDOM_ACCESS_INDEX_FWD_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include namespace boost{ namespace multi_index{ namespace detail{ template class random_access_index; template< typename SuperMeta1,typename TagList1, typename SuperMeta2,typename TagList2 > bool operator==( const random_access_index& x, const random_access_index& y); template< typename SuperMeta1,typename TagList1, typename SuperMeta2,typename TagList2 > bool operator<( const random_access_index& x, const random_access_index& y); template< typename SuperMeta1,typename TagList1, typename SuperMeta2,typename TagList2 > bool operator!=( const random_access_index& x, const random_access_index& y); template< typename SuperMeta1,typename TagList1, typename SuperMeta2,typename TagList2 > bool operator>( const random_access_index& x, const random_access_index& y); template< typename SuperMeta1,typename TagList1, typename SuperMeta2,typename TagList2 > bool operator>=( const random_access_index& x, const random_access_index& y); template< typename SuperMeta1,typename TagList1, typename SuperMeta2,typename TagList2 > bool operator<=( const random_access_index& x, const random_access_index& y); template void swap( random_access_index& x, random_access_index& y); } /* namespace multi_index::detail */ /* index specifiers */ template > struct random_access; } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/PaxHeaders.5405/hashed_index_fwd.hpp0000644000000000000000000000007412717644140023343 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/hashed_index_fwd.hpp0000664000372100037210000000250112717644140024170 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_HASHED_INDEX_FWD_HPP #define BOOST_MULTI_INDEX_HASHED_INDEX_FWD_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include namespace boost{ namespace multi_index{ namespace detail{ template< typename KeyFromValue,typename Hash,typename Pred, typename SuperMeta,typename TagList,typename Category > class hashed_index; template< typename KeyFromValue,typename Hash,typename Pred, typename SuperMeta,typename TagList,typename Category > void swap( hashed_index& x, hashed_index& y); } /* namespace multi_index::detail */ /* hashed_index specifiers */ template< typename Arg1,typename Arg2=mpl::na, typename Arg3=mpl::na,typename Arg4=mpl::na > struct hashed_unique; template< typename Arg1,typename Arg2=mpl::na, typename Arg3=mpl::na,typename Arg4=mpl::na > struct hashed_non_unique; } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/PaxHeaders.5405/tag.hpp0000644000000000000000000000007412717644140020633 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/tag.hpp0000664000372100037210000000470712717644140021472 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_TAG_HPP #define BOOST_MULTI_INDEX_TAG_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include #include #include #include #include /* A wrapper of mpl::vector used to hide MPL from the user. * tag contains types used as tag names for indices in get() functions. */ /* This user_definable macro limits the number of elements of a tag; * useful for shortening resulting symbol names (MSVC++ 6.0, for instance, * has problems coping with very long symbol names.) */ #if !defined(BOOST_MULTI_INDEX_LIMIT_TAG_SIZE) #if defined(BOOST_MSVC)&&(BOOST_MSVC<1300) #define BOOST_MULTI_INDEX_LIMIT_TAG_SIZE 3 #else #define BOOST_MULTI_INDEX_LIMIT_TAG_SIZE BOOST_MPL_LIMIT_VECTOR_SIZE #endif #endif #if BOOST_MULTI_INDEX_LIMIT_TAG_SIZE struct is_tag { BOOST_STATIC_CONSTANT(bool,value=(is_base_and_derived::value)); }; } /* namespace multi_index::detail */ template< BOOST_PP_ENUM_BINARY_PARAMS( BOOST_MULTI_INDEX_TAG_SIZE, typename T, =mpl::na BOOST_PP_INTERCEPT) > struct tag:private detail::tag_marker { /* The mpl::transform pass produces shorter symbols (without * trailing mpl::na's.) */ typedef typename mpl::transform< mpl::vector, mpl::identity >::type type; BOOST_STATIC_ASSERT(detail::no_duplicate_tags::value); }; } /* namespace multi_index */ } /* namespace boost */ #undef BOOST_MULTI_INDEX_TAG_SIZE #endif madp-0.4/src/boost/boost/multi_index/PaxHeaders.5405/ordered_index_fwd.hpp0000644000000000000000000000007412717644140023533 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/ordered_index_fwd.hpp0000664000372100037210000000720212717644140024363 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_ORDERED_INDEX_FWD_HPP #define BOOST_MULTI_INDEX_ORDERED_INDEX_FWD_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include namespace boost{ namespace multi_index{ namespace detail{ template< typename KeyFromValue,typename Compare, typename SuperMeta,typename TagList,typename Category > class ordered_index; template< typename KeyFromValue1,typename Compare1, typename SuperMeta1,typename TagList1,typename Category1, typename KeyFromValue2,typename Compare2, typename SuperMeta2,typename TagList2,typename Category2 > bool operator==( const ordered_index< KeyFromValue1,Compare1,SuperMeta1,TagList1,Category1>& x, const ordered_index< KeyFromValue2,Compare2,SuperMeta2,TagList2,Category2>& y); template< typename KeyFromValue1,typename Compare1, typename SuperMeta1,typename TagList1,typename Category1, typename KeyFromValue2,typename Compare2, typename SuperMeta2,typename TagList2,typename Category2 > bool operator<( const ordered_index< KeyFromValue1,Compare1,SuperMeta1,TagList1,Category1>& x, const ordered_index< KeyFromValue2,Compare2,SuperMeta2,TagList2,Category2>& y); template< typename KeyFromValue1,typename Compare1, typename SuperMeta1,typename TagList1,typename Category1, typename KeyFromValue2,typename Compare2, typename SuperMeta2,typename TagList2,typename Category2 > bool operator!=( const ordered_index< KeyFromValue1,Compare1,SuperMeta1,TagList1,Category1>& x, const ordered_index< KeyFromValue2,Compare2,SuperMeta2,TagList2,Category2>& y); template< typename KeyFromValue1,typename Compare1, typename SuperMeta1,typename TagList1,typename Category1, typename KeyFromValue2,typename Compare2, typename SuperMeta2,typename TagList2,typename Category2 > bool operator>( const ordered_index< KeyFromValue1,Compare1,SuperMeta1,TagList1,Category1>& x, const ordered_index< KeyFromValue2,Compare2,SuperMeta2,TagList2,Category2>& y); template< typename KeyFromValue1,typename Compare1, typename SuperMeta1,typename TagList1,typename Category1, typename KeyFromValue2,typename Compare2, typename SuperMeta2,typename TagList2,typename Category2 > bool operator>=( const ordered_index< KeyFromValue1,Compare1,SuperMeta1,TagList1,Category1>& x, const ordered_index< KeyFromValue2,Compare2,SuperMeta2,TagList2,Category2>& y); template< typename KeyFromValue1,typename Compare1, typename SuperMeta1,typename TagList1,typename Category1, typename KeyFromValue2,typename Compare2, typename SuperMeta2,typename TagList2,typename Category2 > bool operator<=( const ordered_index< KeyFromValue1,Compare1,SuperMeta1,TagList1,Category1>& x, const ordered_index< KeyFromValue2,Compare2,SuperMeta2,TagList2,Category2>& y); template< typename KeyFromValue,typename Compare, typename SuperMeta,typename TagList,typename Category > void swap( ordered_index& x, ordered_index& y); } /* namespace multi_index::detail */ /* ordered_index specifiers */ template struct ordered_unique; template struct ordered_non_unique; } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/PaxHeaders.5405/indexed_by.hpp0000644000000000000000000000007412717644140022172 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/indexed_by.hpp0000664000372100037210000000410712717644140023023 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_INDEXED_BY_HPP #define BOOST_MULTI_INDEX_INDEXED_BY_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include /* An alias to mpl::vector used to hide MPL from the user. * indexed_by contains the index specifiers for instantiation * of a multi_index_container. */ /* This user_definable macro limits the number of elements of an index list; * useful for shortening resulting symbol names (MSVC++ 6.0, for instance, * has problems coping with very long symbol names.) */ #if !defined(BOOST_MULTI_INDEX_LIMIT_INDEXED_BY_SIZE) #if defined(BOOST_MSVC)&&(BOOST_MSVC<1300) #define BOOST_MULTI_INDEX_LIMIT_INDEXED_BY_SIZE 5 #else #define BOOST_MULTI_INDEX_LIMIT_INDEXED_BY_SIZE BOOST_MPL_LIMIT_VECTOR_SIZE #endif #endif #if BOOST_MULTI_INDEX_LIMIT_INDEXED_BY_SIZE struct indexed_by: mpl::vector { }; } /* namespace multi_index */ } /* namespace boost */ #undef BOOST_MULTI_INDEX_INDEXED_BY_TEMPLATE_PARM #undef BOOST_MULTI_INDEX_INDEXED_BY_SIZE #endif madp-0.4/src/boost/boost/multi_index/PaxHeaders.5405/identity.hpp0000644000000000000000000000007412717644140021711 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/identity.hpp0000664000372100037210000000652512717644140022550 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_IDENTITY_HPP #define BOOST_MULTI_INDEX_IDENTITY_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include #include #include #include #include #include #if !defined(BOOST_NO_SFINAE) #include #endif namespace boost{ template class reference_wrapper; /* fwd decl. */ namespace multi_index{ namespace detail{ /* identity is a do-nothing key extractor that returns the [const] Type& * object passed. * Additionally, identity is overloaded to support referece_wrappers * of Type and "chained pointers" to Type's. By chained pointer to Type we * mean a type P such that, given a p of type P * *...n...*x is convertible to Type&, for some n>=1. * Examples of chained pointers are raw and smart pointers, iterators and * arbitrary combinations of these (vg. Type** or auto_ptr.) */ /* NB. Some overloads of operator() have an extra dummy parameter int=0. * This disambiguator serves several purposes: * - Without it, MSVC++ 6.0 incorrectly regards some overloads as * specializations of a previous member function template. * - MSVC++ 6.0/7.0 seem to incorrectly treat some different memfuns * as if they have the same signature. * - If remove_const is broken due to lack of PTS, int=0 avoids the * declaration of memfuns with identical signature. */ template struct const_identity_base { typedef Type result_type; template #if !defined(BOOST_NO_SFINAE) typename disable_if,Type&>::type #else Type& #endif operator()(const ChainedPtr& x)const { return operator()(*x); } Type& operator()(Type& x)const { return x; } Type& operator()(const reference_wrapper& x)const { return x.get(); } Type& operator()( const reference_wrapper::type>& x,int=0)const { return x.get(); } }; template struct non_const_identity_base { typedef Type result_type; /* templatized for pointer-like types */ template #if !defined(BOOST_NO_SFINAE) typename disable_if< is_convertible,Type&>::type #else Type& #endif operator()(const ChainedPtr& x)const { return operator()(*x); } const Type& operator()(const Type& x,int=0)const { return x; } Type& operator()(Type& x)const { return x; } const Type& operator()(const reference_wrapper& x,int=0)const { return x.get(); } Type& operator()(const reference_wrapper& x)const { return x.get(); } }; } /* namespace multi_index::detail */ template struct identity: mpl::if_c< is_const::value, detail::const_identity_base,detail::non_const_identity_base >::type { }; } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/multi_index/PaxHeaders.5405/member.hpp0000644000000000000000000000007412717644140021327 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/multi_index/member.hpp0000664000372100037210000001537012717644140022164 0ustar00fransfrans00000000000000/* Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_MEMBER_HPP #define BOOST_MULTI_INDEX_MEMBER_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #if !defined(BOOST_NO_SFINAE) #include #endif namespace boost{ template class reference_wrapper; /* fwd decl. */ namespace multi_index{ namespace detail{ /* member is a read/write key extractor for accessing a given * member of a class. * Additionally, member is overloaded to support referece_wrappers * of T and "chained pointers" to T's. By chained pointer to T we mean * a type P such that, given a p of Type P * *...n...*x is convertible to T&, for some n>=1. * Examples of chained pointers are raw and smart pointers, iterators and * arbitrary combinations of these (vg. T** or auto_ptr.) */ /* NB. Some overloads of operator() have an extra dummy parameter int=0. * This disambiguator serves several purposes: * - Without it, MSVC++ 6.0 incorrectly regards some overloads as * specializations of a previous member function template. * - MSVC++ 6.0/7.0 seem to incorrectly treat some different memfuns * as if they have the same signature. * - If remove_const is broken due to lack of PTS, int=0 avoids the * declaration of memfuns with identical signature. */ template struct const_member_base { typedef Type result_type; template #if !defined(BOOST_NO_SFINAE) typename disable_if< is_convertible,Type&>::type #else Type& #endif operator()(const ChainedPtr& x)const { return operator()(*x); } Type& operator()(const Class& x)const { return x.*PtrToMember; } Type& operator()(const reference_wrapper& x)const { return operator()(x.get()); } Type& operator()(const reference_wrapper& x,int=0)const { return operator()(x.get()); } }; template struct non_const_member_base { typedef Type result_type; template #if !defined(BOOST_NO_SFINAE) typename disable_if< is_convertible,Type&>::type #else Type& #endif operator()(const ChainedPtr& x)const { return operator()(*x); } const Type& operator()(const Class& x,int=0)const { return x.*PtrToMember; } Type& operator()(Class& x)const { return x.*PtrToMember; } const Type& operator()(const reference_wrapper& x,int=0)const { return operator()(x.get()); } Type& operator()(const reference_wrapper& x)const { return operator()(x.get()); } }; } /* namespace multi_index::detail */ template struct member: mpl::if_c< is_const::value, detail::const_member_base, detail::non_const_member_base >::type { }; namespace detail{ /* MSVC++ 6.0 does not support properly pointers to members as * non-type template arguments, as reported in * http://support.microsoft.com/default.aspx?scid=kb;EN-US;249045 * A similar problem (though not identical) is shown by MSVC++ 7.0. * We provide an alternative to member<> accepting offsets instead * of pointers to members. This happens to work even for non-POD * types (although the standard forbids use of offsetof on these), * so it serves as a workaround in this compiler for all practical * purposes. * Surprisingly enough, other compilers, like Intel C++ 7.0/7.1 and * Visual Age 6.0, have similar bugs. This replacement of member<> * can be used for them too. */ template struct const_member_offset_base { typedef Type result_type; template #if !defined(BOOST_NO_SFINAE) typename disable_if< is_convertible,Type&>::type #else Type& #endif operator()(const ChainedPtr& x)const { return operator()(*x); } Type& operator()(const Class& x)const { return *static_cast( static_cast( static_cast( static_cast(&x))+OffsetOfMember)); } Type& operator()(const reference_wrapper& x)const { return operator()(x.get()); } Type& operator()(const reference_wrapper& x,int=0)const { return operator()(x.get()); } }; template struct non_const_member_offset_base { typedef Type result_type; template #if !defined(BOOST_NO_SFINAE) typename disable_if< is_convertible,Type&>::type #else Type& #endif operator()(const ChainedPtr& x)const { return operator()(*x); } const Type& operator()(const Class& x,int=0)const { return *static_cast( static_cast( static_cast( static_cast(&x))+OffsetOfMember)); } Type& operator()(Class& x)const { return *static_cast( static_cast( static_cast(static_cast(&x))+OffsetOfMember)); } const Type& operator()(const reference_wrapper& x,int=0)const { return operator()(x.get()); } Type& operator()(const reference_wrapper& x)const { return operator()(x.get()); } }; } /* namespace multi_index::detail */ template struct member_offset: mpl::if_c< is_const::value, detail::const_member_offset_base, detail::non_const_member_offset_base >::type { }; /* BOOST_MULTI_INDEX_MEMBER resolves to member in the normal cases, * and to member_offset as a workaround in those defective compilers for * which BOOST_NO_POINTER_TO_MEMBER_TEMPLATE_PARAMETERS is defined. */ #if defined(BOOST_NO_POINTER_TO_MEMBER_TEMPLATE_PARAMETERS) #define BOOST_MULTI_INDEX_MEMBER(Class,Type,MemberName) \ ::boost::multi_index::member_offset< Class,Type,offsetof(Class,MemberName) > #else #define BOOST_MULTI_INDEX_MEMBER(Class,Type,MemberName) \ ::boost::multi_index::member< Class,Type,&Class::MemberName > #endif } /* namespace multi_index */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/PaxHeaders.5405/multi_array.hpp0000644000000000000000000000007412717644140020067 xustar0030 atime=1463765180.121719998 30 ctime=1463765201.093552501 madp-0.4/src/boost/boost/multi_array.hpp0000664000372100037210000003576712717644140020740 0ustar00fransfrans00000000000000// Copyright 2002 The Trustees of Indiana University. // Use, modification and distribution is subject to the Boost Software // License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // Boost.MultiArray Library // Authors: Ronald Garcia // Jeremy Siek // Andrew Lumsdaine // See http://www.boost.org/libs/multi_array for documentation. #ifndef BOOST_MULTI_ARRAY_RG071801_HPP #define BOOST_MULTI_ARRAY_RG071801_HPP // // multi_array.hpp - contains the multi_array class template // declaration and definition // #include "boost/multi_array/base.hpp" #include "boost/multi_array/collection_concept.hpp" #include "boost/multi_array/copy_array.hpp" #include "boost/multi_array/iterator.hpp" #include "boost/multi_array/subarray.hpp" #include "boost/multi_array/multi_array_ref.hpp" #include "boost/multi_array/algorithm.hpp" #include "boost/array.hpp" #include "boost/mpl/if.hpp" #include "boost/type_traits.hpp" #include #include #include #include #include namespace boost { namespace detail { namespace multi_array { struct populate_index_ranges { multi_array_types::index_range // RG: underscore on extent_ to stifle strange MSVC warning. operator()(multi_array_types::index base, multi_array_types::size_type extent_) { return multi_array_types::index_range(base,base+extent_); } }; #ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING // // Compilers that don't support partial ordering may need help to // disambiguate multi_array's templated constructors. Even vc6/7 are // capable of some limited SFINAE, so we take the most-general version // out of the overload set with disable_multi_array_impl. // template char is_multi_array_impl_help(const_multi_array_view&); template char is_multi_array_impl_help(const_sub_array&); template char is_multi_array_impl_help(const_multi_array_ref&); char ( &is_multi_array_impl_help(...) )[2]; template struct is_multi_array_impl { static T x; BOOST_STATIC_CONSTANT(bool, value = sizeof((is_multi_array_impl_help)(x)) == 1); typedef mpl::bool_ type; }; template struct disable_multi_array_impl_impl { typedef int type; }; template <> struct disable_multi_array_impl_impl { // forming a pointer to a reference triggers SFINAE typedef int& type; }; template struct disable_multi_array_impl : disable_multi_array_impl_impl::value> { }; template <> struct disable_multi_array_impl { typedef int type; }; #endif } //namespace multi_array } // namespace detail template class multi_array : public multi_array_ref { typedef multi_array_ref super_type; public: typedef typename super_type::value_type value_type; typedef typename super_type::reference reference; typedef typename super_type::const_reference const_reference; typedef typename super_type::iterator iterator; typedef typename super_type::const_iterator const_iterator; typedef typename super_type::reverse_iterator reverse_iterator; typedef typename super_type::const_reverse_iterator const_reverse_iterator; typedef typename super_type::element element; typedef typename super_type::size_type size_type; typedef typename super_type::difference_type difference_type; typedef typename super_type::index index; typedef typename super_type::extent_range extent_range; template struct const_array_view { typedef boost::detail::multi_array::const_multi_array_view type; }; template struct array_view { typedef boost::detail::multi_array::multi_array_view type; }; explicit multi_array() : super_type((T*)initial_base_,c_storage_order(), /*index_bases=*/0, /*extents=*/0) { allocate_space(); } template explicit multi_array( ExtentList const& extents #ifdef BOOST_NO_FUNCTION_TEMPLATE_ORDERING , typename mpl::if_< detail::multi_array::is_multi_array_impl, int&,int>::type* = 0 #endif ) : super_type((T*)initial_base_,extents) { boost::function_requires< detail::multi_array::CollectionConcept >(); allocate_space(); } template explicit multi_array(ExtentList const& extents, const general_storage_order& so) : super_type((T*)initial_base_,extents,so) { boost::function_requires< detail::multi_array::CollectionConcept >(); allocate_space(); } template explicit multi_array(ExtentList const& extents, const general_storage_order& so, Allocator const& alloc) : super_type((T*)initial_base_,extents,so), allocator_(alloc) { boost::function_requires< detail::multi_array::CollectionConcept >(); allocate_space(); } explicit multi_array(const detail::multi_array ::extent_gen& ranges) : super_type((T*)initial_base_,ranges) { allocate_space(); } explicit multi_array(const detail::multi_array ::extent_gen& ranges, const general_storage_order& so) : super_type((T*)initial_base_,ranges,so) { allocate_space(); } explicit multi_array(const detail::multi_array ::extent_gen& ranges, const general_storage_order& so, Allocator const& alloc) : super_type((T*)initial_base_,ranges,so), allocator_(alloc) { allocate_space(); } multi_array(const multi_array& rhs) : super_type(rhs), allocator_(rhs.allocator_) { allocate_space(); boost::detail::multi_array::copy_n(rhs.base_,rhs.num_elements(),base_); } // // A multi_array is constructible from any multi_array_ref, subarray, or // array_view object. The following constructors ensure that. // // Due to limited support for partial template ordering, // MSVC 6&7 confuse the following with the most basic ExtentList // constructor. #ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING template multi_array(const const_multi_array_ref& rhs, const general_storage_order& so = c_storage_order()) : super_type(0,so,rhs.index_bases(),rhs.shape()) { allocate_space(); // Warning! storage order may change, hence the following copy technique. std::copy(rhs.begin(),rhs.end(),this->begin()); } template multi_array(const detail::multi_array:: const_sub_array& rhs, const general_storage_order& so = c_storage_order()) : super_type(0,so,rhs.index_bases(),rhs.shape()) { allocate_space(); std::copy(rhs.begin(),rhs.end(),this->begin()); } template multi_array(const detail::multi_array:: const_multi_array_view& rhs, const general_storage_order& so = c_storage_order()) : super_type(0,so,rhs.index_bases(),rhs.shape()) { allocate_space(); std::copy(rhs.begin(),rhs.end(),this->begin()); } #else // BOOST_NO_FUNCTION_TEMPLATE_ORDERING // More limited support for MSVC multi_array(const const_multi_array_ref& rhs) : super_type(0,c_storage_order(),rhs.index_bases(),rhs.shape()) { allocate_space(); // Warning! storage order may change, hence the following copy technique. std::copy(rhs.begin(),rhs.end(),this->begin()); } multi_array(const const_multi_array_ref& rhs, const general_storage_order& so) : super_type(0,so,rhs.index_bases(),rhs.shape()) { allocate_space(); // Warning! storage order may change, hence the following copy technique. std::copy(rhs.begin(),rhs.end(),this->begin()); } multi_array(const detail::multi_array:: const_sub_array& rhs) : super_type(0,c_storage_order(),rhs.index_bases(),rhs.shape()) { allocate_space(); std::copy(rhs.begin(),rhs.end(),this->begin()); } multi_array(const detail::multi_array:: const_sub_array& rhs, const general_storage_order& so) : super_type(0,so,rhs.index_bases(),rhs.shape()) { allocate_space(); std::copy(rhs.begin(),rhs.end(),this->begin()); } multi_array(const detail::multi_array:: const_multi_array_view& rhs) : super_type(0,c_storage_order(),rhs.index_bases(),rhs.shape()) { allocate_space(); std::copy(rhs.begin(),rhs.end(),this->begin()); } multi_array(const detail::multi_array:: const_multi_array_view& rhs, const general_storage_order& so) : super_type(0,so,rhs.index_bases(),rhs.shape()) { allocate_space(); std::copy(rhs.begin(),rhs.end(),this->begin()); } #endif // !BOOST_NO_FUNCTION_TEMPLATE_ORDERING // Thes constructors are necessary because of more exact template matches. multi_array(const multi_array_ref& rhs) : super_type(0,c_storage_order(),rhs.index_bases(),rhs.shape()) { allocate_space(); // Warning! storage order may change, hence the following copy technique. std::copy(rhs.begin(),rhs.end(),this->begin()); } multi_array(const multi_array_ref& rhs, const general_storage_order& so) : super_type(0,so,rhs.index_bases(),rhs.shape()) { allocate_space(); // Warning! storage order may change, hence the following copy technique. std::copy(rhs.begin(),rhs.end(),this->begin()); } multi_array(const detail::multi_array:: sub_array& rhs) : super_type(0,c_storage_order(),rhs.index_bases(),rhs.shape()) { allocate_space(); std::copy(rhs.begin(),rhs.end(),this->begin()); } multi_array(const detail::multi_array:: sub_array& rhs, const general_storage_order& so) : super_type(0,so,rhs.index_bases(),rhs.shape()) { allocate_space(); std::copy(rhs.begin(),rhs.end(),this->begin()); } multi_array(const detail::multi_array:: multi_array_view& rhs) : super_type(0,c_storage_order(),rhs.index_bases(),rhs.shape()) { allocate_space(); std::copy(rhs.begin(),rhs.end(),this->begin()); } multi_array(const detail::multi_array:: multi_array_view& rhs, const general_storage_order& so) : super_type(0,so,rhs.index_bases(),rhs.shape()) { allocate_space(); std::copy(rhs.begin(),rhs.end(),this->begin()); } // Since assignment is a deep copy, multi_array_ref // contains all the necessary code. template multi_array& operator=(const ConstMultiArray& other) { super_type::operator=(other); return *this; } multi_array& operator=(const multi_array& other) { if (&other != this) { super_type::operator=(other); } return *this; } template multi_array& resize(const ExtentList& extents) { boost::function_requires< detail::multi_array::CollectionConcept >(); typedef detail::multi_array::extent_gen gen_type; gen_type ranges; for (int i=0; i != NumDims; ++i) { typedef typename gen_type::range range_type; ranges.ranges_[i] = range_type(0,extents[i]); } return this->resize(ranges); } multi_array& resize(const detail::multi_array ::extent_gen& ranges) { // build a multi_array with the specs given multi_array new_array(ranges,this->storage_order()); // build a view of tmp with the minimum extents // Get the minimum extents of the arrays. boost::array min_extents; const size_type& (*min)(const size_type&, const size_type&) = std::min; std::transform(new_array.extent_list_.begin(),new_array.extent_list_.end(), this->extent_list_.begin(), min_extents.begin(), min); // typedef boost::array index_list; // Build index_gen objects to create views with the same shape // these need to be separate to handle non-zero index bases typedef detail::multi_array::index_gen index_gen; index_gen old_idxes; index_gen new_idxes; std::transform(new_array.index_base_list_.begin(), new_array.index_base_list_.end(), min_extents.begin(),new_idxes.ranges_.begin(), detail::multi_array::populate_index_ranges()); std::transform(this->index_base_list_.begin(), this->index_base_list_.end(), min_extents.begin(),old_idxes.ranges_.begin(), detail::multi_array::populate_index_ranges()); // Build same-shape views of the two arrays typename multi_array::BOOST_NESTED_TEMPLATE array_view::type view_old = (*this)[old_idxes]; typename multi_array::BOOST_NESTED_TEMPLATE array_view::type view_new = new_array[new_idxes]; // Set the right portion of the new array view_new = view_old; using std::swap; // Swap the internals of these arrays. swap(this->super_type::base_,new_array.super_type::base_); swap(this->storage_,new_array.storage_); swap(this->extent_list_,new_array.extent_list_); swap(this->stride_list_,new_array.stride_list_); swap(this->index_base_list_,new_array.index_base_list_); swap(this->origin_offset_,new_array.origin_offset_); swap(this->directional_offset_,new_array.directional_offset_); swap(this->num_elements_,new_array.num_elements_); swap(this->allocator_,new_array.allocator_); swap(this->base_,new_array.base_); swap(this->allocated_elements_,new_array.allocated_elements_); return *this; } ~multi_array() { deallocate_space(); } private: void allocate_space() { typename Allocator::const_pointer no_hint=0; base_ = allocator_.allocate(this->num_elements(),no_hint); this->set_base_ptr(base_); allocated_elements_ = this->num_elements(); std::uninitialized_fill_n(base_,allocated_elements_,T()); } void deallocate_space() { if(base_) { for(T* i = base_; i != base_+allocated_elements_; ++i) allocator_.destroy(i); allocator_.deallocate(base_,allocated_elements_); } } typedef boost::array size_list; typedef boost::array index_list; Allocator allocator_; T* base_; size_type allocated_elements_; enum {initial_base_ = 0}; }; } // namespace boost #endif // BOOST_MULTI_ARRAY_RG071801_HPP madp-0.4/src/boost/boost/PaxHeaders.5405/cstdint.hpp0000644000000000000000000000007312717644140017206 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/cstdint.hpp0000664000372100037210000004314112717644140020041 0ustar00fransfrans00000000000000// boost cstdint.hpp header file ------------------------------------------// // (C) Copyright Beman Dawes 1999. // (C) Copyright Jens Mauer 2001 // (C) Copyright John Maddock 2001 // Distributed under the Boost // Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // See http://www.boost.org/libs/integer for documentation. // Revision History // 31 Oct 01 use BOOST_HAS_LONG_LONG to check for "long long" (Jens M.) // 16 Apr 01 check LONGLONG_MAX when looking for "long long" (Jens Maurer) // 23 Jan 01 prefer "long" over "int" for int32_t and intmax_t (Jens Maurer) // 12 Nov 00 Merged (Jens Maurer) // 23 Sep 00 Added INTXX_C macro support (John Maddock). // 22 Sep 00 Better 64-bit support (John Maddock) // 29 Jun 00 Reimplement to avoid including stdint.h within namespace boost // 8 Aug 99 Initial version (Beman Dawes) #ifndef BOOST_CSTDINT_HPP #define BOOST_CSTDINT_HPP // // Since we always define the INT#_C macros as per C++0x, // define __STDC_CONSTANT_MACROS so that does the right // thing if possible, and so that the user knows that the macros // are actually defined as per C99. // #ifndef __STDC_CONSTANT_MACROS # define __STDC_CONSTANT_MACROS #endif #include // // Note that GLIBC is a bit inconsistent about whether int64_t is defined or not // depending upon what headers happen to have been included first... // so we disable use of stdint.h when GLIBC does not define __GLIBC_HAVE_LONG_LONG. // See https://svn.boost.org/trac/boost/ticket/3548 and http://sources.redhat.com/bugzilla/show_bug.cgi?id=10990 // #if defined(BOOST_HAS_STDINT_H) \ && (!defined(__GLIBC__) \ || defined(__GLIBC_HAVE_LONG_LONG) \ || (defined(__GLIBC__) && ((__GLIBC__ > 2) || ((__GLIBC__ == 2) && (__GLIBC_MINOR__ >= 17))))) // The following #include is an implementation artifact; not part of interface. # ifdef __hpux // HP-UX has a vaguely nice in a non-standard location # include # ifdef __STDC_32_MODE__ // this is triggered with GCC, because it defines __cplusplus < 199707L # define BOOST_NO_INT64_T # endif # elif defined(__FreeBSD__) || defined(__IBMCPP__) || defined(_AIX) # include # else # include // There is a bug in Cygwin two _C macros # if defined(__STDC_CONSTANT_MACROS) && defined(__CYGWIN__) # undef INTMAX_C # undef UINTMAX_C # define INTMAX_C(c) c##LL # define UINTMAX_C(c) c##ULL # endif # endif #ifdef __QNX__ // QNX (Dinkumware stdlib) defines these as non-standard names. // Reflect to the standard names. typedef ::intleast8_t int_least8_t; typedef ::intfast8_t int_fast8_t; typedef ::uintleast8_t uint_least8_t; typedef ::uintfast8_t uint_fast8_t; typedef ::intleast16_t int_least16_t; typedef ::intfast16_t int_fast16_t; typedef ::uintleast16_t uint_least16_t; typedef ::uintfast16_t uint_fast16_t; typedef ::intleast32_t int_least32_t; typedef ::intfast32_t int_fast32_t; typedef ::uintleast32_t uint_least32_t; typedef ::uintfast32_t uint_fast32_t; # ifndef BOOST_NO_INT64_T typedef ::intleast64_t int_least64_t; typedef ::intfast64_t int_fast64_t; typedef ::uintleast64_t uint_least64_t; typedef ::uintfast64_t uint_fast64_t; # endif #endif namespace boost { using ::int8_t; using ::int_least8_t; using ::int_fast8_t; using ::uint8_t; using ::uint_least8_t; using ::uint_fast8_t; using ::int16_t; using ::int_least16_t; using ::int_fast16_t; using ::uint16_t; using ::uint_least16_t; using ::uint_fast16_t; using ::int32_t; using ::int_least32_t; using ::int_fast32_t; using ::uint32_t; using ::uint_least32_t; using ::uint_fast32_t; # ifndef BOOST_NO_INT64_T using ::int64_t; using ::int_least64_t; using ::int_fast64_t; using ::uint64_t; using ::uint_least64_t; using ::uint_fast64_t; # endif using ::intmax_t; using ::uintmax_t; } // namespace boost #elif defined(__FreeBSD__) && (__FreeBSD__ <= 4) || defined(__osf__) || defined(__VMS) // FreeBSD and Tru64 have an that contains much of what we need. # include namespace boost { using ::int8_t; typedef int8_t int_least8_t; typedef int8_t int_fast8_t; using ::uint8_t; typedef uint8_t uint_least8_t; typedef uint8_t uint_fast8_t; using ::int16_t; typedef int16_t int_least16_t; typedef int16_t int_fast16_t; using ::uint16_t; typedef uint16_t uint_least16_t; typedef uint16_t uint_fast16_t; using ::int32_t; typedef int32_t int_least32_t; typedef int32_t int_fast32_t; using ::uint32_t; typedef uint32_t uint_least32_t; typedef uint32_t uint_fast32_t; # ifndef BOOST_NO_INT64_T using ::int64_t; typedef int64_t int_least64_t; typedef int64_t int_fast64_t; using ::uint64_t; typedef uint64_t uint_least64_t; typedef uint64_t uint_fast64_t; typedef int64_t intmax_t; typedef uint64_t uintmax_t; # else typedef int32_t intmax_t; typedef uint32_t uintmax_t; # endif } // namespace boost #else // BOOST_HAS_STDINT_H # include // implementation artifact; not part of interface # include // needed for limits macros namespace boost { // These are fairly safe guesses for some 16-bit, and most 32-bit and 64-bit // platforms. For other systems, they will have to be hand tailored. // // Because the fast types are assumed to be the same as the undecorated types, // it may be possible to hand tailor a more efficient implementation. Such // an optimization may be illusionary; on the Intel x86-family 386 on, for // example, byte arithmetic and load/stores are as fast as "int" sized ones. // 8-bit types ------------------------------------------------------------// # if UCHAR_MAX == 0xff typedef signed char int8_t; typedef signed char int_least8_t; typedef signed char int_fast8_t; typedef unsigned char uint8_t; typedef unsigned char uint_least8_t; typedef unsigned char uint_fast8_t; # else # error defaults not correct; you must hand modify boost/cstdint.hpp # endif // 16-bit types -----------------------------------------------------------// # if USHRT_MAX == 0xffff # if defined(__crayx1) // The Cray X1 has a 16-bit short, however it is not recommend // for use in performance critical code. typedef short int16_t; typedef short int_least16_t; typedef int int_fast16_t; typedef unsigned short uint16_t; typedef unsigned short uint_least16_t; typedef unsigned int uint_fast16_t; # else typedef short int16_t; typedef short int_least16_t; typedef short int_fast16_t; typedef unsigned short uint16_t; typedef unsigned short uint_least16_t; typedef unsigned short uint_fast16_t; # endif # elif (USHRT_MAX == 0xffffffff) && defined(__MTA__) // On MTA / XMT short is 32 bits unless the -short16 compiler flag is specified // MTA / XMT does support the following non-standard integer types typedef __short16 int16_t; typedef __short16 int_least16_t; typedef __short16 int_fast16_t; typedef unsigned __short16 uint16_t; typedef unsigned __short16 uint_least16_t; typedef unsigned __short16 uint_fast16_t; # elif (USHRT_MAX == 0xffffffff) && defined(CRAY) // no 16-bit types on Cray: typedef short int_least16_t; typedef short int_fast16_t; typedef unsigned short uint_least16_t; typedef unsigned short uint_fast16_t; # else # error defaults not correct; you must hand modify boost/cstdint.hpp # endif // 32-bit types -----------------------------------------------------------// # if UINT_MAX == 0xffffffff typedef int int32_t; typedef int int_least32_t; typedef int int_fast32_t; typedef unsigned int uint32_t; typedef unsigned int uint_least32_t; typedef unsigned int uint_fast32_t; # elif (USHRT_MAX == 0xffffffff) typedef short int32_t; typedef short int_least32_t; typedef short int_fast32_t; typedef unsigned short uint32_t; typedef unsigned short uint_least32_t; typedef unsigned short uint_fast32_t; # elif ULONG_MAX == 0xffffffff typedef long int32_t; typedef long int_least32_t; typedef long int_fast32_t; typedef unsigned long uint32_t; typedef unsigned long uint_least32_t; typedef unsigned long uint_fast32_t; # elif (UINT_MAX == 0xffffffffffffffff) && defined(__MTA__) // Integers are 64 bits on the MTA / XMT typedef __int32 int32_t; typedef __int32 int_least32_t; typedef __int32 int_fast32_t; typedef unsigned __int32 uint32_t; typedef unsigned __int32 uint_least32_t; typedef unsigned __int32 uint_fast32_t; # else # error defaults not correct; you must hand modify boost/cstdint.hpp # endif // 64-bit types + intmax_t and uintmax_t ----------------------------------// # if defined(BOOST_HAS_LONG_LONG) && \ !defined(BOOST_MSVC) && !defined(__BORLANDC__) && \ (!defined(__GLIBCPP__) || defined(_GLIBCPP_USE_LONG_LONG)) && \ (defined(ULLONG_MAX) || defined(ULONG_LONG_MAX) || defined(ULONGLONG_MAX)) # if defined(__hpux) // HP-UX's value of ULONG_LONG_MAX is unusable in preprocessor expressions # elif (defined(ULLONG_MAX) && ULLONG_MAX == 18446744073709551615ULL) || (defined(ULONG_LONG_MAX) && ULONG_LONG_MAX == 18446744073709551615ULL) || (defined(ULONGLONG_MAX) && ULONGLONG_MAX == 18446744073709551615ULL) // 2**64 - 1 # else # error defaults not correct; you must hand modify boost/cstdint.hpp # endif typedef ::boost::long_long_type intmax_t; typedef ::boost::ulong_long_type uintmax_t; typedef ::boost::long_long_type int64_t; typedef ::boost::long_long_type int_least64_t; typedef ::boost::long_long_type int_fast64_t; typedef ::boost::ulong_long_type uint64_t; typedef ::boost::ulong_long_type uint_least64_t; typedef ::boost::ulong_long_type uint_fast64_t; # elif ULONG_MAX != 0xffffffff # if ULONG_MAX == 18446744073709551615 // 2**64 - 1 typedef long intmax_t; typedef unsigned long uintmax_t; typedef long int64_t; typedef long int_least64_t; typedef long int_fast64_t; typedef unsigned long uint64_t; typedef unsigned long uint_least64_t; typedef unsigned long uint_fast64_t; # else # error defaults not correct; you must hand modify boost/cstdint.hpp # endif # elif defined(__GNUC__) && defined(BOOST_HAS_LONG_LONG) __extension__ typedef long long intmax_t; __extension__ typedef unsigned long long uintmax_t; __extension__ typedef long long int64_t; __extension__ typedef long long int_least64_t; __extension__ typedef long long int_fast64_t; __extension__ typedef unsigned long long uint64_t; __extension__ typedef unsigned long long uint_least64_t; __extension__ typedef unsigned long long uint_fast64_t; # elif defined(BOOST_HAS_MS_INT64) // // we have Borland/Intel/Microsoft __int64: // typedef __int64 intmax_t; typedef unsigned __int64 uintmax_t; typedef __int64 int64_t; typedef __int64 int_least64_t; typedef __int64 int_fast64_t; typedef unsigned __int64 uint64_t; typedef unsigned __int64 uint_least64_t; typedef unsigned __int64 uint_fast64_t; # else // assume no 64-bit integers # define BOOST_NO_INT64_T typedef int32_t intmax_t; typedef uint32_t uintmax_t; # endif } // namespace boost #endif // BOOST_HAS_STDINT_H // intptr_t/uintptr_t are defined separately because they are optional and not universally available #if defined(BOOST_WINDOWS) && !defined(_WIN32_WCE) && !defined(BOOST_HAS_STDINT_H) // Older MSVC don't have stdint.h and have intptr_t/uintptr_t defined in stddef.h #include #endif // PGI seems to not support intptr_t/uintptr_t properly. BOOST_HAS_STDINT_H is not defined for this compiler by Boost.Config. #if !defined(__PGIC__) #if (defined(BOOST_WINDOWS) && !defined(_WIN32_WCE)) \ || (defined(_XOPEN_UNIX) && (_XOPEN_UNIX+0 > 0) && !defined(__UCLIBC__)) \ || defined(__CYGWIN__) \ || defined(macintosh) || defined(__APPLE__) || defined(__APPLE_CC__) \ || defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) || defined(__DragonFly__) namespace boost { using ::intptr_t; using ::uintptr_t; } #define BOOST_HAS_INTPTR_T // Clang pretends to be GCC, so it'll match this condition #elif defined(__GNUC__) && defined(__INTPTR_TYPE__) && defined(__UINTPTR_TYPE__) namespace boost { typedef __INTPTR_TYPE__ intptr_t; typedef __UINTPTR_TYPE__ uintptr_t; } #define BOOST_HAS_INTPTR_T #endif #endif // !defined(__PGIC__) #endif // BOOST_CSTDINT_HPP /**************************************************** Macro definition section: Added 23rd September 2000 (John Maddock). Modified 11th September 2001 to be excluded when BOOST_HAS_STDINT_H is defined (John Maddock). Modified 11th Dec 2009 to always define the INT#_C macros if they're not already defined (John Maddock). ******************************************************/ #if !defined(BOOST__STDC_CONSTANT_MACROS_DEFINED) && \ (!defined(INT8_C) || !defined(INT16_C) || !defined(INT32_C) || !defined(INT64_C)) // // For the following code we get several warnings along the lines of: // // boost/cstdint.hpp:428:35: error: use of C99 long long integer constant // // So we declare this a system header to suppress these warnings. // #if defined(__GNUC__) && (__GNUC__ >= 4) #pragma GCC system_header #endif #include # define BOOST__STDC_CONSTANT_MACROS_DEFINED # if defined(BOOST_HAS_MS_INT64) // // Borland/Intel/Microsoft compilers have width specific suffixes: // #ifndef INT8_C # define INT8_C(value) value##i8 #endif #ifndef INT16_C # define INT16_C(value) value##i16 #endif #ifndef INT32_C # define INT32_C(value) value##i32 #endif #ifndef INT64_C # define INT64_C(value) value##i64 #endif # ifdef __BORLANDC__ // Borland bug: appending ui8 makes the type a signed char # define UINT8_C(value) static_cast(value##u) # else # define UINT8_C(value) value##ui8 # endif #ifndef UINT16_C # define UINT16_C(value) value##ui16 #endif #ifndef UINT32_C # define UINT32_C(value) value##ui32 #endif #ifndef UINT64_C # define UINT64_C(value) value##ui64 #endif #ifndef INTMAX_C # define INTMAX_C(value) value##i64 # define UINTMAX_C(value) value##ui64 #endif # else // do it the old fashioned way: // 8-bit types ------------------------------------------------------------// # if (UCHAR_MAX == 0xff) && !defined(INT8_C) # define INT8_C(value) static_cast(value) # define UINT8_C(value) static_cast(value##u) # endif // 16-bit types -----------------------------------------------------------// # if (USHRT_MAX == 0xffff) && !defined(INT16_C) # define INT16_C(value) static_cast(value) # define UINT16_C(value) static_cast(value##u) # endif // 32-bit types -----------------------------------------------------------// #ifndef INT32_C # if (UINT_MAX == 0xffffffff) # define INT32_C(value) value # define UINT32_C(value) value##u # elif ULONG_MAX == 0xffffffff # define INT32_C(value) value##L # define UINT32_C(value) value##uL # endif #endif // 64-bit types + intmax_t and uintmax_t ----------------------------------// #ifndef INT64_C # if defined(BOOST_HAS_LONG_LONG) && \ (defined(ULLONG_MAX) || defined(ULONG_LONG_MAX) || defined(ULONGLONG_MAX) || defined(_LLONG_MAX)) # if defined(__hpux) // HP-UX's value of ULONG_LONG_MAX is unusable in preprocessor expressions # define INT64_C(value) value##LL # define UINT64_C(value) value##uLL # elif (defined(ULLONG_MAX) && ULLONG_MAX == 18446744073709551615ULL) || \ (defined(ULONG_LONG_MAX) && ULONG_LONG_MAX == 18446744073709551615ULL) || \ (defined(ULONGLONG_MAX) && ULONGLONG_MAX == 18446744073709551615ULL) || \ (defined(_LLONG_MAX) && _LLONG_MAX == 18446744073709551615ULL) # define INT64_C(value) value##LL # define UINT64_C(value) value##uLL # else # error defaults not correct; you must hand modify boost/cstdint.hpp # endif # elif ULONG_MAX != 0xffffffff # if ULONG_MAX == 18446744073709551615U // 2**64 - 1 # define INT64_C(value) value##L # define UINT64_C(value) value##uL # else # error defaults not correct; you must hand modify boost/cstdint.hpp # endif # elif defined(BOOST_HAS_LONG_LONG) // Usual macros not defined, work things out for ourselves: # if(~0uLL == 18446744073709551615ULL) # define INT64_C(value) value##LL # define UINT64_C(value) value##uLL # else # error defaults not correct; you must hand modify boost/cstdint.hpp # endif # else # error defaults not correct; you must hand modify boost/cstdint.hpp # endif # ifdef BOOST_NO_INT64_T # define INTMAX_C(value) INT32_C(value) # define UINTMAX_C(value) UINT32_C(value) # else # define INTMAX_C(value) INT64_C(value) # define UINTMAX_C(value) UINT64_C(value) # endif #endif # endif // Borland/Microsoft specific width suffixes #endif // INT#_C macros. madp-0.4/src/boost/boost/PaxHeaders.5405/config.hpp0000644000000000000000000000007312717644140017003 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.041552917 madp-0.4/src/boost/boost/config.hpp0000664000372100037210000000410012717644140017626 0ustar00fransfrans00000000000000// Boost config.hpp configuration header file ------------------------------// // (C) Copyright John Maddock 2002. // Use, modification and distribution are subject to the // Boost Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // See http://www.boost.org/libs/config for most recent version. // Boost config.hpp policy and rationale documentation has been moved to // http://www.boost.org/libs/config // // CAUTION: This file is intended to be completely stable - // DO NOT MODIFY THIS FILE! // #ifndef BOOST_CONFIG_HPP #define BOOST_CONFIG_HPP // if we don't have a user config, then use the default location: #if !defined(BOOST_USER_CONFIG) && !defined(BOOST_NO_USER_CONFIG) # define BOOST_USER_CONFIG #endif // include it first: #ifdef BOOST_USER_CONFIG # include BOOST_USER_CONFIG #endif // if we don't have a compiler config set, try and find one: #if !defined(BOOST_COMPILER_CONFIG) && !defined(BOOST_NO_COMPILER_CONFIG) && !defined(BOOST_NO_CONFIG) # include #endif // if we have a compiler config, include it now: #ifdef BOOST_COMPILER_CONFIG # include BOOST_COMPILER_CONFIG #endif // if we don't have a std library config set, try and find one: #if !defined(BOOST_STDLIB_CONFIG) && !defined(BOOST_NO_STDLIB_CONFIG) && !defined(BOOST_NO_CONFIG) && defined(__cplusplus) # include #endif // if we have a std library config, include it now: #ifdef BOOST_STDLIB_CONFIG # include BOOST_STDLIB_CONFIG #endif // if we don't have a platform config set, try and find one: #if !defined(BOOST_PLATFORM_CONFIG) && !defined(BOOST_NO_PLATFORM_CONFIG) && !defined(BOOST_NO_CONFIG) # include #endif // if we have a platform config, include it now: #ifdef BOOST_PLATFORM_CONFIG # include BOOST_PLATFORM_CONFIG #endif // get config suffix code: #include #ifdef BOOST_HAS_PRAGMA_ONCE #pragma once #endif #endif // BOOST_CONFIG_HPP madp-0.4/src/boost/boost/PaxHeaders.5405/bind.hpp0000644000000000000000000000007412717644140016453 xustar0030 atime=1463765180.093720222 30 ctime=1463765201.041552917 madp-0.4/src/boost/boost/bind.hpp0000664000372100037210000000110512717644140017277 0ustar00fransfrans00000000000000#ifndef BOOST_BIND_HPP_INCLUDED #define BOOST_BIND_HPP_INCLUDED // MS compatible compilers support #pragma once #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once #endif // // bind.hpp - binds function objects to arguments // // Copyright (c) 2009 Peter Dimov // // Distributed under the Boost Software License, Version 1.0. // See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt // // See http://www.boost.org/libs/bind/bind.html for documentation. // #include #endif // #ifndef BOOST_BIND_HPP_INCLUDED madp-0.4/src/boost/boost/PaxHeaders.5405/next_prior.hpp0000644000000000000000000000007412717644140017730 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.101552438 madp-0.4/src/boost/boost/next_prior.hpp0000664000372100037210000000242012717644140020555 0ustar00fransfrans00000000000000// Boost next_prior.hpp header file ---------------------------------------// // (C) Copyright Dave Abrahams and Daniel Walker 1999-2003. Distributed under the Boost // Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // See http://www.boost.org/libs/utility for documentation. // Revision History // 13 Dec 2003 Added next(x, n) and prior(x, n) (Daniel Walker) #ifndef BOOST_NEXT_PRIOR_HPP_INCLUDED #define BOOST_NEXT_PRIOR_HPP_INCLUDED #include namespace boost { // Helper functions for classes like bidirectional iterators not supporting // operator+ and operator- // // Usage: // const std::list::iterator p = get_some_iterator(); // const std::list::iterator prev = boost::prior(p); // const std::list::iterator next = boost::next(prev, 2); // Contributed by Dave Abrahams template inline T next(T x) { return ++x; } template inline T next(T x, Distance n) { std::advance(x, n); return x; } template inline T prior(T x) { return --x; } template inline T prior(T x, Distance n) { std::advance(x, -n); return x; } } // namespace boost #endif // BOOST_NEXT_PRIOR_HPP_INCLUDED madp-0.4/src/boost/boost/PaxHeaders.5405/iterator.hpp0000644000000000000000000000007412717644140017370 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/iterator.hpp0000664000372100037210000000367712717644140020234 0ustar00fransfrans00000000000000// iterator.hpp workarounds for non-conforming standard libraries ---------// // (C) Copyright Beman Dawes 2000. Distributed under the Boost // Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // See http://www.boost.org/libs/utility for documentation. // Revision History // 12 Jan 01 added for std::ptrdiff_t (Jens Maurer) // 28 Jun 00 Workarounds to deal with known MSVC bugs (David Abrahams) // 26 Jun 00 Initial version (Jeremy Siek) #ifndef BOOST_ITERATOR_HPP #define BOOST_ITERATOR_HPP #include #include // std::ptrdiff_t #include namespace boost { # if defined(BOOST_NO_STD_ITERATOR) && !defined(BOOST_MSVC_STD_ITERATOR) template struct iterator { typedef T value_type; typedef Distance difference_type; typedef Pointer pointer; typedef Reference reference; typedef Category iterator_category; }; # else // declare iterator_base in namespace detail to work around MSVC bugs which // prevent derivation from an identically-named class in a different namespace. namespace detail { template # if !defined(BOOST_MSVC_STD_ITERATOR) struct iterator_base : std::iterator {}; # else struct iterator_base : std::iterator { typedef Reference reference; typedef Pointer pointer; typedef Distance difference_type; }; # endif } template struct iterator : boost::detail::iterator_base {}; # endif } // namespace boost #endif // BOOST_ITERATOR_HPP madp-0.4/src/boost/boost/PaxHeaders.5405/limits.hpp0000644000000000000000000000007412717644140017040 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.057552789 madp-0.4/src/boost/boost/limits.hpp0000664000372100037210000001400212717644140017664 0ustar00fransfrans00000000000000 // (C) Copyright John maddock 1999. // (C) David Abrahams 2002. Distributed under the Boost // Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // // use this header as a workaround for missing // See http://www.boost.org/libs/compatibility/index.html for documentation. #ifndef BOOST_LIMITS #define BOOST_LIMITS #include #ifdef BOOST_NO_LIMITS # error "There is no std::numeric_limits suppport available." #else # include #endif #if (defined(BOOST_HAS_LONG_LONG) && defined(BOOST_NO_LONG_LONG_NUMERIC_LIMITS)) \ || (defined(BOOST_HAS_MS_INT64) && defined(BOOST_NO_MS_INT64_NUMERIC_LIMITS)) // Add missing specializations for numeric_limits: #ifdef BOOST_HAS_MS_INT64 # define BOOST_LLT __int64 # define BOOST_ULLT unsigned __int64 #else # define BOOST_LLT ::boost::long_long_type # define BOOST_ULLT ::boost::ulong_long_type #endif #include // for CHAR_BIT namespace std { template<> class numeric_limits { public: BOOST_STATIC_CONSTANT(bool, is_specialized = true); #ifdef BOOST_HAS_MS_INT64 static BOOST_LLT min BOOST_PREVENT_MACRO_SUBSTITUTION (){ return 0x8000000000000000i64; } static BOOST_LLT max BOOST_PREVENT_MACRO_SUBSTITUTION (){ return 0x7FFFFFFFFFFFFFFFi64; } #elif defined(LLONG_MAX) static BOOST_LLT min BOOST_PREVENT_MACRO_SUBSTITUTION (){ return LLONG_MIN; } static BOOST_LLT max BOOST_PREVENT_MACRO_SUBSTITUTION (){ return LLONG_MAX; } #elif defined(LONGLONG_MAX) static BOOST_LLT min BOOST_PREVENT_MACRO_SUBSTITUTION (){ return LONGLONG_MIN; } static BOOST_LLT max BOOST_PREVENT_MACRO_SUBSTITUTION (){ return LONGLONG_MAX; } #else static BOOST_LLT min BOOST_PREVENT_MACRO_SUBSTITUTION (){ return 1LL << (sizeof(BOOST_LLT) * CHAR_BIT - 1); } static BOOST_LLT max BOOST_PREVENT_MACRO_SUBSTITUTION (){ return ~(min)(); } #endif BOOST_STATIC_CONSTANT(int, digits = sizeof(BOOST_LLT) * CHAR_BIT -1); BOOST_STATIC_CONSTANT(int, digits10 = (CHAR_BIT * sizeof (BOOST_LLT) - 1) * 301L / 1000); BOOST_STATIC_CONSTANT(bool, is_signed = true); BOOST_STATIC_CONSTANT(bool, is_integer = true); BOOST_STATIC_CONSTANT(bool, is_exact = true); BOOST_STATIC_CONSTANT(int, radix = 2); static BOOST_LLT epsilon() throw() { return 0; }; static BOOST_LLT round_error() throw() { return 0; }; BOOST_STATIC_CONSTANT(int, min_exponent = 0); BOOST_STATIC_CONSTANT(int, min_exponent10 = 0); BOOST_STATIC_CONSTANT(int, max_exponent = 0); BOOST_STATIC_CONSTANT(int, max_exponent10 = 0); BOOST_STATIC_CONSTANT(bool, has_infinity = false); BOOST_STATIC_CONSTANT(bool, has_quiet_NaN = false); BOOST_STATIC_CONSTANT(bool, has_signaling_NaN = false); BOOST_STATIC_CONSTANT(bool, has_denorm = false); BOOST_STATIC_CONSTANT(bool, has_denorm_loss = false); static BOOST_LLT infinity() throw() { return 0; }; static BOOST_LLT quiet_NaN() throw() { return 0; }; static BOOST_LLT signaling_NaN() throw() { return 0; }; static BOOST_LLT denorm_min() throw() { return 0; }; BOOST_STATIC_CONSTANT(bool, is_iec559 = false); BOOST_STATIC_CONSTANT(bool, is_bounded = true); BOOST_STATIC_CONSTANT(bool, is_modulo = true); BOOST_STATIC_CONSTANT(bool, traps = false); BOOST_STATIC_CONSTANT(bool, tinyness_before = false); BOOST_STATIC_CONSTANT(float_round_style, round_style = round_toward_zero); }; template<> class numeric_limits { public: BOOST_STATIC_CONSTANT(bool, is_specialized = true); #ifdef BOOST_HAS_MS_INT64 static BOOST_ULLT min BOOST_PREVENT_MACRO_SUBSTITUTION (){ return 0ui64; } static BOOST_ULLT max BOOST_PREVENT_MACRO_SUBSTITUTION (){ return 0xFFFFFFFFFFFFFFFFui64; } #elif defined(ULLONG_MAX) && defined(ULLONG_MIN) static BOOST_ULLT min BOOST_PREVENT_MACRO_SUBSTITUTION (){ return ULLONG_MIN; } static BOOST_ULLT max BOOST_PREVENT_MACRO_SUBSTITUTION (){ return ULLONG_MAX; } #elif defined(ULONGLONG_MAX) && defined(ULONGLONG_MIN) static BOOST_ULLT min BOOST_PREVENT_MACRO_SUBSTITUTION (){ return ULONGLONG_MIN; } static BOOST_ULLT max BOOST_PREVENT_MACRO_SUBSTITUTION (){ return ULONGLONG_MAX; } #else static BOOST_ULLT min BOOST_PREVENT_MACRO_SUBSTITUTION (){ return 0uLL; } static BOOST_ULLT max BOOST_PREVENT_MACRO_SUBSTITUTION (){ return ~0uLL; } #endif BOOST_STATIC_CONSTANT(int, digits = sizeof(BOOST_LLT) * CHAR_BIT); BOOST_STATIC_CONSTANT(int, digits10 = (CHAR_BIT * sizeof (BOOST_LLT)) * 301L / 1000); BOOST_STATIC_CONSTANT(bool, is_signed = false); BOOST_STATIC_CONSTANT(bool, is_integer = true); BOOST_STATIC_CONSTANT(bool, is_exact = true); BOOST_STATIC_CONSTANT(int, radix = 2); static BOOST_ULLT epsilon() throw() { return 0; }; static BOOST_ULLT round_error() throw() { return 0; }; BOOST_STATIC_CONSTANT(int, min_exponent = 0); BOOST_STATIC_CONSTANT(int, min_exponent10 = 0); BOOST_STATIC_CONSTANT(int, max_exponent = 0); BOOST_STATIC_CONSTANT(int, max_exponent10 = 0); BOOST_STATIC_CONSTANT(bool, has_infinity = false); BOOST_STATIC_CONSTANT(bool, has_quiet_NaN = false); BOOST_STATIC_CONSTANT(bool, has_signaling_NaN = false); BOOST_STATIC_CONSTANT(bool, has_denorm = false); BOOST_STATIC_CONSTANT(bool, has_denorm_loss = false); static BOOST_ULLT infinity() throw() { return 0; }; static BOOST_ULLT quiet_NaN() throw() { return 0; }; static BOOST_ULLT signaling_NaN() throw() { return 0; }; static BOOST_ULLT denorm_min() throw() { return 0; }; BOOST_STATIC_CONSTANT(bool, is_iec559 = false); BOOST_STATIC_CONSTANT(bool, is_bounded = true); BOOST_STATIC_CONSTANT(bool, is_modulo = true); BOOST_STATIC_CONSTANT(bool, traps = false); BOOST_STATIC_CONSTANT(bool, tinyness_before = false); BOOST_STATIC_CONSTANT(float_round_style, round_style = round_toward_zero); }; } #endif #endif madp-0.4/src/boost/boost/PaxHeaders.5405/integer.hpp0000644000000000000000000000007412717644140017174 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.053552821 madp-0.4/src/boost/boost/integer.hpp0000664000372100037210000002606212717644140020031 0ustar00fransfrans00000000000000// boost integer.hpp header file -------------------------------------------// // Copyright Beman Dawes and Daryle Walker 1999. Distributed under the Boost // Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // See http://www.boost.org/libs/integer for documentation. // Revision History // 22 Sep 01 Added value-based integer templates. (Daryle Walker) // 01 Apr 01 Modified to use new header. (John Maddock) // 30 Jul 00 Add typename syntax fix (Jens Maurer) // 28 Aug 99 Initial version #ifndef BOOST_INTEGER_HPP #define BOOST_INTEGER_HPP #include // self include #include // for boost::::boost::integer_traits #include // for ::std::numeric_limits #include // for boost::int64_t and BOOST_NO_INTEGRAL_INT64_T #include // // We simply cannot include this header on gcc without getting copious warnings of the kind: // // boost/integer.hpp:77:30: warning: use of C99 long long integer constant // // And yet there is no other reasonable implementation, so we declare this a system header // to suppress these warnings. // #if defined(__GNUC__) && (__GNUC__ >= 4) #pragma GCC system_header #endif namespace boost { // Helper templates ------------------------------------------------------// // fast integers from least integers // int_fast_t<> works correctly for unsigned too, in spite of the name. template< typename LeastInt > struct int_fast_t { typedef LeastInt fast; typedef fast type; }; // imps may specialize namespace detail{ // convert category to type template< int Category > struct int_least_helper {}; // default is empty template< int Category > struct uint_least_helper {}; // default is empty // specializatons: 1=long, 2=int, 3=short, 4=signed char, // 6=unsigned long, 7=unsigned int, 8=unsigned short, 9=unsigned char // no specializations for 0 and 5: requests for a type > long are in error #ifdef BOOST_HAS_LONG_LONG template<> struct int_least_helper<1> { typedef boost::long_long_type least; }; #elif defined(BOOST_HAS_MS_INT64) template<> struct int_least_helper<1> { typedef __int64 least; }; #endif template<> struct int_least_helper<2> { typedef long least; }; template<> struct int_least_helper<3> { typedef int least; }; template<> struct int_least_helper<4> { typedef short least; }; template<> struct int_least_helper<5> { typedef signed char least; }; #ifdef BOOST_HAS_LONG_LONG template<> struct uint_least_helper<1> { typedef boost::ulong_long_type least; }; #elif defined(BOOST_HAS_MS_INT64) template<> struct uint_least_helper<1> { typedef unsigned __int64 least; }; #endif template<> struct uint_least_helper<2> { typedef unsigned long least; }; template<> struct uint_least_helper<3> { typedef unsigned int least; }; template<> struct uint_least_helper<4> { typedef unsigned short least; }; template<> struct uint_least_helper<5> { typedef unsigned char least; }; template struct exact_signed_base_helper{}; template struct exact_unsigned_base_helper{}; template <> struct exact_signed_base_helper { typedef signed char exact; }; template <> struct exact_unsigned_base_helper { typedef unsigned char exact; }; #if USHRT_MAX != UCHAR_MAX template <> struct exact_signed_base_helper { typedef short exact; }; template <> struct exact_unsigned_base_helper { typedef unsigned short exact; }; #endif #if UINT_MAX != USHRT_MAX template <> struct exact_signed_base_helper { typedef int exact; }; template <> struct exact_unsigned_base_helper { typedef unsigned int exact; }; #endif #if ULONG_MAX != UINT_MAX template <> struct exact_signed_base_helper { typedef long exact; }; template <> struct exact_unsigned_base_helper { typedef unsigned long exact; }; #endif #if defined(BOOST_HAS_LONG_LONG) &&\ ((defined(ULLONG_MAX) && (ULLONG_MAX != ULONG_MAX)) ||\ (defined(ULONG_LONG_MAX) && (ULONG_LONG_MAX != ULONG_MAX)) ||\ (defined(ULONGLONG_MAX) && (ULONGLONG_MAX != ULONG_MAX)) ||\ (defined(_ULLONG_MAX) && (_ULLONG_MAX != ULONG_MAX))) template <> struct exact_signed_base_helper { typedef boost::long_long_type exact; }; template <> struct exact_unsigned_base_helper { typedef boost::ulong_long_type exact; }; #endif } // namespace detail // integer templates specifying number of bits ---------------------------// // signed template< int Bits > // bits (including sign) required struct int_t : public detail::exact_signed_base_helper { BOOST_STATIC_ASSERT_MSG(Bits <= (int)(sizeof(boost::intmax_t) * CHAR_BIT), "No suitable signed integer type with the requested number of bits is available."); typedef typename detail::int_least_helper < #ifdef BOOST_HAS_LONG_LONG (Bits <= (int)(sizeof(boost::long_long_type) * CHAR_BIT)) + #else 1 + #endif (Bits-1 <= ::std::numeric_limits::digits) + (Bits-1 <= ::std::numeric_limits::digits) + (Bits-1 <= ::std::numeric_limits::digits) + (Bits-1 <= ::std::numeric_limits::digits) >::least least; typedef typename int_fast_t::type fast; }; // unsigned template< int Bits > // bits required struct uint_t : public detail::exact_unsigned_base_helper { BOOST_STATIC_ASSERT_MSG(Bits <= (int)(sizeof(boost::uintmax_t) * CHAR_BIT), "No suitable unsigned integer type with the requested number of bits is available."); #if (defined(__BORLANDC__) || defined(__CODEGEAR__)) && defined(BOOST_NO_INTEGRAL_INT64_T) // It's really not clear why this workaround should be needed... shrug I guess! JM BOOST_STATIC_CONSTANT(int, s = 6 + (Bits <= ::std::numeric_limits::digits) + (Bits <= ::std::numeric_limits::digits) + (Bits <= ::std::numeric_limits::digits) + (Bits <= ::std::numeric_limits::digits)); typedef typename detail::int_least_helper< ::boost::uint_t::s>::least least; #else typedef typename detail::uint_least_helper < #ifdef BOOST_HAS_LONG_LONG (Bits <= (int)(sizeof(boost::long_long_type) * CHAR_BIT)) + #else 1 + #endif (Bits <= ::std::numeric_limits::digits) + (Bits <= ::std::numeric_limits::digits) + (Bits <= ::std::numeric_limits::digits) + (Bits <= ::std::numeric_limits::digits) >::least least; #endif typedef typename int_fast_t::type fast; // int_fast_t<> works correctly for unsigned too, in spite of the name. }; // integer templates specifying extreme value ----------------------------// // signed #if !defined(BOOST_NO_INTEGRAL_INT64_T) && defined(BOOST_HAS_LONG_LONG) template< boost::long_long_type MaxValue > // maximum value to require support #else template< long MaxValue > // maximum value to require support #endif struct int_max_value_t { typedef typename detail::int_least_helper < #if !defined(BOOST_NO_INTEGRAL_INT64_T) && defined(BOOST_HAS_LONG_LONG) (MaxValue <= ::boost::integer_traits::const_max) + #else 1 + #endif (MaxValue <= ::boost::integer_traits::const_max) + (MaxValue <= ::boost::integer_traits::const_max) + (MaxValue <= ::boost::integer_traits::const_max) + (MaxValue <= ::boost::integer_traits::const_max) >::least least; typedef typename int_fast_t::type fast; }; #if !defined(BOOST_NO_INTEGRAL_INT64_T) && defined(BOOST_HAS_LONG_LONG) template< boost::long_long_type MinValue > // minimum value to require support #else template< long MinValue > // minimum value to require support #endif struct int_min_value_t { typedef typename detail::int_least_helper < #if !defined(BOOST_NO_INTEGRAL_INT64_T) && defined(BOOST_HAS_LONG_LONG) (MinValue >= ::boost::integer_traits::const_min) + #else 1 + #endif (MinValue >= ::boost::integer_traits::const_min) + (MinValue >= ::boost::integer_traits::const_min) + (MinValue >= ::boost::integer_traits::const_min) + (MinValue >= ::boost::integer_traits::const_min) >::least least; typedef typename int_fast_t::type fast; }; // unsigned #if !defined(BOOST_NO_INTEGRAL_INT64_T) && defined(BOOST_HAS_LONG_LONG) template< boost::ulong_long_type MaxValue > // minimum value to require support #else template< unsigned long MaxValue > // minimum value to require support #endif struct uint_value_t { #if (defined(__BORLANDC__) || defined(__CODEGEAR__)) // It's really not clear why this workaround should be needed... shrug I guess! JM #if defined(BOOST_NO_INTEGRAL_INT64_T) BOOST_STATIC_CONSTANT(unsigned, which = 1 + (MaxValue <= ::boost::integer_traits::const_max) + (MaxValue <= ::boost::integer_traits::const_max) + (MaxValue <= ::boost::integer_traits::const_max) + (MaxValue <= ::boost::integer_traits::const_max)); typedef typename detail::int_least_helper< ::boost::uint_value_t::which>::least least; #else // BOOST_NO_INTEGRAL_INT64_T BOOST_STATIC_CONSTANT(unsigned, which = 1 + (MaxValue <= ::boost::integer_traits::const_max) + (MaxValue <= ::boost::integer_traits::const_max) + (MaxValue <= ::boost::integer_traits::const_max) + (MaxValue <= ::boost::integer_traits::const_max) + (MaxValue <= ::boost::integer_traits::const_max)); typedef typename detail::uint_least_helper< ::boost::uint_value_t::which>::least least; #endif // BOOST_NO_INTEGRAL_INT64_T #else typedef typename detail::uint_least_helper < #if !defined(BOOST_NO_INTEGRAL_INT64_T) && defined(BOOST_HAS_LONG_LONG) (MaxValue <= ::boost::integer_traits::const_max) + #else 1 + #endif (MaxValue <= ::boost::integer_traits::const_max) + (MaxValue <= ::boost::integer_traits::const_max) + (MaxValue <= ::boost::integer_traits::const_max) + (MaxValue <= ::boost::integer_traits::const_max) >::least least; #endif typedef typename int_fast_t::type fast; }; } // namespace boost #endif // BOOST_INTEGER_HPP madp-0.4/src/boost/boost/PaxHeaders.5405/tuple0000644000000000000000000000007412717644140016102 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.173551863 madp-0.4/src/boost/boost/tuple/0000775000372100037210000000000012717644140017006 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/tuple/PaxHeaders.5405/tuple.hpp0000644000000000000000000000007412717644140020021 xustar0030 atime=1463765180.173719584 30 ctime=1463765201.173551863 madp-0.4/src/boost/boost/tuple/tuple.hpp0000664000372100037210000000545412717644140020660 0ustar00fransfrans00000000000000// tuple.hpp - Boost Tuple Library -------------------------------------- // Copyright (C) 1999, 2000 Jaakko Jarvi (jaakko.jarvi@cs.utu.fi) // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // For more information, see http://www.boost.org // ----------------------------------------------------------------- #ifndef BOOST_TUPLE_HPP #define BOOST_TUPLE_HPP #if defined(__sgi) && defined(_COMPILER_VERSION) && _COMPILER_VERSION <= 730 // Work around a compiler bug. // boost::python::tuple has to be seen by the compiler before the // boost::tuple class template. namespace boost { namespace python { class tuple; }} #endif #include "boost/config.hpp" #include "boost/static_assert.hpp" #if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) // The MSVC version #include "boost/tuple/detail/tuple_basic_no_partial_spec.hpp" #else // other compilers #include "boost/ref.hpp" #include "boost/tuple/detail/tuple_basic.hpp" #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION namespace boost { using tuples::tuple; using tuples::make_tuple; using tuples::tie; #if !defined(BOOST_NO_USING_TEMPLATE) using tuples::get; #elif !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) // // The "using tuples::get" statement causes the // Borland compiler to ICE, use forwarding // functions instead: // template inline typename tuples::access_traits< typename tuples::element >::type >::non_const_type get(tuples::cons& c) { return tuples::get(c); } // get function for const cons-lists, returns a const reference to // the element. If the element is a reference, returns the reference // as such (that is, can return a non-const reference) template inline typename tuples::access_traits< typename tuples::element >::type >::const_type get(const tuples::cons& c) { return tuples::get(c); } #else // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION // // MSVC, using declarations don't mix with templates well, // so use forwarding functions instead: // template typename tuples::detail::element_ref >::RET get(tuples::cons& t, tuples::detail::workaround_holder* = 0) { return tuples::detail::get_class::get(t); } template typename tuples::detail::element_const_ref >::RET get(const tuples::cons& t, tuples::detail::workaround_holder* = 0) { return tuples::detail::get_class::get(t); } #endif // BOOST_NO_USING_TEMPLATE } // end namespace boost #endif // BOOST_TUPLE_HPP madp-0.4/src/boost/boost/tuple/PaxHeaders.5405/detail0000644000000000000000000000007412717644140017344 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.173551863 madp-0.4/src/boost/boost/tuple/detail/0000775000372100037210000000000012717644140020250 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/tuple/detail/PaxHeaders.5405/tuple_basic.hpp0000644000000000000000000000007412717644140022424 xustar0030 atime=1463765180.173719584 30 ctime=1463765201.173551863 madp-0.4/src/boost/boost/tuple/detail/tuple_basic.hpp0000664000372100037210000007712012717644140023262 0ustar00fransfrans00000000000000// tuple_basic.hpp ----------------------------------------------------- // Copyright (C) 1999, 2000 Jaakko Jarvi (jaakko.jarvi@cs.utu.fi) // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // For more information, see http://www.boost.org // Outside help: // This and that, Gary Powell. // Fixed return types for get_head/get_tail // ( and other bugs ) per suggestion of Jens Maurer // simplified element type accessors + bug fix (Jeremy Siek) // Several changes/additions according to suggestions by Douglas Gregor, // William Kempf, Vesa Karvonen, John Max Skaller, Ed Brey, Beman Dawes, // David Abrahams. // Revision history: // 2002 05 01 Hugo Duncan: Fix for Borland after Jaakko's previous changes // 2002 04 18 Jaakko: tuple element types can be void or plain function // types, as long as no object is created. // Tuple objects can no hold even noncopyable types // such as arrays. // 2001 10 22 John Maddock // Fixes for Borland C++ // 2001 08 30 David Abrahams // Added default constructor for cons<>. // ----------------------------------------------------------------- #ifndef BOOST_TUPLE_BASIC_HPP #define BOOST_TUPLE_BASIC_HPP #include // needed for the assignment from pair to tuple #include "boost/type_traits/cv_traits.hpp" #include "boost/type_traits/function_traits.hpp" #include "boost/utility/swap.hpp" #include "boost/detail/workaround.hpp" // needed for BOOST_WORKAROUND namespace boost { namespace tuples { // -- null_type -------------------------------------------------------- struct null_type {}; // a helper function to provide a const null_type type temporary namespace detail { inline const null_type cnull() { return null_type(); } // -- if construct ------------------------------------------------ // Proposed by Krzysztof Czarnecki and Ulrich Eisenecker template struct IF { typedef Then RET; }; template struct IF { typedef Else RET; }; } // end detail // - cons forward declaration ----------------------------------------------- template struct cons; // - tuple forward declaration ----------------------------------------------- template < class T0 = null_type, class T1 = null_type, class T2 = null_type, class T3 = null_type, class T4 = null_type, class T5 = null_type, class T6 = null_type, class T7 = null_type, class T8 = null_type, class T9 = null_type> class tuple; // tuple_length forward declaration template struct length; namespace detail { // -- generate error template, referencing to non-existing members of this // template is used to produce compilation errors intentionally template class generate_error; template struct drop_front { template struct apply { typedef BOOST_DEDUCED_TYPENAME drop_front::BOOST_NESTED_TEMPLATE apply next; typedef BOOST_DEDUCED_TYPENAME next::type::tail_type type; static const type& call(const Tuple& tup) { return next::call(tup).tail; } }; }; template<> struct drop_front<0> { template struct apply { typedef Tuple type; static const type& call(const Tuple& tup) { return tup; } }; }; } // end of namespace detail // -cons type accessors ---------------------------------------- // typename tuples::element::type gets the type of the // Nth element ot T, first element is at index 0 // ------------------------------------------------------- #ifndef BOOST_NO_CV_SPECIALIZATIONS template struct element { typedef BOOST_DEDUCED_TYPENAME detail::drop_front::BOOST_NESTED_TEMPLATE apply::type::head_type type; }; template struct element { private: typedef BOOST_DEDUCED_TYPENAME detail::drop_front::BOOST_NESTED_TEMPLATE apply::type::head_type unqualified_type; public: #if BOOST_WORKAROUND(__BORLANDC__,<0x600) typedef const unqualified_type type; #else typedef BOOST_DEDUCED_TYPENAME boost::add_const::type type; #endif }; #else // def BOOST_NO_CV_SPECIALIZATIONS namespace detail { template struct element_impl { typedef BOOST_DEDUCED_TYPENAME detail::drop_front::BOOST_NESTED_TEMPLATE apply::type::head_type type; }; template struct element_impl { typedef BOOST_DEDUCED_TYPENAME detail::drop_front::BOOST_NESTED_TEMPLATE apply::type::head_type unqualified_type; typedef const unqualified_type type; }; } // end of namespace detail template struct element: public detail::element_impl::value> { }; #endif // -get function templates ----------------------------------------------- // Usage: get(aTuple) // -- some traits classes for get functions // access traits lifted from detail namespace to be part of the interface, // (Joel de Guzman's suggestion). Rationale: get functions are part of the // interface, so should the way to express their return types be. template struct access_traits { typedef const T& const_type; typedef T& non_const_type; typedef const typename boost::remove_cv::type& parameter_type; // used as the tuple constructors parameter types // Rationale: non-reference tuple element types can be cv-qualified. // It should be possible to initialize such types with temporaries, // and when binding temporaries to references, the reference must // be non-volatile and const. 8.5.3. (5) }; template struct access_traits { typedef T& const_type; typedef T& non_const_type; typedef T& parameter_type; }; // get function for non-const cons-lists, returns a reference to the element template inline typename access_traits< typename element >::type >::non_const_type get(cons& c BOOST_APPEND_EXPLICIT_TEMPLATE_NON_TYPE(int, N)) { typedef BOOST_DEDUCED_TYPENAME detail::drop_front::BOOST_NESTED_TEMPLATE apply > impl; typedef BOOST_DEDUCED_TYPENAME impl::type cons_element; return const_cast(impl::call(c)).head; } // get function for const cons-lists, returns a const reference to // the element. If the element is a reference, returns the reference // as such (that is, can return a non-const reference) template inline typename access_traits< typename element >::type >::const_type get(const cons& c BOOST_APPEND_EXPLICIT_TEMPLATE_NON_TYPE(int, N)) { typedef BOOST_DEDUCED_TYPENAME detail::drop_front::BOOST_NESTED_TEMPLATE apply > impl; typedef BOOST_DEDUCED_TYPENAME impl::type cons_element; return impl::call(c).head; } // -- the cons template -------------------------------------------------- namespace detail { // These helper templates wrap void types and plain function types. // The reationale is to allow one to write tuple types with those types // as elements, even though it is not possible to instantiate such object. // E.g: typedef tuple some_type; // ok // but: some_type x; // fails template class non_storeable_type { non_storeable_type(); }; template struct wrap_non_storeable_type { typedef typename IF< ::boost::is_function::value, non_storeable_type, T >::RET type; }; template <> struct wrap_non_storeable_type { typedef non_storeable_type type; }; } // detail template struct cons { typedef HT head_type; typedef TT tail_type; typedef typename detail::wrap_non_storeable_type::type stored_head_type; stored_head_type head; tail_type tail; typename access_traits::non_const_type get_head() { return head; } typename access_traits::non_const_type get_tail() { return tail; } typename access_traits::const_type get_head() const { return head; } typename access_traits::const_type get_tail() const { return tail; } cons() : head(), tail() {} // cons() : head(detail::default_arg::f()), tail() {} // the argument for head is not strictly needed, but it prevents // array type elements. This is good, since array type elements // cannot be supported properly in any case (no assignment, // copy works only if the tails are exactly the same type, ...) cons(typename access_traits::parameter_type h, const tail_type& t) : head (h), tail(t) {} template cons( T1& t1, T2& t2, T3& t3, T4& t4, T5& t5, T6& t6, T7& t7, T8& t8, T9& t9, T10& t10 ) : head (t1), tail (t2, t3, t4, t5, t6, t7, t8, t9, t10, detail::cnull()) {} template cons( const null_type& /*t1*/, T2& t2, T3& t3, T4& t4, T5& t5, T6& t6, T7& t7, T8& t8, T9& t9, T10& t10 ) : head (), tail (t2, t3, t4, t5, t6, t7, t8, t9, t10, detail::cnull()) {} template cons( const cons& u ) : head(u.head), tail(u.tail) {} template cons& operator=( const cons& u ) { head=u.head; tail=u.tail; return *this; } // must define assignment operator explicitly, implicit version is // illformed if HT is a reference (12.8. (12)) cons& operator=(const cons& u) { head = u.head; tail = u.tail; return *this; } template cons& operator=( const std::pair& u ) { BOOST_STATIC_ASSERT(length::value == 2); // check length = 2 head = u.first; tail.head = u.second; return *this; } // get member functions (non-const and const) template typename access_traits< typename element >::type >::non_const_type get() { return boost::tuples::get(*this); // delegate to non-member get } template typename access_traits< typename element >::type >::const_type get() const { return boost::tuples::get(*this); // delegate to non-member get } }; template struct cons { typedef HT head_type; typedef null_type tail_type; typedef cons self_type; typedef typename detail::wrap_non_storeable_type::type stored_head_type; stored_head_type head; typename access_traits::non_const_type get_head() { return head; } null_type get_tail() { return null_type(); } typename access_traits::const_type get_head() const { return head; } const null_type get_tail() const { return null_type(); } // cons() : head(detail::default_arg::f()) {} cons() : head() {} cons(typename access_traits::parameter_type h, const null_type& = null_type()) : head (h) {} template cons(T1& t1, const null_type&, const null_type&, const null_type&, const null_type&, const null_type&, const null_type&, const null_type&, const null_type&, const null_type&) : head (t1) {} cons(const null_type&, const null_type&, const null_type&, const null_type&, const null_type&, const null_type&, const null_type&, const null_type&, const null_type&, const null_type&) : head () {} template cons( const cons& u ) : head(u.head) {} template cons& operator=(const cons& u ) { head = u.head; return *this; } // must define assignment operator explicitely, implicit version // is illformed if HT is a reference cons& operator=(const cons& u) { head = u.head; return *this; } template typename access_traits< typename element::type >::non_const_type get(BOOST_EXPLICIT_TEMPLATE_NON_TYPE(int, N)) { return boost::tuples::get(*this); } template typename access_traits< typename element::type >::const_type get(BOOST_EXPLICIT_TEMPLATE_NON_TYPE(int, N)) const { return boost::tuples::get(*this); } }; // templates for finding out the length of the tuple ------------------- template struct length { BOOST_STATIC_CONSTANT(int, value = 1 + length::value); }; template<> struct length > { BOOST_STATIC_CONSTANT(int, value = 0); }; template<> struct length const> { BOOST_STATIC_CONSTANT(int, value = 0); }; template<> struct length { BOOST_STATIC_CONSTANT(int, value = 0); }; template<> struct length { BOOST_STATIC_CONSTANT(int, value = 0); }; namespace detail { // Tuple to cons mapper -------------------------------------------------- template struct map_tuple_to_cons { typedef cons::type > type; }; // The empty tuple is a null_type template <> struct map_tuple_to_cons { typedef null_type type; }; } // end detail // ------------------------------------------------------------------- // -- tuple ------------------------------------------------------ template class tuple : public detail::map_tuple_to_cons::type { public: typedef typename detail::map_tuple_to_cons::type inherited; typedef typename inherited::head_type head_type; typedef typename inherited::tail_type tail_type; // access_traits::parameter_type takes non-reference types as const T& tuple() {} tuple(typename access_traits::parameter_type t0) : inherited(t0, detail::cnull(), detail::cnull(), detail::cnull(), detail::cnull(), detail::cnull(), detail::cnull(), detail::cnull(), detail::cnull(), detail::cnull()) {} tuple(typename access_traits::parameter_type t0, typename access_traits::parameter_type t1) : inherited(t0, t1, detail::cnull(), detail::cnull(), detail::cnull(), detail::cnull(), detail::cnull(), detail::cnull(), detail::cnull(), detail::cnull()) {} tuple(typename access_traits::parameter_type t0, typename access_traits::parameter_type t1, typename access_traits::parameter_type t2) : inherited(t0, t1, t2, detail::cnull(), detail::cnull(), detail::cnull(), detail::cnull(), detail::cnull(), detail::cnull(), detail::cnull()) {} tuple(typename access_traits::parameter_type t0, typename access_traits::parameter_type t1, typename access_traits::parameter_type t2, typename access_traits::parameter_type t3) : inherited(t0, t1, t2, t3, detail::cnull(), detail::cnull(), detail::cnull(), detail::cnull(), detail::cnull(), detail::cnull()) {} tuple(typename access_traits::parameter_type t0, typename access_traits::parameter_type t1, typename access_traits::parameter_type t2, typename access_traits::parameter_type t3, typename access_traits::parameter_type t4) : inherited(t0, t1, t2, t3, t4, detail::cnull(), detail::cnull(), detail::cnull(), detail::cnull(), detail::cnull()) {} tuple(typename access_traits::parameter_type t0, typename access_traits::parameter_type t1, typename access_traits::parameter_type t2, typename access_traits::parameter_type t3, typename access_traits::parameter_type t4, typename access_traits::parameter_type t5) : inherited(t0, t1, t2, t3, t4, t5, detail::cnull(), detail::cnull(), detail::cnull(), detail::cnull()) {} tuple(typename access_traits::parameter_type t0, typename access_traits::parameter_type t1, typename access_traits::parameter_type t2, typename access_traits::parameter_type t3, typename access_traits::parameter_type t4, typename access_traits::parameter_type t5, typename access_traits::parameter_type t6) : inherited(t0, t1, t2, t3, t4, t5, t6, detail::cnull(), detail::cnull(), detail::cnull()) {} tuple(typename access_traits::parameter_type t0, typename access_traits::parameter_type t1, typename access_traits::parameter_type t2, typename access_traits::parameter_type t3, typename access_traits::parameter_type t4, typename access_traits::parameter_type t5, typename access_traits::parameter_type t6, typename access_traits::parameter_type t7) : inherited(t0, t1, t2, t3, t4, t5, t6, t7, detail::cnull(), detail::cnull()) {} tuple(typename access_traits::parameter_type t0, typename access_traits::parameter_type t1, typename access_traits::parameter_type t2, typename access_traits::parameter_type t3, typename access_traits::parameter_type t4, typename access_traits::parameter_type t5, typename access_traits::parameter_type t6, typename access_traits::parameter_type t7, typename access_traits::parameter_type t8) : inherited(t0, t1, t2, t3, t4, t5, t6, t7, t8, detail::cnull()) {} tuple(typename access_traits::parameter_type t0, typename access_traits::parameter_type t1, typename access_traits::parameter_type t2, typename access_traits::parameter_type t3, typename access_traits::parameter_type t4, typename access_traits::parameter_type t5, typename access_traits::parameter_type t6, typename access_traits::parameter_type t7, typename access_traits::parameter_type t8, typename access_traits::parameter_type t9) : inherited(t0, t1, t2, t3, t4, t5, t6, t7, t8, t9) {} template tuple(const cons& p) : inherited(p) {} template tuple& operator=(const cons& k) { inherited::operator=(k); return *this; } template tuple& operator=(const std::pair& k) { BOOST_STATIC_ASSERT(length::value == 2);// check_length = 2 this->head = k.first; this->tail.head = k.second; return *this; } }; // The empty tuple template <> class tuple : public null_type { public: typedef null_type inherited; }; // Swallows any assignment (by Doug Gregor) namespace detail { struct swallow_assign; typedef void (detail::swallow_assign::*ignore_t)(); struct swallow_assign { swallow_assign(ignore_t(*)(ignore_t)) {} template swallow_assign const& operator=(const T&) const { return *this; } }; } // namespace detail // "ignore" allows tuple positions to be ignored when using "tie". inline detail::ignore_t ignore(detail::ignore_t) { return 0; } // --------------------------------------------------------------------------- // The call_traits for make_tuple // Honours the reference_wrapper class. // Must be instantiated with plain or const plain types (not with references) // from template foo(const T& t) : make_tuple_traits::type // from template foo(T& t) : make_tuple_traits::type // Conversions: // T -> T, // references -> compile_time_error // reference_wrapper -> T& // const reference_wrapper -> T& // array -> const ref array template struct make_tuple_traits { typedef T type; // commented away, see below (JJ) // typedef typename IF< // boost::is_function::value, // T&, // T>::RET type; }; // The is_function test was there originally for plain function types, // which can't be stored as such (we must either store them as references or // pointers). Such a type could be formed if make_tuple was called with a // reference to a function. // But this would mean that a const qualified function type was formed in // the make_tuple function and hence make_tuple can't take a function // reference as a parameter, and thus T can't be a function type. // So is_function test was removed. // (14.8.3. says that type deduction fails if a cv-qualified function type // is created. (It only applies for the case of explicitly specifying template // args, though?)) (JJ) template struct make_tuple_traits { typedef typename detail::generate_error:: do_not_use_with_reference_type error; }; // Arrays can't be stored as plain types; convert them to references. // All arrays are converted to const. This is because make_tuple takes its // parameters as const T& and thus the knowledge of the potential // non-constness of actual argument is lost. template struct make_tuple_traits { typedef const T (&type)[n]; }; template struct make_tuple_traits { typedef const T (&type)[n]; }; template struct make_tuple_traits { typedef const volatile T (&type)[n]; }; template struct make_tuple_traits { typedef const volatile T (&type)[n]; }; template struct make_tuple_traits >{ typedef T& type; }; template struct make_tuple_traits >{ typedef T& type; }; template<> struct make_tuple_traits { typedef detail::swallow_assign type; }; namespace detail { // a helper traits to make the make_tuple functions shorter (Vesa Karvonen's // suggestion) template < class T0 = null_type, class T1 = null_type, class T2 = null_type, class T3 = null_type, class T4 = null_type, class T5 = null_type, class T6 = null_type, class T7 = null_type, class T8 = null_type, class T9 = null_type > struct make_tuple_mapper { typedef tuple::type, typename make_tuple_traits::type, typename make_tuple_traits::type, typename make_tuple_traits::type, typename make_tuple_traits::type, typename make_tuple_traits::type, typename make_tuple_traits::type, typename make_tuple_traits::type, typename make_tuple_traits::type, typename make_tuple_traits::type> type; }; } // end detail // -make_tuple function templates ----------------------------------- inline tuple<> make_tuple() { return tuple<>(); } template inline typename detail::make_tuple_mapper::type make_tuple(const T0& t0) { typedef typename detail::make_tuple_mapper::type t; return t(t0); } template inline typename detail::make_tuple_mapper::type make_tuple(const T0& t0, const T1& t1) { typedef typename detail::make_tuple_mapper::type t; return t(t0, t1); } template inline typename detail::make_tuple_mapper::type make_tuple(const T0& t0, const T1& t1, const T2& t2) { typedef typename detail::make_tuple_mapper::type t; return t(t0, t1, t2); } template inline typename detail::make_tuple_mapper::type make_tuple(const T0& t0, const T1& t1, const T2& t2, const T3& t3) { typedef typename detail::make_tuple_mapper::type t; return t(t0, t1, t2, t3); } template inline typename detail::make_tuple_mapper::type make_tuple(const T0& t0, const T1& t1, const T2& t2, const T3& t3, const T4& t4) { typedef typename detail::make_tuple_mapper::type t; return t(t0, t1, t2, t3, t4); } template inline typename detail::make_tuple_mapper::type make_tuple(const T0& t0, const T1& t1, const T2& t2, const T3& t3, const T4& t4, const T5& t5) { typedef typename detail::make_tuple_mapper::type t; return t(t0, t1, t2, t3, t4, t5); } template inline typename detail::make_tuple_mapper::type make_tuple(const T0& t0, const T1& t1, const T2& t2, const T3& t3, const T4& t4, const T5& t5, const T6& t6) { typedef typename detail::make_tuple_mapper ::type t; return t(t0, t1, t2, t3, t4, t5, t6); } template inline typename detail::make_tuple_mapper::type make_tuple(const T0& t0, const T1& t1, const T2& t2, const T3& t3, const T4& t4, const T5& t5, const T6& t6, const T7& t7) { typedef typename detail::make_tuple_mapper ::type t; return t(t0, t1, t2, t3, t4, t5, t6, t7); } template inline typename detail::make_tuple_mapper ::type make_tuple(const T0& t0, const T1& t1, const T2& t2, const T3& t3, const T4& t4, const T5& t5, const T6& t6, const T7& t7, const T8& t8) { typedef typename detail::make_tuple_mapper ::type t; return t(t0, t1, t2, t3, t4, t5, t6, t7, t8); } template inline typename detail::make_tuple_mapper ::type make_tuple(const T0& t0, const T1& t1, const T2& t2, const T3& t3, const T4& t4, const T5& t5, const T6& t6, const T7& t7, const T8& t8, const T9& t9) { typedef typename detail::make_tuple_mapper ::type t; return t(t0, t1, t2, t3, t4, t5, t6, t7, t8, t9); } namespace detail { template struct tie_traits { typedef T& type; }; template<> struct tie_traits { typedef swallow_assign type; }; template<> struct tie_traits { typedef null_type type; }; template < class T0 = void, class T1 = void, class T2 = void, class T3 = void, class T4 = void, class T5 = void, class T6 = void, class T7 = void, class T8 = void, class T9 = void > struct tie_mapper { typedef tuple::type, typename tie_traits::type, typename tie_traits::type, typename tie_traits::type, typename tie_traits::type, typename tie_traits::type, typename tie_traits::type, typename tie_traits::type, typename tie_traits::type, typename tie_traits::type> type; }; } // Tie function templates ------------------------------------------------- template inline typename detail::tie_mapper::type tie(T0& t0) { typedef typename detail::tie_mapper::type t; return t(t0); } template inline typename detail::tie_mapper::type tie(T0& t0, T1& t1) { typedef typename detail::tie_mapper::type t; return t(t0, t1); } template inline typename detail::tie_mapper::type tie(T0& t0, T1& t1, T2& t2) { typedef typename detail::tie_mapper::type t; return t(t0, t1, t2); } template inline typename detail::tie_mapper::type tie(T0& t0, T1& t1, T2& t2, T3& t3) { typedef typename detail::tie_mapper::type t; return t(t0, t1, t2, t3); } template inline typename detail::tie_mapper::type tie(T0& t0, T1& t1, T2& t2, T3& t3, T4& t4) { typedef typename detail::tie_mapper::type t; return t(t0, t1, t2, t3, t4); } template inline typename detail::tie_mapper::type tie(T0& t0, T1& t1, T2& t2, T3& t3, T4& t4, T5& t5) { typedef typename detail::tie_mapper::type t; return t(t0, t1, t2, t3, t4, t5); } template inline typename detail::tie_mapper::type tie(T0& t0, T1& t1, T2& t2, T3& t3, T4& t4, T5& t5, T6& t6) { typedef typename detail::tie_mapper ::type t; return t(t0, t1, t2, t3, t4, t5, t6); } template inline typename detail::tie_mapper::type tie(T0& t0, T1& t1, T2& t2, T3& t3, T4& t4, T5& t5, T6& t6, T7& t7) { typedef typename detail::tie_mapper ::type t; return t(t0, t1, t2, t3, t4, t5, t6, t7); } template inline typename detail::tie_mapper ::type tie(T0& t0, T1& t1, T2& t2, T3& t3, T4& t4, T5& t5, T6& t6, T7& t7, T8& t8) { typedef typename detail::tie_mapper ::type t; return t(t0, t1, t2, t3, t4, t5, t6, t7, t8); } template inline typename detail::tie_mapper ::type tie(T0& t0, T1& t1, T2& t2, T3& t3, T4& t4, T5& t5, T6& t6, T7& t7, T8& t8, T9& t9) { typedef typename detail::tie_mapper ::type t; return t(t0, t1, t2, t3, t4, t5, t6, t7, t8, t9); } template void swap(tuple& lhs, tuple& rhs); inline void swap(null_type&, null_type&) {} template inline void swap(cons& lhs, cons& rhs) { ::boost::swap(lhs.head, rhs.head); } template inline void swap(cons& lhs, cons& rhs) { ::boost::swap(lhs.head, rhs.head); ::boost::tuples::swap(lhs.tail, rhs.tail); } template inline void swap(tuple& lhs, tuple& rhs) { typedef tuple tuple_type; typedef typename tuple_type::inherited base; ::boost::tuples::swap(static_cast(lhs), static_cast(rhs)); } } // end of namespace tuples } // end of namespace boost #endif // BOOST_TUPLE_BASIC_HPP madp-0.4/src/boost/boost/PaxHeaders.5405/bind0000644000000000000000000000007412717644140015665 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.041552917 madp-0.4/src/boost/boost/bind/0000775000372100037210000000000012717644140016571 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/bind/PaxHeaders.5405/mem_fn.hpp0000644000000000000000000000007312717644140017713 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.041552917 madp-0.4/src/boost/boost/bind/mem_fn.hpp0000664000372100037210000001561112717644140020547 0ustar00fransfrans00000000000000#ifndef BOOST_BIND_MEM_FN_HPP_INCLUDED #define BOOST_BIND_MEM_FN_HPP_INCLUDED // MS compatible compilers support #pragma once #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once #endif // // mem_fn.hpp - a generalization of std::mem_fun[_ref] // // Copyright (c) 2001, 2002 Peter Dimov and Multi Media Ltd. // Copyright (c) 2001 David Abrahams // Copyright (c) 2003-2005 Peter Dimov // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/bind/mem_fn.html for documentation. // #include #include #include namespace boost { #if defined(BOOST_NO_VOID_RETURNS) #define BOOST_MEM_FN_CLASS_F , class F #define BOOST_MEM_FN_TYPEDEF(X) namespace _mfi // mem_fun_impl { template struct mf { #define BOOST_MEM_FN_RETURN return #define BOOST_MEM_FN_NAME(X) inner_##X #define BOOST_MEM_FN_CC #include #undef BOOST_MEM_FN_CC #undef BOOST_MEM_FN_NAME #ifdef BOOST_MEM_FN_ENABLE_CDECL #define BOOST_MEM_FN_NAME(X) inner_##X##_cdecl #define BOOST_MEM_FN_CC __cdecl #include #undef BOOST_MEM_FN_CC #undef BOOST_MEM_FN_NAME #endif #ifdef BOOST_MEM_FN_ENABLE_STDCALL #define BOOST_MEM_FN_NAME(X) inner_##X##_stdcall #define BOOST_MEM_FN_CC __stdcall #include #undef BOOST_MEM_FN_CC #undef BOOST_MEM_FN_NAME #endif #ifdef BOOST_MEM_FN_ENABLE_FASTCALL #define BOOST_MEM_FN_NAME(X) inner_##X##_fastcall #define BOOST_MEM_FN_CC __fastcall #include #undef BOOST_MEM_FN_CC #undef BOOST_MEM_FN_NAME #endif #undef BOOST_MEM_FN_RETURN }; // struct mf template<> struct mf { #define BOOST_MEM_FN_RETURN #define BOOST_MEM_FN_NAME(X) inner_##X #define BOOST_MEM_FN_CC #include #undef BOOST_MEM_FN_CC #undef BOOST_MEM_FN_NAME #ifdef BOOST_MEM_FN_ENABLE_CDECL #define BOOST_MEM_FN_NAME(X) inner_##X##_cdecl #define BOOST_MEM_FN_CC __cdecl #include #undef BOOST_MEM_FN_CC #undef BOOST_MEM_FN_NAME #endif #ifdef BOOST_MEM_FN_ENABLE_STDCALL #define BOOST_MEM_FN_NAME(X) inner_##X##_stdcall #define BOOST_MEM_FN_CC __stdcall #include #undef BOOST_MEM_FN_CC #undef BOOST_MEM_FN_NAME #endif #ifdef BOOST_MEM_FN_ENABLE_FASTCALL #define BOOST_MEM_FN_NAME(X) inner_##X##_fastcall #define BOOST_MEM_FN_CC __fastcall #include #undef BOOST_MEM_FN_CC #undef BOOST_MEM_FN_NAME #endif #undef BOOST_MEM_FN_RETURN }; // struct mf #undef BOOST_MEM_FN_CLASS_F #undef BOOST_MEM_FN_TYPEDEF_F #define BOOST_MEM_FN_NAME(X) X #define BOOST_MEM_FN_NAME2(X) inner_##X #define BOOST_MEM_FN_CC #include #undef BOOST_MEM_FN_NAME #undef BOOST_MEM_FN_NAME2 #undef BOOST_MEM_FN_CC #ifdef BOOST_MEM_FN_ENABLE_CDECL #define BOOST_MEM_FN_NAME(X) X##_cdecl #define BOOST_MEM_FN_NAME2(X) inner_##X##_cdecl #define BOOST_MEM_FN_CC __cdecl #include #undef BOOST_MEM_FN_NAME #undef BOOST_MEM_FN_NAME2 #undef BOOST_MEM_FN_CC #endif #ifdef BOOST_MEM_FN_ENABLE_STDCALL #define BOOST_MEM_FN_NAME(X) X##_stdcall #define BOOST_MEM_FN_NAME2(X) inner_##X##_stdcall #define BOOST_MEM_FN_CC __stdcall #include #undef BOOST_MEM_FN_NAME #undef BOOST_MEM_FN_NAME2 #undef BOOST_MEM_FN_CC #endif #ifdef BOOST_MEM_FN_ENABLE_FASTCALL #define BOOST_MEM_FN_NAME(X) X##_fastcall #define BOOST_MEM_FN_NAME2(X) inner_##X##_fastcall #define BOOST_MEM_FN_CC __fastcall #include #undef BOOST_MEM_FN_NAME #undef BOOST_MEM_FN_NAME2 #undef BOOST_MEM_FN_CC #endif } // namespace _mfi #else // #ifdef BOOST_NO_VOID_RETURNS #define BOOST_MEM_FN_CLASS_F #define BOOST_MEM_FN_TYPEDEF(X) typedef X; namespace _mfi { #define BOOST_MEM_FN_RETURN return #define BOOST_MEM_FN_NAME(X) X #define BOOST_MEM_FN_CC #include #undef BOOST_MEM_FN_CC #undef BOOST_MEM_FN_NAME #ifdef BOOST_MEM_FN_ENABLE_CDECL #define BOOST_MEM_FN_NAME(X) X##_cdecl #define BOOST_MEM_FN_CC __cdecl #include #undef BOOST_MEM_FN_CC #undef BOOST_MEM_FN_NAME #endif #ifdef BOOST_MEM_FN_ENABLE_STDCALL #define BOOST_MEM_FN_NAME(X) X##_stdcall #define BOOST_MEM_FN_CC __stdcall #include #undef BOOST_MEM_FN_CC #undef BOOST_MEM_FN_NAME #endif #ifdef BOOST_MEM_FN_ENABLE_FASTCALL #define BOOST_MEM_FN_NAME(X) X##_fastcall #define BOOST_MEM_FN_CC __fastcall #include #undef BOOST_MEM_FN_CC #undef BOOST_MEM_FN_NAME #endif #undef BOOST_MEM_FN_RETURN } // namespace _mfi #undef BOOST_MEM_FN_CLASS_F #undef BOOST_MEM_FN_TYPEDEF #endif // #ifdef BOOST_NO_VOID_RETURNS #define BOOST_MEM_FN_NAME(X) X #define BOOST_MEM_FN_CC #include #undef BOOST_MEM_FN_NAME #undef BOOST_MEM_FN_CC #ifdef BOOST_MEM_FN_ENABLE_CDECL #define BOOST_MEM_FN_NAME(X) X##_cdecl #define BOOST_MEM_FN_CC __cdecl #include #undef BOOST_MEM_FN_NAME #undef BOOST_MEM_FN_CC #endif #ifdef BOOST_MEM_FN_ENABLE_STDCALL #define BOOST_MEM_FN_NAME(X) X##_stdcall #define BOOST_MEM_FN_CC __stdcall #include #undef BOOST_MEM_FN_NAME #undef BOOST_MEM_FN_CC #endif #ifdef BOOST_MEM_FN_ENABLE_FASTCALL #define BOOST_MEM_FN_NAME(X) X##_fastcall #define BOOST_MEM_FN_CC __fastcall #include #undef BOOST_MEM_FN_NAME #undef BOOST_MEM_FN_CC #endif // data member support namespace _mfi { template class dm { public: typedef R const & result_type; typedef T const * argument_type; private: typedef R (T::*F); F f_; template R const & call(U & u, T const *) const { return (u.*f_); } template R const & call(U & u, void const *) const { return (get_pointer(u)->*f_); } public: explicit dm(F f): f_(f) {} R & operator()(T * p) const { return (p->*f_); } R const & operator()(T const * p) const { return (p->*f_); } template R const & operator()(U const & u) const { return call(u, &u); } #if !BOOST_WORKAROUND(BOOST_MSVC, <= 1300) && !BOOST_WORKAROUND(__MWERKS__, < 0x3200) R & operator()(T & t) const { return (t.*f_); } R const & operator()(T const & t) const { return (t.*f_); } #endif bool operator==(dm const & rhs) const { return f_ == rhs.f_; } bool operator!=(dm const & rhs) const { return f_ != rhs.f_; } }; } // namespace _mfi template _mfi::dm mem_fn(R T::*f) { return _mfi::dm(f); } } // namespace boost #endif // #ifndef BOOST_BIND_MEM_FN_HPP_INCLUDED madp-0.4/src/boost/boost/bind/PaxHeaders.5405/mem_fn_cc.hpp0000644000000000000000000000007312717644140020360 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.041552917 madp-0.4/src/boost/boost/bind/mem_fn_cc.hpp0000664000372100037210000001130412717644140021207 0ustar00fransfrans00000000000000// // bind/mem_fn_cc.hpp - support for different calling conventions // // Do not include this header directly. // // Copyright (c) 2001 Peter Dimov and Multi Media Ltd. // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/bind/mem_fn.html for documentation. // template _mfi::BOOST_MEM_FN_NAME(mf0) mem_fn(R (BOOST_MEM_FN_CC T::*f) ()) { return _mfi::BOOST_MEM_FN_NAME(mf0)(f); } template _mfi::BOOST_MEM_FN_NAME(cmf0) mem_fn(R (BOOST_MEM_FN_CC T::*f) () const) { return _mfi::BOOST_MEM_FN_NAME(cmf0)(f); } template _mfi::BOOST_MEM_FN_NAME(mf1) mem_fn(R (BOOST_MEM_FN_CC T::*f) (A1)) { return _mfi::BOOST_MEM_FN_NAME(mf1)(f); } template _mfi::BOOST_MEM_FN_NAME(cmf1) mem_fn(R (BOOST_MEM_FN_CC T::*f) (A1) const) { return _mfi::BOOST_MEM_FN_NAME(cmf1)(f); } template _mfi::BOOST_MEM_FN_NAME(mf2) mem_fn(R (BOOST_MEM_FN_CC T::*f) (A1, A2)) { return _mfi::BOOST_MEM_FN_NAME(mf2)(f); } template _mfi::BOOST_MEM_FN_NAME(cmf2) mem_fn(R (BOOST_MEM_FN_CC T::*f) (A1, A2) const) { return _mfi::BOOST_MEM_FN_NAME(cmf2)(f); } template _mfi::BOOST_MEM_FN_NAME(mf3) mem_fn(R (BOOST_MEM_FN_CC T::*f) (A1, A2, A3)) { return _mfi::BOOST_MEM_FN_NAME(mf3)(f); } template _mfi::BOOST_MEM_FN_NAME(cmf3) mem_fn(R (BOOST_MEM_FN_CC T::*f) (A1, A2, A3) const) { return _mfi::BOOST_MEM_FN_NAME(cmf3)(f); } template _mfi::BOOST_MEM_FN_NAME(mf4) mem_fn(R (BOOST_MEM_FN_CC T::*f) (A1, A2, A3, A4)) { return _mfi::BOOST_MEM_FN_NAME(mf4)(f); } template _mfi::BOOST_MEM_FN_NAME(cmf4) mem_fn(R (BOOST_MEM_FN_CC T::*f) (A1, A2, A3, A4) const) { return _mfi::BOOST_MEM_FN_NAME(cmf4)(f); } template _mfi::BOOST_MEM_FN_NAME(mf5) mem_fn(R (BOOST_MEM_FN_CC T::*f) (A1, A2, A3, A4, A5)) { return _mfi::BOOST_MEM_FN_NAME(mf5)(f); } template _mfi::BOOST_MEM_FN_NAME(cmf5) mem_fn(R (BOOST_MEM_FN_CC T::*f) (A1, A2, A3, A4, A5) const) { return _mfi::BOOST_MEM_FN_NAME(cmf5)(f); } template _mfi::BOOST_MEM_FN_NAME(mf6) mem_fn(R (BOOST_MEM_FN_CC T::*f) (A1, A2, A3, A4, A5, A6)) { return _mfi::BOOST_MEM_FN_NAME(mf6)(f); } template _mfi::BOOST_MEM_FN_NAME(cmf6) mem_fn(R (BOOST_MEM_FN_CC T::*f) (A1, A2, A3, A4, A5, A6) const) { return _mfi::BOOST_MEM_FN_NAME(cmf6)(f); } template _mfi::BOOST_MEM_FN_NAME(mf7) mem_fn(R (BOOST_MEM_FN_CC T::*f) (A1, A2, A3, A4, A5, A6, A7)) { return _mfi::BOOST_MEM_FN_NAME(mf7)(f); } template _mfi::BOOST_MEM_FN_NAME(cmf7) mem_fn(R (BOOST_MEM_FN_CC T::*f) (A1, A2, A3, A4, A5, A6, A7) const) { return _mfi::BOOST_MEM_FN_NAME(cmf7)(f); } template _mfi::BOOST_MEM_FN_NAME(mf8) mem_fn(R (BOOST_MEM_FN_CC T::*f) (A1, A2, A3, A4, A5, A6, A7, A8)) { return _mfi::BOOST_MEM_FN_NAME(mf8)(f); } template _mfi::BOOST_MEM_FN_NAME(cmf8) mem_fn(R (BOOST_MEM_FN_CC T::*f) (A1, A2, A3, A4, A5, A6, A7, A8) const) { return _mfi::BOOST_MEM_FN_NAME(cmf8)(f); } madp-0.4/src/boost/boost/bind/PaxHeaders.5405/placeholders.hpp0000644000000000000000000000007312717644140021117 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.041552917 madp-0.4/src/boost/boost/bind/placeholders.hpp0000664000372100037210000000354312717644140021754 0ustar00fransfrans00000000000000#ifndef BOOST_BIND_PLACEHOLDERS_HPP_INCLUDED #define BOOST_BIND_PLACEHOLDERS_HPP_INCLUDED // MS compatible compilers support #pragma once #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once #endif // // bind/placeholders.hpp - _N definitions // // Copyright (c) 2002 Peter Dimov and Multi Media Ltd. // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/bind/bind.html for documentation. // #include #include namespace { #if defined(__BORLANDC__) || defined(__GNUC__) && (__GNUC__ < 4) static inline boost::arg<1> _1() { return boost::arg<1>(); } static inline boost::arg<2> _2() { return boost::arg<2>(); } static inline boost::arg<3> _3() { return boost::arg<3>(); } static inline boost::arg<4> _4() { return boost::arg<4>(); } static inline boost::arg<5> _5() { return boost::arg<5>(); } static inline boost::arg<6> _6() { return boost::arg<6>(); } static inline boost::arg<7> _7() { return boost::arg<7>(); } static inline boost::arg<8> _8() { return boost::arg<8>(); } static inline boost::arg<9> _9() { return boost::arg<9>(); } #elif defined(BOOST_MSVC) || (defined(__DECCXX_VER) && __DECCXX_VER <= 60590031) || defined(__MWERKS__) || \ defined(__GNUC__) && (__GNUC__ == 4 && __GNUC_MINOR__ < 2) static boost::arg<1> _1; static boost::arg<2> _2; static boost::arg<3> _3; static boost::arg<4> _4; static boost::arg<5> _5; static boost::arg<6> _6; static boost::arg<7> _7; static boost::arg<8> _8; static boost::arg<9> _9; #else boost::arg<1> _1; boost::arg<2> _2; boost::arg<3> _3; boost::arg<4> _4; boost::arg<5> _5; boost::arg<6> _6; boost::arg<7> _7; boost::arg<8> _8; boost::arg<9> _9; #endif } // unnamed namespace #endif // #ifndef BOOST_BIND_PLACEHOLDERS_HPP_INCLUDED madp-0.4/src/boost/boost/bind/PaxHeaders.5405/bind_mf2_cc.hpp0000644000000000000000000000007312717644140020577 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.041552917 madp-0.4/src/boost/boost/bind/bind_mf2_cc.hpp0000664000372100037210000002611212717644140021431 0ustar00fransfrans00000000000000// // bind/bind_mf2_cc.hpp - member functions, type<> syntax // // Do not include this header directly. // // Copyright (c) 2001 Peter Dimov and Multi Media Ltd. // Copyright (c) 2008 Peter Dimov // // Distributed under the Boost Software License, Version 1.0. // See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt // // See http://www.boost.org/libs/bind/bind.html for documentation. // // 0 template _bi::bind_t, typename _bi::list_av_1::type> BOOST_BIND(boost::type, R (BOOST_BIND_MF_CC T::*f) (), A1 a1) { typedef _mfi::BOOST_BIND_MF_NAME(mf0) F; typedef typename _bi::list_av_1::type list_type; return _bi::bind_t(F(f), list_type(a1)); } template _bi::bind_t, typename _bi::list_av_1::type> BOOST_BIND(boost::type, R (BOOST_BIND_MF_CC T::*f) () const, A1 a1) { typedef _mfi::BOOST_BIND_MF_NAME(cmf0) F; typedef typename _bi::list_av_1::type list_type; return _bi::bind_t(F(f), list_type(a1)); } // 1 template _bi::bind_t, typename _bi::list_av_2::type> BOOST_BIND(boost::type, R (BOOST_BIND_MF_CC T::*f) (B1), A1 a1, A2 a2) { typedef _mfi::BOOST_BIND_MF_NAME(mf1) F; typedef typename _bi::list_av_2::type list_type; return _bi::bind_t(F(f), list_type(a1, a2)); } template _bi::bind_t, typename _bi::list_av_2::type> BOOST_BIND(boost::type, R (BOOST_BIND_MF_CC T::*f) (B1) const, A1 a1, A2 a2) { typedef _mfi::BOOST_BIND_MF_NAME(cmf1) F; typedef typename _bi::list_av_2::type list_type; return _bi::bind_t(F(f), list_type(a1, a2)); } // 2 template _bi::bind_t, typename _bi::list_av_3::type> BOOST_BIND(boost::type, R (BOOST_BIND_MF_CC T::*f) (B1, B2), A1 a1, A2 a2, A3 a3) { typedef _mfi::BOOST_BIND_MF_NAME(mf2) F; typedef typename _bi::list_av_3::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3)); } template _bi::bind_t, typename _bi::list_av_3::type> BOOST_BIND(boost::type, R (BOOST_BIND_MF_CC T::*f) (B1, B2) const, A1 a1, A2 a2, A3 a3) { typedef _mfi::BOOST_BIND_MF_NAME(cmf2) F; typedef typename _bi::list_av_3::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3)); } // 3 template _bi::bind_t, typename _bi::list_av_4::type> BOOST_BIND(boost::type, R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3), A1 a1, A2 a2, A3 a3, A4 a4) { typedef _mfi::BOOST_BIND_MF_NAME(mf3) F; typedef typename _bi::list_av_4::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3, a4)); } template _bi::bind_t, typename _bi::list_av_4::type> BOOST_BIND(boost::type, R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3) const, A1 a1, A2 a2, A3 a3, A4 a4) { typedef _mfi::BOOST_BIND_MF_NAME(cmf3) F; typedef typename _bi::list_av_4::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3, a4)); } // 4 template _bi::bind_t, typename _bi::list_av_5::type> BOOST_BIND(boost::type, R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4), A1 a1, A2 a2, A3 a3, A4 a4, A5 a5) { typedef _mfi::BOOST_BIND_MF_NAME(mf4) F; typedef typename _bi::list_av_5::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3, a4, a5)); } template _bi::bind_t, typename _bi::list_av_5::type> BOOST_BIND(boost::type, R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4) const, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5) { typedef _mfi::BOOST_BIND_MF_NAME(cmf4) F; typedef typename _bi::list_av_5::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3, a4, a5)); } // 5 template _bi::bind_t, typename _bi::list_av_6::type> BOOST_BIND(boost::type, R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5), A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6) { typedef _mfi::BOOST_BIND_MF_NAME(mf5) F; typedef typename _bi::list_av_6::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3, a4, a5, a6)); } template _bi::bind_t, typename _bi::list_av_6::type> BOOST_BIND(boost::type, R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5) const, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6) { typedef _mfi::BOOST_BIND_MF_NAME(cmf5) F; typedef typename _bi::list_av_6::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3, a4, a5, a6)); } // 6 template _bi::bind_t, typename _bi::list_av_7::type> BOOST_BIND(boost::type, R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6), A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7) { typedef _mfi::BOOST_BIND_MF_NAME(mf6) F; typedef typename _bi::list_av_7::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3, a4, a5, a6, a7)); } template _bi::bind_t, typename _bi::list_av_7::type> BOOST_BIND(boost::type, R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6) const, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7) { typedef _mfi::BOOST_BIND_MF_NAME(cmf6) F; typedef typename _bi::list_av_7::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3, a4, a5, a6, a7)); } // 7 template _bi::bind_t, typename _bi::list_av_8::type> BOOST_BIND(boost::type, R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6, B7), A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8) { typedef _mfi::BOOST_BIND_MF_NAME(mf7) F; typedef typename _bi::list_av_8::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3, a4, a5, a6, a7, a8)); } template _bi::bind_t, typename _bi::list_av_8::type> BOOST_BIND(boost::type, R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6, B7) const, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8) { typedef _mfi::BOOST_BIND_MF_NAME(cmf7) F; typedef typename _bi::list_av_8::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3, a4, a5, a6, a7, a8)); } // 8 template _bi::bind_t, typename _bi::list_av_9::type> BOOST_BIND(boost::type, R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6, B7, B8), A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9) { typedef _mfi::BOOST_BIND_MF_NAME(mf8) F; typedef typename _bi::list_av_9::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3, a4, a5, a6, a7, a8, a9)); } template _bi::bind_t, typename _bi::list_av_9::type> BOOST_BIND(boost::type, R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6, B7, B8) const, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9) { typedef _mfi::BOOST_BIND_MF_NAME(cmf8) F; typedef typename _bi::list_av_9::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3, a4, a5, a6, a7, a8, a9)); } madp-0.4/src/boost/boost/bind/PaxHeaders.5405/arg.hpp0000644000000000000000000000007412717644140017224 xustar0030 atime=1463765180.093720222 30 ctime=1463765201.041552917 madp-0.4/src/boost/boost/bind/arg.hpp0000664000372100037210000000233212717644140020053 0ustar00fransfrans00000000000000#ifndef BOOST_BIND_ARG_HPP_INCLUDED #define BOOST_BIND_ARG_HPP_INCLUDED // MS compatible compilers support #pragma once #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once #endif // // bind/arg.hpp // // Copyright (c) 2002 Peter Dimov and Multi Media Ltd. // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/bind/bind.html for documentation. // #include #include namespace boost { template< int I > struct arg { arg() { } template< class T > arg( T const & /* t */ ) { // static assert I == is_placeholder::value typedef char T_must_be_placeholder[ I == is_placeholder::value? 1: -1 ]; } }; template< int I > bool operator==( arg const &, arg const & ) { return true; } #if !defined( BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION ) template< int I > struct is_placeholder< arg > { enum _vt { value = I }; }; template< int I > struct is_placeholder< arg (*) () > { enum _vt { value = I }; }; #endif } // namespace boost #endif // #ifndef BOOST_BIND_ARG_HPP_INCLUDED madp-0.4/src/boost/boost/bind/PaxHeaders.5405/storage.hpp0000644000000000000000000000007312717644140020116 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.041552917 madp-0.4/src/boost/boost/bind/storage.hpp0000664000372100037210000003207412717644140020754 0ustar00fransfrans00000000000000#ifndef BOOST_BIND_STORAGE_HPP_INCLUDED #define BOOST_BIND_STORAGE_HPP_INCLUDED // MS compatible compilers support #pragma once #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once #endif // // bind/storage.hpp // // boost/bind.hpp support header, optimized storage // // Copyright (c) 2006 Peter Dimov // // Distributed under the Boost Software License, Version 1.0. // See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt // // See http://www.boost.org/libs/bind/bind.html for documentation. // #include #include #ifdef BOOST_MSVC # pragma warning(push) # pragma warning(disable: 4512) // assignment operator could not be generated #endif namespace boost { namespace _bi { // 1 template struct storage1 { explicit storage1( A1 a1 ): a1_( a1 ) {} template void accept(V & v) const { BOOST_BIND_VISIT_EACH(v, a1_, 0); } A1 a1_; }; #if !defined( BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION ) && !defined( __BORLANDC__ ) template struct storage1< boost::arg > { explicit storage1( boost::arg ) {} template void accept(V &) const { } static boost::arg a1_() { return boost::arg(); } }; template struct storage1< boost::arg (*) () > { explicit storage1( boost::arg (*) () ) {} template void accept(V &) const { } static boost::arg a1_() { return boost::arg(); } }; #endif // 2 template struct storage2: public storage1 { typedef storage1 inherited; storage2( A1 a1, A2 a2 ): storage1( a1 ), a2_( a2 ) {} template void accept(V & v) const { inherited::accept(v); BOOST_BIND_VISIT_EACH(v, a2_, 0); } A2 a2_; }; #if !defined( BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION ) template struct storage2< A1, boost::arg >: public storage1 { typedef storage1 inherited; storage2( A1 a1, boost::arg ): storage1( a1 ) {} template void accept(V & v) const { inherited::accept(v); } static boost::arg a2_() { return boost::arg(); } }; template struct storage2< A1, boost::arg (*) () >: public storage1 { typedef storage1 inherited; storage2( A1 a1, boost::arg (*) () ): storage1( a1 ) {} template void accept(V & v) const { inherited::accept(v); } static boost::arg a2_() { return boost::arg(); } }; #endif // 3 template struct storage3: public storage2< A1, A2 > { typedef storage2 inherited; storage3( A1 a1, A2 a2, A3 a3 ): storage2( a1, a2 ), a3_( a3 ) {} template void accept(V & v) const { inherited::accept(v); BOOST_BIND_VISIT_EACH(v, a3_, 0); } A3 a3_; }; #if !defined( BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION ) template struct storage3< A1, A2, boost::arg >: public storage2< A1, A2 > { typedef storage2 inherited; storage3( A1 a1, A2 a2, boost::arg ): storage2( a1, a2 ) {} template void accept(V & v) const { inherited::accept(v); } static boost::arg a3_() { return boost::arg(); } }; template struct storage3< A1, A2, boost::arg (*) () >: public storage2< A1, A2 > { typedef storage2 inherited; storage3( A1 a1, A2 a2, boost::arg (*) () ): storage2( a1, a2 ) {} template void accept(V & v) const { inherited::accept(v); } static boost::arg a3_() { return boost::arg(); } }; #endif // 4 template struct storage4: public storage3< A1, A2, A3 > { typedef storage3 inherited; storage4( A1 a1, A2 a2, A3 a3, A4 a4 ): storage3( a1, a2, a3 ), a4_( a4 ) {} template void accept(V & v) const { inherited::accept(v); BOOST_BIND_VISIT_EACH(v, a4_, 0); } A4 a4_; }; #if !defined( BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION ) template struct storage4< A1, A2, A3, boost::arg >: public storage3< A1, A2, A3 > { typedef storage3 inherited; storage4( A1 a1, A2 a2, A3 a3, boost::arg ): storage3( a1, a2, a3 ) {} template void accept(V & v) const { inherited::accept(v); } static boost::arg a4_() { return boost::arg(); } }; template struct storage4< A1, A2, A3, boost::arg (*) () >: public storage3< A1, A2, A3 > { typedef storage3 inherited; storage4( A1 a1, A2 a2, A3 a3, boost::arg (*) () ): storage3( a1, a2, a3 ) {} template void accept(V & v) const { inherited::accept(v); } static boost::arg a4_() { return boost::arg(); } }; #endif // 5 template struct storage5: public storage4< A1, A2, A3, A4 > { typedef storage4 inherited; storage5( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5 ): storage4( a1, a2, a3, a4 ), a5_( a5 ) {} template void accept(V & v) const { inherited::accept(v); BOOST_BIND_VISIT_EACH(v, a5_, 0); } A5 a5_; }; #if !defined( BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION ) template struct storage5< A1, A2, A3, A4, boost::arg >: public storage4< A1, A2, A3, A4 > { typedef storage4 inherited; storage5( A1 a1, A2 a2, A3 a3, A4 a4, boost::arg ): storage4( a1, a2, a3, a4 ) {} template void accept(V & v) const { inherited::accept(v); } static boost::arg a5_() { return boost::arg(); } }; template struct storage5< A1, A2, A3, A4, boost::arg (*) () >: public storage4< A1, A2, A3, A4 > { typedef storage4 inherited; storage5( A1 a1, A2 a2, A3 a3, A4 a4, boost::arg (*) () ): storage4( a1, a2, a3, a4 ) {} template void accept(V & v) const { inherited::accept(v); } static boost::arg a5_() { return boost::arg(); } }; #endif // 6 template struct storage6: public storage5< A1, A2, A3, A4, A5 > { typedef storage5 inherited; storage6( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6 ): storage5( a1, a2, a3, a4, a5 ), a6_( a6 ) {} template void accept(V & v) const { inherited::accept(v); BOOST_BIND_VISIT_EACH(v, a6_, 0); } A6 a6_; }; #if !defined( BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION ) template struct storage6< A1, A2, A3, A4, A5, boost::arg >: public storage5< A1, A2, A3, A4, A5 > { typedef storage5 inherited; storage6( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, boost::arg ): storage5( a1, a2, a3, a4, a5 ) {} template void accept(V & v) const { inherited::accept(v); } static boost::arg a6_() { return boost::arg(); } }; template struct storage6< A1, A2, A3, A4, A5, boost::arg (*) () >: public storage5< A1, A2, A3, A4, A5 > { typedef storage5 inherited; storage6( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, boost::arg (*) () ): storage5( a1, a2, a3, a4, a5 ) {} template void accept(V & v) const { inherited::accept(v); } static boost::arg a6_() { return boost::arg(); } }; #endif // 7 template struct storage7: public storage6< A1, A2, A3, A4, A5, A6 > { typedef storage6 inherited; storage7( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7 ): storage6( a1, a2, a3, a4, a5, a6 ), a7_( a7 ) {} template void accept(V & v) const { inherited::accept(v); BOOST_BIND_VISIT_EACH(v, a7_, 0); } A7 a7_; }; #if !defined( BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION ) template struct storage7< A1, A2, A3, A4, A5, A6, boost::arg >: public storage6< A1, A2, A3, A4, A5, A6 > { typedef storage6 inherited; storage7( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, boost::arg ): storage6( a1, a2, a3, a4, a5, a6 ) {} template void accept(V & v) const { inherited::accept(v); } static boost::arg a7_() { return boost::arg(); } }; template struct storage7< A1, A2, A3, A4, A5, A6, boost::arg (*) () >: public storage6< A1, A2, A3, A4, A5, A6 > { typedef storage6 inherited; storage7( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, boost::arg (*) () ): storage6( a1, a2, a3, a4, a5, a6 ) {} template void accept(V & v) const { inherited::accept(v); } static boost::arg a7_() { return boost::arg(); } }; #endif // 8 template struct storage8: public storage7< A1, A2, A3, A4, A5, A6, A7 > { typedef storage7 inherited; storage8( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8 ): storage7( a1, a2, a3, a4, a5, a6, a7 ), a8_( a8 ) {} template void accept(V & v) const { inherited::accept(v); BOOST_BIND_VISIT_EACH(v, a8_, 0); } A8 a8_; }; #if !defined( BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION ) template struct storage8< A1, A2, A3, A4, A5, A6, A7, boost::arg >: public storage7< A1, A2, A3, A4, A5, A6, A7 > { typedef storage7 inherited; storage8( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, boost::arg ): storage7( a1, a2, a3, a4, a5, a6, a7 ) {} template void accept(V & v) const { inherited::accept(v); } static boost::arg a8_() { return boost::arg(); } }; template struct storage8< A1, A2, A3, A4, A5, A6, A7, boost::arg (*) () >: public storage7< A1, A2, A3, A4, A5, A6, A7 > { typedef storage7 inherited; storage8( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, boost::arg (*) () ): storage7( a1, a2, a3, a4, a5, a6, a7 ) {} template void accept(V & v) const { inherited::accept(v); } static boost::arg a8_() { return boost::arg(); } }; #endif // 9 template struct storage9: public storage8< A1, A2, A3, A4, A5, A6, A7, A8 > { typedef storage8 inherited; storage9( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9 ): storage8( a1, a2, a3, a4, a5, a6, a7, a8 ), a9_( a9 ) {} template void accept(V & v) const { inherited::accept(v); BOOST_BIND_VISIT_EACH(v, a9_, 0); } A9 a9_; }; #if !defined( BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION ) template struct storage9< A1, A2, A3, A4, A5, A6, A7, A8, boost::arg >: public storage8< A1, A2, A3, A4, A5, A6, A7, A8 > { typedef storage8 inherited; storage9( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, boost::arg ): storage8( a1, a2, a3, a4, a5, a6, a7, a8 ) {} template void accept(V & v) const { inherited::accept(v); } static boost::arg a9_() { return boost::arg(); } }; template struct storage9< A1, A2, A3, A4, A5, A6, A7, A8, boost::arg (*) () >: public storage8< A1, A2, A3, A4, A5, A6, A7, A8 > { typedef storage8 inherited; storage9( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, boost::arg (*) () ): storage8( a1, a2, a3, a4, a5, a6, a7, a8 ) {} template void accept(V & v) const { inherited::accept(v); } static boost::arg a9_() { return boost::arg(); } }; #endif } // namespace _bi } // namespace boost #ifdef BOOST_MSVC # pragma warning(default: 4512) // assignment operator could not be generated # pragma warning(pop) #endif #endif // #ifndef BOOST_BIND_STORAGE_HPP_INCLUDED madp-0.4/src/boost/boost/bind/PaxHeaders.5405/bind_cc.hpp0000644000000000000000000000007312717644140020033 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.041552917 madp-0.4/src/boost/boost/bind/bind_cc.hpp0000664000372100037210000001342412717644140020667 0ustar00fransfrans00000000000000// // bind/bind_cc.hpp - support for different calling conventions // // Do not include this header directly. // // Copyright (c) 2001 Peter Dimov and Multi Media Ltd. // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/bind/bind.html for documentation. // template _bi::bind_t BOOST_BIND(BOOST_BIND_ST R (BOOST_BIND_CC *f) ()) { typedef BOOST_BIND_ST R (BOOST_BIND_CC *F) (); typedef _bi::list0 list_type; return _bi::bind_t (f, list_type()); } template _bi::bind_t::type> BOOST_BIND(BOOST_BIND_ST R (BOOST_BIND_CC *f) (B1), A1 a1) { typedef BOOST_BIND_ST R (BOOST_BIND_CC *F) (B1); typedef typename _bi::list_av_1::type list_type; return _bi::bind_t (f, list_type(a1)); } template _bi::bind_t::type> BOOST_BIND(BOOST_BIND_ST R (BOOST_BIND_CC *f) (B1, B2), A1 a1, A2 a2) { typedef BOOST_BIND_ST R (BOOST_BIND_CC *F) (B1, B2); typedef typename _bi::list_av_2::type list_type; return _bi::bind_t (f, list_type(a1, a2)); } template _bi::bind_t::type> BOOST_BIND(BOOST_BIND_ST R (BOOST_BIND_CC *f) (B1, B2, B3), A1 a1, A2 a2, A3 a3) { typedef BOOST_BIND_ST R (BOOST_BIND_CC *F) (B1, B2, B3); typedef typename _bi::list_av_3::type list_type; return _bi::bind_t(f, list_type(a1, a2, a3)); } template _bi::bind_t::type> BOOST_BIND(BOOST_BIND_ST R (BOOST_BIND_CC *f) (B1, B2, B3, B4), A1 a1, A2 a2, A3 a3, A4 a4) { typedef BOOST_BIND_ST R (BOOST_BIND_CC *F) (B1, B2, B3, B4); typedef typename _bi::list_av_4::type list_type; return _bi::bind_t(f, list_type(a1, a2, a3, a4)); } template _bi::bind_t::type> BOOST_BIND(BOOST_BIND_ST R (BOOST_BIND_CC *f) (B1, B2, B3, B4, B5), A1 a1, A2 a2, A3 a3, A4 a4, A5 a5) { typedef BOOST_BIND_ST R (BOOST_BIND_CC *F) (B1, B2, B3, B4, B5); typedef typename _bi::list_av_5::type list_type; return _bi::bind_t(f, list_type(a1, a2, a3, a4, a5)); } template _bi::bind_t::type> BOOST_BIND(BOOST_BIND_ST R (BOOST_BIND_CC *f) (B1, B2, B3, B4, B5, B6), A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6) { typedef BOOST_BIND_ST R (BOOST_BIND_CC *F) (B1, B2, B3, B4, B5, B6); typedef typename _bi::list_av_6::type list_type; return _bi::bind_t(f, list_type(a1, a2, a3, a4, a5, a6)); } template _bi::bind_t::type> BOOST_BIND(BOOST_BIND_ST R (BOOST_BIND_CC *f) (B1, B2, B3, B4, B5, B6, B7), A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7) { typedef BOOST_BIND_ST R (BOOST_BIND_CC *F) (B1, B2, B3, B4, B5, B6, B7); typedef typename _bi::list_av_7::type list_type; return _bi::bind_t(f, list_type(a1, a2, a3, a4, a5, a6, a7)); } template _bi::bind_t::type> BOOST_BIND(BOOST_BIND_ST R (BOOST_BIND_CC *f) (B1, B2, B3, B4, B5, B6, B7, B8), A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8) { typedef BOOST_BIND_ST R (BOOST_BIND_CC *F) (B1, B2, B3, B4, B5, B6, B7, B8); typedef typename _bi::list_av_8::type list_type; return _bi::bind_t(f, list_type(a1, a2, a3, a4, a5, a6, a7, a8)); } template _bi::bind_t::type> BOOST_BIND(BOOST_BIND_ST R (BOOST_BIND_CC *f) (B1, B2, B3, B4, B5, B6, B7, B8, B9), A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9) { typedef BOOST_BIND_ST R (BOOST_BIND_CC *F) (B1, B2, B3, B4, B5, B6, B7, B8, B9); typedef typename _bi::list_av_9::type list_type; return _bi::bind_t(f, list_type(a1, a2, a3, a4, a5, a6, a7, a8, a9)); } madp-0.4/src/boost/boost/bind/PaxHeaders.5405/bind.hpp0000644000000000000000000000007412717644140017367 xustar0030 atime=1463765180.093720222 30 ctime=1463765201.041552917 madp-0.4/src/boost/boost/bind/bind.hpp0000664000372100037210000016013512717644140020224 0ustar00fransfrans00000000000000#ifndef BOOST_BIND_BIND_HPP_INCLUDED #define BOOST_BIND_BIND_HPP_INCLUDED // MS compatible compilers support #pragma once #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once #endif // // bind.hpp - binds function objects to arguments // // Copyright (c) 2001-2004 Peter Dimov and Multi Media Ltd. // Copyright (c) 2001 David Abrahams // Copyright (c) 2005 Peter Dimov // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/bind/bind.html for documentation. // #include #include #include #include #include #include #include #include // Borland-specific bug, visit_each() silently fails to produce code #if defined(__BORLANDC__) # define BOOST_BIND_VISIT_EACH boost::visit_each #else # define BOOST_BIND_VISIT_EACH visit_each #endif #include #ifdef BOOST_MSVC # pragma warning(push) # pragma warning(disable: 4512) // assignment operator could not be generated #endif namespace boost { template class weak_ptr; namespace _bi // implementation details { // result_traits template struct result_traits { typedef R type; }; #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) && !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) struct unspecified {}; template struct result_traits { typedef typename F::result_type type; }; template struct result_traits< unspecified, reference_wrapper > { typedef typename F::result_type type; }; #endif // ref_compare template bool ref_compare( T const & a, T const & b, long ) { return a == b; } template bool ref_compare( arg const &, arg const &, int ) { return true; } template bool ref_compare( arg (*) (), arg (*) (), int ) { return true; } template bool ref_compare( reference_wrapper const & a, reference_wrapper const & b, int ) { return a.get_pointer() == b.get_pointer(); } // bind_t forward declaration for listN template class bind_t; template bool ref_compare( bind_t const & a, bind_t const & b, int ) { return a.compare( b ); } // value template class value { public: value(T const & t): t_(t) {} T & get() { return t_; } T const & get() const { return t_; } bool operator==(value const & rhs) const { return t_ == rhs.t_; } private: T t_; }; // ref_compare for weak_ptr template bool ref_compare( value< weak_ptr > const & a, value< weak_ptr > const & b, int ) { return !(a.get() < b.get()) && !(b.get() < a.get()); } // type template class type {}; // unwrap template struct unwrapper { static inline F & unwrap( F & f, long ) { return f; } template static inline F2 & unwrap( reference_wrapper rf, int ) { return rf.get(); } template static inline _mfi::dm unwrap( R T::* pm, int ) { return _mfi::dm( pm ); } }; // listN class list0 { public: list0() {} template T & operator[] (_bi::value & v) const { return v.get(); } template T const & operator[] (_bi::value const & v) const { return v.get(); } template T & operator[] (reference_wrapper const & v) const { return v.get(); } template typename result_traits::type operator[] (bind_t & b) const { return b.eval(*this); } template typename result_traits::type operator[] (bind_t const & b) const { return b.eval(*this); } template R operator()(type, F & f, A &, long) { return unwrapper::unwrap(f, 0)(); } template R operator()(type, F const & f, A &, long) const { return unwrapper::unwrap(f, 0)(); } template void operator()(type, F & f, A &, int) { unwrapper::unwrap(f, 0)(); } template void operator()(type, F const & f, A &, int) const { unwrapper::unwrap(f, 0)(); } template void accept(V &) const { } bool operator==(list0 const &) const { return true; } }; #ifdef BOOST_MSVC // MSVC is bright enough to realise that the parameter rhs // in operator==may be unused for some template argument types: #pragma warning(push) #pragma warning(disable:4100) #endif template< class A1 > class list1: private storage1< A1 > { private: typedef storage1< A1 > base_type; public: explicit list1( A1 a1 ): base_type( a1 ) {} A1 operator[] (boost::arg<1>) const { return base_type::a1_; } A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; } template T & operator[] ( _bi::value & v ) const { return v.get(); } template T const & operator[] ( _bi::value const & v ) const { return v.get(); } template T & operator[] (reference_wrapper const & v) const { return v.get(); } template typename result_traits::type operator[] (bind_t & b) const { return b.eval(*this); } template typename result_traits::type operator[] (bind_t const & b) const { return b.eval(*this); } template R operator()(type, F & f, A & a, long) { return unwrapper::unwrap(f, 0)(a[base_type::a1_]); } template R operator()(type, F const & f, A & a, long) const { return unwrapper::unwrap(f, 0)(a[base_type::a1_]); } template void operator()(type, F & f, A & a, int) { unwrapper::unwrap(f, 0)(a[base_type::a1_]); } template void operator()(type, F const & f, A & a, int) const { unwrapper::unwrap(f, 0)(a[base_type::a1_]); } template void accept(V & v) const { base_type::accept(v); } bool operator==(list1 const & rhs) const { return ref_compare(base_type::a1_, rhs.a1_, 0); } }; struct logical_and; struct logical_or; template< class A1, class A2 > class list2: private storage2< A1, A2 > { private: typedef storage2< A1, A2 > base_type; public: list2( A1 a1, A2 a2 ): base_type( a1, a2 ) {} A1 operator[] (boost::arg<1>) const { return base_type::a1_; } A2 operator[] (boost::arg<2>) const { return base_type::a2_; } A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; } A2 operator[] (boost::arg<2> (*) ()) const { return base_type::a2_; } template T & operator[] (_bi::value & v) const { return v.get(); } template T const & operator[] (_bi::value const & v) const { return v.get(); } template T & operator[] (reference_wrapper const & v) const { return v.get(); } template typename result_traits::type operator[] (bind_t & b) const { return b.eval(*this); } template typename result_traits::type operator[] (bind_t const & b) const { return b.eval(*this); } template R operator()(type, F & f, A & a, long) { return unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_]); } template R operator()(type, F const & f, A & a, long) const { return unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_]); } template void operator()(type, F & f, A & a, int) { unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_]); } template void operator()(type, F const & f, A & a, int) const { unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_]); } template bool operator()( type, logical_and & /*f*/, A & a, int ) { return a[ base_type::a1_ ] && a[ base_type::a2_ ]; } template bool operator()( type, logical_and const & /*f*/, A & a, int ) const { return a[ base_type::a1_ ] && a[ base_type::a2_ ]; } template bool operator()( type, logical_or & /*f*/, A & a, int ) { return a[ base_type::a1_ ] || a[ base_type::a2_ ]; } template bool operator()( type, logical_or const & /*f*/, A & a, int ) const { return a[ base_type::a1_ ] || a[ base_type::a2_ ]; } template void accept(V & v) const { base_type::accept(v); } bool operator==(list2 const & rhs) const { return ref_compare(base_type::a1_, rhs.a1_, 0) && ref_compare(base_type::a2_, rhs.a2_, 0); } }; template< class A1, class A2, class A3 > class list3: private storage3< A1, A2, A3 > { private: typedef storage3< A1, A2, A3 > base_type; public: list3( A1 a1, A2 a2, A3 a3 ): base_type( a1, a2, a3 ) {} A1 operator[] (boost::arg<1>) const { return base_type::a1_; } A2 operator[] (boost::arg<2>) const { return base_type::a2_; } A3 operator[] (boost::arg<3>) const { return base_type::a3_; } A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; } A2 operator[] (boost::arg<2> (*) ()) const { return base_type::a2_; } A3 operator[] (boost::arg<3> (*) ()) const { return base_type::a3_; } template T & operator[] (_bi::value & v) const { return v.get(); } template T const & operator[] (_bi::value const & v) const { return v.get(); } template T & operator[] (reference_wrapper const & v) const { return v.get(); } template typename result_traits::type operator[] (bind_t & b) const { return b.eval(*this); } template typename result_traits::type operator[] (bind_t const & b) const { return b.eval(*this); } template R operator()(type, F & f, A & a, long) { return unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_]); } template R operator()(type, F const & f, A & a, long) const { return unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_]); } template void operator()(type, F & f, A & a, int) { unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_]); } template void operator()(type, F const & f, A & a, int) const { unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_]); } template void accept(V & v) const { base_type::accept(v); } bool operator==(list3 const & rhs) const { return ref_compare( base_type::a1_, rhs.a1_, 0 ) && ref_compare( base_type::a2_, rhs.a2_, 0 ) && ref_compare( base_type::a3_, rhs.a3_, 0 ); } }; template< class A1, class A2, class A3, class A4 > class list4: private storage4< A1, A2, A3, A4 > { private: typedef storage4< A1, A2, A3, A4 > base_type; public: list4( A1 a1, A2 a2, A3 a3, A4 a4 ): base_type( a1, a2, a3, a4 ) {} A1 operator[] (boost::arg<1>) const { return base_type::a1_; } A2 operator[] (boost::arg<2>) const { return base_type::a2_; } A3 operator[] (boost::arg<3>) const { return base_type::a3_; } A4 operator[] (boost::arg<4>) const { return base_type::a4_; } A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; } A2 operator[] (boost::arg<2> (*) ()) const { return base_type::a2_; } A3 operator[] (boost::arg<3> (*) ()) const { return base_type::a3_; } A4 operator[] (boost::arg<4> (*) ()) const { return base_type::a4_; } template T & operator[] (_bi::value & v) const { return v.get(); } template T const & operator[] (_bi::value const & v) const { return v.get(); } template T & operator[] (reference_wrapper const & v) const { return v.get(); } template typename result_traits::type operator[] (bind_t & b) const { return b.eval(*this); } template typename result_traits::type operator[] (bind_t const & b) const { return b.eval(*this); } template R operator()(type, F & f, A & a, long) { return unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_]); } template R operator()(type, F const & f, A & a, long) const { return unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_]); } template void operator()(type, F & f, A & a, int) { unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_]); } template void operator()(type, F const & f, A & a, int) const { unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_]); } template void accept(V & v) const { base_type::accept(v); } bool operator==(list4 const & rhs) const { return ref_compare( base_type::a1_, rhs.a1_, 0 ) && ref_compare( base_type::a2_, rhs.a2_, 0 ) && ref_compare( base_type::a3_, rhs.a3_, 0 ) && ref_compare( base_type::a4_, rhs.a4_, 0 ); } }; template< class A1, class A2, class A3, class A4, class A5 > class list5: private storage5< A1, A2, A3, A4, A5 > { private: typedef storage5< A1, A2, A3, A4, A5 > base_type; public: list5( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5 ): base_type( a1, a2, a3, a4, a5 ) {} A1 operator[] (boost::arg<1>) const { return base_type::a1_; } A2 operator[] (boost::arg<2>) const { return base_type::a2_; } A3 operator[] (boost::arg<3>) const { return base_type::a3_; } A4 operator[] (boost::arg<4>) const { return base_type::a4_; } A5 operator[] (boost::arg<5>) const { return base_type::a5_; } A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; } A2 operator[] (boost::arg<2> (*) ()) const { return base_type::a2_; } A3 operator[] (boost::arg<3> (*) ()) const { return base_type::a3_; } A4 operator[] (boost::arg<4> (*) ()) const { return base_type::a4_; } A5 operator[] (boost::arg<5> (*) ()) const { return base_type::a5_; } template T & operator[] (_bi::value & v) const { return v.get(); } template T const & operator[] (_bi::value const & v) const { return v.get(); } template T & operator[] (reference_wrapper const & v) const { return v.get(); } template typename result_traits::type operator[] (bind_t & b) const { return b.eval(*this); } template typename result_traits::type operator[] (bind_t const & b) const { return b.eval(*this); } template R operator()(type, F & f, A & a, long) { return unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_]); } template R operator()(type, F const & f, A & a, long) const { return unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_]); } template void operator()(type, F & f, A & a, int) { unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_]); } template void operator()(type, F const & f, A & a, int) const { unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_]); } template void accept(V & v) const { base_type::accept(v); } bool operator==(list5 const & rhs) const { return ref_compare( base_type::a1_, rhs.a1_, 0 ) && ref_compare( base_type::a2_, rhs.a2_, 0 ) && ref_compare( base_type::a3_, rhs.a3_, 0 ) && ref_compare( base_type::a4_, rhs.a4_, 0 ) && ref_compare( base_type::a5_, rhs.a5_, 0 ); } }; template class list6: private storage6< A1, A2, A3, A4, A5, A6 > { private: typedef storage6< A1, A2, A3, A4, A5, A6 > base_type; public: list6( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6 ): base_type( a1, a2, a3, a4, a5, a6 ) {} A1 operator[] (boost::arg<1>) const { return base_type::a1_; } A2 operator[] (boost::arg<2>) const { return base_type::a2_; } A3 operator[] (boost::arg<3>) const { return base_type::a3_; } A4 operator[] (boost::arg<4>) const { return base_type::a4_; } A5 operator[] (boost::arg<5>) const { return base_type::a5_; } A6 operator[] (boost::arg<6>) const { return base_type::a6_; } A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; } A2 operator[] (boost::arg<2> (*) ()) const { return base_type::a2_; } A3 operator[] (boost::arg<3> (*) ()) const { return base_type::a3_; } A4 operator[] (boost::arg<4> (*) ()) const { return base_type::a4_; } A5 operator[] (boost::arg<5> (*) ()) const { return base_type::a5_; } A6 operator[] (boost::arg<6> (*) ()) const { return base_type::a6_; } template T & operator[] (_bi::value & v) const { return v.get(); } template T const & operator[] (_bi::value const & v) const { return v.get(); } template T & operator[] (reference_wrapper const & v) const { return v.get(); } template typename result_traits::type operator[] (bind_t & b) const { return b.eval(*this); } template typename result_traits::type operator[] (bind_t const & b) const { return b.eval(*this); } template R operator()(type, F & f, A & a, long) { return unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_]); } template R operator()(type, F const & f, A & a, long) const { return unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_]); } template void operator()(type, F & f, A & a, int) { unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_]); } template void operator()(type, F const & f, A & a, int) const { unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_]); } template void accept(V & v) const { base_type::accept(v); } bool operator==(list6 const & rhs) const { return ref_compare( base_type::a1_, rhs.a1_, 0 ) && ref_compare( base_type::a2_, rhs.a2_, 0 ) && ref_compare( base_type::a3_, rhs.a3_, 0 ) && ref_compare( base_type::a4_, rhs.a4_, 0 ) && ref_compare( base_type::a5_, rhs.a5_, 0 ) && ref_compare( base_type::a6_, rhs.a6_, 0 ); } }; template class list7: private storage7< A1, A2, A3, A4, A5, A6, A7 > { private: typedef storage7< A1, A2, A3, A4, A5, A6, A7 > base_type; public: list7( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7 ): base_type( a1, a2, a3, a4, a5, a6, a7 ) {} A1 operator[] (boost::arg<1>) const { return base_type::a1_; } A2 operator[] (boost::arg<2>) const { return base_type::a2_; } A3 operator[] (boost::arg<3>) const { return base_type::a3_; } A4 operator[] (boost::arg<4>) const { return base_type::a4_; } A5 operator[] (boost::arg<5>) const { return base_type::a5_; } A6 operator[] (boost::arg<6>) const { return base_type::a6_; } A7 operator[] (boost::arg<7>) const { return base_type::a7_; } A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; } A2 operator[] (boost::arg<2> (*) ()) const { return base_type::a2_; } A3 operator[] (boost::arg<3> (*) ()) const { return base_type::a3_; } A4 operator[] (boost::arg<4> (*) ()) const { return base_type::a4_; } A5 operator[] (boost::arg<5> (*) ()) const { return base_type::a5_; } A6 operator[] (boost::arg<6> (*) ()) const { return base_type::a6_; } A7 operator[] (boost::arg<7> (*) ()) const { return base_type::a7_; } template T & operator[] (_bi::value & v) const { return v.get(); } template T const & operator[] (_bi::value const & v) const { return v.get(); } template T & operator[] (reference_wrapper const & v) const { return v.get(); } template typename result_traits::type operator[] (bind_t & b) const { return b.eval(*this); } template typename result_traits::type operator[] (bind_t const & b) const { return b.eval(*this); } template R operator()(type, F & f, A & a, long) { return unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_]); } template R operator()(type, F const & f, A & a, long) const { return unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_]); } template void operator()(type, F & f, A & a, int) { unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_]); } template void operator()(type, F const & f, A & a, int) const { unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_]); } template void accept(V & v) const { base_type::accept(v); } bool operator==(list7 const & rhs) const { return ref_compare( base_type::a1_, rhs.a1_, 0 ) && ref_compare( base_type::a2_, rhs.a2_, 0 ) && ref_compare( base_type::a3_, rhs.a3_, 0 ) && ref_compare( base_type::a4_, rhs.a4_, 0 ) && ref_compare( base_type::a5_, rhs.a5_, 0 ) && ref_compare( base_type::a6_, rhs.a6_, 0 ) && ref_compare( base_type::a7_, rhs.a7_, 0 ); } }; template< class A1, class A2, class A3, class A4, class A5, class A6, class A7, class A8 > class list8: private storage8< A1, A2, A3, A4, A5, A6, A7, A8 > { private: typedef storage8< A1, A2, A3, A4, A5, A6, A7, A8 > base_type; public: list8( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8 ): base_type( a1, a2, a3, a4, a5, a6, a7, a8 ) {} A1 operator[] (boost::arg<1>) const { return base_type::a1_; } A2 operator[] (boost::arg<2>) const { return base_type::a2_; } A3 operator[] (boost::arg<3>) const { return base_type::a3_; } A4 operator[] (boost::arg<4>) const { return base_type::a4_; } A5 operator[] (boost::arg<5>) const { return base_type::a5_; } A6 operator[] (boost::arg<6>) const { return base_type::a6_; } A7 operator[] (boost::arg<7>) const { return base_type::a7_; } A8 operator[] (boost::arg<8>) const { return base_type::a8_; } A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; } A2 operator[] (boost::arg<2> (*) ()) const { return base_type::a2_; } A3 operator[] (boost::arg<3> (*) ()) const { return base_type::a3_; } A4 operator[] (boost::arg<4> (*) ()) const { return base_type::a4_; } A5 operator[] (boost::arg<5> (*) ()) const { return base_type::a5_; } A6 operator[] (boost::arg<6> (*) ()) const { return base_type::a6_; } A7 operator[] (boost::arg<7> (*) ()) const { return base_type::a7_; } A8 operator[] (boost::arg<8> (*) ()) const { return base_type::a8_; } template T & operator[] (_bi::value & v) const { return v.get(); } template T const & operator[] (_bi::value const & v) const { return v.get(); } template T & operator[] (reference_wrapper const & v) const { return v.get(); } template typename result_traits::type operator[] (bind_t & b) const { return b.eval(*this); } template typename result_traits::type operator[] (bind_t const & b) const { return b.eval(*this); } template R operator()(type, F & f, A & a, long) { return unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_], a[base_type::a8_]); } template R operator()(type, F const & f, A & a, long) const { return unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_], a[base_type::a8_]); } template void operator()(type, F & f, A & a, int) { unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_], a[base_type::a8_]); } template void operator()(type, F const & f, A & a, int) const { unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_], a[base_type::a8_]); } template void accept(V & v) const { base_type::accept(v); } bool operator==(list8 const & rhs) const { return ref_compare( base_type::a1_, rhs.a1_, 0 ) && ref_compare( base_type::a2_, rhs.a2_, 0 ) && ref_compare( base_type::a3_, rhs.a3_, 0 ) && ref_compare( base_type::a4_, rhs.a4_, 0 ) && ref_compare( base_type::a5_, rhs.a5_, 0 ) && ref_compare( base_type::a6_, rhs.a6_, 0 ) && ref_compare( base_type::a7_, rhs.a7_, 0 ) && ref_compare( base_type::a8_, rhs.a8_, 0 ); } }; template class list9: private storage9< A1, A2, A3, A4, A5, A6, A7, A8, A9 > { private: typedef storage9< A1, A2, A3, A4, A5, A6, A7, A8, A9 > base_type; public: list9( A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9 ): base_type( a1, a2, a3, a4, a5, a6, a7, a8, a9 ) {} A1 operator[] (boost::arg<1>) const { return base_type::a1_; } A2 operator[] (boost::arg<2>) const { return base_type::a2_; } A3 operator[] (boost::arg<3>) const { return base_type::a3_; } A4 operator[] (boost::arg<4>) const { return base_type::a4_; } A5 operator[] (boost::arg<5>) const { return base_type::a5_; } A6 operator[] (boost::arg<6>) const { return base_type::a6_; } A7 operator[] (boost::arg<7>) const { return base_type::a7_; } A8 operator[] (boost::arg<8>) const { return base_type::a8_; } A9 operator[] (boost::arg<9>) const { return base_type::a9_; } A1 operator[] (boost::arg<1> (*) ()) const { return base_type::a1_; } A2 operator[] (boost::arg<2> (*) ()) const { return base_type::a2_; } A3 operator[] (boost::arg<3> (*) ()) const { return base_type::a3_; } A4 operator[] (boost::arg<4> (*) ()) const { return base_type::a4_; } A5 operator[] (boost::arg<5> (*) ()) const { return base_type::a5_; } A6 operator[] (boost::arg<6> (*) ()) const { return base_type::a6_; } A7 operator[] (boost::arg<7> (*) ()) const { return base_type::a7_; } A8 operator[] (boost::arg<8> (*) ()) const { return base_type::a8_; } A9 operator[] (boost::arg<9> (*) ()) const { return base_type::a9_; } template T & operator[] (_bi::value & v) const { return v.get(); } template T const & operator[] (_bi::value const & v) const { return v.get(); } template T & operator[] (reference_wrapper const & v) const { return v.get(); } template typename result_traits::type operator[] (bind_t & b) const { return b.eval(*this); } template typename result_traits::type operator[] (bind_t const & b) const { return b.eval(*this); } template R operator()(type, F & f, A & a, long) { return unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_], a[base_type::a8_], a[base_type::a9_]); } template R operator()(type, F const & f, A & a, long) const { return unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_], a[base_type::a8_], a[base_type::a9_]); } template void operator()(type, F & f, A & a, int) { unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_], a[base_type::a8_], a[base_type::a9_]); } template void operator()(type, F const & f, A & a, int) const { unwrapper::unwrap(f, 0)(a[base_type::a1_], a[base_type::a2_], a[base_type::a3_], a[base_type::a4_], a[base_type::a5_], a[base_type::a6_], a[base_type::a7_], a[base_type::a8_], a[base_type::a9_]); } template void accept(V & v) const { base_type::accept(v); } bool operator==(list9 const & rhs) const { return ref_compare( base_type::a1_, rhs.a1_, 0 ) && ref_compare( base_type::a2_, rhs.a2_, 0 ) && ref_compare( base_type::a3_, rhs.a3_, 0 ) && ref_compare( base_type::a4_, rhs.a4_, 0 ) && ref_compare( base_type::a5_, rhs.a5_, 0 ) && ref_compare( base_type::a6_, rhs.a6_, 0 ) && ref_compare( base_type::a7_, rhs.a7_, 0 ) && ref_compare( base_type::a8_, rhs.a8_, 0 ) && ref_compare( base_type::a9_, rhs.a9_, 0 ); } }; #ifdef BOOST_MSVC #pragma warning(pop) #endif // bind_t #ifndef BOOST_NO_VOID_RETURNS template class bind_t { public: typedef bind_t this_type; bind_t(F f, L const & l): f_(f), l_(l) {} #define BOOST_BIND_RETURN return #include #undef BOOST_BIND_RETURN }; #else template struct bind_t_generator { template class implementation { public: typedef implementation this_type; implementation(F f, L const & l): f_(f), l_(l) {} #define BOOST_BIND_RETURN return #include #undef BOOST_BIND_RETURN }; }; template<> struct bind_t_generator { template class implementation { private: typedef void R; public: typedef implementation this_type; implementation(F f, L const & l): f_(f), l_(l) {} #define BOOST_BIND_RETURN #include #undef BOOST_BIND_RETURN }; }; template class bind_t: public bind_t_generator::BOOST_NESTED_TEMPLATE implementation { public: bind_t(F f, L const & l): bind_t_generator::BOOST_NESTED_TEMPLATE implementation(f, l) {} }; #endif // function_equal #ifndef BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP // put overloads in _bi, rely on ADL # ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING template bool function_equal( bind_t const & a, bind_t const & b ) { return a.compare(b); } # else template bool function_equal_impl( bind_t const & a, bind_t const & b, int ) { return a.compare(b); } # endif // #ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING #else // BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP // put overloads in boost } // namespace _bi # ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING template bool function_equal( _bi::bind_t const & a, _bi::bind_t const & b ) { return a.compare(b); } # else template bool function_equal_impl( _bi::bind_t const & a, _bi::bind_t const & b, int ) { return a.compare(b); } # endif // #ifndef BOOST_NO_FUNCTION_TEMPLATE_ORDERING namespace _bi { #endif // BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP // add_value #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) || (__SUNPRO_CC >= 0x530) #if defined( __BORLANDC__ ) && BOOST_WORKAROUND( __BORLANDC__, BOOST_TESTED_AT(0x582) ) template struct add_value { typedef _bi::value type; }; #else template< class T, int I > struct add_value_2 { typedef boost::arg type; }; template< class T > struct add_value_2< T, 0 > { typedef _bi::value< T > type; }; template struct add_value { typedef typename add_value_2< T, boost::is_placeholder< T >::value >::type type; }; #endif template struct add_value< value > { typedef _bi::value type; }; template struct add_value< reference_wrapper > { typedef reference_wrapper type; }; template struct add_value< arg > { typedef boost::arg type; }; template struct add_value< arg (*) () > { typedef boost::arg (*type) (); }; template struct add_value< bind_t > { typedef bind_t type; }; #else template struct _avt_0; template<> struct _avt_0<1> { template struct inner { typedef T type; }; }; template<> struct _avt_0<2> { template struct inner { typedef value type; }; }; typedef char (&_avt_r1) [1]; typedef char (&_avt_r2) [2]; template _avt_r1 _avt_f(value); template _avt_r1 _avt_f(reference_wrapper); template _avt_r1 _avt_f(arg); template _avt_r1 _avt_f(arg (*) ()); template _avt_r1 _avt_f(bind_t); _avt_r2 _avt_f(...); template struct add_value { static T t(); typedef typename _avt_0::template inner::type type; }; #endif // list_av_N template struct list_av_1 { typedef typename add_value::type B1; typedef list1 type; }; template struct list_av_2 { typedef typename add_value::type B1; typedef typename add_value::type B2; typedef list2 type; }; template struct list_av_3 { typedef typename add_value::type B1; typedef typename add_value::type B2; typedef typename add_value::type B3; typedef list3 type; }; template struct list_av_4 { typedef typename add_value::type B1; typedef typename add_value::type B2; typedef typename add_value::type B3; typedef typename add_value::type B4; typedef list4 type; }; template struct list_av_5 { typedef typename add_value::type B1; typedef typename add_value::type B2; typedef typename add_value::type B3; typedef typename add_value::type B4; typedef typename add_value::type B5; typedef list5 type; }; template struct list_av_6 { typedef typename add_value::type B1; typedef typename add_value::type B2; typedef typename add_value::type B3; typedef typename add_value::type B4; typedef typename add_value::type B5; typedef typename add_value::type B6; typedef list6 type; }; template struct list_av_7 { typedef typename add_value::type B1; typedef typename add_value::type B2; typedef typename add_value::type B3; typedef typename add_value::type B4; typedef typename add_value::type B5; typedef typename add_value::type B6; typedef typename add_value::type B7; typedef list7 type; }; template struct list_av_8 { typedef typename add_value::type B1; typedef typename add_value::type B2; typedef typename add_value::type B3; typedef typename add_value::type B4; typedef typename add_value::type B5; typedef typename add_value::type B6; typedef typename add_value::type B7; typedef typename add_value::type B8; typedef list8 type; }; template struct list_av_9 { typedef typename add_value::type B1; typedef typename add_value::type B2; typedef typename add_value::type B3; typedef typename add_value::type B4; typedef typename add_value::type B5; typedef typename add_value::type B6; typedef typename add_value::type B7; typedef typename add_value::type B8; typedef typename add_value::type B9; typedef list9 type; }; // operator! struct logical_not { template bool operator()(V const & v) const { return !v; } }; template bind_t< bool, logical_not, list1< bind_t > > operator! (bind_t const & f) { typedef list1< bind_t > list_type; return bind_t ( logical_not(), list_type(f) ); } // relational operators #define BOOST_BIND_OPERATOR( op, name ) \ \ struct name \ { \ template bool operator()(V const & v, W const & w) const { return v op w; } \ }; \ \ template \ bind_t< bool, name, list2< bind_t, typename add_value::type > > \ operator op (bind_t const & f, A2 a2) \ { \ typedef typename add_value::type B2; \ typedef list2< bind_t, B2> list_type; \ return bind_t ( name(), list_type(f, a2) ); \ } BOOST_BIND_OPERATOR( ==, equal ) BOOST_BIND_OPERATOR( !=, not_equal ) BOOST_BIND_OPERATOR( <, less ) BOOST_BIND_OPERATOR( <=, less_equal ) BOOST_BIND_OPERATOR( >, greater ) BOOST_BIND_OPERATOR( >=, greater_equal ) BOOST_BIND_OPERATOR( &&, logical_and ) BOOST_BIND_OPERATOR( ||, logical_or ) #undef BOOST_BIND_OPERATOR #if defined(__GNUC__) && BOOST_WORKAROUND(__GNUC__, < 3) // resolve ambiguity with rel_ops #define BOOST_BIND_OPERATOR( op, name ) \ \ template \ bind_t< bool, name, list2< bind_t, bind_t > > \ operator op (bind_t const & f, bind_t const & g) \ { \ typedef list2< bind_t, bind_t > list_type; \ return bind_t ( name(), list_type(f, g) ); \ } BOOST_BIND_OPERATOR( !=, not_equal ) BOOST_BIND_OPERATOR( <=, less_equal ) BOOST_BIND_OPERATOR( >, greater ) BOOST_BIND_OPERATOR( >=, greater_equal ) #endif // visit_each, ADL #if !defined( BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP ) && !defined( __BORLANDC__ ) \ && !(defined(__GNUC__) && __GNUC__ == 3 && __GNUC_MINOR__ <= 3) template void visit_each( V & v, value const & t, int ) { using boost::visit_each; BOOST_BIND_VISIT_EACH( v, t.get(), 0 ); } template void visit_each( V & v, bind_t const & t, int ) { t.accept( v ); } #endif } // namespace _bi // visit_each, no ADL #if defined( BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP ) || defined( __BORLANDC__ ) \ || (defined(__GNUC__) && __GNUC__ == 3 && __GNUC_MINOR__ <= 3) template void visit_each( V & v, _bi::value const & t, int ) { BOOST_BIND_VISIT_EACH( v, t.get(), 0 ); } template void visit_each( V & v, _bi::bind_t const & t, int ) { t.accept( v ); } #endif // is_bind_expression template< class T > struct is_bind_expression { enum _vt { value = 0 }; }; #if !defined( BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION ) template< class R, class F, class L > struct is_bind_expression< _bi::bind_t< R, F, L > > { enum _vt { value = 1 }; }; #endif // bind #ifndef BOOST_BIND #define BOOST_BIND bind #endif // generic function objects template _bi::bind_t BOOST_BIND(F f) { typedef _bi::list0 list_type; return _bi::bind_t (f, list_type()); } template _bi::bind_t::type> BOOST_BIND(F f, A1 a1) { typedef typename _bi::list_av_1::type list_type; return _bi::bind_t (f, list_type(a1)); } template _bi::bind_t::type> BOOST_BIND(F f, A1 a1, A2 a2) { typedef typename _bi::list_av_2::type list_type; return _bi::bind_t (f, list_type(a1, a2)); } template _bi::bind_t::type> BOOST_BIND(F f, A1 a1, A2 a2, A3 a3) { typedef typename _bi::list_av_3::type list_type; return _bi::bind_t(f, list_type(a1, a2, a3)); } template _bi::bind_t::type> BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4) { typedef typename _bi::list_av_4::type list_type; return _bi::bind_t(f, list_type(a1, a2, a3, a4)); } template _bi::bind_t::type> BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5) { typedef typename _bi::list_av_5::type list_type; return _bi::bind_t(f, list_type(a1, a2, a3, a4, a5)); } template _bi::bind_t::type> BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6) { typedef typename _bi::list_av_6::type list_type; return _bi::bind_t(f, list_type(a1, a2, a3, a4, a5, a6)); } template _bi::bind_t::type> BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7) { typedef typename _bi::list_av_7::type list_type; return _bi::bind_t(f, list_type(a1, a2, a3, a4, a5, a6, a7)); } template _bi::bind_t::type> BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8) { typedef typename _bi::list_av_8::type list_type; return _bi::bind_t(f, list_type(a1, a2, a3, a4, a5, a6, a7, a8)); } template _bi::bind_t::type> BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9) { typedef typename _bi::list_av_9::type list_type; return _bi::bind_t(f, list_type(a1, a2, a3, a4, a5, a6, a7, a8, a9)); } // generic function objects, alternative syntax template _bi::bind_t BOOST_BIND(boost::type, F f) { typedef _bi::list0 list_type; return _bi::bind_t (f, list_type()); } template _bi::bind_t::type> BOOST_BIND(boost::type, F f, A1 a1) { typedef typename _bi::list_av_1::type list_type; return _bi::bind_t (f, list_type(a1)); } template _bi::bind_t::type> BOOST_BIND(boost::type, F f, A1 a1, A2 a2) { typedef typename _bi::list_av_2::type list_type; return _bi::bind_t (f, list_type(a1, a2)); } template _bi::bind_t::type> BOOST_BIND(boost::type, F f, A1 a1, A2 a2, A3 a3) { typedef typename _bi::list_av_3::type list_type; return _bi::bind_t(f, list_type(a1, a2, a3)); } template _bi::bind_t::type> BOOST_BIND(boost::type, F f, A1 a1, A2 a2, A3 a3, A4 a4) { typedef typename _bi::list_av_4::type list_type; return _bi::bind_t(f, list_type(a1, a2, a3, a4)); } template _bi::bind_t::type> BOOST_BIND(boost::type, F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5) { typedef typename _bi::list_av_5::type list_type; return _bi::bind_t(f, list_type(a1, a2, a3, a4, a5)); } template _bi::bind_t::type> BOOST_BIND(boost::type, F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6) { typedef typename _bi::list_av_6::type list_type; return _bi::bind_t(f, list_type(a1, a2, a3, a4, a5, a6)); } template _bi::bind_t::type> BOOST_BIND(boost::type, F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7) { typedef typename _bi::list_av_7::type list_type; return _bi::bind_t(f, list_type(a1, a2, a3, a4, a5, a6, a7)); } template _bi::bind_t::type> BOOST_BIND(boost::type, F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8) { typedef typename _bi::list_av_8::type list_type; return _bi::bind_t(f, list_type(a1, a2, a3, a4, a5, a6, a7, a8)); } template _bi::bind_t::type> BOOST_BIND(boost::type, F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9) { typedef typename _bi::list_av_9::type list_type; return _bi::bind_t(f, list_type(a1, a2, a3, a4, a5, a6, a7, a8, a9)); } #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) && !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) // adaptable function objects template _bi::bind_t<_bi::unspecified, F, _bi::list0> BOOST_BIND(F f) { typedef _bi::list0 list_type; return _bi::bind_t<_bi::unspecified, F, list_type> (f, list_type()); } template _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_1::type> BOOST_BIND(F f, A1 a1) { typedef typename _bi::list_av_1::type list_type; return _bi::bind_t<_bi::unspecified, F, list_type> (f, list_type(a1)); } template _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_2::type> BOOST_BIND(F f, A1 a1, A2 a2) { typedef typename _bi::list_av_2::type list_type; return _bi::bind_t<_bi::unspecified, F, list_type> (f, list_type(a1, a2)); } template _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_3::type> BOOST_BIND(F f, A1 a1, A2 a2, A3 a3) { typedef typename _bi::list_av_3::type list_type; return _bi::bind_t<_bi::unspecified, F, list_type>(f, list_type(a1, a2, a3)); } template _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_4::type> BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4) { typedef typename _bi::list_av_4::type list_type; return _bi::bind_t<_bi::unspecified, F, list_type>(f, list_type(a1, a2, a3, a4)); } template _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_5::type> BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5) { typedef typename _bi::list_av_5::type list_type; return _bi::bind_t<_bi::unspecified, F, list_type>(f, list_type(a1, a2, a3, a4, a5)); } template _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_6::type> BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6) { typedef typename _bi::list_av_6::type list_type; return _bi::bind_t<_bi::unspecified, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6)); } template _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_7::type> BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7) { typedef typename _bi::list_av_7::type list_type; return _bi::bind_t<_bi::unspecified, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6, a7)); } template _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_8::type> BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8) { typedef typename _bi::list_av_8::type list_type; return _bi::bind_t<_bi::unspecified, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6, a7, a8)); } template _bi::bind_t<_bi::unspecified, F, typename _bi::list_av_9::type> BOOST_BIND(F f, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9) { typedef typename _bi::list_av_9::type list_type; return _bi::bind_t<_bi::unspecified, F, list_type>(f, list_type(a1, a2, a3, a4, a5, a6, a7, a8, a9)); } #endif // !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) && !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) // function pointers #define BOOST_BIND_CC #define BOOST_BIND_ST #include #undef BOOST_BIND_CC #undef BOOST_BIND_ST #ifdef BOOST_BIND_ENABLE_STDCALL #define BOOST_BIND_CC __stdcall #define BOOST_BIND_ST #include #undef BOOST_BIND_CC #undef BOOST_BIND_ST #endif #ifdef BOOST_BIND_ENABLE_FASTCALL #define BOOST_BIND_CC __fastcall #define BOOST_BIND_ST #include #undef BOOST_BIND_CC #undef BOOST_BIND_ST #endif #ifdef BOOST_BIND_ENABLE_PASCAL #define BOOST_BIND_ST pascal #define BOOST_BIND_CC #include #undef BOOST_BIND_ST #undef BOOST_BIND_CC #endif // member function pointers #define BOOST_BIND_MF_NAME(X) X #define BOOST_BIND_MF_CC #include #include #undef BOOST_BIND_MF_NAME #undef BOOST_BIND_MF_CC #ifdef BOOST_MEM_FN_ENABLE_CDECL #define BOOST_BIND_MF_NAME(X) X##_cdecl #define BOOST_BIND_MF_CC __cdecl #include #include #undef BOOST_BIND_MF_NAME #undef BOOST_BIND_MF_CC #endif #ifdef BOOST_MEM_FN_ENABLE_STDCALL #define BOOST_BIND_MF_NAME(X) X##_stdcall #define BOOST_BIND_MF_CC __stdcall #include #include #undef BOOST_BIND_MF_NAME #undef BOOST_BIND_MF_CC #endif #ifdef BOOST_MEM_FN_ENABLE_FASTCALL #define BOOST_BIND_MF_NAME(X) X##_fastcall #define BOOST_BIND_MF_CC __fastcall #include #include #undef BOOST_BIND_MF_NAME #undef BOOST_BIND_MF_CC #endif // data member pointers #if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) || defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) \ || ( defined(__BORLANDC__) && BOOST_WORKAROUND( __BORLANDC__, BOOST_TESTED_AT( 0x620 ) ) ) template _bi::bind_t< R, _mfi::dm, typename _bi::list_av_1::type > BOOST_BIND(R T::*f, A1 a1) { typedef _mfi::dm F; typedef typename _bi::list_av_1::type list_type; return _bi::bind_t( F(f), list_type(a1) ); } #else namespace _bi { template< class Pm, int I > struct add_cref; template< class M, class T > struct add_cref< M T::*, 0 > { typedef M type; }; template< class M, class T > struct add_cref< M T::*, 1 > { #ifdef BOOST_MSVC #pragma warning(push) #pragma warning(disable:4180) #endif typedef M const & type; #ifdef BOOST_MSVC #pragma warning(pop) #endif }; template< class R, class T > struct add_cref< R (T::*) (), 1 > { typedef void type; }; #if !defined(__IBMCPP__) || __IBMCPP_FUNC_CV_TMPL_ARG_DEDUCTION template< class R, class T > struct add_cref< R (T::*) () const, 1 > { typedef void type; }; #endif // __IBMCPP__ template struct isref { enum value_type { value = 0 }; }; template struct isref< R& > { enum value_type { value = 1 }; }; template struct isref< R* > { enum value_type { value = 1 }; }; template struct dm_result { typedef typename add_cref< Pm, 1 >::type type; }; template struct dm_result< Pm, bind_t > { typedef typename bind_t::result_type result_type; typedef typename add_cref< Pm, isref< result_type >::value >::type type; }; } // namespace _bi template< class A1, class M, class T > _bi::bind_t< typename _bi::dm_result< M T::*, A1 >::type, _mfi::dm, typename _bi::list_av_1::type > BOOST_BIND( M T::*f, A1 a1 ) { typedef typename _bi::dm_result< M T::*, A1 >::type result_type; typedef _mfi::dm F; typedef typename _bi::list_av_1::type list_type; return _bi::bind_t< result_type, F, list_type >( F( f ), list_type( a1 ) ); } #endif } // namespace boost #ifndef BOOST_BIND_NO_PLACEHOLDERS # include #endif #ifdef BOOST_MSVC # pragma warning(default: 4512) // assignment operator could not be generated # pragma warning(pop) #endif #endif // #ifndef BOOST_BIND_BIND_HPP_INCLUDED madp-0.4/src/boost/boost/bind/PaxHeaders.5405/bind_mf_cc.hpp0000644000000000000000000000007312717644140020515 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.041552917 madp-0.4/src/boost/boost/bind/bind_mf_cc.hpp0000664000372100037210000002473512717644140021360 0ustar00fransfrans00000000000000// // bind/bind_mf_cc.hpp - support for different calling conventions // // Do not include this header directly. // // Copyright (c) 2001 Peter Dimov and Multi Media Ltd. // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/bind/bind.html for documentation. // // 0 template _bi::bind_t, typename _bi::list_av_1::type> BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (), A1 a1) { typedef _mfi::BOOST_BIND_MF_NAME(mf0) F; typedef typename _bi::list_av_1::type list_type; return _bi::bind_t(F(f), list_type(a1)); } template _bi::bind_t, typename _bi::list_av_1::type> BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) () const, A1 a1) { typedef _mfi::BOOST_BIND_MF_NAME(cmf0) F; typedef typename _bi::list_av_1::type list_type; return _bi::bind_t(F(f), list_type(a1)); } // 1 template _bi::bind_t, typename _bi::list_av_2::type> BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1), A1 a1, A2 a2) { typedef _mfi::BOOST_BIND_MF_NAME(mf1) F; typedef typename _bi::list_av_2::type list_type; return _bi::bind_t(F(f), list_type(a1, a2)); } template _bi::bind_t, typename _bi::list_av_2::type> BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1) const, A1 a1, A2 a2) { typedef _mfi::BOOST_BIND_MF_NAME(cmf1) F; typedef typename _bi::list_av_2::type list_type; return _bi::bind_t(F(f), list_type(a1, a2)); } // 2 template _bi::bind_t, typename _bi::list_av_3::type> BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2), A1 a1, A2 a2, A3 a3) { typedef _mfi::BOOST_BIND_MF_NAME(mf2) F; typedef typename _bi::list_av_3::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3)); } template _bi::bind_t, typename _bi::list_av_3::type> BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2) const, A1 a1, A2 a2, A3 a3) { typedef _mfi::BOOST_BIND_MF_NAME(cmf2) F; typedef typename _bi::list_av_3::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3)); } // 3 template _bi::bind_t, typename _bi::list_av_4::type> BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3), A1 a1, A2 a2, A3 a3, A4 a4) { typedef _mfi::BOOST_BIND_MF_NAME(mf3) F; typedef typename _bi::list_av_4::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3, a4)); } template _bi::bind_t, typename _bi::list_av_4::type> BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3) const, A1 a1, A2 a2, A3 a3, A4 a4) { typedef _mfi::BOOST_BIND_MF_NAME(cmf3) F; typedef typename _bi::list_av_4::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3, a4)); } // 4 template _bi::bind_t, typename _bi::list_av_5::type> BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4), A1 a1, A2 a2, A3 a3, A4 a4, A5 a5) { typedef _mfi::BOOST_BIND_MF_NAME(mf4) F; typedef typename _bi::list_av_5::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3, a4, a5)); } template _bi::bind_t, typename _bi::list_av_5::type> BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4) const, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5) { typedef _mfi::BOOST_BIND_MF_NAME(cmf4) F; typedef typename _bi::list_av_5::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3, a4, a5)); } // 5 template _bi::bind_t, typename _bi::list_av_6::type> BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5), A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6) { typedef _mfi::BOOST_BIND_MF_NAME(mf5) F; typedef typename _bi::list_av_6::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3, a4, a5, a6)); } template _bi::bind_t, typename _bi::list_av_6::type> BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5) const, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6) { typedef _mfi::BOOST_BIND_MF_NAME(cmf5) F; typedef typename _bi::list_av_6::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3, a4, a5, a6)); } // 6 template _bi::bind_t, typename _bi::list_av_7::type> BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6), A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7) { typedef _mfi::BOOST_BIND_MF_NAME(mf6) F; typedef typename _bi::list_av_7::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3, a4, a5, a6, a7)); } template _bi::bind_t, typename _bi::list_av_7::type> BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6) const, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7) { typedef _mfi::BOOST_BIND_MF_NAME(cmf6) F; typedef typename _bi::list_av_7::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3, a4, a5, a6, a7)); } // 7 template _bi::bind_t, typename _bi::list_av_8::type> BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6, B7), A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8) { typedef _mfi::BOOST_BIND_MF_NAME(mf7) F; typedef typename _bi::list_av_8::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3, a4, a5, a6, a7, a8)); } template _bi::bind_t, typename _bi::list_av_8::type> BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6, B7) const, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8) { typedef _mfi::BOOST_BIND_MF_NAME(cmf7) F; typedef typename _bi::list_av_8::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3, a4, a5, a6, a7, a8)); } // 8 template _bi::bind_t, typename _bi::list_av_9::type> BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6, B7, B8), A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9) { typedef _mfi::BOOST_BIND_MF_NAME(mf8) F; typedef typename _bi::list_av_9::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3, a4, a5, a6, a7, a8, a9)); } template _bi::bind_t, typename _bi::list_av_9::type> BOOST_BIND(R (BOOST_BIND_MF_CC T::*f) (B1, B2, B3, B4, B5, B6, B7, B8) const, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8, A9 a9) { typedef _mfi::BOOST_BIND_MF_NAME(cmf8) F; typedef typename _bi::list_av_9::type list_type; return _bi::bind_t(F(f), list_type(a1, a2, a3, a4, a5, a6, a7, a8, a9)); } madp-0.4/src/boost/boost/bind/PaxHeaders.5405/mem_fn_template.hpp0000644000000000000000000000007312717644140021606 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.041552917 madp-0.4/src/boost/boost/bind/mem_fn_template.hpp0000664000372100037210000006364112717644140022450 0ustar00fransfrans00000000000000// // bind/mem_fn_template.hpp // // Do not include this header directly // // Copyright (c) 2001 Peter Dimov and Multi Media Ltd. // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/bind/mem_fn.html for documentation. // #if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) # define BOOST_MEM_FN_ENABLE_CONST_OVERLOADS #endif // mf0 template class BOOST_MEM_FN_NAME(mf0) { public: typedef R result_type; typedef T * argument_type; private: BOOST_MEM_FN_TYPEDEF(R (BOOST_MEM_FN_CC T::*F) ()) F f_; template R call(U & u, T const *) const { BOOST_MEM_FN_RETURN (u.*f_)(); } template R call(U & u, void const *) const { BOOST_MEM_FN_RETURN (get_pointer(u)->*f_)(); } public: explicit BOOST_MEM_FN_NAME(mf0)(F f): f_(f) {} R operator()(T * p) const { BOOST_MEM_FN_RETURN (p->*f_)(); } template R operator()(U & u) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p); } #ifdef BOOST_MEM_FN_ENABLE_CONST_OVERLOADS template R operator()(U const & u) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p); } #endif R operator()(T & t) const { BOOST_MEM_FN_RETURN (t.*f_)(); } bool operator==(BOOST_MEM_FN_NAME(mf0) const & rhs) const { return f_ == rhs.f_; } bool operator!=(BOOST_MEM_FN_NAME(mf0) const & rhs) const { return f_ != rhs.f_; } }; // cmf0 template class BOOST_MEM_FN_NAME(cmf0) { public: typedef R result_type; typedef T const * argument_type; private: BOOST_MEM_FN_TYPEDEF(R (BOOST_MEM_FN_CC T::*F) () const) F f_; template R call(U & u, T const *) const { BOOST_MEM_FN_RETURN (u.*f_)(); } template R call(U & u, void const *) const { BOOST_MEM_FN_RETURN (get_pointer(u)->*f_)(); } public: explicit BOOST_MEM_FN_NAME(cmf0)(F f): f_(f) {} template R operator()(U const & u) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p); } R operator()(T const & t) const { BOOST_MEM_FN_RETURN (t.*f_)(); } bool operator==(BOOST_MEM_FN_NAME(cmf0) const & rhs) const { return f_ == rhs.f_; } bool operator!=(BOOST_MEM_FN_NAME(cmf0) const & rhs) const { return f_ != rhs.f_; } }; // mf1 template class BOOST_MEM_FN_NAME(mf1) { public: typedef R result_type; typedef T * first_argument_type; typedef A1 second_argument_type; private: BOOST_MEM_FN_TYPEDEF(R (BOOST_MEM_FN_CC T::*F) (A1)) F f_; template R call(U & u, T const *, B1 & b1) const { BOOST_MEM_FN_RETURN (u.*f_)(b1); } template R call(U & u, void const *, B1 & b1) const { BOOST_MEM_FN_RETURN (get_pointer(u)->*f_)(b1); } public: explicit BOOST_MEM_FN_NAME(mf1)(F f): f_(f) {} R operator()(T * p, A1 a1) const { BOOST_MEM_FN_RETURN (p->*f_)(a1); } template R operator()(U & u, A1 a1) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p, a1); } #ifdef BOOST_MEM_FN_ENABLE_CONST_OVERLOADS template R operator()(U const & u, A1 a1) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p, a1); } #endif R operator()(T & t, A1 a1) const { BOOST_MEM_FN_RETURN (t.*f_)(a1); } bool operator==(BOOST_MEM_FN_NAME(mf1) const & rhs) const { return f_ == rhs.f_; } bool operator!=(BOOST_MEM_FN_NAME(mf1) const & rhs) const { return f_ != rhs.f_; } }; // cmf1 template class BOOST_MEM_FN_NAME(cmf1) { public: typedef R result_type; typedef T const * first_argument_type; typedef A1 second_argument_type; private: BOOST_MEM_FN_TYPEDEF(R (BOOST_MEM_FN_CC T::*F) (A1) const) F f_; template R call(U & u, T const *, B1 & b1) const { BOOST_MEM_FN_RETURN (u.*f_)(b1); } template R call(U & u, void const *, B1 & b1) const { BOOST_MEM_FN_RETURN (get_pointer(u)->*f_)(b1); } public: explicit BOOST_MEM_FN_NAME(cmf1)(F f): f_(f) {} template R operator()(U const & u, A1 a1) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p, a1); } R operator()(T const & t, A1 a1) const { BOOST_MEM_FN_RETURN (t.*f_)(a1); } bool operator==(BOOST_MEM_FN_NAME(cmf1) const & rhs) const { return f_ == rhs.f_; } bool operator!=(BOOST_MEM_FN_NAME(cmf1) const & rhs) const { return f_ != rhs.f_; } }; // mf2 template class BOOST_MEM_FN_NAME(mf2) { public: typedef R result_type; private: BOOST_MEM_FN_TYPEDEF(R (BOOST_MEM_FN_CC T::*F) (A1, A2)) F f_; template R call(U & u, T const *, B1 & b1, B2 & b2) const { BOOST_MEM_FN_RETURN (u.*f_)(b1, b2); } template R call(U & u, void const *, B1 & b1, B2 & b2) const { BOOST_MEM_FN_RETURN (get_pointer(u)->*f_)(b1, b2); } public: explicit BOOST_MEM_FN_NAME(mf2)(F f): f_(f) {} R operator()(T * p, A1 a1, A2 a2) const { BOOST_MEM_FN_RETURN (p->*f_)(a1, a2); } template R operator()(U & u, A1 a1, A2 a2) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p, a1, a2); } #ifdef BOOST_MEM_FN_ENABLE_CONST_OVERLOADS template R operator()(U const & u, A1 a1, A2 a2) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p, a1, a2); } #endif R operator()(T & t, A1 a1, A2 a2) const { BOOST_MEM_FN_RETURN (t.*f_)(a1, a2); } bool operator==(BOOST_MEM_FN_NAME(mf2) const & rhs) const { return f_ == rhs.f_; } bool operator!=(BOOST_MEM_FN_NAME(mf2) const & rhs) const { return f_ != rhs.f_; } }; // cmf2 template class BOOST_MEM_FN_NAME(cmf2) { public: typedef R result_type; private: BOOST_MEM_FN_TYPEDEF(R (BOOST_MEM_FN_CC T::*F) (A1, A2) const) F f_; template R call(U & u, T const *, B1 & b1, B2 & b2) const { BOOST_MEM_FN_RETURN (u.*f_)(b1, b2); } template R call(U & u, void const *, B1 & b1, B2 & b2) const { BOOST_MEM_FN_RETURN (get_pointer(u)->*f_)(b1, b2); } public: explicit BOOST_MEM_FN_NAME(cmf2)(F f): f_(f) {} template R operator()(U const & u, A1 a1, A2 a2) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p, a1, a2); } R operator()(T const & t, A1 a1, A2 a2) const { BOOST_MEM_FN_RETURN (t.*f_)(a1, a2); } bool operator==(BOOST_MEM_FN_NAME(cmf2) const & rhs) const { return f_ == rhs.f_; } bool operator!=(BOOST_MEM_FN_NAME(cmf2) const & rhs) const { return f_ != rhs.f_; } }; // mf3 template class BOOST_MEM_FN_NAME(mf3) { public: typedef R result_type; private: BOOST_MEM_FN_TYPEDEF(R (BOOST_MEM_FN_CC T::*F) (A1, A2, A3)) F f_; template R call(U & u, T const *, B1 & b1, B2 & b2, B3 & b3) const { BOOST_MEM_FN_RETURN (u.*f_)(b1, b2, b3); } template R call(U & u, void const *, B1 & b1, B2 & b2, B3 & b3) const { BOOST_MEM_FN_RETURN (get_pointer(u)->*f_)(b1, b2, b3); } public: explicit BOOST_MEM_FN_NAME(mf3)(F f): f_(f) {} R operator()(T * p, A1 a1, A2 a2, A3 a3) const { BOOST_MEM_FN_RETURN (p->*f_)(a1, a2, a3); } template R operator()(U & u, A1 a1, A2 a2, A3 a3) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p, a1, a2, a3); } #ifdef BOOST_MEM_FN_ENABLE_CONST_OVERLOADS template R operator()(U const & u, A1 a1, A2 a2, A3 a3) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p, a1, a2, a3); } #endif R operator()(T & t, A1 a1, A2 a2, A3 a3) const { BOOST_MEM_FN_RETURN (t.*f_)(a1, a2, a3); } bool operator==(BOOST_MEM_FN_NAME(mf3) const & rhs) const { return f_ == rhs.f_; } bool operator!=(BOOST_MEM_FN_NAME(mf3) const & rhs) const { return f_ != rhs.f_; } }; // cmf3 template class BOOST_MEM_FN_NAME(cmf3) { public: typedef R result_type; private: BOOST_MEM_FN_TYPEDEF(R (BOOST_MEM_FN_CC T::*F) (A1, A2, A3) const) F f_; template R call(U & u, T const *, B1 & b1, B2 & b2, B3 & b3) const { BOOST_MEM_FN_RETURN (u.*f_)(b1, b2, b3); } template R call(U & u, void const *, B1 & b1, B2 & b2, B3 & b3) const { BOOST_MEM_FN_RETURN (get_pointer(u)->*f_)(b1, b2, b3); } public: explicit BOOST_MEM_FN_NAME(cmf3)(F f): f_(f) {} template R operator()(U const & u, A1 a1, A2 a2, A3 a3) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p, a1, a2, a3); } R operator()(T const & t, A1 a1, A2 a2, A3 a3) const { BOOST_MEM_FN_RETURN (t.*f_)(a1, a2, a3); } bool operator==(BOOST_MEM_FN_NAME(cmf3) const & rhs) const { return f_ == rhs.f_; } bool operator!=(BOOST_MEM_FN_NAME(cmf3) const & rhs) const { return f_ != rhs.f_; } }; // mf4 template class BOOST_MEM_FN_NAME(mf4) { public: typedef R result_type; private: BOOST_MEM_FN_TYPEDEF(R (BOOST_MEM_FN_CC T::*F) (A1, A2, A3, A4)) F f_; template R call(U & u, T const *, B1 & b1, B2 & b2, B3 & b3, B4 & b4) const { BOOST_MEM_FN_RETURN (u.*f_)(b1, b2, b3, b4); } template R call(U & u, void const *, B1 & b1, B2 & b2, B3 & b3, B4 & b4) const { BOOST_MEM_FN_RETURN (get_pointer(u)->*f_)(b1, b2, b3, b4); } public: explicit BOOST_MEM_FN_NAME(mf4)(F f): f_(f) {} R operator()(T * p, A1 a1, A2 a2, A3 a3, A4 a4) const { BOOST_MEM_FN_RETURN (p->*f_)(a1, a2, a3, a4); } template R operator()(U & u, A1 a1, A2 a2, A3 a3, A4 a4) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p, a1, a2, a3, a4); } #ifdef BOOST_MEM_FN_ENABLE_CONST_OVERLOADS template R operator()(U const & u, A1 a1, A2 a2, A3 a3, A4 a4) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p, a1, a2, a3, a4); } #endif R operator()(T & t, A1 a1, A2 a2, A3 a3, A4 a4) const { BOOST_MEM_FN_RETURN (t.*f_)(a1, a2, a3, a4); } bool operator==(BOOST_MEM_FN_NAME(mf4) const & rhs) const { return f_ == rhs.f_; } bool operator!=(BOOST_MEM_FN_NAME(mf4) const & rhs) const { return f_ != rhs.f_; } }; // cmf4 template class BOOST_MEM_FN_NAME(cmf4) { public: typedef R result_type; private: BOOST_MEM_FN_TYPEDEF(R (BOOST_MEM_FN_CC T::*F) (A1, A2, A3, A4) const) F f_; template R call(U & u, T const *, B1 & b1, B2 & b2, B3 & b3, B4 & b4) const { BOOST_MEM_FN_RETURN (u.*f_)(b1, b2, b3, b4); } template R call(U & u, void const *, B1 & b1, B2 & b2, B3 & b3, B4 & b4) const { BOOST_MEM_FN_RETURN (get_pointer(u)->*f_)(b1, b2, b3, b4); } public: explicit BOOST_MEM_FN_NAME(cmf4)(F f): f_(f) {} template R operator()(U const & u, A1 a1, A2 a2, A3 a3, A4 a4) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p, a1, a2, a3, a4); } R operator()(T const & t, A1 a1, A2 a2, A3 a3, A4 a4) const { BOOST_MEM_FN_RETURN (t.*f_)(a1, a2, a3, a4); } bool operator==(BOOST_MEM_FN_NAME(cmf4) const & rhs) const { return f_ == rhs.f_; } bool operator!=(BOOST_MEM_FN_NAME(cmf4) const & rhs) const { return f_ != rhs.f_; } }; // mf5 template class BOOST_MEM_FN_NAME(mf5) { public: typedef R result_type; private: BOOST_MEM_FN_TYPEDEF(R (BOOST_MEM_FN_CC T::*F) (A1, A2, A3, A4, A5)) F f_; template R call(U & u, T const *, B1 & b1, B2 & b2, B3 & b3, B4 & b4, B5 & b5) const { BOOST_MEM_FN_RETURN (u.*f_)(b1, b2, b3, b4, b5); } template R call(U & u, void const *, B1 & b1, B2 & b2, B3 & b3, B4 & b4, B5 & b5) const { BOOST_MEM_FN_RETURN (get_pointer(u)->*f_)(b1, b2, b3, b4, b5); } public: explicit BOOST_MEM_FN_NAME(mf5)(F f): f_(f) {} R operator()(T * p, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5) const { BOOST_MEM_FN_RETURN (p->*f_)(a1, a2, a3, a4, a5); } template R operator()(U & u, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p, a1, a2, a3, a4, a5); } #ifdef BOOST_MEM_FN_ENABLE_CONST_OVERLOADS template R operator()(U const & u, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p, a1, a2, a3, a4, a5); } #endif R operator()(T & t, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5) const { BOOST_MEM_FN_RETURN (t.*f_)(a1, a2, a3, a4, a5); } bool operator==(BOOST_MEM_FN_NAME(mf5) const & rhs) const { return f_ == rhs.f_; } bool operator!=(BOOST_MEM_FN_NAME(mf5) const & rhs) const { return f_ != rhs.f_; } }; // cmf5 template class BOOST_MEM_FN_NAME(cmf5) { public: typedef R result_type; private: BOOST_MEM_FN_TYPEDEF(R (BOOST_MEM_FN_CC T::*F) (A1, A2, A3, A4, A5) const) F f_; template R call(U & u, T const *, B1 & b1, B2 & b2, B3 & b3, B4 & b4, B5 & b5) const { BOOST_MEM_FN_RETURN (u.*f_)(b1, b2, b3, b4, b5); } template R call(U & u, void const *, B1 & b1, B2 & b2, B3 & b3, B4 & b4, B5 & b5) const { BOOST_MEM_FN_RETURN (get_pointer(u)->*f_)(b1, b2, b3, b4, b5); } public: explicit BOOST_MEM_FN_NAME(cmf5)(F f): f_(f) {} template R operator()(U const & u, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p, a1, a2, a3, a4, a5); } R operator()(T const & t, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5) const { BOOST_MEM_FN_RETURN (t.*f_)(a1, a2, a3, a4, a5); } bool operator==(BOOST_MEM_FN_NAME(cmf5) const & rhs) const { return f_ == rhs.f_; } bool operator!=(BOOST_MEM_FN_NAME(cmf5) const & rhs) const { return f_ != rhs.f_; } }; // mf6 template class BOOST_MEM_FN_NAME(mf6) { public: typedef R result_type; private: BOOST_MEM_FN_TYPEDEF(R (BOOST_MEM_FN_CC T::*F) (A1, A2, A3, A4, A5, A6)) F f_; template R call(U & u, T const *, B1 & b1, B2 & b2, B3 & b3, B4 & b4, B5 & b5, B6 & b6) const { BOOST_MEM_FN_RETURN (u.*f_)(b1, b2, b3, b4, b5, b6); } template R call(U & u, void const *, B1 & b1, B2 & b2, B3 & b3, B4 & b4, B5 & b5, B6 & b6) const { BOOST_MEM_FN_RETURN (get_pointer(u)->*f_)(b1, b2, b3, b4, b5, b6); } public: explicit BOOST_MEM_FN_NAME(mf6)(F f): f_(f) {} R operator()(T * p, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6) const { BOOST_MEM_FN_RETURN (p->*f_)(a1, a2, a3, a4, a5, a6); } template R operator()(U & u, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p, a1, a2, a3, a4, a5, a6); } #ifdef BOOST_MEM_FN_ENABLE_CONST_OVERLOADS template R operator()(U const & u, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p, a1, a2, a3, a4, a5, a6); } #endif R operator()(T & t, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6) const { BOOST_MEM_FN_RETURN (t.*f_)(a1, a2, a3, a4, a5, a6); } bool operator==(BOOST_MEM_FN_NAME(mf6) const & rhs) const { return f_ == rhs.f_; } bool operator!=(BOOST_MEM_FN_NAME(mf6) const & rhs) const { return f_ != rhs.f_; } }; // cmf6 template class BOOST_MEM_FN_NAME(cmf6) { public: typedef R result_type; private: BOOST_MEM_FN_TYPEDEF(R (BOOST_MEM_FN_CC T::*F) (A1, A2, A3, A4, A5, A6) const) F f_; template R call(U & u, T const *, B1 & b1, B2 & b2, B3 & b3, B4 & b4, B5 & b5, B6 & b6) const { BOOST_MEM_FN_RETURN (u.*f_)(b1, b2, b3, b4, b5, b6); } template R call(U & u, void const *, B1 & b1, B2 & b2, B3 & b3, B4 & b4, B5 & b5, B6 & b6) const { BOOST_MEM_FN_RETURN (get_pointer(u)->*f_)(b1, b2, b3, b4, b5, b6); } public: explicit BOOST_MEM_FN_NAME(cmf6)(F f): f_(f) {} template R operator()(U const & u, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p, a1, a2, a3, a4, a5, a6); } R operator()(T const & t, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6) const { BOOST_MEM_FN_RETURN (t.*f_)(a1, a2, a3, a4, a5, a6); } bool operator==(BOOST_MEM_FN_NAME(cmf6) const & rhs) const { return f_ == rhs.f_; } bool operator!=(BOOST_MEM_FN_NAME(cmf6) const & rhs) const { return f_ != rhs.f_; } }; // mf7 template class BOOST_MEM_FN_NAME(mf7) { public: typedef R result_type; private: BOOST_MEM_FN_TYPEDEF(R (BOOST_MEM_FN_CC T::*F) (A1, A2, A3, A4, A5, A6, A7)) F f_; template R call(U & u, T const *, B1 & b1, B2 & b2, B3 & b3, B4 & b4, B5 & b5, B6 & b6, B7 & b7) const { BOOST_MEM_FN_RETURN (u.*f_)(b1, b2, b3, b4, b5, b6, b7); } template R call(U & u, void const *, B1 & b1, B2 & b2, B3 & b3, B4 & b4, B5 & b5, B6 & b6, B7 & b7) const { BOOST_MEM_FN_RETURN (get_pointer(u)->*f_)(b1, b2, b3, b4, b5, b6, b7); } public: explicit BOOST_MEM_FN_NAME(mf7)(F f): f_(f) {} R operator()(T * p, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7) const { BOOST_MEM_FN_RETURN (p->*f_)(a1, a2, a3, a4, a5, a6, a7); } template R operator()(U & u, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p, a1, a2, a3, a4, a5, a6, a7); } #ifdef BOOST_MEM_FN_ENABLE_CONST_OVERLOADS template R operator()(U const & u, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p, a1, a2, a3, a4, a5, a6, a7); } #endif R operator()(T & t, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7) const { BOOST_MEM_FN_RETURN (t.*f_)(a1, a2, a3, a4, a5, a6, a7); } bool operator==(BOOST_MEM_FN_NAME(mf7) const & rhs) const { return f_ == rhs.f_; } bool operator!=(BOOST_MEM_FN_NAME(mf7) const & rhs) const { return f_ != rhs.f_; } }; // cmf7 template class BOOST_MEM_FN_NAME(cmf7) { public: typedef R result_type; private: BOOST_MEM_FN_TYPEDEF(R (BOOST_MEM_FN_CC T::*F) (A1, A2, A3, A4, A5, A6, A7) const) F f_; template R call(U & u, T const *, B1 & b1, B2 & b2, B3 & b3, B4 & b4, B5 & b5, B6 & b6, B7 & b7) const { BOOST_MEM_FN_RETURN (u.*f_)(b1, b2, b3, b4, b5, b6, b7); } template R call(U & u, void const *, B1 & b1, B2 & b2, B3 & b3, B4 & b4, B5 & b5, B6 & b6, B7 & b7) const { BOOST_MEM_FN_RETURN (get_pointer(u)->*f_)(b1, b2, b3, b4, b5, b6, b7); } public: explicit BOOST_MEM_FN_NAME(cmf7)(F f): f_(f) {} template R operator()(U const & u, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p, a1, a2, a3, a4, a5, a6, a7); } R operator()(T const & t, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7) const { BOOST_MEM_FN_RETURN (t.*f_)(a1, a2, a3, a4, a5, a6, a7); } bool operator==(BOOST_MEM_FN_NAME(cmf7) const & rhs) const { return f_ == rhs.f_; } bool operator!=(BOOST_MEM_FN_NAME(cmf7) const & rhs) const { return f_ != rhs.f_; } }; // mf8 template class BOOST_MEM_FN_NAME(mf8) { public: typedef R result_type; private: BOOST_MEM_FN_TYPEDEF(R (BOOST_MEM_FN_CC T::*F) (A1, A2, A3, A4, A5, A6, A7, A8)) F f_; template R call(U & u, T const *, B1 & b1, B2 & b2, B3 & b3, B4 & b4, B5 & b5, B6 & b6, B7 & b7, B8 & b8) const { BOOST_MEM_FN_RETURN (u.*f_)(b1, b2, b3, b4, b5, b6, b7, b8); } template R call(U & u, void const *, B1 & b1, B2 & b2, B3 & b3, B4 & b4, B5 & b5, B6 & b6, B7 & b7, B8 & b8) const { BOOST_MEM_FN_RETURN (get_pointer(u)->*f_)(b1, b2, b3, b4, b5, b6, b7, b8); } public: explicit BOOST_MEM_FN_NAME(mf8)(F f): f_(f) {} R operator()(T * p, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8) const { BOOST_MEM_FN_RETURN (p->*f_)(a1, a2, a3, a4, a5, a6, a7, a8); } template R operator()(U & u, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p, a1, a2, a3, a4, a5, a6, a7, a8); } #ifdef BOOST_MEM_FN_ENABLE_CONST_OVERLOADS template R operator()(U const & u, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p, a1, a2, a3, a4, a5, a6, a7, a8); } #endif R operator()(T & t, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8) const { BOOST_MEM_FN_RETURN (t.*f_)(a1, a2, a3, a4, a5, a6, a7, a8); } bool operator==(BOOST_MEM_FN_NAME(mf8) const & rhs) const { return f_ == rhs.f_; } bool operator!=(BOOST_MEM_FN_NAME(mf8) const & rhs) const { return f_ != rhs.f_; } }; // cmf8 template class BOOST_MEM_FN_NAME(cmf8) { public: typedef R result_type; private: BOOST_MEM_FN_TYPEDEF(R (BOOST_MEM_FN_CC T::*F) (A1, A2, A3, A4, A5, A6, A7, A8) const) F f_; template R call(U & u, T const *, B1 & b1, B2 & b2, B3 & b3, B4 & b4, B5 & b5, B6 & b6, B7 & b7, B8 & b8) const { BOOST_MEM_FN_RETURN (u.*f_)(b1, b2, b3, b4, b5, b6, b7, b8); } template R call(U & u, void const *, B1 & b1, B2 & b2, B3 & b3, B4 & b4, B5 & b5, B6 & b6, B7 & b7, B8 & b8) const { BOOST_MEM_FN_RETURN (get_pointer(u)->*f_)(b1, b2, b3, b4, b5, b6, b7, b8); } public: explicit BOOST_MEM_FN_NAME(cmf8)(F f): f_(f) {} R operator()(T const * p, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8) const { BOOST_MEM_FN_RETURN (p->*f_)(a1, a2, a3, a4, a5, a6, a7, a8); } template R operator()(U const & u, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8) const { U const * p = 0; BOOST_MEM_FN_RETURN call(u, p, a1, a2, a3, a4, a5, a6, a7, a8); } R operator()(T const & t, A1 a1, A2 a2, A3 a3, A4 a4, A5 a5, A6 a6, A7 a7, A8 a8) const { BOOST_MEM_FN_RETURN (t.*f_)(a1, a2, a3, a4, a5, a6, a7, a8); } bool operator==(BOOST_MEM_FN_NAME(cmf8) const & rhs) const { return f_ == rhs.f_; } bool operator!=(BOOST_MEM_FN_NAME(cmf8) const & rhs) const { return f_ != rhs.f_; } }; #undef BOOST_MEM_FN_ENABLE_CONST_OVERLOADS madp-0.4/src/boost/boost/bind/PaxHeaders.5405/bind_template.hpp0000644000000000000000000000007312717644140021261 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.041552917 madp-0.4/src/boost/boost/bind/bind_template.hpp0000664000372100037210000003336712717644140022125 0ustar00fransfrans00000000000000// // bind/bind_template.hpp // // Do not include this header directly. // // Copyright (c) 2001-2004 Peter Dimov and Multi Media Ltd. // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/bind/bind.html for documentation. // typedef typename result_traits::type result_type; result_type operator()() { list0 a; BOOST_BIND_RETURN l_(type(), f_, a, 0); } result_type operator()() const { list0 a; BOOST_BIND_RETURN l_(type(), f_, a, 0); } template result_type operator()(A1 & a1) { list1 a(a1); BOOST_BIND_RETURN l_(type(), f_, a, 0); } template result_type operator()(A1 & a1) const { list1 a(a1); BOOST_BIND_RETURN l_(type(), f_, a, 0); } #if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) \ && !BOOST_WORKAROUND(__EDG_VERSION__, <= 238) template result_type operator()(A1 const & a1) { list1 a(a1); BOOST_BIND_RETURN l_(type(), f_, a, 0); } template result_type operator()(A1 const & a1) const { list1 a(a1); BOOST_BIND_RETURN l_(type(), f_, a, 0); } #endif template result_type operator()(A1 & a1, A2 & a2) { list2 a(a1, a2); BOOST_BIND_RETURN l_(type(), f_, a, 0); } template result_type operator()(A1 & a1, A2 & a2) const { list2 a(a1, a2); BOOST_BIND_RETURN l_(type(), f_, a, 0); } #if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) \ && !BOOST_WORKAROUND(__EDG_VERSION__, <= 238) template result_type operator()(A1 const & a1, A2 & a2) { list2 a(a1, a2); BOOST_BIND_RETURN l_(type(), f_, a, 0); } template result_type operator()(A1 const & a1, A2 & a2) const { list2 a(a1, a2); BOOST_BIND_RETURN l_(type(), f_, a, 0); } template result_type operator()(A1 & a1, A2 const & a2) { list2 a(a1, a2); BOOST_BIND_RETURN l_(type(), f_, a, 0); } template result_type operator()(A1 & a1, A2 const & a2) const { list2 a(a1, a2); BOOST_BIND_RETURN l_(type(), f_, a, 0); } template result_type operator()(A1 const & a1, A2 const & a2) { list2 a(a1, a2); BOOST_BIND_RETURN l_(type(), f_, a, 0); } template result_type operator()(A1 const & a1, A2 const & a2) const { list2 a(a1, a2); BOOST_BIND_RETURN l_(type(), f_, a, 0); } #endif template result_type operator()(A1 & a1, A2 & a2, A3 & a3) { list3 a(a1, a2, a3); BOOST_BIND_RETURN l_(type(), f_, a, 0); } template result_type operator()(A1 & a1, A2 & a2, A3 & a3) const { list3 a(a1, a2, a3); BOOST_BIND_RETURN l_(type(), f_, a, 0); } #if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) \ && !BOOST_WORKAROUND(__EDG_VERSION__, <= 238) template result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3) { list3 a(a1, a2, a3); BOOST_BIND_RETURN l_(type(), f_, a, 0); } template result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3) const { list3 a(a1, a2, a3); BOOST_BIND_RETURN l_(type(), f_, a, 0); } #endif template result_type operator()(A1 & a1, A2 & a2, A3 & a3, A4 & a4) { list4 a(a1, a2, a3, a4); BOOST_BIND_RETURN l_(type(), f_, a, 0); } template result_type operator()(A1 & a1, A2 & a2, A3 & a3, A4 & a4) const { list4 a(a1, a2, a3, a4); BOOST_BIND_RETURN l_(type(), f_, a, 0); } #if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) \ && !BOOST_WORKAROUND(__EDG_VERSION__, <= 238) template result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3, A4 const & a4) { list4 a(a1, a2, a3, a4); BOOST_BIND_RETURN l_(type(), f_, a, 0); } template result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3, A4 const & a4) const { list4 a(a1, a2, a3, a4); BOOST_BIND_RETURN l_(type(), f_, a, 0); } #endif template result_type operator()(A1 & a1, A2 & a2, A3 & a3, A4 & a4, A5 & a5) { list5 a(a1, a2, a3, a4, a5); BOOST_BIND_RETURN l_(type(), f_, a, 0); } template result_type operator()(A1 & a1, A2 & a2, A3 & a3, A4 & a4, A5 & a5) const { list5 a(a1, a2, a3, a4, a5); BOOST_BIND_RETURN l_(type(), f_, a, 0); } #if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) \ && !BOOST_WORKAROUND(__EDG_VERSION__, <= 238) template result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3, A4 const & a4, A5 const & a5) { list5 a(a1, a2, a3, a4, a5); BOOST_BIND_RETURN l_(type(), f_, a, 0); } template result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3, A4 const & a4, A5 const & a5) const { list5 a(a1, a2, a3, a4, a5); BOOST_BIND_RETURN l_(type(), f_, a, 0); } #endif template result_type operator()(A1 & a1, A2 & a2, A3 & a3, A4 & a4, A5 & a5, A6 & a6) { list6 a(a1, a2, a3, a4, a5, a6); BOOST_BIND_RETURN l_(type(), f_, a, 0); } template result_type operator()(A1 & a1, A2 & a2, A3 & a3, A4 & a4, A5 & a5, A6 & a6) const { list6 a(a1, a2, a3, a4, a5, a6); BOOST_BIND_RETURN l_(type(), f_, a, 0); } #if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) \ && !BOOST_WORKAROUND(__EDG_VERSION__, <= 238) template result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3, A4 const & a4, A5 const & a5, A6 const & a6) { list6 a(a1, a2, a3, a4, a5, a6); BOOST_BIND_RETURN l_(type(), f_, a, 0); } template result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3, A4 const & a4, A5 const & a5, A6 const & a6) const { list6 a(a1, a2, a3, a4, a5, a6); BOOST_BIND_RETURN l_(type(), f_, a, 0); } #endif template result_type operator()(A1 & a1, A2 & a2, A3 & a3, A4 & a4, A5 & a5, A6 & a6, A7 & a7) { list7 a(a1, a2, a3, a4, a5, a6, a7); BOOST_BIND_RETURN l_(type(), f_, a, 0); } template result_type operator()(A1 & a1, A2 & a2, A3 & a3, A4 & a4, A5 & a5, A6 & a6, A7 & a7) const { list7 a(a1, a2, a3, a4, a5, a6, a7); BOOST_BIND_RETURN l_(type(), f_, a, 0); } #if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) \ && !BOOST_WORKAROUND(__EDG_VERSION__, <= 238) template result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3, A4 const & a4, A5 const & a5, A6 const & a6, A7 const & a7) { list7 a(a1, a2, a3, a4, a5, a6, a7); BOOST_BIND_RETURN l_(type(), f_, a, 0); } template result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3, A4 const & a4, A5 const & a5, A6 const & a6, A7 const & a7) const { list7 a(a1, a2, a3, a4, a5, a6, a7); BOOST_BIND_RETURN l_(type(), f_, a, 0); } #endif template result_type operator()(A1 & a1, A2 & a2, A3 & a3, A4 & a4, A5 & a5, A6 & a6, A7 & a7, A8 & a8) { list8 a(a1, a2, a3, a4, a5, a6, a7, a8); BOOST_BIND_RETURN l_(type(), f_, a, 0); } template result_type operator()(A1 & a1, A2 & a2, A3 & a3, A4 & a4, A5 & a5, A6 & a6, A7 & a7, A8 & a8) const { list8 a(a1, a2, a3, a4, a5, a6, a7, a8); BOOST_BIND_RETURN l_(type(), f_, a, 0); } #if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) \ && !BOOST_WORKAROUND(__EDG_VERSION__, <= 238) template result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3, A4 const & a4, A5 const & a5, A6 const & a6, A7 const & a7, A8 const & a8) { list8 a(a1, a2, a3, a4, a5, a6, a7, a8); BOOST_BIND_RETURN l_(type(), f_, a, 0); } template result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3, A4 const & a4, A5 const & a5, A6 const & a6, A7 const & a7, A8 const & a8) const { list8 a(a1, a2, a3, a4, a5, a6, a7, a8); BOOST_BIND_RETURN l_(type(), f_, a, 0); } #endif template result_type operator()(A1 & a1, A2 & a2, A3 & a3, A4 & a4, A5 & a5, A6 & a6, A7 & a7, A8 & a8, A9 & a9) { list9 a(a1, a2, a3, a4, a5, a6, a7, a8, a9); BOOST_BIND_RETURN l_(type(), f_, a, 0); } template result_type operator()(A1 & a1, A2 & a2, A3 & a3, A4 & a4, A5 & a5, A6 & a6, A7 & a7, A8 & a8, A9 & a9) const { list9 a(a1, a2, a3, a4, a5, a6, a7, a8, a9); BOOST_BIND_RETURN l_(type(), f_, a, 0); } #if !defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) \ && !BOOST_WORKAROUND(__EDG_VERSION__, <= 238) template result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3, A4 const & a4, A5 const & a5, A6 const & a6, A7 const & a7, A8 const & a8, A9 const & a9) { list9 a(a1, a2, a3, a4, a5, a6, a7, a8, a9); BOOST_BIND_RETURN l_(type(), f_, a, 0); } template result_type operator()(A1 const & a1, A2 const & a2, A3 const & a3, A4 const & a4, A5 const & a5, A6 const & a6, A7 const & a7, A8 const & a8, A9 const & a9) const { list9 a(a1, a2, a3, a4, a5, a6, a7, a8, a9); BOOST_BIND_RETURN l_(type(), f_, a, 0); } #endif template result_type eval(A & a) { BOOST_BIND_RETURN l_(type(), f_, a, 0); } template result_type eval(A & a) const { BOOST_BIND_RETURN l_(type(), f_, a, 0); } template void accept(V & v) const { #if !defined( BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP ) && !defined( __BORLANDC__ ) using boost::visit_each; #endif BOOST_BIND_VISIT_EACH(v, f_, 0); l_.accept(v); } bool compare(this_type const & rhs) const { return ref_compare(f_, rhs.f_, 0) && l_ == rhs.l_; } private: F f_; L l_; madp-0.4/src/boost/boost/PaxHeaders.5405/detail0000644000000000000000000000007412717644140016213 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.049552852 madp-0.4/src/boost/boost/detail/0000775000372100037210000000000012717644140017117 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/detail/PaxHeaders.5405/sp_typeinfo.hpp0000644000000000000000000000007312717644140021337 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/detail/sp_typeinfo.hpp0000664000372100037210000000456712717644140022203 0ustar00fransfrans00000000000000#ifndef BOOST_DETAIL_SP_TYPEINFO_HPP_INCLUDED #define BOOST_DETAIL_SP_TYPEINFO_HPP_INCLUDED // MS compatible compilers support #pragma once #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once #endif // detail/sp_typeinfo.hpp // // Copyright 2007 Peter Dimov // // Distributed under the Boost Software License, Version 1.0. // See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #include #if defined( BOOST_NO_TYPEID ) #include #include namespace boost { namespace detail { class sp_typeinfo { private: sp_typeinfo( sp_typeinfo const& ); sp_typeinfo& operator=( sp_typeinfo const& ); char const * name_; public: explicit sp_typeinfo( char const * name ): name_( name ) { } bool operator==( sp_typeinfo const& rhs ) const { return this == &rhs; } bool operator!=( sp_typeinfo const& rhs ) const { return this != &rhs; } bool before( sp_typeinfo const& rhs ) const { return std::less< sp_typeinfo const* >()( this, &rhs ); } char const* name() const { return name_; } }; template struct sp_typeid_ { static sp_typeinfo ti_; static char const * name() { return BOOST_CURRENT_FUNCTION; } }; #if defined(__SUNPRO_CC) // see #4199, the Sun Studio compiler gets confused about static initialization // constructor arguments. But an assignment works just fine. template sp_typeinfo sp_typeid_< T >::ti_ = sp_typeid_< T >::name(); #else template sp_typeinfo sp_typeid_< T >::ti_(sp_typeid_< T >::name()); #endif template struct sp_typeid_< T & >: sp_typeid_< T > { }; template struct sp_typeid_< T const >: sp_typeid_< T > { }; template struct sp_typeid_< T volatile >: sp_typeid_< T > { }; template struct sp_typeid_< T const volatile >: sp_typeid_< T > { }; } // namespace detail } // namespace boost #define BOOST_SP_TYPEID(T) (boost::detail::sp_typeid_::ti_) #else #include namespace boost { namespace detail { #if defined( BOOST_NO_STD_TYPEINFO ) typedef ::type_info sp_typeinfo; #else typedef std::type_info sp_typeinfo; #endif } // namespace detail } // namespace boost #define BOOST_SP_TYPEID(T) typeid(T) #endif #endif // #ifndef BOOST_DETAIL_SP_TYPEINFO_HPP_INCLUDED madp-0.4/src/boost/boost/detail/PaxHeaders.5405/reference_content.hpp0000644000000000000000000000007312717644140022470 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/detail/reference_content.hpp0000664000372100037210000000571612717644140023331 0ustar00fransfrans00000000000000//----------------------------------------------------------------------------- // boost detail/reference_content.hpp header file // See http://www.boost.org for updates, documentation, and revision history. //----------------------------------------------------------------------------- // // Copyright (c) 2003 // Eric Friedman // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_DETAIL_REFERENCE_CONTENT_HPP #define BOOST_DETAIL_REFERENCE_CONTENT_HPP #include "boost/config.hpp" #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) # include "boost/mpl/bool.hpp" # include "boost/type_traits/has_nothrow_copy.hpp" #else # include "boost/mpl/if.hpp" # include "boost/type_traits/is_reference.hpp" #endif #include "boost/mpl/void.hpp" namespace boost { namespace detail { /////////////////////////////////////////////////////////////////////////////// // (detail) class template reference_content // // Non-Assignable wrapper for references. // template class reference_content { private: // representation RefT content_; public: // structors ~reference_content() { } reference_content(RefT r) : content_( r ) { } reference_content(const reference_content& operand) : content_( operand.content_ ) { } private: // non-Assignable reference_content& operator=(const reference_content&); public: // queries RefT get() const { return content_; } }; /////////////////////////////////////////////////////////////////////////////// // (detail) metafunction make_reference_content // // Wraps with reference_content if specified type is reference. // template struct make_reference_content; #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template struct make_reference_content { typedef T type; }; template struct make_reference_content< T& > { typedef reference_content type; }; #else // defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template struct make_reference_content : mpl::if_< is_reference , reference_content , T > { }; #endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION workaround template <> struct make_reference_content< mpl::void_ > { template struct apply : make_reference_content { }; typedef mpl::void_ type; }; } // namespace detail /////////////////////////////////////////////////////////////////////////////// // reference_content type traits specializations // #if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template struct has_nothrow_copy< ::boost::detail::reference_content< T& > > : mpl::true_ { }; #endif // !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) } // namespace boost #endif // BOOST_DETAIL_REFERENCE_CONTENT_HPP madp-0.4/src/boost/boost/detail/PaxHeaders.5405/call_traits.hpp0000644000000000000000000000007312717644140021301 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/detail/call_traits.hpp0000664000372100037210000001034212717644140022131 0ustar00fransfrans00000000000000// (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/utility for most recent version including documentation. // call_traits: defines typedefs for function usage // (see libs/utility/call_traits.htm) /* Release notes: 23rd July 2000: Fixed array specialization. (JM) Added Borland specific fixes for reference types (issue raised by Steve Cleary). */ #ifndef BOOST_DETAIL_CALL_TRAITS_HPP #define BOOST_DETAIL_CALL_TRAITS_HPP #ifndef BOOST_CONFIG_HPP #include #endif #include #include #include #include #include namespace boost{ namespace detail{ template struct ct_imp2 { typedef const T& param_type; }; template struct ct_imp2 { typedef const T param_type; }; template struct ct_imp { typedef const T& param_type; }; template struct ct_imp { typedef typename ct_imp2::param_type param_type; }; template struct ct_imp { typedef typename ct_imp2::param_type param_type; }; template struct ct_imp { typedef const T param_type; }; } template struct call_traits { public: typedef T value_type; typedef T& reference; typedef const T& const_reference; // // C++ Builder workaround: we should be able to define a compile time // constant and pass that as a single template parameter to ct_imp, // however compiler bugs prevent this - instead pass three bool's to // ct_imp and add an extra partial specialisation // of ct_imp to handle the logic. (JM) typedef typename boost::detail::ct_imp< T, ::boost::is_pointer::value, ::boost::is_arithmetic::value, ::boost::is_enum::value >::param_type param_type; }; template struct call_traits { typedef T& value_type; typedef T& reference; typedef const T& const_reference; typedef T& param_type; // hh removed const }; #if BOOST_WORKAROUND( __BORLANDC__, < 0x5A0 ) // these are illegal specialisations; cv-qualifies applied to // references have no effect according to [8.3.2p1], // C++ Builder requires them though as it treats cv-qualified // references as distinct types... template struct call_traits { typedef T& value_type; typedef T& reference; typedef const T& const_reference; typedef T& param_type; // hh removed const }; template struct call_traits { typedef T& value_type; typedef T& reference; typedef const T& const_reference; typedef T& param_type; // hh removed const }; template struct call_traits { typedef T& value_type; typedef T& reference; typedef const T& const_reference; typedef T& param_type; // hh removed const }; template struct call_traits< T * > { typedef T * value_type; typedef T * & reference; typedef T * const & const_reference; typedef T * const param_type; // hh removed const }; #endif #if !defined(BOOST_NO_ARRAY_TYPE_SPECIALIZATIONS) template struct call_traits { private: typedef T array_type[N]; public: // degrades array to pointer: typedef const T* value_type; typedef array_type& reference; typedef const array_type& const_reference; typedef const T* const param_type; }; template struct call_traits { private: typedef const T array_type[N]; public: // degrades array to pointer: typedef const T* value_type; typedef array_type& reference; typedef const array_type& const_reference; typedef const T* const param_type; }; #endif } #endif // BOOST_DETAIL_CALL_TRAITS_HPP madp-0.4/src/boost/boost/detail/PaxHeaders.5405/compressed_pair.hpp0000644000000000000000000000007312717644140022157 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/detail/compressed_pair.hpp0000664000372100037210000004025112717644140023011 0ustar00fransfrans00000000000000// (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000. // Use, modification and distribution are subject to the Boost Software License, // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt). // // See http://www.boost.org/libs/utility for most recent version including documentation. // compressed_pair: pair that "compresses" empty members // (see libs/utility/compressed_pair.htm) // // JM changes 25 Jan 2004: // For the case where T1 == T2 and both are empty, then first() and second() // should return different objects. // JM changes 25 Jan 2000: // Removed default arguments from compressed_pair_switch to get // C++ Builder 4 to accept them // rewriten swap to get gcc and C++ builder to compile. // added partial specialisations for case T1 == T2 to avoid duplicate constructor defs. #ifndef BOOST_DETAIL_COMPRESSED_PAIR_HPP #define BOOST_DETAIL_COMPRESSED_PAIR_HPP #include #include #include #include #include #ifdef BOOST_MSVC # pragma warning(push) # pragma warning(disable:4512) #endif namespace boost { template class compressed_pair; // compressed_pair namespace details { // JM altered 26 Jan 2000: template struct compressed_pair_switch; template struct compressed_pair_switch {static const int value = 0;}; template struct compressed_pair_switch {static const int value = 3;}; template struct compressed_pair_switch {static const int value = 1;}; template struct compressed_pair_switch {static const int value = 2;}; template struct compressed_pair_switch {static const int value = 4;}; template struct compressed_pair_switch {static const int value = 5;}; template class compressed_pair_imp; #ifdef __GNUC__ // workaround for GCC (JM): using std::swap; #endif // // can't call unqualified swap from within classname::swap // as Koenig lookup rules will find only the classname::swap // member function not the global declaration, so use cp_swap // as a forwarding function (JM): template inline void cp_swap(T& t1, T& t2) { #ifndef __GNUC__ using std::swap; #endif swap(t1, t2); } // 0 derive from neither template class compressed_pair_imp { public: typedef T1 first_type; typedef T2 second_type; typedef typename call_traits::param_type first_param_type; typedef typename call_traits::param_type second_param_type; typedef typename call_traits::reference first_reference; typedef typename call_traits::reference second_reference; typedef typename call_traits::const_reference first_const_reference; typedef typename call_traits::const_reference second_const_reference; compressed_pair_imp() {} compressed_pair_imp(first_param_type x, second_param_type y) : first_(x), second_(y) {} compressed_pair_imp(first_param_type x) : first_(x) {} compressed_pair_imp(second_param_type y) : second_(y) {} first_reference first() {return first_;} first_const_reference first() const {return first_;} second_reference second() {return second_;} second_const_reference second() const {return second_;} void swap(::boost::compressed_pair& y) { cp_swap(first_, y.first()); cp_swap(second_, y.second()); } private: first_type first_; second_type second_; }; // 1 derive from T1 template class compressed_pair_imp : protected ::boost::remove_cv::type { public: typedef T1 first_type; typedef T2 second_type; typedef typename call_traits::param_type first_param_type; typedef typename call_traits::param_type second_param_type; typedef typename call_traits::reference first_reference; typedef typename call_traits::reference second_reference; typedef typename call_traits::const_reference first_const_reference; typedef typename call_traits::const_reference second_const_reference; compressed_pair_imp() {} compressed_pair_imp(first_param_type x, second_param_type y) : first_type(x), second_(y) {} compressed_pair_imp(first_param_type x) : first_type(x) {} compressed_pair_imp(second_param_type y) : second_(y) {} first_reference first() {return *this;} first_const_reference first() const {return *this;} second_reference second() {return second_;} second_const_reference second() const {return second_;} void swap(::boost::compressed_pair& y) { // no need to swap empty base class: cp_swap(second_, y.second()); } private: second_type second_; }; // 2 derive from T2 template class compressed_pair_imp : protected ::boost::remove_cv::type { public: typedef T1 first_type; typedef T2 second_type; typedef typename call_traits::param_type first_param_type; typedef typename call_traits::param_type second_param_type; typedef typename call_traits::reference first_reference; typedef typename call_traits::reference second_reference; typedef typename call_traits::const_reference first_const_reference; typedef typename call_traits::const_reference second_const_reference; compressed_pair_imp() {} compressed_pair_imp(first_param_type x, second_param_type y) : second_type(y), first_(x) {} compressed_pair_imp(first_param_type x) : first_(x) {} compressed_pair_imp(second_param_type y) : second_type(y) {} first_reference first() {return first_;} first_const_reference first() const {return first_;} second_reference second() {return *this;} second_const_reference second() const {return *this;} void swap(::boost::compressed_pair& y) { // no need to swap empty base class: cp_swap(first_, y.first()); } private: first_type first_; }; // 3 derive from T1 and T2 template class compressed_pair_imp : protected ::boost::remove_cv::type, protected ::boost::remove_cv::type { public: typedef T1 first_type; typedef T2 second_type; typedef typename call_traits::param_type first_param_type; typedef typename call_traits::param_type second_param_type; typedef typename call_traits::reference first_reference; typedef typename call_traits::reference second_reference; typedef typename call_traits::const_reference first_const_reference; typedef typename call_traits::const_reference second_const_reference; compressed_pair_imp() {} compressed_pair_imp(first_param_type x, second_param_type y) : first_type(x), second_type(y) {} compressed_pair_imp(first_param_type x) : first_type(x) {} compressed_pair_imp(second_param_type y) : second_type(y) {} first_reference first() {return *this;} first_const_reference first() const {return *this;} second_reference second() {return *this;} second_const_reference second() const {return *this;} // // no need to swap empty bases: void swap(::boost::compressed_pair&) {} }; // JM // 4 T1 == T2, T1 and T2 both empty // Originally this did not store an instance of T2 at all // but that led to problems beause it meant &x.first() == &x.second() // which is not true for any other kind of pair, so now we store an instance // of T2 just in case the user is relying on first() and second() returning // different objects (albeit both empty). template class compressed_pair_imp : protected ::boost::remove_cv::type { public: typedef T1 first_type; typedef T2 second_type; typedef typename call_traits::param_type first_param_type; typedef typename call_traits::param_type second_param_type; typedef typename call_traits::reference first_reference; typedef typename call_traits::reference second_reference; typedef typename call_traits::const_reference first_const_reference; typedef typename call_traits::const_reference second_const_reference; compressed_pair_imp() {} compressed_pair_imp(first_param_type x, second_param_type y) : first_type(x), m_second(y) {} compressed_pair_imp(first_param_type x) : first_type(x), m_second(x) {} first_reference first() {return *this;} first_const_reference first() const {return *this;} second_reference second() {return m_second;} second_const_reference second() const {return m_second;} void swap(::boost::compressed_pair&) {} private: T2 m_second; }; // 5 T1 == T2 and are not empty: //JM template class compressed_pair_imp { public: typedef T1 first_type; typedef T2 second_type; typedef typename call_traits::param_type first_param_type; typedef typename call_traits::param_type second_param_type; typedef typename call_traits::reference first_reference; typedef typename call_traits::reference second_reference; typedef typename call_traits::const_reference first_const_reference; typedef typename call_traits::const_reference second_const_reference; compressed_pair_imp() {} compressed_pair_imp(first_param_type x, second_param_type y) : first_(x), second_(y) {} compressed_pair_imp(first_param_type x) : first_(x), second_(x) {} first_reference first() {return first_;} first_const_reference first() const {return first_;} second_reference second() {return second_;} second_const_reference second() const {return second_;} void swap(::boost::compressed_pair& y) { cp_swap(first_, y.first()); cp_swap(second_, y.second()); } private: first_type first_; second_type second_; }; } // details template class compressed_pair : private ::boost::details::compressed_pair_imp::type, typename remove_cv::type>::value, ::boost::is_empty::value, ::boost::is_empty::value>::value> { private: typedef details::compressed_pair_imp::type, typename remove_cv::type>::value, ::boost::is_empty::value, ::boost::is_empty::value>::value> base; public: typedef T1 first_type; typedef T2 second_type; typedef typename call_traits::param_type first_param_type; typedef typename call_traits::param_type second_param_type; typedef typename call_traits::reference first_reference; typedef typename call_traits::reference second_reference; typedef typename call_traits::const_reference first_const_reference; typedef typename call_traits::const_reference second_const_reference; compressed_pair() : base() {} compressed_pair(first_param_type x, second_param_type y) : base(x, y) {} explicit compressed_pair(first_param_type x) : base(x) {} explicit compressed_pair(second_param_type y) : base(y) {} first_reference first() {return base::first();} first_const_reference first() const {return base::first();} second_reference second() {return base::second();} second_const_reference second() const {return base::second();} void swap(compressed_pair& y) { base::swap(y); } }; // JM // Partial specialisation for case where T1 == T2: // template class compressed_pair : private details::compressed_pair_imp::type, typename remove_cv::type>::value, ::boost::is_empty::value, ::boost::is_empty::value>::value> { private: typedef details::compressed_pair_imp::type, typename remove_cv::type>::value, ::boost::is_empty::value, ::boost::is_empty::value>::value> base; public: typedef T first_type; typedef T second_type; typedef typename call_traits::param_type first_param_type; typedef typename call_traits::param_type second_param_type; typedef typename call_traits::reference first_reference; typedef typename call_traits::reference second_reference; typedef typename call_traits::const_reference first_const_reference; typedef typename call_traits::const_reference second_const_reference; compressed_pair() : base() {} compressed_pair(first_param_type x, second_param_type y) : base(x, y) {} #if !(defined(__SUNPRO_CC) && (__SUNPRO_CC <= 0x530)) explicit #endif compressed_pair(first_param_type x) : base(x) {} first_reference first() {return base::first();} first_const_reference first() const {return base::first();} second_reference second() {return base::second();} second_const_reference second() const {return base::second();} void swap(::boost::compressed_pair& y) { base::swap(y); } }; template inline void swap(compressed_pair& x, compressed_pair& y) { x.swap(y); } } // boost #ifdef BOOST_MSVC # pragma warning(pop) #endif #endif // BOOST_DETAIL_COMPRESSED_PAIR_HPP madp-0.4/src/boost/boost/detail/PaxHeaders.5405/container_fwd.hpp0000644000000000000000000000007312717644140021622 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/detail/container_fwd.hpp0000664000372100037210000001234012717644140022452 0ustar00fransfrans00000000000000 // Copyright 2005-2011 Daniel James. // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // Note: if you change this include guard, you also need to change // container_fwd_compile_fail.cpp #if !defined(BOOST_DETAIL_CONTAINER_FWD_HPP) #define BOOST_DETAIL_CONTAINER_FWD_HPP #if defined(_MSC_VER) && (_MSC_VER >= 1020) && \ !defined(BOOST_DETAIL_TEST_CONFIG_ONLY) # pragma once #endif #include #include //////////////////////////////////////////////////////////////////////////////// // // // Define BOOST_DETAIL_NO_CONTAINER_FWD if you don't want this header to // // forward declare standard containers. // // // // BOOST_DETAIL_CONTAINER_FWD to make it foward declare containers even if it // // normally doesn't. // // // // BOOST_DETAIL_NO_CONTAINER_FWD overrides BOOST_DETAIL_CONTAINER_FWD. // // // //////////////////////////////////////////////////////////////////////////////// #if !defined(BOOST_DETAIL_NO_CONTAINER_FWD) # if defined(BOOST_DETAIL_CONTAINER_FWD) // Force forward declarations. # elif defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION) // STLport # define BOOST_DETAIL_NO_CONTAINER_FWD # elif defined(__LIBCOMO__) // Comeau STL: # define BOOST_DETAIL_NO_CONTAINER_FWD # elif defined(__STD_RWCOMPILER_H__) || defined(_RWSTD_VER) // Rogue Wave library: # define BOOST_DETAIL_NO_CONTAINER_FWD # elif defined(_LIBCPP_VERSION) // libc++ # define BOOST_DETAIL_NO_CONTAINER_FWD # elif defined(__GLIBCPP__) || defined(__GLIBCXX__) // GNU libstdc++ 3 // // Disable forwarding for all recent versions, as the library has a // versioned namespace mode, and I don't know how to detect it. # if __GLIBCXX__ >= 20070513 \ || defined(_GLIBCXX_DEBUG) \ || defined(_GLIBCXX_PARALLEL) \ || defined(_GLIBCXX_PROFILE) # define BOOST_DETAIL_NO_CONTAINER_FWD # else # if defined(__GLIBCXX__) && __GLIBCXX__ >= 20040530 # define BOOST_CONTAINER_FWD_COMPLEX_STRUCT # endif # endif # elif defined(__STL_CONFIG_H) // generic SGI STL // // Forward declaration seems to be okay, but it has a couple of odd // implementations. # define BOOST_CONTAINER_FWD_BAD_BITSET # if !defined(__STL_NON_TYPE_TMPL_PARAM_BUG) # define BOOST_CONTAINER_FWD_BAD_DEQUE # endif # elif defined(__MSL_CPP__) // MSL standard lib: # define BOOST_DETAIL_NO_CONTAINER_FWD # elif defined(__IBMCPP__) // The default VACPP std lib, forward declaration seems to be fine. # elif defined(MSIPL_COMPILE_H) // Modena C++ standard library # define BOOST_DETAIL_NO_CONTAINER_FWD # elif (defined(_YVALS) && !defined(__IBMCPP__)) || defined(_CPPLIB_VER) // Dinkumware Library (this has to appear after any possible replacement // libraries) # else # define BOOST_DETAIL_NO_CONTAINER_FWD # endif #endif #if !defined(BOOST_DETAIL_TEST_CONFIG_ONLY) #if defined(BOOST_DETAIL_NO_CONTAINER_FWD) && \ !defined(BOOST_DETAIL_TEST_FORCE_CONTAINER_FWD) #include #include #include #include #include #include #include #include #else #include #if defined(BOOST_CONTAINER_FWD_BAD_DEQUE) #include #endif #if defined(BOOST_CONTAINER_FWD_BAD_BITSET) #include #endif #if defined(BOOST_MSVC) #pragma warning(push) #pragma warning(disable:4099) // struct/class mismatch in fwd declarations #endif namespace std { template class allocator; template class basic_string; #if BOOST_WORKAROUND(__GNUC__, < 3) && !defined(__SGI_STL_PORT) && !defined(_STLPORT_VERSION) template struct string_char_traits; #else template struct char_traits; #endif #if defined(BOOST_CONTAINER_FWD_COMPLEX_STRUCT) template struct complex; #else template class complex; #endif #if !defined(BOOST_CONTAINER_FWD_BAD_DEQUE) template class deque; #endif template class list; template class vector; template class map; template class multimap; template class set; template class multiset; #if !defined(BOOST_CONTAINER_FWD_BAD_BITSET) template class bitset; #endif template struct pair; } #if defined(BOOST_MSVC) #pragma warning(pop) #endif #endif // BOOST_DETAIL_NO_CONTAINER_FWD && // !defined(BOOST_DETAIL_TEST_FORCE_CONTAINER_FWD) #endif // BOOST_DETAIL_TEST_CONFIG_ONLY #endif madp-0.4/src/boost/boost/detail/PaxHeaders.5405/select_type.hpp0000644000000000000000000000007312717644140021320 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/detail/select_type.hpp0000664000372100037210000000215212717644140022150 0ustar00fransfrans00000000000000// (C) Copyright David Abrahams 2001. // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org for most recent version including documentation. // Revision History // 09 Feb 01 Applied John Maddock's Borland patch Moving // specialization to unspecialized template (David Abrahams) // 06 Feb 01 Created (David Abrahams) #ifndef SELECT_TYPE_DWA20010206_HPP # define SELECT_TYPE_DWA20010206_HPP namespace boost { namespace detail { // Template class if_true -- select among 2 types based on a bool constant expression // Usage: // typename if_true<(bool_const_expression)>::template then::type // HP aCC cannot deal with missing names for template value parameters template struct if_true { template struct then { typedef T type; }; }; template <> struct if_true { template struct then { typedef F type; }; }; }} #endif // SELECT_TYPE_DWA20010206_HPP madp-0.4/src/boost/boost/detail/PaxHeaders.5405/no_exceptions_support.hpp0000644000000000000000000000007312717644140023451 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/detail/no_exceptions_support.hpp0000664000372100037210000000371512717644140024307 0ustar00fransfrans00000000000000#ifndef BOOST_DETAIL_NO_EXCEPTIONS_SUPPORT_HPP_ #define BOOST_DETAIL_NO_EXCEPTIONS_SUPPORT_HPP_ #if (defined _MSC_VER) && (_MSC_VER >= 1200) # pragma once #endif //---------------------------------------------------------------------- // (C) Copyright 2004 Pavel Vozenilek. // Use, modification and distribution is subject to the Boost Software // License, Version 1.0. (See accompanying file LICENSE_1_0.txt // or copy at http://www.boost.org/LICENSE_1_0.txt) // // // This file contains helper macros used when exception support may be // disabled (as indicated by macro BOOST_NO_EXCEPTIONS). // // Before picking up these macros you may consider using RAII techniques // to deal with exceptions - their syntax can be always the same with // or without exception support enabled. // /* Example of use: void foo() { BOOST_TRY { ... } BOOST_CATCH(const std::bad_alloc&) { ... BOOST_RETHROW } BOOST_CATCH(const std::exception& e) { ... } BOOST_CATCH_END } With exception support enabled it will expand into: void foo() { { try { ... } catch (const std::bad_alloc&) { ... throw; } catch (const std::exception& e) { ... } } } With exception support disabled it will expand into: void foo() { { if(true) { ... } else if (false) { ... } else if (false) { ... } } } */ //---------------------------------------------------------------------- #include #include #if !(defined BOOST_NO_EXCEPTIONS) # define BOOST_TRY { try # define BOOST_CATCH(x) catch(x) # define BOOST_RETHROW throw; # define BOOST_CATCH_END } #else # if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x564)) # define BOOST_TRY { if ("") # define BOOST_CATCH(x) else if (!"") # else # define BOOST_TRY { if (true) # define BOOST_CATCH(x) else if (false) # endif # define BOOST_RETHROW # define BOOST_CATCH_END } #endif #endif madp-0.4/src/boost/boost/detail/PaxHeaders.5405/allocator_utilities.hpp0000644000000000000000000000007312717644140023053 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/detail/allocator_utilities.hpp0000664000372100037210000001214012717644140023701 0ustar00fransfrans00000000000000/* Copyright 2003-2009 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See Boost website at http://www.boost.org/ */ #ifndef BOOST_DETAIL_ALLOCATOR_UTILITIES_HPP #define BOOST_DETAIL_ALLOCATOR_UTILITIES_HPP #include /* keep it first to prevent nasty warns in MSVC */ #include #include #include #include #include #include #include namespace boost{ namespace detail{ /* Allocator adaption layer. Some stdlibs provide allocators without rebind * and template ctors. These facilities are simulated with the external * template class rebind_to and the aid of partial_std_allocator_wrapper. */ namespace allocator{ /* partial_std_allocator_wrapper inherits the functionality of a std * allocator while providing a templatized ctor and other bits missing * in some stdlib implementation or another. */ template class partial_std_allocator_wrapper:public std::allocator { public: /* Oddly enough, STLport does not define std::allocator::value_type * when configured to work without partial template specialization. * No harm in supplying the definition here unconditionally. */ typedef Type value_type; partial_std_allocator_wrapper(){}; template partial_std_allocator_wrapper(const partial_std_allocator_wrapper&){} partial_std_allocator_wrapper(const std::allocator& x): std::allocator(x) { }; #if defined(BOOST_DINKUMWARE_STDLIB) /* Dinkumware guys didn't provide a means to call allocate() without * supplying a hint, in disagreement with the standard. */ Type* allocate(std::size_t n,const void* hint=0) { std::allocator& a=*this; return a.allocate(n,hint); } #endif }; /* Detects whether a given allocator belongs to a defective stdlib not * having the required member templates. * Note that it does not suffice to check the Boost.Config stdlib * macros, as the user might have passed a custom, compliant allocator. * The checks also considers partial_std_allocator_wrapper to be * a standard defective allocator. */ #if defined(BOOST_NO_STD_ALLOCATOR)&&\ (defined(BOOST_HAS_PARTIAL_STD_ALLOCATOR)||defined(BOOST_DINKUMWARE_STDLIB)) template struct is_partial_std_allocator { BOOST_STATIC_CONSTANT(bool, value= (is_same< std::allocator, Allocator >::value)|| (is_same< partial_std_allocator_wrapper< BOOST_DEDUCED_TYPENAME Allocator::value_type>, Allocator >::value)); }; #else template struct is_partial_std_allocator { BOOST_STATIC_CONSTANT(bool,value=false); }; #endif /* rebind operations for defective std allocators */ template struct partial_std_allocator_rebind_to { typedef partial_std_allocator_wrapper type; }; /* rebind operation in all other cases */ #if BOOST_WORKAROUND(BOOST_MSVC,<1300) /* Workaround for a problem in MSVC with dependent template typedefs * when doing rebinding of allocators. * Modeled after (thanks, Aleksey!) */ template struct rebinder { template struct fake_allocator:Allocator{}; template<> struct fake_allocator { template struct rebind{}; }; template struct result: fake_allocator::value>:: template rebind { }; }; #else template struct rebinder { template struct result { typedef typename Allocator::BOOST_NESTED_TEMPLATE rebind::other other; }; }; #endif template struct compliant_allocator_rebind_to { typedef typename rebinder:: BOOST_NESTED_TEMPLATE result::other type; }; /* rebind front-end */ template struct rebind_to: mpl::eval_if_c< is_partial_std_allocator::value, partial_std_allocator_rebind_to, compliant_allocator_rebind_to > { }; /* allocator-independent versions of construct and destroy */ template void construct(void* p,const Type& t) { new (p) Type(t); } #if BOOST_WORKAROUND(BOOST_MSVC,BOOST_TESTED_AT(1500)) /* MSVC++ issues spurious warnings about unreferencend formal parameters * in destroy when Type is a class with trivial dtor. */ #pragma warning(push) #pragma warning(disable:4100) #endif template void destroy(const Type* p) { #if BOOST_WORKAROUND(__SUNPRO_CC,BOOST_TESTED_AT(0x590)) const_cast(p)->~Type(); #else p->~Type(); #endif } #if BOOST_WORKAROUND(BOOST_MSVC,BOOST_TESTED_AT(1500)) #pragma warning(pop) #endif } /* namespace boost::detail::allocator */ } /* namespace boost::detail */ } /* namespace boost */ #endif madp-0.4/src/boost/boost/detail/PaxHeaders.5405/workaround.hpp0000644000000000000000000000007312717644140021173 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/detail/workaround.hpp0000664000372100037210000001616512717644140022034 0ustar00fransfrans00000000000000// Copyright David Abrahams 2002. // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef WORKAROUND_DWA2002126_HPP # define WORKAROUND_DWA2002126_HPP // Compiler/library version workaround macro // // Usage: // // #if BOOST_WORKAROUND(BOOST_MSVC, < 1300) // // workaround for eVC4 and VC6 // ... // workaround code here // #endif // // When BOOST_STRICT_CONFIG is defined, expands to 0. Otherwise, the // first argument must be undefined or expand to a numeric // value. The above expands to: // // (BOOST_MSVC) != 0 && (BOOST_MSVC) < 1300 // // When used for workarounds that apply to the latest known version // and all earlier versions of a compiler, the following convention // should be observed: // // #if BOOST_WORKAROUND(BOOST_MSVC, BOOST_TESTED_AT(1301)) // // The version number in this case corresponds to the last version in // which the workaround was known to have been required. When // BOOST_DETECT_OUTDATED_WORKAROUNDS is not the defined, the macro // BOOST_TESTED_AT(x) expands to "!= 0", which effectively activates // the workaround for any version of the compiler. When // BOOST_DETECT_OUTDATED_WORKAROUNDS is defined, a compiler warning or // error will be issued if the compiler version exceeds the argument // to BOOST_TESTED_AT(). This can be used to locate workarounds which // may be obsoleted by newer versions. # ifndef BOOST_STRICT_CONFIG #include #ifndef __BORLANDC__ #define __BORLANDC___WORKAROUND_GUARD 1 #else #define __BORLANDC___WORKAROUND_GUARD 0 #endif #ifndef __CODEGEARC__ #define __CODEGEARC___WORKAROUND_GUARD 1 #else #define __CODEGEARC___WORKAROUND_GUARD 0 #endif #ifndef _MSC_VER #define _MSC_VER_WORKAROUND_GUARD 1 #else #define _MSC_VER_WORKAROUND_GUARD 0 #endif #ifndef _MSC_FULL_VER #define _MSC_FULL_VER_WORKAROUND_GUARD 1 #else #define _MSC_FULL_VER_WORKAROUND_GUARD 0 #endif #ifndef BOOST_MSVC #define BOOST_MSVC_WORKAROUND_GUARD 1 #else #define BOOST_MSVC_WORKAROUND_GUARD 0 #endif #ifndef BOOST_MSVC_FULL_VER #define BOOST_MSVC_FULL_VER_WORKAROUND_GUARD 1 #else #define BOOST_MSVC_FULL_VER_WORKAROUND_GUARD 0 #endif #ifndef __GNUC__ #define __GNUC___WORKAROUND_GUARD 1 #else #define __GNUC___WORKAROUND_GUARD 0 #endif #ifndef __GNUC_MINOR__ #define __GNUC_MINOR___WORKAROUND_GUARD 1 #else #define __GNUC_MINOR___WORKAROUND_GUARD 0 #endif #ifndef __GNUC_PATCHLEVEL__ #define __GNUC_PATCHLEVEL___WORKAROUND_GUARD 1 #else #define __GNUC_PATCHLEVEL___WORKAROUND_GUARD 0 #endif #ifndef __IBMCPP__ #define __IBMCPP___WORKAROUND_GUARD 1 #else #define __IBMCPP___WORKAROUND_GUARD 0 #endif #ifndef __SUNPRO_CC #define __SUNPRO_CC_WORKAROUND_GUARD 1 #else #define __SUNPRO_CC_WORKAROUND_GUARD 0 #endif #ifndef __DECCXX_VER #define __DECCXX_VER_WORKAROUND_GUARD 1 #else #define __DECCXX_VER_WORKAROUND_GUARD 0 #endif #ifndef __MWERKS__ #define __MWERKS___WORKAROUND_GUARD 1 #else #define __MWERKS___WORKAROUND_GUARD 0 #endif #ifndef __EDG__ #define __EDG___WORKAROUND_GUARD 1 #else #define __EDG___WORKAROUND_GUARD 0 #endif #ifndef __EDG_VERSION__ #define __EDG_VERSION___WORKAROUND_GUARD 1 #else #define __EDG_VERSION___WORKAROUND_GUARD 0 #endif #ifndef __HP_aCC #define __HP_aCC_WORKAROUND_GUARD 1 #else #define __HP_aCC_WORKAROUND_GUARD 0 #endif #ifndef __hpxstd98 #define __hpxstd98_WORKAROUND_GUARD 1 #else #define __hpxstd98_WORKAROUND_GUARD 0 #endif #ifndef _CRAYC #define _CRAYC_WORKAROUND_GUARD 1 #else #define _CRAYC_WORKAROUND_GUARD 0 #endif #ifndef __DMC__ #define __DMC___WORKAROUND_GUARD 1 #else #define __DMC___WORKAROUND_GUARD 0 #endif #ifndef MPW_CPLUS #define MPW_CPLUS_WORKAROUND_GUARD 1 #else #define MPW_CPLUS_WORKAROUND_GUARD 0 #endif #ifndef __COMO__ #define __COMO___WORKAROUND_GUARD 1 #else #define __COMO___WORKAROUND_GUARD 0 #endif #ifndef __COMO_VERSION__ #define __COMO_VERSION___WORKAROUND_GUARD 1 #else #define __COMO_VERSION___WORKAROUND_GUARD 0 #endif #ifndef __INTEL_COMPILER #define __INTEL_COMPILER_WORKAROUND_GUARD 1 #else #define __INTEL_COMPILER_WORKAROUND_GUARD 0 #endif #ifndef __ICL #define __ICL_WORKAROUND_GUARD 1 #else #define __ICL_WORKAROUND_GUARD 0 #endif #ifndef _COMPILER_VERSION #define _COMPILER_VERSION_WORKAROUND_GUARD 1 #else #define _COMPILER_VERSION_WORKAROUND_GUARD 0 #endif #ifndef _RWSTD_VER #define _RWSTD_VER_WORKAROUND_GUARD 1 #else #define _RWSTD_VER_WORKAROUND_GUARD 0 #endif #ifndef BOOST_RWSTD_VER #define BOOST_RWSTD_VER_WORKAROUND_GUARD 1 #else #define BOOST_RWSTD_VER_WORKAROUND_GUARD 0 #endif #ifndef __GLIBCPP__ #define __GLIBCPP___WORKAROUND_GUARD 1 #else #define __GLIBCPP___WORKAROUND_GUARD 0 #endif #ifndef _GLIBCXX_USE_C99_FP_MACROS_DYNAMIC #define _GLIBCXX_USE_C99_FP_MACROS_DYNAMIC_WORKAROUND_GUARD 1 #else #define _GLIBCXX_USE_C99_FP_MACROS_DYNAMIC_WORKAROUND_GUARD 0 #endif #ifndef __SGI_STL_PORT #define __SGI_STL_PORT_WORKAROUND_GUARD 1 #else #define __SGI_STL_PORT_WORKAROUND_GUARD 0 #endif #ifndef _STLPORT_VERSION #define _STLPORT_VERSION_WORKAROUND_GUARD 1 #else #define _STLPORT_VERSION_WORKAROUND_GUARD 0 #endif #ifndef __LIBCOMO_VERSION__ #define __LIBCOMO_VERSION___WORKAROUND_GUARD 1 #else #define __LIBCOMO_VERSION___WORKAROUND_GUARD 0 #endif #ifndef _CPPLIB_VER #define _CPPLIB_VER_WORKAROUND_GUARD 1 #else #define _CPPLIB_VER_WORKAROUND_GUARD 0 #endif #ifndef BOOST_INTEL_CXX_VERSION #define BOOST_INTEL_CXX_VERSION_WORKAROUND_GUARD 1 #else #define BOOST_INTEL_CXX_VERSION_WORKAROUND_GUARD 0 #endif #ifndef BOOST_INTEL_WIN #define BOOST_INTEL_WIN_WORKAROUND_GUARD 1 #else #define BOOST_INTEL_WIN_WORKAROUND_GUARD 0 #endif #ifndef BOOST_DINKUMWARE_STDLIB #define BOOST_DINKUMWARE_STDLIB_WORKAROUND_GUARD 1 #else #define BOOST_DINKUMWARE_STDLIB_WORKAROUND_GUARD 0 #endif #ifndef BOOST_INTEL #define BOOST_INTEL_WORKAROUND_GUARD 1 #else #define BOOST_INTEL_WORKAROUND_GUARD 0 #endif // Always define to zero, if it's used it'll be defined my MPL: #define BOOST_MPL_CFG_GCC_WORKAROUND_GUARD 0 # define BOOST_WORKAROUND(symbol, test) \ ((symbol ## _WORKAROUND_GUARD + 0 == 0) && \ (symbol != 0) && (1 % (( (symbol test) ) + 1))) // ^ ^ ^ ^ // The extra level of parenthesis nesting above, along with the // BOOST_OPEN_PAREN indirection below, is required to satisfy the // broken preprocessor in MWCW 8.3 and earlier. // // The basic mechanism works as follows: // (symbol test) + 1 => if (symbol test) then 2 else 1 // 1 % ((symbol test) + 1) => if (symbol test) then 1 else 0 // // The complication with % is for cooperation with BOOST_TESTED_AT(). // When "test" is BOOST_TESTED_AT(x) and // BOOST_DETECT_OUTDATED_WORKAROUNDS is #defined, // // symbol test => if (symbol <= x) then 1 else -1 // (symbol test) + 1 => if (symbol <= x) then 2 else 0 // 1 % ((symbol test) + 1) => if (symbol <= x) then 1 else divide-by-zero // # ifdef BOOST_DETECT_OUTDATED_WORKAROUNDS # define BOOST_OPEN_PAREN ( # define BOOST_TESTED_AT(value) > value) ?(-1): BOOST_OPEN_PAREN 1 # else # define BOOST_TESTED_AT(value) != ((value)-(value)) # endif # else # define BOOST_WORKAROUND(symbol, test) 0 # endif #endif // WORKAROUND_DWA2002126_HPP madp-0.4/src/boost/boost/detail/PaxHeaders.5405/indirect_traits.hpp0000644000000000000000000000007312717644140022167 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/detail/indirect_traits.hpp0000664000372100037210000002562412717644140023030 0ustar00fransfrans00000000000000// Copyright David Abrahams 2002. // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef INDIRECT_TRAITS_DWA2002131_HPP # define INDIRECT_TRAITS_DWA2002131_HPP # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # include # ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION # include # endif namespace boost { namespace detail { namespace indirect_traits { # ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION template struct is_reference_to_const : mpl::false_ { }; template struct is_reference_to_const : mpl::true_ { }; # if defined(BOOST_MSVC) && _MSC_FULL_VER <= 13102140 // vc7.01 alpha workaround template struct is_reference_to_const : mpl::true_ { }; # endif template struct is_reference_to_function : mpl::false_ { }; template struct is_reference_to_function : is_function { }; template struct is_pointer_to_function : mpl::false_ { }; // There's no such thing as a pointer-to-cv-function, so we don't need // specializations for those template struct is_pointer_to_function : is_function { }; template struct is_reference_to_member_function_pointer_impl : mpl::false_ { }; template struct is_reference_to_member_function_pointer_impl : is_member_function_pointer::type> { }; template struct is_reference_to_member_function_pointer : is_reference_to_member_function_pointer_impl { BOOST_MPL_AUX_LAMBDA_SUPPORT(1,is_reference_to_member_function_pointer,(T)) }; template struct is_reference_to_function_pointer_aux : mpl::and_< is_reference , is_pointer_to_function< typename remove_cv< typename remove_reference::type >::type > > { // There's no such thing as a pointer-to-cv-function, so we don't need specializations for those }; template struct is_reference_to_function_pointer : mpl::if_< is_reference_to_function , mpl::false_ , is_reference_to_function_pointer_aux >::type { }; template struct is_reference_to_non_const : mpl::and_< is_reference , mpl::not_< is_reference_to_const > > { }; template struct is_reference_to_volatile : mpl::false_ { }; template struct is_reference_to_volatile : mpl::true_ { }; # if defined(BOOST_MSVC) && _MSC_FULL_VER <= 13102140 // vc7.01 alpha workaround template struct is_reference_to_volatile : mpl::true_ { }; # endif template struct is_reference_to_pointer : mpl::false_ { }; template struct is_reference_to_pointer : mpl::true_ { }; template struct is_reference_to_pointer : mpl::true_ { }; template struct is_reference_to_pointer : mpl::true_ { }; template struct is_reference_to_pointer : mpl::true_ { }; template struct is_reference_to_class : mpl::and_< is_reference , is_class< typename remove_cv< typename remove_reference::type >::type > > { BOOST_MPL_AUX_LAMBDA_SUPPORT(1,is_reference_to_class,(T)) }; template struct is_pointer_to_class : mpl::and_< is_pointer , is_class< typename remove_cv< typename remove_pointer::type >::type > > { BOOST_MPL_AUX_LAMBDA_SUPPORT(1,is_pointer_to_class,(T)) }; # else using namespace boost::detail::is_function_ref_tester_; typedef char (&inner_yes_type)[3]; typedef char (&inner_no_type)[2]; typedef char (&outer_no_type)[1]; template struct is_const_help { typedef typename mpl::if_< is_const , inner_yes_type , inner_no_type >::type type; }; template struct is_volatile_help { typedef typename mpl::if_< is_volatile , inner_yes_type , inner_no_type >::type type; }; template struct is_pointer_help { typedef typename mpl::if_< is_pointer , inner_yes_type , inner_no_type >::type type; }; template struct is_class_help { typedef typename mpl::if_< is_class , inner_yes_type , inner_no_type >::type type; }; template struct is_reference_to_function_aux { static T t; BOOST_STATIC_CONSTANT( bool, value = sizeof(detail::is_function_ref_tester(t,0)) == sizeof(::boost::type_traits::yes_type)); typedef mpl::bool_ type; }; template struct is_reference_to_function : mpl::if_, is_reference_to_function_aux, mpl::bool_ >::type { }; template struct is_pointer_to_function_aux { static T t; BOOST_STATIC_CONSTANT( bool, value = sizeof(::boost::type_traits::is_function_ptr_tester(t)) == sizeof(::boost::type_traits::yes_type)); typedef mpl::bool_ type; }; template struct is_pointer_to_function : mpl::if_, is_pointer_to_function_aux, mpl::bool_ >::type { BOOST_MPL_AUX_LAMBDA_SUPPORT(1,is_pointer_to_function,(T)) }; struct false_helper1 { template struct apply : mpl::false_ { }; }; template typename is_const_help::type reference_to_const_helper(V&); outer_no_type reference_to_const_helper(...); struct true_helper1 { template struct apply { static T t; BOOST_STATIC_CONSTANT( bool, value = sizeof(reference_to_const_helper(t)) == sizeof(inner_yes_type)); typedef mpl::bool_ type; }; }; template struct is_reference_to_const_helper1 : true_helper1 { }; template <> struct is_reference_to_const_helper1 : false_helper1 { }; template struct is_reference_to_const : is_reference_to_const_helper1::value>::template apply { }; template struct is_reference_to_non_const_helper1 { template struct apply { static T t; BOOST_STATIC_CONSTANT( bool, value = sizeof(reference_to_const_helper(t)) == sizeof(inner_no_type)); typedef mpl::bool_ type; }; }; template <> struct is_reference_to_non_const_helper1 : false_helper1 { }; template struct is_reference_to_non_const : is_reference_to_non_const_helper1::value>::template apply { BOOST_MPL_AUX_LAMBDA_SUPPORT(1,is_reference_to_non_const,(T)) }; template typename is_volatile_help::type reference_to_volatile_helper(V&); outer_no_type reference_to_volatile_helper(...); template struct is_reference_to_volatile_helper1 { template struct apply { static T t; BOOST_STATIC_CONSTANT( bool, value = sizeof(reference_to_volatile_helper(t)) == sizeof(inner_yes_type)); typedef mpl::bool_ type; }; }; template <> struct is_reference_to_volatile_helper1 : false_helper1 { }; template struct is_reference_to_volatile : is_reference_to_volatile_helper1::value>::template apply { }; template typename is_pointer_help::type reference_to_pointer_helper(V&); outer_no_type reference_to_pointer_helper(...); template struct reference_to_pointer_impl { static T t; BOOST_STATIC_CONSTANT( bool, value = (sizeof((reference_to_pointer_helper)(t)) == sizeof(inner_yes_type)) ); typedef mpl::bool_ type; }; template struct is_reference_to_pointer : mpl::eval_if, reference_to_pointer_impl, mpl::false_>::type { BOOST_MPL_AUX_LAMBDA_SUPPORT(1,is_reference_to_pointer,(T)) }; template struct is_reference_to_function_pointer : mpl::eval_if, is_pointer_to_function_aux, mpl::false_>::type { BOOST_MPL_AUX_LAMBDA_SUPPORT(1,is_reference_to_function_pointer,(T)) }; template struct is_member_function_pointer_help : mpl::if_, inner_yes_type, inner_no_type> {}; template typename is_member_function_pointer_help::type member_function_pointer_helper(V&); outer_no_type member_function_pointer_helper(...); template struct is_pointer_to_member_function_aux { static T t; BOOST_STATIC_CONSTANT( bool, value = sizeof((member_function_pointer_helper)(t)) == sizeof(inner_yes_type)); typedef mpl::bool_ type; }; template struct is_reference_to_member_function_pointer : mpl::if_< is_reference , is_pointer_to_member_function_aux , mpl::bool_ >::type { BOOST_MPL_AUX_LAMBDA_SUPPORT(1,is_reference_to_member_function_pointer,(T)) }; template typename is_class_help::type reference_to_class_helper(V const volatile&); outer_no_type reference_to_class_helper(...); template struct is_reference_to_class { static T t; BOOST_STATIC_CONSTANT( bool, value = (is_reference::value & (sizeof(reference_to_class_helper(t)) == sizeof(inner_yes_type))) ); typedef mpl::bool_ type; BOOST_MPL_AUX_LAMBDA_SUPPORT(1,is_reference_to_class,(T)) }; template typename is_class_help::type pointer_to_class_helper(V const volatile*); outer_no_type pointer_to_class_helper(...); template struct is_pointer_to_class { static T t; BOOST_STATIC_CONSTANT( bool, value = (is_pointer::value && sizeof(pointer_to_class_helper(t)) == sizeof(inner_yes_type)) ); typedef mpl::bool_ type; }; # endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION } using namespace indirect_traits; }} // namespace boost::python::detail #endif // INDIRECT_TRAITS_DWA2002131_HPP madp-0.4/src/boost/boost/detail/PaxHeaders.5405/iterator.hpp0000644000000000000000000000007312717644140020631 xustar0029 atime=1463765180.09772019 30 ctime=1463765201.045552885 madp-0.4/src/boost/boost/detail/iterator.hpp0000664000372100037210000003673012717644140021472 0ustar00fransfrans00000000000000// (C) Copyright David Abrahams 2002. // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // Boost versions of // // std::iterator_traits<>::iterator_category // std::iterator_traits<>::difference_type // std::distance() // // ...for all compilers and iterators // // Additionally, if X is a pointer // std::iterator_traits::pointer // Otherwise, if partial specialization is supported or X is not a pointer // std::iterator_traits::value_type // std::iterator_traits::pointer // std::iterator_traits::reference // // See http://www.boost.org for most recent version including documentation. // Revision History // 04 Mar 2001 - More attempted fixes for Intel C++ (David Abrahams) // 03 Mar 2001 - Put all implementation into namespace // boost::detail::iterator_traits_. Some progress made on fixes // for Intel compiler. (David Abrahams) // 02 Mar 2001 - Changed BOOST_MSVC to BOOST_MSVC_STD_ITERATOR in a few // places. (Jeremy Siek) // 19 Feb 2001 - Improved workarounds for stock MSVC6; use yes_type and // no_type from type_traits.hpp; stopped trying to remove_cv // before detecting is_pointer, in honor of the new type_traits // semantics. (David Abrahams) // 13 Feb 2001 - Make it work with nearly all standard-conforming iterators // under raw VC6. The one category remaining which will fail is // that of iterators derived from std::iterator but not // boost::iterator and which redefine difference_type. // 11 Feb 2001 - Clean away code which can never be used (David Abrahams) // 09 Feb 2001 - Always have a definition for each traits member, even if it // can't be properly deduced. These will be incomplete types in // some cases (undefined), but it helps suppress MSVC errors // elsewhere (David Abrahams) // 07 Feb 2001 - Support for more of the traits members where possible, making // this useful as a replacement for std::iterator_traits when // used as a default template parameter. // 06 Feb 2001 - Removed useless #includes of standard library headers // (David Abrahams) #ifndef ITERATOR_DWA122600_HPP_ # define ITERATOR_DWA122600_HPP_ # include # include // STLPort 4.0 and betas have a bug when debugging is enabled and there is no // partial specialization: instead of an iterator_category typedef, the standard // container iterators have _Iterator_category. // // Also, whether debugging is enabled or not, there is a broken specialization // of std::iterator which has no // typedefs but iterator_category. # if defined(__SGI_STL_PORT) # if (__SGI_STL_PORT <= 0x410) && !defined(__STL_CLASS_PARTIAL_SPECIALIZATION) && defined(__STL_DEBUG) # define BOOST_BAD_CONTAINER_ITERATOR_CATEGORY_TYPEDEF # endif # define BOOST_BAD_OUTPUT_ITERATOR_SPECIALIZATION # endif // STLPort <= 4.1b4 && no partial specialization # if !defined(BOOST_NO_STD_ITERATOR_TRAITS) \ && !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \ && !defined(BOOST_MSVC_STD_ITERATOR) namespace boost { namespace detail { // Define a new template so it can be specialized template struct iterator_traits : std::iterator_traits {}; using std::distance; }} // namespace boost::detail # else # if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \ && !defined(BOOST_MSVC_STD_ITERATOR) // This is the case where everything conforms except BOOST_NO_STD_ITERATOR_TRAITS namespace boost { namespace detail { // Rogue Wave Standard Library fools itself into thinking partial // specialization is missing on some platforms (e.g. Sun), so fails to // supply iterator_traits! template struct iterator_traits { typedef typename Iterator::value_type value_type; typedef typename Iterator::reference reference; typedef typename Iterator::pointer pointer; typedef typename Iterator::difference_type difference_type; typedef typename Iterator::iterator_category iterator_category; }; template struct iterator_traits { typedef T value_type; typedef T& reference; typedef T* pointer; typedef std::ptrdiff_t difference_type; typedef std::random_access_iterator_tag iterator_category; }; template struct iterator_traits { typedef T value_type; typedef T const& reference; typedef T const* pointer; typedef std::ptrdiff_t difference_type; typedef std::random_access_iterator_tag iterator_category; }; }} // namespace boost::detail # else # include # include # include # ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION # include # include # endif # ifdef BOOST_BAD_OUTPUT_ITERATOR_SPECIALIZATION # include # endif # include # include # include // should be the last #include # include "boost/type_traits/detail/bool_trait_def.hpp" namespace boost { namespace detail { BOOST_MPL_HAS_XXX_TRAIT_DEF(value_type) BOOST_MPL_HAS_XXX_TRAIT_DEF(reference) BOOST_MPL_HAS_XXX_TRAIT_DEF(pointer) BOOST_MPL_HAS_XXX_TRAIT_DEF(difference_type) BOOST_MPL_HAS_XXX_TRAIT_DEF(iterator_category) // is_mutable_iterator -- // // A metafunction returning true iff T is a mutable iterator type // with a nested value_type. Will only work portably with iterators // whose operator* returns a reference, but that seems to be OK for // the iterators supplied by Dinkumware. Some input iterators may // compile-time if they arrive here, and if the compiler is strict // about not taking the address of an rvalue. // This one detects ordinary mutable iterators - the result of // operator* is convertible to the value_type. template type_traits::yes_type is_mutable_iterator_helper(T const*, BOOST_DEDUCED_TYPENAME T::value_type*); // Since you can't take the address of an rvalue, the guts of // is_mutable_iterator_impl will fail if we use &*t directly. This // makes sure we can still work with non-lvalue iterators. template T* mutable_iterator_lvalue_helper(T& x); int mutable_iterator_lvalue_helper(...); // This one detects output iterators such as ostream_iterator which // return references to themselves. template type_traits::yes_type is_mutable_iterator_helper(T const*, T const*); type_traits::no_type is_mutable_iterator_helper(...); template struct is_mutable_iterator_impl { static T t; BOOST_STATIC_CONSTANT( bool, value = sizeof( detail::is_mutable_iterator_helper( (T*)0 , mutable_iterator_lvalue_helper(*t) // like &*t )) == sizeof(type_traits::yes_type) ); }; BOOST_TT_AUX_BOOL_TRAIT_DEF1( is_mutable_iterator,T,::boost::detail::is_mutable_iterator_impl::value) // is_full_iterator_traits -- // // A metafunction returning true iff T has all the requisite nested // types to satisfy the requirements for a fully-conforming // iterator_traits implementation. template struct is_full_iterator_traits_impl { enum { value = has_value_type::value & has_reference::value & has_pointer::value & has_difference_type::value & has_iterator_category::value }; }; BOOST_TT_AUX_BOOL_TRAIT_DEF1( is_full_iterator_traits,T,::boost::detail::is_full_iterator_traits_impl::value) # ifdef BOOST_BAD_CONTAINER_ITERATOR_CATEGORY_TYPEDEF BOOST_MPL_HAS_XXX_TRAIT_DEF(_Iterator_category) // is_stlport_40_debug_iterator -- // // A metafunction returning true iff T has all the requisite nested // types to satisfy the requirements of an STLPort 4.0 debug iterator // iterator_traits implementation. template struct is_stlport_40_debug_iterator_impl { enum { value = has_value_type::value & has_reference::value & has_pointer::value & has_difference_type::value & has__Iterator_category::value }; }; BOOST_TT_AUX_BOOL_TRAIT_DEF1( is_stlport_40_debug_iterator,T,::boost::detail::is_stlport_40_debug_iterator_impl::value) template struct stlport_40_debug_iterator_traits { typedef typename T::value_type value_type; typedef typename T::reference reference; typedef typename T::pointer pointer; typedef typename T::difference_type difference_type; typedef typename T::_Iterator_category iterator_category; }; # endif // BOOST_BAD_CONTAINER_ITERATOR_CATEGORY_TYPEDEF template struct pointer_iterator_traits; # ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION template struct pointer_iterator_traits { typedef typename remove_const::type value_type; typedef T* pointer; typedef T& reference; typedef std::random_access_iterator_tag iterator_category; typedef std::ptrdiff_t difference_type; }; # else // In case of no template partial specialization, and if T is a // pointer, iterator_traits::value_type can still be computed. For // some basic types, remove_pointer is manually defined in // type_traits/broken_compiler_spec.hpp. For others, do it yourself. template class please_invoke_BOOST_TT_BROKEN_COMPILER_SPEC_on_cv_unqualified_pointee; template struct pointer_value_type : mpl::if_< is_same::type> , please_invoke_BOOST_TT_BROKEN_COMPILER_SPEC_on_cv_unqualified_pointee

, typename remove_const< typename remove_pointer

::type >::type > { }; template struct pointer_reference : mpl::if_< is_same::type> , please_invoke_BOOST_TT_BROKEN_COMPILER_SPEC_on_cv_unqualified_pointee

, typename remove_pointer

::type& > { }; template struct pointer_iterator_traits { typedef T pointer; typedef std::random_access_iterator_tag iterator_category; typedef std::ptrdiff_t difference_type; typedef typename pointer_value_type::type value_type; typedef typename pointer_reference::type reference; }; # endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION // We'll sort iterator types into one of these classifications, from which we // can determine the difference_type, pointer, reference, and value_type template struct standard_iterator_traits { typedef typename Iterator::difference_type difference_type; typedef typename Iterator::value_type value_type; typedef typename Iterator::pointer pointer; typedef typename Iterator::reference reference; typedef typename Iterator::iterator_category iterator_category; }; template struct msvc_stdlib_mutable_traits : std::iterator_traits { typedef typename std::iterator_traits::distance_type difference_type; typedef typename std::iterator_traits::value_type* pointer; typedef typename std::iterator_traits::value_type& reference; }; template struct msvc_stdlib_const_traits : std::iterator_traits { typedef typename std::iterator_traits::distance_type difference_type; typedef const typename std::iterator_traits::value_type* pointer; typedef const typename std::iterator_traits::value_type& reference; }; # ifdef BOOST_BAD_OUTPUT_ITERATOR_SPECIALIZATION template struct is_bad_output_iterator : is_base_and_derived< std::iterator , Iterator> { }; struct bad_output_iterator_traits { typedef void value_type; typedef void difference_type; typedef std::output_iterator_tag iterator_category; typedef void pointer; typedef void reference; }; # endif // If we're looking at an MSVC6 (old Dinkumware) ``standard'' // iterator, this will generate an appropriate traits class. template struct msvc_stdlib_iterator_traits : mpl::if_< is_mutable_iterator , msvc_stdlib_mutable_traits , msvc_stdlib_const_traits >::type {}; template struct non_pointer_iterator_traits : mpl::if_< // if the iterator contains all the right nested types... is_full_iterator_traits // Use a standard iterator_traits implementation , standard_iterator_traits # ifdef BOOST_BAD_CONTAINER_ITERATOR_CATEGORY_TYPEDEF // Check for STLPort 4.0 broken _Iterator_category type , mpl::if_< is_stlport_40_debug_iterator , stlport_40_debug_iterator_traits # endif // Otherwise, assume it's a Dinkum iterator , msvc_stdlib_iterator_traits # ifdef BOOST_BAD_CONTAINER_ITERATOR_CATEGORY_TYPEDEF >::type # endif >::type { }; template struct iterator_traits_aux : mpl::if_< is_pointer , pointer_iterator_traits , non_pointer_iterator_traits >::type { }; template struct iterator_traits { // Explicit forwarding from base class needed to keep MSVC6 happy // under some circumstances. private: # ifdef BOOST_BAD_OUTPUT_ITERATOR_SPECIALIZATION typedef typename mpl::if_< is_bad_output_iterator , bad_output_iterator_traits , iterator_traits_aux >::type base; # else typedef iterator_traits_aux base; # endif public: typedef typename base::value_type value_type; typedef typename base::pointer pointer; typedef typename base::reference reference; typedef typename base::difference_type difference_type; typedef typename base::iterator_category iterator_category; }; // This specialization cuts off ETI (Early Template Instantiation) for MSVC. template <> struct iterator_traits { typedef int value_type; typedef int pointer; typedef int reference; typedef int difference_type; typedef int iterator_category; }; }} // namespace boost::detail # endif // workarounds namespace boost { namespace detail { namespace iterator_traits_ { template struct distance_select { static Difference execute(Iterator i1, const Iterator i2, ...) { Difference result = 0; while (i1 != i2) { ++i1; ++result; } return result; } static Difference execute(Iterator i1, const Iterator i2, std::random_access_iterator_tag*) { return i2 - i1; } }; } // namespace boost::detail::iterator_traits_ template inline typename iterator_traits::difference_type distance(Iterator first, Iterator last) { typedef typename iterator_traits::difference_type diff_t; typedef typename ::boost::detail::iterator_traits::iterator_category iterator_category; return iterator_traits_::distance_select::execute( first, last, (iterator_category*)0); } }} # endif # undef BOOST_BAD_CONTAINER_ITERATOR_CATEGORY_TYPEDEF # undef BOOST_BAD_OUTPUT_ITERATOR_SPECIALIZATION #endif // ITERATOR_DWA122600_HPP_ madp-0.4/src/boost/boost/PaxHeaders.5405/any.hpp0000644000000000000000000000007412717644140016326 xustar0030 atime=1463765180.093720222 30 ctime=1463765201.037552948 madp-0.4/src/boost/boost/any.hpp0000664000372100037210000002324712717644140017165 0ustar00fransfrans00000000000000// See http://www.boost.org/libs/any for Documentation. #ifndef BOOST_ANY_INCLUDED #define BOOST_ANY_INCLUDED #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma once #endif // what: variant type boost::any // who: contributed by Kevlin Henney, // with features contributed and bugs found by // Antony Polukhin, Ed Brey, Mark Rodgers, // Peter Dimov, and James Curran // when: July 2001, April 2013 - May 2013 #include #include #include "boost/config.hpp" #include #include #include #include #include #include #include #include #include #include // See boost/python/type_id.hpp // TODO: add BOOST_TYPEID_COMPARE_BY_NAME to config.hpp # if (defined(__GNUC__) && __GNUC__ >= 3) \ || defined(_AIX) \ || ( defined(__sgi) && defined(__host_mips)) \ || (defined(__hpux) && defined(__HP_aCC)) \ || (defined(linux) && defined(__INTEL_COMPILER) && defined(__ICC)) # define BOOST_AUX_ANY_TYPE_ID_NAME #include # endif #if defined(_MSC_VER) #pragma warning(push) #pragma warning(disable: 4172) // Mistakenly warns: returning address of local variable or temporary #endif namespace boost { class any { public: // structors any() BOOST_NOEXCEPT : content(0) { } template any(const ValueType & value) : content(new holder::type>(value)) { } any(const any & other) : content(other.content ? other.content->clone() : 0) { } #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES // Move constructor any(any&& other) BOOST_NOEXCEPT : content(other.content) { other.content = 0; } // Perfect forwarding of ValueType template any(ValueType&& value , typename boost::disable_if >::type* = 0 // disable if value has type `any&` , typename boost::disable_if >::type* = 0) // disable if value has type `const ValueType&&` : content(new holder< typename decay::type >(static_cast(value))) { } #endif ~any() BOOST_NOEXCEPT { delete content; } public: // modifiers any & swap(any & rhs) BOOST_NOEXCEPT { std::swap(content, rhs.content); return *this; } #ifdef BOOST_NO_CXX11_RVALUE_REFERENCES template any & operator=(const ValueType & rhs) { any(rhs).swap(*this); return *this; } any & operator=(any rhs) { any(rhs).swap(*this); return *this; } #else any & operator=(const any& rhs) { any(rhs).swap(*this); return *this; } // move assignement any & operator=(any&& rhs) BOOST_NOEXCEPT { rhs.swap(*this); any().swap(rhs); return *this; } // Perfect forwarding of ValueType template any & operator=(ValueType&& rhs) { any(static_cast(rhs)).swap(*this); return *this; } #endif public: // queries bool empty() const BOOST_NOEXCEPT { return !content; } void clear() BOOST_NOEXCEPT { any().swap(*this); } const std::type_info & type() const BOOST_NOEXCEPT { return content ? content->type() : typeid(void); } #ifndef BOOST_NO_MEMBER_TEMPLATE_FRIENDS private: // types #else public: // types (public so any_cast can be non-friend) #endif class placeholder { public: // structors virtual ~placeholder() { } public: // queries virtual const std::type_info & type() const BOOST_NOEXCEPT = 0; virtual placeholder * clone() const = 0; }; template class holder : public placeholder { public: // structors holder(const ValueType & value) : held(value) { } #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES holder(ValueType&& value) : held(static_cast< ValueType&& >(value)) { } #endif public: // queries virtual const std::type_info & type() const BOOST_NOEXCEPT { return typeid(ValueType); } virtual placeholder * clone() const { return new holder(held); } public: // representation ValueType held; private: // intentionally left unimplemented holder & operator=(const holder &); }; #ifndef BOOST_NO_MEMBER_TEMPLATE_FRIENDS private: // representation template friend ValueType * any_cast(any *) BOOST_NOEXCEPT; template friend ValueType * unsafe_any_cast(any *) BOOST_NOEXCEPT; #else public: // representation (public so any_cast can be non-friend) #endif placeholder * content; }; inline void swap(any & lhs, any & rhs) BOOST_NOEXCEPT { lhs.swap(rhs); } class BOOST_SYMBOL_VISIBLE bad_any_cast : public std::bad_cast { public: virtual const char * what() const BOOST_NOEXCEPT_OR_NOTHROW { return "boost::bad_any_cast: " "failed conversion using boost::any_cast"; } }; template ValueType * any_cast(any * operand) BOOST_NOEXCEPT { return operand && #ifdef BOOST_AUX_ANY_TYPE_ID_NAME std::strcmp(operand->type().name(), typeid(ValueType).name()) == 0 #else operand->type() == typeid(ValueType) #endif ? &static_cast *>(operand->content)->held : 0; } template inline const ValueType * any_cast(const any * operand) BOOST_NOEXCEPT { return any_cast(const_cast(operand)); } template ValueType any_cast(any & operand) { typedef BOOST_DEDUCED_TYPENAME remove_reference::type nonref; #ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION // If 'nonref' is still reference type, it means the user has not // specialized 'remove_reference'. // Please use BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION macro // to generate specialization of remove_reference for your class // See type traits library documentation for details BOOST_STATIC_ASSERT(!is_reference::value); #endif nonref * result = any_cast(&operand); if(!result) boost::throw_exception(bad_any_cast()); // Attempt to avoid construction of a temporary object in cases when // `ValueType` is not a reference. Example: // `static_cast(*result);` // which is equal to `std::string(*result);` typedef BOOST_DEDUCED_TYPENAME boost::mpl::if_< boost::is_reference, ValueType, BOOST_DEDUCED_TYPENAME boost::add_reference::type >::type ref_type; return static_cast(*result); } template inline ValueType any_cast(const any & operand) { typedef BOOST_DEDUCED_TYPENAME remove_reference::type nonref; #ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION // The comment in the above version of 'any_cast' explains when this // assert is fired and what to do. BOOST_STATIC_ASSERT(!is_reference::value); #endif return any_cast(const_cast(operand)); } #ifndef BOOST_NO_CXX11_RVALUE_REFERENCES template inline ValueType&& any_cast(any&& operand) { BOOST_STATIC_ASSERT_MSG( boost::is_rvalue_reference::value || boost::is_const< typename boost::remove_reference::type >::value, "boost::any_cast shall not be used for getting nonconst references to temporary objects" ); return any_cast(operand); } #endif // Note: The "unsafe" versions of any_cast are not part of the // public interface and may be removed at any time. They are // required where we know what type is stored in the any and can't // use typeid() comparison, e.g., when our types may travel across // different shared libraries. template inline ValueType * unsafe_any_cast(any * operand) BOOST_NOEXCEPT { return &static_cast *>(operand->content)->held; } template inline const ValueType * unsafe_any_cast(const any * operand) BOOST_NOEXCEPT { return unsafe_any_cast(const_cast(operand)); } } // Copyright Kevlin Henney, 2000, 2001, 2002. All rights reserved. // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #if defined(_MSC_VER) #pragma warning(pop) #endif #endif madp-0.4/src/boost/boost/PaxHeaders.5405/property_map0000644000000000000000000000007412717644140017472 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.145552085 madp-0.4/src/boost/boost/property_map/0000775000372100037210000000000012717644140020376 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/property_map/PaxHeaders.5405/property_map.hpp0000644000000000000000000000007312717644140023000 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.145552085 madp-0.4/src/boost/boost/property_map/property_map.hpp0000664000372100037210000007313612717644140023642 0ustar00fransfrans00000000000000// (C) Copyright Jeremy Siek 1999-2001. // Copyright (C) 2006 Trustees of Indiana University // Authors: Douglas Gregor and Jeremy Siek // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // See http://www.boost.org/libs/property_map for documentation. #ifndef BOOST_PROPERTY_MAP_HPP #define BOOST_PROPERTY_MAP_HPP #include #include #include #include #include #include #include #include #include #include #include #include namespace boost { //========================================================================= // property_traits class BOOST_MPL_HAS_XXX_TRAIT_DEF(key_type) BOOST_MPL_HAS_XXX_TRAIT_DEF(value_type) BOOST_MPL_HAS_XXX_TRAIT_DEF(reference) BOOST_MPL_HAS_XXX_TRAIT_DEF(category) template struct is_property_map : boost::mpl::and_< has_key_type, has_value_type, has_reference, has_category > {}; template struct default_property_traits { typedef typename PA::key_type key_type; typedef typename PA::value_type value_type; typedef typename PA::reference reference; typedef typename PA::category category; }; struct null_property_traits {}; template struct property_traits : boost::mpl::if_, default_property_traits, null_property_traits>::type {}; #if 0 template struct property_traits { typedef typename PA::key_type key_type; typedef typename PA::value_type value_type; typedef typename PA::reference reference; typedef typename PA::category category; }; #endif //========================================================================= // property_traits category tags namespace detail { enum ePropertyMapID { READABLE_PA, WRITABLE_PA, READ_WRITE_PA, LVALUE_PA, OP_BRACKET_PA, RAND_ACCESS_ITER_PA, LAST_PA }; } struct readable_property_map_tag { enum { id = detail::READABLE_PA }; }; struct writable_property_map_tag { enum { id = detail::WRITABLE_PA }; }; struct read_write_property_map_tag : public readable_property_map_tag, public writable_property_map_tag { enum { id = detail::READ_WRITE_PA }; }; struct lvalue_property_map_tag : public read_write_property_map_tag { enum { id = detail::LVALUE_PA }; }; //========================================================================= // property_traits specialization for pointers #ifdef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION // The user will just have to create their own specializations for // other pointers types if the compiler does not have partial // specializations. Sorry! #define BOOST_SPECIALIZE_PROPERTY_TRAITS_PTR(TYPE) \ template <> \ struct property_traits { \ typedef TYPE value_type; \ typedef value_type& reference; \ typedef std::ptrdiff_t key_type; \ typedef lvalue_property_map_tag category; \ }; \ template <> \ struct property_traits { \ typedef TYPE value_type; \ typedef const value_type& reference; \ typedef std::ptrdiff_t key_type; \ typedef lvalue_property_map_tag category; \ } BOOST_SPECIALIZE_PROPERTY_TRAITS_PTR(long); BOOST_SPECIALIZE_PROPERTY_TRAITS_PTR(unsigned long); BOOST_SPECIALIZE_PROPERTY_TRAITS_PTR(int); BOOST_SPECIALIZE_PROPERTY_TRAITS_PTR(unsigned int); BOOST_SPECIALIZE_PROPERTY_TRAITS_PTR(short); BOOST_SPECIALIZE_PROPERTY_TRAITS_PTR(unsigned short); BOOST_SPECIALIZE_PROPERTY_TRAITS_PTR(char); BOOST_SPECIALIZE_PROPERTY_TRAITS_PTR(unsigned char); BOOST_SPECIALIZE_PROPERTY_TRAITS_PTR(signed char); BOOST_SPECIALIZE_PROPERTY_TRAITS_PTR(bool); BOOST_SPECIALIZE_PROPERTY_TRAITS_PTR(float); BOOST_SPECIALIZE_PROPERTY_TRAITS_PTR(double); BOOST_SPECIALIZE_PROPERTY_TRAITS_PTR(long double); // This may need to be turned off for some older compilers that don't have // wchar_t intrinsically. # ifndef BOOST_NO_INTRINSIC_WCHAR_T template <> struct property_traits { typedef wchar_t value_type; typedef value_type& reference; typedef std::ptrdiff_t key_type; typedef lvalue_property_map_tag category; }; template <> struct property_traits { typedef wchar_t value_type; typedef const value_type& reference; typedef std::ptrdiff_t key_type; typedef lvalue_property_map_tag category; }; # endif #else template struct property_traits { // BOOST_STATIC_ASSERT(boost::is_same::value && !"Using pointers as property maps is deprecated"); typedef T value_type; typedef value_type& reference; typedef std::ptrdiff_t key_type; typedef lvalue_property_map_tag category; }; template struct property_traits { // BOOST_STATIC_ASSERT(boost::is_same::value && !"Using pointers as property maps is deprecated"); typedef T value_type; typedef const value_type& reference; typedef std::ptrdiff_t key_type; typedef lvalue_property_map_tag category; }; #endif #if !defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP) // MSVC doesn't have Koenig lookup, so the user has to // do boost::get() anyways, and the using clause // doesn't really work for MSVC. } // namespace boost #endif // These need to go in global namespace because Koenig // lookup does not apply to T*. // V must be convertible to T template inline void put(T* pa, std::ptrdiff_t k, const V& val) { pa[k] = val; } template inline const T& get(const T* pa, std::ptrdiff_t k) { return pa[k]; } #if !defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP) namespace boost { using ::put; using ::get; #endif //========================================================================= // concept checks for property maps template struct ReadablePropertyMapConcept { typedef typename property_traits::key_type key_type; typedef typename property_traits::reference reference; typedef typename property_traits::category Category; typedef boost::readable_property_map_tag ReadableTag; void constraints() { function_requires< ConvertibleConcept >(); val = get(pmap, k); } PMap pmap; Key k; typename property_traits::value_type val; }; template struct readable_property_map_archetype { typedef KeyArchetype key_type; typedef ValueArchetype value_type; typedef convertible_to_archetype reference; typedef readable_property_map_tag category; }; template const typename readable_property_map_archetype::reference& get(const readable_property_map_archetype&, const typename readable_property_map_archetype::key_type&) { typedef typename readable_property_map_archetype::reference R; return static_object::get(); } template struct WritablePropertyMapConcept { typedef typename property_traits::key_type key_type; typedef typename property_traits::category Category; typedef boost::writable_property_map_tag WritableTag; void constraints() { function_requires< ConvertibleConcept >(); put(pmap, k, val); } PMap pmap; Key k; typename property_traits::value_type val; }; template struct writable_property_map_archetype { typedef KeyArchetype key_type; typedef ValueArchetype value_type; typedef void reference; typedef writable_property_map_tag category; }; template void put(const writable_property_map_archetype&, const typename writable_property_map_archetype::key_type&, const typename writable_property_map_archetype::value_type&) { } template struct ReadWritePropertyMapConcept { typedef typename property_traits::category Category; typedef boost::read_write_property_map_tag ReadWriteTag; void constraints() { function_requires< ReadablePropertyMapConcept >(); function_requires< WritablePropertyMapConcept >(); function_requires< ConvertibleConcept >(); } }; template struct read_write_property_map_archetype : public readable_property_map_archetype, public writable_property_map_archetype { typedef KeyArchetype key_type; typedef ValueArchetype value_type; typedef convertible_to_archetype reference; typedef read_write_property_map_tag category; }; template struct LvaluePropertyMapConcept { typedef typename property_traits::category Category; typedef boost::lvalue_property_map_tag LvalueTag; typedef typename property_traits::reference reference; void constraints() { function_requires< ReadablePropertyMapConcept >(); function_requires< ConvertibleConcept >(); typedef typename property_traits::value_type value_type; BOOST_MPL_ASSERT((boost::mpl::or_< boost::is_same, boost::is_same >)); reference ref = pmap[k]; ignore_unused_variable_warning(ref); } PMap pmap; Key k; }; template struct lvalue_property_map_archetype : public readable_property_map_archetype { typedef KeyArchetype key_type; typedef ValueArchetype value_type; typedef const ValueArchetype& reference; typedef lvalue_property_map_tag category; const value_type& operator[](const key_type&) const { return static_object::get(); } }; template struct Mutable_LvaluePropertyMapConcept { typedef typename property_traits::category Category; typedef boost::lvalue_property_map_tag LvalueTag; typedef typename property_traits::reference reference; void constraints() { boost::function_requires< ReadWritePropertyMapConcept >(); boost::function_requires >(); typedef typename property_traits::value_type value_type; BOOST_MPL_ASSERT((boost::is_same)); reference ref = pmap[k]; ignore_unused_variable_warning(ref); } PMap pmap; Key k; }; template struct mutable_lvalue_property_map_archetype : public readable_property_map_archetype, public writable_property_map_archetype { typedef KeyArchetype key_type; typedef ValueArchetype value_type; typedef ValueArchetype& reference; typedef lvalue_property_map_tag category; value_type& operator[](const key_type&) const { return static_object::get(); } }; template struct typed_identity_property_map; // A helper class for constructing a property map // from a class that implements operator[] template struct put_get_helper { }; template inline Reference get(const put_get_helper& pa, const K& k) { Reference v = static_cast(pa)[k]; return v; } template inline void put(const put_get_helper& pa, K k, const V& v) { static_cast(pa)[k] = v; } //========================================================================= // Adapter to turn a RandomAccessIterator into a property map template ::value_type , class R = typename std::iterator_traits::reference #endif > class iterator_property_map : public boost::put_get_helper< R, iterator_property_map > { public: typedef typename property_traits::key_type key_type; typedef T value_type; typedef R reference; typedef boost::lvalue_property_map_tag category; inline iterator_property_map( RandomAccessIterator cc = RandomAccessIterator(), const IndexMap& _id = IndexMap() ) : iter(cc), index(_id) { } inline R operator[](key_type v) const { return *(iter + get(index, v)) ; } protected: RandomAccessIterator iter; IndexMap index; }; #if !defined BOOST_NO_STD_ITERATOR_TRAITS template inline iterator_property_map< RAIter, ID, typename std::iterator_traits::value_type, typename std::iterator_traits::reference> make_iterator_property_map(RAIter iter, ID id) { function_requires< RandomAccessIteratorConcept >(); typedef iterator_property_map< RAIter, ID, typename std::iterator_traits::value_type, typename std::iterator_traits::reference> PA; return PA(iter, id); } #endif template inline iterator_property_map make_iterator_property_map(RAIter iter, ID id, Value) { function_requires< RandomAccessIteratorConcept >(); typedef iterator_property_map PMap; return PMap(iter, id); } template ::value_type , class R = typename std::iterator_traits::reference #endif > class safe_iterator_property_map : public boost::put_get_helper< R, safe_iterator_property_map > { public: typedef typename property_traits::key_type key_type; typedef T value_type; typedef R reference; typedef boost::lvalue_property_map_tag category; inline safe_iterator_property_map( RandomAccessIterator first, std::size_t n_ = 0, const IndexMap& _id = IndexMap() ) : iter(first), n(n_), index(_id) { } inline safe_iterator_property_map() { } inline R operator[](key_type v) const { BOOST_ASSERT(get(index, v) < n); return *(iter + get(index, v)) ; } typename property_traits::value_type size() const { return n; } protected: RandomAccessIterator iter; typename property_traits::value_type n; IndexMap index; }; #if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION template inline safe_iterator_property_map< RAIter, ID, typename boost::detail::iterator_traits::value_type, typename boost::detail::iterator_traits::reference> make_safe_iterator_property_map(RAIter iter, std::size_t n, ID id) { function_requires< RandomAccessIteratorConcept >(); typedef safe_iterator_property_map< RAIter, ID, typename boost::detail::iterator_traits::value_type, typename boost::detail::iterator_traits::reference> PA; return PA(iter, n, id); } #endif template inline safe_iterator_property_map make_safe_iterator_property_map(RAIter iter, std::size_t n, ID id, Value) { function_requires< RandomAccessIteratorConcept >(); typedef safe_iterator_property_map PMap; return PMap(iter, n, id); } //========================================================================= // An adaptor to turn a Unique Pair Associative Container like std::map or // std::hash_map into an Lvalue Property Map. template class associative_property_map : public boost::put_get_helper< typename UniquePairAssociativeContainer::value_type::second_type&, associative_property_map > { typedef UniquePairAssociativeContainer C; public: typedef typename C::key_type key_type; typedef typename C::value_type::second_type value_type; typedef value_type& reference; typedef lvalue_property_map_tag category; associative_property_map() : m_c(0) { } associative_property_map(C& c) : m_c(&c) { } reference operator[](const key_type& k) const { return (*m_c)[k]; } private: C* m_c; }; template associative_property_map make_assoc_property_map(UniquePairAssociativeContainer& c) { return associative_property_map(c); } template class const_associative_property_map : public boost::put_get_helper< const typename UniquePairAssociativeContainer::value_type::second_type&, const_associative_property_map > { typedef UniquePairAssociativeContainer C; public: typedef typename C::key_type key_type; typedef typename C::value_type::second_type value_type; typedef const value_type& reference; typedef lvalue_property_map_tag category; const_associative_property_map() : m_c(0) { } const_associative_property_map(const C& c) : m_c(&c) { } reference operator[](const key_type& k) const { return m_c->find(k)->second; } private: C const* m_c; }; template const_associative_property_map make_assoc_property_map(const UniquePairAssociativeContainer& c) { return const_associative_property_map(c); } //========================================================================= // A property map that always returns the same object by value. // template class static_property_map : public boost::put_get_helper > { ValueType value; public: typedef void key_type; typedef ValueType value_type; typedef ValueType reference; typedef readable_property_map_tag category; static_property_map(ValueType v) : value(v) {} template inline reference operator[](T) const { return value; } }; //========================================================================= // A property map that always returns a reference to the same object. // template class ref_property_map : public boost::put_get_helper > { ValueType* value; public: typedef KeyType key_type; typedef ValueType value_type; typedef ValueType& reference; typedef lvalue_property_map_tag category; ref_property_map(ValueType& v) : value(&v) {} ValueType& operator[](key_type const&) const { return *value; } }; //========================================================================= // A generalized identity property map template struct typed_identity_property_map : public boost::put_get_helper > { typedef T key_type; typedef T value_type; typedef T reference; typedef boost::readable_property_map_tag category; inline value_type operator[](const key_type& v) const { return v; } }; //========================================================================= // A property map that applies the identity function to integers typedef typed_identity_property_map identity_property_map; //========================================================================= // A property map that does not do anything, for // when you have to supply a property map, but don't need it. namespace detail { struct dummy_pmap_reference { template dummy_pmap_reference& operator=(const T&) { return *this; } operator int() { return 0; } }; } class dummy_property_map : public boost::put_get_helper { public: typedef void key_type; typedef int value_type; typedef detail::dummy_pmap_reference reference; typedef boost::read_write_property_map_tag category; inline dummy_property_map() : c(0) { } inline dummy_property_map(value_type cc) : c(cc) { } inline dummy_property_map(const dummy_property_map& x) : c(x.c) { } template inline reference operator[](Vertex) const { return reference(); } protected: value_type c; }; // Convert a Readable property map into a function object template class property_map_function { PropMap pm; typedef typename property_traits::key_type param_type; public: explicit property_map_function(const PropMap& pm): pm(pm) {} typedef typename property_traits::value_type result_type; result_type operator()(const param_type& k) const {return get(pm, k);} }; template property_map_function make_property_map_function(const PropMap& pm) { return property_map_function(pm); } } // namespace boost #ifdef BOOST_GRAPH_USE_MPI #include #include namespace boost { /** Distributed iterator property map. * * This specialization of @ref iterator_property_map builds a * distributed iterator property map given the local index maps * generated by distributed graph types that automatically have index * properties. * * This specialization is useful when creating external distributed * property maps via the same syntax used to create external * sequential property maps. */ template class iterator_property_map , ValueType, Reference> : public parallel::distributed_property_map > { typedef iterator_property_map local_iterator_map; typedef parallel::distributed_property_map inherited; typedef local_property_map index_map_type; typedef iterator_property_map self_type; public: iterator_property_map() { } iterator_property_map(RandomAccessIterator cc, const index_map_type& id) : inherited(id.process_group(), id.global(), local_iterator_map(cc, id.base())) { } }; /** Distributed iterator property map. * * This specialization of @ref iterator_property_map builds a * distributed iterator property map given a distributed index * map. Only the local portion of the distributed index property map * is utilized. * * This specialization is useful when creating external distributed * property maps via the same syntax used to create external * sequential property maps. */ template class iterator_property_map< RandomAccessIterator, parallel::distributed_property_map, ValueType, Reference > : public parallel::distributed_property_map > { typedef iterator_property_map local_iterator_map; typedef parallel::distributed_property_map inherited; typedef parallel::distributed_property_map index_map_type; public: iterator_property_map() { } iterator_property_map(RandomAccessIterator cc, const index_map_type& id) : inherited(id.process_group(), id.global(), local_iterator_map(cc, id.base())) { } }; namespace parallel { // Generate an iterator property map with a specific kind of ghost // cells template distributed_property_map > make_iterator_property_map(RandomAccessIterator cc, local_property_map index_map) { typedef distributed_property_map< ProcessGroup, GlobalMap, iterator_property_map > result_type; return result_type(index_map.process_group(), index_map.global(), make_iterator_property_map(cc, index_map.base())); } } // end namespace parallel /** Distributed safe iterator property map. * * This specialization of @ref safe_iterator_property_map builds a * distributed iterator property map given the local index maps * generated by distributed graph types that automatically have index * properties. * * This specialization is useful when creating external distributed * property maps via the same syntax used to create external * sequential property maps. */ template class safe_iterator_property_map , ValueType, Reference> : public parallel::distributed_property_map > { typedef safe_iterator_property_map local_iterator_map; typedef parallel::distributed_property_map inherited; typedef local_property_map index_map_type; public: safe_iterator_property_map() { } safe_iterator_property_map(RandomAccessIterator cc, std::size_t n, const index_map_type& id) : inherited(id.process_group(), id.global(), local_iterator_map(cc, n, id.base())) { } }; /** Distributed safe iterator property map. * * This specialization of @ref safe_iterator_property_map builds a * distributed iterator property map given a distributed index * map. Only the local portion of the distributed index property map * is utilized. * * This specialization is useful when creating external distributed * property maps via the same syntax used to create external * sequential property maps. */ template class safe_iterator_property_map< RandomAccessIterator, parallel::distributed_property_map, ValueType, Reference> : public parallel::distributed_property_map > { typedef safe_iterator_property_map local_iterator_map; typedef parallel::distributed_property_map inherited; typedef parallel::distributed_property_map index_map_type; public: safe_iterator_property_map() { } safe_iterator_property_map(RandomAccessIterator cc, std::size_t n, const index_map_type& id) : inherited(id.process_group(), id.global(), local_iterator_map(cc, n, id.base())) { } }; } #endif // BOOST_GRAPH_USE_MPI #include #endif /* BOOST_PROPERTY_MAP_HPP */ madp-0.4/src/boost/boost/property_map/PaxHeaders.5405/shared_array_property_map.hpp0000644000000000000000000000007312717644140025524 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.145552085 madp-0.4/src/boost/boost/property_map/shared_array_property_map.hpp0000664000372100037210000000267412717644140026365 0ustar00fransfrans00000000000000// Copyright (C) 2009 Trustees of Indiana University // Authors: Jeremiah Willcock, Andrew Lumsdaine // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // See http://www.boost.org/libs/property_map for documentation. #ifndef BOOST_SHARED_ARRAY_PROPERTY_MAP_HPP #define BOOST_SHARED_ARRAY_PROPERTY_MAP_HPP #include #include namespace boost { template class shared_array_property_map : public boost::put_get_helper > { public: typedef typename property_traits::key_type key_type; typedef T value_type; typedef T& reference; typedef boost::lvalue_property_map_tag category; inline shared_array_property_map(): data(), index() {} explicit inline shared_array_property_map( size_t n, const IndexMap& _id = IndexMap()) : data(new T[n]), index(_id) {} inline T& operator[](key_type v) const { return data[get(index, v)]; } private: boost::shared_array data; IndexMap index; }; template shared_array_property_map make_shared_array_property_map(size_t n, const T&, const IndexMap& index) { return shared_array_property_map(n, index); } } // end namespace boost #endif // BOOST_SHARED_ARRAY_PROPERTY_MAP_HPP madp-0.4/src/boost/boost/property_map/PaxHeaders.5405/vector_property_map.hpp0000644000000000000000000000007312717644140024362 xustar0029 atime=1463765180.16171968 30 ctime=1463765201.145552085 madp-0.4/src/boost/boost/property_map/vector_property_map.hpp0000664000372100037210000001470112717644140025215 0ustar00fransfrans00000000000000// Copyright (C) Vladimir Prus 2003. // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/graph/vector_property_map.html for // documentation. // #ifndef VECTOR_PROPERTY_MAP_HPP_VP_2003_03_04 #define VECTOR_PROPERTY_MAP_HPP_VP_2003_03_04 #include #include #include namespace boost { template class vector_property_map : public boost::put_get_helper< typename std::iterator_traits< typename std::vector::iterator >::reference, vector_property_map > { public: typedef typename property_traits::key_type key_type; typedef T value_type; typedef typename std::iterator_traits< typename std::vector::iterator >::reference reference; typedef boost::lvalue_property_map_tag category; vector_property_map(const IndexMap& index = IndexMap()) : store(new std::vector()), index(index) {} vector_property_map(unsigned initial_size, const IndexMap& index = IndexMap()) : store(new std::vector(initial_size)), index(index) {} typename std::vector::iterator storage_begin() { return store->begin(); } typename std::vector::iterator storage_end() { return store->end(); } typename std::vector::const_iterator storage_begin() const { return store->begin(); } typename std::vector::const_iterator storage_end() const { return store->end(); } IndexMap& get_index_map() { return index; } const IndexMap& get_index_map() const { return index; } public: // Copy ctor absent, default semantics is OK. // Assignment operator absent, default semantics is OK. // CONSIDER: not sure that assignment to 'index' is correct. reference operator[](const key_type& v) const { typename property_traits::value_type i = get(index, v); if (static_cast(i) >= store->size()) { store->resize(i + 1, T()); } return (*store)[i]; } private: // Conceptually, we have a vector of infinite size. For practical // purposes, we start with an empty vector and grow it as needed. // Note that we cannot store pointer to vector here -- we cannot // store pointer to data, because if copy of property map resizes // the vector, the pointer to data will be invalidated. // I wonder if class 'pmap_ref' is simply needed. shared_ptr< std::vector > store; IndexMap index; }; template vector_property_map make_vector_property_map(IndexMap index) { return vector_property_map(index); } } #ifdef BOOST_GRAPH_USE_MPI #include #include namespace boost { /** Distributed vector property map. * * This specialization of @ref vector_property_map builds a * distributed vector property map given the local index maps * generated by distributed graph types that automatically have index * properties. * * This specialization is useful when creating external distributed * property maps via the same syntax used to create external * sequential property maps. */ template class vector_property_map > : public parallel::distributed_property_map< ProcessGroup, GlobalMap, vector_property_map > { typedef vector_property_map local_iterator_map; typedef parallel::distributed_property_map inherited; typedef local_property_map index_map_type; public: vector_property_map(const index_map_type& index = index_map_type()) : inherited(index.process_group(), index.global(), local_iterator_map(index.base())) { } vector_property_map(unsigned inital_size, const index_map_type& index = index_map_type()) : inherited(index.process_group(), index.global(), local_iterator_map(inital_size, index.base())) { } }; /** Distributed vector property map. * * This specialization of @ref vector_property_map builds a * distributed vector property map given the local index maps * generated by distributed graph types that automatically have index * properties. * * This specialization is useful when creating external distributed * property maps via the same syntax used to create external * sequential property maps. */ template class vector_property_map< T, parallel::distributed_property_map< ProcessGroup, GlobalMap, StorageMap > > : public parallel::distributed_property_map< ProcessGroup, GlobalMap, vector_property_map > { typedef vector_property_map local_iterator_map; typedef parallel::distributed_property_map inherited; typedef parallel::distributed_property_map index_map_type; public: vector_property_map(const index_map_type& index = index_map_type()) : inherited(index.process_group(), index.global(), local_iterator_map(index.base())) { } vector_property_map(unsigned inital_size, const index_map_type& index = index_map_type()) : inherited(index.process_group(), index.global(), local_iterator_map(inital_size, index.base())) { } }; } #endif // BOOST_GRAPH_USE_MPI #endif madp-0.4/src/boost/boost/PaxHeaders.5405/intrusive_ptr.hpp0000644000000000000000000000007412717644140020454 xustar0030 atime=1463765180.105720127 30 ctime=1463765201.053552821 madp-0.4/src/boost/boost/intrusive_ptr.hpp0000664000372100037210000000076312717644140021311 0ustar00fransfrans00000000000000#ifndef BOOST_INTRUSIVE_PTR_HPP_INCLUDED #define BOOST_INTRUSIVE_PTR_HPP_INCLUDED // // intrusive_ptr.hpp // // Copyright (c) 2001, 2002 Peter Dimov // // Distributed under the Boost Software License, Version 1.0. // See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt // // See http://www.boost.org/libs/smart_ptr/intrusive_ptr.html for documentation. // #include #endif // #ifndef BOOST_INTRUSIVE_PTR_HPP_INCLUDED madp-0.4/src/boost/boost/PaxHeaders.5405/numeric0000644000000000000000000000007412717644140016413 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.105552405 madp-0.4/src/boost/boost/numeric/0000775000372100037210000000000012717644140017317 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/numeric/PaxHeaders.5405/ublas0000644000000000000000000000007412717644140017521 xustar0030 atime=1463765202.457541607 30 ctime=1463765201.105552405 madp-0.4/src/boost/boost/numeric/ublas/0000775000372100037210000000000012717644140020425 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/numeric/ublas/PaxHeaders.5405/matrix_sparse.hpp0000644000000000000000000000007412717644140023170 xustar0030 atime=1463765180.133719902 30 ctime=1463765201.105552405 madp-0.4/src/boost/boost/numeric/ublas/matrix_sparse.hpp0000664000372100037210000065745412717644140024044 0ustar00fransfrans00000000000000// // Copyright (c) 2000-2007 // Joerg Walter, Mathias Koch, Gunter Winkler // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // The authors gratefully acknowledge the support of // GeNeSys mbH & Co. KG in producing this work. // #ifndef _BOOST_UBLAS_MATRIX_SPARSE_ #define _BOOST_UBLAS_MATRIX_SPARSE_ #include #include #include #if BOOST_UBLAS_TYPE_CHECK #include #endif // Iterators based on ideas of Jeremy Siek namespace boost { namespace numeric { namespace ublas { #ifdef BOOST_UBLAS_STRICT_MATRIX_SPARSE template class sparse_matrix_element: public container_reference { public: typedef M matrix_type; typedef typename M::size_type size_type; typedef typename M::value_type value_type; typedef const value_type &const_reference; typedef value_type *pointer; typedef const value_type *const_pointer; private: // Proxied element operations void get_d () const { const_pointer p = (*this) ().find_element (i_, j_); if (p) d_ = *p; else d_ = value_type/*zero*/(); } void set (const value_type &s) const { pointer p = (*this) ().find_element (i_, j_); if (!p) (*this) ().insert_element (i_, j_, s); else *p = s; } public: // Construction and destruction BOOST_UBLAS_INLINE sparse_matrix_element (matrix_type &m, size_type i, size_type j): container_reference (m), i_ (i), j_ (j) { } BOOST_UBLAS_INLINE sparse_matrix_element (const sparse_matrix_element &p): container_reference (p), i_ (p.i_), j_ (p.j_) {} BOOST_UBLAS_INLINE ~sparse_matrix_element () { } // Assignment BOOST_UBLAS_INLINE sparse_matrix_element &operator = (const sparse_matrix_element &p) { // Overide the implict copy assignment p.get_d (); set (p.d_); return *this; } template BOOST_UBLAS_INLINE sparse_matrix_element &operator = (const D &d) { set (d); return *this; } template BOOST_UBLAS_INLINE sparse_matrix_element &operator += (const D &d) { get_d (); d_ += d; set (d_); return *this; } template BOOST_UBLAS_INLINE sparse_matrix_element &operator -= (const D &d) { get_d (); d_ -= d; set (d_); return *this; } template BOOST_UBLAS_INLINE sparse_matrix_element &operator *= (const D &d) { get_d (); d_ *= d; set (d_); return *this; } template BOOST_UBLAS_INLINE sparse_matrix_element &operator /= (const D &d) { get_d (); d_ /= d; set (d_); return *this; } // Comparison template BOOST_UBLAS_INLINE bool operator == (const D &d) const { get_d (); return d_ == d; } template BOOST_UBLAS_INLINE bool operator != (const D &d) const { get_d (); return d_ != d; } // Conversion - weak link in proxy as d_ is not a perfect alias for the element BOOST_UBLAS_INLINE operator const_reference () const { get_d (); return d_; } // Conversion to reference - may be invalidated BOOST_UBLAS_INLINE value_type& ref () const { const pointer p = (*this) ().find_element (i_, j_); if (!p) return (*this) ().insert_element (i_, j_, value_type/*zero*/()); else return *p; } private: size_type i_; size_type j_; mutable value_type d_; }; /* * Generalise explicit reference access */ namespace detail { template struct element_reference > { typedef typename V::value_type& reference; static reference get_reference (const sparse_matrix_element& sve) { return sve.ref (); } }; } template struct type_traits > { typedef typename M::value_type element_type; typedef type_traits > self_type; typedef typename type_traits::value_type value_type; typedef typename type_traits::const_reference const_reference; typedef sparse_matrix_element reference; typedef typename type_traits::real_type real_type; typedef typename type_traits::precision_type precision_type; static const unsigned plus_complexity = type_traits::plus_complexity; static const unsigned multiplies_complexity = type_traits::multiplies_complexity; static BOOST_UBLAS_INLINE real_type real (const_reference t) { return type_traits::real (t); } static BOOST_UBLAS_INLINE real_type imag (const_reference t) { return type_traits::imag (t); } static BOOST_UBLAS_INLINE value_type conj (const_reference t) { return type_traits::conj (t); } static BOOST_UBLAS_INLINE real_type type_abs (const_reference t) { return type_traits::type_abs (t); } static BOOST_UBLAS_INLINE value_type type_sqrt (const_reference t) { return type_traits::type_sqrt (t); } static BOOST_UBLAS_INLINE real_type norm_1 (const_reference t) { return type_traits::norm_1 (t); } static BOOST_UBLAS_INLINE real_type norm_2 (const_reference t) { return type_traits::norm_2 (t); } static BOOST_UBLAS_INLINE real_type norm_inf (const_reference t) { return type_traits::norm_inf (t); } static BOOST_UBLAS_INLINE bool equals (const_reference t1, const_reference t2) { return type_traits::equals (t1, t2); } }; template struct promote_traits, T2> { typedef typename promote_traits::value_type, T2>::promote_type promote_type; }; template struct promote_traits > { typedef typename promote_traits::value_type>::promote_type promote_type; }; template struct promote_traits, sparse_matrix_element > { typedef typename promote_traits::value_type, typename sparse_matrix_element::value_type>::promote_type promote_type; }; #endif /** \brief Index map based sparse matrix of values of type \c T * * This class represents a matrix by using a \c key to value mapping. The default type is * \code template > class mapped_matrix; \endcode * So, by default a STL map container is used to associate keys and values. The key is computed depending on * the layout type \c L as \code key = layout_type::element(i, size1_, j, size2_); \endcode * which means \code key = (i*size2+j) \endcode for a row major matrix. * Limitations: The matrix size must not exceed \f$(size1*size2) < \f$ \code std::limits \endcode. * The \ref find1() and \ref find2() operations have a complexity of at least \f$\mathcal{O}(log(nnz))\f$, depending * on the efficiency of \c std::lower_bound on the key set of the map. * Orientation and storage can also be specified, otherwise a row major orientation is used. * It is \b not required by the storage to initialize elements of the matrix. By default, the orientation is \c row_major. * * \sa fwd.hpp, storage_sparse.hpp * * \tparam T the type of object stored in the matrix (like double, float, complex, etc...) * \tparam L the storage organization. It can be either \c row_major or \c column_major. By default it is \c row_major */ template class mapped_matrix: public matrix_container > { typedef T &true_reference; typedef T *pointer; typedef const T * const_pointer; typedef L layout_type; typedef mapped_matrix self_type; public: #ifdef BOOST_UBLAS_ENABLE_PROXY_SHORTCUTS using matrix_container::operator (); #endif typedef typename A::size_type size_type; typedef typename A::difference_type difference_type; typedef T value_type; typedef A array_type; typedef const T &const_reference; #ifndef BOOST_UBLAS_STRICT_MATRIX_SPARSE typedef typename detail::map_traits::reference reference; #else typedef sparse_matrix_element reference; #endif typedef const matrix_reference const_closure_type; typedef matrix_reference closure_type; typedef mapped_vector vector_temporary_type; typedef self_type matrix_temporary_type; typedef sparse_tag storage_category; typedef typename L::orientation_category orientation_category; // Construction and destruction BOOST_UBLAS_INLINE mapped_matrix (): matrix_container (), size1_ (0), size2_ (0), data_ () {} BOOST_UBLAS_INLINE mapped_matrix (size_type size1, size_type size2, size_type non_zeros = 0): matrix_container (), size1_ (size1), size2_ (size2), data_ () { detail::map_reserve (data (), restrict_capacity (non_zeros)); } BOOST_UBLAS_INLINE mapped_matrix (const mapped_matrix &m): matrix_container (), size1_ (m.size1_), size2_ (m.size2_), data_ (m.data_) {} template BOOST_UBLAS_INLINE mapped_matrix (const matrix_expression &ae, size_type non_zeros = 0): matrix_container (), size1_ (ae ().size1 ()), size2_ (ae ().size2 ()), data_ () { detail::map_reserve (data (), restrict_capacity (non_zeros)); matrix_assign (*this, ae); } // Accessors BOOST_UBLAS_INLINE size_type size1 () const { return size1_; } BOOST_UBLAS_INLINE size_type size2 () const { return size2_; } BOOST_UBLAS_INLINE size_type nnz_capacity () const { return detail::map_capacity (data ()); } BOOST_UBLAS_INLINE size_type nnz () const { return data (). size (); } // Storage accessors BOOST_UBLAS_INLINE const array_type &data () const { return data_; } BOOST_UBLAS_INLINE array_type &data () { return data_; } // Resizing private: BOOST_UBLAS_INLINE size_type restrict_capacity (size_type non_zeros) const { // Guarding against overflow - thanks to Alexei Novakov for the hint. // non_zeros = (std::min) (non_zeros, size1_ * size2_); if (size1_ > 0 && non_zeros / size1_ >= size2_) non_zeros = size1_ * size2_; return non_zeros; } public: BOOST_UBLAS_INLINE void resize (size_type size1, size_type size2, bool preserve = true) { // FIXME preserve unimplemented BOOST_UBLAS_CHECK (!preserve, internal_logic ()); size1_ = size1; size2_ = size2; data ().clear (); } // Reserving BOOST_UBLAS_INLINE void reserve (size_type non_zeros, bool preserve = true) { detail::map_reserve (data (), restrict_capacity (non_zeros)); } // Element support BOOST_UBLAS_INLINE pointer find_element (size_type i, size_type j) { return const_cast (const_cast(*this).find_element (i, j)); } BOOST_UBLAS_INLINE const_pointer find_element (size_type i, size_type j) const { const size_type element = layout_type::element (i, size1_, j, size2_); const_subiterator_type it (data ().find (element)); if (it == data ().end ()) return 0; BOOST_UBLAS_CHECK ((*it).first == element, internal_logic ()); // broken map return &(*it).second; } // Element access BOOST_UBLAS_INLINE const_reference operator () (size_type i, size_type j) const { const size_type element = layout_type::element (i, size1_, j, size2_); const_subiterator_type it (data ().find (element)); if (it == data ().end ()) return zero_; BOOST_UBLAS_CHECK ((*it).first == element, internal_logic ()); // broken map return (*it).second; } BOOST_UBLAS_INLINE reference operator () (size_type i, size_type j) { #ifndef BOOST_UBLAS_STRICT_MATRIX_SPARSE const size_type element = layout_type::element (i, size1_, j, size2_); std::pair ii (data ().insert (typename array_type::value_type (element, value_type/*zero*/()))); BOOST_UBLAS_CHECK ((ii.first)->first == element, internal_logic ()); // broken map return (ii.first)->second; #else return reference (*this, i, j); #endif } // Element assingment BOOST_UBLAS_INLINE true_reference insert_element (size_type i, size_type j, const_reference t) { BOOST_UBLAS_CHECK (!find_element (i, j), bad_index ()); // duplicate element const size_type element = layout_type::element (i, size1_, j, size2_); std::pair ii (data ().insert (typename array_type::value_type (element, t))); BOOST_UBLAS_CHECK ((ii.first)->first == element, internal_logic ()); // broken map if (!ii.second) // existing element (ii.first)->second = t; return (ii.first)->second; } BOOST_UBLAS_INLINE void erase_element (size_type i, size_type j) { subiterator_type it = data ().find (layout_type::element (i, size1_, j, size2_)); if (it == data ().end ()) return; data ().erase (it); } // Zeroing BOOST_UBLAS_INLINE void clear () { data ().clear (); } // Assignment BOOST_UBLAS_INLINE mapped_matrix &operator = (const mapped_matrix &m) { if (this != &m) { size1_ = m.size1_; size2_ = m.size2_; data () = m.data (); } return *this; } template // Container assignment without temporary BOOST_UBLAS_INLINE mapped_matrix &operator = (const matrix_container &m) { resize (m ().size1 (), m ().size2 (), false); assign (m); return *this; } BOOST_UBLAS_INLINE mapped_matrix &assign_temporary (mapped_matrix &m) { swap (m); return *this; } template BOOST_UBLAS_INLINE mapped_matrix &operator = (const matrix_expression &ae) { self_type temporary (ae, detail::map_capacity (data ())); return assign_temporary (temporary); } template BOOST_UBLAS_INLINE mapped_matrix &assign (const matrix_expression &ae) { matrix_assign (*this, ae); return *this; } template BOOST_UBLAS_INLINE mapped_matrix& operator += (const matrix_expression &ae) { self_type temporary (*this + ae, detail::map_capacity (data ())); return assign_temporary (temporary); } template // Container assignment without temporary BOOST_UBLAS_INLINE mapped_matrix &operator += (const matrix_container &m) { plus_assign (m); return *this; } template BOOST_UBLAS_INLINE mapped_matrix &plus_assign (const matrix_expression &ae) { matrix_assign (*this, ae); return *this; } template BOOST_UBLAS_INLINE mapped_matrix& operator -= (const matrix_expression &ae) { self_type temporary (*this - ae, detail::map_capacity (data ())); return assign_temporary (temporary); } template // Container assignment without temporary BOOST_UBLAS_INLINE mapped_matrix &operator -= (const matrix_container &m) { minus_assign (m); return *this; } template BOOST_UBLAS_INLINE mapped_matrix &minus_assign (const matrix_expression &ae) { matrix_assign (*this, ae); return *this; } template BOOST_UBLAS_INLINE mapped_matrix& operator *= (const AT &at) { matrix_assign_scalar (*this, at); return *this; } template BOOST_UBLAS_INLINE mapped_matrix& operator /= (const AT &at) { matrix_assign_scalar (*this, at); return *this; } // Swapping BOOST_UBLAS_INLINE void swap (mapped_matrix &m) { if (this != &m) { std::swap (size1_, m.size1_); std::swap (size2_, m.size2_); data ().swap (m.data ()); } } BOOST_UBLAS_INLINE friend void swap (mapped_matrix &m1, mapped_matrix &m2) { m1.swap (m2); } // Iterator types private: // Use storage iterator typedef typename A::const_iterator const_subiterator_type; typedef typename A::iterator subiterator_type; BOOST_UBLAS_INLINE true_reference at_element (size_type i, size_type j) { const size_type element = layout_type::element (i, size1_, j, size2_); subiterator_type it (data ().find (element)); BOOST_UBLAS_CHECK (it != data ().end(), bad_index ()); BOOST_UBLAS_CHECK ((*it).first == element, internal_logic ()); // broken map return it->second; } public: class const_iterator1; class iterator1; class const_iterator2; class iterator2; typedef reverse_iterator_base1 const_reverse_iterator1; typedef reverse_iterator_base1 reverse_iterator1; typedef reverse_iterator_base2 const_reverse_iterator2; typedef reverse_iterator_base2 reverse_iterator2; // Element lookup // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. const_iterator1 find1 (int rank, size_type i, size_type j, int direction = 1) const { const_subiterator_type it (data ().lower_bound (layout_type::address (i, size1_, j, size2_))); const_subiterator_type it_end (data ().end ()); size_type index1 = size_type (-1); size_type index2 = size_type (-1); while (rank == 1 && it != it_end) { index1 = layout_type::index_i ((*it).first, size1_, size2_); index2 = layout_type::index_j ((*it).first, size1_, size2_); if (direction > 0) { if ((index1 >= i && index2 == j) || (i >= size1_)) break; ++ i; } else /* if (direction < 0) */ { if ((index1 <= i && index2 == j) || (i == 0)) break; -- i; } it = data ().lower_bound (layout_type::address (i, size1_, j, size2_)); } if (rank == 1 && index2 != j) { if (direction > 0) i = size1_; else /* if (direction < 0) */ i = 0; rank = 0; } return const_iterator1 (*this, rank, i, j, it); } // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. iterator1 find1 (int rank, size_type i, size_type j, int direction = 1) { subiterator_type it (data ().lower_bound (layout_type::address (i, size1_, j, size2_))); subiterator_type it_end (data ().end ()); size_type index1 = size_type (-1); size_type index2 = size_type (-1); while (rank == 1 && it != it_end) { index1 = layout_type::index_i ((*it).first, size1_, size2_); index2 = layout_type::index_j ((*it).first, size1_, size2_); if (direction > 0) { if ((index1 >= i && index2 == j) || (i >= size1_)) break; ++ i; } else /* if (direction < 0) */ { if ((index1 <= i && index2 == j) || (i == 0)) break; -- i; } it = data ().lower_bound (layout_type::address (i, size1_, j, size2_)); } if (rank == 1 && index2 != j) { if (direction > 0) i = size1_; else /* if (direction < 0) */ i = 0; rank = 0; } return iterator1 (*this, rank, i, j, it); } // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. const_iterator2 find2 (int rank, size_type i, size_type j, int direction = 1) const { const_subiterator_type it (data ().lower_bound (layout_type::address (i, size1_, j, size2_))); const_subiterator_type it_end (data ().end ()); size_type index1 = size_type (-1); size_type index2 = size_type (-1); while (rank == 1 && it != it_end) { index1 = layout_type::index_i ((*it).first, size1_, size2_); index2 = layout_type::index_j ((*it).first, size1_, size2_); if (direction > 0) { if ((index2 >= j && index1 == i) || (j >= size2_)) break; ++ j; } else /* if (direction < 0) */ { if ((index2 <= j && index1 == i) || (j == 0)) break; -- j; } it = data ().lower_bound (layout_type::address (i, size1_, j, size2_)); } if (rank == 1 && index1 != i) { if (direction > 0) j = size2_; else /* if (direction < 0) */ j = 0; rank = 0; } return const_iterator2 (*this, rank, i, j, it); } // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. iterator2 find2 (int rank, size_type i, size_type j, int direction = 1) { subiterator_type it (data ().lower_bound (layout_type::address (i, size1_, j, size2_))); subiterator_type it_end (data ().end ()); size_type index1 = size_type (-1); size_type index2 = size_type (-1); while (rank == 1 && it != it_end) { index1 = layout_type::index_i ((*it).first, size1_, size2_); index2 = layout_type::index_j ((*it).first, size1_, size2_); if (direction > 0) { if ((index2 >= j && index1 == i) || (j >= size2_)) break; ++ j; } else /* if (direction < 0) */ { if ((index2 <= j && index1 == i) || (j == 0)) break; -- j; } it = data ().lower_bound (layout_type::address (i, size1_, j, size2_)); } if (rank == 1 && index1 != i) { if (direction > 0) j = size2_; else /* if (direction < 0) */ j = 0; rank = 0; } return iterator2 (*this, rank, i, j, it); } class const_iterator1: public container_const_reference, public bidirectional_iterator_base { public: typedef typename mapped_matrix::value_type value_type; typedef typename mapped_matrix::difference_type difference_type; typedef typename mapped_matrix::const_reference reference; typedef const typename mapped_matrix::pointer pointer; typedef const_iterator2 dual_iterator_type; typedef const_reverse_iterator2 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE const_iterator1 (): container_const_reference (), rank_ (), i_ (), j_ (), it_ () {} BOOST_UBLAS_INLINE const_iterator1 (const self_type &m, int rank, size_type i, size_type j, const const_subiterator_type &it): container_const_reference (m), rank_ (rank), i_ (i), j_ (j), it_ (it) {} BOOST_UBLAS_INLINE const_iterator1 (const iterator1 &it): container_const_reference (it ()), rank_ (it.rank_), i_ (it.i_), j_ (it.j_), it_ (it.it_) {} // Arithmetic BOOST_UBLAS_INLINE const_iterator1 &operator ++ () { if (rank_ == 1 && layout_type::fast_i ()) ++ it_; else *this = (*this) ().find1 (rank_, index1 () + 1, j_, 1); return *this; } BOOST_UBLAS_INLINE const_iterator1 &operator -- () { if (rank_ == 1 && layout_type::fast_i ()) -- it_; else *this = (*this) ().find1 (rank_, index1 () - 1, j_, -1); return *this; } // Dereference BOOST_UBLAS_INLINE const_reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); if (rank_ == 1) { return (*it_).second; } else { return (*this) () (i_, j_); } } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator2 begin () const { const self_type &m = (*this) (); return m.find2 (1, index1 (), 0); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator2 end () const { const self_type &m = (*this) (); return m.find2 (1, index1 (), m.size2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator2 rbegin () const { return const_reverse_iterator2 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator2 rend () const { return const_reverse_iterator2 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { BOOST_UBLAS_CHECK (*this != (*this) ().find1 (0, (*this) ().size1 (), j_), bad_index ()); if (rank_ == 1) { const self_type &m = (*this) (); BOOST_UBLAS_CHECK (layout_type::index_i ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size1 (), bad_index ()); return layout_type::index_i ((*it_).first, m.size1 (), m.size2 ()); } else { return i_; } } BOOST_UBLAS_INLINE size_type index2 () const { if (rank_ == 1) { const self_type &m = (*this) (); BOOST_UBLAS_CHECK (layout_type::index_j ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size2 (), bad_index ()); return layout_type::index_j ((*it_).first, m.size1 (), m.size2 ()); } else { return j_; } } // Assignment BOOST_UBLAS_INLINE const_iterator1 &operator = (const const_iterator1 &it) { container_const_reference::assign (&it ()); rank_ = it.rank_; i_ = it.i_; j_ = it.j_; it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const const_iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); // BOOST_UBLAS_CHECK (rank_ == it.rank_, internal_logic ()); if (rank_ == 1 || it.rank_ == 1) { return it_ == it.it_; } else { return i_ == it.i_ && j_ == it.j_; } } private: int rank_; size_type i_; size_type j_; const_subiterator_type it_; }; BOOST_UBLAS_INLINE const_iterator1 begin1 () const { return find1 (0, 0, 0); } BOOST_UBLAS_INLINE const_iterator1 end1 () const { return find1 (0, size1_, 0); } class iterator1: public container_reference, public bidirectional_iterator_base { public: typedef typename mapped_matrix::value_type value_type; typedef typename mapped_matrix::difference_type difference_type; typedef typename mapped_matrix::true_reference reference; typedef typename mapped_matrix::pointer pointer; typedef iterator2 dual_iterator_type; typedef reverse_iterator2 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE iterator1 (): container_reference (), rank_ (), i_ (), j_ (), it_ () {} BOOST_UBLAS_INLINE iterator1 (self_type &m, int rank, size_type i, size_type j, const subiterator_type &it): container_reference (m), rank_ (rank), i_ (i), j_ (j), it_ (it) {} // Arithmetic BOOST_UBLAS_INLINE iterator1 &operator ++ () { if (rank_ == 1 && layout_type::fast_i ()) ++ it_; else *this = (*this) ().find1 (rank_, index1 () + 1, j_, 1); return *this; } BOOST_UBLAS_INLINE iterator1 &operator -- () { if (rank_ == 1 && layout_type::fast_i ()) -- it_; else *this = (*this) ().find1 (rank_, index1 () - 1, j_, -1); return *this; } // Dereference BOOST_UBLAS_INLINE reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); if (rank_ == 1) { return (*it_).second; } else { return (*this) ().at_element (i_, j_); } } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator2 begin () const { self_type &m = (*this) (); return m.find2 (1, index1 (), 0); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator2 end () const { self_type &m = (*this) (); return m.find2 (1, index1 (), m.size2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator2 rbegin () const { return reverse_iterator2 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator2 rend () const { return reverse_iterator2 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { BOOST_UBLAS_CHECK (*this != (*this) ().find1 (0, (*this) ().size1 (), j_), bad_index ()); if (rank_ == 1) { const self_type &m = (*this) (); BOOST_UBLAS_CHECK (layout_type::index_i ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size1 (), bad_index ()); return layout_type::index_i ((*it_).first, m.size1 (), m.size2 ()); } else { return i_; } } BOOST_UBLAS_INLINE size_type index2 () const { if (rank_ == 1) { const self_type &m = (*this) (); BOOST_UBLAS_CHECK (layout_type::index_j ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size2 (), bad_index ()); return layout_type::index_j ((*it_).first, m.size1 (), m.size2 ()); } else { return j_; } } // Assignment BOOST_UBLAS_INLINE iterator1 &operator = (const iterator1 &it) { container_reference::assign (&it ()); rank_ = it.rank_; i_ = it.i_; j_ = it.j_; it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); // BOOST_UBLAS_CHECK (rank_ == it.rank_, internal_logic ()); if (rank_ == 1 || it.rank_ == 1) { return it_ == it.it_; } else { return i_ == it.i_ && j_ == it.j_; } } private: int rank_; size_type i_; size_type j_; subiterator_type it_; friend class const_iterator1; }; BOOST_UBLAS_INLINE iterator1 begin1 () { return find1 (0, 0, 0); } BOOST_UBLAS_INLINE iterator1 end1 () { return find1 (0, size1_, 0); } class const_iterator2: public container_const_reference, public bidirectional_iterator_base { public: typedef typename mapped_matrix::value_type value_type; typedef typename mapped_matrix::difference_type difference_type; typedef typename mapped_matrix::const_reference reference; typedef const typename mapped_matrix::pointer pointer; typedef const_iterator1 dual_iterator_type; typedef const_reverse_iterator1 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE const_iterator2 (): container_const_reference (), rank_ (), i_ (), j_ (), it_ () {} BOOST_UBLAS_INLINE const_iterator2 (const self_type &m, int rank, size_type i, size_type j, const const_subiterator_type &it): container_const_reference (m), rank_ (rank), i_ (i), j_ (j), it_ (it) {} BOOST_UBLAS_INLINE const_iterator2 (const iterator2 &it): container_const_reference (it ()), rank_ (it.rank_), i_ (it.i_), j_ (it.j_), it_ (it.it_) {} // Arithmetic BOOST_UBLAS_INLINE const_iterator2 &operator ++ () { if (rank_ == 1 && layout_type::fast_j ()) ++ it_; else *this = (*this) ().find2 (rank_, i_, index2 () + 1, 1); return *this; } BOOST_UBLAS_INLINE const_iterator2 &operator -- () { if (rank_ == 1 && layout_type::fast_j ()) -- it_; else *this = (*this) ().find2 (rank_, i_, index2 () - 1, -1); return *this; } // Dereference BOOST_UBLAS_INLINE const_reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); if (rank_ == 1) { return (*it_).second; } else { return (*this) () (i_, j_); } } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator1 begin () const { const self_type &m = (*this) (); return m.find1 (1, 0, index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator1 end () const { const self_type &m = (*this) (); return m.find1 (1, m.size1 (), index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator1 rbegin () const { return const_reverse_iterator1 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator1 rend () const { return const_reverse_iterator1 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { if (rank_ == 1) { const self_type &m = (*this) (); BOOST_UBLAS_CHECK (layout_type::index_i ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size1 (), bad_index ()); return layout_type::index_i ((*it_).first, m.size1 (), m.size2 ()); } else { return i_; } } BOOST_UBLAS_INLINE size_type index2 () const { BOOST_UBLAS_CHECK (*this != (*this) ().find2 (0, i_, (*this) ().size2 ()), bad_index ()); if (rank_ == 1) { const self_type &m = (*this) (); BOOST_UBLAS_CHECK (layout_type::index_j ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size2 (), bad_index ()); return layout_type::index_j ((*it_).first, m.size1 (), m.size2 ()); } else { return j_; } } // Assignment BOOST_UBLAS_INLINE const_iterator2 &operator = (const const_iterator2 &it) { container_const_reference::assign (&it ()); rank_ = it.rank_; i_ = it.i_; j_ = it.j_; it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const const_iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); // BOOST_UBLAS_CHECK (rank_ == it.rank_, internal_logic ()); if (rank_ == 1 || it.rank_ == 1) { return it_ == it.it_; } else { return i_ == it.i_ && j_ == it.j_; } } private: int rank_; size_type i_; size_type j_; const_subiterator_type it_; }; BOOST_UBLAS_INLINE const_iterator2 begin2 () const { return find2 (0, 0, 0); } BOOST_UBLAS_INLINE const_iterator2 end2 () const { return find2 (0, 0, size2_); } class iterator2: public container_reference, public bidirectional_iterator_base { public: typedef typename mapped_matrix::value_type value_type; typedef typename mapped_matrix::difference_type difference_type; typedef typename mapped_matrix::true_reference reference; typedef typename mapped_matrix::pointer pointer; typedef iterator1 dual_iterator_type; typedef reverse_iterator1 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE iterator2 (): container_reference (), rank_ (), i_ (), j_ (), it_ () {} BOOST_UBLAS_INLINE iterator2 (self_type &m, int rank, size_type i, size_type j, const subiterator_type &it): container_reference (m), rank_ (rank), i_ (i), j_ (j), it_ (it) {} // Arithmetic BOOST_UBLAS_INLINE iterator2 &operator ++ () { if (rank_ == 1 && layout_type::fast_j ()) ++ it_; else *this = (*this) ().find2 (rank_, i_, index2 () + 1, 1); return *this; } BOOST_UBLAS_INLINE iterator2 &operator -- () { if (rank_ == 1 && layout_type::fast_j ()) -- it_; else *this = (*this) ().find2 (rank_, i_, index2 () - 1, -1); return *this; } // Dereference BOOST_UBLAS_INLINE reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); if (rank_ == 1) { return (*it_).second; } else { return (*this) ().at_element (i_, j_); } } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator1 begin () const { self_type &m = (*this) (); return m.find1 (1, 0, index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator1 end () const { self_type &m = (*this) (); return m.find1 (1, m.size1 (), index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator1 rbegin () const { return reverse_iterator1 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator1 rend () const { return reverse_iterator1 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { if (rank_ == 1) { const self_type &m = (*this) (); BOOST_UBLAS_CHECK (layout_type::index_i ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size1 (), bad_index ()); return layout_type::index_i ((*it_).first, m.size1 (), m.size2 ()); } else { return i_; } } BOOST_UBLAS_INLINE size_type index2 () const { BOOST_UBLAS_CHECK (*this != (*this) ().find2 (0, i_, (*this) ().size2 ()), bad_index ()); if (rank_ == 1) { const self_type &m = (*this) (); BOOST_UBLAS_CHECK (layout_type::index_j ((*it_).first, m.size1 (), m.size2 ()) < (*this) ().size2 (), bad_index ()); return layout_type::index_j ((*it_).first, m.size1 (), m.size2 ()); } else { return j_; } } // Assignment BOOST_UBLAS_INLINE iterator2 &operator = (const iterator2 &it) { container_reference::assign (&it ()); rank_ = it.rank_; i_ = it.i_; j_ = it.j_; it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); // BOOST_UBLAS_CHECK (rank_ == it.rank_, internal_logic ()); if (rank_ == 1 || it.rank_ == 1) { return it_ == it.it_; } else { return i_ == it.i_ && j_ == it.j_; } } private: int rank_; size_type i_; size_type j_; subiterator_type it_; friend class const_iterator2; }; BOOST_UBLAS_INLINE iterator2 begin2 () { return find2 (0, 0, 0); } BOOST_UBLAS_INLINE iterator2 end2 () { return find2 (0, 0, size2_); } // Reverse iterators BOOST_UBLAS_INLINE const_reverse_iterator1 rbegin1 () const { return const_reverse_iterator1 (end1 ()); } BOOST_UBLAS_INLINE const_reverse_iterator1 rend1 () const { return const_reverse_iterator1 (begin1 ()); } BOOST_UBLAS_INLINE reverse_iterator1 rbegin1 () { return reverse_iterator1 (end1 ()); } BOOST_UBLAS_INLINE reverse_iterator1 rend1 () { return reverse_iterator1 (begin1 ()); } BOOST_UBLAS_INLINE const_reverse_iterator2 rbegin2 () const { return const_reverse_iterator2 (end2 ()); } BOOST_UBLAS_INLINE const_reverse_iterator2 rend2 () const { return const_reverse_iterator2 (begin2 ()); } BOOST_UBLAS_INLINE reverse_iterator2 rbegin2 () { return reverse_iterator2 (end2 ()); } BOOST_UBLAS_INLINE reverse_iterator2 rend2 () { return reverse_iterator2 (begin2 ()); } // Serialization template void serialize(Archive & ar, const unsigned int /* file_version */){ serialization::collection_size_type s1 (size1_); serialization::collection_size_type s2 (size2_); ar & serialization::make_nvp("size1",s1); ar & serialization::make_nvp("size2",s2); if (Archive::is_loading::value) { size1_ = s1; size2_ = s2; } ar & serialization::make_nvp("data", data_); } private: size_type size1_; size_type size2_; array_type data_; static const value_type zero_; }; template const typename mapped_matrix::value_type mapped_matrix::zero_ = value_type/*zero*/(); // Vector index map based sparse matrix class template class mapped_vector_of_mapped_vector: public matrix_container > { typedef T &true_reference; typedef T *pointer; typedef const T *const_pointer; typedef A array_type; typedef const A const_array_type; typedef L layout_type; typedef mapped_vector_of_mapped_vector self_type; public: #ifdef BOOST_UBLAS_ENABLE_PROXY_SHORTCUTS using matrix_container::operator (); #endif typedef typename A::size_type size_type; typedef typename A::difference_type difference_type; typedef T value_type; typedef const T &const_reference; #ifndef BOOST_UBLAS_STRICT_MATRIX_SPARSE typedef typename detail::map_traits::reference reference; #else typedef sparse_matrix_element reference; #endif typedef const matrix_reference const_closure_type; typedef matrix_reference closure_type; typedef mapped_vector vector_temporary_type; typedef self_type matrix_temporary_type; typedef typename A::value_type::second_type vector_data_value_type; typedef sparse_tag storage_category; typedef typename L::orientation_category orientation_category; // Construction and destruction BOOST_UBLAS_INLINE mapped_vector_of_mapped_vector (): matrix_container (), size1_ (0), size2_ (0), data_ () { data_ [layout_type::size_M (size1_, size2_)] = vector_data_value_type (); } BOOST_UBLAS_INLINE mapped_vector_of_mapped_vector (size_type size1, size_type size2, size_type non_zeros = 0): matrix_container (), size1_ (size1), size2_ (size2), data_ () { data_ [layout_type::size_M (size1_, size2_)] = vector_data_value_type (); } BOOST_UBLAS_INLINE mapped_vector_of_mapped_vector (const mapped_vector_of_mapped_vector &m): matrix_container (), size1_ (m.size1_), size2_ (m.size2_), data_ (m.data_) {} template BOOST_UBLAS_INLINE mapped_vector_of_mapped_vector (const matrix_expression &ae, size_type non_zeros = 0): matrix_container (), size1_ (ae ().size1 ()), size2_ (ae ().size2 ()), data_ () { data_ [layout_type::size_M (size1_, size2_)] = vector_data_value_type (); matrix_assign (*this, ae); } // Accessors BOOST_UBLAS_INLINE size_type size1 () const { return size1_; } BOOST_UBLAS_INLINE size_type size2 () const { return size2_; } BOOST_UBLAS_INLINE size_type nnz_capacity () const { size_type non_zeros = 0; for (vector_const_subiterator_type itv = data_ ().begin (); itv != data_ ().end (); ++ itv) non_zeros += detail::map_capacity (*itv); return non_zeros; } BOOST_UBLAS_INLINE size_type nnz () const { size_type filled = 0; for (vector_const_subiterator_type itv = data_ ().begin (); itv != data_ ().end (); ++ itv) filled += (*itv).size (); return filled; } // Storage accessors BOOST_UBLAS_INLINE const_array_type &data () const { return data_; } BOOST_UBLAS_INLINE array_type &data () { return data_; } // Resizing BOOST_UBLAS_INLINE void resize (size_type size1, size_type size2, bool preserve = true) { // FIXME preserve unimplemented BOOST_UBLAS_CHECK (!preserve, internal_logic ()); size1_ = size1; size2_ = size2; data ().clear (); data () [layout_type::size_M (size1_, size2_)] = vector_data_value_type (); } // Element support BOOST_UBLAS_INLINE pointer find_element (size_type i, size_type j) { return const_cast (const_cast(*this).find_element (i, j)); } BOOST_UBLAS_INLINE const_pointer find_element (size_type i, size_type j) const { const size_type element1 = layout_type::index_M (i, j); const size_type element2 = layout_type::index_m (i, j); vector_const_subiterator_type itv (data ().find (element1)); if (itv == data ().end ()) return 0; BOOST_UBLAS_CHECK ((*itv).first == element1, internal_logic ()); // broken map const_subiterator_type it ((*itv).second.find (element2)); if (it == (*itv).second.end ()) return 0; BOOST_UBLAS_CHECK ((*it).first == element2, internal_logic ()); // broken map return &(*it).second; } // Element access BOOST_UBLAS_INLINE const_reference operator () (size_type i, size_type j) const { const size_type element1 = layout_type::index_M (i, j); const size_type element2 = layout_type::index_m (i, j); vector_const_subiterator_type itv (data ().find (element1)); if (itv == data ().end ()) return zero_; BOOST_UBLAS_CHECK ((*itv).first == element1, internal_logic ()); // broken map const_subiterator_type it ((*itv).second.find (element2)); if (it == (*itv).second.end ()) return zero_; BOOST_UBLAS_CHECK ((*itv).first == element1, internal_logic ()); // broken map return (*it).second; } BOOST_UBLAS_INLINE reference operator () (size_type i, size_type j) { #ifndef BOOST_UBLAS_STRICT_MATRIX_SPARSE const size_type element1 = layout_type::index_M (i, j); const size_type element2 = layout_type::index_m (i, j); vector_data_value_type& vd (data () [element1]); std::pair ii (vd.insert (typename array_type::value_type::second_type::value_type (element2, value_type/*zero*/()))); BOOST_UBLAS_CHECK ((ii.first)->first == element2, internal_logic ()); // broken map return (ii.first)->second; #else return reference (*this, i, j); #endif } // Element assignment BOOST_UBLAS_INLINE true_reference insert_element (size_type i, size_type j, const_reference t) { BOOST_UBLAS_CHECK (!find_element (i, j), bad_index ()); // duplicate element const size_type element1 = layout_type::index_M (i, j); const size_type element2 = layout_type::index_m (i, j); vector_data_value_type& vd (data () [element1]); std::pair ii (vd.insert (typename vector_data_value_type::value_type (element2, t))); BOOST_UBLAS_CHECK ((ii.first)->first == element2, internal_logic ()); // broken map if (!ii.second) // existing element (ii.first)->second = t; return (ii.first)->second; } BOOST_UBLAS_INLINE void erase_element (size_type i, size_type j) { vector_subiterator_type itv (data ().find (layout_type::index_M (i, j))); if (itv == data ().end ()) return; subiterator_type it ((*itv).second.find (layout_type::index_m (i, j))); if (it == (*itv).second.end ()) return; (*itv).second.erase (it); } // Zeroing BOOST_UBLAS_INLINE void clear () { data ().clear (); data_ [layout_type::size_M (size1_, size2_)] = vector_data_value_type (); } // Assignment BOOST_UBLAS_INLINE mapped_vector_of_mapped_vector &operator = (const mapped_vector_of_mapped_vector &m) { if (this != &m) { size1_ = m.size1_; size2_ = m.size2_; data () = m.data (); } return *this; } template // Container assignment without temporary BOOST_UBLAS_INLINE mapped_vector_of_mapped_vector &operator = (const matrix_container &m) { resize (m ().size1 (), m ().size2 (), false); assign (m); return *this; } BOOST_UBLAS_INLINE mapped_vector_of_mapped_vector &assign_temporary (mapped_vector_of_mapped_vector &m) { swap (m); return *this; } template BOOST_UBLAS_INLINE mapped_vector_of_mapped_vector &operator = (const matrix_expression &ae) { self_type temporary (ae); return assign_temporary (temporary); } template BOOST_UBLAS_INLINE mapped_vector_of_mapped_vector &assign (const matrix_expression &ae) { matrix_assign (*this, ae); return *this; } template BOOST_UBLAS_INLINE mapped_vector_of_mapped_vector& operator += (const matrix_expression &ae) { self_type temporary (*this + ae); return assign_temporary (temporary); } template // Container assignment without temporary BOOST_UBLAS_INLINE mapped_vector_of_mapped_vector &operator += (const matrix_container &m) { plus_assign (m); return *this; } template BOOST_UBLAS_INLINE mapped_vector_of_mapped_vector &plus_assign (const matrix_expression &ae) { matrix_assign (*this, ae); return *this; } template BOOST_UBLAS_INLINE mapped_vector_of_mapped_vector& operator -= (const matrix_expression &ae) { self_type temporary (*this - ae); return assign_temporary (temporary); } template // Container assignment without temporary BOOST_UBLAS_INLINE mapped_vector_of_mapped_vector &operator -= (const matrix_container &m) { minus_assign (m); return *this; } template BOOST_UBLAS_INLINE mapped_vector_of_mapped_vector &minus_assign (const matrix_expression &ae) { matrix_assign (*this, ae); return *this; } template BOOST_UBLAS_INLINE mapped_vector_of_mapped_vector& operator *= (const AT &at) { matrix_assign_scalar (*this, at); return *this; } template BOOST_UBLAS_INLINE mapped_vector_of_mapped_vector& operator /= (const AT &at) { matrix_assign_scalar (*this, at); return *this; } // Swapping BOOST_UBLAS_INLINE void swap (mapped_vector_of_mapped_vector &m) { if (this != &m) { std::swap (size1_, m.size1_); std::swap (size2_, m.size2_); data ().swap (m.data ()); } } BOOST_UBLAS_INLINE friend void swap (mapped_vector_of_mapped_vector &m1, mapped_vector_of_mapped_vector &m2) { m1.swap (m2); } // Iterator types private: // Use storage iterators typedef typename A::const_iterator vector_const_subiterator_type; typedef typename A::iterator vector_subiterator_type; typedef typename A::value_type::second_type::const_iterator const_subiterator_type; typedef typename A::value_type::second_type::iterator subiterator_type; BOOST_UBLAS_INLINE true_reference at_element (size_type i, size_type j) { const size_type element1 = layout_type::index_M (i, j); const size_type element2 = layout_type::index_m (i, j); vector_subiterator_type itv (data ().find (element1)); BOOST_UBLAS_CHECK (itv != data ().end(), bad_index ()); BOOST_UBLAS_CHECK ((*itv).first == element1, internal_logic ()); // broken map subiterator_type it ((*itv).second.find (element2)); BOOST_UBLAS_CHECK (it != (*itv).second.end (), bad_index ()); BOOST_UBLAS_CHECK ((*it).first == element2, internal_logic ()); // broken map return it->second; } public: class const_iterator1; class iterator1; class const_iterator2; class iterator2; typedef reverse_iterator_base1 const_reverse_iterator1; typedef reverse_iterator_base1 reverse_iterator1; typedef reverse_iterator_base2 const_reverse_iterator2; typedef reverse_iterator_base2 reverse_iterator2; // Element lookup // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. const_iterator1 find1 (int rank, size_type i, size_type j, int direction = 1) const { BOOST_UBLAS_CHECK (data ().begin () != data ().end (), internal_logic ()); for (;;) { vector_const_subiterator_type itv (data ().lower_bound (layout_type::index_M (i, j))); vector_const_subiterator_type itv_end (data ().end ()); if (itv == itv_end) return const_iterator1 (*this, rank, i, j, itv_end, (*(-- itv)).second.end ()); const_subiterator_type it ((*itv).second.lower_bound (layout_type::index_m (i, j))); const_subiterator_type it_end ((*itv).second.end ()); if (rank == 0) { // advance to the first available major index size_type M = itv->first; size_type m; if (it != it_end) { m = it->first; } else { m = layout_type::size_m(size1_, size2_); } size_type first_i = layout_type::index_M(M,m); return const_iterator1 (*this, rank, first_i, j, itv, it); } if (it != it_end && (*it).first == layout_type::index_m (i, j)) return const_iterator1 (*this, rank, i, j, itv, it); if (direction > 0) { if (layout_type::fast_i ()) { if (it == it_end) return const_iterator1 (*this, rank, i, j, itv, it); i = (*it).first; } else { if (i >= size1_) return const_iterator1 (*this, rank, i, j, itv, it); ++ i; } } else /* if (direction < 0) */ { if (layout_type::fast_i ()) { if (it == (*itv).second.begin ()) return const_iterator1 (*this, rank, i, j, itv, it); -- it; i = (*it).first; } else { if (i == 0) return const_iterator1 (*this, rank, i, j, itv, it); -- i; } } } } // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. iterator1 find1 (int rank, size_type i, size_type j, int direction = 1) { BOOST_UBLAS_CHECK (data ().begin () != data ().end (), internal_logic ()); for (;;) { vector_subiterator_type itv (data ().lower_bound (layout_type::index_M (i, j))); vector_subiterator_type itv_end (data ().end ()); if (itv == itv_end) return iterator1 (*this, rank, i, j, itv_end, (*(-- itv)).second.end ()); subiterator_type it ((*itv).second.lower_bound (layout_type::index_m (i, j))); subiterator_type it_end ((*itv).second.end ()); if (rank == 0) { // advance to the first available major index size_type M = itv->first; size_type m; if (it != it_end) { m = it->first; } else { m = layout_type::size_m(size1_, size2_); } size_type first_i = layout_type::index_M(M,m); return iterator1 (*this, rank, first_i, j, itv, it); } if (it != it_end && (*it).first == layout_type::index_m (i, j)) return iterator1 (*this, rank, i, j, itv, it); if (direction > 0) { if (layout_type::fast_i ()) { if (it == it_end) return iterator1 (*this, rank, i, j, itv, it); i = (*it).first; } else { if (i >= size1_) return iterator1 (*this, rank, i, j, itv, it); ++ i; } } else /* if (direction < 0) */ { if (layout_type::fast_i ()) { if (it == (*itv).second.begin ()) return iterator1 (*this, rank, i, j, itv, it); -- it; i = (*it).first; } else { if (i == 0) return iterator1 (*this, rank, i, j, itv, it); -- i; } } } } // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. const_iterator2 find2 (int rank, size_type i, size_type j, int direction = 1) const { BOOST_UBLAS_CHECK (data ().begin () != data ().end (), internal_logic ()); for (;;) { vector_const_subiterator_type itv (data ().lower_bound (layout_type::index_M (i, j))); vector_const_subiterator_type itv_end (data ().end ()); if (itv == itv_end) return const_iterator2 (*this, rank, i, j, itv_end, (*(-- itv)).second.end ()); const_subiterator_type it ((*itv).second.lower_bound (layout_type::index_m (i, j))); const_subiterator_type it_end ((*itv).second.end ()); if (rank == 0) { // advance to the first available major index size_type M = itv->first; size_type m; if (it != it_end) { m = it->first; } else { m = layout_type::size_m(size1_, size2_); } size_type first_j = layout_type::index_m(M,m); return const_iterator2 (*this, rank, i, first_j, itv, it); } if (it != it_end && (*it).first == layout_type::index_m (i, j)) return const_iterator2 (*this, rank, i, j, itv, it); if (direction > 0) { if (layout_type::fast_j ()) { if (it == it_end) return const_iterator2 (*this, rank, i, j, itv, it); j = (*it).first; } else { if (j >= size2_) return const_iterator2 (*this, rank, i, j, itv, it); ++ j; } } else /* if (direction < 0) */ { if (layout_type::fast_j ()) { if (it == (*itv).second.begin ()) return const_iterator2 (*this, rank, i, j, itv, it); -- it; j = (*it).first; } else { if (j == 0) return const_iterator2 (*this, rank, i, j, itv, it); -- j; } } } } // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. iterator2 find2 (int rank, size_type i, size_type j, int direction = 1) { BOOST_UBLAS_CHECK (data ().begin () != data ().end (), internal_logic ()); for (;;) { vector_subiterator_type itv (data ().lower_bound (layout_type::index_M (i, j))); vector_subiterator_type itv_end (data ().end ()); if (itv == itv_end) return iterator2 (*this, rank, i, j, itv_end, (*(-- itv)).second.end ()); subiterator_type it ((*itv).second.lower_bound (layout_type::index_m (i, j))); subiterator_type it_end ((*itv).second.end ()); if (rank == 0) { // advance to the first available major index size_type M = itv->first; size_type m; if (it != it_end) { m = it->first; } else { m = layout_type::size_m(size1_, size2_); } size_type first_j = layout_type::index_m(M,m); return iterator2 (*this, rank, i, first_j, itv, it); } if (it != it_end && (*it).first == layout_type::index_m (i, j)) return iterator2 (*this, rank, i, j, itv, it); if (direction > 0) { if (layout_type::fast_j ()) { if (it == it_end) return iterator2 (*this, rank, i, j, itv, it); j = (*it).first; } else { if (j >= size2_) return iterator2 (*this, rank, i, j, itv, it); ++ j; } } else /* if (direction < 0) */ { if (layout_type::fast_j ()) { if (it == (*itv).second.begin ()) return iterator2 (*this, rank, i, j, itv, it); -- it; j = (*it).first; } else { if (j == 0) return iterator2 (*this, rank, i, j, itv, it); -- j; } } } } class const_iterator1: public container_const_reference, public bidirectional_iterator_base { public: typedef typename mapped_vector_of_mapped_vector::value_type value_type; typedef typename mapped_vector_of_mapped_vector::difference_type difference_type; typedef typename mapped_vector_of_mapped_vector::const_reference reference; typedef const typename mapped_vector_of_mapped_vector::pointer pointer; typedef const_iterator2 dual_iterator_type; typedef const_reverse_iterator2 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE const_iterator1 (): container_const_reference (), rank_ (), i_ (), j_ (), itv_ (), it_ () {} BOOST_UBLAS_INLINE const_iterator1 (const self_type &m, int rank, size_type i, size_type j, const vector_const_subiterator_type &itv, const const_subiterator_type &it): container_const_reference (m), rank_ (rank), i_ (i), j_ (j), itv_ (itv), it_ (it) {} BOOST_UBLAS_INLINE const_iterator1 (const iterator1 &it): container_const_reference (it ()), rank_ (it.rank_), i_ (it.i_), j_ (it.j_), itv_ (it.itv_), it_ (it.it_) {} // Arithmetic BOOST_UBLAS_INLINE const_iterator1 &operator ++ () { if (rank_ == 1 && layout_type::fast_i ()) ++ it_; else { const self_type &m = (*this) (); if (rank_ == 0) { ++ itv_; i_ = itv_->first; } else { i_ = index1 () + 1; } if (rank_ == 1 && ++ itv_ == m.end1 ().itv_) *this = m.find1 (rank_, i_, j_, 1); else if (rank_ == 1) { it_ = (*itv_).second.begin (); if (it_ == (*itv_).second.end () || index2 () != j_) *this = m.find1 (rank_, i_, j_, 1); } } return *this; } BOOST_UBLAS_INLINE const_iterator1 &operator -- () { if (rank_ == 1 && layout_type::fast_i ()) -- it_; else { const self_type &m = (*this) (); if (rank_ == 0) { -- itv_; i_ = itv_->first; } else { i_ = index1 () - 1; } // FIXME: this expression should never become true! if (rank_ == 1 && -- itv_ == m.end1 ().itv_) *this = m.find1 (rank_, i_, j_, -1); else if (rank_ == 1) { it_ = (*itv_).second.begin (); if (it_ == (*itv_).second.end () || index2 () != j_) *this = m.find1 (rank_, i_, j_, -1); } } return *this; } // Dereference BOOST_UBLAS_INLINE const_reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); if (rank_ == 1) { return (*it_).second; } else { return (*this) () (i_, j_); } } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator2 begin () const { const self_type &m = (*this) (); return m.find2 (1, index1 (), 0); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator2 end () const { const self_type &m = (*this) (); return m.find2 (1, index1 (), m.size2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator2 rbegin () const { return const_reverse_iterator2 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator2 rend () const { return const_reverse_iterator2 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { BOOST_UBLAS_CHECK (*this != (*this) ().find1 (0, (*this) ().size1 (), j_), bad_index ()); if (rank_ == 1) { BOOST_UBLAS_CHECK (layout_type::index_M ((*itv_).first, (*it_).first) < (*this) ().size1 (), bad_index ()); return layout_type::index_M ((*itv_).first, (*it_).first); } else { return i_; } } BOOST_UBLAS_INLINE size_type index2 () const { if (rank_ == 1) { BOOST_UBLAS_CHECK (layout_type::index_m ((*itv_).first, (*it_).first) < (*this) ().size2 (), bad_index ()); return layout_type::index_m ((*itv_).first, (*it_).first); } else { return j_; } } // Assignment BOOST_UBLAS_INLINE const_iterator1 &operator = (const const_iterator1 &it) { container_const_reference::assign (&it ()); rank_ = it.rank_; i_ = it.i_; j_ = it.j_; itv_ = it.itv_; it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const const_iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); // BOOST_UBLAS_CHECK (rank_ == it.rank_, internal_logic ()); if (rank_ == 1 || it.rank_ == 1) { return it_ == it.it_; } else { return i_ == it.i_ && j_ == it.j_; } } private: int rank_; size_type i_; size_type j_; vector_const_subiterator_type itv_; const_subiterator_type it_; }; BOOST_UBLAS_INLINE const_iterator1 begin1 () const { return find1 (0, 0, 0); } BOOST_UBLAS_INLINE const_iterator1 end1 () const { return find1 (0, size1_, 0); } class iterator1: public container_reference, public bidirectional_iterator_base { public: typedef typename mapped_vector_of_mapped_vector::value_type value_type; typedef typename mapped_vector_of_mapped_vector::difference_type difference_type; typedef typename mapped_vector_of_mapped_vector::true_reference reference; typedef typename mapped_vector_of_mapped_vector::pointer pointer; typedef iterator2 dual_iterator_type; typedef reverse_iterator2 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE iterator1 (): container_reference (), rank_ (), i_ (), j_ (), itv_ (), it_ () {} BOOST_UBLAS_INLINE iterator1 (self_type &m, int rank, size_type i, size_type j, const vector_subiterator_type &itv, const subiterator_type &it): container_reference (m), rank_ (rank), i_ (i), j_ (j), itv_ (itv), it_ (it) {} // Arithmetic BOOST_UBLAS_INLINE iterator1 &operator ++ () { if (rank_ == 1 && layout_type::fast_i ()) ++ it_; else { self_type &m = (*this) (); if (rank_ == 0) { ++ itv_; i_ = itv_->first; } else { i_ = index1 () + 1; } if (rank_ == 1 && ++ itv_ == m.end1 ().itv_) *this = m.find1 (rank_, i_, j_, 1); else if (rank_ == 1) { it_ = (*itv_).second.begin (); if (it_ == (*itv_).second.end () || index2 () != j_) *this = m.find1 (rank_, i_, j_, 1); } } return *this; } BOOST_UBLAS_INLINE iterator1 &operator -- () { if (rank_ == 1 && layout_type::fast_i ()) -- it_; else { self_type &m = (*this) (); if (rank_ == 0) { -- itv_; i_ = itv_->first; } else { i_ = index1 () - 1; } // FIXME: this expression should never become true! if (rank_ == 1 && -- itv_ == m.end1 ().itv_) *this = m.find1 (rank_, i_, j_, -1); else if (rank_ == 1) { it_ = (*itv_).second.begin (); if (it_ == (*itv_).second.end () || index2 () != j_) *this = m.find1 (rank_, i_, j_, -1); } } return *this; } // Dereference BOOST_UBLAS_INLINE reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); if (rank_ == 1) { return (*it_).second; } else { return (*this) ().at_element (i_, j_); } } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator2 begin () const { self_type &m = (*this) (); return m.find2 (1, index1 (), 0); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator2 end () const { self_type &m = (*this) (); return m.find2 (1, index1 (), m.size2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator2 rbegin () const { return reverse_iterator2 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator2 rend () const { return reverse_iterator2 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { BOOST_UBLAS_CHECK (*this != (*this) ().find1 (0, (*this) ().size1 (), j_), bad_index ()); if (rank_ == 1) { BOOST_UBLAS_CHECK (layout_type::index_M ((*itv_).first, (*it_).first) < (*this) ().size1 (), bad_index ()); return layout_type::index_M ((*itv_).first, (*it_).first); } else { return i_; } } BOOST_UBLAS_INLINE size_type index2 () const { if (rank_ == 1) { BOOST_UBLAS_CHECK (layout_type::index_m ((*itv_).first, (*it_).first) < (*this) ().size2 (), bad_index ()); return layout_type::index_m ((*itv_).first, (*it_).first); } else { return j_; } } // Assignment BOOST_UBLAS_INLINE iterator1 &operator = (const iterator1 &it) { container_reference::assign (&it ()); rank_ = it.rank_; i_ = it.i_; j_ = it.j_; itv_ = it.itv_; it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); // BOOST_UBLAS_CHECK (rank_ == it.rank_, internal_logic ()); if (rank_ == 1 || it.rank_ == 1) { return it_ == it.it_; } else { return i_ == it.i_ && j_ == it.j_; } } private: int rank_; size_type i_; size_type j_; vector_subiterator_type itv_; subiterator_type it_; friend class const_iterator1; }; BOOST_UBLAS_INLINE iterator1 begin1 () { return find1 (0, 0, 0); } BOOST_UBLAS_INLINE iterator1 end1 () { return find1 (0, size1_, 0); } class const_iterator2: public container_const_reference, public bidirectional_iterator_base { public: typedef typename mapped_vector_of_mapped_vector::value_type value_type; typedef typename mapped_vector_of_mapped_vector::difference_type difference_type; typedef typename mapped_vector_of_mapped_vector::const_reference reference; typedef const typename mapped_vector_of_mapped_vector::pointer pointer; typedef const_iterator1 dual_iterator_type; typedef const_reverse_iterator1 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE const_iterator2 (): container_const_reference (), rank_ (), i_ (), j_ (), itv_ (), it_ () {} BOOST_UBLAS_INLINE const_iterator2 (const self_type &m, int rank, size_type i, size_type j, const vector_const_subiterator_type &itv, const const_subiterator_type &it): container_const_reference (m), rank_ (rank), i_ (i), j_ (j), itv_ (itv), it_ (it) {} BOOST_UBLAS_INLINE const_iterator2 (const iterator2 &it): container_const_reference (it ()), rank_ (it.rank_), i_ (it.i_), j_ (it.j_), itv_ (it.itv_), it_ (it.it_) {} // Arithmetic BOOST_UBLAS_INLINE const_iterator2 &operator ++ () { if (rank_ == 1 && layout_type::fast_j ()) ++ it_; else { const self_type &m = (*this) (); if (rank_ == 0) { ++ itv_; j_ = itv_->first; } else { j_ = index2 () + 1; } if (rank_ == 1 && ++ itv_ == m.end2 ().itv_) *this = m.find2 (rank_, i_, j_, 1); else if (rank_ == 1) { it_ = (*itv_).second.begin (); if (it_ == (*itv_).second.end () || index1 () != i_) *this = m.find2 (rank_, i_, j_, 1); } } return *this; } BOOST_UBLAS_INLINE const_iterator2 &operator -- () { if (rank_ == 1 && layout_type::fast_j ()) -- it_; else { const self_type &m = (*this) (); if (rank_ == 0) { -- itv_; j_ = itv_->first; } else { j_ = index2 () - 1; } // FIXME: this expression should never become true! if (rank_ == 1 && -- itv_ == m.end2 ().itv_) *this = m.find2 (rank_, i_, j_, -1); else if (rank_ == 1) { it_ = (*itv_).second.begin (); if (it_ == (*itv_).second.end () || index1 () != i_) *this = m.find2 (rank_, i_, j_, -1); } } return *this; } // Dereference BOOST_UBLAS_INLINE const_reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); if (rank_ == 1) { return (*it_).second; } else { return (*this) () (i_, j_); } } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator1 begin () const { const self_type &m = (*this) (); return m.find1 (1, 0, index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator1 end () const { const self_type &m = (*this) (); return m.find1 (1, m.size1 (), index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator1 rbegin () const { return const_reverse_iterator1 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator1 rend () const { return const_reverse_iterator1 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { if (rank_ == 1) { BOOST_UBLAS_CHECK (layout_type::index_M ((*itv_).first, (*it_).first) < (*this) ().size1 (), bad_index ()); return layout_type::index_M ((*itv_).first, (*it_).first); } else { return i_; } } BOOST_UBLAS_INLINE size_type index2 () const { BOOST_UBLAS_CHECK (*this != (*this) ().find2 (0, i_, (*this) ().size2 ()), bad_index ()); if (rank_ == 1) { BOOST_UBLAS_CHECK (layout_type::index_m ((*itv_).first, (*it_).first) < (*this) ().size2 (), bad_index ()); return layout_type::index_m ((*itv_).first, (*it_).first); } else { return j_; } } // Assignment BOOST_UBLAS_INLINE const_iterator2 &operator = (const const_iterator2 &it) { container_const_reference::assign (&it ()); rank_ = it.rank_; i_ = it.i_; j_ = it.j_; itv_ = it.itv_; it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const const_iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); // BOOST_UBLAS_CHECK (rank_ == it.rank_, internal_logic ()); if (rank_ == 1 || it.rank_ == 1) { return it_ == it.it_; } else { return i_ == it.i_ && j_ == it.j_; } } private: int rank_; size_type i_; size_type j_; vector_const_subiterator_type itv_; const_subiterator_type it_; }; BOOST_UBLAS_INLINE const_iterator2 begin2 () const { return find2 (0, 0, 0); } BOOST_UBLAS_INLINE const_iterator2 end2 () const { return find2 (0, 0, size2_); } class iterator2: public container_reference, public bidirectional_iterator_base { public: typedef typename mapped_vector_of_mapped_vector::value_type value_type; typedef typename mapped_vector_of_mapped_vector::difference_type difference_type; typedef typename mapped_vector_of_mapped_vector::true_reference reference; typedef typename mapped_vector_of_mapped_vector::pointer pointer; typedef iterator1 dual_iterator_type; typedef reverse_iterator1 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE iterator2 (): container_reference (), rank_ (), i_ (), j_ (), itv_ (), it_ () {} BOOST_UBLAS_INLINE iterator2 (self_type &m, int rank, size_type i, size_type j, const vector_subiterator_type &itv, const subiterator_type &it): container_reference (m), rank_ (rank), i_ (i), j_ (j), itv_ (itv), it_ (it) {} // Arithmetic BOOST_UBLAS_INLINE iterator2 &operator ++ () { if (rank_ == 1 && layout_type::fast_j ()) ++ it_; else { self_type &m = (*this) (); if (rank_ == 0) { ++ itv_; j_ = itv_->first; } else { j_ = index2 () + 1; } if (rank_ == 1 && ++ itv_ == m.end2 ().itv_) *this = m.find2 (rank_, i_, j_, 1); else if (rank_ == 1) { it_ = (*itv_).second.begin (); if (it_ == (*itv_).second.end () || index1 () != i_) *this = m.find2 (rank_, i_, j_, 1); } } return *this; } BOOST_UBLAS_INLINE iterator2 &operator -- () { if (rank_ == 1 && layout_type::fast_j ()) -- it_; else { self_type &m = (*this) (); if (rank_ == 0) { -- itv_; j_ = itv_->first; } else { j_ = index2 () - 1; } // FIXME: this expression should never become true! if (rank_ == 1 && -- itv_ == m.end2 ().itv_) *this = m.find2 (rank_, i_, j_, -1); else if (rank_ == 1) { it_ = (*itv_).second.begin (); if (it_ == (*itv_).second.end () || index1 () != i_) *this = m.find2 (rank_, i_, j_, -1); } } return *this; } // Dereference BOOST_UBLAS_INLINE reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); if (rank_ == 1) { return (*it_).second; } else { return (*this) ().at_element (i_, j_); } } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator1 begin () const { self_type &m = (*this) (); return m.find1 (1, 0, index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator1 end () const { self_type &m = (*this) (); return m.find1 (1, m.size1 (), index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator1 rbegin () const { return reverse_iterator1 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator1 rend () const { return reverse_iterator1 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { if (rank_ == 1) { BOOST_UBLAS_CHECK (layout_type::index_M ((*itv_).first, (*it_).first) < (*this) ().size1 (), bad_index ()); return layout_type::index_M ((*itv_).first, (*it_).first); } else { return i_; } } BOOST_UBLAS_INLINE size_type index2 () const { BOOST_UBLAS_CHECK (*this != (*this) ().find2 (0, i_, (*this) ().size2 ()), bad_index ()); if (rank_ == 1) { BOOST_UBLAS_CHECK (layout_type::index_m ((*itv_).first, (*it_).first) < (*this) ().size2 (), bad_index ()); return layout_type::index_m ((*itv_).first, (*it_).first); } else { return j_; } } // Assignment BOOST_UBLAS_INLINE iterator2 &operator = (const iterator2 &it) { container_reference::assign (&it ()); rank_ = it.rank_; i_ = it.i_; j_ = it.j_; itv_ = it.itv_; it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); // BOOST_UBLAS_CHECK (rank_ == it.rank_, internal_logic ()); if (rank_ == 1 || it.rank_ == 1) { return it_ == it.it_; } else { return i_ == it.i_ && j_ == it.j_; } } private: int rank_; size_type i_; size_type j_; vector_subiterator_type itv_; subiterator_type it_; friend class const_iterator2; }; BOOST_UBLAS_INLINE iterator2 begin2 () { return find2 (0, 0, 0); } BOOST_UBLAS_INLINE iterator2 end2 () { return find2 (0, 0, size2_); } // Reverse iterators BOOST_UBLAS_INLINE const_reverse_iterator1 rbegin1 () const { return const_reverse_iterator1 (end1 ()); } BOOST_UBLAS_INLINE const_reverse_iterator1 rend1 () const { return const_reverse_iterator1 (begin1 ()); } BOOST_UBLAS_INLINE reverse_iterator1 rbegin1 () { return reverse_iterator1 (end1 ()); } BOOST_UBLAS_INLINE reverse_iterator1 rend1 () { return reverse_iterator1 (begin1 ()); } BOOST_UBLAS_INLINE const_reverse_iterator2 rbegin2 () const { return const_reverse_iterator2 (end2 ()); } BOOST_UBLAS_INLINE const_reverse_iterator2 rend2 () const { return const_reverse_iterator2 (begin2 ()); } BOOST_UBLAS_INLINE reverse_iterator2 rbegin2 () { return reverse_iterator2 (end2 ()); } BOOST_UBLAS_INLINE reverse_iterator2 rend2 () { return reverse_iterator2 (begin2 ()); } // Serialization template void serialize(Archive & ar, const unsigned int /* file_version */){ serialization::collection_size_type s1 (size1_); serialization::collection_size_type s2 (size2_); ar & serialization::make_nvp("size1",s1); ar & serialization::make_nvp("size2",s2); if (Archive::is_loading::value) { size1_ = s1; size2_ = s2; } ar & serialization::make_nvp("data", data_); } private: size_type size1_; size_type size2_; array_type data_; static const value_type zero_; }; template const typename mapped_vector_of_mapped_vector::value_type mapped_vector_of_mapped_vector::zero_ = value_type/*zero*/(); // Comperssed array based sparse matrix class // Thanks to Kresimir Fresl for extending this to cover different index bases. template class compressed_matrix: public matrix_container > { typedef T &true_reference; typedef T *pointer; typedef const T *const_pointer; typedef L layout_type; typedef compressed_matrix self_type; public: #ifdef BOOST_UBLAS_ENABLE_PROXY_SHORTCUTS using matrix_container::operator (); #endif // ISSUE require type consistency check // is_convertable (IA::size_type, TA::size_type) typedef typename IA::value_type size_type; // size_type for the data arrays. typedef typename IA::size_type array_size_type; // FIXME difference type for sparse storage iterators should it be in the container? typedef typename IA::difference_type difference_type; typedef T value_type; typedef const T &const_reference; #ifndef BOOST_UBLAS_STRICT_MATRIX_SPARSE typedef T &reference; #else typedef sparse_matrix_element reference; #endif typedef IA index_array_type; typedef TA value_array_type; typedef const matrix_reference const_closure_type; typedef matrix_reference closure_type; typedef compressed_vector vector_temporary_type; typedef self_type matrix_temporary_type; typedef sparse_tag storage_category; typedef typename L::orientation_category orientation_category; // Construction and destruction BOOST_UBLAS_INLINE compressed_matrix (): matrix_container (), size1_ (0), size2_ (0), capacity_ (restrict_capacity (0)), filled1_ (1), filled2_ (0), index1_data_ (layout_type::size_M (size1_, size2_) + 1), index2_data_ (capacity_), value_data_ (capacity_) { index1_data_ [filled1_ - 1] = k_based (filled2_); storage_invariants (); } BOOST_UBLAS_INLINE compressed_matrix (size_type size1, size_type size2, size_type non_zeros = 0): matrix_container (), size1_ (size1), size2_ (size2), capacity_ (restrict_capacity (non_zeros)), filled1_ (1), filled2_ (0), index1_data_ (layout_type::size_M (size1_, size2_) + 1), index2_data_ (capacity_), value_data_ (capacity_) { index1_data_ [filled1_ - 1] = k_based (filled2_); storage_invariants (); } BOOST_UBLAS_INLINE compressed_matrix (const compressed_matrix &m): matrix_container (), size1_ (m.size1_), size2_ (m.size2_), capacity_ (m.capacity_), filled1_ (m.filled1_), filled2_ (m.filled2_), index1_data_ (m.index1_data_), index2_data_ (m.index2_data_), value_data_ (m.value_data_) { storage_invariants (); } BOOST_UBLAS_INLINE compressed_matrix (const coordinate_matrix &m): matrix_container (), size1_ (m.size1()), size2_ (m.size2()), index1_data_ (layout_type::size_M (size1_, size2_) + 1) { m.sort(); reserve(m.nnz(), false); filled2_ = m.nnz(); const_subiterator_type i_start = m.index1_data().begin(); const_subiterator_type i_end = (i_start + filled2_); const_subiterator_type i = i_start; size_type r = 1; for (; (r < layout_type::size_M (size1_, size2_)) && (i != i_end); ++r) { i = std::lower_bound(i, i_end, r); index1_data_[r] = k_based( i - i_start ); } filled1_ = r + 1; std::copy( m.index2_data().begin(), m.index2_data().begin() + filled2_, index2_data_.begin()); std::copy( m.value_data().begin(), m.value_data().begin() + filled2_, value_data_.begin()); index1_data_ [filled1_ - 1] = k_based(filled2_); storage_invariants (); } template BOOST_UBLAS_INLINE compressed_matrix (const matrix_expression &ae, size_type non_zeros = 0): matrix_container (), size1_ (ae ().size1 ()), size2_ (ae ().size2 ()), capacity_ (restrict_capacity (non_zeros)), filled1_ (1), filled2_ (0), index1_data_ (layout_type::size_M (ae ().size1 (), ae ().size2 ()) + 1), index2_data_ (capacity_), value_data_ (capacity_) { index1_data_ [filled1_ - 1] = k_based (filled2_); storage_invariants (); matrix_assign (*this, ae); } // Accessors BOOST_UBLAS_INLINE size_type size1 () const { return size1_; } BOOST_UBLAS_INLINE size_type size2 () const { return size2_; } BOOST_UBLAS_INLINE size_type nnz_capacity () const { return capacity_; } BOOST_UBLAS_INLINE size_type nnz () const { return filled2_; } // Storage accessors BOOST_UBLAS_INLINE static size_type index_base () { return IB; } BOOST_UBLAS_INLINE array_size_type filled1 () const { return filled1_; } BOOST_UBLAS_INLINE array_size_type filled2 () const { return filled2_; } BOOST_UBLAS_INLINE const index_array_type &index1_data () const { return index1_data_; } BOOST_UBLAS_INLINE const index_array_type &index2_data () const { return index2_data_; } BOOST_UBLAS_INLINE const value_array_type &value_data () const { return value_data_; } BOOST_UBLAS_INLINE void set_filled (const array_size_type& filled1, const array_size_type& filled2) { filled1_ = filled1; filled2_ = filled2; storage_invariants (); } BOOST_UBLAS_INLINE index_array_type &index1_data () { return index1_data_; } BOOST_UBLAS_INLINE index_array_type &index2_data () { return index2_data_; } BOOST_UBLAS_INLINE value_array_type &value_data () { return value_data_; } BOOST_UBLAS_INLINE void complete_index1_data () { while (filled1_ <= layout_type::size_M (size1_, size2_)) { this->index1_data_ [filled1_] = k_based (filled2_); ++ this->filled1_; } } // Resizing private: BOOST_UBLAS_INLINE size_type restrict_capacity (size_type non_zeros) const { non_zeros = (std::max) (non_zeros, (std::min) (size1_, size2_)); // Guarding against overflow - Thanks to Alexei Novakov for the hint. // non_zeros = (std::min) (non_zeros, size1_ * size2_); if (size1_ > 0 && non_zeros / size1_ >= size2_) non_zeros = size1_ * size2_; return non_zeros; } public: BOOST_UBLAS_INLINE void resize (size_type size1, size_type size2, bool preserve = true) { // FIXME preserve unimplemented BOOST_UBLAS_CHECK (!preserve, internal_logic ()); size1_ = size1; size2_ = size2; capacity_ = restrict_capacity (capacity_); filled1_ = 1; filled2_ = 0; index1_data_.resize (layout_type::size_M (size1_, size2_) + 1); index2_data_.resize (capacity_); value_data_.resize (capacity_); index1_data_ [filled1_ - 1] = k_based (filled2_); storage_invariants (); } // Reserving BOOST_UBLAS_INLINE void reserve (size_type non_zeros, bool preserve = true) { capacity_ = restrict_capacity (non_zeros); if (preserve) { index2_data_.resize (capacity_, size_type ()); value_data_.resize (capacity_, value_type ()); filled2_ = (std::min) (capacity_, filled2_); } else { index2_data_.resize (capacity_); value_data_.resize (capacity_); filled1_ = 1; filled2_ = 0; index1_data_ [filled1_ - 1] = k_based (filled2_); } storage_invariants (); } // Element support BOOST_UBLAS_INLINE pointer find_element (size_type i, size_type j) { return const_cast (const_cast(*this).find_element (i, j)); } BOOST_UBLAS_INLINE const_pointer find_element (size_type i, size_type j) const { size_type element1 (layout_type::index_M (i, j)); size_type element2 (layout_type::index_m (i, j)); if (filled1_ <= element1 + 1) return 0; vector_const_subiterator_type itv (index1_data_.begin () + element1); const_subiterator_type it_begin (index2_data_.begin () + zero_based (*itv)); const_subiterator_type it_end (index2_data_.begin () + zero_based (*(itv + 1))); const_subiterator_type it (detail::lower_bound (it_begin, it_end, k_based (element2), std::less ())); if (it == it_end || *it != k_based (element2)) return 0; return &value_data_ [it - index2_data_.begin ()]; } // Element access BOOST_UBLAS_INLINE const_reference operator () (size_type i, size_type j) const { const_pointer p = find_element (i, j); if (p) return *p; else return zero_; } BOOST_UBLAS_INLINE reference operator () (size_type i, size_type j) { #ifndef BOOST_UBLAS_STRICT_MATRIX_SPARSE size_type element1 (layout_type::index_M (i, j)); size_type element2 (layout_type::index_m (i, j)); if (filled1_ <= element1 + 1) return insert_element (i, j, value_type/*zero*/()); pointer p = find_element (i, j); if (p) return *p; else return insert_element (i, j, value_type/*zero*/()); #else return reference (*this, i, j); #endif } // Element assignment BOOST_UBLAS_INLINE true_reference insert_element (size_type i, size_type j, const_reference t) { BOOST_UBLAS_CHECK (!find_element (i, j), bad_index ()); // duplicate element if (filled2_ >= capacity_) reserve (2 * filled2_, true); BOOST_UBLAS_CHECK (filled2_ < capacity_, internal_logic ()); size_type element1 = layout_type::index_M (i, j); size_type element2 = layout_type::index_m (i, j); while (filled1_ <= element1 + 1) { index1_data_ [filled1_] = k_based (filled2_); ++ filled1_; } vector_subiterator_type itv (index1_data_.begin () + element1); subiterator_type it_begin (index2_data_.begin () + zero_based (*itv)); subiterator_type it_end (index2_data_.begin () + zero_based (*(itv + 1))); subiterator_type it (detail::lower_bound (it_begin, it_end, k_based (element2), std::less ())); typename std::iterator_traits::difference_type n = it - index2_data_.begin (); BOOST_UBLAS_CHECK (it == it_end || *it != k_based (element2), internal_logic ()); // duplicate bound by lower_bound ++ filled2_; it = index2_data_.begin () + n; std::copy_backward (it, index2_data_.begin () + filled2_ - 1, index2_data_.begin () + filled2_); *it = k_based (element2); typename value_array_type::iterator itt (value_data_.begin () + n); std::copy_backward (itt, value_data_.begin () + filled2_ - 1, value_data_.begin () + filled2_); *itt = t; while (element1 + 1 < filled1_) { ++ index1_data_ [element1 + 1]; ++ element1; } storage_invariants (); return *itt; } BOOST_UBLAS_INLINE void erase_element (size_type i, size_type j) { size_type element1 = layout_type::index_M (i, j); size_type element2 = layout_type::index_m (i, j); if (element1 + 1 >= filled1_) return; vector_subiterator_type itv (index1_data_.begin () + element1); subiterator_type it_begin (index2_data_.begin () + zero_based (*itv)); subiterator_type it_end (index2_data_.begin () + zero_based (*(itv + 1))); subiterator_type it (detail::lower_bound (it_begin, it_end, k_based (element2), std::less ())); if (it != it_end && *it == k_based (element2)) { typename std::iterator_traits::difference_type n = it - index2_data_.begin (); std::copy (it + 1, index2_data_.begin () + filled2_, it); typename value_array_type::iterator itt (value_data_.begin () + n); std::copy (itt + 1, value_data_.begin () + filled2_, itt); -- filled2_; while (index1_data_ [filled1_ - 2] > k_based (filled2_)) { index1_data_ [filled1_ - 1] = 0; -- filled1_; } while (element1 + 1 < filled1_) { -- index1_data_ [element1 + 1]; ++ element1; } } storage_invariants (); } // Zeroing BOOST_UBLAS_INLINE void clear () { filled1_ = 1; filled2_ = 0; index1_data_ [filled1_ - 1] = k_based (filled2_); storage_invariants (); } // Assignment BOOST_UBLAS_INLINE compressed_matrix &operator = (const compressed_matrix &m) { if (this != &m) { size1_ = m.size1_; size2_ = m.size2_; capacity_ = m.capacity_; filled1_ = m.filled1_; filled2_ = m.filled2_; index1_data_ = m.index1_data_; index2_data_ = m.index2_data_; value_data_ = m.value_data_; } storage_invariants (); return *this; } template // Container assignment without temporary BOOST_UBLAS_INLINE compressed_matrix &operator = (const matrix_container &m) { resize (m ().size1 (), m ().size2 (), false); assign (m); return *this; } BOOST_UBLAS_INLINE compressed_matrix &assign_temporary (compressed_matrix &m) { swap (m); return *this; } template BOOST_UBLAS_INLINE compressed_matrix &operator = (const matrix_expression &ae) { self_type temporary (ae, capacity_); return assign_temporary (temporary); } template BOOST_UBLAS_INLINE compressed_matrix &assign (const matrix_expression &ae) { matrix_assign (*this, ae); return *this; } template BOOST_UBLAS_INLINE compressed_matrix& operator += (const matrix_expression &ae) { self_type temporary (*this + ae, capacity_); return assign_temporary (temporary); } template // Container assignment without temporary BOOST_UBLAS_INLINE compressed_matrix &operator += (const matrix_container &m) { plus_assign (m); return *this; } template BOOST_UBLAS_INLINE compressed_matrix &plus_assign (const matrix_expression &ae) { matrix_assign (*this, ae); return *this; } template BOOST_UBLAS_INLINE compressed_matrix& operator -= (const matrix_expression &ae) { self_type temporary (*this - ae, capacity_); return assign_temporary (temporary); } template // Container assignment without temporary BOOST_UBLAS_INLINE compressed_matrix &operator -= (const matrix_container &m) { minus_assign (m); return *this; } template BOOST_UBLAS_INLINE compressed_matrix &minus_assign (const matrix_expression &ae) { matrix_assign (*this, ae); return *this; } template BOOST_UBLAS_INLINE compressed_matrix& operator *= (const AT &at) { matrix_assign_scalar (*this, at); return *this; } template BOOST_UBLAS_INLINE compressed_matrix& operator /= (const AT &at) { matrix_assign_scalar (*this, at); return *this; } // Swapping BOOST_UBLAS_INLINE void swap (compressed_matrix &m) { if (this != &m) { std::swap (size1_, m.size1_); std::swap (size2_, m.size2_); std::swap (capacity_, m.capacity_); std::swap (filled1_, m.filled1_); std::swap (filled2_, m.filled2_); index1_data_.swap (m.index1_data_); index2_data_.swap (m.index2_data_); value_data_.swap (m.value_data_); } storage_invariants (); } BOOST_UBLAS_INLINE friend void swap (compressed_matrix &m1, compressed_matrix &m2) { m1.swap (m2); } // Back element insertion and erasure BOOST_UBLAS_INLINE void push_back (size_type i, size_type j, const_reference t) { if (filled2_ >= capacity_) reserve (2 * filled2_, true); BOOST_UBLAS_CHECK (filled2_ < capacity_, internal_logic ()); size_type element1 = layout_type::index_M (i, j); size_type element2 = layout_type::index_m (i, j); while (filled1_ < element1 + 2) { index1_data_ [filled1_] = k_based (filled2_); ++ filled1_; } // must maintain sort order BOOST_UBLAS_CHECK ((filled1_ == element1 + 2 && (filled2_ == zero_based (index1_data_ [filled1_ - 2]) || index2_data_ [filled2_ - 1] < k_based (element2))), external_logic ()); ++ filled2_; index1_data_ [filled1_ - 1] = k_based (filled2_); index2_data_ [filled2_ - 1] = k_based (element2); value_data_ [filled2_ - 1] = t; storage_invariants (); } BOOST_UBLAS_INLINE void pop_back () { BOOST_UBLAS_CHECK (filled1_ > 0 && filled2_ > 0, external_logic ()); -- filled2_; while (index1_data_ [filled1_ - 2] > k_based (filled2_)) { index1_data_ [filled1_ - 1] = 0; -- filled1_; } -- index1_data_ [filled1_ - 1]; storage_invariants (); } // Iterator types private: // Use index array iterator typedef typename IA::const_iterator vector_const_subiterator_type; typedef typename IA::iterator vector_subiterator_type; typedef typename IA::const_iterator const_subiterator_type; typedef typename IA::iterator subiterator_type; BOOST_UBLAS_INLINE true_reference at_element (size_type i, size_type j) { pointer p = find_element (i, j); BOOST_UBLAS_CHECK (p, bad_index ()); return *p; } public: class const_iterator1; class iterator1; class const_iterator2; class iterator2; typedef reverse_iterator_base1 const_reverse_iterator1; typedef reverse_iterator_base1 reverse_iterator1; typedef reverse_iterator_base2 const_reverse_iterator2; typedef reverse_iterator_base2 reverse_iterator2; // Element lookup // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. const_iterator1 find1 (int rank, size_type i, size_type j, int direction = 1) const { for (;;) { array_size_type address1 (layout_type::index_M (i, j)); array_size_type address2 (layout_type::index_m (i, j)); vector_const_subiterator_type itv (index1_data_.begin () + (std::min) (filled1_ - 1, address1)); if (filled1_ <= address1 + 1) return const_iterator1 (*this, rank, i, j, itv, index2_data_.begin () + filled2_); const_subiterator_type it_begin (index2_data_.begin () + zero_based (*itv)); const_subiterator_type it_end (index2_data_.begin () + zero_based (*(itv + 1))); const_subiterator_type it (detail::lower_bound (it_begin, it_end, k_based (address2), std::less ())); if (rank == 0) return const_iterator1 (*this, rank, i, j, itv, it); if (it != it_end && zero_based (*it) == address2) return const_iterator1 (*this, rank, i, j, itv, it); if (direction > 0) { if (layout_type::fast_i ()) { if (it == it_end) return const_iterator1 (*this, rank, i, j, itv, it); i = zero_based (*it); } else { if (i >= size1_) return const_iterator1 (*this, rank, i, j, itv, it); ++ i; } } else /* if (direction < 0) */ { if (layout_type::fast_i ()) { if (it == index2_data_.begin () + zero_based (*itv)) return const_iterator1 (*this, rank, i, j, itv, it); i = zero_based (*(it - 1)); } else { if (i == 0) return const_iterator1 (*this, rank, i, j, itv, it); -- i; } } } } // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. iterator1 find1 (int rank, size_type i, size_type j, int direction = 1) { for (;;) { array_size_type address1 (layout_type::index_M (i, j)); array_size_type address2 (layout_type::index_m (i, j)); vector_subiterator_type itv (index1_data_.begin () + (std::min) (filled1_ - 1, address1)); if (filled1_ <= address1 + 1) return iterator1 (*this, rank, i, j, itv, index2_data_.begin () + filled2_); subiterator_type it_begin (index2_data_.begin () + zero_based (*itv)); subiterator_type it_end (index2_data_.begin () + zero_based (*(itv + 1))); subiterator_type it (detail::lower_bound (it_begin, it_end, k_based (address2), std::less ())); if (rank == 0) return iterator1 (*this, rank, i, j, itv, it); if (it != it_end && zero_based (*it) == address2) return iterator1 (*this, rank, i, j, itv, it); if (direction > 0) { if (layout_type::fast_i ()) { if (it == it_end) return iterator1 (*this, rank, i, j, itv, it); i = zero_based (*it); } else { if (i >= size1_) return iterator1 (*this, rank, i, j, itv, it); ++ i; } } else /* if (direction < 0) */ { if (layout_type::fast_i ()) { if (it == index2_data_.begin () + zero_based (*itv)) return iterator1 (*this, rank, i, j, itv, it); i = zero_based (*(it - 1)); } else { if (i == 0) return iterator1 (*this, rank, i, j, itv, it); -- i; } } } } // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. const_iterator2 find2 (int rank, size_type i, size_type j, int direction = 1) const { for (;;) { array_size_type address1 (layout_type::index_M (i, j)); array_size_type address2 (layout_type::index_m (i, j)); vector_const_subiterator_type itv (index1_data_.begin () + (std::min) (filled1_ - 1, address1)); if (filled1_ <= address1 + 1) return const_iterator2 (*this, rank, i, j, itv, index2_data_.begin () + filled2_); const_subiterator_type it_begin (index2_data_.begin () + zero_based (*itv)); const_subiterator_type it_end (index2_data_.begin () + zero_based (*(itv + 1))); const_subiterator_type it (detail::lower_bound (it_begin, it_end, k_based (address2), std::less ())); if (rank == 0) return const_iterator2 (*this, rank, i, j, itv, it); if (it != it_end && zero_based (*it) == address2) return const_iterator2 (*this, rank, i, j, itv, it); if (direction > 0) { if (layout_type::fast_j ()) { if (it == it_end) return const_iterator2 (*this, rank, i, j, itv, it); j = zero_based (*it); } else { if (j >= size2_) return const_iterator2 (*this, rank, i, j, itv, it); ++ j; } } else /* if (direction < 0) */ { if (layout_type::fast_j ()) { if (it == index2_data_.begin () + zero_based (*itv)) return const_iterator2 (*this, rank, i, j, itv, it); j = zero_based (*(it - 1)); } else { if (j == 0) return const_iterator2 (*this, rank, i, j, itv, it); -- j; } } } } // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. iterator2 find2 (int rank, size_type i, size_type j, int direction = 1) { for (;;) { array_size_type address1 (layout_type::index_M (i, j)); array_size_type address2 (layout_type::index_m (i, j)); vector_subiterator_type itv (index1_data_.begin () + (std::min) (filled1_ - 1, address1)); if (filled1_ <= address1 + 1) return iterator2 (*this, rank, i, j, itv, index2_data_.begin () + filled2_); subiterator_type it_begin (index2_data_.begin () + zero_based (*itv)); subiterator_type it_end (index2_data_.begin () + zero_based (*(itv + 1))); subiterator_type it (detail::lower_bound (it_begin, it_end, k_based (address2), std::less ())); if (rank == 0) return iterator2 (*this, rank, i, j, itv, it); if (it != it_end && zero_based (*it) == address2) return iterator2 (*this, rank, i, j, itv, it); if (direction > 0) { if (layout_type::fast_j ()) { if (it == it_end) return iterator2 (*this, rank, i, j, itv, it); j = zero_based (*it); } else { if (j >= size2_) return iterator2 (*this, rank, i, j, itv, it); ++ j; } } else /* if (direction < 0) */ { if (layout_type::fast_j ()) { if (it == index2_data_.begin () + zero_based (*itv)) return iterator2 (*this, rank, i, j, itv, it); j = zero_based (*(it - 1)); } else { if (j == 0) return iterator2 (*this, rank, i, j, itv, it); -- j; } } } } class const_iterator1: public container_const_reference, public bidirectional_iterator_base { public: typedef typename compressed_matrix::value_type value_type; typedef typename compressed_matrix::difference_type difference_type; typedef typename compressed_matrix::const_reference reference; typedef const typename compressed_matrix::pointer pointer; typedef const_iterator2 dual_iterator_type; typedef const_reverse_iterator2 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE const_iterator1 (): container_const_reference (), rank_ (), i_ (), j_ (), itv_ (), it_ () {} BOOST_UBLAS_INLINE const_iterator1 (const self_type &m, int rank, size_type i, size_type j, const vector_const_subiterator_type &itv, const const_subiterator_type &it): container_const_reference (m), rank_ (rank), i_ (i), j_ (j), itv_ (itv), it_ (it) {} BOOST_UBLAS_INLINE const_iterator1 (const iterator1 &it): container_const_reference (it ()), rank_ (it.rank_), i_ (it.i_), j_ (it.j_), itv_ (it.itv_), it_ (it.it_) {} // Arithmetic BOOST_UBLAS_INLINE const_iterator1 &operator ++ () { if (rank_ == 1 && layout_type::fast_i ()) ++ it_; else { i_ = index1 () + 1; if (rank_ == 1) *this = (*this) ().find1 (rank_, i_, j_, 1); } return *this; } BOOST_UBLAS_INLINE const_iterator1 &operator -- () { if (rank_ == 1 && layout_type::fast_i ()) -- it_; else { --i_; if (rank_ == 1) *this = (*this) ().find1 (rank_, i_, j_, -1); } return *this; } // Dereference BOOST_UBLAS_INLINE const_reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); if (rank_ == 1) { return (*this) ().value_data_ [it_ - (*this) ().index2_data_.begin ()]; } else { return (*this) () (i_, j_); } } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator2 begin () const { const self_type &m = (*this) (); return m.find2 (1, index1 (), 0); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator2 end () const { const self_type &m = (*this) (); return m.find2 (1, index1 (), m.size2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator2 rbegin () const { return const_reverse_iterator2 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator2 rend () const { return const_reverse_iterator2 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { BOOST_UBLAS_CHECK (*this != (*this) ().find1 (0, (*this) ().size1 (), j_), bad_index ()); if (rank_ == 1) { BOOST_UBLAS_CHECK (layout_type::index_M (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)) < (*this) ().size1 (), bad_index ()); return layout_type::index_M (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)); } else { return i_; } } BOOST_UBLAS_INLINE size_type index2 () const { if (rank_ == 1) { BOOST_UBLAS_CHECK (layout_type::index_m (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)) < (*this) ().size2 (), bad_index ()); return layout_type::index_m (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)); } else { return j_; } } // Assignment BOOST_UBLAS_INLINE const_iterator1 &operator = (const const_iterator1 &it) { container_const_reference::assign (&it ()); rank_ = it.rank_; i_ = it.i_; j_ = it.j_; itv_ = it.itv_; it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const const_iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); // BOOST_UBLAS_CHECK (rank_ == it.rank_, internal_logic ()); if (rank_ == 1 || it.rank_ == 1) { return it_ == it.it_; } else { return i_ == it.i_ && j_ == it.j_; } } private: int rank_; size_type i_; size_type j_; vector_const_subiterator_type itv_; const_subiterator_type it_; }; BOOST_UBLAS_INLINE const_iterator1 begin1 () const { return find1 (0, 0, 0); } BOOST_UBLAS_INLINE const_iterator1 end1 () const { return find1 (0, size1_, 0); } class iterator1: public container_reference, public bidirectional_iterator_base { public: typedef typename compressed_matrix::value_type value_type; typedef typename compressed_matrix::difference_type difference_type; typedef typename compressed_matrix::true_reference reference; typedef typename compressed_matrix::pointer pointer; typedef iterator2 dual_iterator_type; typedef reverse_iterator2 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE iterator1 (): container_reference (), rank_ (), i_ (), j_ (), itv_ (), it_ () {} BOOST_UBLAS_INLINE iterator1 (self_type &m, int rank, size_type i, size_type j, const vector_subiterator_type &itv, const subiterator_type &it): container_reference (m), rank_ (rank), i_ (i), j_ (j), itv_ (itv), it_ (it) {} // Arithmetic BOOST_UBLAS_INLINE iterator1 &operator ++ () { if (rank_ == 1 && layout_type::fast_i ()) ++ it_; else { i_ = index1 () + 1; if (rank_ == 1) *this = (*this) ().find1 (rank_, i_, j_, 1); } return *this; } BOOST_UBLAS_INLINE iterator1 &operator -- () { if (rank_ == 1 && layout_type::fast_i ()) -- it_; else { --i_; if (rank_ == 1) *this = (*this) ().find1 (rank_, i_, j_, -1); } return *this; } // Dereference BOOST_UBLAS_INLINE reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); if (rank_ == 1) { return (*this) ().value_data_ [it_ - (*this) ().index2_data_.begin ()]; } else { return (*this) ().at_element (i_, j_); } } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator2 begin () const { self_type &m = (*this) (); return m.find2 (1, index1 (), 0); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator2 end () const { self_type &m = (*this) (); return m.find2 (1, index1 (), m.size2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator2 rbegin () const { return reverse_iterator2 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator2 rend () const { return reverse_iterator2 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { BOOST_UBLAS_CHECK (*this != (*this) ().find1 (0, (*this) ().size1 (), j_), bad_index ()); if (rank_ == 1) { BOOST_UBLAS_CHECK (layout_type::index_M (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)) < (*this) ().size1 (), bad_index ()); return layout_type::index_M (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)); } else { return i_; } } BOOST_UBLAS_INLINE size_type index2 () const { if (rank_ == 1) { BOOST_UBLAS_CHECK (layout_type::index_m (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)) < (*this) ().size2 (), bad_index ()); return layout_type::index_m (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)); } else { return j_; } } // Assignment BOOST_UBLAS_INLINE iterator1 &operator = (const iterator1 &it) { container_reference::assign (&it ()); rank_ = it.rank_; i_ = it.i_; j_ = it.j_; itv_ = it.itv_; it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); // BOOST_UBLAS_CHECK (rank_ == it.rank_, internal_logic ()); if (rank_ == 1 || it.rank_ == 1) { return it_ == it.it_; } else { return i_ == it.i_ && j_ == it.j_; } } private: int rank_; size_type i_; size_type j_; vector_subiterator_type itv_; subiterator_type it_; friend class const_iterator1; }; BOOST_UBLAS_INLINE iterator1 begin1 () { return find1 (0, 0, 0); } BOOST_UBLAS_INLINE iterator1 end1 () { return find1 (0, size1_, 0); } class const_iterator2: public container_const_reference, public bidirectional_iterator_base { public: typedef typename compressed_matrix::value_type value_type; typedef typename compressed_matrix::difference_type difference_type; typedef typename compressed_matrix::const_reference reference; typedef const typename compressed_matrix::pointer pointer; typedef const_iterator1 dual_iterator_type; typedef const_reverse_iterator1 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE const_iterator2 (): container_const_reference (), rank_ (), i_ (), j_ (), itv_ (), it_ () {} BOOST_UBLAS_INLINE const_iterator2 (const self_type &m, int rank, size_type i, size_type j, const vector_const_subiterator_type itv, const const_subiterator_type &it): container_const_reference (m), rank_ (rank), i_ (i), j_ (j), itv_ (itv), it_ (it) {} BOOST_UBLAS_INLINE const_iterator2 (const iterator2 &it): container_const_reference (it ()), rank_ (it.rank_), i_ (it.i_), j_ (it.j_), itv_ (it.itv_), it_ (it.it_) {} // Arithmetic BOOST_UBLAS_INLINE const_iterator2 &operator ++ () { if (rank_ == 1 && layout_type::fast_j ()) ++ it_; else { j_ = index2 () + 1; if (rank_ == 1) *this = (*this) ().find2 (rank_, i_, j_, 1); } return *this; } BOOST_UBLAS_INLINE const_iterator2 &operator -- () { if (rank_ == 1 && layout_type::fast_j ()) -- it_; else { --j_; if (rank_ == 1) *this = (*this) ().find2 (rank_, i_, j_, -1); } return *this; } // Dereference BOOST_UBLAS_INLINE const_reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); if (rank_ == 1) { return (*this) ().value_data_ [it_ - (*this) ().index2_data_.begin ()]; } else { return (*this) () (i_, j_); } } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator1 begin () const { const self_type &m = (*this) (); return m.find1 (1, 0, index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator1 end () const { const self_type &m = (*this) (); return m.find1 (1, m.size1 (), index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator1 rbegin () const { return const_reverse_iterator1 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator1 rend () const { return const_reverse_iterator1 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { if (rank_ == 1) { BOOST_UBLAS_CHECK (layout_type::index_M (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)) < (*this) ().size1 (), bad_index ()); return layout_type::index_M (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)); } else { return i_; } } BOOST_UBLAS_INLINE size_type index2 () const { BOOST_UBLAS_CHECK (*this != (*this) ().find2 (0, i_, (*this) ().size2 ()), bad_index ()); if (rank_ == 1) { BOOST_UBLAS_CHECK (layout_type::index_m (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)) < (*this) ().size2 (), bad_index ()); return layout_type::index_m (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)); } else { return j_; } } // Assignment BOOST_UBLAS_INLINE const_iterator2 &operator = (const const_iterator2 &it) { container_const_reference::assign (&it ()); rank_ = it.rank_; i_ = it.i_; j_ = it.j_; itv_ = it.itv_; it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const const_iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); // BOOST_UBLAS_CHECK (rank_ == it.rank_, internal_logic ()); if (rank_ == 1 || it.rank_ == 1) { return it_ == it.it_; } else { return i_ == it.i_ && j_ == it.j_; } } private: int rank_; size_type i_; size_type j_; vector_const_subiterator_type itv_; const_subiterator_type it_; }; BOOST_UBLAS_INLINE const_iterator2 begin2 () const { return find2 (0, 0, 0); } BOOST_UBLAS_INLINE const_iterator2 end2 () const { return find2 (0, 0, size2_); } class iterator2: public container_reference, public bidirectional_iterator_base { public: typedef typename compressed_matrix::value_type value_type; typedef typename compressed_matrix::difference_type difference_type; typedef typename compressed_matrix::true_reference reference; typedef typename compressed_matrix::pointer pointer; typedef iterator1 dual_iterator_type; typedef reverse_iterator1 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE iterator2 (): container_reference (), rank_ (), i_ (), j_ (), itv_ (), it_ () {} BOOST_UBLAS_INLINE iterator2 (self_type &m, int rank, size_type i, size_type j, const vector_subiterator_type &itv, const subiterator_type &it): container_reference (m), rank_ (rank), i_ (i), j_ (j), itv_ (itv), it_ (it) {} // Arithmetic BOOST_UBLAS_INLINE iterator2 &operator ++ () { if (rank_ == 1 && layout_type::fast_j ()) ++ it_; else { j_ = index2 () + 1; if (rank_ == 1) *this = (*this) ().find2 (rank_, i_, j_, 1); } return *this; } BOOST_UBLAS_INLINE iterator2 &operator -- () { if (rank_ == 1 && layout_type::fast_j ()) -- it_; else { --j_; if (rank_ == 1) *this = (*this) ().find2 (rank_, i_, j_, -1); } return *this; } // Dereference BOOST_UBLAS_INLINE reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); if (rank_ == 1) { return (*this) ().value_data_ [it_ - (*this) ().index2_data_.begin ()]; } else { return (*this) ().at_element (i_, j_); } } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator1 begin () const { self_type &m = (*this) (); return m.find1 (1, 0, index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator1 end () const { self_type &m = (*this) (); return m.find1 (1, m.size1 (), index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator1 rbegin () const { return reverse_iterator1 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator1 rend () const { return reverse_iterator1 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { if (rank_ == 1) { BOOST_UBLAS_CHECK (layout_type::index_M (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)) < (*this) ().size1 (), bad_index ()); return layout_type::index_M (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)); } else { return i_; } } BOOST_UBLAS_INLINE size_type index2 () const { BOOST_UBLAS_CHECK (*this != (*this) ().find2 (0, i_, (*this) ().size2 ()), bad_index ()); if (rank_ == 1) { BOOST_UBLAS_CHECK (layout_type::index_m (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)) < (*this) ().size2 (), bad_index ()); return layout_type::index_m (itv_ - (*this) ().index1_data_.begin (), (*this) ().zero_based (*it_)); } else { return j_; } } // Assignment BOOST_UBLAS_INLINE iterator2 &operator = (const iterator2 &it) { container_reference::assign (&it ()); rank_ = it.rank_; i_ = it.i_; j_ = it.j_; itv_ = it.itv_; it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); // BOOST_UBLAS_CHECK (rank_ == it.rank_, internal_logic ()); if (rank_ == 1 || it.rank_ == 1) { return it_ == it.it_; } else { return i_ == it.i_ && j_ == it.j_; } } private: int rank_; size_type i_; size_type j_; vector_subiterator_type itv_; subiterator_type it_; friend class const_iterator2; }; BOOST_UBLAS_INLINE iterator2 begin2 () { return find2 (0, 0, 0); } BOOST_UBLAS_INLINE iterator2 end2 () { return find2 (0, 0, size2_); } // Reverse iterators BOOST_UBLAS_INLINE const_reverse_iterator1 rbegin1 () const { return const_reverse_iterator1 (end1 ()); } BOOST_UBLAS_INLINE const_reverse_iterator1 rend1 () const { return const_reverse_iterator1 (begin1 ()); } BOOST_UBLAS_INLINE reverse_iterator1 rbegin1 () { return reverse_iterator1 (end1 ()); } BOOST_UBLAS_INLINE reverse_iterator1 rend1 () { return reverse_iterator1 (begin1 ()); } BOOST_UBLAS_INLINE const_reverse_iterator2 rbegin2 () const { return const_reverse_iterator2 (end2 ()); } BOOST_UBLAS_INLINE const_reverse_iterator2 rend2 () const { return const_reverse_iterator2 (begin2 ()); } BOOST_UBLAS_INLINE reverse_iterator2 rbegin2 () { return reverse_iterator2 (end2 ()); } BOOST_UBLAS_INLINE reverse_iterator2 rend2 () { return reverse_iterator2 (begin2 ()); } // Serialization template void serialize(Archive & ar, const unsigned int /* file_version */){ serialization::collection_size_type s1 (size1_); serialization::collection_size_type s2 (size2_); ar & serialization::make_nvp("size1",s1); ar & serialization::make_nvp("size2",s2); if (Archive::is_loading::value) { size1_ = s1; size2_ = s2; } ar & serialization::make_nvp("capacity", capacity_); ar & serialization::make_nvp("filled1", filled1_); ar & serialization::make_nvp("filled2", filled2_); ar & serialization::make_nvp("index1_data", index1_data_); ar & serialization::make_nvp("index2_data", index2_data_); ar & serialization::make_nvp("value_data", value_data_); storage_invariants(); } private: void storage_invariants () const { BOOST_UBLAS_CHECK (layout_type::size_M (size1_, size2_) + 1 == index1_data_.size (), internal_logic ()); BOOST_UBLAS_CHECK (capacity_ == index2_data_.size (), internal_logic ()); BOOST_UBLAS_CHECK (capacity_ == value_data_.size (), internal_logic ()); BOOST_UBLAS_CHECK (filled1_ > 0 && filled1_ <= layout_type::size_M (size1_, size2_) + 1, internal_logic ()); BOOST_UBLAS_CHECK (filled2_ <= capacity_, internal_logic ()); BOOST_UBLAS_CHECK (index1_data_ [filled1_ - 1] == k_based (filled2_), internal_logic ()); } size_type size1_; size_type size2_; array_size_type capacity_; array_size_type filled1_; array_size_type filled2_; index_array_type index1_data_; index_array_type index2_data_; value_array_type value_data_; static const value_type zero_; BOOST_UBLAS_INLINE static size_type zero_based (size_type k_based_index) { return k_based_index - IB; } BOOST_UBLAS_INLINE static size_type k_based (size_type zero_based_index) { return zero_based_index + IB; } friend class iterator1; friend class iterator2; friend class const_iterator1; friend class const_iterator2; }; template const typename compressed_matrix::value_type compressed_matrix::zero_ = value_type/*zero*/(); // Coordinate array based sparse matrix class // Thanks to Kresimir Fresl for extending this to cover different index bases. template class coordinate_matrix: public matrix_container > { typedef T &true_reference; typedef T *pointer; typedef const T *const_pointer; typedef L layout_type; typedef coordinate_matrix self_type; public: #ifdef BOOST_UBLAS_ENABLE_PROXY_SHORTCUTS using matrix_container::operator (); #endif // ISSUE require type consistency check, is_convertable (IA::size_type, TA::size_type) typedef typename IA::value_type size_type; // ISSUE difference_type cannot be deduced for sparse indices, we only know the value_type typedef std::ptrdiff_t difference_type; // size_type for the data arrays. typedef typename IA::size_type array_size_type; typedef T value_type; typedef const T &const_reference; #ifndef BOOST_UBLAS_STRICT_MATRIX_SPARSE typedef T &reference; #else typedef sparse_matrix_element reference; #endif typedef IA index_array_type; typedef TA value_array_type; typedef const matrix_reference const_closure_type; typedef matrix_reference closure_type; typedef coordinate_vector vector_temporary_type; typedef self_type matrix_temporary_type; typedef sparse_tag storage_category; typedef typename L::orientation_category orientation_category; // Construction and destruction BOOST_UBLAS_INLINE coordinate_matrix (): matrix_container (), size1_ (0), size2_ (0), capacity_ (restrict_capacity (0)), filled_ (0), sorted_filled_ (filled_), sorted_ (true), index1_data_ (capacity_), index2_data_ (capacity_), value_data_ (capacity_) { storage_invariants (); } BOOST_UBLAS_INLINE coordinate_matrix (size_type size1, size_type size2, array_size_type non_zeros = 0): matrix_container (), size1_ (size1), size2_ (size2), capacity_ (restrict_capacity (non_zeros)), filled_ (0), sorted_filled_ (filled_), sorted_ (true), index1_data_ (capacity_), index2_data_ (capacity_), value_data_ (capacity_) { storage_invariants (); } BOOST_UBLAS_INLINE coordinate_matrix (const coordinate_matrix &m): matrix_container (), size1_ (m.size1_), size2_ (m.size2_), capacity_ (m.capacity_), filled_ (m.filled_), sorted_filled_ (m.sorted_filled_), sorted_ (m.sorted_), index1_data_ (m.index1_data_), index2_data_ (m.index2_data_), value_data_ (m.value_data_) { storage_invariants (); } template BOOST_UBLAS_INLINE coordinate_matrix (const matrix_expression &ae, array_size_type non_zeros = 0): matrix_container (), size1_ (ae ().size1 ()), size2_ (ae ().size2 ()), capacity_ (restrict_capacity (non_zeros)), filled_ (0), sorted_filled_ (filled_), sorted_ (true), index1_data_ (capacity_), index2_data_ (capacity_), value_data_ (capacity_) { storage_invariants (); matrix_assign (*this, ae); } // Accessors BOOST_UBLAS_INLINE size_type size1 () const { return size1_; } BOOST_UBLAS_INLINE size_type size2 () const { return size2_; } BOOST_UBLAS_INLINE size_type nnz_capacity () const { return capacity_; } BOOST_UBLAS_INLINE size_type nnz () const { return filled_; } // Storage accessors BOOST_UBLAS_INLINE static size_type index_base () { return IB; } BOOST_UBLAS_INLINE array_size_type filled () const { return filled_; } BOOST_UBLAS_INLINE const index_array_type &index1_data () const { return index1_data_; } BOOST_UBLAS_INLINE const index_array_type &index2_data () const { return index2_data_; } BOOST_UBLAS_INLINE const value_array_type &value_data () const { return value_data_; } BOOST_UBLAS_INLINE void set_filled (const array_size_type &filled) { // Make sure that storage_invariants() succeeds if (sorted_ && filled < filled_) sorted_filled_ = filled; else sorted_ = (sorted_filled_ == filled); filled_ = filled; storage_invariants (); } BOOST_UBLAS_INLINE index_array_type &index1_data () { return index1_data_; } BOOST_UBLAS_INLINE index_array_type &index2_data () { return index2_data_; } BOOST_UBLAS_INLINE value_array_type &value_data () { return value_data_; } // Resizing private: BOOST_UBLAS_INLINE array_size_type restrict_capacity (array_size_type non_zeros) const { // minimum non_zeros non_zeros = (std::max) (non_zeros, array_size_type((std::min) (size1_, size2_))); // ISSUE no maximum as coordinate may contain inserted duplicates return non_zeros; } public: BOOST_UBLAS_INLINE void resize (size_type size1, size_type size2, bool preserve = true) { // FIXME preserve unimplemented BOOST_UBLAS_CHECK (!preserve, internal_logic ()); size1_ = size1; size2_ = size2; capacity_ = restrict_capacity (capacity_); index1_data_.resize (capacity_); index2_data_.resize (capacity_); value_data_.resize (capacity_); filled_ = 0; sorted_filled_ = filled_; sorted_ = true; storage_invariants (); } // Reserving BOOST_UBLAS_INLINE void reserve (array_size_type non_zeros, bool preserve = true) { sort (); // remove duplicate elements capacity_ = restrict_capacity (non_zeros); if (preserve) { index1_data_.resize (capacity_, size_type ()); index2_data_.resize (capacity_, size_type ()); value_data_.resize (capacity_, value_type ()); filled_ = (std::min) (capacity_, filled_); } else { index1_data_.resize (capacity_); index2_data_.resize (capacity_); value_data_.resize (capacity_); filled_ = 0; } sorted_filled_ = filled_; storage_invariants (); } // Element support BOOST_UBLAS_INLINE pointer find_element (size_type i, size_type j) { return const_cast (const_cast(*this).find_element (i, j)); } BOOST_UBLAS_INLINE const_pointer find_element (size_type i, size_type j) const { sort (); size_type element1 (layout_type::index_M (i, j)); size_type element2 (layout_type::index_m (i, j)); vector_const_subiterator_type itv_begin (detail::lower_bound (index1_data_.begin (), index1_data_.begin () + filled_, k_based (element1), std::less ())); vector_const_subiterator_type itv_end (detail::upper_bound (index1_data_.begin (), index1_data_.begin () + filled_, k_based (element1), std::less ())); if (itv_begin == itv_end) return 0; const_subiterator_type it_begin (index2_data_.begin () + (itv_begin - index1_data_.begin ())); const_subiterator_type it_end (index2_data_.begin () + (itv_end - index1_data_.begin ())); const_subiterator_type it (detail::lower_bound (it_begin, it_end, k_based (element2), std::less ())); if (it == it_end || *it != k_based (element2)) return 0; return &value_data_ [it - index2_data_.begin ()]; } // Element access BOOST_UBLAS_INLINE const_reference operator () (size_type i, size_type j) const { const_pointer p = find_element (i, j); if (p) return *p; else return zero_; } BOOST_UBLAS_INLINE reference operator () (size_type i, size_type j) { #ifndef BOOST_UBLAS_STRICT_MATRIX_SPARSE pointer p = find_element (i, j); if (p) return *p; else return insert_element (i, j, value_type/*zero*/()); #else return reference (*this, i, j); #endif } // Element assignment BOOST_UBLAS_INLINE void append_element (size_type i, size_type j, const_reference t) { if (filled_ >= capacity_) reserve (2 * filled_, true); BOOST_UBLAS_CHECK (filled_ < capacity_, internal_logic ()); size_type element1 = layout_type::index_M (i, j); size_type element2 = layout_type::index_m (i, j); index1_data_ [filled_] = k_based (element1); index2_data_ [filled_] = k_based (element2); value_data_ [filled_] = t; ++ filled_; sorted_ = false; storage_invariants (); } BOOST_UBLAS_INLINE true_reference insert_element (size_type i, size_type j, const_reference t) { BOOST_UBLAS_CHECK (!find_element (i, j), bad_index ()); // duplicate element append_element (i, j, t); return value_data_ [filled_ - 1]; } BOOST_UBLAS_INLINE void erase_element (size_type i, size_type j) { size_type element1 = layout_type::index_M (i, j); size_type element2 = layout_type::index_m (i, j); sort (); vector_subiterator_type itv_begin (detail::lower_bound (index1_data_.begin (), index1_data_.begin () + filled_, k_based (element1), std::less ())); vector_subiterator_type itv_end (detail::upper_bound (index1_data_.begin (), index1_data_.begin () + filled_, k_based (element1), std::less ())); subiterator_type it_begin (index2_data_.begin () + (itv_begin - index1_data_.begin ())); subiterator_type it_end (index2_data_.begin () + (itv_end - index1_data_.begin ())); subiterator_type it (detail::lower_bound (it_begin, it_end, k_based (element2), std::less ())); if (it != it_end && *it == k_based (element2)) { typename std::iterator_traits::difference_type n = it - index2_data_.begin (); vector_subiterator_type itv (index1_data_.begin () + n); std::copy (itv + 1, index1_data_.begin () + filled_, itv); std::copy (it + 1, index2_data_.begin () + filled_, it); typename value_array_type::iterator itt (value_data_.begin () + n); std::copy (itt + 1, value_data_.begin () + filled_, itt); -- filled_; sorted_filled_ = filled_; } storage_invariants (); } // Zeroing BOOST_UBLAS_INLINE void clear () { filled_ = 0; sorted_filled_ = filled_; sorted_ = true; storage_invariants (); } // Assignment BOOST_UBLAS_INLINE coordinate_matrix &operator = (const coordinate_matrix &m) { if (this != &m) { size1_ = m.size1_; size2_ = m.size2_; capacity_ = m.capacity_; filled_ = m.filled_; sorted_filled_ = m.sorted_filled_; sorted_ = m.sorted_; index1_data_ = m.index1_data_; index2_data_ = m.index2_data_; value_data_ = m.value_data_; BOOST_UBLAS_CHECK (capacity_ == index1_data_.size (), internal_logic ()); BOOST_UBLAS_CHECK (capacity_ == index2_data_.size (), internal_logic ()); BOOST_UBLAS_CHECK (capacity_ == value_data_.size (), internal_logic ()); } storage_invariants (); return *this; } template // Container assignment without temporary BOOST_UBLAS_INLINE coordinate_matrix &operator = (const matrix_container &m) { resize (m ().size1 (), m ().size2 (), false); assign (m); return *this; } BOOST_UBLAS_INLINE coordinate_matrix &assign_temporary (coordinate_matrix &m) { swap (m); return *this; } template BOOST_UBLAS_INLINE coordinate_matrix &operator = (const matrix_expression &ae) { self_type temporary (ae, capacity_); return assign_temporary (temporary); } template BOOST_UBLAS_INLINE coordinate_matrix &assign (const matrix_expression &ae) { matrix_assign (*this, ae); return *this; } template BOOST_UBLAS_INLINE coordinate_matrix& operator += (const matrix_expression &ae) { self_type temporary (*this + ae, capacity_); return assign_temporary (temporary); } template // Container assignment without temporary BOOST_UBLAS_INLINE coordinate_matrix &operator += (const matrix_container &m) { plus_assign (m); return *this; } template BOOST_UBLAS_INLINE coordinate_matrix &plus_assign (const matrix_expression &ae) { matrix_assign (*this, ae); return *this; } template BOOST_UBLAS_INLINE coordinate_matrix& operator -= (const matrix_expression &ae) { self_type temporary (*this - ae, capacity_); return assign_temporary (temporary); } template // Container assignment without temporary BOOST_UBLAS_INLINE coordinate_matrix &operator -= (const matrix_container &m) { minus_assign (m); return *this; } template BOOST_UBLAS_INLINE coordinate_matrix &minus_assign (const matrix_expression &ae) { matrix_assign (*this, ae); return *this; } template BOOST_UBLAS_INLINE coordinate_matrix& operator *= (const AT &at) { matrix_assign_scalar (*this, at); return *this; } template BOOST_UBLAS_INLINE coordinate_matrix& operator /= (const AT &at) { matrix_assign_scalar (*this, at); return *this; } // Swapping BOOST_UBLAS_INLINE void swap (coordinate_matrix &m) { if (this != &m) { std::swap (size1_, m.size1_); std::swap (size2_, m.size2_); std::swap (capacity_, m.capacity_); std::swap (filled_, m.filled_); std::swap (sorted_filled_, m.sorted_filled_); std::swap (sorted_, m.sorted_); index1_data_.swap (m.index1_data_); index2_data_.swap (m.index2_data_); value_data_.swap (m.value_data_); } storage_invariants (); } BOOST_UBLAS_INLINE friend void swap (coordinate_matrix &m1, coordinate_matrix &m2) { m1.swap (m2); } // replacement if STL lower bound algorithm for use of inplace_merge array_size_type lower_bound (array_size_type beg, array_size_type end, array_size_type target) const { while (end > beg) { array_size_type mid = (beg + end) / 2; if (((index1_data_[mid] < index1_data_[target]) || ((index1_data_[mid] == index1_data_[target]) && (index2_data_[mid] < index2_data_[target])))) { beg = mid + 1; } else { end = mid; } } return beg; } // specialized replacement of STL inplace_merge to avoid compilation // problems with respect to the array_triple iterator void inplace_merge (array_size_type beg, array_size_type mid, array_size_type end) const { array_size_type len_lef = mid - beg; array_size_type len_rig = end - mid; if (len_lef == 1 && len_rig == 1) { if ((index1_data_[mid] < index1_data_[beg]) || ((index1_data_[mid] == index1_data_[beg]) && (index2_data_[mid] < index2_data_[beg]))) { std::swap(index1_data_[beg], index1_data_[mid]); std::swap(index2_data_[beg], index2_data_[mid]); std::swap(value_data_[beg], value_data_[mid]); } } else if (len_lef > 0 && len_rig > 0) { array_size_type lef_mid, rig_mid; if (len_lef >= len_rig) { lef_mid = (beg + mid) / 2; rig_mid = lower_bound(mid, end, lef_mid); } else { rig_mid = (mid + end) / 2; lef_mid = lower_bound(beg, mid, rig_mid); } std::rotate(&index1_data_[0] + lef_mid, &index1_data_[0] + mid, &index1_data_[0] + rig_mid); std::rotate(&index2_data_[0] + lef_mid, &index2_data_[0] + mid, &index2_data_[0] + rig_mid); std::rotate(&value_data_[0] + lef_mid, &value_data_[0] + mid, &value_data_[0] + rig_mid); array_size_type new_mid = lef_mid + rig_mid - mid; inplace_merge(beg, lef_mid, new_mid); inplace_merge(new_mid, rig_mid, end); } } // Sorting and summation of duplicates BOOST_UBLAS_INLINE void sort () const { if (! sorted_ && filled_ > 0) { typedef index_triple_array array_triple; array_triple ita (filled_, index1_data_, index2_data_, value_data_); #ifndef BOOST_UBLAS_COO_ALWAYS_DO_FULL_SORT const typename array_triple::iterator iunsorted = ita.begin () + sorted_filled_; // sort new elements and merge std::sort (iunsorted, ita.end ()); inplace_merge(0, sorted_filled_, filled_); #else const typename array_triple::iterator iunsorted = ita.begin (); std::sort (iunsorted, ita.end ()); #endif // sum duplicates with += and remove array_size_type filled = 0; for (array_size_type i = 1; i < filled_; ++ i) { if (index1_data_ [filled] != index1_data_ [i] || index2_data_ [filled] != index2_data_ [i]) { ++ filled; if (filled != i) { index1_data_ [filled] = index1_data_ [i]; index2_data_ [filled] = index2_data_ [i]; value_data_ [filled] = value_data_ [i]; } } else { value_data_ [filled] += value_data_ [i]; } } filled_ = filled + 1; sorted_filled_ = filled_; sorted_ = true; storage_invariants (); } } // Back element insertion and erasure BOOST_UBLAS_INLINE void push_back (size_type i, size_type j, const_reference t) { size_type element1 = layout_type::index_M (i, j); size_type element2 = layout_type::index_m (i, j); // must maintain sort order BOOST_UBLAS_CHECK (sorted_ && (filled_ == 0 || index1_data_ [filled_ - 1] < k_based (element1) || (index1_data_ [filled_ - 1] == k_based (element1) && index2_data_ [filled_ - 1] < k_based (element2))) , external_logic ()); if (filled_ >= capacity_) reserve (2 * filled_, true); BOOST_UBLAS_CHECK (filled_ < capacity_, internal_logic ()); index1_data_ [filled_] = k_based (element1); index2_data_ [filled_] = k_based (element2); value_data_ [filled_] = t; ++ filled_; sorted_filled_ = filled_; storage_invariants (); } BOOST_UBLAS_INLINE void pop_back () { // ISSUE invariants could be simpilfied if sorted required as precondition BOOST_UBLAS_CHECK (filled_ > 0, external_logic ()); -- filled_; sorted_filled_ = (std::min) (sorted_filled_, filled_); sorted_ = sorted_filled_ = filled_; storage_invariants (); } // Iterator types private: // Use index array iterator typedef typename IA::const_iterator vector_const_subiterator_type; typedef typename IA::iterator vector_subiterator_type; typedef typename IA::const_iterator const_subiterator_type; typedef typename IA::iterator subiterator_type; BOOST_UBLAS_INLINE true_reference at_element (size_type i, size_type j) { pointer p = find_element (i, j); BOOST_UBLAS_CHECK (p, bad_index ()); return *p; } public: class const_iterator1; class iterator1; class const_iterator2; class iterator2; typedef reverse_iterator_base1 const_reverse_iterator1; typedef reverse_iterator_base1 reverse_iterator1; typedef reverse_iterator_base2 const_reverse_iterator2; typedef reverse_iterator_base2 reverse_iterator2; // Element lookup // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. const_iterator1 find1 (int rank, size_type i, size_type j, int direction = 1) const { sort (); for (;;) { size_type address1 (layout_type::index_M (i, j)); size_type address2 (layout_type::index_m (i, j)); vector_const_subiterator_type itv_begin (detail::lower_bound (index1_data_.begin (), index1_data_.begin () + filled_, k_based (address1), std::less ())); vector_const_subiterator_type itv_end (detail::upper_bound (index1_data_.begin (), index1_data_.begin () + filled_, k_based (address1), std::less ())); const_subiterator_type it_begin (index2_data_.begin () + (itv_begin - index1_data_.begin ())); const_subiterator_type it_end (index2_data_.begin () + (itv_end - index1_data_.begin ())); const_subiterator_type it (detail::lower_bound (it_begin, it_end, k_based (address2), std::less ())); vector_const_subiterator_type itv (index1_data_.begin () + (it - index2_data_.begin ())); if (rank == 0) return const_iterator1 (*this, rank, i, j, itv, it); if (it != it_end && zero_based (*it) == address2) return const_iterator1 (*this, rank, i, j, itv, it); if (direction > 0) { if (layout_type::fast_i ()) { if (it == it_end) return const_iterator1 (*this, rank, i, j, itv, it); i = zero_based (*it); } else { if (i >= size1_) return const_iterator1 (*this, rank, i, j, itv, it); ++ i; } } else /* if (direction < 0) */ { if (layout_type::fast_i ()) { if (it == index2_data_.begin () + array_size_type (zero_based (*itv))) return const_iterator1 (*this, rank, i, j, itv, it); i = zero_based (*(it - 1)); } else { if (i == 0) return const_iterator1 (*this, rank, i, j, itv, it); -- i; } } } } // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. iterator1 find1 (int rank, size_type i, size_type j, int direction = 1) { sort (); for (;;) { size_type address1 (layout_type::index_M (i, j)); size_type address2 (layout_type::index_m (i, j)); vector_subiterator_type itv_begin (detail::lower_bound (index1_data_.begin (), index1_data_.begin () + filled_, k_based (address1), std::less ())); vector_subiterator_type itv_end (detail::upper_bound (index1_data_.begin (), index1_data_.begin () + filled_, k_based (address1), std::less ())); subiterator_type it_begin (index2_data_.begin () + (itv_begin - index1_data_.begin ())); subiterator_type it_end (index2_data_.begin () + (itv_end - index1_data_.begin ())); subiterator_type it (detail::lower_bound (it_begin, it_end, k_based (address2), std::less ())); vector_subiterator_type itv (index1_data_.begin () + (it - index2_data_.begin ())); if (rank == 0) return iterator1 (*this, rank, i, j, itv, it); if (it != it_end && zero_based (*it) == address2) return iterator1 (*this, rank, i, j, itv, it); if (direction > 0) { if (layout_type::fast_i ()) { if (it == it_end) return iterator1 (*this, rank, i, j, itv, it); i = zero_based (*it); } else { if (i >= size1_) return iterator1 (*this, rank, i, j, itv, it); ++ i; } } else /* if (direction < 0) */ { if (layout_type::fast_i ()) { if (it == index2_data_.begin () + array_size_type (zero_based (*itv))) return iterator1 (*this, rank, i, j, itv, it); i = zero_based (*(it - 1)); } else { if (i == 0) return iterator1 (*this, rank, i, j, itv, it); -- i; } } } } // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. const_iterator2 find2 (int rank, size_type i, size_type j, int direction = 1) const { sort (); for (;;) { size_type address1 (layout_type::index_M (i, j)); size_type address2 (layout_type::index_m (i, j)); vector_const_subiterator_type itv_begin (detail::lower_bound (index1_data_.begin (), index1_data_.begin () + filled_, k_based (address1), std::less ())); vector_const_subiterator_type itv_end (detail::upper_bound (index1_data_.begin (), index1_data_.begin () + filled_, k_based (address1), std::less ())); const_subiterator_type it_begin (index2_data_.begin () + (itv_begin - index1_data_.begin ())); const_subiterator_type it_end (index2_data_.begin () + (itv_end - index1_data_.begin ())); const_subiterator_type it (detail::lower_bound (it_begin, it_end, k_based (address2), std::less ())); vector_const_subiterator_type itv (index1_data_.begin () + (it - index2_data_.begin ())); if (rank == 0) return const_iterator2 (*this, rank, i, j, itv, it); if (it != it_end && zero_based (*it) == address2) return const_iterator2 (*this, rank, i, j, itv, it); if (direction > 0) { if (layout_type::fast_j ()) { if (it == it_end) return const_iterator2 (*this, rank, i, j, itv, it); j = zero_based (*it); } else { if (j >= size2_) return const_iterator2 (*this, rank, i, j, itv, it); ++ j; } } else /* if (direction < 0) */ { if (layout_type::fast_j ()) { if (it == index2_data_.begin () + array_size_type (zero_based (*itv))) return const_iterator2 (*this, rank, i, j, itv, it); j = zero_based (*(it - 1)); } else { if (j == 0) return const_iterator2 (*this, rank, i, j, itv, it); -- j; } } } } // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. iterator2 find2 (int rank, size_type i, size_type j, int direction = 1) { sort (); for (;;) { size_type address1 (layout_type::index_M (i, j)); size_type address2 (layout_type::index_m (i, j)); vector_subiterator_type itv_begin (detail::lower_bound (index1_data_.begin (), index1_data_.begin () + filled_, k_based (address1), std::less ())); vector_subiterator_type itv_end (detail::upper_bound (index1_data_.begin (), index1_data_.begin () + filled_, k_based (address1), std::less ())); subiterator_type it_begin (index2_data_.begin () + (itv_begin - index1_data_.begin ())); subiterator_type it_end (index2_data_.begin () + (itv_end - index1_data_.begin ())); subiterator_type it (detail::lower_bound (it_begin, it_end, k_based (address2), std::less ())); vector_subiterator_type itv (index1_data_.begin () + (it - index2_data_.begin ())); if (rank == 0) return iterator2 (*this, rank, i, j, itv, it); if (it != it_end && zero_based (*it) == address2) return iterator2 (*this, rank, i, j, itv, it); if (direction > 0) { if (layout_type::fast_j ()) { if (it == it_end) return iterator2 (*this, rank, i, j, itv, it); j = zero_based (*it); } else { if (j >= size2_) return iterator2 (*this, rank, i, j, itv, it); ++ j; } } else /* if (direction < 0) */ { if (layout_type::fast_j ()) { if (it == index2_data_.begin () + array_size_type (zero_based (*itv))) return iterator2 (*this, rank, i, j, itv, it); j = zero_based (*(it - 1)); } else { if (j == 0) return iterator2 (*this, rank, i, j, itv, it); -- j; } } } } class const_iterator1: public container_const_reference, public bidirectional_iterator_base { public: typedef typename coordinate_matrix::value_type value_type; typedef typename coordinate_matrix::difference_type difference_type; typedef typename coordinate_matrix::const_reference reference; typedef const typename coordinate_matrix::pointer pointer; typedef const_iterator2 dual_iterator_type; typedef const_reverse_iterator2 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE const_iterator1 (): container_const_reference (), rank_ (), i_ (), j_ (), itv_ (), it_ () {} BOOST_UBLAS_INLINE const_iterator1 (const self_type &m, int rank, size_type i, size_type j, const vector_const_subiterator_type &itv, const const_subiterator_type &it): container_const_reference (m), rank_ (rank), i_ (i), j_ (j), itv_ (itv), it_ (it) {} BOOST_UBLAS_INLINE const_iterator1 (const iterator1 &it): container_const_reference (it ()), rank_ (it.rank_), i_ (it.i_), j_ (it.j_), itv_ (it.itv_), it_ (it.it_) {} // Arithmetic BOOST_UBLAS_INLINE const_iterator1 &operator ++ () { if (rank_ == 1 && layout_type::fast_i ()) ++ it_; else { i_ = index1 () + 1; if (rank_ == 1) *this = (*this) ().find1 (rank_, i_, j_, 1); } return *this; } BOOST_UBLAS_INLINE const_iterator1 &operator -- () { if (rank_ == 1 && layout_type::fast_i ()) -- it_; else { i_ = index1 () - 1; if (rank_ == 1) *this = (*this) ().find1 (rank_, i_, j_, -1); } return *this; } // Dereference BOOST_UBLAS_INLINE const_reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); if (rank_ == 1) { return (*this) ().value_data_ [it_ - (*this) ().index2_data_.begin ()]; } else { return (*this) () (i_, j_); } } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator2 begin () const { const self_type &m = (*this) (); return m.find2 (1, index1 (), 0); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator2 end () const { const self_type &m = (*this) (); return m.find2 (1, index1 (), m.size2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator2 rbegin () const { return const_reverse_iterator2 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator2 rend () const { return const_reverse_iterator2 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { BOOST_UBLAS_CHECK (*this != (*this) ().find1 (0, (*this) ().size1 (), j_), bad_index ()); if (rank_ == 1) { BOOST_UBLAS_CHECK (layout_type::index_M ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)) < (*this) ().size1 (), bad_index ()); return layout_type::index_M ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)); } else { return i_; } } BOOST_UBLAS_INLINE size_type index2 () const { if (rank_ == 1) { BOOST_UBLAS_CHECK (layout_type::index_m ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)) < (*this) ().size2 (), bad_index ()); return layout_type::index_m ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)); } else { return j_; } } // Assignment BOOST_UBLAS_INLINE const_iterator1 &operator = (const const_iterator1 &it) { container_const_reference::assign (&it ()); rank_ = it.rank_; i_ = it.i_; j_ = it.j_; itv_ = it.itv_; it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const const_iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); // BOOST_UBLAS_CHECK (rank_ == it.rank_, internal_logic ()); if (rank_ == 1 || it.rank_ == 1) { return it_ == it.it_; } else { return i_ == it.i_ && j_ == it.j_; } } private: int rank_; size_type i_; size_type j_; vector_const_subiterator_type itv_; const_subiterator_type it_; }; BOOST_UBLAS_INLINE const_iterator1 begin1 () const { return find1 (0, 0, 0); } BOOST_UBLAS_INLINE const_iterator1 end1 () const { return find1 (0, size1_, 0); } class iterator1: public container_reference, public bidirectional_iterator_base { public: typedef typename coordinate_matrix::value_type value_type; typedef typename coordinate_matrix::difference_type difference_type; typedef typename coordinate_matrix::true_reference reference; typedef typename coordinate_matrix::pointer pointer; typedef iterator2 dual_iterator_type; typedef reverse_iterator2 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE iterator1 (): container_reference (), rank_ (), i_ (), j_ (), itv_ (), it_ () {} BOOST_UBLAS_INLINE iterator1 (self_type &m, int rank, size_type i, size_type j, const vector_subiterator_type &itv, const subiterator_type &it): container_reference (m), rank_ (rank), i_ (i), j_ (j), itv_ (itv), it_ (it) {} // Arithmetic BOOST_UBLAS_INLINE iterator1 &operator ++ () { if (rank_ == 1 && layout_type::fast_i ()) ++ it_; else { i_ = index1 () + 1; if (rank_ == 1) *this = (*this) ().find1 (rank_, i_, j_, 1); } return *this; } BOOST_UBLAS_INLINE iterator1 &operator -- () { if (rank_ == 1 && layout_type::fast_i ()) -- it_; else { i_ = index1 () - 1; if (rank_ == 1) *this = (*this) ().find1 (rank_, i_, j_, -1); } return *this; } // Dereference BOOST_UBLAS_INLINE reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); if (rank_ == 1) { return (*this) ().value_data_ [it_ - (*this) ().index2_data_.begin ()]; } else { return (*this) ().at_element (i_, j_); } } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator2 begin () const { self_type &m = (*this) (); return m.find2 (1, index1 (), 0); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator2 end () const { self_type &m = (*this) (); return m.find2 (1, index1 (), m.size2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator2 rbegin () const { return reverse_iterator2 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator2 rend () const { return reverse_iterator2 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { BOOST_UBLAS_CHECK (*this != (*this) ().find1 (0, (*this) ().size1 (), j_), bad_index ()); if (rank_ == 1) { BOOST_UBLAS_CHECK (layout_type::index_M ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)) < (*this) ().size1 (), bad_index ()); return layout_type::index_M ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)); } else { return i_; } } BOOST_UBLAS_INLINE size_type index2 () const { if (rank_ == 1) { BOOST_UBLAS_CHECK (layout_type::index_m ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)) < (*this) ().size2 (), bad_index ()); return layout_type::index_m ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)); } else { return j_; } } // Assignment BOOST_UBLAS_INLINE iterator1 &operator = (const iterator1 &it) { container_reference::assign (&it ()); rank_ = it.rank_; i_ = it.i_; j_ = it.j_; itv_ = it.itv_; it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); // BOOST_UBLAS_CHECK (rank_ == it.rank_, internal_logic ()); if (rank_ == 1 || it.rank_ == 1) { return it_ == it.it_; } else { return i_ == it.i_ && j_ == it.j_; } } private: int rank_; size_type i_; size_type j_; vector_subiterator_type itv_; subiterator_type it_; friend class const_iterator1; }; BOOST_UBLAS_INLINE iterator1 begin1 () { return find1 (0, 0, 0); } BOOST_UBLAS_INLINE iterator1 end1 () { return find1 (0, size1_, 0); } class const_iterator2: public container_const_reference, public bidirectional_iterator_base { public: typedef typename coordinate_matrix::value_type value_type; typedef typename coordinate_matrix::difference_type difference_type; typedef typename coordinate_matrix::const_reference reference; typedef const typename coordinate_matrix::pointer pointer; typedef const_iterator1 dual_iterator_type; typedef const_reverse_iterator1 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE const_iterator2 (): container_const_reference (), rank_ (), i_ (), j_ (), itv_ (), it_ () {} BOOST_UBLAS_INLINE const_iterator2 (const self_type &m, int rank, size_type i, size_type j, const vector_const_subiterator_type itv, const const_subiterator_type &it): container_const_reference (m), rank_ (rank), i_ (i), j_ (j), itv_ (itv), it_ (it) {} BOOST_UBLAS_INLINE const_iterator2 (const iterator2 &it): container_const_reference (it ()), rank_ (it.rank_), i_ (it.i_), j_ (it.j_), itv_ (it.itv_), it_ (it.it_) {} // Arithmetic BOOST_UBLAS_INLINE const_iterator2 &operator ++ () { if (rank_ == 1 && layout_type::fast_j ()) ++ it_; else { j_ = index2 () + 1; if (rank_ == 1) *this = (*this) ().find2 (rank_, i_, j_, 1); } return *this; } BOOST_UBLAS_INLINE const_iterator2 &operator -- () { if (rank_ == 1 && layout_type::fast_j ()) -- it_; else { j_ = index2 () - 1; if (rank_ == 1) *this = (*this) ().find2 (rank_, i_, j_, -1); } return *this; } // Dereference BOOST_UBLAS_INLINE const_reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); if (rank_ == 1) { return (*this) ().value_data_ [it_ - (*this) ().index2_data_.begin ()]; } else { return (*this) () (i_, j_); } } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator1 begin () const { const self_type &m = (*this) (); return m.find1 (1, 0, index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator1 end () const { const self_type &m = (*this) (); return m.find1 (1, m.size1 (), index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator1 rbegin () const { return const_reverse_iterator1 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator1 rend () const { return const_reverse_iterator1 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { if (rank_ == 1) { BOOST_UBLAS_CHECK (layout_type::index_M ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)) < (*this) ().size1 (), bad_index ()); return layout_type::index_M ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)); } else { return i_; } } BOOST_UBLAS_INLINE size_type index2 () const { BOOST_UBLAS_CHECK (*this != (*this) ().find2 (0, i_, (*this) ().size2 ()), bad_index ()); if (rank_ == 1) { BOOST_UBLAS_CHECK (layout_type::index_m ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)) < (*this) ().size2 (), bad_index ()); return layout_type::index_m ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)); } else { return j_; } } // Assignment BOOST_UBLAS_INLINE const_iterator2 &operator = (const const_iterator2 &it) { container_const_reference::assign (&it ()); rank_ = it.rank_; i_ = it.i_; j_ = it.j_; itv_ = it.itv_; it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const const_iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); // BOOST_UBLAS_CHECK (rank_ == it.rank_, internal_logic ()); if (rank_ == 1 || it.rank_ == 1) { return it_ == it.it_; } else { return i_ == it.i_ && j_ == it.j_; } } private: int rank_; size_type i_; size_type j_; vector_const_subiterator_type itv_; const_subiterator_type it_; }; BOOST_UBLAS_INLINE const_iterator2 begin2 () const { return find2 (0, 0, 0); } BOOST_UBLAS_INLINE const_iterator2 end2 () const { return find2 (0, 0, size2_); } class iterator2: public container_reference, public bidirectional_iterator_base { public: typedef typename coordinate_matrix::value_type value_type; typedef typename coordinate_matrix::difference_type difference_type; typedef typename coordinate_matrix::true_reference reference; typedef typename coordinate_matrix::pointer pointer; typedef iterator1 dual_iterator_type; typedef reverse_iterator1 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE iterator2 (): container_reference (), rank_ (), i_ (), j_ (), itv_ (), it_ () {} BOOST_UBLAS_INLINE iterator2 (self_type &m, int rank, size_type i, size_type j, const vector_subiterator_type &itv, const subiterator_type &it): container_reference (m), rank_ (rank), i_ (i), j_ (j), itv_ (itv), it_ (it) {} // Arithmetic BOOST_UBLAS_INLINE iterator2 &operator ++ () { if (rank_ == 1 && layout_type::fast_j ()) ++ it_; else { j_ = index2 () + 1; if (rank_ == 1) *this = (*this) ().find2 (rank_, i_, j_, 1); } return *this; } BOOST_UBLAS_INLINE iterator2 &operator -- () { if (rank_ == 1 && layout_type::fast_j ()) -- it_; else { j_ = index2 (); if (rank_ == 1) *this = (*this) ().find2 (rank_, i_, j_, -1); } return *this; } // Dereference BOOST_UBLAS_INLINE reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); if (rank_ == 1) { return (*this) ().value_data_ [it_ - (*this) ().index2_data_.begin ()]; } else { return (*this) ().at_element (i_, j_); } } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator1 begin () const { self_type &m = (*this) (); return m.find1 (1, 0, index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator1 end () const { self_type &m = (*this) (); return m.find1 (1, m.size1 (), index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator1 rbegin () const { return reverse_iterator1 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator1 rend () const { return reverse_iterator1 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { if (rank_ == 1) { BOOST_UBLAS_CHECK (layout_type::index_M ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)) < (*this) ().size1 (), bad_index ()); return layout_type::index_M ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)); } else { return i_; } } BOOST_UBLAS_INLINE size_type index2 () const { BOOST_UBLAS_CHECK (*this != (*this) ().find2 (0, i_, (*this) ().size2 ()), bad_index ()); if (rank_ == 1) { BOOST_UBLAS_CHECK (layout_type::index_m ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)) < (*this) ().size2 (), bad_index ()); return layout_type::index_m ((*this) ().zero_based (*itv_), (*this) ().zero_based (*it_)); } else { return j_; } } // Assignment BOOST_UBLAS_INLINE iterator2 &operator = (const iterator2 &it) { container_reference::assign (&it ()); rank_ = it.rank_; i_ = it.i_; j_ = it.j_; itv_ = it.itv_; it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); // BOOST_UBLAS_CHECK (rank_ == it.rank_, internal_logic ()); if (rank_ == 1 || it.rank_ == 1) { return it_ == it.it_; } else { return i_ == it.i_ && j_ == it.j_; } } private: int rank_; size_type i_; size_type j_; vector_subiterator_type itv_; subiterator_type it_; friend class const_iterator2; }; BOOST_UBLAS_INLINE iterator2 begin2 () { return find2 (0, 0, 0); } BOOST_UBLAS_INLINE iterator2 end2 () { return find2 (0, 0, size2_); } // Reverse iterators BOOST_UBLAS_INLINE const_reverse_iterator1 rbegin1 () const { return const_reverse_iterator1 (end1 ()); } BOOST_UBLAS_INLINE const_reverse_iterator1 rend1 () const { return const_reverse_iterator1 (begin1 ()); } BOOST_UBLAS_INLINE reverse_iterator1 rbegin1 () { return reverse_iterator1 (end1 ()); } BOOST_UBLAS_INLINE reverse_iterator1 rend1 () { return reverse_iterator1 (begin1 ()); } BOOST_UBLAS_INLINE const_reverse_iterator2 rbegin2 () const { return const_reverse_iterator2 (end2 ()); } BOOST_UBLAS_INLINE const_reverse_iterator2 rend2 () const { return const_reverse_iterator2 (begin2 ()); } BOOST_UBLAS_INLINE reverse_iterator2 rbegin2 () { return reverse_iterator2 (end2 ()); } BOOST_UBLAS_INLINE reverse_iterator2 rend2 () { return reverse_iterator2 (begin2 ()); } // Serialization template void serialize(Archive & ar, const unsigned int /* file_version */){ serialization::collection_size_type s1 (size1_); serialization::collection_size_type s2 (size2_); ar & serialization::make_nvp("size1",s1); ar & serialization::make_nvp("size2",s2); if (Archive::is_loading::value) { size1_ = s1; size2_ = s2; } ar & serialization::make_nvp("capacity", capacity_); ar & serialization::make_nvp("filled", filled_); ar & serialization::make_nvp("sorted_filled", sorted_filled_); ar & serialization::make_nvp("sorted", sorted_); ar & serialization::make_nvp("index1_data", index1_data_); ar & serialization::make_nvp("index2_data", index2_data_); ar & serialization::make_nvp("value_data", value_data_); storage_invariants(); } private: void storage_invariants () const { BOOST_UBLAS_CHECK (capacity_ == index1_data_.size (), internal_logic ()); BOOST_UBLAS_CHECK (capacity_ == index2_data_.size (), internal_logic ()); BOOST_UBLAS_CHECK (capacity_ == value_data_.size (), internal_logic ()); BOOST_UBLAS_CHECK (filled_ <= capacity_, internal_logic ()); BOOST_UBLAS_CHECK (sorted_filled_ <= filled_, internal_logic ()); BOOST_UBLAS_CHECK (sorted_ == (sorted_filled_ == filled_), internal_logic ()); } size_type size1_; size_type size2_; array_size_type capacity_; mutable array_size_type filled_; mutable array_size_type sorted_filled_; mutable bool sorted_; mutable index_array_type index1_data_; mutable index_array_type index2_data_; mutable value_array_type value_data_; static const value_type zero_; BOOST_UBLAS_INLINE static size_type zero_based (size_type k_based_index) { return k_based_index - IB; } BOOST_UBLAS_INLINE static size_type k_based (size_type zero_based_index) { return zero_based_index + IB; } friend class iterator1; friend class iterator2; friend class const_iterator1; friend class const_iterator2; }; template const typename coordinate_matrix::value_type coordinate_matrix::zero_ = value_type/*zero*/(); }}} #endif madp-0.4/src/boost/boost/numeric/ublas/PaxHeaders.5405/matrix.hpp0000644000000000000000000000007412717644140021613 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.105552405 madp-0.4/src/boost/boost/numeric/ublas/matrix.hpp0000664000372100037210000047015112717644140022452 0ustar00fransfrans00000000000000// // Copyright (c) 2000-2010 // Joerg Walter, Mathias Koch, Gunter Winkler, David Bellot // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // The authors gratefully acknowledge the support of // GeNeSys mbH & Co. KG in producing this work. // #ifndef _BOOST_UBLAS_MATRIX_ #define _BOOST_UBLAS_MATRIX_ #include #include #include #include #include #include // Iterators based on ideas of Jeremy Siek namespace boost { namespace numeric { /** \brief main namespace of uBLAS. * * Use this namespace for all operations with uBLAS. It can also be abbreviated with * \code namespace ublas = boost::numeric::ublas; \endcode * * A common practice is to bring this namespace into the current scope with * \code using namespace boost::numeric::ublas; \endcode. * * However, be warned that using the ublas namespace and the std::vector at the same time can lead to the compiler to confusion. * The solution is simply to prefix each ublas vector like \c boost::numeric::ublas::vector. If you think it's too long to * write, you can define a new namespace like \c namespace ublas = boost::numeric::ublas and then just declare your vectors * with \c ublas::vector. STL vectors will be declared as vector. No need to prefix with \c std:: */ namespace ublas { namespace detail { using namespace boost::numeric::ublas; // Matrix resizing algorithm template BOOST_UBLAS_INLINE void matrix_resize_preserve (M& m, M& temporary) { typedef L layout_type; typedef typename M::size_type size_type; const size_type msize1 (m.size1 ()); // original size const size_type msize2 (m.size2 ()); const size_type size1 (temporary.size1 ()); // new size is specified by temporary const size_type size2 (temporary.size2 ()); // Common elements to preserve const size_type size1_min = (std::min) (size1, msize1); const size_type size2_min = (std::min) (size2, msize2); // Order for major and minor sizes const size_type major_size = layout_type::size_M (size1_min, size2_min); const size_type minor_size = layout_type::size_m (size1_min, size2_min); // Indexing copy over major for (size_type major = 0; major != major_size; ++major) { for (size_type minor = 0; minor != minor_size; ++minor) { // find indexes - use invertability of element_ functions const size_type i1 = layout_type::index_M(major, minor); const size_type i2 = layout_type::index_m(major, minor); temporary.data () [layout_type::element (i1, size1, i2, size2)] = m.data() [layout_type::element (i1, msize1, i2, msize2)]; } } m.assign_temporary (temporary); } } /** \brief A dense matrix of values of type \c T. * * For a \f$(m \times n)\f$-dimensional matrix and \f$ 0 \leq i < m, 0 \leq j < n\f$, every element \f$ m_{i,j} \f$ is mapped to * the \f$(i.n + j)\f$-th element of the container for row major orientation or the \f$ (i + j.m) \f$-th element of * the container for column major orientation. In a dense matrix all elements are represented in memory in a * contiguous chunk of memory by definition. * * Orientation and storage can also be specified, otherwise a \c row_major and \c unbounded_array are used. It is \b not * required by the storage to initialize elements of the matrix. * * \tparam T the type of object stored in the matrix (like double, float, complex, etc...) * \tparam L the storage organization. It can be either \c row_major or \c column_major. Default is \c row_major * \tparam A the type of Storage array. Default is \c unbounded_array */ template class matrix: public matrix_container > { typedef T *pointer; typedef L layout_type; typedef matrix self_type; public: #ifdef BOOST_UBLAS_ENABLE_PROXY_SHORTCUTS using matrix_container::operator (); #endif typedef typename A::size_type size_type; typedef typename A::difference_type difference_type; typedef T value_type; typedef const T &const_reference; typedef T &reference; typedef A array_type; typedef const matrix_reference const_closure_type; typedef matrix_reference closure_type; typedef vector vector_temporary_type; typedef self_type matrix_temporary_type; typedef dense_tag storage_category; // This could be better for performance, // typedef typename unknown_orientation_tag orientation_category; // but others depend on the orientation information... typedef typename L::orientation_category orientation_category; // Construction and destruction /// Default dense matrix constructor. Make a dense matrix of size (0,0) BOOST_UBLAS_INLINE matrix (): matrix_container (), size1_ (0), size2_ (0), data_ () {} /** Dense matrix constructor with defined size * \param size1 number of rows * \param size2 number of columns */ BOOST_UBLAS_INLINE matrix (size_type size1, size_type size2): matrix_container (), size1_ (size1), size2_ (size2), data_ (layout_type::storage_size (size1, size2)) { } /** Dense matrix constructor with defined size a initial value for all the matrix elements * \param size1 number of rows * \param size2 number of columns * \param init initial value assigned to all elements */ matrix (size_type size1, size_type size2, const value_type &init): matrix_container (), size1_ (size1), size2_ (size2), data_ (layout_type::storage_size (size1, size2), init) { } /** Dense matrix constructor with defined size and an initial data array * \param size1 number of rows * \param size2 number of columns * \param data array to copy into the matrix. Must have the same dimension as the matrix */ BOOST_UBLAS_INLINE matrix (size_type size1, size_type size2, const array_type &data): matrix_container (), size1_ (size1), size2_ (size2), data_ (data) {} /** Copy-constructor of a dense matrix * \param m is a dense matrix */ BOOST_UBLAS_INLINE matrix (const matrix &m): matrix_container (), size1_ (m.size1_), size2_ (m.size2_), data_ (m.data_) {} /** Copy-constructor of a dense matrix from a matrix expression * \param ae is a matrix expression */ template BOOST_UBLAS_INLINE matrix (const matrix_expression &ae): matrix_container (), size1_ (ae ().size1 ()), size2_ (ae ().size2 ()), data_ (layout_type::storage_size (size1_, size2_)) { matrix_assign (*this, ae); } // Accessors /** Return the number of rows of the matrix * You can also use the free size<>() function in operation/size.hpp as size<1>(m) where m is a matrix */ BOOST_UBLAS_INLINE size_type size1 () const { return size1_; } /** Return the number of colums of the matrix * You can also use the free size<>() function in operation/size.hpp as size<2>(m) where m is a matrix */ BOOST_UBLAS_INLINE size_type size2 () const { return size2_; } // Storage accessors /** Return a constant reference to the internal storage of a dense matrix, i.e. the raw data * It's type depends on the type used by the matrix to store its data */ BOOST_UBLAS_INLINE const array_type &data () const { return data_; } /** Return a reference to the internal storage of a dense matrix, i.e. the raw data * It's type depends on the type used by the matrix to store its data */ BOOST_UBLAS_INLINE array_type &data () { return data_; } // Resizing /** Resize a matrix to new dimensions * If data are preserved, then if the size if bigger at least on one dimension, extra values are filled with zeros. * If data are not preserved, then nothing has to be assumed regarding the content of the matrix after resizing. * \param size1 the new number of rows * \param size2 the new number of colums * \param preserve a boolean to say if one wants the data to be preserved during the resizing. Default is true. */ BOOST_UBLAS_INLINE void resize (size_type size1, size_type size2, bool preserve = true) { if (preserve) { self_type temporary (size1, size2); detail::matrix_resize_preserve (*this, temporary); } else { data ().resize (layout_type::storage_size (size1, size2)); size1_ = size1; size2_ = size2; } } // Element access /** Access a matrix element. Here we return a const reference * \param i the first coordinate of the element. By default it's the row * \param j the second coordinate of the element. By default it's the column * \return a const reference to the element */ BOOST_UBLAS_INLINE const_reference operator () (size_type i, size_type j) const { return data () [layout_type::element (i, size1_, j, size2_)]; } /** Access a matrix element. Here we return a reference * \param i the first coordinate of the element. By default it's the row * \param j the second coordinate of the element. By default it's the column * \return a reference to the element */ BOOST_UBLAS_INLINE reference at_element (size_type i, size_type j) { return data () [layout_type::element (i, size1_, j, size2_)]; } /** Access a matrix element. Here we return a reference * \param i the first coordinate of the element. By default it's the row * \param j the second coordinate of the element. By default it's the column * \return a reference to the element */ BOOST_UBLAS_INLINE reference operator () (size_type i, size_type j) { return at_element (i, j); } // Element assignment /** Change the value of a matrix element. Return back a reference to it * \param i the first coordinate of the element. By default it's the row * \param j the second coordinate of the element. By default it's the column * \param t the new value of the element * \return a reference to the newly changed element */ BOOST_UBLAS_INLINE reference insert_element (size_type i, size_type j, const_reference t) { return (at_element (i, j) = t); } /** Erase the element * For most types (int, double, etc...) it means setting 0 (zero) the element at zero in fact. * For user-defined types, it could be another value if you decided it. Your type in that case must * contain a default null value. * \param i the first coordinate of the element. By default it's the row * \param j the second coordinate of the element. By default it's the column */ void erase_element (size_type i, size_type j) { at_element (i, j) = value_type/*zero*/(); } // Zeroing /** Erase all elements in the matrix * For most types (int, double, etc...) it means writing 0 (zero) everywhere. * For user-defined types, it could be another value if you decided it. Your type in that case must * contain a default null value. */ BOOST_UBLAS_INLINE void clear () { std::fill (data ().begin (), data ().end (), value_type/*zero*/()); } // Assignment #ifdef BOOST_UBLAS_MOVE_SEMANTICS /*! @note "pass by value" the key idea to enable move semantics */ BOOST_UBLAS_INLINE matrix &operator = (matrix m) { assign_temporary(m); return *this; } #else BOOST_UBLAS_INLINE matrix &operator = (const matrix &m) { size1_ = m.size1_; size2_ = m.size2_; data () = m.data (); return *this; } #endif template // Container assignment without temporary BOOST_UBLAS_INLINE matrix &operator = (const matrix_container &m) { resize (m ().size1 (), m ().size2 (), false); assign (m); return *this; } BOOST_UBLAS_INLINE matrix &assign_temporary (matrix &m) { swap (m); return *this; } template BOOST_UBLAS_INLINE matrix &operator = (const matrix_expression &ae) { self_type temporary (ae); return assign_temporary (temporary); } template BOOST_UBLAS_INLINE matrix &assign (const matrix_expression &ae) { matrix_assign (*this, ae); return *this; } template BOOST_UBLAS_INLINE matrix& operator += (const matrix_expression &ae) { self_type temporary (*this + ae); return assign_temporary (temporary); } template // Container assignment without temporary BOOST_UBLAS_INLINE matrix &operator += (const matrix_container &m) { plus_assign (m); return *this; } template BOOST_UBLAS_INLINE matrix &plus_assign (const matrix_expression &ae) { matrix_assign (*this, ae); return *this; } template BOOST_UBLAS_INLINE matrix& operator -= (const matrix_expression &ae) { self_type temporary (*this - ae); return assign_temporary (temporary); } template // Container assignment without temporary BOOST_UBLAS_INLINE matrix &operator -= (const matrix_container &m) { minus_assign (m); return *this; } template BOOST_UBLAS_INLINE matrix &minus_assign (const matrix_expression &ae) { matrix_assign (*this, ae); return *this; } template BOOST_UBLAS_INLINE matrix& operator *= (const AT &at) { matrix_assign_scalar (*this, at); return *this; } template BOOST_UBLAS_INLINE matrix& operator /= (const AT &at) { matrix_assign_scalar (*this, at); return *this; } // Swapping BOOST_UBLAS_INLINE void swap (matrix &m) { if (this != &m) { std::swap (size1_, m.size1_); std::swap (size2_, m.size2_); data ().swap (m.data ()); } } BOOST_UBLAS_INLINE friend void swap (matrix &m1, matrix &m2) { m1.swap (m2); } // Iterator types private: // Use the storage array iterator typedef typename A::const_iterator const_subiterator_type; typedef typename A::iterator subiterator_type; public: #ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR typedef indexed_iterator1 iterator1; typedef indexed_iterator2 iterator2; typedef indexed_const_iterator1 const_iterator1; typedef indexed_const_iterator2 const_iterator2; #else class const_iterator1; class iterator1; class const_iterator2; class iterator2; #endif typedef reverse_iterator_base1 const_reverse_iterator1; typedef reverse_iterator_base1 reverse_iterator1; typedef reverse_iterator_base2 const_reverse_iterator2; typedef reverse_iterator_base2 reverse_iterator2; // Element lookup BOOST_UBLAS_INLINE const_iterator1 find1 (int /* rank */, size_type i, size_type j) const { #ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR return const_iterator1 (*this, i, j); #else return const_iterator1 (*this, data ().begin () + layout_type::address (i, size1_, j, size2_)); #endif } BOOST_UBLAS_INLINE iterator1 find1 (int /* rank */, size_type i, size_type j) { #ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR return iterator1 (*this, i, j); #else return iterator1 (*this, data ().begin () + layout_type::address (i, size1_, j, size2_)); #endif } BOOST_UBLAS_INLINE const_iterator2 find2 (int /* rank */, size_type i, size_type j) const { #ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR return const_iterator2 (*this, i, j); #else return const_iterator2 (*this, data ().begin () + layout_type::address (i, size1_, j, size2_)); #endif } BOOST_UBLAS_INLINE iterator2 find2 (int /* rank */, size_type i, size_type j) { #ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR return iterator2 (*this, i, j); #else return iterator2 (*this, data ().begin () + layout_type::address (i, size1_, j, size2_)); #endif } #ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR class const_iterator1: public container_const_reference, public random_access_iterator_base { public: typedef typename matrix::value_type value_type; typedef typename matrix::difference_type difference_type; typedef typename matrix::const_reference reference; typedef const typename matrix::pointer pointer; typedef const_iterator2 dual_iterator_type; typedef const_reverse_iterator2 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE const_iterator1 (): container_const_reference (), it_ () {} BOOST_UBLAS_INLINE const_iterator1 (const self_type &m, const const_subiterator_type &it): container_const_reference (m), it_ (it) {} BOOST_UBLAS_INLINE const_iterator1 (const iterator1 &it): container_const_reference (it ()), it_ (it.it_) {} // Arithmetic BOOST_UBLAS_INLINE const_iterator1 &operator ++ () { layout_type::increment_i (it_, (*this) ().size1 (), (*this) ().size2 ()); return *this; } BOOST_UBLAS_INLINE const_iterator1 &operator -- () { layout_type::decrement_i (it_, (*this) ().size1 (), (*this) ().size2 ()); return *this; } BOOST_UBLAS_INLINE const_iterator1 &operator += (difference_type n) { layout_type::increment_i (it_, n, (*this) ().size1 (), (*this) ().size2 ()); return *this; } BOOST_UBLAS_INLINE const_iterator1 &operator -= (difference_type n) { layout_type::decrement_i (it_, n, (*this) ().size1 (), (*this) ().size2 ()); return *this; } BOOST_UBLAS_INLINE difference_type operator - (const const_iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return layout_type::distance_i (it_ - it.it_, (*this) ().size1 (), (*this) ().size2 ()); } // Dereference BOOST_UBLAS_INLINE const_reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); return *it_; } BOOST_UBLAS_INLINE const_reference operator [] (difference_type n) const { return *(*this + n); } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator2 begin () const { const self_type &m = (*this) (); return m.find2 (1, index1 (), 0); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator2 end () const { const self_type &m = (*this) (); return m.find2 (1, index1 (), m.size2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator2 rbegin () const { return const_reverse_iterator2 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator2 rend () const { return const_reverse_iterator2 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { const self_type &m = (*this) (); return layout_type::index_i (it_ - m.begin1 ().it_, m.size1 (), m.size2 ()); } BOOST_UBLAS_INLINE size_type index2 () const { const self_type &m = (*this) (); return layout_type::index_j (it_ - m.begin1 ().it_, m.size1 (), m.size2 ()); } // Assignment BOOST_UBLAS_INLINE const_iterator1 &operator = (const const_iterator1 &it) { container_const_reference::assign (&it ()); it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const const_iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ == it.it_; } BOOST_UBLAS_INLINE bool operator < (const const_iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ < it.it_; } private: const_subiterator_type it_; friend class iterator1; }; #endif BOOST_UBLAS_INLINE const_iterator1 begin1 () const { return find1 (0, 0, 0); } BOOST_UBLAS_INLINE const_iterator1 end1 () const { return find1 (0, size1_, 0); } #ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR class iterator1: public container_reference, public random_access_iterator_base { public: typedef typename matrix::value_type value_type; typedef typename matrix::difference_type difference_type; typedef typename matrix::reference reference; typedef typename matrix::pointer pointer; typedef iterator2 dual_iterator_type; typedef reverse_iterator2 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE iterator1 (): container_reference (), it_ () {} BOOST_UBLAS_INLINE iterator1 (self_type &m, const subiterator_type &it): container_reference (m), it_ (it) {} // Arithmetic BOOST_UBLAS_INLINE iterator1 &operator ++ () { layout_type::increment_i (it_, (*this) ().size1 (), (*this) ().size2 ()); return *this; } BOOST_UBLAS_INLINE iterator1 &operator -- () { layout_type::decrement_i (it_, (*this) ().size1 (), (*this) ().size2 ()); return *this; } BOOST_UBLAS_INLINE iterator1 &operator += (difference_type n) { layout_type::increment_i (it_, n, (*this) ().size1 (), (*this) ().size2 ()); return *this; } BOOST_UBLAS_INLINE iterator1 &operator -= (difference_type n) { layout_type::decrement_i (it_, n, (*this) ().size1 (), (*this) ().size2 ()); return *this; } BOOST_UBLAS_INLINE difference_type operator - (const iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return layout_type::distance_i (it_ - it.it_, (*this) ().size1 (), (*this) ().size2 ()); } // Dereference BOOST_UBLAS_INLINE reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); return *it_; } BOOST_UBLAS_INLINE reference operator [] (difference_type n) const { return *(*this + n); } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator2 begin () const { self_type &m = (*this) (); return m.find2 (1, index1 (), 0); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator2 end () const { self_type &m = (*this) (); return m.find2 (1, index1 (), m.size2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator2 rbegin () const { return reverse_iterator2 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator2 rend () const { return reverse_iterator2 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { self_type &m = (*this) (); return layout_type::index_i (it_ - m.begin1 ().it_, m.size1 (), m.size2 ()); } BOOST_UBLAS_INLINE size_type index2 () const { self_type &m = (*this) (); return layout_type::index_j (it_ - m.begin1 ().it_, m.size1 (), m.size2 ()); } // Assignment BOOST_UBLAS_INLINE iterator1 &operator = (const iterator1 &it) { container_reference::assign (&it ()); it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ == it.it_; } BOOST_UBLAS_INLINE bool operator < (const iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ < it.it_; } private: subiterator_type it_; friend class const_iterator1; }; #endif BOOST_UBLAS_INLINE iterator1 begin1 () { return find1 (0, 0, 0); } BOOST_UBLAS_INLINE iterator1 end1 () { return find1 (0, size1_, 0); } #ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR class const_iterator2: public container_const_reference, public random_access_iterator_base { public: typedef typename matrix::value_type value_type; typedef typename matrix::difference_type difference_type; typedef typename matrix::const_reference reference; typedef const typename matrix::pointer pointer; typedef const_iterator1 dual_iterator_type; typedef const_reverse_iterator1 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE const_iterator2 (): container_const_reference (), it_ () {} BOOST_UBLAS_INLINE const_iterator2 (const self_type &m, const const_subiterator_type &it): container_const_reference (m), it_ (it) {} BOOST_UBLAS_INLINE const_iterator2 (const iterator2 &it): container_const_reference (it ()), it_ (it.it_) {} // Arithmetic BOOST_UBLAS_INLINE const_iterator2 &operator ++ () { layout_type::increment_j (it_, (*this) ().size1 (), (*this) ().size2 ()); return *this; } BOOST_UBLAS_INLINE const_iterator2 &operator -- () { layout_type::decrement_j (it_, (*this) ().size1 (), (*this) ().size2 ()); return *this; } BOOST_UBLAS_INLINE const_iterator2 &operator += (difference_type n) { layout_type::increment_j (it_, n, (*this) ().size1 (), (*this) ().size2 ()); return *this; } BOOST_UBLAS_INLINE const_iterator2 &operator -= (difference_type n) { layout_type::decrement_j (it_, n, (*this) ().size1 (), (*this) ().size2 ()); return *this; } BOOST_UBLAS_INLINE difference_type operator - (const const_iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return layout_type::distance_j (it_ - it.it_, (*this) ().size1 (), (*this) ().size2 ()); } // Dereference BOOST_UBLAS_INLINE const_reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); return *it_; } BOOST_UBLAS_INLINE const_reference operator [] (difference_type n) const { return *(*this + n); } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator1 begin () const { const self_type &m = (*this) (); return m.find1 (1, 0, index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator1 end () const { const self_type &m = (*this) (); return m.find1 (1, m.size1 (), index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator1 rbegin () const { return const_reverse_iterator1 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator1 rend () const { return const_reverse_iterator1 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { const self_type &m = (*this) (); return layout_type::index_i (it_ - m.begin2 ().it_, m.size1 (), m.size2 ()); } BOOST_UBLAS_INLINE size_type index2 () const { const self_type &m = (*this) (); return layout_type::index_j (it_ - m.begin2 ().it_, m.size1 (), m.size2 ()); } // Assignment BOOST_UBLAS_INLINE const_iterator2 &operator = (const const_iterator2 &it) { container_const_reference::assign (&it ()); it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const const_iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ == it.it_; } BOOST_UBLAS_INLINE bool operator < (const const_iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ < it.it_; } private: const_subiterator_type it_; friend class iterator2; }; #endif BOOST_UBLAS_INLINE const_iterator2 begin2 () const { return find2 (0, 0, 0); } BOOST_UBLAS_INLINE const_iterator2 end2 () const { return find2 (0, 0, size2_); } #ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR class iterator2: public container_reference, public random_access_iterator_base { public: typedef typename matrix::value_type value_type; typedef typename matrix::difference_type difference_type; typedef typename matrix::reference reference; typedef typename matrix::pointer pointer; typedef iterator1 dual_iterator_type; typedef reverse_iterator1 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE iterator2 (): container_reference (), it_ () {} BOOST_UBLAS_INLINE iterator2 (self_type &m, const subiterator_type &it): container_reference (m), it_ (it) {} // Arithmetic BOOST_UBLAS_INLINE iterator2 &operator ++ () { layout_type::increment_j (it_, (*this) ().size1 (), (*this) ().size2 ()); return *this; } BOOST_UBLAS_INLINE iterator2 &operator -- () { layout_type::decrement_j (it_, (*this) ().size1 (), (*this) ().size2 ()); return *this; } BOOST_UBLAS_INLINE iterator2 &operator += (difference_type n) { layout_type::increment_j (it_, n, (*this) ().size1 (), (*this) ().size2 ()); return *this; } BOOST_UBLAS_INLINE iterator2 &operator -= (difference_type n) { layout_type::decrement_j (it_, n, (*this) ().size1 (), (*this) ().size2 ()); return *this; } BOOST_UBLAS_INLINE difference_type operator - (const iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return layout_type::distance_j (it_ - it.it_, (*this) ().size1 (), (*this) ().size2 ()); } // Dereference BOOST_UBLAS_INLINE reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); return *it_; } BOOST_UBLAS_INLINE reference operator [] (difference_type n) const { return *(*this + n); } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator1 begin () const { self_type &m = (*this) (); return m.find1 (1, 0, index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator1 end () const { self_type &m = (*this) (); return m.find1 (1, m.size1 (), index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator1 rbegin () const { return reverse_iterator1 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator1 rend () const { return reverse_iterator1 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { self_type &m = (*this) (); return layout_type::index_i (it_ - m.begin2 ().it_, m.size1 (), m.size2 ()); } BOOST_UBLAS_INLINE size_type index2 () const { self_type &m = (*this) (); return layout_type::index_j (it_ - m.begin2 ().it_, m.size1 (), m.size2 ()); } // Assignment BOOST_UBLAS_INLINE iterator2 &operator = (const iterator2 &it) { container_reference::assign (&it ()); it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ == it.it_; } BOOST_UBLAS_INLINE bool operator < (const iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ < it.it_; } private: subiterator_type it_; friend class const_iterator2; }; #endif BOOST_UBLAS_INLINE iterator2 begin2 () { return find2 (0, 0, 0); } BOOST_UBLAS_INLINE iterator2 end2 () { return find2 (0, 0, size2_); } // Reverse iterators BOOST_UBLAS_INLINE const_reverse_iterator1 rbegin1 () const { return const_reverse_iterator1 (end1 ()); } BOOST_UBLAS_INLINE const_reverse_iterator1 rend1 () const { return const_reverse_iterator1 (begin1 ()); } BOOST_UBLAS_INLINE reverse_iterator1 rbegin1 () { return reverse_iterator1 (end1 ()); } BOOST_UBLAS_INLINE reverse_iterator1 rend1 () { return reverse_iterator1 (begin1 ()); } BOOST_UBLAS_INLINE const_reverse_iterator2 rbegin2 () const { return const_reverse_iterator2 (end2 ()); } BOOST_UBLAS_INLINE const_reverse_iterator2 rend2 () const { return const_reverse_iterator2 (begin2 ()); } BOOST_UBLAS_INLINE reverse_iterator2 rbegin2 () { return reverse_iterator2 (end2 ()); } BOOST_UBLAS_INLINE reverse_iterator2 rend2 () { return reverse_iterator2 (begin2 ()); } // Serialization template void serialize(Archive & ar, const unsigned int /* file_version */){ // we need to copy to a collection_size_type to get a portable // and efficient serialization serialization::collection_size_type s1 (size1_); serialization::collection_size_type s2 (size2_); // serialize the sizes ar & serialization::make_nvp("size1",s1) & serialization::make_nvp("size2",s2); // copy the values back if loading if (Archive::is_loading::value) { size1_ = s1; size2_ = s2; } ar & serialization::make_nvp("data",data_); } private: size_type size1_; size_type size2_; array_type data_; }; /** \brief A dense matrix of values of type \c T with a variable size bounded to a maximum of \f$M\f$ by \f$N\f$. * * For a \f$(m \times n)\f$-dimensional matrix and \f$ 0 \leq i < m, 0 \leq j < n\f$, every element \f$m_{i,j}\f$ is mapped * to the \f$(i.n + j)\f$-th element of the container for row major orientation or the \f$(i + j.m)\f$-th element * of the container for column major orientation. Finally in a dense matrix all elements are represented in memory * in a contiguous chunk of memory. * * Orientation can be specified. Default is \c row_major * The default constructor creates the matrix with size \f$M\f$ by \f$N\f$. Elements are constructed by the storage * type \c bounded_array, which need not initialise their value. * * \tparam T the type of object stored in the matrix (like double, float, complex, etc...) * \tparam M maximum and default number of rows (if not specified at construction) * \tparam N maximum and default number of columns (if not specified at construction) * \tparam L the storage organization. It can be either \c row_major or \c column_major. Default is \c row_major */ template class bounded_matrix: public matrix > { typedef matrix > matrix_type; public: typedef typename matrix_type::size_type size_type; static const size_type max_size1 = M; static const size_type max_size2 = N; // Construction and destruction BOOST_UBLAS_INLINE bounded_matrix (): matrix_type (M, N) {} BOOST_UBLAS_INLINE bounded_matrix (size_type size1, size_type size2): matrix_type (size1, size2) {} BOOST_UBLAS_INLINE bounded_matrix (const bounded_matrix &m): matrix_type (m) {} template // Allow matrix > construction BOOST_UBLAS_INLINE bounded_matrix (const matrix &m): matrix_type (m) {} template BOOST_UBLAS_INLINE bounded_matrix (const matrix_expression &ae): matrix_type (ae) {} BOOST_UBLAS_INLINE ~bounded_matrix () {} // Assignment #ifdef BOOST_UBLAS_MOVE_SEMANTICS /*! @note "pass by value" the key idea to enable move semantics */ BOOST_UBLAS_INLINE bounded_matrix &operator = (bounded_matrix m) { matrix_type::operator = (m); return *this; } #else BOOST_UBLAS_INLINE bounded_matrix &operator = (const bounded_matrix &m) { matrix_type::operator = (m); return *this; } #endif template // Generic matrix assignment BOOST_UBLAS_INLINE bounded_matrix &operator = (const matrix &m) { matrix_type::operator = (m); return *this; } template // Container assignment without temporary BOOST_UBLAS_INLINE bounded_matrix &operator = (const matrix_container &m) { matrix_type::operator = (m); return *this; } template BOOST_UBLAS_INLINE bounded_matrix &operator = (const matrix_expression &ae) { matrix_type::operator = (ae); return *this; } }; /** \brief A dense matrix of values of type \c T stored as a vector of vectors. * * Rows or columns are not stored into contiguous chunks of memory but data inside rows (or columns) are. * Orientation and storage can also be specified, otherwise a row major and unbounded arrays are used. * The data is stored as a vector of vectors, meaning that rows or columns might not be stored into contiguous chunks * of memory. Orientation and storage can also be specified, otherwise a row major and unbounded arrays are used. * The storage type defaults to \c unbounded_array> and orientation is \c row_major. It is \b not * required by the storage to initialize elements of the matrix. For a \f$(m \times n)\f$-dimensional matrix and * \f$ 0 \leq i < m, 0 \leq j < n\f$, every element \f$m_{i,j}\f$ is mapped to the \f$(i.n + j)\f$-th element of the * container for row major orientation or the \f$(i + j.m)\f$-th element of the container for column major orientation. * * \tparam T the type of object stored in the matrix (like double, float, complex, etc...) * \tparam L the storage organization. It can be either \c row_major or \c column_major. By default it is \c row_major * \tparam A the type of Storage array. By default, it is an \unbounded_array> */ template class vector_of_vector: public matrix_container > { typedef T *pointer; typedef L layout_type; typedef vector_of_vector self_type; public: #ifdef BOOST_UBLAS_ENABLE_PROXY_SHORTCUTS using matrix_container::operator (); #endif typedef typename A::size_type size_type; typedef typename A::difference_type difference_type; typedef T value_type; typedef const T &const_reference; typedef T &reference; typedef A array_type; typedef const matrix_reference const_closure_type; typedef matrix_reference closure_type; typedef vector vector_temporary_type; typedef self_type matrix_temporary_type; typedef dense_tag storage_category; // This could be better for performance, // typedef typename unknown_orientation_tag orientation_category; // but others depend on the orientation information... typedef typename L::orientation_category orientation_category; // Construction and destruction BOOST_UBLAS_INLINE vector_of_vector (): matrix_container (), size1_ (0), size2_ (0), data_ (1) {} BOOST_UBLAS_INLINE vector_of_vector (size_type size1, size_type size2): matrix_container (), size1_ (size1), size2_ (size2), data_ (1) { resize (size1, size2, true); } BOOST_UBLAS_INLINE vector_of_vector (const vector_of_vector &m): matrix_container (), size1_ (m.size1_), size2_ (m.size2_), data_ (m.data_) {} template BOOST_UBLAS_INLINE vector_of_vector (const matrix_expression &ae): matrix_container (), size1_ (ae ().size1 ()), size2_ (ae ().size2 ()), data_ (layout_type::size_M (size1_, size2_) + 1) { for (size_type k = 0; k < layout_type::size_M (size1_, size2_); ++ k) data ()[k].resize (layout_type::size_m (size1_, size2_)); matrix_assign (*this, ae); } // Accessors BOOST_UBLAS_INLINE size_type size1 () const { return size1_; } BOOST_UBLAS_INLINE size_type size2 () const { return size2_; } // Storage accessors BOOST_UBLAS_INLINE const array_type &data () const { return data_; } BOOST_UBLAS_INLINE array_type &data () { return data_; } // Resizing BOOST_UBLAS_INLINE void resize (size_type size1, size_type size2, bool preserve = true) { size1_ = size1; size2_ = size2; if (preserve) data ().resize (layout_type::size_M (size1, size2) + 1, typename array_type::value_type ()); else data ().resize (layout_type::size_M (size1, size2) + 1); for (size_type k = 0; k < layout_type::size_M (size1, size2); ++ k) { if (preserve) data () [k].resize (layout_type::size_m (size1, size2), value_type ()); else data () [k].resize (layout_type::size_m (size1, size2)); } } // Element access BOOST_UBLAS_INLINE const_reference operator () (size_type i, size_type j) const { return data () [layout_type::index_M (i, j)] [layout_type::index_m (i, j)]; } BOOST_UBLAS_INLINE reference at_element (size_type i, size_type j) { return data () [layout_type::index_M (i, j)] [layout_type::index_m (i, j)]; } BOOST_UBLAS_INLINE reference operator () (size_type i, size_type j) { return at_element (i, j); } // Element assignment BOOST_UBLAS_INLINE reference insert_element (size_type i, size_type j, const_reference t) { return (at_element (i, j) = t); } BOOST_UBLAS_INLINE void erase_element (size_type i, size_type j) { at_element (i, j) = value_type/*zero*/(); } // Zeroing BOOST_UBLAS_INLINE void clear () { for (size_type k = 0; k < layout_type::size_M (size1_, size2_); ++ k) std::fill (data () [k].begin (), data () [k].end (), value_type/*zero*/()); } // Assignment BOOST_UBLAS_INLINE vector_of_vector &operator = (const vector_of_vector &m) { size1_ = m.size1_; size2_ = m.size2_; data () = m.data (); return *this; } BOOST_UBLAS_INLINE vector_of_vector &assign_temporary (vector_of_vector &m) { swap (m); return *this; } template BOOST_UBLAS_INLINE vector_of_vector &operator = (const matrix_expression &ae) { self_type temporary (ae); return assign_temporary (temporary); } template // Container assignment without temporary BOOST_UBLAS_INLINE vector_of_vector &operator = (const matrix_container &m) { resize (m ().size1 (), m ().size2 (), false); assign (m); return *this; } template BOOST_UBLAS_INLINE vector_of_vector &assign (const matrix_expression &ae) { matrix_assign (*this, ae); return *this; } template BOOST_UBLAS_INLINE vector_of_vector& operator += (const matrix_expression &ae) { self_type temporary (*this + ae); return assign_temporary (temporary); } template // Container assignment without temporary BOOST_UBLAS_INLINE vector_of_vector &operator += (const matrix_container &m) { plus_assign (m); return *this; } template BOOST_UBLAS_INLINE vector_of_vector &plus_assign (const matrix_expression &ae) { matrix_assign (*this, ae); return *this; } template BOOST_UBLAS_INLINE vector_of_vector& operator -= (const matrix_expression &ae) { self_type temporary (*this - ae); return assign_temporary (temporary); } template // Container assignment without temporary BOOST_UBLAS_INLINE vector_of_vector &operator -= (const matrix_container &m) { minus_assign (m); return *this; } template BOOST_UBLAS_INLINE vector_of_vector &minus_assign (const matrix_expression &ae) { matrix_assign (*this, ae); return *this; } template BOOST_UBLAS_INLINE vector_of_vector& operator *= (const AT &at) { matrix_assign_scalar (*this, at); return *this; } template BOOST_UBLAS_INLINE vector_of_vector& operator /= (const AT &at) { matrix_assign_scalar (*this, at); return *this; } // Swapping BOOST_UBLAS_INLINE void swap (vector_of_vector &m) { if (this != &m) { std::swap (size1_, m.size1_); std::swap (size2_, m.size2_); data ().swap (m.data ()); } } BOOST_UBLAS_INLINE friend void swap (vector_of_vector &m1, vector_of_vector &m2) { m1.swap (m2); } // Iterator types private: // Use the vector iterator typedef typename A::value_type::const_iterator const_subiterator_type; typedef typename A::value_type::iterator subiterator_type; public: #ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR typedef indexed_iterator1 iterator1; typedef indexed_iterator2 iterator2; typedef indexed_const_iterator1 const_iterator1; typedef indexed_const_iterator2 const_iterator2; #else class const_iterator1; class iterator1; class const_iterator2; class iterator2; #endif typedef reverse_iterator_base1 const_reverse_iterator1; typedef reverse_iterator_base1 reverse_iterator1; typedef reverse_iterator_base2 const_reverse_iterator2; typedef reverse_iterator_base2 reverse_iterator2; // Element lookup BOOST_UBLAS_INLINE const_iterator1 find1 (int /*rank*/, size_type i, size_type j) const { #ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR return const_iterator1 (*this, i, j); #else return const_iterator1 (*this, i, j, data () [layout_type::index_M (i, j)].begin () + layout_type::index_m (i, j)); #endif } BOOST_UBLAS_INLINE iterator1 find1 (int /*rank*/, size_type i, size_type j) { #ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR return iterator1 (*this, i, j); #else return iterator1 (*this, i, j, data () [layout_type::index_M (i, j)].begin () + layout_type::index_m (i, j)); #endif } BOOST_UBLAS_INLINE const_iterator2 find2 (int /*rank*/, size_type i, size_type j) const { #ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR return const_iterator2 (*this, i, j); #else return const_iterator2 (*this, i, j, data () [layout_type::index_M (i, j)].begin () + layout_type::index_m (i, j)); #endif } BOOST_UBLAS_INLINE iterator2 find2 (int /*rank*/, size_type i, size_type j) { #ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR return iterator2 (*this, i, j); #else return iterator2 (*this, i, j, data () [layout_type::index_M (i, j)].begin () + layout_type::index_m (i, j)); #endif } #ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR class const_iterator1: public container_const_reference, public random_access_iterator_base { public: typedef typename vector_of_vector::value_type value_type; typedef typename vector_of_vector::difference_type difference_type; typedef typename vector_of_vector::const_reference reference; typedef const typename vector_of_vector::pointer pointer; typedef const_iterator2 dual_iterator_type; typedef const_reverse_iterator2 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE const_iterator1 (): container_const_reference (), i_ (), j_ (), it_ () {} BOOST_UBLAS_INLINE const_iterator1 (const self_type &m, size_type i, size_type j, const const_subiterator_type &it): container_const_reference (m), i_ (i), j_ (j), it_ (it) {} BOOST_UBLAS_INLINE const_iterator1 (const iterator1 &it): container_const_reference (it ()), i_ (it.i_), j_ (it.j_), it_ (it.it_) {} // Arithmetic BOOST_UBLAS_INLINE const_iterator1 &operator ++ () { ++ i_; const self_type &m = (*this) (); if (layout_type::fast_i ()) ++ it_; else it_ = m.find1 (1, i_, j_).it_; return *this; } BOOST_UBLAS_INLINE const_iterator1 &operator -- () { -- i_; const self_type &m = (*this) (); if (layout_type::fast_i ()) -- it_; else it_ = m.find1 (1, i_, j_).it_; return *this; } BOOST_UBLAS_INLINE const_iterator1 &operator += (difference_type n) { i_ += n; const self_type &m = (*this) (); it_ = m.find1 (1, i_, j_).it_; return *this; } BOOST_UBLAS_INLINE const_iterator1 &operator -= (difference_type n) { i_ -= n; const self_type &m = (*this) (); it_ = m.find1 (1, i_, j_).it_; return *this; } BOOST_UBLAS_INLINE difference_type operator - (const const_iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (index2 () == it.index2 (), bad_index ()); return index1 () - it.index1 (); } // Dereference BOOST_UBLAS_INLINE const_reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); return *it_; } BOOST_UBLAS_INLINE const_reference operator [] (difference_type n) const { return *(*this + n); } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator2 begin () const { const self_type &m = (*this) (); return m.find2 (1, index1 (), 0); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator2 end () const { const self_type &m = (*this) (); return m.find2 (1, index1 (), m.size2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator2 rbegin () const { return const_reverse_iterator2 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator2 rend () const { return const_reverse_iterator2 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { return i_; } BOOST_UBLAS_INLINE size_type index2 () const { return j_; } // Assignment BOOST_UBLAS_INLINE const_iterator1 &operator = (const const_iterator1 &it) { container_const_reference::assign (&it ()); it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const const_iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (index2 () == it.index2 (), bad_index ()); return it_ == it.it_; } BOOST_UBLAS_INLINE bool operator < (const const_iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (index2 () == it.index2 (), bad_index ()); return it_ < it.it_; } private: size_type i_; size_type j_; const_subiterator_type it_; friend class iterator1; }; #endif BOOST_UBLAS_INLINE const_iterator1 begin1 () const { return find1 (0, 0, 0); } BOOST_UBLAS_INLINE const_iterator1 end1 () const { return find1 (0, size1_, 0); } #ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR class iterator1: public container_reference, public random_access_iterator_base { public: typedef typename vector_of_vector::value_type value_type; typedef typename vector_of_vector::difference_type difference_type; typedef typename vector_of_vector::reference reference; typedef typename vector_of_vector::pointer pointer; typedef iterator2 dual_iterator_type; typedef reverse_iterator2 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE iterator1 (): container_reference (), i_ (), j_ (), it_ () {} BOOST_UBLAS_INLINE iterator1 (self_type &m, size_type i, size_type j, const subiterator_type &it): container_reference (m), i_ (i), j_ (j), it_ (it) {} // Arithmetic BOOST_UBLAS_INLINE iterator1 &operator ++ () { ++ i_; self_type &m = (*this) (); if (layout_type::fast_i ()) ++ it_; else it_ = m.find1 (1, i_, j_).it_; return *this; } BOOST_UBLAS_INLINE iterator1 &operator -- () { -- i_; self_type &m = (*this) (); if (layout_type::fast_i ()) -- it_; else it_ = m.find1 (1, i_, j_).it_; return *this; } BOOST_UBLAS_INLINE iterator1 &operator += (difference_type n) { i_ += n; self_type &m = (*this) (); it_ = m.find1 (1, i_, j_).it_; return *this; } BOOST_UBLAS_INLINE iterator1 &operator -= (difference_type n) { i_ -= n; self_type &m = (*this) (); it_ = m.find1 (1, i_, j_).it_; return *this; } BOOST_UBLAS_INLINE difference_type operator - (const iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (index2 () == it.index2 (), bad_index ()); return index1 () - it.index1 (); } // Dereference BOOST_UBLAS_INLINE reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); return *it_; } BOOST_UBLAS_INLINE reference operator [] (difference_type n) const { return *(*this + n); } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator2 begin () const { self_type &m = (*this) (); return m.find2 (1, index1 (), 0); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator2 end () const { self_type &m = (*this) (); return m.find2 (1, index1 (), m.size2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator2 rbegin () const { return reverse_iterator2 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator2 rend () const { return reverse_iterator2 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { return i_; } BOOST_UBLAS_INLINE size_type index2 () const { return j_; } // Assignment BOOST_UBLAS_INLINE iterator1 &operator = (const iterator1 &it) { container_reference::assign (&it ()); it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (index2 () == it.index2 (), bad_index ()); return it_ == it.it_; } BOOST_UBLAS_INLINE bool operator < (const iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (index2 () == it.index2 (), bad_index ()); return it_ < it.it_; } private: size_type i_; size_type j_; subiterator_type it_; friend class const_iterator1; }; #endif BOOST_UBLAS_INLINE iterator1 begin1 () { return find1 (0, 0, 0); } BOOST_UBLAS_INLINE iterator1 end1 () { return find1 (0, size1_, 0); } #ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR class const_iterator2: public container_const_reference, public random_access_iterator_base { public: typedef typename vector_of_vector::value_type value_type; typedef typename vector_of_vector::difference_type difference_type; typedef typename vector_of_vector::const_reference reference; typedef const typename vector_of_vector::pointer pointer; typedef const_iterator1 dual_iterator_type; typedef const_reverse_iterator1 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE const_iterator2 (): container_const_reference (), i_ (), j_ (), it_ () {} BOOST_UBLAS_INLINE const_iterator2 (const self_type &m, size_type i, size_type j, const const_subiterator_type &it): container_const_reference (m), i_ (i), j_ (j), it_ (it) {} BOOST_UBLAS_INLINE const_iterator2 (const iterator2 &it): container_const_reference (it ()), i_ (it.i_), j_ (it.j_), it_ (it.it_) {} // Arithmetic BOOST_UBLAS_INLINE const_iterator2 &operator ++ () { ++ j_; const self_type &m = (*this) (); if (layout_type::fast_j ()) ++ it_; else it_ = m.find2 (1, i_, j_).it_; return *this; } BOOST_UBLAS_INLINE const_iterator2 &operator -- () { -- j_; const self_type &m = (*this) (); if (layout_type::fast_j ()) -- it_; else it_ = m.find2 (1, i_, j_).it_; return *this; } BOOST_UBLAS_INLINE const_iterator2 &operator += (difference_type n) { j_ += n; const self_type &m = (*this) (); it_ = m.find2 (1, i_, j_).it_; return *this; } BOOST_UBLAS_INLINE const_iterator2 &operator -= (difference_type n) { j_ -= n; const self_type &m = (*this) (); it_ = m.find2 (1, i_, j_).it_; return *this; } BOOST_UBLAS_INLINE difference_type operator - (const const_iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (index1 () == it.index1 (), bad_index ()); return index2 () - it.index2 (); } // Dereference BOOST_UBLAS_INLINE const_reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); return *it_; } BOOST_UBLAS_INLINE const_reference operator [] (difference_type n) const { return *(*this + n); } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator1 begin () const { const self_type &m = (*this) (); return m.find1 (1, 0, index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator1 end () const { const self_type &m = (*this) (); return m.find1 (1, m.size1 (), index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator1 rbegin () const { return const_reverse_iterator1 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator1 rend () const { return const_reverse_iterator1 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { return i_; } BOOST_UBLAS_INLINE size_type index2 () const { return j_; } // Assignment BOOST_UBLAS_INLINE const_iterator2 &operator = (const const_iterator2 &it) { container_const_reference::assign (&it ()); it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const const_iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (index1 () == it.index1 (), bad_index ()); return it_ == it.it_; } BOOST_UBLAS_INLINE bool operator < (const const_iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (index1 () == it.index1 (), bad_index ()); return it_ < it.it_; } private: size_type i_; size_type j_; const_subiterator_type it_; friend class iterator2; }; #endif BOOST_UBLAS_INLINE const_iterator2 begin2 () const { return find2 (0, 0, 0); } BOOST_UBLAS_INLINE const_iterator2 end2 () const { return find2 (0, 0, size2_); } #ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR class iterator2: public container_reference, public random_access_iterator_base { public: typedef typename vector_of_vector::value_type value_type; typedef typename vector_of_vector::difference_type difference_type; typedef typename vector_of_vector::reference reference; typedef typename vector_of_vector::pointer pointer; typedef iterator1 dual_iterator_type; typedef reverse_iterator1 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE iterator2 (): container_reference (), i_ (), j_ (), it_ () {} BOOST_UBLAS_INLINE iterator2 (self_type &m, size_type i, size_type j, const subiterator_type &it): container_reference (m), i_ (i), j_ (j), it_ (it) {} // Arithmetic BOOST_UBLAS_INLINE iterator2 &operator ++ () { ++ j_; self_type &m = (*this) (); if (layout_type::fast_j ()) ++ it_; else it_ = m.find2 (1, i_, j_).it_; return *this; } BOOST_UBLAS_INLINE iterator2 &operator -- () { -- j_; self_type &m = (*this) (); if (layout_type::fast_j ()) -- it_; else it_ = m.find2 (1, i_, j_).it_; return *this; } BOOST_UBLAS_INLINE iterator2 &operator += (difference_type n) { j_ += n; self_type &m = (*this) (); it_ = m.find2 (1, i_, j_).it_; return *this; } BOOST_UBLAS_INLINE iterator2 &operator -= (difference_type n) { j_ -= n; self_type &m = (*this) (); it_ = m.find2 (1, i_, j_).it_; return *this; } BOOST_UBLAS_INLINE difference_type operator - (const iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (index1 () == it.index1 (), bad_index ()); return index2 () - it.index2 (); } // Dereference BOOST_UBLAS_INLINE reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); return *it_; } BOOST_UBLAS_INLINE reference operator [] (difference_type n) const { return *(*this + n); } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator1 begin () const { self_type &m = (*this) (); return m.find1 (1, 0, index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator1 end () const { self_type &m = (*this) (); return m.find1 (1, m.size1 (), index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator1 rbegin () const { return reverse_iterator1 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator1 rend () const { return reverse_iterator1 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { return i_; } BOOST_UBLAS_INLINE size_type index2 () const { return j_; } // Assignment BOOST_UBLAS_INLINE iterator2 &operator = (const iterator2 &it) { container_reference::assign (&it ()); it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (index1 () == it.index1 (), bad_index ()); return it_ == it.it_; } BOOST_UBLAS_INLINE bool operator < (const iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (index1 () == it.index1 (), bad_index ()); return it_ < it.it_; } private: size_type i_; size_type j_; subiterator_type it_; friend class const_iterator2; }; #endif BOOST_UBLAS_INLINE iterator2 begin2 () { return find2 (0, 0, 0); } BOOST_UBLAS_INLINE iterator2 end2 () { return find2 (0, 0, size2_); } // Reverse iterators BOOST_UBLAS_INLINE const_reverse_iterator1 rbegin1 () const { return const_reverse_iterator1 (end1 ()); } BOOST_UBLAS_INLINE const_reverse_iterator1 rend1 () const { return const_reverse_iterator1 (begin1 ()); } BOOST_UBLAS_INLINE reverse_iterator1 rbegin1 () { return reverse_iterator1 (end1 ()); } BOOST_UBLAS_INLINE reverse_iterator1 rend1 () { return reverse_iterator1 (begin1 ()); } BOOST_UBLAS_INLINE const_reverse_iterator2 rbegin2 () const { return const_reverse_iterator2 (end2 ()); } BOOST_UBLAS_INLINE const_reverse_iterator2 rend2 () const { return const_reverse_iterator2 (begin2 ()); } BOOST_UBLAS_INLINE reverse_iterator2 rbegin2 () { return reverse_iterator2 (end2 ()); } BOOST_UBLAS_INLINE reverse_iterator2 rend2 () { return reverse_iterator2 (begin2 ()); } // Serialization template void serialize(Archive & ar, const unsigned int /* file_version */){ // we need to copy to a collection_size_type to get a portable // and efficient serialization serialization::collection_size_type s1 (size1_); serialization::collection_size_type s2 (size2_); // serialize the sizes ar & serialization::make_nvp("size1",s1) & serialization::make_nvp("size2",s2); // copy the values back if loading if (Archive::is_loading::value) { size1_ = s1; size2_ = s2; } ar & serialization::make_nvp("data",data_); } private: size_type size1_; size_type size2_; array_type data_; }; /** \brief A matrix with all values of type \c T equal to zero * * Changing values does not affect the matrix, however assigning it to a normal matrix will put zero * everywhere in the target matrix. All accesses are constant time, due to the trivial value. * * \tparam T the type of object stored in the matrix (like double, float, complex, etc...) * \tparam ALLOC an allocator for storing the zero element. By default, a standar allocator is used. */ template class zero_matrix: public matrix_container > { typedef const T *const_pointer; typedef zero_matrix self_type; public: #ifdef BOOST_UBLAS_ENABLE_PROXY_SHORTCUTS using matrix_container::operator (); #endif typedef typename ALLOC::size_type size_type; typedef typename ALLOC::difference_type difference_type; typedef T value_type; typedef const T &const_reference; typedef T &reference; typedef const matrix_reference const_closure_type; typedef matrix_reference closure_type; typedef sparse_tag storage_category; typedef unknown_orientation_tag orientation_category; // Construction and destruction BOOST_UBLAS_INLINE zero_matrix (): matrix_container (), size1_ (0), size2_ (0) {} BOOST_UBLAS_INLINE zero_matrix (size_type size): matrix_container (), size1_ (size), size2_ (size) {} BOOST_UBLAS_INLINE zero_matrix (size_type size1, size_type size2): matrix_container (), size1_ (size1), size2_ (size2) {} BOOST_UBLAS_INLINE zero_matrix (const zero_matrix &m): matrix_container (), size1_ (m.size1_), size2_ (m.size2_) {} // Accessors BOOST_UBLAS_INLINE size_type size1 () const { return size1_; } BOOST_UBLAS_INLINE size_type size2 () const { return size2_; } // Resizing BOOST_UBLAS_INLINE void resize (size_type size, bool preserve = true) { size1_ = size; size2_ = size; } BOOST_UBLAS_INLINE void resize (size_type size1, size_type size2, bool /*preserve*/ = true) { size1_ = size1; size2_ = size2; } // Element access BOOST_UBLAS_INLINE const_reference operator () (size_type /* i */, size_type /* j */) const { return zero_; } // Assignment BOOST_UBLAS_INLINE zero_matrix &operator = (const zero_matrix &m) { size1_ = m.size1_; size2_ = m.size2_; return *this; } BOOST_UBLAS_INLINE zero_matrix &assign_temporary (zero_matrix &m) { swap (m); return *this; } // Swapping BOOST_UBLAS_INLINE void swap (zero_matrix &m) { if (this != &m) { std::swap (size1_, m.size1_); std::swap (size2_, m.size2_); } } BOOST_UBLAS_INLINE friend void swap (zero_matrix &m1, zero_matrix &m2) { m1.swap (m2); } // Iterator types public: class const_iterator1; class const_iterator2; typedef reverse_iterator_base1 const_reverse_iterator1; typedef reverse_iterator_base2 const_reverse_iterator2; // Element lookup BOOST_UBLAS_INLINE const_iterator1 find1 (int /*rank*/, size_type /*i*/, size_type /*j*/) const { return const_iterator1 (*this); } BOOST_UBLAS_INLINE const_iterator2 find2 (int /*rank*/, size_type /*i*/, size_type /*j*/) const { return const_iterator2 (*this); } class const_iterator1: public container_const_reference, public bidirectional_iterator_base { public: typedef typename zero_matrix::value_type value_type; typedef typename zero_matrix::difference_type difference_type; typedef typename zero_matrix::const_reference reference; typedef typename zero_matrix::const_pointer pointer; typedef const_iterator2 dual_iterator_type; typedef const_reverse_iterator2 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE const_iterator1 (): container_const_reference () {} BOOST_UBLAS_INLINE const_iterator1 (const self_type &m): container_const_reference (m) {} // Arithmetic BOOST_UBLAS_INLINE const_iterator1 &operator ++ () { BOOST_UBLAS_CHECK_FALSE (bad_index ()); return *this; } BOOST_UBLAS_INLINE const_iterator1 &operator -- () { BOOST_UBLAS_CHECK_FALSE (bad_index ()); return *this; } // Dereference BOOST_UBLAS_INLINE const_reference operator * () const { BOOST_UBLAS_CHECK_FALSE (bad_index ()); return zero_; // arbitary return value } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator2 begin () const { return const_iterator2 ((*this) ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator2 end () const { return const_iterator2 ((*this) ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator2 rbegin () const { return const_reverse_iterator2 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator2 rend () const { return const_reverse_iterator2 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { BOOST_UBLAS_CHECK_FALSE (bad_index ()); return 0; // arbitary return value } BOOST_UBLAS_INLINE size_type index2 () const { BOOST_UBLAS_CHECK_FALSE (bad_index ()); return 0; // arbitary return value } // Assignment BOOST_UBLAS_INLINE const_iterator1 &operator = (const const_iterator1 &it) { container_const_reference::assign (&it ()); return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const const_iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); detail::ignore_unused_variable_warning(it); return true; } }; typedef const_iterator1 iterator1; BOOST_UBLAS_INLINE const_iterator1 begin1 () const { return const_iterator1 (*this); } BOOST_UBLAS_INLINE const_iterator1 end1 () const { return const_iterator1 (*this); } class const_iterator2: public container_const_reference, public bidirectional_iterator_base { public: typedef typename zero_matrix::value_type value_type; typedef typename zero_matrix::difference_type difference_type; typedef typename zero_matrix::const_reference reference; typedef typename zero_matrix::const_pointer pointer; typedef const_iterator1 dual_iterator_type; typedef const_reverse_iterator1 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE const_iterator2 (): container_const_reference () {} BOOST_UBLAS_INLINE const_iterator2 (const self_type &m): container_const_reference (m) {} // Arithmetic BOOST_UBLAS_INLINE const_iterator2 &operator ++ () { BOOST_UBLAS_CHECK_FALSE (bad_index ()); return *this; } BOOST_UBLAS_INLINE const_iterator2 &operator -- () { BOOST_UBLAS_CHECK_FALSE (bad_index ()); return *this; } // Dereference BOOST_UBLAS_INLINE const_reference operator * () const { BOOST_UBLAS_CHECK_FALSE (bad_index ()); return zero_; // arbitary return value } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator1 begin () const { return const_iterator1 ((*this) ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator1 end () const { return const_iterator1 ((*this) ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator1 rbegin () const { return const_reverse_iterator1 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator1 rend () const { return const_reverse_iterator1 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { BOOST_UBLAS_CHECK_FALSE (bad_index ()); return 0; // arbitary return value } BOOST_UBLAS_INLINE size_type index2 () const { BOOST_UBLAS_CHECK_FALSE (bad_index ()); return 0; // arbitary return value } // Assignment BOOST_UBLAS_INLINE const_iterator2 &operator = (const const_iterator2 &it) { container_const_reference::assign (&it ()); return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const const_iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); detail::ignore_unused_variable_warning(it); return true; } }; typedef const_iterator2 iterator2; BOOST_UBLAS_INLINE const_iterator2 begin2 () const { return find2 (0, 0, 0); } BOOST_UBLAS_INLINE const_iterator2 end2 () const { return find2 (0, 0, size2_); } // Reverse iterators BOOST_UBLAS_INLINE const_reverse_iterator1 rbegin1 () const { return const_reverse_iterator1 (end1 ()); } BOOST_UBLAS_INLINE const_reverse_iterator1 rend1 () const { return const_reverse_iterator1 (begin1 ()); } BOOST_UBLAS_INLINE const_reverse_iterator2 rbegin2 () const { return const_reverse_iterator2 (end2 ()); } BOOST_UBLAS_INLINE const_reverse_iterator2 rend2 () const { return const_reverse_iterator2 (begin2 ()); } // Serialization template void serialize(Archive & ar, const unsigned int /* file_version */){ // we need to copy to a collection_size_type to get a portable // and efficient serialization serialization::collection_size_type s1 (size1_); serialization::collection_size_type s2 (size2_); // serialize the sizes ar & serialization::make_nvp("size1",s1) & serialization::make_nvp("size2",s2); // copy the values back if loading if (Archive::is_loading::value) { size1_ = s1; size2_ = s2; } } private: size_type size1_; size_type size2_; static const value_type zero_; }; template const typename zero_matrix::value_type zero_matrix::zero_ = T(/*zero*/); /** \brief An identity matrix with values of type \c T * * Elements or cordinates \f$(i,i)\f$ are equal to 1 (one) and all others to 0 (zero). * Changing values does not affect the matrix, however assigning it to a normal matrix will * make the matrix equal to an identity matrix. All accesses are constant du to the trivial values. * * \tparam T the type of object stored in the matrix (like double, float, complex, etc...) * \tparam ALLOC an allocator for storing the zeros and one elements. By default, a standar allocator is used. */ template class identity_matrix: public matrix_container > { typedef const T *const_pointer; typedef identity_matrix self_type; public: #ifdef BOOST_UBLAS_ENABLE_PROXY_SHORTCUTS using matrix_container::operator (); #endif typedef typename ALLOC::size_type size_type; typedef typename ALLOC::difference_type difference_type; typedef T value_type; typedef const T &const_reference; typedef T &reference; typedef const matrix_reference const_closure_type; typedef matrix_reference closure_type; typedef sparse_tag storage_category; typedef unknown_orientation_tag orientation_category; // Construction and destruction BOOST_UBLAS_INLINE identity_matrix (): matrix_container (), size1_ (0), size2_ (0), size_common_ (0) {} BOOST_UBLAS_INLINE identity_matrix (size_type size): matrix_container (), size1_ (size), size2_ (size), size_common_ ((std::min) (size1_, size2_)) {} BOOST_UBLAS_INLINE identity_matrix (size_type size1, size_type size2): matrix_container (), size1_ (size1), size2_ (size2), size_common_ ((std::min) (size1_, size2_)) {} BOOST_UBLAS_INLINE identity_matrix (const identity_matrix &m): matrix_container (), size1_ (m.size1_), size2_ (m.size2_), size_common_ ((std::min) (size1_, size2_)) {} // Accessors BOOST_UBLAS_INLINE size_type size1 () const { return size1_; } BOOST_UBLAS_INLINE size_type size2 () const { return size2_; } // Resizing BOOST_UBLAS_INLINE void resize (size_type size, bool preserve = true) { size1_ = size; size2_ = size; size_common_ = ((std::min)(size1_, size2_)); } BOOST_UBLAS_INLINE void resize (size_type size1, size_type size2, bool /*preserve*/ = true) { size1_ = size1; size2_ = size2; size_common_ = ((std::min)(size1_, size2_)); } // Element access BOOST_UBLAS_INLINE const_reference operator () (size_type i, size_type j) const { if (i == j) return one_; else return zero_; } // Assignment BOOST_UBLAS_INLINE identity_matrix &operator = (const identity_matrix &m) { size1_ = m.size1_; size2_ = m.size2_; size_common_ = m.size_common_; return *this; } BOOST_UBLAS_INLINE identity_matrix &assign_temporary (identity_matrix &m) { swap (m); return *this; } // Swapping BOOST_UBLAS_INLINE void swap (identity_matrix &m) { if (this != &m) { std::swap (size1_, m.size1_); std::swap (size2_, m.size2_); std::swap (size_common_, m.size_common_); } } BOOST_UBLAS_INLINE friend void swap (identity_matrix &m1, identity_matrix &m2) { m1.swap (m2); } // Iterator types private: // Use an index typedef size_type const_subiterator_type; public: class const_iterator1; class const_iterator2; typedef reverse_iterator_base1 const_reverse_iterator1; typedef reverse_iterator_base2 const_reverse_iterator2; // Element lookup BOOST_UBLAS_INLINE const_iterator1 find1 (int rank, size_type i, size_type j) const { if (rank == 1) { i = (std::max) (i, j); i = (std::min) (i, j + 1); } return const_iterator1 (*this, i); } BOOST_UBLAS_INLINE const_iterator2 find2 (int rank, size_type i, size_type j) const { if (rank == 1) { j = (std::max) (j, i); j = (std::min) (j, i + 1); } return const_iterator2 (*this, j); } class const_iterator1: public container_const_reference, public bidirectional_iterator_base { public: typedef typename identity_matrix::value_type value_type; typedef typename identity_matrix::difference_type difference_type; typedef typename identity_matrix::const_reference reference; typedef typename identity_matrix::const_pointer pointer; typedef const_iterator2 dual_iterator_type; typedef const_reverse_iterator2 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE const_iterator1 (): container_const_reference (), it_ () {} BOOST_UBLAS_INLINE const_iterator1 (const self_type &m, const const_subiterator_type &it): container_const_reference (m), it_ (it) {} // Arithmetic BOOST_UBLAS_INLINE const_iterator1 &operator ++ () { BOOST_UBLAS_CHECK (it_ < (*this) ().size1 (), bad_index ()); ++it_; return *this; } BOOST_UBLAS_INLINE const_iterator1 &operator -- () { BOOST_UBLAS_CHECK (it_ > 0, bad_index ()); --it_; return *this; } // Dereference BOOST_UBLAS_INLINE const_reference operator * () const { return one_; } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator2 begin () const { return const_iterator2 ((*this) (), it_); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator2 end () const { return const_iterator2 ((*this) (), it_ + 1); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator2 rbegin () const { return const_reverse_iterator2 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator2 rend () const { return const_reverse_iterator2 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { return it_; } BOOST_UBLAS_INLINE size_type index2 () const { return it_; } // Assignment BOOST_UBLAS_INLINE const_iterator1 &operator = (const const_iterator1 &it) { container_const_reference::assign (&it ()); it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const const_iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ == it.it_; } private: const_subiterator_type it_; }; typedef const_iterator1 iterator1; BOOST_UBLAS_INLINE const_iterator1 begin1 () const { return const_iterator1 (*this, 0); } BOOST_UBLAS_INLINE const_iterator1 end1 () const { return const_iterator1 (*this, size_common_); } class const_iterator2: public container_const_reference, public bidirectional_iterator_base { public: typedef typename identity_matrix::value_type value_type; typedef typename identity_matrix::difference_type difference_type; typedef typename identity_matrix::const_reference reference; typedef typename identity_matrix::const_pointer pointer; typedef const_iterator1 dual_iterator_type; typedef const_reverse_iterator1 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE const_iterator2 (): container_const_reference (), it_ () {} BOOST_UBLAS_INLINE const_iterator2 (const self_type &m, const const_subiterator_type &it): container_const_reference (m), it_ (it) {} // Arithmetic BOOST_UBLAS_INLINE const_iterator2 &operator ++ () { BOOST_UBLAS_CHECK (it_ < (*this) ().size_common_, bad_index ()); ++it_; return *this; } BOOST_UBLAS_INLINE const_iterator2 &operator -- () { BOOST_UBLAS_CHECK (it_ > 0, bad_index ()); --it_; return *this; } // Dereference BOOST_UBLAS_INLINE const_reference operator * () const { return one_; } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator1 begin () const { return const_iterator1 ((*this) (), it_); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator1 end () const { return const_iterator1 ((*this) (), it_ + 1); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator1 rbegin () const { return const_reverse_iterator1 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator1 rend () const { return const_reverse_iterator1 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { return it_; } BOOST_UBLAS_INLINE size_type index2 () const { return it_; } // Assignment BOOST_UBLAS_INLINE const_iterator2 &operator = (const const_iterator2 &it) { container_const_reference::assign (&it ()); it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const const_iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ == it.it_; } private: const_subiterator_type it_; }; typedef const_iterator2 iterator2; BOOST_UBLAS_INLINE const_iterator2 begin2 () const { return const_iterator2 (*this, 0); } BOOST_UBLAS_INLINE const_iterator2 end2 () const { return const_iterator2 (*this, size_common_); } // Reverse iterators BOOST_UBLAS_INLINE const_reverse_iterator1 rbegin1 () const { return const_reverse_iterator1 (end1 ()); } BOOST_UBLAS_INLINE const_reverse_iterator1 rend1 () const { return const_reverse_iterator1 (begin1 ()); } BOOST_UBLAS_INLINE const_reverse_iterator2 rbegin2 () const { return const_reverse_iterator2 (end2 ()); } BOOST_UBLAS_INLINE const_reverse_iterator2 rend2 () const { return const_reverse_iterator2 (begin2 ()); } // Serialization template void serialize(Archive & ar, const unsigned int /* file_version */){ // we need to copy to a collection_size_type to get a portable // and efficient serialization serialization::collection_size_type s1 (size1_); serialization::collection_size_type s2 (size2_); // serialize the sizes ar & serialization::make_nvp("size1",s1) & serialization::make_nvp("size2",s2); // copy the values back if loading if (Archive::is_loading::value) { size1_ = s1; size2_ = s2; size_common_ = ((std::min)(size1_, size2_)); } } private: size_type size1_; size_type size2_; size_type size_common_; static const value_type zero_; static const value_type one_; }; template const typename identity_matrix::value_type identity_matrix::zero_ = T(/*zero*/); template const typename identity_matrix::value_type identity_matrix::one_ (1); // ISSUE: need 'one'-traits here /** \brief A matrix with all values of type \c T equal to the same value * * Changing one value has the effect of changing all the values. Assigning it to a normal matrix will copy * the same value everywhere in this matrix. All accesses are constant time, due to the trivial value. * * \tparam T the type of object stored in the matrix (like double, float, complex, etc...) * \tparam ALLOC an allocator for storing the unique value. By default, a standar allocator is used. */ template class scalar_matrix: public matrix_container > { typedef const T *const_pointer; typedef scalar_matrix self_type; public: #ifdef BOOST_UBLAS_ENABLE_PROXY_SHORTCUTS using matrix_container::operator (); #endif typedef std::size_t size_type; typedef std::ptrdiff_t difference_type; typedef T value_type; typedef const T &const_reference; typedef T &reference; typedef const matrix_reference const_closure_type; typedef matrix_reference closure_type; typedef dense_tag storage_category; typedef unknown_orientation_tag orientation_category; // Construction and destruction BOOST_UBLAS_INLINE scalar_matrix (): matrix_container (), size1_ (0), size2_ (0), value_ () {} BOOST_UBLAS_INLINE scalar_matrix (size_type size1, size_type size2, const value_type &value = value_type(1)): matrix_container (), size1_ (size1), size2_ (size2), value_ (value) {} BOOST_UBLAS_INLINE scalar_matrix (const scalar_matrix &m): matrix_container (), size1_ (m.size1_), size2_ (m.size2_), value_ (m.value_) {} // Accessors BOOST_UBLAS_INLINE size_type size1 () const { return size1_; } BOOST_UBLAS_INLINE size_type size2 () const { return size2_; } // Resizing BOOST_UBLAS_INLINE void resize (size_type size1, size_type size2, bool /*preserve*/ = true) { size1_ = size1; size2_ = size2; } // Element access BOOST_UBLAS_INLINE const_reference operator () (size_type /*i*/, size_type /*j*/) const { return value_; } // Assignment BOOST_UBLAS_INLINE scalar_matrix &operator = (const scalar_matrix &m) { size1_ = m.size1_; size2_ = m.size2_; value_ = m.value_; return *this; } BOOST_UBLAS_INLINE scalar_matrix &assign_temporary (scalar_matrix &m) { swap (m); return *this; } // Swapping BOOST_UBLAS_INLINE void swap (scalar_matrix &m) { if (this != &m) { std::swap (size1_, m.size1_); std::swap (size2_, m.size2_); std::swap (value_, m.value_); } } BOOST_UBLAS_INLINE friend void swap (scalar_matrix &m1, scalar_matrix &m2) { m1.swap (m2); } // Iterator types private: // Use an index typedef size_type const_subiterator_type; public: #ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR typedef indexed_const_iterator1 iterator1; typedef indexed_const_iterator2 iterator2; typedef indexed_const_iterator1 const_iterator1; typedef indexed_const_iterator2 const_iterator2; #else class const_iterator1; class const_iterator2; #endif typedef reverse_iterator_base1 const_reverse_iterator1; typedef reverse_iterator_base2 const_reverse_iterator2; // Element lookup BOOST_UBLAS_INLINE const_iterator1 find1 (int /*rank*/, size_type i, size_type j) const { return const_iterator1 (*this, i, j); } BOOST_UBLAS_INLINE const_iterator2 find2 (int /*rank*/, size_type i, size_type j) const { return const_iterator2 (*this, i, j); } #ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR class const_iterator1: public container_const_reference, public random_access_iterator_base { public: typedef typename scalar_matrix::value_type value_type; typedef typename scalar_matrix::difference_type difference_type; typedef typename scalar_matrix::const_reference reference; typedef typename scalar_matrix::const_pointer pointer; typedef const_iterator2 dual_iterator_type; typedef const_reverse_iterator2 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE const_iterator1 (): container_const_reference (), it1_ (), it2_ () {} BOOST_UBLAS_INLINE const_iterator1 (const scalar_matrix &m, const const_subiterator_type &it1, const const_subiterator_type &it2): container_const_reference (m), it1_ (it1), it2_ (it2) {} // Arithmetic BOOST_UBLAS_INLINE const_iterator1 &operator ++ () { ++ it1_; return *this; } BOOST_UBLAS_INLINE const_iterator1 &operator -- () { -- it1_; return *this; } BOOST_UBLAS_INLINE const_iterator1 &operator += (difference_type n) { it1_ += n; return *this; } BOOST_UBLAS_INLINE const_iterator1 &operator -= (difference_type n) { it1_ -= n; return *this; } BOOST_UBLAS_INLINE difference_type operator - (const const_iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (it2_ == it.it2_, external_logic ()); return it1_ - it.it1_; } // Dereference BOOST_UBLAS_INLINE const_reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); return (*this) () (index1 (), index2 ()); } BOOST_UBLAS_INLINE const_reference operator [] (difference_type n) const { return *(*this + n); } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator2 begin () const { const scalar_matrix &m = (*this) (); return m.find2 (1, index1 (), 0); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator2 end () const { const scalar_matrix &m = (*this) (); return m.find2 (1, index1 (), m.size2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator2 rbegin () const { return const_reverse_iterator2 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator2 rend () const { return const_reverse_iterator2 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { return it1_; } BOOST_UBLAS_INLINE size_type index2 () const { return it2_; } // Assignment BOOST_UBLAS_INLINE const_iterator1 &operator = (const const_iterator1 &it) { container_const_reference::assign (&it ()); it1_ = it.it1_; it2_ = it.it2_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const const_iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (it2_ == it.it2_, external_logic ()); return it1_ == it.it1_; } BOOST_UBLAS_INLINE bool operator < (const const_iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (it2_ == it.it2_, external_logic ()); return it1_ < it.it1_; } private: const_subiterator_type it1_; const_subiterator_type it2_; }; typedef const_iterator1 iterator1; #endif BOOST_UBLAS_INLINE const_iterator1 begin1 () const { return find1 (0, 0, 0); } BOOST_UBLAS_INLINE const_iterator1 end1 () const { return find1 (0, size1_, 0); } #ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR class const_iterator2: public container_const_reference, public random_access_iterator_base { public: typedef typename scalar_matrix::value_type value_type; typedef typename scalar_matrix::difference_type difference_type; typedef typename scalar_matrix::const_reference reference; typedef typename scalar_matrix::const_pointer pointer; typedef const_iterator1 dual_iterator_type; typedef const_reverse_iterator1 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE const_iterator2 (): container_const_reference (), it1_ (), it2_ () {} BOOST_UBLAS_INLINE const_iterator2 (const scalar_matrix &m, const const_subiterator_type &it1, const const_subiterator_type &it2): container_const_reference (m), it1_ (it1), it2_ (it2) {} // Arithmetic BOOST_UBLAS_INLINE const_iterator2 &operator ++ () { ++ it2_; return *this; } BOOST_UBLAS_INLINE const_iterator2 &operator -- () { -- it2_; return *this; } BOOST_UBLAS_INLINE const_iterator2 &operator += (difference_type n) { it2_ += n; return *this; } BOOST_UBLAS_INLINE const_iterator2 &operator -= (difference_type n) { it2_ -= n; return *this; } BOOST_UBLAS_INLINE difference_type operator - (const const_iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (it1_ == it.it1_, external_logic ()); return it2_ - it.it2_; } // Dereference BOOST_UBLAS_INLINE const_reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); return (*this) () (index1 (), index2 ()); } BOOST_UBLAS_INLINE const_reference operator [] (difference_type n) const { return *(*this + n); } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator1 begin () const { const scalar_matrix &m = (*this) (); return m.find1 (1, 0, index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator1 end () const { const scalar_matrix &m = (*this) (); return m.find1 (1, m.size1 (), index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator1 rbegin () const { return const_reverse_iterator1 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator1 rend () const { return const_reverse_iterator1 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { return it1_; } BOOST_UBLAS_INLINE size_type index2 () const { return it2_; } // Assignment BOOST_UBLAS_INLINE const_iterator2 &operator = (const const_iterator2 &it) { container_const_reference::assign (&it ()); it1_ = it.it1_; it2_ = it.it2_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const const_iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (it1_ == it.it1_, external_logic ()); return it2_ == it.it2_; } BOOST_UBLAS_INLINE bool operator < (const const_iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (it1_ == it.it1_, external_logic ()); return it2_ < it.it2_; } private: const_subiterator_type it1_; const_subiterator_type it2_; }; typedef const_iterator2 iterator2; #endif BOOST_UBLAS_INLINE const_iterator2 begin2 () const { return find2 (0, 0, 0); } BOOST_UBLAS_INLINE const_iterator2 end2 () const { return find2 (0, 0, size2_); } // Reverse iterators BOOST_UBLAS_INLINE const_reverse_iterator1 rbegin1 () const { return const_reverse_iterator1 (end1 ()); } BOOST_UBLAS_INLINE const_reverse_iterator1 rend1 () const { return const_reverse_iterator1 (begin1 ()); } BOOST_UBLAS_INLINE const_reverse_iterator2 rbegin2 () const { return const_reverse_iterator2 (end2 ()); } BOOST_UBLAS_INLINE const_reverse_iterator2 rend2 () const { return const_reverse_iterator2 (begin2 ()); } // Serialization template void serialize(Archive & ar, const unsigned int /* file_version */){ // we need to copy to a collection_size_type to get a portable // and efficient serialization serialization::collection_size_type s1 (size1_); serialization::collection_size_type s2 (size2_); // serialize the sizes ar & serialization::make_nvp("size1",s1) & serialization::make_nvp("size2",s2); // copy the values back if loading if (Archive::is_loading::value) { size1_ = s1; size2_ = s2; } ar & serialization::make_nvp("value", value_); } private: size_type size1_; size_type size2_; value_type value_; }; /** \brief An array based matrix class which size is defined at type specification or object instanciation * * This matrix is directly based on a predefined C-style arry of data, thus providing the fastest * implementation possible. The constraint is that dimensions of the matrix must be specified at * the instanciation or the type specification. * * For instance, \code typedef c_matrix my_4by4_matrix \endcode * defines a 4 by 4 double-precision matrix. You can also instantiate it directly with * \code c_matrix my_fast_matrix \endcode. This will make a 8 by 5 integer matrix. The * price to pay for this speed is that you cannot resize it to a size larger than the one defined * in the template parameters. In the previous example, a size of 4 by 5 or 3 by 2 is acceptable, * but a new size of 9 by 5 or even 10 by 10 will raise a bad_size() exception. * * \tparam T the type of object stored in the matrix (like double, float, complex, etc...) * \tparam N the default maximum number of rows * \tparam M the default maximum number of columns */ template class c_matrix: public matrix_container > { typedef c_matrix self_type; public: #ifdef BOOST_UBLAS_ENABLE_PROXY_SHORTCUTS using matrix_container::operator (); #endif typedef std::size_t size_type; typedef std::ptrdiff_t difference_type; typedef T value_type; typedef const T &const_reference; typedef T &reference; typedef const T *const_pointer; typedef T *pointer; typedef const matrix_reference const_closure_type; typedef matrix_reference closure_type; typedef c_vector vector_temporary_type; // vector able to store all elements of c_matrix typedef self_type matrix_temporary_type; typedef dense_tag storage_category; // This could be better for performance, // typedef typename unknown_orientation_tag orientation_category; // but others depend on the orientation information... typedef row_major_tag orientation_category; // Construction and destruction BOOST_UBLAS_INLINE c_matrix (): size1_ (N), size2_ (M) /* , data_ () */ { } BOOST_UBLAS_INLINE c_matrix (size_type size1, size_type size2): size1_ (size1), size2_ (size2) /* , data_ () */ { if (size1_ > N || size2_ > M) bad_size ().raise (); } BOOST_UBLAS_INLINE c_matrix (const c_matrix &m): size1_ (m.size1_), size2_ (m.size2_) /* , data_ () */ { if (size1_ > N || size2_ > M) bad_size ().raise (); assign(m); } template BOOST_UBLAS_INLINE c_matrix (const matrix_expression &ae): size1_ (ae ().size1 ()), size2_ (ae ().size2 ()) /* , data_ () */ { if (size1_ > N || size2_ > M) bad_size ().raise (); matrix_assign (*this, ae); } // Accessors BOOST_UBLAS_INLINE size_type size1 () const { return size1_; } BOOST_UBLAS_INLINE size_type size2 () const { return size2_; } BOOST_UBLAS_INLINE const_pointer data () const { return reinterpret_cast (data_); } BOOST_UBLAS_INLINE pointer data () { return reinterpret_cast (data_); } // Resizing BOOST_UBLAS_INLINE void resize (size_type size1, size_type size2, bool preserve = true) { if (size1 > N || size2 > M) bad_size ().raise (); if (preserve) { self_type temporary (size1, size2); // Common elements to preserve const size_type size1_min = (std::min) (size1, size1_); const size_type size2_min = (std::min) (size2, size2_); for (size_type i = 0; i != size1_min; ++i) { // indexing copy over major for (size_type j = 0; j != size2_min; ++j) { temporary.data_[i][j] = data_[i][j]; } } assign_temporary (temporary); } else { size1_ = size1; size2_ = size2; } } // Element access BOOST_UBLAS_INLINE const_reference operator () (size_type i, size_type j) const { BOOST_UBLAS_CHECK (i < size1_, bad_index ()); BOOST_UBLAS_CHECK (j < size2_, bad_index ()); return data_ [i] [j]; } BOOST_UBLAS_INLINE reference at_element (size_type i, size_type j) { BOOST_UBLAS_CHECK (i < size1_, bad_index ()); BOOST_UBLAS_CHECK (j < size2_, bad_index ()); return data_ [i] [j]; } BOOST_UBLAS_INLINE reference operator () (size_type i, size_type j) { return at_element (i, j); } // Element assignment BOOST_UBLAS_INLINE reference insert_element (size_type i, size_type j, const_reference t) { return (at_element (i, j) = t); } // Zeroing BOOST_UBLAS_INLINE void clear () { for (size_type i = 0; i < size1_; ++ i) std::fill (data_ [i], data_ [i] + size2_, value_type/*zero*/()); } // Assignment #ifdef BOOST_UBLAS_MOVE_SEMANTICS /*! @note "pass by value" the key idea to enable move semantics */ BOOST_UBLAS_INLINE c_matrix &operator = (c_matrix m) { assign_temporary(m); return *this; } #else BOOST_UBLAS_INLINE c_matrix &operator = (const c_matrix &m) { size1_ = m.size1_; size2_ = m.size2_; for (size_type i = 0; i < m.size1_; ++ i) std::copy (m.data_ [i], m.data_ [i] + m.size2_, data_ [i]); return *this; } #endif template // Container assignment without temporary BOOST_UBLAS_INLINE c_matrix &operator = (const matrix_container &m) { resize (m ().size1 (), m ().size2 (), false); assign (m); return *this; } BOOST_UBLAS_INLINE c_matrix &assign_temporary (c_matrix &m) { swap (m); return *this; } template BOOST_UBLAS_INLINE c_matrix &operator = (const matrix_expression &ae) { self_type temporary (ae); return assign_temporary (temporary); } template BOOST_UBLAS_INLINE c_matrix &assign (const matrix_expression &ae) { matrix_assign (*this, ae); return *this; } template BOOST_UBLAS_INLINE c_matrix& operator += (const matrix_expression &ae) { self_type temporary (*this + ae); return assign_temporary (temporary); } template // Container assignment without temporary BOOST_UBLAS_INLINE c_matrix &operator += (const matrix_container &m) { plus_assign (m); return *this; } template BOOST_UBLAS_INLINE c_matrix &plus_assign (const matrix_expression &ae) { matrix_assign (*this, ae); return *this; } template BOOST_UBLAS_INLINE c_matrix& operator -= (const matrix_expression &ae) { self_type temporary (*this - ae); return assign_temporary (temporary); } template // Container assignment without temporary BOOST_UBLAS_INLINE c_matrix &operator -= (const matrix_container &m) { minus_assign (m); return *this; } template BOOST_UBLAS_INLINE c_matrix &minus_assign (const matrix_expression &ae) { matrix_assign (*this, ae); return *this; } template BOOST_UBLAS_INLINE c_matrix& operator *= (const AT &at) { matrix_assign_scalar (*this, at); return *this; } template BOOST_UBLAS_INLINE c_matrix& operator /= (const AT &at) { matrix_assign_scalar (*this, at); return *this; } // Swapping BOOST_UBLAS_INLINE void swap (c_matrix &m) { if (this != &m) { BOOST_UBLAS_CHECK (size1_ == m.size1_, bad_size ()); BOOST_UBLAS_CHECK (size2_ == m.size2_, bad_size ()); std::swap (size1_, m.size1_); std::swap (size2_, m.size2_); for (size_type i = 0; i < size1_; ++ i) std::swap_ranges (data_ [i], data_ [i] + size2_, m.data_ [i]); } } BOOST_UBLAS_INLINE friend void swap (c_matrix &m1, c_matrix &m2) { m1.swap (m2); } // Iterator types private: // Use pointers for iterator typedef const_pointer const_subiterator_type; typedef pointer subiterator_type; public: #ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR typedef indexed_iterator1 iterator1; typedef indexed_iterator2 iterator2; typedef indexed_const_iterator1 const_iterator1; typedef indexed_const_iterator2 const_iterator2; #else class const_iterator1; class iterator1; class const_iterator2; class iterator2; #endif typedef reverse_iterator_base1 const_reverse_iterator1; typedef reverse_iterator_base1 reverse_iterator1; typedef reverse_iterator_base2 const_reverse_iterator2; typedef reverse_iterator_base2 reverse_iterator2; // Element lookup BOOST_UBLAS_INLINE const_iterator1 find1 (int rank, size_type i, size_type j) const { #ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR return const_iterator1 (*this, i, j); #else return const_iterator1 (*this, &data_ [i] [j]); #endif } BOOST_UBLAS_INLINE iterator1 find1 (int rank, size_type i, size_type j) { #ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR return iterator1 (*this, i, j); #else return iterator1 (*this, &data_ [i] [j]); #endif } BOOST_UBLAS_INLINE const_iterator2 find2 (int rank, size_type i, size_type j) const { #ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR return const_iterator2 (*this, i, j); #else return const_iterator2 (*this, &data_ [i] [j]); #endif } BOOST_UBLAS_INLINE iterator2 find2 (int rank, size_type i, size_type j) { #ifdef BOOST_UBLAS_USE_INDEXED_ITERATOR return iterator2 (*this, i, j); #else return iterator2 (*this, &data_ [i] [j]); #endif } #ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR class const_iterator1: public container_const_reference, public random_access_iterator_base { public: typedef typename c_matrix::difference_type difference_type; typedef typename c_matrix::value_type value_type; typedef typename c_matrix::const_reference reference; typedef typename c_matrix::const_pointer pointer; typedef const_iterator2 dual_iterator_type; typedef const_reverse_iterator2 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE const_iterator1 (): container_const_reference (), it_ () {} BOOST_UBLAS_INLINE const_iterator1 (const self_type &m, const const_subiterator_type &it): container_const_reference (m), it_ (it) {} BOOST_UBLAS_INLINE const_iterator1 (const iterator1 &it): container_const_reference (it ()), it_ (it.it_) {} // Arithmetic BOOST_UBLAS_INLINE const_iterator1 &operator ++ () { it_ += M; return *this; } BOOST_UBLAS_INLINE const_iterator1 &operator -- () { it_ -= M; return *this; } BOOST_UBLAS_INLINE const_iterator1 &operator += (difference_type n) { it_ += n * M; return *this; } BOOST_UBLAS_INLINE const_iterator1 &operator -= (difference_type n) { it_ -= n * M; return *this; } BOOST_UBLAS_INLINE difference_type operator - (const const_iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return (it_ - it.it_) / M; } // Dereference BOOST_UBLAS_INLINE const_reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); return *it_; } BOOST_UBLAS_INLINE const_reference operator [] (difference_type n) const { return *(*this + n); } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator2 begin () const { const self_type &m = (*this) (); return m.find2 (1, index1 (), 0); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator2 end () const { const self_type &m = (*this) (); return m.find2 (1, index1 (), m.size2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator2 rbegin () const { return const_reverse_iterator2 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator2 rend () const { return const_reverse_iterator2 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { const self_type &m = (*this) (); return (it_ - m.begin1 ().it_) / M; } BOOST_UBLAS_INLINE size_type index2 () const { const self_type &m = (*this) (); return (it_ - m.begin1 ().it_) % M; } // Assignment BOOST_UBLAS_INLINE const_iterator1 &operator = (const const_iterator1 &it) { container_const_reference::assign (&it ()); it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const const_iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ == it.it_; } BOOST_UBLAS_INLINE bool operator < (const const_iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ < it.it_; } private: const_subiterator_type it_; friend class iterator1; }; #endif BOOST_UBLAS_INLINE const_iterator1 begin1 () const { return find1 (0, 0, 0); } BOOST_UBLAS_INLINE const_iterator1 end1 () const { return find1 (0, size1_, 0); } #ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR class iterator1: public container_reference, public random_access_iterator_base { public: typedef typename c_matrix::difference_type difference_type; typedef typename c_matrix::value_type value_type; typedef typename c_matrix::reference reference; typedef typename c_matrix::pointer pointer; typedef iterator2 dual_iterator_type; typedef reverse_iterator2 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE iterator1 (): container_reference (), it_ () {} BOOST_UBLAS_INLINE iterator1 (self_type &m, const subiterator_type &it): container_reference (m), it_ (it) {} // Arithmetic BOOST_UBLAS_INLINE iterator1 &operator ++ () { it_ += M; return *this; } BOOST_UBLAS_INLINE iterator1 &operator -- () { it_ -= M; return *this; } BOOST_UBLAS_INLINE iterator1 &operator += (difference_type n) { it_ += n * M; return *this; } BOOST_UBLAS_INLINE iterator1 &operator -= (difference_type n) { it_ -= n * M; return *this; } BOOST_UBLAS_INLINE difference_type operator - (const iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return (it_ - it.it_) / M; } // Dereference BOOST_UBLAS_INLINE reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); return *it_; } BOOST_UBLAS_INLINE reference operator [] (difference_type n) const { return *(*this + n); } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator2 begin () const { self_type &m = (*this) (); return m.find2 (1, index1 (), 0); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator2 end () const { self_type &m = (*this) (); return m.find2 (1, index1 (), m.size2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator2 rbegin () const { return reverse_iterator2 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator2 rend () const { return reverse_iterator2 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { const self_type &m = (*this) (); return (it_ - m.begin1 ().it_) / M; } BOOST_UBLAS_INLINE size_type index2 () const { const self_type &m = (*this) (); return (it_ - m.begin1 ().it_) % M; } // Assignment BOOST_UBLAS_INLINE iterator1 &operator = (const iterator1 &it) { container_reference::assign (&it ()); it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ == it.it_; } BOOST_UBLAS_INLINE bool operator < (const iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ < it.it_; } private: subiterator_type it_; friend class const_iterator1; }; #endif BOOST_UBLAS_INLINE iterator1 begin1 () { return find1 (0, 0, 0); } BOOST_UBLAS_INLINE iterator1 end1 () { return find1 (0, size1_, 0); } #ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR class const_iterator2: public container_const_reference, public random_access_iterator_base { public: typedef typename c_matrix::difference_type difference_type; typedef typename c_matrix::value_type value_type; typedef typename c_matrix::const_reference reference; typedef typename c_matrix::const_reference pointer; typedef const_iterator1 dual_iterator_type; typedef const_reverse_iterator1 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE const_iterator2 (): container_const_reference (), it_ () {} BOOST_UBLAS_INLINE const_iterator2 (const self_type &m, const const_subiterator_type &it): container_const_reference (m), it_ (it) {} BOOST_UBLAS_INLINE const_iterator2 (const iterator2 &it): container_const_reference (it ()), it_ (it.it_) {} // Arithmetic BOOST_UBLAS_INLINE const_iterator2 &operator ++ () { ++ it_; return *this; } BOOST_UBLAS_INLINE const_iterator2 &operator -- () { -- it_; return *this; } BOOST_UBLAS_INLINE const_iterator2 &operator += (difference_type n) { it_ += n; return *this; } BOOST_UBLAS_INLINE const_iterator2 &operator -= (difference_type n) { it_ -= n; return *this; } BOOST_UBLAS_INLINE difference_type operator - (const const_iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ - it.it_; } // Dereference BOOST_UBLAS_INLINE const_reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); return *it_; } BOOST_UBLAS_INLINE const_reference operator [] (difference_type n) const { return *(*this + n); } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator1 begin () const { const self_type &m = (*this) (); return m.find1 (1, 0, index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_iterator1 end () const { const self_type &m = (*this) (); return m.find1 (1, m.size1 (), index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator1 rbegin () const { return const_reverse_iterator1 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif const_reverse_iterator1 rend () const { return const_reverse_iterator1 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { const self_type &m = (*this) (); return (it_ - m.begin2 ().it_) / M; } BOOST_UBLAS_INLINE size_type index2 () const { const self_type &m = (*this) (); return (it_ - m.begin2 ().it_) % M; } // Assignment BOOST_UBLAS_INLINE const_iterator2 &operator = (const const_iterator2 &it) { container_const_reference::assign (&it ()); it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const const_iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ == it.it_; } BOOST_UBLAS_INLINE bool operator < (const const_iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ < it.it_; } private: const_subiterator_type it_; friend class iterator2; }; #endif BOOST_UBLAS_INLINE const_iterator2 begin2 () const { return find2 (0, 0, 0); } BOOST_UBLAS_INLINE const_iterator2 end2 () const { return find2 (0, 0, size2_); } #ifndef BOOST_UBLAS_USE_INDEXED_ITERATOR class iterator2: public container_reference, public random_access_iterator_base { public: typedef typename c_matrix::difference_type difference_type; typedef typename c_matrix::value_type value_type; typedef typename c_matrix::reference reference; typedef typename c_matrix::pointer pointer; typedef iterator1 dual_iterator_type; typedef reverse_iterator1 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE iterator2 (): container_reference (), it_ () {} BOOST_UBLAS_INLINE iterator2 (self_type &m, const subiterator_type &it): container_reference (m), it_ (it) {} // Arithmetic BOOST_UBLAS_INLINE iterator2 &operator ++ () { ++ it_; return *this; } BOOST_UBLAS_INLINE iterator2 &operator -- () { -- it_; return *this; } BOOST_UBLAS_INLINE iterator2 &operator += (difference_type n) { it_ += n; return *this; } BOOST_UBLAS_INLINE iterator2 &operator -= (difference_type n) { it_ -= n; return *this; } BOOST_UBLAS_INLINE difference_type operator - (const iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ - it.it_; } // Dereference BOOST_UBLAS_INLINE reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); return *it_; } BOOST_UBLAS_INLINE reference operator [] (difference_type n) const { return *(*this + n); } #ifndef BOOST_UBLAS_NO_NESTED_CLASS_RELATION BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator1 begin () const { self_type &m = (*this) (); return m.find1 (1, 0, index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif iterator1 end () const { self_type &m = (*this) (); return m.find1 (1, m.size1 (), index2 ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator1 rbegin () const { return reverse_iterator1 (end ()); } BOOST_UBLAS_INLINE #ifdef BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION typename self_type:: #endif reverse_iterator1 rend () const { return reverse_iterator1 (begin ()); } #endif // Indices BOOST_UBLAS_INLINE size_type index1 () const { const self_type &m = (*this) (); return (it_ - m.begin2 ().it_) / M; } BOOST_UBLAS_INLINE size_type index2 () const { const self_type &m = (*this) (); return (it_ - m.begin2 ().it_) % M; } // Assignment BOOST_UBLAS_INLINE iterator2 &operator = (const iterator2 &it) { container_reference::assign (&it ()); it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ == it.it_; } BOOST_UBLAS_INLINE bool operator < (const iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ < it.it_; } private: subiterator_type it_; friend class const_iterator2; }; #endif BOOST_UBLAS_INLINE iterator2 begin2 () { return find2 (0, 0, 0); } BOOST_UBLAS_INLINE iterator2 end2 () { return find2 (0, 0, size2_); } // Reverse iterators BOOST_UBLAS_INLINE const_reverse_iterator1 rbegin1 () const { return const_reverse_iterator1 (end1 ()); } BOOST_UBLAS_INLINE const_reverse_iterator1 rend1 () const { return const_reverse_iterator1 (begin1 ()); } BOOST_UBLAS_INLINE reverse_iterator1 rbegin1 () { return reverse_iterator1 (end1 ()); } BOOST_UBLAS_INLINE reverse_iterator1 rend1 () { return reverse_iterator1 (begin1 ()); } BOOST_UBLAS_INLINE const_reverse_iterator2 rbegin2 () const { return const_reverse_iterator2 (end2 ()); } BOOST_UBLAS_INLINE const_reverse_iterator2 rend2 () const { return const_reverse_iterator2 (begin2 ()); } BOOST_UBLAS_INLINE reverse_iterator2 rbegin2 () { return reverse_iterator2 (end2 ()); } BOOST_UBLAS_INLINE reverse_iterator2 rend2 () { return reverse_iterator2 (begin2 ()); } // Serialization template void serialize(Archive & ar, const unsigned int /* file_version */){ // we need to copy to a collection_size_type to get a portable // and efficient serialization serialization::collection_size_type s1 (size1_); serialization::collection_size_type s2 (size2_); // serialize the sizes ar & serialization::make_nvp("size1",s1) & serialization::make_nvp("size2",s2); // copy the values back if loading if (Archive::is_loading::value) { size1_ = s1; size2_ = s2; } // could probably use make_array( &(data[0][0]), N*M ) ar & serialization::make_array(data_, N); } private: size_type size1_; size_type size2_; value_type data_ [N] [M]; }; }}} #endif madp-0.4/src/boost/boost/numeric/ublas/PaxHeaders.5405/detail0000644000000000000000000000007412717644140020763 xustar0030 atime=1463765202.461541575 30 ctime=1463765201.105552405 madp-0.4/src/boost/boost/numeric/ublas/detail/0000775000372100037210000000000012717644140021667 5ustar00fransfrans00000000000000madp-0.4/src/boost/boost/numeric/ublas/detail/PaxHeaders.5405/iterator.hpp0000644000000000000000000000007412717644140023402 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.105552405 madp-0.4/src/boost/boost/numeric/ublas/detail/iterator.hpp0000664000372100037210000014224412717644140024240 0ustar00fransfrans00000000000000// // Copyright (c) 2000-2002 // Joerg Walter, Mathias Koch // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // The authors gratefully acknowledge the support of // GeNeSys mbH & Co. KG in producing this work. // #ifndef _BOOST_UBLAS_ITERATOR_ #define _BOOST_UBLAS_ITERATOR_ #include #include namespace boost { namespace numeric { namespace ublas { /** \brief Base class of all proxy classes that contain * a (redirectable) reference to an immutable object. * * \param C the type of the container referred to */ template class container_const_reference: private nonassignable { public: typedef C container_type; BOOST_UBLAS_INLINE container_const_reference (): c_ (0) {} BOOST_UBLAS_INLINE container_const_reference (const container_type &c): c_ (&c) {} BOOST_UBLAS_INLINE const container_type &operator () () const { return *c_; } BOOST_UBLAS_INLINE container_const_reference &assign (const container_type *c) { c_ = c; return *this; } // Closure comparison BOOST_UBLAS_INLINE bool same_closure (const container_const_reference &cr) const { return c_ == cr.c_; } private: const container_type *c_; }; /** \brief Base class of all proxy classes that contain * a (redirectable) reference to a mutable object. * * \param C the type of the container referred to */ template class container_reference: private nonassignable { public: typedef C container_type; BOOST_UBLAS_INLINE container_reference (): c_ (0) {} BOOST_UBLAS_INLINE container_reference (container_type &c): c_ (&c) {} BOOST_UBLAS_INLINE container_type &operator () () const { return *c_; } BOOST_UBLAS_INLINE container_reference &assign (container_type *c) { c_ = c; return *this; } // Closure comparison BOOST_UBLAS_INLINE bool same_closure (const container_reference &cr) const { return c_ == cr.c_; } private: container_type *c_; }; /** \brief Base class of all forward iterators. * * \param IC the iterator category * \param I the derived iterator type * \param T the value type * * The forward iterator can only proceed in one direction * via the post increment operator. */ template struct forward_iterator_base: public std::iterator { typedef I derived_iterator_type; typedef T derived_value_type; // Arithmetic BOOST_UBLAS_INLINE derived_iterator_type operator ++ (int) { derived_iterator_type &d (*static_cast (this)); derived_iterator_type tmp (d); ++ d; return tmp; } BOOST_UBLAS_INLINE friend derived_iterator_type operator ++ (derived_iterator_type &d, int) { derived_iterator_type tmp (d); ++ d; return tmp; } // Comparison BOOST_UBLAS_INLINE bool operator != (const derived_iterator_type &it) const { const derived_iterator_type *d = static_cast (this); return ! (*d == it); } }; /** \brief Base class of all bidirectional iterators. * * \param IC the iterator category * \param I the derived iterator type * \param T the value type * * The bidirectional iterator can proceed in both directions * via the post increment and post decrement operator. */ template struct bidirectional_iterator_base: public std::iterator { typedef I derived_iterator_type; typedef T derived_value_type; // Arithmetic BOOST_UBLAS_INLINE derived_iterator_type operator ++ (int) { derived_iterator_type &d (*static_cast (this)); derived_iterator_type tmp (d); ++ d; return tmp; } BOOST_UBLAS_INLINE friend derived_iterator_type operator ++ (derived_iterator_type &d, int) { derived_iterator_type tmp (d); ++ d; return tmp; } BOOST_UBLAS_INLINE derived_iterator_type operator -- (int) { derived_iterator_type &d (*static_cast (this)); derived_iterator_type tmp (d); -- d; return tmp; } BOOST_UBLAS_INLINE friend derived_iterator_type operator -- (derived_iterator_type &d, int) { derived_iterator_type tmp (d); -- d; return tmp; } // Comparison BOOST_UBLAS_INLINE bool operator != (const derived_iterator_type &it) const { const derived_iterator_type *d = static_cast (this); return ! (*d == it); } }; /** \brief Base class of all random access iterators. * * \param IC the iterator category * \param I the derived iterator type * \param T the value type * \param D the difference type, default: std::ptrdiff_t * * The random access iterator can proceed in both directions * via the post increment/decrement operator or in larger steps * via the +, - and +=, -= operators. The random access iterator * is LessThan Comparable. */ template // ISSUE the default for D seems rather dangerous as it can easily be (silently) incorrect struct random_access_iterator_base: public std::iterator { typedef I derived_iterator_type; typedef T derived_value_type; typedef D derived_difference_type; /* FIXME Need to explicitly pass derived_reference_type as otherwise I undefined type or forward declared typedef typename derived_iterator_type::reference derived_reference_type; // Indexed element BOOST_UBLAS_INLINE derived_reference_type operator [] (derived_difference_type n) { return *(*this + n); } */ // Arithmetic BOOST_UBLAS_INLINE derived_iterator_type operator ++ (int) { derived_iterator_type &d (*static_cast (this)); derived_iterator_type tmp (d); ++ d; return tmp; } BOOST_UBLAS_INLINE friend derived_iterator_type operator ++ (derived_iterator_type &d, int) { derived_iterator_type tmp (d); ++ d; return tmp; } BOOST_UBLAS_INLINE derived_iterator_type operator -- (int) { derived_iterator_type &d (*static_cast (this)); derived_iterator_type tmp (d); -- d; return tmp; } BOOST_UBLAS_INLINE friend derived_iterator_type operator -- (derived_iterator_type &d, int) { derived_iterator_type tmp (d); -- d; return tmp; } BOOST_UBLAS_INLINE derived_iterator_type operator + (derived_difference_type n) const { derived_iterator_type tmp (*static_cast (this)); return tmp += n; } BOOST_UBLAS_INLINE friend derived_iterator_type operator + (const derived_iterator_type &d, derived_difference_type n) { derived_iterator_type tmp (d); return tmp += n; } BOOST_UBLAS_INLINE friend derived_iterator_type operator + (derived_difference_type n, const derived_iterator_type &d) { derived_iterator_type tmp (d); return tmp += n; } BOOST_UBLAS_INLINE derived_iterator_type operator - (derived_difference_type n) const { derived_iterator_type tmp (*static_cast (this)); return tmp -= n; } BOOST_UBLAS_INLINE friend derived_iterator_type operator - (const derived_iterator_type &d, derived_difference_type n) { derived_iterator_type tmp (d); return tmp -= n; } // Comparison BOOST_UBLAS_INLINE bool operator != (const derived_iterator_type &it) const { const derived_iterator_type *d = static_cast (this); return ! (*d == it); } BOOST_UBLAS_INLINE bool operator <= (const derived_iterator_type &it) const { const derived_iterator_type *d = static_cast (this); return ! (it < *d); } BOOST_UBLAS_INLINE bool operator >= (const derived_iterator_type &it) const { const derived_iterator_type *d = static_cast (this); return ! (*d < it); } BOOST_UBLAS_INLINE bool operator > (const derived_iterator_type &it) const { const derived_iterator_type *d = static_cast (this); return it < *d; } }; /** \brief Base class of all reverse iterators. (non-MSVC version) * * \param I the derived iterator type * \param T the value type * \param R the reference type * * The reverse iterator implements a bidirectional iterator * reversing the elements of the underlying iterator. It * implements most operators of a random access iterator. * * uBLAS extension: it.index() */ // Renamed this class from reverse_iterator to get // typedef reverse_iterator<...> reverse_iterator // working. Thanks to Gabriel Dos Reis for explaining this. template class reverse_iterator_base: public std::reverse_iterator { public: typedef typename I::container_type container_type; typedef typename container_type::size_type size_type; typedef typename I::difference_type difference_type; typedef I iterator_type; // Construction and destruction BOOST_UBLAS_INLINE reverse_iterator_base (): std::reverse_iterator () {} BOOST_UBLAS_INLINE reverse_iterator_base (const iterator_type &it): std::reverse_iterator (it) {} // Arithmetic BOOST_UBLAS_INLINE reverse_iterator_base &operator ++ () { return *this = -- this->base (); } BOOST_UBLAS_INLINE reverse_iterator_base operator ++ (int) { reverse_iterator_base tmp (*this); *this = -- this->base (); return tmp; } BOOST_UBLAS_INLINE reverse_iterator_base &operator -- () { return *this = ++ this->base (); } BOOST_UBLAS_INLINE reverse_iterator_base operator -- (int) { reverse_iterator_base tmp (*this); *this = ++ this->base (); return tmp; } BOOST_UBLAS_INLINE reverse_iterator_base &operator += (difference_type n) { return *this = this->base () - n; } BOOST_UBLAS_INLINE reverse_iterator_base &operator -= (difference_type n) { return *this = this->base () + n; } BOOST_UBLAS_INLINE friend reverse_iterator_base operator + (const reverse_iterator_base &it, difference_type n) { reverse_iterator_base tmp (it); return tmp += n; } BOOST_UBLAS_INLINE friend reverse_iterator_base operator + (difference_type n, const reverse_iterator_base &it) { reverse_iterator_base tmp (it); return tmp += n; } BOOST_UBLAS_INLINE friend reverse_iterator_base operator - (const reverse_iterator_base &it, difference_type n) { reverse_iterator_base tmp (it); return tmp -= n; } BOOST_UBLAS_INLINE friend difference_type operator - (const reverse_iterator_base &it1, const reverse_iterator_base &it2) { return it2.base () - it1.base (); } BOOST_UBLAS_INLINE const container_type &operator () () const { return this->base () (); } BOOST_UBLAS_INLINE size_type index () const { iterator_type tmp (this->base ()); return (-- tmp).index (); } }; /** \brief 1st base class of all matrix reverse iterators. (non-MSVC version) * * \param I the derived iterator type * * The reverse iterator implements a bidirectional iterator * reversing the elements of the underlying iterator. It * implements most operators of a random access iterator. * * uBLAS extension: it.index1(), it.index2() and access to * the dual iterator via begin(), end(), rbegin(), rend() */ // Renamed this class from reverse_iterator1 to get // typedef reverse_iterator1<...> reverse_iterator1 // working. Thanks to Gabriel Dos Reis for explaining this. template class reverse_iterator_base1: public std::reverse_iterator { public: typedef typename I::container_type container_type; typedef typename container_type::size_type size_type; typedef typename I::difference_type difference_type; typedef I iterator_type; typedef typename I::dual_iterator_type dual_iterator_type; typedef typename I::dual_reverse_iterator_type dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE reverse_iterator_base1 (): std::reverse_iterator () {} BOOST_UBLAS_INLINE reverse_iterator_base1 (const iterator_type &it): std::reverse_iterator (it) {} // Arithmetic BOOST_UBLAS_INLINE reverse_iterator_base1 &operator ++ () { return *this = -- this->base (); } BOOST_UBLAS_INLINE reverse_iterator_base1 operator ++ (int) { reverse_iterator_base1 tmp (*this); *this = -- this->base (); return tmp; } BOOST_UBLAS_INLINE reverse_iterator_base1 &operator -- () { return *this = ++ this->base (); } BOOST_UBLAS_INLINE reverse_iterator_base1 operator -- (int) { reverse_iterator_base1 tmp (*this); *this = ++ this->base (); return tmp; } BOOST_UBLAS_INLINE reverse_iterator_base1 &operator += (difference_type n) { return *this = this->base () - n; } BOOST_UBLAS_INLINE reverse_iterator_base1 &operator -= (difference_type n) { return *this = this->base () + n; } BOOST_UBLAS_INLINE friend reverse_iterator_base1 operator + (const reverse_iterator_base1 &it, difference_type n) { reverse_iterator_base1 tmp (it); return tmp += n; } BOOST_UBLAS_INLINE friend reverse_iterator_base1 operator + (difference_type n, const reverse_iterator_base1 &it) { reverse_iterator_base1 tmp (it); return tmp += n; } BOOST_UBLAS_INLINE friend reverse_iterator_base1 operator - (const reverse_iterator_base1 &it, difference_type n) { reverse_iterator_base1 tmp (it); return tmp -= n; } BOOST_UBLAS_INLINE friend difference_type operator - (const reverse_iterator_base1 &it1, const reverse_iterator_base1 &it2) { return it2.base () - it1.base (); } BOOST_UBLAS_INLINE const container_type &operator () () const { return this->base () (); } BOOST_UBLAS_INLINE size_type index1 () const { iterator_type tmp (this->base ()); return (-- tmp).index1 (); } BOOST_UBLAS_INLINE size_type index2 () const { iterator_type tmp (this->base ()); return (-- tmp).index2 (); } BOOST_UBLAS_INLINE dual_iterator_type begin () const { iterator_type tmp (this->base ()); return (-- tmp).begin (); } BOOST_UBLAS_INLINE dual_iterator_type end () const { iterator_type tmp (this->base ()); return (-- tmp).end (); } BOOST_UBLAS_INLINE dual_reverse_iterator_type rbegin () const { return dual_reverse_iterator_type (end ()); } BOOST_UBLAS_INLINE dual_reverse_iterator_type rend () const { return dual_reverse_iterator_type (begin ()); } }; /** \brief 2nd base class of all matrix reverse iterators. (non-MSVC version) * * \param I the derived iterator type * * The reverse iterator implements a bidirectional iterator * reversing the elements of the underlying iterator. It * implements most operators of a random access iterator. * * uBLAS extension: it.index1(), it.index2() and access to * the dual iterator via begin(), end(), rbegin(), rend() * * Note: this type is _identical_ to reverse_iterator_base1 */ // Renamed this class from reverse_iterator2 to get // typedef reverse_iterator2<...> reverse_iterator2 // working. Thanks to Gabriel Dos Reis for explaining this. template class reverse_iterator_base2: public std::reverse_iterator { public: typedef typename I::container_type container_type; typedef typename container_type::size_type size_type; typedef typename I::difference_type difference_type; typedef I iterator_type; typedef typename I::dual_iterator_type dual_iterator_type; typedef typename I::dual_reverse_iterator_type dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE reverse_iterator_base2 (): std::reverse_iterator () {} BOOST_UBLAS_INLINE reverse_iterator_base2 (const iterator_type &it): std::reverse_iterator (it) {} // Arithmetic BOOST_UBLAS_INLINE reverse_iterator_base2 &operator ++ () { return *this = -- this->base (); } BOOST_UBLAS_INLINE reverse_iterator_base2 operator ++ (int) { reverse_iterator_base2 tmp (*this); *this = -- this->base (); return tmp; } BOOST_UBLAS_INLINE reverse_iterator_base2 &operator -- () { return *this = ++ this->base (); } BOOST_UBLAS_INLINE reverse_iterator_base2 operator -- (int) { reverse_iterator_base2 tmp (*this); *this = ++ this->base (); return tmp; } BOOST_UBLAS_INLINE reverse_iterator_base2 &operator += (difference_type n) { return *this = this->base () - n; } BOOST_UBLAS_INLINE reverse_iterator_base2 &operator -= (difference_type n) { return *this = this->base () + n; } BOOST_UBLAS_INLINE friend reverse_iterator_base2 operator + (const reverse_iterator_base2 &it, difference_type n) { reverse_iterator_base2 tmp (it); return tmp += n; } BOOST_UBLAS_INLINE friend reverse_iterator_base2 operator + (difference_type n, const reverse_iterator_base2 &it) { reverse_iterator_base2 tmp (it); return tmp += n; } BOOST_UBLAS_INLINE friend reverse_iterator_base2 operator - (const reverse_iterator_base2 &it, difference_type n) { reverse_iterator_base2 tmp (it); return tmp -= n; } BOOST_UBLAS_INLINE friend difference_type operator - (const reverse_iterator_base2 &it1, const reverse_iterator_base2 &it2) { return it2.base () - it1.base (); } BOOST_UBLAS_INLINE const container_type &operator () () const { return this->base () (); } BOOST_UBLAS_INLINE size_type index1 () const { iterator_type tmp (this->base ()); return (-- tmp).index1 (); } BOOST_UBLAS_INLINE size_type index2 () const { iterator_type tmp (this->base ()); return (-- tmp).index2 (); } BOOST_UBLAS_INLINE dual_iterator_type begin () const { iterator_type tmp (this->base ()); return (-- tmp).begin (); } BOOST_UBLAS_INLINE dual_iterator_type end () const { iterator_type tmp (this->base ()); return (-- tmp).end (); } BOOST_UBLAS_INLINE dual_reverse_iterator_type rbegin () const { return dual_reverse_iterator_type (end ()); } BOOST_UBLAS_INLINE dual_reverse_iterator_type rend () const { return dual_reverse_iterator_type (begin ()); } }; /** \brief A class implementing an indexed random access iterator. * * \param C the (mutable) container type * \param IC the iterator category * * This class implements a random access iterator. The current * position is stored as the unsigned integer it_ and the * values are accessed via operator()(it_) of the container. * * uBLAS extension: index() */ template class indexed_iterator: public container_reference, public random_access_iterator_base, typename C::value_type, typename C::difference_type> { public: typedef C container_type; typedef IC iterator_category; typedef typename container_type::size_type size_type; typedef typename container_type::difference_type difference_type; typedef typename container_type::value_type value_type; typedef typename container_type::reference reference; // Construction and destruction BOOST_UBLAS_INLINE indexed_iterator (): container_reference (), it_ () {} BOOST_UBLAS_INLINE indexed_iterator (container_type &c, size_type it): container_reference (c), it_ (it) {} // Arithmetic BOOST_UBLAS_INLINE indexed_iterator &operator ++ () { ++ it_; return *this; } BOOST_UBLAS_INLINE indexed_iterator &operator -- () { -- it_; return *this; } BOOST_UBLAS_INLINE indexed_iterator &operator += (difference_type n) { it_ += n; return *this; } BOOST_UBLAS_INLINE indexed_iterator &operator -= (difference_type n) { it_ -= n; return *this; } BOOST_UBLAS_INLINE difference_type operator - (const indexed_iterator &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ - it.it_; } // Dereference BOOST_UBLAS_INLINE reference operator * () const { BOOST_UBLAS_CHECK (index () < (*this) ().size (), bad_index ()); return (*this) () (it_); } BOOST_UBLAS_INLINE reference operator [] (difference_type n) const { return *((*this) + n); } // Index BOOST_UBLAS_INLINE size_type index () const { return it_; } // Assignment BOOST_UBLAS_INLINE indexed_iterator &operator = (const indexed_iterator &it) { // FIX: ICC needs full qualification?! // assign (&it ()); container_reference::assign (&it ()); it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const indexed_iterator &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ == it.it_; } BOOST_UBLAS_INLINE bool operator < (const indexed_iterator &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ < it.it_; } private: size_type it_; }; /** \brief A class implementing an indexed random access iterator. * * \param C the (immutable) container type * \param IC the iterator category * * This class implements a random access iterator. The current * position is stored as the unsigned integer \c it_ and the * values are accessed via \c operator()(it_) of the container. * * uBLAS extension: \c index() * * Note: there is an automatic conversion from * \c indexed_iterator to \c indexed_const_iterator */ template class indexed_const_iterator: public container_const_reference, public random_access_iterator_base, typename C::value_type, typename C::difference_type> { public: typedef C container_type; typedef IC iterator_category; typedef typename container_type::size_type size_type; typedef typename container_type::difference_type difference_type; typedef typename container_type::value_type value_type; typedef typename container_type::const_reference reference; typedef indexed_iterator iterator_type; // Construction and destruction BOOST_UBLAS_INLINE indexed_const_iterator (): container_const_reference (), it_ () {} BOOST_UBLAS_INLINE indexed_const_iterator (const container_type &c, size_type it): container_const_reference (c), it_ (it) {} BOOST_UBLAS_INLINE indexed_const_iterator (const iterator_type &it): container_const_reference (it ()), it_ (it.index ()) {} // Arithmetic BOOST_UBLAS_INLINE indexed_const_iterator &operator ++ () { ++ it_; return *this; } BOOST_UBLAS_INLINE indexed_const_iterator &operator -- () { -- it_; return *this; } BOOST_UBLAS_INLINE indexed_const_iterator &operator += (difference_type n) { it_ += n; return *this; } BOOST_UBLAS_INLINE indexed_const_iterator &operator -= (difference_type n) { it_ -= n; return *this; } BOOST_UBLAS_INLINE difference_type operator - (const indexed_const_iterator &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ - it.it_; } // Dereference BOOST_UBLAS_INLINE reference operator * () const { BOOST_UBLAS_CHECK (index () < (*this) ().size (), bad_index ()); return (*this) () (it_); } BOOST_UBLAS_INLINE reference operator [] (difference_type n) const { return *((*this) + n); } // Index BOOST_UBLAS_INLINE size_type index () const { return it_; } // Assignment BOOST_UBLAS_INLINE indexed_const_iterator &operator = (const indexed_const_iterator &it) { // FIX: ICC needs full qualification?! // assign (&it ()); container_const_reference::assign (&it ()); it_ = it.it_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const indexed_const_iterator &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ == it.it_; } BOOST_UBLAS_INLINE bool operator < (const indexed_const_iterator &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); return it_ < it.it_; } private: size_type it_; friend class indexed_iterator; }; template class indexed_iterator2; /** \brief A class implementing an indexed random access iterator * of a matrix. * * \param C the (mutable) container type * \param IC the iterator category * * This class implements a random access iterator. The current * position is stored as two unsigned integers \c it1_ and \c it2_ * and the values are accessed via \c operator()(it1_, it2_) of the * container. The iterator changes the first index. * * uBLAS extension: \c index1(), \c index2() and access to the * dual iterator via \c begin(), \c end(), \c rbegin() and \c rend() * * Note: The container has to support the \code find2(rank, i, j) \endcode * method */ template class indexed_iterator1: public container_reference, public random_access_iterator_base, typename C::value_type, typename C::difference_type> { public: typedef C container_type; typedef IC iterator_category; typedef typename container_type::size_type size_type; typedef typename container_type::difference_type difference_type; typedef typename container_type::value_type value_type; typedef typename container_type::reference reference; typedef indexed_iterator2 dual_iterator_type; typedef reverse_iterator_base2 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE indexed_iterator1 (): container_reference (), it1_ (), it2_ () {} BOOST_UBLAS_INLINE indexed_iterator1 (container_type &c, size_type it1, size_type it2): container_reference (c), it1_ (it1), it2_ (it2) {} // Arithmetic BOOST_UBLAS_INLINE indexed_iterator1 &operator ++ () { ++ it1_; return *this; } BOOST_UBLAS_INLINE indexed_iterator1 &operator -- () { -- it1_; return *this; } BOOST_UBLAS_INLINE indexed_iterator1 &operator += (difference_type n) { it1_ += n; return *this; } BOOST_UBLAS_INLINE indexed_iterator1 &operator -= (difference_type n) { it1_ -= n; return *this; } BOOST_UBLAS_INLINE difference_type operator - (const indexed_iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (it2_ == it.it2_, external_logic ()); return it1_ - it.it1_; } // Dereference BOOST_UBLAS_INLINE reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); return (*this) () (it1_, it2_); } BOOST_UBLAS_INLINE reference operator [] (difference_type n) const { return *((*this) + n); } // Index BOOST_UBLAS_INLINE size_type index1 () const { return it1_; } BOOST_UBLAS_INLINE size_type index2 () const { return it2_; } BOOST_UBLAS_INLINE dual_iterator_type begin () const { return (*this) ().find2 (1, index1 (), 0); } BOOST_UBLAS_INLINE dual_iterator_type end () const { return (*this) ().find2 (1, index1 (), (*this) ().size2 ()); } BOOST_UBLAS_INLINE dual_reverse_iterator_type rbegin () const { return dual_reverse_iterator_type (end ()); } BOOST_UBLAS_INLINE dual_reverse_iterator_type rend () const { return dual_reverse_iterator_type (begin ()); } // Assignment BOOST_UBLAS_INLINE indexed_iterator1 &operator = (const indexed_iterator1 &it) { // FIX: ICC needs full qualification?! // assign (&it ()); container_reference::assign (&it ()); it1_ = it.it1_; it2_ = it.it2_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const indexed_iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (it2_ == it.it2_, external_logic ()); return it1_ == it.it1_; } BOOST_UBLAS_INLINE bool operator < (const indexed_iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (it2_ == it.it2_, external_logic ()); return it1_ < it.it1_; } private: size_type it1_; size_type it2_; }; template class indexed_const_iterator2; /** \brief A class implementing an indexed random access iterator * of a matrix. * * \param C the (immutable) container type * \param IC the iterator category * * This class implements a random access iterator. The current * position is stored as two unsigned integers \c it1_ and \c it2_ * and the values are accessed via \c operator()(it1_, it2_) of the * container. The iterator changes the first index. * * uBLAS extension: \c index1(), \c index2() and access to the * dual iterator via \c begin(), \c end(), \c rbegin() and \c rend() * * Note 1: The container has to support the find2(rank, i, j) method * * Note 2: there is an automatic conversion from * \c indexed_iterator1 to \c indexed_const_iterator1 */ template class indexed_const_iterator1: public container_const_reference, public random_access_iterator_base, typename C::value_type, typename C::difference_type> { public: typedef C container_type; typedef IC iterator_category; typedef typename container_type::size_type size_type; typedef typename container_type::difference_type difference_type; typedef typename container_type::value_type value_type; typedef typename container_type::const_reference reference; typedef indexed_iterator1 iterator_type; typedef indexed_const_iterator2 dual_iterator_type; typedef reverse_iterator_base2 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE indexed_const_iterator1 (): container_const_reference (), it1_ (), it2_ () {} BOOST_UBLAS_INLINE indexed_const_iterator1 (const container_type &c, size_type it1, size_type it2): container_const_reference (c), it1_ (it1), it2_ (it2) {} BOOST_UBLAS_INLINE indexed_const_iterator1 (const iterator_type &it): container_const_reference (it ()), it1_ (it.index1 ()), it2_ (it.index2 ()) {} // Arithmetic BOOST_UBLAS_INLINE indexed_const_iterator1 &operator ++ () { ++ it1_; return *this; } BOOST_UBLAS_INLINE indexed_const_iterator1 &operator -- () { -- it1_; return *this; } BOOST_UBLAS_INLINE indexed_const_iterator1 &operator += (difference_type n) { it1_ += n; return *this; } BOOST_UBLAS_INLINE indexed_const_iterator1 &operator -= (difference_type n) { it1_ -= n; return *this; } BOOST_UBLAS_INLINE difference_type operator - (const indexed_const_iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (it2_ == it.it2_, external_logic ()); return it1_ - it.it1_; } // Dereference BOOST_UBLAS_INLINE reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); return (*this) () (it1_, it2_); } BOOST_UBLAS_INLINE reference operator [] (difference_type n) const { return *((*this) + n); } // Index BOOST_UBLAS_INLINE size_type index1 () const { return it1_; } BOOST_UBLAS_INLINE size_type index2 () const { return it2_; } BOOST_UBLAS_INLINE dual_iterator_type begin () const { return (*this) ().find2 (1, index1 (), 0); } BOOST_UBLAS_INLINE dual_iterator_type end () const { return (*this) ().find2 (1, index1 (), (*this) ().size2 ()); } BOOST_UBLAS_INLINE dual_reverse_iterator_type rbegin () const { return dual_reverse_iterator_type (end ()); } BOOST_UBLAS_INLINE dual_reverse_iterator_type rend () const { return dual_reverse_iterator_type (begin ()); } // Assignment BOOST_UBLAS_INLINE indexed_const_iterator1 &operator = (const indexed_const_iterator1 &it) { // FIX: ICC needs full qualification?! // assign (&it ()); container_const_reference::assign (&it ()); it1_ = it.it1_; it2_ = it.it2_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const indexed_const_iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (it2_ == it.it2_, external_logic ()); return it1_ == it.it1_; } BOOST_UBLAS_INLINE bool operator < (const indexed_const_iterator1 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (it2_ == it.it2_, external_logic ()); return it1_ < it.it1_; } private: size_type it1_; size_type it2_; friend class indexed_iterator1; }; /** \brief A class implementing an indexed random access iterator * of a matrix. * * \param C the (mutable) container type * \param IC the iterator category * * This class implements a random access iterator. The current * position is stored as two unsigned integers \c it1_ and \c it2_ * and the values are accessed via \c operator()(it1_, it2_) of the * container. The iterator changes the second index. * * uBLAS extension: \c index1(), \c index2() and access to the * dual iterator via \c begin(), \c end(), \c rbegin() and \c rend() * * Note: The container has to support the find1(rank, i, j) method */ template class indexed_iterator2: public container_reference, public random_access_iterator_base, typename C::value_type, typename C::difference_type> { public: typedef C container_type; typedef IC iterator_category; typedef typename container_type::size_type size_type; typedef typename container_type::difference_type difference_type; typedef typename container_type::value_type value_type; typedef typename container_type::reference reference; typedef indexed_iterator1 dual_iterator_type; typedef reverse_iterator_base1 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE indexed_iterator2 (): container_reference (), it1_ (), it2_ () {} BOOST_UBLAS_INLINE indexed_iterator2 (container_type &c, size_type it1, size_type it2): container_reference (c), it1_ (it1), it2_ (it2) {} // Arithmetic BOOST_UBLAS_INLINE indexed_iterator2 &operator ++ () { ++ it2_; return *this; } BOOST_UBLAS_INLINE indexed_iterator2 &operator -- () { -- it2_; return *this; } BOOST_UBLAS_INLINE indexed_iterator2 &operator += (difference_type n) { it2_ += n; return *this; } BOOST_UBLAS_INLINE indexed_iterator2 &operator -= (difference_type n) { it2_ -= n; return *this; } BOOST_UBLAS_INLINE difference_type operator - (const indexed_iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (it1_ == it.it1_, external_logic ()); return it2_ - it.it2_; } // Dereference BOOST_UBLAS_INLINE reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); return (*this) () (it1_, it2_); } BOOST_UBLAS_INLINE reference operator [] (difference_type n) const { return *((*this) + n); } // Index BOOST_UBLAS_INLINE size_type index1 () const { return it1_; } BOOST_UBLAS_INLINE size_type index2 () const { return it2_; } BOOST_UBLAS_INLINE dual_iterator_type begin () const { return (*this) ().find1 (1, 0, index2 ()); } BOOST_UBLAS_INLINE dual_iterator_type end () const { return (*this) ().find1 (1, (*this) ().size1 (), index2 ()); } BOOST_UBLAS_INLINE dual_reverse_iterator_type rbegin () const { return dual_reverse_iterator_type (end ()); } BOOST_UBLAS_INLINE dual_reverse_iterator_type rend () const { return dual_reverse_iterator_type (begin ()); } // Assignment BOOST_UBLAS_INLINE indexed_iterator2 &operator = (const indexed_iterator2 &it) { // FIX: ICC needs full qualification?! // assign (&it ()); container_reference::assign (&it ()); it1_ = it.it1_; it2_ = it.it2_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const indexed_iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (it1_ == it.it1_, external_logic ()); return it2_ == it.it2_; } BOOST_UBLAS_INLINE bool operator < (const indexed_iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (it1_ == it.it1_, external_logic ()); return it2_ < it.it2_; } private: size_type it1_; size_type it2_; }; /** \brief A class implementing an indexed random access iterator * of a matrix. * * \param C the (immutable) container type * \param IC the iterator category * * This class implements a random access iterator. The current * position is stored as two unsigned integers \c it1_ and \c it2_ * and the values are accessed via \c operator()(it1_, it2_) of the * container. The iterator changes the second index. * * uBLAS extension: \c index1(), \c index2() and access to the * dual iterator via \c begin(), \c end(), \c rbegin() and \c rend() * * Note 1: The container has to support the \c find2(rank, i, j) method * * Note 2: there is an automatic conversion from * \c indexed_iterator2 to \c indexed_const_iterator2 */ template class indexed_const_iterator2: public container_const_reference, public random_access_iterator_base, typename C::value_type, typename C::difference_type> { public: typedef C container_type; typedef IC iterator_category; typedef typename container_type::size_type size_type; typedef typename container_type::difference_type difference_type; typedef typename container_type::value_type value_type; typedef typename container_type::const_reference reference; typedef indexed_iterator2 iterator_type; typedef indexed_const_iterator1 dual_iterator_type; typedef reverse_iterator_base1 dual_reverse_iterator_type; // Construction and destruction BOOST_UBLAS_INLINE indexed_const_iterator2 (): container_const_reference (), it1_ (), it2_ () {} BOOST_UBLAS_INLINE indexed_const_iterator2 (const container_type &c, size_type it1, size_type it2): container_const_reference (c), it1_ (it1), it2_ (it2) {} BOOST_UBLAS_INLINE indexed_const_iterator2 (const iterator_type &it): container_const_reference (it ()), it1_ (it.index1 ()), it2_ (it.index2 ()) {} // Arithmetic BOOST_UBLAS_INLINE indexed_const_iterator2 &operator ++ () { ++ it2_; return *this; } BOOST_UBLAS_INLINE indexed_const_iterator2 &operator -- () { -- it2_; return *this; } BOOST_UBLAS_INLINE indexed_const_iterator2 &operator += (difference_type n) { it2_ += n; return *this; } BOOST_UBLAS_INLINE indexed_const_iterator2 &operator -= (difference_type n) { it2_ -= n; return *this; } BOOST_UBLAS_INLINE difference_type operator - (const indexed_const_iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (it1_ == it.it1_, external_logic ()); return it2_ - it.it2_; } // Dereference BOOST_UBLAS_INLINE reference operator * () const { BOOST_UBLAS_CHECK (index1 () < (*this) ().size1 (), bad_index ()); BOOST_UBLAS_CHECK (index2 () < (*this) ().size2 (), bad_index ()); return (*this) () (it1_, it2_); } BOOST_UBLAS_INLINE reference operator [] (difference_type n) const { return *((*this) + n); } // Index BOOST_UBLAS_INLINE size_type index1 () const { return it1_; } BOOST_UBLAS_INLINE size_type index2 () const { return it2_; } BOOST_UBLAS_INLINE dual_iterator_type begin () const { return (*this) ().find1 (1, 0, index2 ()); } BOOST_UBLAS_INLINE dual_iterator_type end () const { return (*this) ().find1 (1, (*this) ().size1 (), index2 ()); } BOOST_UBLAS_INLINE dual_reverse_iterator_type rbegin () const { return dual_reverse_iterator_type (end ()); } BOOST_UBLAS_INLINE dual_reverse_iterator_type rend () const { return dual_reverse_iterator_type (begin ()); } // Assignment BOOST_UBLAS_INLINE indexed_const_iterator2 &operator = (const indexed_const_iterator2 &it) { // FIX: ICC needs full qualification?! // assign (&it ()); container_const_reference::assign (&it ()); it1_ = it.it1_; it2_ = it.it2_; return *this; } // Comparison BOOST_UBLAS_INLINE bool operator == (const indexed_const_iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (it1_ == it.it1_, external_logic ()); return it2_ == it.it2_; } BOOST_UBLAS_INLINE bool operator < (const indexed_const_iterator2 &it) const { BOOST_UBLAS_CHECK (&(*this) () == &it (), external_logic ()); BOOST_UBLAS_CHECK (it1_ == it.it1_, external_logic ()); return it2_ < it.it2_; } private: size_type it1_; size_type it2_; friend class indexed_iterator2; }; }}} #endif madp-0.4/src/boost/boost/numeric/ublas/detail/PaxHeaders.5405/config.hpp0000644000000000000000000000007412717644140023016 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.105552405 madp-0.4/src/boost/boost/numeric/ublas/detail/config.hpp0000664000372100037210000001737712717644140023664 0ustar00fransfrans00000000000000// // Copyright (c) 2000-2002 // Joerg Walter, Mathias Koch // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // The authors gratefully acknowledge the support of // GeNeSys mbH & Co. KG in producing this work. // #ifndef _BOOST_UBLAS_CONFIG_ #define _BOOST_UBLAS_CONFIG_ #include #include #include #include #include #include #include #include #include #include #include #include #include // Microsoft Visual C++ #if defined (BOOST_MSVC) && ! defined (BOOST_STRICT_CONFIG) // Version 6.0 and 7.0 #if BOOST_MSVC <= 1300 #define BOOST_UBLAS_UNSUPPORTED_COMPILER 1 #endif // Version 7.1 #if BOOST_MSVC == 1310 // One of these workarounds is needed for MSVC 7.1 AFAIK // (thanks to John Maddock and Martin Lauer). #if !(defined(BOOST_UBLAS_NO_NESTED_CLASS_RELATION) || defined(BOOST_UBLAS_MSVC_NESTED_CLASS_RELATION)) #define BOOST_UBLAS_NO_NESTED_CLASS_RELATION #endif #endif #endif // GNU Compiler Collection #if defined (__GNUC__) && ! defined (BOOST_STRICT_CONFIG) #if __GNUC__ >= 4 || (__GNUC__ >= 3 && __GNUC_MINOR__ >= 4) // Specified by ABI definition see GCC bug id 9982 #define BOOST_UBLAS_USEFUL_ARRAY_PLACEMENT_NEW #endif #if __GNUC__ < 3 #define BOOST_UBLAS_UNSUPPORTED_COMPILER 1 #endif #endif // Intel Compiler #if defined (BOOST_INTEL) && ! defined (BOOST_STRICT_CONFIG) #if defined (BOOST_INTEL_LINUX) && (BOOST_INTEL_LINUX >= 800) // By inspection of compiler results #define BOOST_UBLAS_USEFUL_ARRAY_PLACEMENT_NEW #endif #if (BOOST_INTEL < 700) #define BOOST_UBLAS_UNSUPPORTED_COMPILER 1 #endif // Define swap for index_pair and triple. #if (BOOST_INTEL <= 800) namespace boost { namespace numeric { namespace ublas { template class indexed_iterator; template class index_pair; template class index_triple; }}} namespace std { template inline void swap (boost::numeric::ublas::index_pair i1, boost::numeric::ublas::index_pair i2) { i1.swap (i2); } template inline void swap (boost::numeric::ublas::index_triple i1, boost::numeric::ublas::index_triple i2) { i1.swap (i2); } // iter_swap also needed for ICC on Itanium? template inline void iter_swap (boost::numeric::ublas::indexed_iterator it1, boost::numeric::ublas::indexed_iterator it2) { swap (*it1, *it2); } } #endif #endif // Comeau compiler - thanks to Kresimir Fresl #if defined (__COMO__) && ! defined (BOOST_STRICT_CONFIG) // Missing std::abs overloads for float types in are in #if defined(__LIBCOMO__) && (__LIBCOMO_VERSION__ <= 31) #include #endif #endif // PGI compiler #ifdef __PGIC__ #define BOOST_UBLAS_UNSUPPORTED_COMPILER 0 #endif // HP aCC C++ compiler #if defined (__HP_aCC) && ! defined (BOOST_STRICT_CONFIG) # if (__HP_aCC >= 60000 ) # define BOOST_UBLAS_USEFUL_ARRAY_PLACEMENT_NEW #endif #endif // SGI MIPSpro C++ compiler #if defined (__sgi) && ! defined (BOOST_STRICT_CONFIG) // Missing std::abs overloads for float types in are in // This test should be library version specific. #include #if __COMPILER_VERSION >=650 // By inspection of compiler results - thanks to Peter Schmitteckert #define BOOST_UBLAS_USEFUL_ARRAY_PLACEMENT_NEW #endif #endif // Metrowerks Codewarrior #if defined (__MWERKS__) && ! defined (BOOST_STRICT_CONFIG) // 8.x #if __MWERKS__ <= 0x3003 #define BOOST_UBLAS_UNSUPPORTED_COMPILER 1 #endif #endif // Detect other compilers with serious defects - override by defineing BOOST_UBLAS_UNSUPPORTED_COMPILER=0 #ifndef BOOST_UBLAS_UNSUPPORTED_COMPILER #if defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING) || defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) || defined(BOOST_NO_SFINAE) || defined(BOOST_NO_STDC_NAMESPACE) #define BOOST_UBLAS_UNSUPPORTED_COMPILER 1 #endif #endif // Cannot continue with an unsupported compiler #if defined(BOOST_UBLAS_UNSUPPORTED_COMPILER) && (BOOST_UBLAS_UNSUPPORTED_COMPILER != 0) #error Your compiler and/or configuration is unsupported by this verions of uBLAS. Define BOOST_UBLAS_UNSUPPORTED_COMPILER=0 to override this message. Boost 1.32.0 includes uBLAS with support for many older compilers. #endif // Enable performance options in RELEASE mode #if defined (NDEBUG) || defined (BOOST_UBLAS_NDEBUG) #ifndef BOOST_UBLAS_INLINE #define BOOST_UBLAS_INLINE inline #endif // Do not check sizes! #define BOOST_UBLAS_USE_FAST_SAME // NO runtime error checks with BOOST_UBLAS_CHECK macro #ifndef BOOST_UBLAS_CHECK_ENABLE #define BOOST_UBLAS_CHECK_ENABLE 0 #endif // NO type compatibility numeric checks #ifndef BOOST_UBLAS_TYPE_CHECK #define BOOST_UBLAS_TYPE_CHECK 0 #endif // Disable performance options in DEBUG mode #else #ifndef BOOST_UBLAS_INLINE #define BOOST_UBLAS_INLINE #endif // Enable runtime error checks with BOOST_UBLAS_CHECK macro. Check bounds etc #ifndef BOOST_UBLAS_CHECK_ENABLE #define BOOST_UBLAS_CHECK_ENABLE 1 #endif // Type compatibiltity numeric checks #ifndef BOOST_UBLAS_TYPE_CHECK #define BOOST_UBLAS_TYPE_CHECK 1 #endif #endif /* * Type compatibility checks * Control type compatibility numeric runtime checks for non dense matrices. * Require additional storage and complexity */ #if BOOST_UBLAS_TYPE_CHECK template struct disable_type_check { static bool value; }; template bool disable_type_check::value = false; #endif #ifndef BOOST_UBLAS_TYPE_CHECK_EPSILON #define BOOST_UBLAS_TYPE_CHECK_EPSILON (type_traits::type_sqrt (std::numeric_limits::epsilon ())) #endif #ifndef BOOST_UBLAS_TYPE_CHECK_MIN #define BOOST_UBLAS_TYPE_CHECK_MIN (type_traits::type_sqrt ( (std::numeric_limits::min) ())) #endif /* * General Configuration */ // Proxy shortcuts overload the alreadly heavily over used operator () //#define BOOST_UBLAS_ENABLE_PROXY_SHORTCUTS // In order to simplify debugging is is possible to simplify expression template // so they are restricted to a single operation // #define BOOST_UBLAS_SIMPLE_ET_DEBUG // Use invariant hoisting. // #define BOOST_UBLAS_USE_INVARIANT_HOISTING // Use Duff's device in element access loops // #define BOOST_UBLAS_USE_DUFF_DEVICE // Choose evaluation method for dense vectors and matrices #if !(defined(BOOST_UBLAS_USE_INDEXING) || defined(BOOST_UBLAS_USE_ITERATING)) #define BOOST_UBLAS_USE_INDEXING #endif // #define BOOST_UBLAS_ITERATOR_THRESHOLD 0 // Use indexed iterators - unsupported implementation experiment // #define BOOST_UBLAS_USE_INDEXED_ITERATOR // Alignment of bounded_array type #ifndef BOOST_UBLAS_BOUNDED_ARRAY_ALIGN #define BOOST_UBLAS_BOUNDED_ARRAY_ALIGN #endif // Enable different sparse element proxies #ifndef BOOST_UBLAS_NO_ELEMENT_PROXIES // Sparse proxies prevent reference invalidation problems in expressions such as: // a [1] = a [0] = 1 Thanks to Marc Duflot for spotting this. // #define BOOST_UBLAS_STRICT_MAP_ARRAY #define BOOST_UBLAS_STRICT_VECTOR_SPARSE #define BOOST_UBLAS_STRICT_MATRIX_SPARSE // Hermitian matrices use element proxies to allow assignment to conjugate triangle #define BOOST_UBLAS_STRICT_HERMITIAN #endif // Define to configure special settings for reference returning members // #define BOOST_UBLAS_REFERENCE_CONST_MEMBER // #define BOOST_UBLAS_PROXY_CONST_MEMBER // Include type declerations and functions #include #include #endif madp-0.4/src/boost/boost/numeric/ublas/detail/PaxHeaders.5405/definitions.hpp0000644000000000000000000000007412717644140024064 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.105552405 madp-0.4/src/boost/boost/numeric/ublas/detail/definitions.hpp0000664000372100037210000001455412717644140024724 0ustar00fransfrans00000000000000// // Copyright (c) 2000-2002 // Joerg Walter, Mathias Koch // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // The authors gratefully acknowledge the support of // GeNeSys mbH & Co. KG in producing this work. // #ifndef _BOOST_UBLAS_DEFINITIONS_ #define _BOOST_UBLAS_DEFINITIONS_ namespace boost { namespace numeric { namespace ublas { namespace detail { /* Borrowed from boost/concept_checks.hpp "inline" is used for ignore_unused_variable_warning() to make sure there is no overhead with g++. */ template inline void ignore_unused_variable_warning(const T&) {} } // namespace detail // Borrowed from Dave Abraham's noncopyable. // I believe this should be part of utility.hpp one day... namespace nonassignable_ // protection from unintended ADL { class nonassignable { protected: nonassignable () {} ~nonassignable () {} private: // emphasize the following members are private const nonassignable& operator= (const nonassignable &); }; // nonassignable } typedef nonassignable_::nonassignable nonassignable; // Assignment proxy. // Provides temporary free assigment when LHS has no alias on RHS template class noalias_proxy: private nonassignable { public: typedef typename C::closure_type closure_type; BOOST_UBLAS_INLINE noalias_proxy (C& lval): nonassignable (), lval_ (lval) {} BOOST_UBLAS_INLINE noalias_proxy (const noalias_proxy& p): nonassignable (), lval_ (p.lval_) {} template BOOST_UBLAS_INLINE closure_type &operator= (const E& e) { lval_.assign (e); return lval_; } template BOOST_UBLAS_INLINE closure_type &operator+= (const E& e) { lval_.plus_assign (e); return lval_; } template BOOST_UBLAS_INLINE closure_type &operator-= (const E& e) { lval_.minus_assign (e); return lval_; } private: closure_type lval_; }; // Improve syntax of efficient assignment where no aliases of LHS appear on the RHS // noalias(lhs) = rhs_expression template BOOST_UBLAS_INLINE noalias_proxy noalias (C& lvalue) { return noalias_proxy (lvalue); } template BOOST_UBLAS_INLINE noalias_proxy noalias (const C& lvalue) { return noalias_proxy (lvalue); } // Possible future compatible syntax where lvalue possible has an unsafe alias on the RHS // safe(lhs) = rhs_expression template BOOST_UBLAS_INLINE C& safe (C& lvalue) { return lvalue; } template BOOST_UBLAS_INLINE const C& safe (const C& lvalue) { return lvalue; } // Dimension accessors namespace dimension { // Generic accessors template struct dimension_properties {}; template<> struct dimension_properties<1> { template BOOST_UBLAS_INLINE static typename E::size_type size (const vector_expression &e) { return e ().size (); } template BOOST_UBLAS_INLINE static typename E::size_type size (const matrix_expression &e) { return e ().size1 (); } // Note: Index functions cannot deduce dependant template parameter V or M from i template BOOST_UBLAS_INLINE static typename V::size_type index (const typename V::iterator &i) { return i.index (); } template BOOST_UBLAS_INLINE static typename M::size_type index (const typename M::iterator1 &i) { return i.index1 (); } template BOOST_UBLAS_INLINE static typename M::size_type index (const typename M::iterator2 &i) { return i.index1 (); } }; template<> struct dimension_properties<2> { template BOOST_UBLAS_INLINE static typename E::size_type size (const vector_expression &) { return 1; } template BOOST_UBLAS_INLINE static typename E::size_type size (const matrix_expression &e) { return e ().size2 (); } template BOOST_UBLAS_INLINE static typename V::size_type index (const typename V::iterator &) { return 1; } template BOOST_UBLAS_INLINE static typename M::size_type index (const typename M::iterator1 &i) { return i.index2 (); } template BOOST_UBLAS_INLINE static typename M::size_type index (const typename M::iterator2 &i) { return i.index2 (); } }; template BOOST_UBLAS_INLINE typename E::size_type size (const E& e) { return dimension_properties::size (e); } template BOOST_UBLAS_INLINE typename I::container_type::size_type index (const I& i) { typedef typename I::container_type container_type; return dimension_properties::template index (i); } // Named accessors - just syntactic sugar template typename V::size_type num_elements (const V &v) { return v.size (); } template typename M::size_type num_rows (const M &m) { return m.size1 (); } template typename M::size_type num_columns (const M &m) { return m.size2 (); } template typename MV::size_type num_non_zeros (const MV &mv) { return mv.non_zeros (); } } }}} #endif madp-0.4/src/boost/boost/numeric/ublas/detail/PaxHeaders.5405/vector_assign.hpp0000644000000000000000000000007412717644140024417 xustar0030 atime=1463765180.129719935 30 ctime=1463765201.105552405 madp-0.4/src/boost/boost/numeric/ublas/detail/vector_assign.hpp0000664000372100037210000005703212717644140025255 0ustar00fransfrans00000000000000// // Copyright (c) 2000-2002 // Joerg Walter, Mathias Koch // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // The authors gratefully acknowledge the support of // GeNeSys mbH & Co. KG in producing this work. // #ifndef _BOOST_UBLAS_VECTOR_ASSIGN_ #define _BOOST_UBLAS_VECTOR_ASSIGN_ #include // scalar_assign // Required for make_conformant storage #include // Iterators based on ideas of Jeremy Siek namespace boost { namespace numeric { namespace ublas { namespace detail { // Weak equality check - useful to compare equality two arbitary vector expression results. // Since the actual expressions are unknown, we check for and arbitary error bound // on the relative error. // For a linear expression the infinity norm makes sense as we do not know how the elements will be // combined in the expression. False positive results are inevitable for arbirary expressions! template BOOST_UBLAS_INLINE bool equals (const vector_expression &e1, const vector_expression &e2, S epsilon, S min_norm) { return norm_inf (e1 - e2) < epsilon * std::max (std::max (norm_inf (e1), norm_inf (e2)), min_norm); } template BOOST_UBLAS_INLINE bool expression_type_check (const vector_expression &e1, const vector_expression &e2) { typedef typename type_traits::promote_type>::real_type real_type; return equals (e1, e2, BOOST_UBLAS_TYPE_CHECK_EPSILON, BOOST_UBLAS_TYPE_CHECK_MIN); } // Make sparse proxies conformant template // BOOST_UBLAS_INLINE This function seems to be big. So we do not let the compiler inline it. void make_conformant (V &v, const vector_expression &e) { BOOST_UBLAS_CHECK (v.size () == e ().size (), bad_size ()); typedef typename V::size_type size_type; typedef typename V::difference_type difference_type; typedef typename V::value_type value_type; // FIXME unbounded_array with push_back maybe better std::vector index; typename V::iterator it (v.begin ()); typename V::iterator it_end (v.end ()); typename E::const_iterator ite (e ().begin ()); typename E::const_iterator ite_end (e ().end ()); if (it != it_end && ite != ite_end) { size_type it_index = it.index (), ite_index = ite.index (); while (true) { difference_type compare = it_index - ite_index; if (compare == 0) { ++ it, ++ ite; if (it != it_end && ite != ite_end) { it_index = it.index (); ite_index = ite.index (); } else break; } else if (compare < 0) { increment (it, it_end, - compare); if (it != it_end) it_index = it.index (); else break; } else if (compare > 0) { if (*ite != value_type/*zero*/()) index.push_back (ite.index ()); ++ ite; if (ite != ite_end) ite_index = ite.index (); else break; } } } while (ite != ite_end) { if (*ite != value_type/*zero*/()) index.push_back (ite.index ()); ++ ite; } for (size_type k = 0; k < index.size (); ++ k) v (index [k]) = value_type/*zero*/(); } }//namespace detail // Explicitly iterating template